| blob | 74db9aef3e0c19cbbb61d1219602cd615198c678 |
1 /* C++ Parser.
2 Copyright (C) 2000-2013 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
42 \f
43 /* The lexer. */
45 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
46 and c-lex.c) and the C++ parser. */
49 {
51 };
53 /* The various kinds of non integral constant we encounter. */
55 NIC_NONE,
56 /* floating-point literal */
57 NIC_FLOAT,
58 /* %<this%> */
59 NIC_THIS,
60 /* %<__FUNCTION__%> */
61 NIC_FUNC_NAME,
62 /* %<__PRETTY_FUNCTION__%> */
63 NIC_PRETTY_FUNC,
64 /* %<__func__%> */
65 NIC_C99_FUNC,
66 /* "%<va_arg%> */
67 NIC_VA_ARG,
68 /* a cast */
69 NIC_CAST,
70 /* %<typeid%> operator */
71 NIC_TYPEID,
72 /* non-constant compound literals */
73 NIC_NCC,
74 /* a function call */
75 NIC_FUNC_CALL,
76 /* an increment */
77 NIC_INC,
78 /* an decrement */
79 NIC_DEC,
80 /* an array reference */
81 NIC_ARRAY_REF,
82 /* %<->%> */
83 NIC_ARROW,
84 /* %<.%> */
85 NIC_POINT,
86 /* the address of a label */
87 NIC_ADDR_LABEL,
88 /* %<*%> */
89 NIC_STAR,
90 /* %<&%> */
91 NIC_ADDR,
92 /* %<++%> */
93 NIC_PREINCREMENT,
94 /* %<--%> */
95 NIC_PREDECREMENT,
96 /* %<new%> */
97 NIC_NEW,
98 /* %<delete%> */
99 NIC_DEL,
100 /* calls to overloaded operators */
101 NIC_OVERLOADED,
102 /* an assignment */
103 NIC_ASSIGNMENT,
104 /* a comma operator */
105 NIC_COMMA,
106 /* a call to a constructor */
107 NIC_CONSTRUCTOR,
108 /* a transaction expression */
109 NIC_TRANSACTION
112 /* The various kinds of errors about name-lookup failing. */
114 /* NULL */
115 NLE_NULL,
116 /* is not a type */
117 NLE_TYPE,
118 /* is not a class or namespace */
119 NLE_CXX98,
120 /* is not a class, namespace, or enumeration */
121 NLE_NOT_CXX98
124 /* The various kinds of required token */
126 RT_NONE,
148 /* The type is CPP_KEYWORD */
177 RT_TRANSACTION_CANCEL /* __transaction_cancel */
180 /* Prototypes. */
186 static void cp_lexer_destroy
188 static int cp_lexer_saving_tokens
192 static void cp_lexer_get_preprocessor_token
200 static bool cp_lexer_next_token_is_not
202 static bool cp_lexer_next_token_is_keyword
206 static void cp_lexer_purge_token
208 static void cp_lexer_purge_tokens_after
210 static void cp_lexer_save_tokens
212 static void cp_lexer_commit_tokens
214 static void cp_lexer_rollback_tokens
216 static void cp_lexer_print_token
220 static void cp_lexer_start_debugging
222 static void cp_lexer_stop_debugging
228 static void cp_parser_initial_pragma
231 static tree cp_literal_operator_id
234 /* Manifest constants. */
235 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
236 #define CP_SAVED_TOKEN_STACK 5
238 /* Variables. */
240 /* The stream to which debugging output should be written. */
243 /* Nonzero if we are parsing an unevaluated operand: an operand to
244 sizeof, typeof, or alignof. */
247 /* Dump up to NUM tokens in BUFFER to FILE starting with token
248 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
249 first token in BUFFER. If NUM is 0, dump all the tokens. If
250 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
251 highlighted by surrounding it in [[ ]]. */
253 static void
257 {
274 {
277 }
282 {
289 nprinted++;
299 {
309 }
310 }
313 {
316 }
319 }
322 /* Dump all tokens in BUFFER to stderr. */
324 void
326 {
328 }
331 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
332 description for T. */
334 static void
336 {
338 {
341 }
342 }
345 /* Dump parser context C to FILE. */
347 static void
349 {
354 }
357 /* Print the stack of parsing contexts to FILE starting with FIRST. */
359 static void
361 {
367 {
370 }
371 }
374 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
376 static void
378 {
381 }
384 /* Print an unparsed function entry UF to FILE. */
386 static void
388 {
391 tree fn;
396 i++)
397 {
403 }
408 {
411 }
417 {
420 }
422 }
425 /* Print the stack of unparsed member functions S to FILE. */
427 static void
430 {
436 {
439 }
440 }
443 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
444 the given PARSER. If FILE is NULL, the output is printed on stderr. */
446 static void
448 {
460 next_token);
461 }
464 /* Dump debugging information for the given PARSER. If FILE is NULL,
465 the output is printed on stderr. */
467 void
469 {
472 expanded_location eloc;
546 }
549 /* Allocate memory for a new lexer object and return it. */
553 {
558 /* Allocate the memory. */
561 /* Initially we are not debugging. */
566 /* Create the buffer. */
570 }
573 /* Create a new main C++ lexer, the lexer that gets tokens from the
574 preprocessor. */
578 {
580 cp_token token;
582 /* It's possible that parsing the first pragma will load a PCH file,
583 which is a GC collection point. So we have to do that before
584 allocating any memory. */
589 /* Put the first token in the buffer. */
592 /* Get the remaining tokens from the preprocessor. */
594 {
597 }
606 /* Subsequent preprocessor diagnostics should use compiler
607 diagnostic functions to get the compiler source location. */
612 }
614 /* Create a new lexer whose token stream is primed with the tokens in
615 CACHE. When these tokens are exhausted, no new tokens will be read. */
619 {
624 /* We do not own the buffer. */
631 /* Initially we are not debugging. */
636 }
638 /* Frees all resources associated with LEXER. */
640 static void
642 {
646 }
648 /* Returns nonzero if debugging information should be output. */
652 {
654 }
659 {
663 }
667 {
669 }
673 {
675 }
679 {
682 else
684 }
688 {
692 }
694 /* nonzero if we are presently saving tokens. */
698 {
700 }
702 /* Store the next token from the preprocessor in *TOKEN. Return true
703 if we reach EOF. If LEXER is NULL, assume we are handling an
704 initial #pragma pch_preprocess, and thus want the lexer to return
705 processed strings. */
707 static void
709 {
712 /* Get a new token from the preprocessor. */
713 token->type
720 /* On some systems, some header files are surrounded by an
721 implicit extern "C" block. Set a flag in the token if it
722 comes from such a header. */
727 /* Check to see if this token is a keyword. */
729 {
731 {
732 /* Mark this token as a keyword. */
734 /* Record which keyword. */
736 }
737 else
738 {
742 {
743 /* Warn about the C++0x keyword (but still treat it as
744 an identifier). */
749 /* Clear out the C_RID_CODE so we don't warn about this
750 particular identifier-turned-keyword again. */
752 }
756 }
757 }
759 {
760 /* This only happens in Objective-C++; it must be a keyword. */
763 {
764 /* Replace 'class' with '@class', 'private' with '@private',
765 etc. This prevents confusion with the C++ keyword
766 'class', and makes the tokens consistent with other
767 Objective-C 'AT' keywords. For example '@class' is
768 reported as RID_AT_CLASS which is consistent with
769 '@synchronized', which is reported as
770 RID_AT_SYNCHRONIZED.
771 */
780 }
781 }
783 {
784 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
788 }
789 }
791 /* Update the globals input_location and the input file stack from TOKEN. */
794 {
796 {
798 }
799 }
801 /* Return a pointer to the next token in the token stream, but do not
802 consume it. */
806 {
808 {
812 }
814 }
816 /* Return true if the next token has the indicated TYPE. */
820 {
822 }
824 /* Return true if the next token does not have the indicated TYPE. */
828 {
830 }
832 /* Return true if the next token is the indicated KEYWORD. */
836 {
838 }
840 /* Return true if the next token is not the indicated KEYWORD. */
844 {
846 }
848 /* Return true if the next token is a keyword for a decl-specifier. */
850 static bool
852 {
857 {
858 /* auto specifier: storage-class-specifier in C++,
859 simple-type-specifier in C++0x. */
861 /* Storage classes. */
867 /* Elaborated type specifiers. */
873 /* Simple type specifiers. */
888 /* GNU extensions. */
891 /* C++0x extensions. */
898 }
899 }
901 /* Returns TRUE iff the token T begins a decltype type. */
903 static bool
905 {
908 }
910 /* Returns TRUE iff the next token begins a decltype type. */
912 static bool
914 {
917 }
919 /* Return a pointer to the Nth token in the token stream. If N is 1,
920 then this is precisely equivalent to cp_lexer_peek_token (except
921 that it is not inline). One would like to disallow that case, but
922 there is one case (cp_parser_nth_token_starts_template_id) where
923 the caller passes a variable for N and it might be 1. */
927 {
930 /* N is 1-based, not zero-based. */
941 {
944 {
947 }
951 }
954 {
957 }
960 }
962 /* Return the next token, and advance the lexer's next_token pointer
963 to point to the next non-purged token. */
967 {
973 do
974 {
977 {
980 }
982 }
987 /* Provide debugging output. */
989 {
993 }
996 }
998 /* Permanently remove the next token from the token stream, and
999 advance the next_token pointer to refer to the next non-purged
1000 token. */
1002 static void
1004 {
1013 do
1014 {
1015 tok++;
1017 {
1020 }
1021 }
1024 }
1026 /* Permanently remove all tokens after TOK, up to, but not
1027 including, the token that will be returned next by
1028 cp_lexer_peek_token. */
1030 static void
1032 {
1041 {
1046 }
1047 }
1049 /* Begin saving tokens. All tokens consumed after this point will be
1050 preserved. */
1052 static void
1054 {
1055 /* Provide debugging output. */
1060 }
1062 /* Commit to the portion of the token stream most recently saved. */
1064 static void
1066 {
1067 /* Provide debugging output. */
1072 }
1074 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1075 to the token stream. Stop saving tokens. */
1077 static void
1079 {
1080 /* Provide debugging output. */
1085 }
1087 /* Print a representation of the TOKEN on the STREAM. */
1089 static void
1091 {
1092 /* We don't use cpp_type2name here because the parser defines
1093 a few tokens of its own. */
1095 /* cpplib-defined token types */
1096 #define OP(e, s) #e,
1097 #define TK(e, s) #e,
1098 TTYPE_TABLE
1099 #undef OP
1100 #undef TK
1101 /* C++ parser token types - see "Manifest constants", above. */
1105 };
1107 /* For some tokens, print the associated data. */
1109 {
1111 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1112 For example, `struct' is mapped to an INTEGER_CST. */
1115 /* else fall through */
1133 /* If we have a name for the token, print it out. Otherwise, we
1134 simply give the numeric code. */
1137 else
1140 }
1141 }
1143 /* Start emitting debugging information. */
1145 static void
1147 {
1150 }
1152 /* Stop emitting debugging information. */
1154 static void
1156 {
1159 }
1161 /* Create a new cp_token_cache, representing a range of tokens. */
1165 {
1170 }
1172 \f
1173 /* Decl-specifiers. */
1175 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1177 static void
1179 {
1181 }
1183 /* Declarators. */
1185 /* Nothing other than the parser should be creating declarators;
1186 declarators are a semi-syntactic representation of C++ entities.
1187 Other parts of the front end that need to create entities (like
1188 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1203 /* An erroneous declarator. */
1206 /* The obstack on which declarators and related data structures are
1207 allocated. */
1210 /* Alloc BYTES from the declarator memory pool. */
1214 {
1216 }
1218 /* Allocate a declarator of the indicated KIND. Clear fields that are
1219 common to all declarators. */
1223 {
1235 }
1237 /* Make a declarator for a generalized identifier. If
1238 QUALIFYING_SCOPE is non-NULL, the identifier is
1239 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1240 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1241 is, if any. */
1245 special_function_kind sfk)
1246 {
1249 /* It is valid to write:
1251 class C { void f(); };
1252 typedef C D;
1253 void D::f();
1255 The standard is not clear about whether `typedef const C D' is
1256 legal; as of 2002-09-15 the committee is considering that
1257 question. EDG 3.0 allows that syntax. Therefore, we do as
1258 well. */
1272 }
1274 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1275 of modifiers such as const or volatile to apply to the pointer
1276 type, represented as identifiers. ATTRIBUTES represent the attributes that
1277 appertain to the pointer or reference. */
1279 cp_declarator *
1281 tree attributes)
1282 {
1290 {
1294 }
1295 else
1301 }
1303 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1304 represent the attributes that appertain to the pointer or
1305 reference. */
1307 cp_declarator *
1310 {
1318 {
1322 }
1323 else
1329 }
1331 /* Like make_pointer_declarator -- but for a pointer to a non-static
1332 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1333 appertain to the pointer or reference. */
1335 cp_declarator *
1338 tree attributes)
1339 {
1348 {
1351 }
1352 else
1358 }
1360 /* Make a declarator for the function given by TARGET, with the
1361 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1362 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1363 indicates what exceptions can be thrown. */
1365 cp_declarator *
1367 tree parms,
1368 cp_cv_quals cv_qualifiers,
1369 cp_virt_specifiers virt_specifiers,
1370 tree exception_specification,
1371 tree late_return_type)
1372 {
1383 {
1387 }
1388 else
1392 }
1394 /* Make a declarator for an array of BOUNDS elements, each of which is
1395 defined by ELEMENT. */
1397 cp_declarator *
1399 {
1406 {
1410 }
1411 else
1415 }
1417 /* Determine whether the declarator we've seen so far can be a
1418 parameter pack, when followed by an ellipsis. */
1419 static bool
1421 {
1422 /* Search for a declarator name, or any other declarator that goes
1423 after the point where the ellipsis could appear in a parameter
1424 pack. If we find any of these, then this declarator can not be
1425 made into a parameter pack. */
1428 {
1430 {
1442 }
1443 }
1446 }
1450 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1451 DECLARATOR and DEFAULT_ARGUMENT. */
1453 cp_parameter_declarator *
1456 tree default_argument)
1457 {
1465 else
1472 }
1474 /* Returns true iff DECLARATOR is a declaration for a function. */
1476 static bool
1478 {
1480 {
1488 }
1490 }
1492 /* The parser. */
1494 /* Overview
1495 --------
1497 A cp_parser parses the token stream as specified by the C++
1498 grammar. Its job is purely parsing, not semantic analysis. For
1499 example, the parser breaks the token stream into declarators,
1500 expressions, statements, and other similar syntactic constructs.
1501 It does not check that the types of the expressions on either side
1502 of an assignment-statement are compatible, or that a function is
1503 not declared with a parameter of type `void'.
1505 The parser invokes routines elsewhere in the compiler to perform
1506 semantic analysis and to build up the abstract syntax tree for the
1507 code processed.
1509 The parser (and the template instantiation code, which is, in a
1510 way, a close relative of parsing) are the only parts of the
1511 compiler that should be calling push_scope and pop_scope, or
1512 related functions. The parser (and template instantiation code)
1513 keeps track of what scope is presently active; everything else
1514 should simply honor that. (The code that generates static
1515 initializers may also need to set the scope, in order to check
1516 access control correctly when emitting the initializers.)
1518 Methodology
1519 -----------
1521 The parser is of the standard recursive-descent variety. Upcoming
1522 tokens in the token stream are examined in order to determine which
1523 production to use when parsing a non-terminal. Some C++ constructs
1524 require arbitrary look ahead to disambiguate. For example, it is
1525 impossible, in the general case, to tell whether a statement is an
1526 expression or declaration without scanning the entire statement.
1527 Therefore, the parser is capable of "parsing tentatively." When the
1528 parser is not sure what construct comes next, it enters this mode.
1529 Then, while we attempt to parse the construct, the parser queues up
1530 error messages, rather than issuing them immediately, and saves the
1531 tokens it consumes. If the construct is parsed successfully, the
1532 parser "commits", i.e., it issues any queued error messages and
1533 the tokens that were being preserved are permanently discarded.
1534 If, however, the construct is not parsed successfully, the parser
1535 rolls back its state completely so that it can resume parsing using
1536 a different alternative.
1538 Future Improvements
1539 -------------------
1541 The performance of the parser could probably be improved substantially.
1542 We could often eliminate the need to parse tentatively by looking ahead
1543 a little bit. In some places, this approach might not entirely eliminate
1544 the need to parse tentatively, but it might still speed up the average
1545 case. */
1547 /* Flags that are passed to some parsing functions. These values can
1548 be bitwise-ored together. */
1550 enum
1551 {
1552 /* No flags. */
1554 /* The construct is optional. If it is not present, then no error
1555 should be issued. */
1557 /* When parsing a type-specifier, treat user-defined type-names
1558 as non-type identifiers. */
1560 /* When parsing a type-specifier, do not try to parse a class-specifier
1561 or enum-specifier. */
1563 /* When parsing a decl-specifier-seq, only allow type-specifier or
1564 constexpr. */
1566 };
1568 /* This type is used for parameters and variables which hold
1569 combinations of the above flags. */
1572 /* The different kinds of declarators we want to parse. */
1575 {
1576 /* We want an abstract declarator. */
1577 CP_PARSER_DECLARATOR_ABSTRACT,
1578 /* We want a named declarator. */
1579 CP_PARSER_DECLARATOR_NAMED,
1580 /* We don't mind, but the name must be an unqualified-id. */
1581 CP_PARSER_DECLARATOR_EITHER
1584 /* The precedence values used to parse binary expressions. The minimum value
1585 of PREC must be 1, because zero is reserved to quickly discriminate
1586 binary operators from other tokens. */
1588 enum cp_parser_prec
1589 {
1590 PREC_NOT_OPERATOR,
1591 PREC_LOGICAL_OR_EXPRESSION,
1592 PREC_LOGICAL_AND_EXPRESSION,
1593 PREC_INCLUSIVE_OR_EXPRESSION,
1594 PREC_EXCLUSIVE_OR_EXPRESSION,
1595 PREC_AND_EXPRESSION,
1596 PREC_EQUALITY_EXPRESSION,
1597 PREC_RELATIONAL_EXPRESSION,
1598 PREC_SHIFT_EXPRESSION,
1599 PREC_ADDITIVE_EXPRESSION,
1600 PREC_MULTIPLICATIVE_EXPRESSION,
1601 PREC_PM_EXPRESSION,
1602 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1603 };
1605 /* A mapping from a token type to a corresponding tree node type, with a
1606 precedence value. */
1609 {
1610 /* The token type. */
1612 /* The corresponding tree code. */
1614 /* The precedence of this operator. */
1619 {
1620 /* Left hand side of the binary operation we are currently
1621 parsing. */
1622 tree lhs;
1623 /* Original tree code for left hand side, if it was a binary
1624 expression itself (used for -Wparentheses). */
1626 /* Tree code for the binary operation we are parsing. */
1628 /* Precedence of the binary operation we are parsing. */
1630 /* Location of the binary operation we are parsing. */
1631 location_t loc;
1634 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1635 entries because precedence levels on the stack are monotonically
1636 increasing. */
1640 /* Prototypes. */
1642 /* Constructors and destructors. */
1647 /* Class variables. */
1651 /* The operator-precedence table used by cp_parser_binary_expression.
1652 Transformed into an associative array (binops_by_token) by
1653 cp_parser_new. */
1686 };
1688 /* The same as binops, but initialized by cp_parser_new so that
1689 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1690 for speed. */
1693 /* Constructors and destructors. */
1695 /* Construct a new context. The context below this one on the stack
1696 is given by NEXT. */
1700 {
1703 /* Allocate the storage. */
1705 {
1706 /* Pull the first entry from the free list. */
1710 }
1711 else
1714 /* No errors have occurred yet in this context. */
1716 /* If this is not the bottommost context, copy information that we
1717 need from the previous context. */
1719 {
1720 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1721 expression, then we are parsing one in this context, too. */
1723 /* Thread the stack. */
1725 }
1728 }
1730 /* Managing the unparsed function queues. */
1732 #define unparsed_funs_with_default_args \
1733 parser->unparsed_queues->last ().funs_with_default_args
1734 #define unparsed_funs_with_definitions \
1735 parser->unparsed_queues->last ().funs_with_definitions
1736 #define unparsed_nsdmis \
1737 parser->unparsed_queues->last ().nsdmis
1739 static void
1741 {
1744 }
1746 static void
1748 {
1751 }
1753 /* Prototypes. */
1755 /* Constructors and destructors. */
1760 /* Routines to parse various constructs.
1762 Those that return `tree' will return the error_mark_node (rather
1763 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1764 Sometimes, they will return an ordinary node if error-recovery was
1765 attempted, even though a parse error occurred. So, to check
1766 whether or not a parse error occurred, you should always use
1767 cp_parser_error_occurred. If the construct is optional (indicated
1768 either by an `_opt' in the name of the function that does the
1769 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1770 the construct is not present. */
1772 /* Lexical conventions [gram.lex] */
1774 static tree cp_parser_identifier
1776 static tree cp_parser_string_literal
1778 static tree cp_parser_userdef_char_literal
1780 static tree cp_parser_userdef_string_literal
1782 static tree cp_parser_userdef_numeric_literal
1785 /* Basic concepts [gram.basic] */
1787 static bool cp_parser_translation_unit
1790 /* Expressions [gram.expr] */
1792 static tree cp_parser_primary_expression
1794 static tree cp_parser_id_expression
1796 static tree cp_parser_unqualified_id
1798 static tree cp_parser_nested_name_specifier_opt
1800 static tree cp_parser_nested_name_specifier
1802 static tree cp_parser_qualifying_entity
1804 static tree cp_parser_postfix_expression
1806 static tree cp_parser_postfix_open_square_expression
1808 static tree cp_parser_postfix_dot_deref_expression
1812 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1814 static void cp_parser_pseudo_destructor_name
1816 static tree cp_parser_unary_expression
1818 static enum tree_code cp_parser_unary_operator
1820 static tree cp_parser_new_expression
1824 static tree cp_parser_new_type_id
1832 static tree cp_parser_delete_expression
1834 static tree cp_parser_cast_expression
1836 static tree cp_parser_binary_expression
1838 static tree cp_parser_question_colon_clause
1840 static tree cp_parser_assignment_expression
1842 static enum tree_code cp_parser_assignment_operator_opt
1844 static tree cp_parser_expression
1846 static tree cp_parser_constant_expression
1848 static tree cp_parser_builtin_offsetof
1850 static tree cp_parser_lambda_expression
1852 static void cp_parser_lambda_introducer
1854 static bool cp_parser_lambda_declarator_opt
1856 static void cp_parser_lambda_body
1859 /* Statements [gram.stmt.stmt] */
1861 static void cp_parser_statement
1863 static void cp_parser_label_for_labeled_statement
1865 static tree cp_parser_expression_statement
1867 static tree cp_parser_compound_statement
1869 static void cp_parser_statement_seq_opt
1871 static tree cp_parser_selection_statement
1873 static tree cp_parser_condition
1875 static tree cp_parser_iteration_statement
1877 static bool cp_parser_for_init_statement
1879 static tree cp_parser_for
1881 static tree cp_parser_c_for
1883 static tree cp_parser_range_for
1885 static void do_range_for_auto_deduction
1887 static tree cp_parser_perform_range_for_lookup
1889 static tree cp_parser_range_for_member_function
1891 static tree cp_parser_jump_statement
1893 static void cp_parser_declaration_statement
1896 static tree cp_parser_implicitly_scoped_statement
1898 static void cp_parser_already_scoped_statement
1901 /* Declarations [gram.dcl.dcl] */
1903 static void cp_parser_declaration_seq_opt
1905 static void cp_parser_declaration
1907 static void cp_parser_block_declaration
1909 static void cp_parser_simple_declaration
1911 static void cp_parser_decl_specifier_seq
1913 static tree cp_parser_storage_class_specifier_opt
1915 static tree cp_parser_function_specifier_opt
1917 static tree cp_parser_type_specifier
1920 static tree cp_parser_simple_type_specifier
1922 static tree cp_parser_type_name
1924 static tree cp_parser_nonclass_name
1926 static tree cp_parser_elaborated_type_specifier
1928 static tree cp_parser_enum_specifier
1930 static void cp_parser_enumerator_list
1932 static void cp_parser_enumerator_definition
1934 static tree cp_parser_namespace_name
1936 static void cp_parser_namespace_definition
1938 static void cp_parser_namespace_body
1940 static tree cp_parser_qualified_namespace_specifier
1942 static void cp_parser_namespace_alias_definition
1944 static bool cp_parser_using_declaration
1946 static void cp_parser_using_directive
1948 static tree cp_parser_alias_declaration
1950 static void cp_parser_asm_definition
1952 static void cp_parser_linkage_specification
1954 static void cp_parser_static_assert
1956 static tree cp_parser_decltype
1959 /* Declarators [gram.dcl.decl] */
1961 static tree cp_parser_init_declarator
1962 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
1967 static enum tree_code cp_parser_ptr_operator
1969 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1971 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1973 static tree cp_parser_late_return_type_opt
1975 static tree cp_parser_declarator_id
1977 static tree cp_parser_type_id
1979 static tree cp_parser_template_type_arg
1982 static tree cp_parser_type_id_1
1984 static void cp_parser_type_specifier_seq
1986 static tree cp_parser_parameter_declaration_clause
1988 static tree cp_parser_parameter_declaration_list
1992 static tree cp_parser_default_argument
1994 static void cp_parser_function_body
1996 static tree cp_parser_initializer
1998 static tree cp_parser_initializer_clause
2000 static tree cp_parser_braced_list
2005 static bool cp_parser_ctor_initializer_opt_and_function_body
2008 /* Classes [gram.class] */
2010 static tree cp_parser_class_name
2012 static tree cp_parser_class_specifier
2014 static tree cp_parser_class_head
2016 static enum tag_types cp_parser_class_key
2018 static void cp_parser_member_specification_opt
2020 static void cp_parser_member_declaration
2022 static tree cp_parser_pure_specifier
2024 static tree cp_parser_constant_initializer
2027 /* Derived classes [gram.class.derived] */
2029 static tree cp_parser_base_clause
2031 static tree cp_parser_base_specifier
2034 /* Special member functions [gram.special] */
2036 static tree cp_parser_conversion_function_id
2038 static tree cp_parser_conversion_type_id
2042 static bool cp_parser_ctor_initializer_opt
2044 static void cp_parser_mem_initializer_list
2046 static tree cp_parser_mem_initializer
2048 static tree cp_parser_mem_initializer_id
2051 /* Overloading [gram.over] */
2053 static tree cp_parser_operator_function_id
2055 static tree cp_parser_operator
2058 /* Templates [gram.temp] */
2060 static void cp_parser_template_declaration
2062 static tree cp_parser_template_parameter_list
2064 static tree cp_parser_template_parameter
2066 static tree cp_parser_type_parameter
2068 static tree cp_parser_template_id
2070 static tree cp_parser_template_name
2072 static tree cp_parser_template_argument_list
2074 static tree cp_parser_template_argument
2076 static void cp_parser_explicit_instantiation
2078 static void cp_parser_explicit_specialization
2081 /* Exception handling [gram.exception] */
2083 static tree cp_parser_try_block
2085 static bool cp_parser_function_try_block
2087 static void cp_parser_handler_seq
2089 static void cp_parser_handler
2091 static tree cp_parser_exception_declaration
2093 static tree cp_parser_throw_expression
2095 static tree cp_parser_exception_specification_opt
2097 static tree cp_parser_type_id_list
2100 /* GNU Extensions */
2102 static tree cp_parser_asm_specification_opt
2104 static tree cp_parser_asm_operand_list
2106 static tree cp_parser_asm_clobber_list
2108 static tree cp_parser_asm_label_list
2110 static bool cp_next_tokens_can_be_attribute_p
2112 static bool cp_next_tokens_can_be_gnu_attribute_p
2114 static bool cp_next_tokens_can_be_std_attribute_p
2116 static bool cp_nth_tokens_can_be_std_attribute_p
2118 static bool cp_nth_tokens_can_be_gnu_attribute_p
2120 static bool cp_nth_tokens_can_be_attribute_p
2122 static tree cp_parser_attributes_opt
2124 static tree cp_parser_gnu_attributes_opt
2126 static tree cp_parser_gnu_attribute_list
2128 static tree cp_parser_std_attribute
2130 static tree cp_parser_std_attribute_spec
2132 static tree cp_parser_std_attribute_spec_seq
2134 static bool cp_parser_extension_opt
2136 static void cp_parser_label_declaration
2139 /* Transactional Memory Extensions */
2141 static tree cp_parser_transaction
2143 static tree cp_parser_transaction_expression
2145 static bool cp_parser_function_transaction
2147 static tree cp_parser_transaction_cancel
2151 static bool cp_parser_pragma
2154 /* Objective-C++ Productions */
2156 static tree cp_parser_objc_message_receiver
2158 static tree cp_parser_objc_message_args
2160 static tree cp_parser_objc_message_expression
2162 static tree cp_parser_objc_encode_expression
2164 static tree cp_parser_objc_defs_expression
2166 static tree cp_parser_objc_protocol_expression
2168 static tree cp_parser_objc_selector_expression
2170 static tree cp_parser_objc_expression
2172 static bool cp_parser_objc_selector_p
2174 static tree cp_parser_objc_selector
2176 static tree cp_parser_objc_protocol_refs_opt
2178 static void cp_parser_objc_declaration
2180 static tree cp_parser_objc_statement
2182 static bool cp_parser_objc_valid_prefix_attributes
2184 static void cp_parser_objc_at_property_declaration
2186 static void cp_parser_objc_at_synthesize_declaration
2188 static void cp_parser_objc_at_dynamic_declaration
2190 static tree cp_parser_objc_struct_declaration
2193 /* Utility Routines */
2195 static tree cp_parser_lookup_name
2197 static tree cp_parser_lookup_name_simple
2199 static tree cp_parser_maybe_treat_template_as_class
2201 static bool cp_parser_check_declarator_template_parameters
2203 static bool cp_parser_check_template_parameters
2205 static tree cp_parser_simple_cast_expression
2207 static tree cp_parser_global_scope_opt
2209 static bool cp_parser_constructor_declarator_p
2211 static tree cp_parser_function_definition_from_specifiers_and_declarator
2213 static tree cp_parser_function_definition_after_declarator
2215 static void cp_parser_template_declaration_after_export
2217 static void cp_parser_perform_template_parameter_access_checks
2219 static tree cp_parser_single_declaration
2221 static tree cp_parser_functional_cast
2223 static tree cp_parser_save_member_function_body
2225 static tree cp_parser_save_nsdmi
2227 static tree cp_parser_enclosed_template_argument_list
2229 static void cp_parser_save_default_args
2231 static void cp_parser_late_parsing_for_member
2233 static tree cp_parser_late_parse_one_default_arg
2235 static void cp_parser_late_parsing_nsdmi
2237 static void cp_parser_late_parsing_default_args
2239 static tree cp_parser_sizeof_operand
2241 static tree cp_parser_trait_expr
2243 static bool cp_parser_declares_only_class_p
2245 static void cp_parser_set_storage_class
2247 static void cp_parser_set_decl_spec_type
2249 static void set_and_check_decl_spec_loc
2252 static bool cp_parser_friend_p
2254 static void cp_parser_required_error
2260 static bool cp_parser_token_starts_function_definition_p
2262 static bool cp_parser_next_token_starts_class_definition_p
2264 static bool cp_parser_next_token_ends_template_argument_p
2266 static bool cp_parser_nth_token_starts_template_argument_list_p
2268 static enum tag_types cp_parser_token_is_class_key
2270 static void cp_parser_check_class_key
2272 static void cp_parser_check_access_in_redeclaration
2274 static bool cp_parser_optional_template_keyword
2276 static void cp_parser_pre_parsed_nested_name_specifier
2278 static bool cp_parser_cache_group
2280 static tree cp_parser_cache_defarg
2282 static void cp_parser_parse_tentatively
2284 static void cp_parser_commit_to_tentative_parse
2286 static void cp_parser_abort_tentative_parse
2288 static bool cp_parser_parse_definitely
2292 static bool cp_parser_uncommitted_to_tentative_parse_p
2294 static void cp_parser_error
2296 static void cp_parser_name_lookup_error
2298 static bool cp_parser_simulate_error
2300 static bool cp_parser_check_type_definition
2302 static void cp_parser_check_for_definition_in_return_type
2304 static void cp_parser_check_for_invalid_template_id
2306 static bool cp_parser_non_integral_constant_expression
2308 static void cp_parser_diagnose_invalid_type_name
2310 static bool cp_parser_parse_and_diagnose_invalid_type_name
2312 static int cp_parser_skip_to_closing_parenthesis
2314 static void cp_parser_skip_to_end_of_statement
2316 static void cp_parser_consume_semicolon_at_end_of_statement
2318 static void cp_parser_skip_to_end_of_block_or_statement
2320 static bool cp_parser_skip_to_closing_brace
2322 static void cp_parser_skip_to_end_of_template_parameter_list
2324 static void cp_parser_skip_to_pragma_eol
2326 static bool cp_parser_error_occurred
2328 static bool cp_parser_allow_gnu_extensions_p
2330 static bool cp_parser_is_pure_string_literal
2332 static bool cp_parser_is_string_literal
2334 static bool cp_parser_is_keyword
2336 static tree cp_parser_make_typename_type
2341 /* Returns nonzero if we are parsing tentatively. */
2345 {
2347 }
2349 /* Returns nonzero if TOKEN is a string literal. */
2351 static bool
2353 {
2359 }
2361 /* Returns nonzero if TOKEN is a string literal
2362 of a user-defined string literal. */
2364 static bool
2366 {
2373 }
2375 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2377 static bool
2379 {
2381 }
2383 /* If not parsing tentatively, issue a diagnostic of the form
2384 FILE:LINE: MESSAGE before TOKEN
2385 where TOKEN is the next token in the input stream. MESSAGE
2386 (specified by the caller) is usually of the form "expected
2387 OTHER-TOKEN". */
2389 static void
2391 {
2393 {
2395 /* This diagnostic makes more sense if it is tagged to the line
2396 of the token we just peeked at. */
2400 {
2405 }
2408 /* Because c_parser_error does not understand
2409 CPP_KEYWORD, keywords are treated like
2410 identifiers. */
2413 }
2414 }
2416 /* Issue an error about name-lookup failing. NAME is the
2417 IDENTIFIER_NODE DECL is the result of
2418 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2419 the thing that we hoped to find. */
2421 static void
2423 tree name,
2424 tree decl,
2425 name_lookup_error desired,
2426 location_t location)
2427 {
2428 /* If name lookup completely failed, tell the user that NAME was not
2429 declared. */
2431 {
2444 else
2446 }
2448 {
2450 {
2467 }
2468 }
2470 {
2472 {
2482 name);
2486 }
2487 }
2488 else
2489 {
2491 {
2504 }
2505 }
2506 }
2508 /* If we are parsing tentatively, remember that an error has occurred
2509 during this tentative parse. Returns true if the error was
2510 simulated; false if a message should be issued by the caller. */
2512 static bool
2514 {
2516 {
2519 }
2521 }
2523 /* This function is called when a type is defined. If type
2524 definitions are forbidden at this point, an error message is
2525 issued. */
2527 static bool
2529 {
2530 /* If types are forbidden here, issue a message. */
2532 {
2533 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2534 in the message need to be interpreted. */
2537 }
2539 }
2541 /* This function is called when the DECLARATOR is processed. The TYPE
2542 was a type defined in the decl-specifiers. If it is invalid to
2543 define a type in the decl-specifiers for DECLARATOR, an error is
2544 issued. TYPE_LOCATION is the location of TYPE and is used
2545 for error reporting. */
2547 static void
2550 {
2551 /* [dcl.fct] forbids type definitions in return types.
2552 Unfortunately, it's not easy to know whether or not we are
2553 processing a return type until after the fact. */
2561 {
2566 type);
2567 }
2568 }
2570 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2571 "<" in any valid C++ program. If the next token is indeed "<",
2572 issue a message warning the user about what appears to be an
2573 invalid attempt to form a template-id. LOCATION is the location
2574 of the type-specifier (TYPE) */
2576 static void
2578 tree type,
2580 location_t location)
2581 {
2585 {
2589 {
2592 else
2594 }
2595 else
2597 /* Remember the location of the invalid "<". */
2600 /* Consume the "<". */
2602 /* Parse the template arguments. */
2604 /* Permanently remove the invalid template arguments so that
2605 this error message is not issued again. */
2608 }
2609 }
2611 /* If parsing an integral constant-expression, issue an error message
2612 about the fact that THING appeared and return true. Otherwise,
2613 return false. In either case, set
2614 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2616 static bool
2618 non_integral_constant thing)
2619 {
2622 {
2624 {
2627 {
2634 "enumeration type cannot appear in a "
2725 }
2729 }
2730 }
2732 }
2734 /* Emit a diagnostic for an invalid type name. SCOPE is the
2735 qualifying scope (or NULL, if none) for ID. This function commits
2736 to the current active tentative parse, if any. (Otherwise, the
2737 problematic construct might be encountered again later, resulting
2738 in duplicate error messages.) LOCATION is the location of ID. */
2740 static void
2743 location_t location)
2744 {
2747 /* Try to lookup the identifier. */
2752 /* If the lookup found a template-name, it means that the user forgot
2753 to specify an argument list. Emit a useful error message. */
2757 decl);
2761 /* Something like 'unsigned A a;' */
2764 {
2765 /* Issue an error message. */
2767 /* If we're in a template class, it's possible that the user was
2768 referring to a type from a base class. For example:
2770 template <typename T> struct A { typedef T X; };
2771 template <typename T> struct B : public A<T> { X x; };
2773 The user should have said "typename A<T>::X". */
2779 {
2780 tree b;
2783 b;
2785 {
2789 {
2790 tree field;
2791 /* Go from a particular instantiation of the
2792 template (which will have an empty TYPE_FIELDs),
2793 to the main version. */
2796 field;
2800 {
2805 }
2808 }
2809 }
2810 }
2811 }
2812 /* Here we diagnose qualified-ids where the scope is actually correct,
2813 but the identifier does not resolve to a valid type name. */
2815 {
2821 {
2822 /* A<T>::A<T>() */
2828 }
2837 else
2839 }
2840 }
2842 /* Check for a common situation where a type-name should be present,
2843 but is not, and issue a sensible error message. Returns true if an
2844 invalid type-name was detected.
2846 The situation handled by this function are variable declarations of the
2847 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2848 Usually, `ID' should name a type, but if we got here it means that it
2849 does not. We try to emit the best possible error message depending on
2850 how exactly the id-expression looks like. */
2852 static bool
2854 {
2855 tree id;
2858 /* Avoid duplicate error about ambiguous lookup. */
2860 {
2864 }
2873 /* If the next token is a (, this is a function with no explicit return
2874 type, i.e. constructor, destructor or conversion op. */
2877 {
2880 }
2884 /* Emit a diagnostic for the invalid type. */
2887 out:
2888 /* If we aren't in the middle of a declarator (i.e. in a
2889 parameter-declaration-clause), skip to the end of the declaration;
2890 there's no point in trying to process it. */
2894 }
2896 /* Consume tokens up to, and including, the next non-nested closing `)'.
2897 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2898 are doing error recovery. Returns -1 if OR_COMMA is true and we
2899 found an unnested comma. */
2901 static int
2906 {
2916 {
2920 {
2923 /* If we've run out of tokens, then there is no closing `)'. */
2926 /* This is good for lambda expression capture-lists. */
2936 /* This matches the processing in skip_to_end_of_statement. */
2962 {
2966 }
2971 }
2973 /* Consume the token. */
2975 }
2976 }
2978 /* Consume tokens until we reach the end of the current statement.
2979 Normally, that will be just before consuming a `;'. However, if a
2980 non-nested `}' comes first, then we stop before consuming that. */
2982 static void
2984 {
2988 {
2992 {
2995 /* If we've run out of tokens, stop. */
2999 /* If the next token is a `;', we have reached the end of the
3000 statement. */
3006 /* If this is a non-nested '}', stop before consuming it.
3007 That way, when confronted with something like:
3009 { 3 + }
3011 we stop before consuming the closing '}', even though we
3012 have not yet reached a `;'. */
3016 /* If it is the closing '}' for a block that we have
3017 scanned, stop -- but only after consuming the token.
3018 That way given:
3020 void f g () { ... }
3021 typedef int I;
3023 we will stop after the body of the erroneously declared
3024 function, but before consuming the following `typedef'
3025 declaration. */
3027 {
3030 }
3038 }
3040 /* Consume the token. */
3042 }
3043 }
3045 /* This function is called at the end of a statement or declaration.
3046 If the next token is a semicolon, it is consumed; otherwise, error
3047 recovery is attempted. */
3049 static void
3051 {
3052 /* Look for the trailing `;'. */
3054 {
3055 /* If there is additional (erroneous) input, skip to the end of
3056 the statement. */
3058 /* If the next token is now a `;', consume it. */
3061 }
3062 }
3064 /* Skip tokens until we have consumed an entire block, or until we
3065 have consumed a non-nested `;'. */
3067 static void
3069 {
3073 {
3077 {
3080 /* If we've run out of tokens, stop. */
3084 /* Stop if this is an unnested ';'. */
3090 /* Stop if this is an unnested '}', or closes the outermost
3091 nesting level. */
3092 nesting_depth--;
3100 /* Nest. */
3101 nesting_depth++;
3106 }
3108 /* Consume the token. */
3110 }
3111 }
3113 /* Skip tokens until a non-nested closing curly brace is the next
3114 token, or there are no more tokens. Return true in the first case,
3115 false otherwise. */
3117 static bool
3119 {
3123 {
3127 {
3130 /* If we've run out of tokens, stop. */
3134 /* If the next token is a non-nested `}', then we have reached
3135 the end of the current block. */
3141 /* If it the next token is a `{', then we are entering a new
3142 block. Consume the entire block. */
3148 }
3150 /* Consume the token. */
3152 }
3153 }
3155 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3156 parameter is the PRAGMA token, allowing us to purge the entire pragma
3157 sequence. */
3159 static void
3161 {
3166 do
3170 /* Ensure that the pragma is not parsed again. */
3172 }
3174 /* Require pragma end of line, resyncing with it as necessary. The
3175 arguments are as for cp_parser_skip_to_pragma_eol. */
3177 static void
3179 {
3183 }
3185 /* This is a simple wrapper around make_typename_type. When the id is
3186 an unresolved identifier node, we can provide a superior diagnostic
3187 using cp_parser_diagnose_invalid_type_name. */
3189 static tree
3192 {
3193 tree result;
3195 {
3201 }
3203 }
3205 /* This is a wrapper around the
3206 make_{pointer,ptrmem,reference}_declarator functions that decides
3207 which one to call based on the CODE and CLASS_TYPE arguments. The
3208 CODE argument should be one of the values returned by
3209 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3210 appertain to the pointer or reference. */
3214 cp_cv_quals cv_qualifiers,
3216 tree attributes)
3217 {
3224 else
3234 }
3236 /* Create a new C++ parser. */
3240 {
3245 /* cp_lexer_new_main is called before doing GC allocation because
3246 cp_lexer_new_main might load a PCH file. */
3249 /* Initialize the binops_by_token so that we can get the tree
3250 directly from the token. */
3258 /* For now, we always accept GNU extensions. */
3261 /* The `>' token is a greater-than operator, not the end of a
3262 template-id. */
3267 /* We are not parsing a constant-expression. */
3272 /* Local variable names are not forbidden. */
3275 /* We are not processing an `extern "C"' declaration. */
3278 /* We are not processing a declarator. */
3281 /* We are not processing a template-argument-list. */
3284 /* We are not in an iteration statement. */
3287 /* We are not in a switch statement. */
3290 /* We are not parsing a type-id inside an expression. */
3293 /* Declarations aren't implicitly extern "C". */
3296 /* String literals should be translated to the execution character set. */
3299 /* We are not parsing a function body. */
3302 /* We can correct until told otherwise. */
3305 /* The unparsed function queue is empty. */
3308 /* There are no classes being defined. */
3311 /* No template parameters apply. */
3315 }
3317 /* Create a cp_lexer structure which will emit the tokens in CACHE
3318 and push it onto the parser's lexer stack. This is used for delayed
3319 parsing of in-class method bodies and default arguments, and should
3320 not be confused with tentative parsing. */
3321 static void
3323 {
3328 /* Move the current source position to that of the first token in the
3329 new lexer. */
3331 }
3333 /* Pop the top lexer off the parser stack. This is never used for the
3334 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3335 static void
3337 {
3342 /* Put the current source position back where it was before this
3343 lexer was pushed. */
3345 }
3347 /* Lexical conventions [gram.lex] */
3349 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3350 identifier. */
3352 static tree
3354 {
3357 /* Look for the identifier. */
3359 /* Return the value. */
3361 }
3363 /* Parse a sequence of adjacent string constants. Returns a
3364 TREE_STRING representing the combined, nul-terminated string
3365 constant. If TRANSLATE is true, translate the string to the
3366 execution character set. If WIDE_OK is true, a wide string is
3367 invalid here.
3369 C++98 [lex.string] says that if a narrow string literal token is
3370 adjacent to a wide string literal token, the behavior is undefined.
3371 However, C99 6.4.5p4 says that this results in a wide string literal.
3372 We follow C99 here, for consistency with the C front end.
3374 This code is largely lifted from lex_string() in c-lex.c.
3376 FUTURE: ObjC++ will need to handle @-strings here. */
3377 static tree
3379 {
3380 tree value;
3387 tree string_tree;
3393 {
3396 }
3399 {
3403 }
3404 else
3405 {
3408 }
3411 /* Try to avoid the overhead of creating and destroying an obstack
3412 for the common case of just one string. */
3415 {
3423 {
3427 }
3428 else
3432 }
3433 else
3434 {
3438 do
3439 {
3441 count++;
3446 {
3449 {
3452 }
3455 {
3460 }
3462 }
3463 else
3467 {
3472 "unsupported non-standard concatenation "
3474 }
3480 {
3484 }
3485 else
3486 {
3490 }
3491 }
3495 }
3498 {
3501 }
3505 {
3510 {
3525 }
3530 {
3535 }
3536 }
3537 else
3538 /* cpp_interpret_string has issued an error. */
3545 }
3547 /* Look up a literal operator with the name and the exact arguments. */
3549 static tree
3551 {
3558 {
3565 {
3568 {
3578 }
3581 /* May be this should be sufficient_parms_p instead,
3582 depending on how exactly should user-defined literals
3583 work in presence of default arguments on the literal
3584 operator parameters. */
3587 }
3588 }
3591 }
3593 /* Parse a user-defined char constant. Returns a call to a user-defined
3594 literal operator taking the character as an argument. */
3596 static tree
3598 {
3606 /* Build up a call to the user-defined operator */
3607 /* Lookup the name we got back from the id-expression. */
3612 {
3617 }
3626 }
3628 /* A subroutine of cp_parser_userdef_numeric_literal to
3629 create a char... template parameter pack from a string node. */
3631 static tree
3633 {
3634 tree charvec;
3640 /* Fill in CHARVEC with all of the parameters. */
3645 /* Build the argument packs. */
3652 }
3654 /* Parse a user-defined numeric constant. returns a call to a user-defined
3655 literal operator. */
3657 static tree
3659 {
3670 /* Look for a literal operator taking the exact type of numeric argument
3671 as the literal value. */
3676 {
3679 {
3683 long_long_unsigned_type_node);
3684 else
3685 {
3689 long_double_type_node);
3693 }
3696 }
3697 }
3700 /* If the numeric argument didn't work, look for a raw literal
3701 operator taking a const char* argument consisting of the number
3702 in string format. */
3707 {
3710 {
3713 }
3714 }
3717 /* If the raw literal didn't work, look for a non-type template
3718 function with parameter pack char.... Call the function with
3719 template parameter characters representing the number. */
3723 {
3728 {
3731 }
3732 }
3737 }
3739 /* Parse a user-defined string constant. Returns a call to a user-defined
3740 literal operator taking a character pointer and the length of the string
3741 as arguments. */
3743 static tree
3745 {
3754 /* Build up a call to the user-defined operator */
3755 /* Lookup the name we got back from the id-expression. */
3761 {
3765 }
3774 }
3777 /* Basic concepts [gram.basic] */
3779 /* Parse a translation-unit.
3781 translation-unit:
3782 declaration-seq [opt]
3784 Returns TRUE if all went well. */
3786 static bool
3788 {
3789 /* The address of the first non-permanent object on the declarator
3790 obstack. */
3795 /* Create the declarator obstack, if necessary. */
3797 {
3799 /* Create the error declarator. */
3801 /* Create the empty parameter list. */
3803 /* Remember where the base of the declarator obstack lies. */
3805 }
3809 /* If there are no tokens left then all went well. */
3811 {
3812 /* Get rid of the token array; we don't need it any more. */
3816 /* This file might have been a context that's implicitly extern
3817 "C". If so, pop the lang context. (Only relevant for PCH.) */
3819 {
3822 }
3824 /* Finish up. */
3828 }
3829 else
3830 {
3833 }
3835 /* Make sure the declarator obstack was fully cleaned up. */
3839 /* All went well. */
3841 }
3843 /* Expressions [gram.expr] */
3845 /* Parse a primary-expression.
3847 primary-expression:
3848 literal
3849 this
3850 ( expression )
3851 id-expression
3853 GNU Extensions:
3855 primary-expression:
3856 ( compound-statement )
3857 __builtin_va_arg ( assignment-expression , type-id )
3858 __builtin_offsetof ( type-id , offsetof-expression )
3860 C++ Extensions:
3861 __has_nothrow_assign ( type-id )
3862 __has_nothrow_constructor ( type-id )
3863 __has_nothrow_copy ( type-id )
3864 __has_trivial_assign ( type-id )
3865 __has_trivial_constructor ( type-id )
3866 __has_trivial_copy ( type-id )
3867 __has_trivial_destructor ( type-id )
3868 __has_virtual_destructor ( type-id )
3869 __is_abstract ( type-id )
3870 __is_base_of ( type-id , type-id )
3871 __is_class ( type-id )
3872 __is_convertible_to ( type-id , type-id )
3873 __is_empty ( type-id )
3874 __is_enum ( type-id )
3875 __is_final ( type-id )
3876 __is_literal_type ( type-id )
3877 __is_pod ( type-id )
3878 __is_polymorphic ( type-id )
3879 __is_std_layout ( type-id )
3880 __is_trivial ( type-id )
3881 __is_union ( type-id )
3883 Objective-C++ Extension:
3885 primary-expression:
3886 objc-expression
3888 literal:
3889 __null
3891 ADDRESS_P is true iff this expression was immediately preceded by
3892 "&" and therefore might denote a pointer-to-member. CAST_P is true
3893 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3894 true iff this expression is a template argument.
3896 Returns a representation of the expression. Upon return, *IDK
3897 indicates what kind of id-expression (if any) was present. */
3899 static tree
3905 {
3908 /* Assume the primary expression is not an id-expression. */
3911 /* Peek at the next token. */
3914 {
3915 /* literal:
3916 integer-literal
3917 character-literal
3918 floating-literal
3919 string-literal
3920 boolean-literal
3921 pointer-literal
3922 user-defined-literal */
3932 {
3936 }
3937 /* Floating-point literals are only allowed in an integral
3938 constant expression if they are cast to an integral or
3939 enumeration type. */
3943 {
3944 /* CAST_P will be set even in invalid code like "int(2.7 +
3945 ...)". Therefore, we have to check that the next token
3946 is sure to end the cast. */
3948 {
3953 enumerator-definition. */
3955 /* The curly brace at the end of an enum-specifier. */
3957 /* The end of a statement. */
3959 /* The end of the cast-expression. */
3961 /* The end of an array bound. */
3963 /* The closing ">" in a template-argument-list. */
3966 /* C++0x only: A ">>" treated like two ">" tokens,
3967 in a template-argument-list. */
3972 }
3974 /* If we are within a cast, then the constraint that the
3975 cast is to an integral or enumeration type will be
3976 checked at that point. If we are not within a cast, then
3977 this code is invalid. */
3980 }
3999 /* ??? Should wide strings be allowed when parser->translate_strings_p
4000 is false (i.e. in attributes)? If not, we can kill the third
4001 argument to cp_parser_string_literal. */
4007 {
4008 tree expr;
4011 /* Consume the `('. */
4013 /* Within a parenthesized expression, a `>' token is always
4014 the greater-than operator. */
4015 saved_greater_than_is_operator_p
4018 /* If we see `( { ' then we are looking at the beginning of
4019 a GNU statement-expression. */
4022 {
4023 /* Statement-expressions are not allowed by the standard. */
4027 /* And they're not allowed outside of a function-body; you
4028 cannot, for example, write:
4030 int i = ({ int j = 3; j + 1; });
4032 at class or namespace scope. */
4035 {
4037 "statement-expressions are not allowed outside "
4041 }
4042 else
4043 {
4044 /* Start the statement-expression. */
4046 /* Parse the compound-statement. */
4048 /* Finish up. */
4050 }
4051 }
4052 else
4053 {
4054 /* Parse the parenthesized expression. */
4056 /* Let the front end know that this expression was
4057 enclosed in parentheses. This matters in case, for
4058 example, the expression is of the form `A::B', since
4059 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4060 not. */
4062 /* DR 705: Wrapping an unqualified name in parentheses
4063 suppresses arg-dependent lookup. We want to pass back
4064 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4065 (c++/37862), but none of the others. */
4068 }
4069 /* The `>' token might be the end of a template-id or
4070 template-parameter-list now. */
4071 parser->greater_than_is_operator_p
4073 /* Consume the `)'. */
4078 }
4082 /* We have an Objective-C++ message. */
4084 {
4086 /* Don't warn about a failed tentative parse. */
4091 }
4095 /* We have an Objective-C++ string literal. */
4102 {
4103 /* These two are the boolean literals. */
4111 /* The `__null' literal. */
4116 /* The `nullptr' literal. */
4121 /* Recognize the `this' keyword. */
4125 {
4129 }
4130 /* Pointers cannot appear in constant-expressions. */
4135 /* The `operator' keyword can be the beginning of an
4136 id-expression. */
4143 {
4144 non_integral_constant name;
4146 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4147 __func__ are the names of variables -- but they are
4148 treated specially. Therefore, they are handled here,
4149 rather than relying on the generic id-expression logic
4150 below. Grammatically, these names are id-expressions.
4152 Consume the token. */
4156 {
4168 }
4173 /* Look up the name. */
4175 }
4178 {
4179 tree expression;
4180 tree type;
4181 source_location type_location;
4183 /* The `__builtin_va_arg' construct is used to handle
4184 `va_arg'. Consume the `__builtin_va_arg' token. */
4186 /* Look for the opening `('. */
4188 /* Now, parse the assignment-expression. */
4191 /* Look for the `,'. */
4194 /* Parse the type-id. */
4196 /* Look for the closing `)'. */
4198 /* Using `va_arg' in a constant-expression is not
4199 allowed. */
4201 NIC_VA_ARG))
4204 }
4232 /* Objective-C++ expressions. */
4242 {
4247 }
4251 }
4253 /* An id-expression can start with either an identifier, a
4254 `::' as the beginning of a qualified-id, or the "operator"
4255 keyword. */
4260 {
4261 tree id_expression;
4262 tree decl;
4268 id_expression:
4269 /* Parse the id-expression. */
4270 id_expression
4287 /* If we have a template-id, then no further lookup is
4288 required. If the template-id was for a template-class, we
4289 will sometimes have a TYPE_DECL at this point. */
4293 /* Look up the name. */
4294 else
4295 {
4296 tree ambiguous_decls;
4298 /* If we already know that this lookup is ambiguous, then
4299 we've already issued an error message; there's no reason
4300 to check again. */
4303 {
4306 }
4309 none_type,
4310 template_p,
4315 /* If the lookup was ambiguous, an error will already have
4316 been issued. */
4320 /* In Objective-C++, we may have an Objective-C 2.0
4321 dot-syntax for classes here. */
4326 {
4327 tree component;
4334 }
4336 /* In Objective-C++, an instance variable (ivar) may be preferred
4337 to whatever cp_parser_lookup_name() found. */
4340 /* If name lookup gives us a SCOPE_REF, then the
4341 qualifying scope was dependent. */
4343 {
4344 /* At this point, we do not know if DECL is a valid
4345 integral constant expression. We assume that it is
4346 in fact such an expression, so that code like:
4348 template <int N> struct A {
4349 int a[B<N>::i];
4350 };
4352 is accepted. At template-instantiation time, we
4353 will check that B<N>::i is actually a constant. */
4355 }
4356 /* Check to see if DECL is a local variable in a context
4357 where that is forbidden. */
4360 {
4361 /* It might be that we only found DECL because we are
4362 trying to be generous with pre-ISO scoping rules.
4363 For example, consider:
4365 int i;
4366 void g() {
4367 for (int i = 0; i < 10; ++i) {}
4368 extern void f(int j = i);
4369 }
4371 Here, name look up will originally find the out
4372 of scope `i'. We need to issue a warning message,
4373 but then use the global `i'. */
4376 {
4379 decl);
4381 }
4382 }
4383 }
4385 decl = (finish_id_expression
4387 idk,
4392 template_arg_p,
4398 }
4400 /* Anything else is an error. */
4404 }
4405 }
4407 /* Parse an id-expression.
4409 id-expression:
4410 unqualified-id
4411 qualified-id
4413 qualified-id:
4414 :: [opt] nested-name-specifier template [opt] unqualified-id
4415 :: identifier
4416 :: operator-function-id
4417 :: template-id
4419 Return a representation of the unqualified portion of the
4420 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4421 a `::' or nested-name-specifier.
4423 Often, if the id-expression was a qualified-id, the caller will
4424 want to make a SCOPE_REF to represent the qualified-id. This
4425 function does not do this in order to avoid wastefully creating
4426 SCOPE_REFs when they are not required.
4428 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4429 `template' keyword.
4431 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4432 uninstantiated templates.
4434 If *TEMPLATE_P is non-NULL, it is set to true iff the
4435 `template' keyword is used to explicitly indicate that the entity
4436 named is a template.
4438 If DECLARATOR_P is true, the id-expression is appearing as part of
4439 a declarator, rather than as part of an expression. */
4441 static tree
4448 {
4452 /* Assume the `template' keyword was not used. */
4456 /* Look for the optional `::' operator. */
4457 global_scope_p
4460 /* Look for the optional nested-name-specifier. */
4461 nested_name_specifier_p
4464 check_dependency_p,
4466 declarator_p)
4468 /* If there is a nested-name-specifier, then we are looking at
4469 the first qualified-id production. */
4471 {
4472 tree saved_scope;
4473 tree saved_object_scope;
4474 tree saved_qualifying_scope;
4475 tree unqualified_id;
4478 /* See if the next token is the `template' keyword. */
4482 /* Name lookup we do during the processing of the
4483 unqualified-id might obliterate SCOPE. */
4487 /* Process the final unqualified-id. */
4489 check_dependency_p,
4490 declarator_p,
4492 /* Restore the SAVED_SCOPE for our caller. */
4498 }
4499 /* Otherwise, if we are in global scope, then we are looking at one
4500 of the other qualified-id productions. */
4502 {
4504 tree id;
4506 /* Peek at the next token. */
4509 /* If it's an identifier, and the next token is not a "<", then
4510 we can avoid the template-id case. This is an optimization
4511 for this common case. */
4513 && !cp_parser_nth_token_starts_template_argument_list_p
4518 /* Try a template-id. */
4522 none_type,
4523 declarator_p);
4524 /* If that worked, we're done. */
4528 /* Peek at the next token. (Changes in the token buffer may
4529 have invalidated the pointer obtained above.) */
4533 {
4540 /* Fall through. */
4545 }
4546 }
4547 else
4550 declarator_p,
4551 optional_p);
4552 }
4554 /* Parse an unqualified-id.
4556 unqualified-id:
4557 identifier
4558 operator-function-id
4559 conversion-function-id
4560 ~ class-name
4561 template-id
4563 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4564 keyword, in a construct like `A::template ...'.
4566 Returns a representation of unqualified-id. For the `identifier'
4567 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4568 production a BIT_NOT_EXPR is returned; the operand of the
4569 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4570 other productions, see the documentation accompanying the
4571 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4572 names are looked up in uninstantiated templates. If DECLARATOR_P
4573 is true, the unqualified-id is appearing as part of a declarator,
4574 rather than as part of an expression. */
4576 static tree
4582 {
4585 /* Peek at the next token. */
4589 {
4591 {
4592 tree id;
4594 /* We don't know yet whether or not this will be a
4595 template-id. */
4597 /* Try a template-id. */
4599 check_dependency_p,
4600 none_type,
4601 declarator_p);
4602 /* If it worked, we're done. */
4605 /* Otherwise, it's an ordinary identifier. */
4607 }
4611 check_dependency_p,
4612 none_type,
4613 declarator_p);
4616 {
4617 tree type_decl;
4618 tree qualifying_scope;
4619 tree object_scope;
4620 tree scope;
4623 /* Consume the `~' token. */
4625 /* Parse the class-name. The standard, as written, seems to
4626 say that:
4628 template <typename T> struct S { ~S (); };
4629 template <typename T> S<T>::~S() {}
4631 is invalid, since `~' must be followed by a class-name, but
4632 `S<T>' is dependent, and so not known to be a class.
4633 That's not right; we need to look in uninstantiated
4634 templates. A further complication arises from:
4636 template <typename T> void f(T t) {
4637 t.T::~T();
4638 }
4640 Here, it is not possible to look up `T' in the scope of `T'
4641 itself. We must look in both the current scope, and the
4642 scope of the containing complete expression.
4644 Yet another issue is:
4646 struct S {
4647 int S;
4648 ~S();
4649 };
4651 S::~S() {}
4653 The standard does not seem to say that the `S' in `~S'
4654 should refer to the type `S' and not the data member
4655 `S::S'. */
4657 /* DR 244 says that we look up the name after the "~" in the
4658 same scope as we looked up the qualifying name. That idea
4659 isn't fully worked out; it's more complicated than that. */
4664 /* Check for invalid scopes. */
4666 {
4670 }
4672 {
4676 scope);
4681 }
4684 /* If the name is of the form "X::~X" it's OK even if X is a
4685 typedef. */
4694 {
4697 }
4699 /* If there was an explicit qualification (S::~T), first look
4700 in the scope given by the qualification (i.e., S).
4702 Note: in the calls to cp_parser_class_name below we pass
4703 typename_type so that lookup finds the injected-class-name
4704 rather than the constructor. */
4708 {
4713 typename_type,
4716 declarator_p);
4719 }
4720 /* In "N::S::~S", look in "N" as well. */
4722 {
4727 type_decl
4731 typename_type,
4734 declarator_p);
4737 }
4738 /* In "p->S::~T", look in the scope given by "*p" as well. */
4740 {
4745 type_decl
4749 typename_type,
4752 declarator_p);
4755 }
4756 /* Look in the surrounding context. */
4758 {
4764 type_decl
4768 typename_type,
4771 declarator_p);
4774 {
4775 /* We couldn't find a type with this name, so just accept
4776 it and check for a match at instantiation time. */
4781 }
4782 }
4783 /* If an error occurred, assume that the name of the
4784 destructor is the same as the name of the qualifying
4785 class. That allows us to keep parsing after running
4786 into ill-formed destructor names. */
4792 /* Check that destructor name and scope match. */
4794 {
4801 }
4803 /* [class.dtor]
4805 A typedef-name that names a class shall not be used as the
4806 identifier in the declarator for a destructor declaration. */
4813 type_decl);
4816 }
4820 {
4821 tree id;
4823 /* This could be a template-id, so we try that first. */
4825 /* Try a template-id. */
4828 none_type,
4829 declarator_p);
4830 /* If that worked, we're done. */
4833 /* We still don't know whether we're looking at an
4834 operator-function-id or a conversion-function-id. */
4836 /* Try an operator-function-id. */
4838 /* If that didn't work, try a conversion-function-id. */
4842 {
4843 /* 17.6.3.3.5 */
4848 }
4851 }
4852 /* Fall through. */
4859 }
4860 }
4862 /* Parse an (optional) nested-name-specifier.
4864 nested-name-specifier: [C++98]
4865 class-or-namespace-name :: nested-name-specifier [opt]
4866 class-or-namespace-name :: template nested-name-specifier [opt]
4868 nested-name-specifier: [C++0x]
4869 type-name ::
4870 namespace-name ::
4871 nested-name-specifier identifier ::
4872 nested-name-specifier template [opt] simple-template-id ::
4874 PARSER->SCOPE should be set appropriately before this function is
4875 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4876 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4877 in name lookups.
4879 Sets PARSER->SCOPE to the class (TYPE) or namespace
4880 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4881 it unchanged if there is no nested-name-specifier. Returns the new
4882 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4884 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4885 part of a declaration and/or decl-specifier. */
4887 static tree
4893 {
4898 /* Remember where the nested-name-specifier starts. */
4900 {
4903 }
4906 {
4907 tree new_scope;
4908 tree old_scope;
4909 tree saved_qualifying_scope;
4912 /* Spot cases that cannot be the beginning of a
4913 nested-name-specifier. */
4916 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4917 the already parsed nested-name-specifier. */
4919 {
4920 /* Grab the nested-name-specifier and continue the loop. */
4922 /* If we originally encountered this nested-name-specifier
4923 with IS_DECLARATION set to false, we will not have
4924 resolved TYPENAME_TYPEs, so we must do so here. */
4927 {
4932 }
4935 }
4937 /* Spot cases that cannot be the beginning of a
4938 nested-name-specifier. On the second and subsequent times
4939 through the loop, we look for the `template' keyword. */
4941 ;
4942 /* A template-id can start a nested-name-specifier. */
4944 ;
4945 /* DR 743: decltype can be used in a nested-name-specifier. */
4947 ;
4948 else
4949 {
4950 /* If the next token is not an identifier, then it is
4951 definitely not a type-name or namespace-name. */
4954 /* If the following token is neither a `<' (to begin a
4955 template-id), nor a `::', then we are not looking at a
4956 nested-name-specifier. */
4962 {
4966 }
4969 && !cp_parser_nth_token_starts_template_argument_list_p
4972 }
4974 /* The nested-name-specifier is optional, so we parse
4975 tentatively. */
4978 /* Look for the optional `template' keyword, if this isn't the
4979 first time through the loop. */
4982 else
4985 /* Save the old scope since the name lookup we are about to do
4986 might destroy it. */
4989 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4990 look up names in "X<T>::I" in order to determine that "Y" is
4991 a template. So, if we have a typename at this point, we make
4992 an effort to look through it. */
4994 && !typename_keyword_p
4999 /* Parse the qualifying entity. */
5000 new_scope
5002 typename_keyword_p,
5003 template_keyword_p,
5004 check_dependency_p,
5005 type_p,
5006 is_declaration);
5007 /* Look for the `::' token. */
5010 /* If we found what we wanted, we keep going; otherwise, we're
5011 done. */
5013 {
5016 /* Restore the OLD_SCOPE since it was valid before the
5017 failed attempt at finding the last
5018 class-or-namespace-name. */
5022 /* If the next token is a decltype, and the one after that is a
5023 `::', then the decltype has failed to resolve to a class or
5024 enumeration type. Give this error even when parsing
5025 tentatively since it can't possibly be valid--and we're going
5026 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5027 won't get another chance.*/
5031 {
5038 /* As below. */
5041 }
5045 /* If the next token is an identifier, and the one after
5046 that is a `::', then any valid interpretation would have
5047 found a class-or-namespace-name. */
5053 {
5056 {
5058 {
5059 tree decl;
5060 tree ambiguous_decls;
5063 none_type,
5072 decl);
5074 {
5080 }
5081 else
5082 {
5084 cp_parser_name_lookup_error
5087 else
5088 cp_parser_name_lookup_error
5091 }
5092 }
5095 /* Treat this as a successful nested-name-specifier
5096 due to:
5098 [basic.lookup.qual]
5100 If the name found is not a class-name (clause
5101 _class_) or namespace-name (_namespace.def_), the
5102 program is ill-formed. */
5104 }
5106 }
5108 }
5109 /* We've found one valid nested-name-specifier. */
5111 /* Name lookup always gives us a DECL. */
5114 /* Uses of "template" must be followed by actual templates. */
5126 new_scope);
5127 /* If it is a class scope, try to complete it; we are about to
5128 be looking up names inside the class. */
5130 /* Since checking types for dependency can be expensive,
5131 avoid doing it if the type is already complete. */
5133 /* Do not try to complete dependent types. */
5135 {
5137 /* If it is a typedef to current class, use the current
5138 class instead, as the typedef won't have any names inside
5139 it yet. */
5143 }
5144 /* Make sure we look in the right scope the next time through
5145 the loop. */
5147 }
5149 /* If parsing tentatively, replace the sequence of tokens that makes
5150 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5151 token. That way, should we re-parse the token stream, we will
5152 not have to repeat the effort required to do the parse, nor will
5153 we issue duplicate error messages. */
5155 {
5159 /* Reset the contents of the START token. */
5161 /* Retrieve any deferred checks. Do not pop this access checks yet
5162 so the memory will not be reclaimed during token replacing below. */
5170 /* Purge all subsequent tokens. */
5172 }
5178 }
5180 /* Parse a nested-name-specifier. See
5181 cp_parser_nested_name_specifier_opt for details. This function
5182 behaves identically, except that it will an issue an error if no
5183 nested-name-specifier is present. */
5185 static tree
5191 {
5192 tree scope;
5194 /* Look for the nested-name-specifier. */
5196 typename_keyword_p,
5197 check_dependency_p,
5198 type_p,
5199 is_declaration);
5200 /* If it was not present, issue an error message. */
5202 {
5205 }
5208 }
5210 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5211 this is either a class-name or a namespace-name (which corresponds
5212 to the class-or-namespace-name production in the grammar). For
5213 C++0x, it can also be a type-name that refers to an enumeration
5214 type or a simple-template-id.
5216 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5217 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5218 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5219 TYPE_P is TRUE iff the next name should be taken as a class-name,
5220 even the same name is declared to be another entity in the same
5221 scope.
5223 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5224 specified by the class-or-namespace-name. If neither is found the
5225 ERROR_MARK_NODE is returned. */
5227 static tree
5234 {
5235 tree saved_scope;
5236 tree saved_qualifying_scope;
5237 tree saved_object_scope;
5238 tree scope;
5242 /* DR 743: decltype can appear in a nested-name-specifier. */
5244 {
5248 {
5251 }
5255 }
5257 /* Before we try to parse the class-name, we must save away the
5258 current PARSER->SCOPE since cp_parser_class_name will destroy
5259 it. */
5263 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5264 there is no need to look for a namespace-name. */
5265 only_class_p = template_keyword_p
5270 typename_keyword_p,
5271 template_keyword_p,
5273 check_dependency_p,
5275 is_declaration);
5277 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5281 {
5282 /* Restore the saved scope. */
5287 /* Parse tentatively. */
5290 /* Parse a type-name */
5293 /* "If the name found does not designate a namespace or a class,
5294 enumeration, or dependent type, the program is ill-formed."
5296 We cover classes and dependent types above and namespaces below,
5297 so this code is only looking for enums. */
5303 }
5304 /* If that didn't work, try for a namespace-name. */
5306 {
5307 /* Restore the saved scope. */
5311 /* If we are not looking at an identifier followed by the scope
5312 resolution operator, then this is not part of a
5313 nested-name-specifier. (Note that this function is only used
5314 to parse the components of a nested-name-specifier.) */
5319 }
5322 }
5324 /* Parse a postfix-expression.
5326 postfix-expression:
5327 primary-expression
5328 postfix-expression [ expression ]
5329 postfix-expression ( expression-list [opt] )
5330 simple-type-specifier ( expression-list [opt] )
5331 typename :: [opt] nested-name-specifier identifier
5332 ( expression-list [opt] )
5333 typename :: [opt] nested-name-specifier template [opt] template-id
5334 ( expression-list [opt] )
5335 postfix-expression . template [opt] id-expression
5336 postfix-expression -> template [opt] id-expression
5337 postfix-expression . pseudo-destructor-name
5338 postfix-expression -> pseudo-destructor-name
5339 postfix-expression ++
5340 postfix-expression --
5341 dynamic_cast < type-id > ( expression )
5342 static_cast < type-id > ( expression )
5343 reinterpret_cast < type-id > ( expression )
5344 const_cast < type-id > ( expression )
5345 typeid ( expression )
5346 typeid ( type-id )
5348 GNU Extension:
5350 postfix-expression:
5351 ( type-id ) { initializer-list , [opt] }
5353 This extension is a GNU version of the C99 compound-literal
5354 construct. (The C99 grammar uses `type-name' instead of `type-id',
5355 but they are essentially the same concept.)
5357 If ADDRESS_P is true, the postfix expression is the operand of the
5358 `&' operator. CAST_P is true if this expression is the target of a
5359 cast.
5361 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5362 class member access expressions [expr.ref].
5364 Returns a representation of the expression. */
5366 static tree
5370 {
5377 /* Peek at the next token. */
5379 /* Some of the productions are determined by keywords. */
5382 {
5387 {
5388 tree type;
5389 tree expression;
5392 /* All of these can be handled in the same way from the point
5393 of view of parsing. Begin by consuming the token
5394 identifying the cast. */
5397 /* New types cannot be defined in the cast. */
5399 parser->type_definition_forbidden_message
5402 /* Look for the opening `<'. */
5404 /* Parse the type to which we are casting. */
5406 /* Look for the closing `>'. */
5408 /* Restore the old message. */
5411 /* And the expression which is being cast. */
5416 /* Only type conversions to integral or enumeration types
5417 can be used in constant-expressions. */
5423 {
5425 postfix_expression
5429 postfix_expression
5433 postfix_expression
5435 tf_warning_or_error);
5438 postfix_expression
5443 }
5444 }
5448 {
5449 tree type;
5453 /* Consume the `typeid' token. */
5455 /* Look for the `(' token. */
5457 /* Types cannot be defined in a `typeid' expression. */
5459 parser->type_definition_forbidden_message
5461 /* We can't be sure yet whether we're looking at a type-id or an
5462 expression. */
5464 /* Try a type-id first. */
5469 /* Look for the `)' token. Otherwise, we can't be sure that
5470 we're not looking at an expression: consider `typeid (int
5471 (3))', for example. */
5473 /* If all went well, simply lookup the type-id. */
5476 /* Otherwise, fall back to the expression variant. */
5477 else
5478 {
5479 tree expression;
5481 /* Look for an expression. */
5483 /* Compute its typeid. */
5485 /* Look for the `)' token. */
5487 }
5488 /* Restore the saved message. */
5490 /* `typeid' may not appear in an integral constant expression. */
5493 }
5497 {
5498 tree type;
5499 /* The syntax permitted here is the same permitted for an
5500 elaborated-type-specifier. */
5505 }
5509 {
5512 tree p;
5529 else
5530 {
5534 }
5536 }
5539 {
5540 tree type;
5542 /* If the next thing is a simple-type-specifier, we may be
5543 looking at a functional cast. We could also be looking at
5544 an id-expression. So, we try the functional cast, and if
5545 that doesn't work we fall back to the primary-expression. */
5547 /* Look for the simple-type-specifier. */
5550 CP_PARSER_FLAGS_NONE);
5551 /* Parse the cast itself. */
5553 postfix_expression
5555 /* If that worked, we're done. */
5559 /* If the functional-cast didn't work out, try a
5560 compound-literal. */
5563 {
5568 /* Consume the `('. */
5570 /* Parse the type. */
5575 /* Look for the `)'. */
5577 /* Look for the `{'. */
5579 /* If things aren't going well, there's no need to
5580 keep going. */
5582 {
5584 /* Parse the initializer-list. */
5585 initializer_list
5587 /* Allow a trailing `,'. */
5590 /* Look for the final `}'. */
5592 }
5593 /* If that worked, we're definitely looking at a
5594 compound-literal expression. */
5596 {
5597 /* Warn the user that a compound literal is not
5598 allowed in standard C++. */
5600 /* For simplicity, we disallow compound literals in
5601 constant-expressions. We could
5602 allow compound literals of integer type, whose
5603 initializer was a constant, in constant
5604 expressions. Permitting that usage, as a further
5605 extension, would not change the meaning of any
5606 currently accepted programs. (Of course, as
5607 compound literals are not part of ISO C++, the
5608 standard has nothing to say.) */
5610 NIC_NCC))
5611 {
5614 }
5615 /* Form the representation of the compound-literal. */
5616 postfix_expression
5617 = (finish_compound_literal
5619 initializer_list),
5620 tf_warning_or_error));
5622 }
5623 }
5625 /* It must be a primary-expression. */
5626 postfix_expression
5630 }
5632 }
5634 /* Keep looping until the postfix-expression is complete. */
5636 {
5640 /* It is not a Koenig lookup function call. */
5641 postfix_expression
5644 /* Peek at the next token. */
5648 {
5651 {
5653 "two consecutive %<[%> shall "
5656 }
5657 postfix_expression
5659 postfix_expression,
5666 /* postfix-expression ( expression-list [opt] ) */
5667 {
5676 is_builtin_constant_p
5679 {
5680 /* The whole point of __builtin_constant_p is to allow
5681 non-constant expressions to appear as arguments. */
5682 saved_integral_constant_expression_p
5684 saved_non_integral_constant_expression_p
5687 }
5688 args = (cp_parser_parenthesized_expression_list
5693 {
5694 parser->integral_constant_expression_p
5696 parser->non_integral_constant_expression_p
5698 }
5701 {
5704 }
5706 /* Function calls are not permitted in
5707 constant-expressions. */
5710 NIC_FUNC_CALL))
5711 {
5715 }
5720 {
5722 {
5724 {
5727 postfix_expression
5730 tf_warning_or_error);
5731 }
5732 else
5733 postfix_expression
5735 }
5736 /* We do not perform argument-dependent lookup if
5737 normal lookup finds a non-function, in accordance
5738 with the expected resolution of DR 218. */
5741 {
5745 /* Do not do argument dependent lookup if regular
5746 lookup finds a member function or a block-scope
5747 function declaration. [basic.lookup.argdep]/3 */
5750 {
5753 postfix_expression
5756 tf_warning_or_error);
5757 }
5758 }
5759 }
5762 {
5772 {
5773 postfix_expression
5777 }
5780 {
5781 postfix_expression
5782 = (build_new_method_call
5788 tf_warning_or_error));
5789 }
5790 else
5791 postfix_expression
5795 tf_warning_or_error);
5796 }
5800 postfix_expression = (build_offset_ref_call_from_tree
5802 tf_warning_or_error));
5804 /* A call to a static class member, or a namespace-scope
5805 function. */
5806 postfix_expression
5809 koenig_p,
5810 tf_warning_or_error);
5811 else
5812 /* All other function calls. */
5813 postfix_expression
5816 koenig_p,
5817 tf_warning_or_error);
5819 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5823 }
5828 /* postfix-expression . template [opt] id-expression
5829 postfix-expression . pseudo-destructor-name
5830 postfix-expression -> template [opt] id-expression
5831 postfix-expression -> pseudo-destructor-name */
5833 /* Consume the `.' or `->' operator. */
5836 postfix_expression
5838 postfix_expression,
5846 /* postfix-expression ++ */
5847 /* Consume the `++' token. */
5849 /* Generate a representation for the complete expression. */
5850 postfix_expression
5852 POSTINCREMENT_EXPR);
5853 /* Increments may not appear in constant-expressions. */
5861 /* postfix-expression -- */
5862 /* Consume the `--' token. */
5864 /* Generate a representation for the complete expression. */
5865 postfix_expression
5867 POSTDECREMENT_EXPR);
5868 /* Decrements may not appear in constant-expressions. */
5880 else
5882 }
5883 }
5885 /* We should never get here. */
5888 }
5890 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5891 by cp_parser_builtin_offsetof. We're looking for
5893 postfix-expression [ expression ]
5894 postfix-expression [ braced-init-list ] (C++11)
5896 FOR_OFFSETOF is set if we're being called in that context, which
5897 changes how we deal with integer constant expressions. */
5899 static tree
5901 tree postfix_expression,
5903 {
5904 tree index;
5907 /* Consume the `[' token. */
5910 /* Parse the index expression. */
5911 /* ??? For offsetof, there is a question of what to allow here. If
5912 offsetof is not being used in an integral constant expression context,
5913 then we *could* get the right answer by computing the value at runtime.
5914 If we are in an integral constant expression context, then we might
5915 could accept any constant expression; hard to say without analysis.
5916 Rather than open the barn door too wide right away, allow only integer
5917 constant expressions here. */
5920 else
5921 {
5923 {
5927 }
5928 else
5930 }
5932 /* Look for the closing `]'. */
5935 /* Build the ARRAY_REF. */
5938 /* When not doing offsetof, array references are not permitted in
5939 constant-expressions. */
5945 }
5947 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5948 by cp_parser_builtin_offsetof. We're looking for
5950 postfix-expression . template [opt] id-expression
5951 postfix-expression . pseudo-destructor-name
5952 postfix-expression -> template [opt] id-expression
5953 postfix-expression -> pseudo-destructor-name
5955 FOR_OFFSETOF is set if we're being called in that context. That sorta
5956 limits what of the above we'll actually accept, but nevermind.
5957 TOKEN_TYPE is the "." or "->" token, which will already have been
5958 removed from the stream. */
5960 static tree
5963 tree postfix_expression,
5965 location_t location)
5966 {
5967 tree name;
5972 /* If this is a `->' operator, dereference the pointer. */
5975 tf_warning_or_error);
5976 /* Check to see whether or not the expression is type-dependent. */
5978 /* The identifier following the `->' or `.' is not qualified. */
5984 /* Enter the scope corresponding to the type of the object
5985 given by the POSTFIX_EXPRESSION. */
5987 {
5989 /* According to the standard, no expression should ever have
5990 reference type. Unfortunately, we do not currently match
5991 the standard in this respect in that our internal representation
5992 of an expression may have reference type even when the standard
5993 says it does not. Therefore, we have to manually obtain the
5994 underlying type here. */
5996 /* The type of the POSTFIX_EXPRESSION must be complete. */
5998 {
6000 postfix_expression);
6002 }
6003 /* Unlike the object expression in other contexts, *this is not
6004 required to be of complete type for purposes of class member
6005 access (5.2.5) outside the member function body. */
6009 /* Let the name lookup machinery know that we are processing a
6010 class member access expression. */
6012 /* If something went wrong, we want to be able to discern that case,
6013 as opposed to the case where there was no SCOPE due to the type
6014 of expression being dependent. */
6017 /* If the SCOPE was erroneous, make the various semantic analysis
6018 functions exit quickly -- and without issuing additional error
6019 messages. */
6022 }
6024 /* Assume this expression is not a pseudo-destructor access. */
6027 /* If the SCOPE is a scalar type, then, if this is a valid program,
6028 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6029 is type dependent, it can be pseudo-destructor-name or something else.
6030 Try to parse it as pseudo-destructor-name first. */
6032 {
6033 tree s;
6034 tree type;
6037 /* Parse the pseudo-destructor-name. */
6046 {
6048 postfix_expression
6051 }
6052 }
6055 {
6056 /* If the SCOPE is not a scalar type, we are looking at an
6057 ordinary class member access expression, rather than a
6058 pseudo-destructor-name. */
6061 /* Parse the id-expression. */
6062 name = (cp_parser_id_expression
6069 /* In general, build a SCOPE_REF if the member name is qualified.
6070 However, if the name was not dependent and has already been
6071 resolved; there is no need to build the SCOPE_REF. For example;
6073 struct X { void f(); };
6074 template <typename T> void f(T* t) { t->X::f(); }
6076 Even though "t" is dependent, "X::f" is not and has been resolved
6077 to a BASELINK; there is no need to include scope information. */
6079 /* But we do need to remember that there was an explicit scope for
6080 virtual function calls. */
6084 /* If the name is a template-id that names a type, we will get a
6085 TYPE_DECL here. That is invalid code. */
6087 {
6090 }
6091 else
6092 {
6094 {
6096 {
6100 }
6101 else
6104 name,
6105 template_p);
6109 }
6111 adjust_result_of_qualified_name_lookup
6113 postfix_expression
6115 template_p,
6116 tf_warning_or_error);
6117 }
6118 }
6120 /* We no longer need to look up names in the scope of the object on
6121 the left-hand side of the `.' or `->' operator. */
6124 /* Outside of offsetof, these operators may not appear in
6125 constant-expressions. */
6127 && (cp_parser_non_integral_constant_expression
6132 }
6134 /* Parse a parenthesized expression-list.
6136 expression-list:
6137 assignment-expression
6138 expression-list, assignment-expression
6140 attribute-list:
6141 expression-list
6142 identifier
6143 identifier, expression-list
6145 CAST_P is true if this expression is the target of a cast.
6147 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6148 argument pack.
6150 Returns a vector of trees. Each element is a representation of an
6151 assignment-expression. NULL is returned if the ( and or ) are
6152 missing. An empty, but allocated, vector is returned on no
6153 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6154 if we are parsing an attribute list for an attribute that wants a
6155 plain identifier argument, normal_attr for an attribute that wants
6156 an expression, or non_attr if we aren't parsing an attribute list. If
6157 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6158 not all of the expressions in the list were constant. */
6166 {
6172 /* Assume all the expressions will be constant. */
6181 /* Within a parenthesized expression, a `>' token is always
6182 the greater-than operator. */
6183 saved_greater_than_is_operator_p
6187 /* Consume expressions until there are no more. */
6190 {
6191 tree expr;
6193 /* At the beginning of attribute lists, check to see if the
6194 next token is an identifier. */
6197 {
6200 /* Consume the identifier. */
6202 /* Save the identifier. */
6204 }
6205 else
6206 {
6209 /* Parse the next assignment-expression. */
6211 {
6212 /* A braced-init-list. */
6217 }
6219 {
6220 expr = (cp_parser_constant_expression
6225 }
6226 else
6232 /* If we have an ellipsis, then this is an expression
6233 expansion. */
6236 {
6237 /* Consume the `...'. */
6240 /* Build the argument pack. */
6242 }
6244 /* Add it to the list. We add error_mark_node
6245 expressions to the list, so that we can still tell if
6246 the correct form for a parenthesized expression-list
6247 is found. That gives better errors. */
6252 }
6254 /* After the first item, attribute lists look the same as
6255 expression lists. */
6258 get_comma:;
6259 /* If the next token isn't a `,', then we are done. */
6263 /* Otherwise, consume the `,' and keep going. */
6265 }
6268 {
6271 skip_comma:;
6272 /* We try and resync to an unnested comma, as that will give the
6273 user better diagnostics. */
6281 {
6282 parser->greater_than_is_operator_p
6285 }
6286 }
6288 parser->greater_than_is_operator_p
6295 }
6297 /* Parse a pseudo-destructor-name.
6299 pseudo-destructor-name:
6300 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6301 :: [opt] nested-name-specifier template template-id :: ~ type-name
6302 :: [opt] nested-name-specifier [opt] ~ type-name
6304 If either of the first two productions is used, sets *SCOPE to the
6305 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6306 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6307 or ERROR_MARK_NODE if the parse fails. */
6309 static void
6313 {
6316 /* Assume that things will not work out. */
6319 /* Look for the optional `::' operator. */
6321 /* Look for the optional nested-name-specifier. */
6322 nested_name_specifier_p
6329 /* Now, if we saw a nested-name-specifier, we might be doing the
6330 second production. */
6333 {
6334 /* Consume the `template' keyword. */
6336 /* Parse the template-id. */
6340 class_type,
6342 /* Look for the `::' token. */
6344 }
6345 /* If the next token is not a `~', then there might be some
6346 additional qualification. */
6348 {
6349 /* At this point, we're looking for "type-name :: ~". The type-name
6350 must not be a class-name, since this is a pseudo-destructor. So,
6351 it must be either an enum-name, or a typedef-name -- both of which
6352 are just identifiers. So, we peek ahead to check that the "::"
6353 and "~" tokens are present; if they are not, then we can avoid
6354 calling type_name. */
6358 {
6361 }
6363 /* Look for the type-name. */
6368 /* Look for the `::' token. */
6370 }
6371 else
6374 /* Look for the `~'. */
6377 /* Once we see the ~, this has to be a pseudo-destructor. */
6381 /* Look for the type-name again. We are not responsible for
6382 checking that it matches the first type-name. */
6384 }
6386 /* Parse a unary-expression.
6388 unary-expression:
6389 postfix-expression
6390 ++ cast-expression
6391 -- cast-expression
6392 unary-operator cast-expression
6393 sizeof unary-expression
6394 sizeof ( type-id )
6395 alignof ( type-id ) [C++0x]
6396 new-expression
6397 delete-expression
6399 GNU Extensions:
6401 unary-expression:
6402 __extension__ cast-expression
6403 __alignof__ unary-expression
6404 __alignof__ ( type-id )
6405 alignof unary-expression [C++0x]
6406 __real__ cast-expression
6407 __imag__ cast-expression
6408 && identifier
6410 ADDRESS_P is true iff the unary-expression is appearing as the
6411 operand of the `&' operator. CAST_P is true if this expression is
6412 the target of a cast.
6414 Returns a representation of the expression. */
6416 static tree
6419 {
6423 /* Peek at the next token. */
6425 /* Some keywords give away the kind of expression. */
6427 {
6431 {
6434 {
6437 location_t first_loc;
6440 /* Consume the token. */
6443 /* Parse the operand. */
6448 else
6449 {
6450 /* ISO C++ defines alignof only with types, not with
6451 expressions. So pedwarn if alignof is used with a non-
6452 type expression. However, __alignof__ is ok. */
6455 "ISO C++ does not allow %<alignof%> "
6459 }
6460 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6461 SIZEOF_EXPR with the original operand. */
6463 {
6465 {
6467 {
6470 error_mark_node));
6472 }
6473 else
6477 }
6479 }
6481 }
6490 {
6491 /* The saved value of the PEDANTIC flag. */
6493 tree expr;
6495 /* Save away the PEDANTIC flag. */
6497 /* Parse the cast-expression. */
6499 /* Restore the PEDANTIC flag. */
6503 }
6507 {
6508 tree expression;
6510 /* Consume the `__real__' or `__imag__' token. */
6512 /* Parse the cast-expression. */
6514 /* Create the complete representation. */
6518 expression,
6519 tf_warning_or_error);
6520 }
6528 {
6529 tree expr;
6539 parser->type_definition_forbidden_message
6542 saved_integral_constant_expression_p
6544 saved_non_integral_constant_expression_p
6548 saved_greater_than_is_operator_p
6558 parser->greater_than_is_operator_p
6561 parser->integral_constant_expression_p
6563 parser->non_integral_constant_expression_p
6570 }
6574 }
6575 }
6577 /* Look for the `:: new' and `:: delete', which also signal the
6578 beginning of a new-expression, or delete-expression,
6579 respectively. If the next token is `::', then it might be one of
6580 these. */
6582 {
6585 /* See if the token after the `::' is one of the keywords in
6586 which we're interested. */
6588 /* If it's `new', we have a new-expression. */
6591 /* Similarly, for `delete'. */
6594 }
6596 /* Look for a unary operator. */
6598 /* The `++' and `--' operators can be handled similarly, even though
6599 they are not technically unary-operators in the grammar. */
6601 {
6606 /* Handle the GNU address-of-label extension. */
6609 {
6610 tree identifier;
6611 tree expression;
6614 /* Consume the '&&' token. */
6616 /* Look for the identifier. */
6618 /* Create an expression representing the address. */
6621 NIC_ADDR_LABEL))
6624 }
6625 }
6627 {
6628 tree cast_expression;
6633 /* Consume the operator token. */
6635 /* Parse the cast-expression. */
6636 cast_expression
6640 /* Now, build an appropriate representation. */
6642 {
6646 RO_UNARY_STAR,
6647 tf_warning_or_error);
6652 /* Fall through. */
6655 cast_expression,
6656 tf_warning_or_error);
6663 /* Fall through. */
6668 cast_expression);
6673 }
6677 non_constant_p))
6681 }
6685 pidk);
6686 }
6688 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6689 unary-operator, the corresponding tree code is returned. */
6691 static enum tree_code
6693 {
6695 {
6716 }
6717 }
6719 /* Parse a new-expression.
6721 new-expression:
6722 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6723 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6725 Returns a representation of the expression. */
6727 static tree
6729 {
6732 tree type;
6735 tree ret;
6737 /* Look for the optional `::' operator. */
6738 global_scope_p
6742 /* Look for the `new' operator. */
6744 /* There's no easy way to tell a new-placement from the
6745 `( type-id )' construct. */
6747 /* Look for a new-placement. */
6749 /* If that didn't work out, there's no new-placement. */
6751 {
6755 }
6757 /* If the next token is a `(', then we have a parenthesized
6758 type-id. */
6760 {
6764 /* Consume the `('. */
6767 /* Parse the type-id. */
6768 parser->type_definition_forbidden_message
6773 /* Look for the closing `)'. */
6776 /* There should not be a direct-new-declarator in this production,
6777 but GCC used to allowed this, so we check and emit a sensible error
6778 message for this case. */
6780 {
6786 }
6787 }
6788 /* Otherwise, there must be a new-type-id. */
6789 else
6792 /* If the next token is a `(' or '{', then we have a new-initializer. */
6796 else
6799 /* A new-expression may not appear in an integral constant
6800 expression. */
6803 else
6804 {
6805 /* Create a representation of the new-expression. */
6807 tf_warning_or_error);
6808 }
6816 }
6818 /* Parse a new-placement.
6820 new-placement:
6821 ( expression-list )
6823 Returns the same representation as for an expression-list. */
6827 {
6830 /* Parse the expression-list. */
6831 expression_list = (cp_parser_parenthesized_expression_list
6837 }
6839 /* Parse a new-type-id.
6841 new-type-id:
6842 type-specifier-seq new-declarator [opt]
6844 Returns the TYPE allocated. If the new-type-id indicates an array
6845 type, *NELTS is set to the number of elements in the last array
6846 bound; the TYPE will not include the last array bound. */
6848 static tree
6850 {
6851 cp_decl_specifier_seq type_specifier_seq;
6857 /* The type-specifier sequence must not contain type definitions.
6858 (It cannot contain declarations of new types either, but if they
6859 are not definitions we will catch that because they are not
6860 complete.) */
6862 parser->type_definition_forbidden_message
6864 /* Parse the type-specifier-seq. */
6868 /* Restore the old message. */
6874 /* Parse the new-declarator. */
6877 /* Determine the number of elements in the last array dimension, if
6878 any. */
6880 /* Skip down to the last array dimension. */
6885 {
6888 }
6893 {
6896 }
6899 {
6906 else
6908 }
6911 }
6913 /* Parse an (optional) new-declarator.
6915 new-declarator:
6916 ptr-operator new-declarator [opt]
6917 direct-new-declarator
6919 Returns the declarator. */
6923 {
6926 cp_cv_quals cv_quals;
6928 /* We don't know if there's a ptr-operator next, or not. */
6930 /* Look for a ptr-operator. */
6932 /* If that worked, look for more new-declarators. */
6934 {
6937 /* Parse another optional declarator. */
6940 declarator = cp_parser_make_indirect_declarator
6944 }
6946 /* If the next token is a `[', there is a direct-new-declarator. */
6951 }
6953 /* Parse a direct-new-declarator.
6955 direct-new-declarator:
6956 [ expression ]
6957 direct-new-declarator [constant-expression]
6959 */
6963 {
6967 {
6968 tree expression;
6971 /* Look for the opening `['. */
6976 /* The standard requires that the expression have integral
6977 type. DR 74 adds enumeration types. We believe that the
6978 real intent is that these expressions be handled like the
6979 expression in a `switch' condition, which also allows
6980 classes with a single conversion to integral or
6981 enumeration type. */
6983 {
6984 expression
6986 expression,
6989 {
6991 "expression in new-declarator must have integral "
6994 }
6995 }
6997 /* Look for the closing `]'. */
7000 /* Add this bound to the declarator. */
7003 /* If the next token is not a `[', then there are no more
7004 bounds. */
7007 }
7010 }
7012 /* Parse a new-initializer.
7014 new-initializer:
7015 ( expression-list [opt] )
7016 braced-init-list
7018 Returns a representation of the expression-list. */
7022 {
7026 {
7027 tree t;
7033 }
7034 else
7035 expression_list = (cp_parser_parenthesized_expression_list
7041 }
7043 /* Parse a delete-expression.
7045 delete-expression:
7046 :: [opt] delete cast-expression
7047 :: [opt] delete [ ] cast-expression
7049 Returns a representation of the expression. */
7051 static tree
7053 {
7056 tree expression;
7058 /* Look for the optional `::' operator. */
7059 global_scope_p
7063 /* Look for the `delete' keyword. */
7065 /* See if the array syntax is in use. */
7067 {
7068 /* Consume the `[' token. */
7070 /* Look for the `]' token. */
7072 /* Remember that this is the `[]' construct. */
7074 }
7075 else
7078 /* Parse the cast-expression. */
7081 /* A delete-expression may not appear in an integral constant
7082 expression. */
7087 tf_warning_or_error);
7088 }
7090 /* Returns true if TOKEN may start a cast-expression and false
7091 otherwise. */
7093 static bool
7095 {
7097 {
7136 /* '[' may start a primary-expression in obj-c++. */
7142 }
7143 }
7145 /* Parse a cast-expression.
7147 cast-expression:
7148 unary-expression
7149 ( type-id ) cast-expression
7151 ADDRESS_P is true iff the unary-expression is appearing as the
7152 operand of the `&' operator. CAST_P is true if this expression is
7153 the target of a cast.
7155 Returns a representation of the expression. */
7157 static tree
7160 {
7161 /* If it's a `(', then we might be looking at a cast. */
7163 {
7169 /* There's no way to know yet whether or not this is a cast.
7170 For example, `(int (3))' is a unary-expression, while `(int)
7171 3' is a cast. So, we resort to parsing tentatively. */
7173 /* Types may not be defined in a cast. */
7175 parser->type_definition_forbidden_message
7177 /* Consume the `('. */
7179 /* A very tricky bit is that `(struct S) { 3 }' is a
7180 compound-literal (which we permit in C++ as an extension).
7181 But, that construct is not a cast-expression -- it is a
7182 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7183 is legal; if the compound-literal were a cast-expression,
7184 you'd need an extra set of parentheses.) But, if we parse
7185 the type-id, and it happens to be a class-specifier, then we
7186 will commit to the parse at that point, because we cannot
7187 undo the action that is done when creating a new class. So,
7188 then we cannot back up and do a postfix-expression.
7190 Therefore, we scan ahead to the closing `)', and check to see
7191 if the token after the `)' is a `{'. If so, we are not
7192 looking at a cast-expression.
7194 Save tokens so that we can put them back. */
7196 /* Skip tokens until the next token is a closing parenthesis.
7197 If we find the closing `)', and the next token is a `{', then
7198 we are looking at a compound-literal. */
7199 compound_literal_p
7203 /* Roll back the tokens we skipped. */
7205 /* If we were looking at a compound-literal, simulate an error
7206 so that the call to cp_parser_parse_definitely below will
7207 fail. */
7210 else
7211 {
7214 /* Look for the type-id. */
7216 /* Look for the closing `)'. */
7219 }
7221 /* Restore the saved message. */
7224 /* At this point this can only be either a cast or a
7225 parenthesized ctor such as `(T ())' that looks like a cast to
7226 function returning T. */
7230 {
7236 /* Warn about old-style casts, if so requested. */
7238 && !in_system_header
7243 /* Only type conversions to integral or enumeration types
7244 can be used in constant-expressions. */
7247 NIC_CAST))
7250 /* Perform the cast. */
7253 }
7254 else
7256 }
7258 /* If we get here, then it's not a cast, so it must be a
7259 unary-expression. */
7261 }
7263 /* Parse a binary expression of the general form:
7265 pm-expression:
7266 cast-expression
7267 pm-expression .* cast-expression
7268 pm-expression ->* cast-expression
7270 multiplicative-expression:
7271 pm-expression
7272 multiplicative-expression * pm-expression
7273 multiplicative-expression / pm-expression
7274 multiplicative-expression % pm-expression
7276 additive-expression:
7277 multiplicative-expression
7278 additive-expression + multiplicative-expression
7279 additive-expression - multiplicative-expression
7281 shift-expression:
7282 additive-expression
7283 shift-expression << additive-expression
7284 shift-expression >> additive-expression
7286 relational-expression:
7287 shift-expression
7288 relational-expression < shift-expression
7289 relational-expression > shift-expression
7290 relational-expression <= shift-expression
7291 relational-expression >= shift-expression
7293 GNU Extension:
7295 relational-expression:
7296 relational-expression <? shift-expression
7297 relational-expression >? shift-expression
7299 equality-expression:
7300 relational-expression
7301 equality-expression == relational-expression
7302 equality-expression != relational-expression
7304 and-expression:
7305 equality-expression
7306 and-expression & equality-expression
7308 exclusive-or-expression:
7309 and-expression
7310 exclusive-or-expression ^ and-expression
7312 inclusive-or-expression:
7313 exclusive-or-expression
7314 inclusive-or-expression | exclusive-or-expression
7316 logical-and-expression:
7317 inclusive-or-expression
7318 logical-and-expression && inclusive-or-expression
7320 logical-or-expression:
7321 logical-and-expression
7322 logical-or-expression || logical-and-expression
7324 All these are implemented with a single function like:
7326 binary-expression:
7327 simple-cast-expression
7328 binary-expression <token> binary-expression
7330 CAST_P is true if this expression is the target of a cast.
7332 The binops_by_token map is used to get the tree codes for each <token> type.
7333 binary-expressions are associated according to a precedence table. */
7335 #define TOKEN_PRECEDENCE(token) \
7336 (((token->type == CPP_GREATER \
7337 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7338 && !parser->greater_than_is_operator_p) \
7339 ? PREC_NOT_OPERATOR \
7340 : binops_by_token[token->type].prec)
7342 static tree
7347 {
7348 cp_parser_expression_stack stack;
7350 cp_parser_expression_stack_entry current;
7351 tree rhs;
7355 tree overload;
7357 /* Parse the first expression. */
7367 {
7368 /* Get an operator token. */
7374 {
7376 "%<>>%> operator is treated"
7380 }
7384 /* Popping an entry off the stack means we completed a subexpression:
7385 - either we found a token which is not an operator (`>' where it is not
7386 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7387 will happen repeatedly;
7388 - or, we found an operator which has lower priority. This is the case
7389 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7390 parsing `3 * 4'. */
7392 {
7395 else
7397 }
7399 get_rhs:
7403 /* We used the operator token. */
7406 /* For "false && x" or "true || x", x will never be executed;
7407 disable warnings while evaluating it. */
7413 /* Extract another operand. It may be the RHS of this expression
7414 or the LHS of a new, higher priority expression. */
7418 /* Get another operator token. Look up its precedence to avoid
7419 building a useless (immediately popped) stack entry for common
7420 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7424 {
7425 /* ... and prepare to parse the RHS of the new, higher priority
7426 expression. Since precedence levels on the stack are
7427 monotonically increasing, we do not have to care about
7428 stack overflows. */
7437 pop:
7439 /* If the stack is not empty, we have parsed into LHS the right side
7440 (`4' in the example above) of an expression we had suspended.
7441 We can use the information on the stack to recover the LHS (`3')
7442 from the stack together with the tree code (`MULT_EXPR'), and
7443 the precedence of the higher level subexpression
7444 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7445 which will be used to actually build the additive expression. */
7450 }
7452 /* Undo the disabling of warnings done above. */
7459 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7460 ERROR_MARK for everything that is not a binary expression.
7461 This makes warn_about_parentheses miss some warnings that
7462 involve unary operators. For unary expressions we should
7463 pass the correct tree_code unless the unary expression was
7464 surrounded by parentheses.
7465 */
7472 else
7476 tf_warning_or_error);
7481 /* If the binary operator required the use of an overloaded operator,
7482 then this expression cannot be an integral constant-expression.
7483 An overloaded operator can be used even if both operands are
7484 otherwise permissible in an integral constant-expression if at
7485 least one of the operands is of enumeration type. */
7489 NIC_OVERLOADED))
7491 }
7494 }
7497 /* Parse the `? expression : assignment-expression' part of a
7498 conditional-expression. The LOGICAL_OR_EXPR is the
7499 logical-or-expression that started the conditional-expression.
7500 Returns a representation of the entire conditional-expression.
7502 This routine is used by cp_parser_assignment_expression.
7504 ? expression : assignment-expression
7506 GNU Extensions:
7508 ? : assignment-expression */
7510 static tree
7512 {
7513 tree expr;
7514 tree assignment_expr;
7518 /* Consume the `?' token. */
7523 {
7526 /* Implicit true clause. */
7530 }
7531 else
7532 {
7535 /* Parse the expression. */
7538 c_inhibit_evaluation_warnings +=
7542 }
7544 /* The next token should be a `:'. */
7546 /* Parse the assignment-expression. */
7550 /* Build the conditional-expression. */
7552 expr,
7553 assignment_expr,
7554 tf_warning_or_error);
7555 }
7557 /* Parse an assignment-expression.
7559 assignment-expression:
7560 conditional-expression
7561 logical-or-expression assignment-operator assignment_expression
7562 throw-expression
7564 CAST_P is true if this expression is the target of a cast.
7566 Returns a representation for the expression. */
7568 static tree
7571 {
7572 tree expr;
7574 /* If the next token is the `throw' keyword, then we're looking at
7575 a throw-expression. */
7578 /* Otherwise, it must be that we are looking at a
7579 logical-or-expression. */
7580 else
7581 {
7582 /* Parse the binary expressions (logical-or-expression). */
7585 /* If the next token is a `?' then we're actually looking at a
7586 conditional-expression. */
7589 else
7590 {
7593 /* If it's an assignment-operator, we're using the second
7594 production. */
7595 enum tree_code assignment_operator
7598 {
7600 location_t saved_input_location;
7602 /* Parse the right-hand side of the assignment. */
7608 /* An assignment may not appear in a
7609 constant-expression. */
7611 NIC_ASSIGNMENT))
7613 /* Build the assignment expression. Its default
7614 location is the location of the '=' token. */
7618 assignment_operator,
7619 rhs,
7620 tf_warning_or_error);
7622 }
7623 }
7624 }
7627 }
7629 /* Parse an (optional) assignment-operator.
7631 assignment-operator: one of
7632 = *= /= %= += -= >>= <<= &= ^= |=
7634 GNU Extension:
7636 assignment-operator: one of
7637 <?= >?=
7639 If the next token is an assignment operator, the corresponding tree
7640 code is returned, and the token is consumed. For example, for
7641 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7642 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7643 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7644 operator, ERROR_MARK is returned. */
7646 static enum tree_code
7648 {
7652 /* Peek at the next token. */
7656 {
7702 /* Nothing else is an assignment operator. */
7704 }
7706 /* If it was an assignment operator, consume it. */
7711 }
7713 /* Parse an expression.
7715 expression:
7716 assignment-expression
7717 expression , assignment-expression
7719 CAST_P is true if this expression is the target of a cast.
7721 Returns a representation of the expression. */
7723 static tree
7725 {
7730 {
7731 tree assignment_expression;
7733 /* Parse the next assignment-expression. */
7734 assignment_expression
7736 /* If this is the first assignment-expression, we can just
7737 save it away. */
7740 else
7742 assignment_expression,
7743 tf_warning_or_error);
7744 /* If the next token is not a comma, then we are done with the
7745 expression. */
7748 /* Consume the `,'. */
7751 /* A comma operator cannot appear in a constant-expression. */
7754 }
7757 }
7759 /* Parse a constant-expression.
7761 constant-expression:
7762 conditional-expression
7764 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7765 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7766 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7767 is false, NON_CONSTANT_P should be NULL. */
7769 static tree
7773 {
7777 tree expression;
7779 /* It might seem that we could simply parse the
7780 conditional-expression, and then check to see if it were
7781 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7782 one that the compiler can figure out is constant, possibly after
7783 doing some simplifications or optimizations. The standard has a
7784 precise definition of constant-expression, and we must honor
7785 that, even though it is somewhat more restrictive.
7787 For example:
7789 int i[(2, 3)];
7791 is not a legal declaration, because `(2, 3)' is not a
7792 constant-expression. The `,' operator is forbidden in a
7793 constant-expression. However, GCC's constant-folding machinery
7794 will fold this operation to an INTEGER_CST for `3'. */
7796 /* Save the old settings. */
7798 saved_allow_non_integral_constant_expression_p
7801 /* We are now parsing a constant-expression. */
7803 parser->allow_non_integral_constant_expression_p
7806 /* Although the grammar says "conditional-expression", we parse an
7807 "assignment-expression", which also permits "throw-expression"
7808 and the use of assignment operators. In the case that
7809 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7810 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7811 actually essential that we look for an assignment-expression.
7812 For example, cp_parser_initializer_clauses uses this function to
7813 determine whether a particular assignment-expression is in fact
7814 constant. */
7816 /* Restore the old settings. */
7817 parser->integral_constant_expression_p
7819 parser->allow_non_integral_constant_expression_p
7822 {
7823 /* Require an rvalue constant expression here; that's what our
7824 callers expect. Reference constant expressions are handled
7825 separately in e.g. cp_parser_template_argument. */
7830 }
7833 parser->non_integral_constant_expression_p
7837 }
7839 /* Parse __builtin_offsetof.
7841 offsetof-expression:
7842 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7844 offsetof-member-designator:
7845 id-expression
7846 | offsetof-member-designator "." id-expression
7847 | offsetof-member-designator "[" expression "]"
7848 | offsetof-member-designator "->" id-expression */
7850 static tree
7852 {
7855 cp_id_kind dummy;
7858 /* We're about to accept non-integral-constant things, but will
7859 definitely yield an integral constant expression. Save and
7860 restore these values around our local parsing. */
7864 /* Consume the "__builtin_offsetof" token. */
7866 /* Consume the opening `('. */
7868 /* Parse the type-id. */
7870 /* Look for the `,'. */
7874 /* Build the (type *)null that begins the traditional offsetof macro. */
7876 tf_warning_or_error);
7878 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7882 {
7885 {
7887 /* offsetof-member-designator "[" expression "]" */
7892 /* offsetof-member-designator "->" identifier */
7894 /* FALLTHRU */
7897 /* offsetof-member-designator "." identifier */
7905 /* Consume the ")" token. */
7910 /* Error. We know the following require will fail, but
7911 that gives the proper error message. */
7916 }
7917 }
7919 success:
7920 /* If we're processing a template, we can't finish the semantics yet.
7921 Otherwise we can fold the entire expression now. */
7924 else
7927 failure:
7932 }
7934 /* Parse a trait expression.
7936 Returns a representation of the expression, the underlying type
7937 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7939 static tree
7941 {
7942 cp_trait_kind kind;
7945 cp_decl_specifier_seq decl_specs;
7948 {
8025 }
8027 /* Consume the token. */
8037 /* Build a trivial decl-specifier-seq. */
8041 /* Call grokdeclarator to figure out what type this is. */
8046 {
8054 /* Build a trivial decl-specifier-seq. */
8058 /* Call grokdeclarator to figure out what type this is. */
8061 }
8065 /* Complete the trait expression, which may mean either processing
8066 the trait expr now or saving it for template instantiation. */
8068 {
8077 }
8078 }
8080 /* Lambdas that appear in variable initializer or default argument scope
8081 get that in their mangling, so we need to record it. We might as well
8082 use the count for function and namespace scopes as well. */
8086 {
8087 tree t;
8092 static void
8094 {
8095 tree_int ti;
8097 /* Once we're inside a function, we ignore other scopes and just push
8098 the function again so that popping works properly. */
8105 {
8106 /* Don't reset the count if we're still in the same function. */
8109 }
8110 }
8112 static void
8114 {
8117 }
8119 static void
8121 {
8124 {
8127 }
8129 }
8131 /* Parse a lambda expression.
8133 lambda-expression:
8134 lambda-introducer lambda-declarator [opt] compound-statement
8136 Returns a representation of the expression. */
8138 static tree
8140 {
8142 tree type;
8152 /* We may be in the middle of deferred access check. Disable
8153 it now. */
8164 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8167 /* Now that we've started the type, add the capture fields for any
8168 explicit captures. */
8171 {
8172 /* Inside the class, surrounding template-parameter-lists do not apply. */
8173 unsigned int saved_num_template_parameter_lists
8182 /* By virtue of defining a local class, a lambda expression has access to
8183 the private variables of enclosing classes. */
8192 /* The capture list was built up in reverse order; fix that now. */
8193 {
8199 {
8203 }
8205 }
8215 }
8219 /* This field is only used during parsing of the lambda. */
8222 /* This lambda shouldn't have any proxies left at this point. */
8224 /* And now that we're done, push proxies for an enclosing lambda. */
8229 else
8231 }
8233 /* Parse the beginning of a lambda expression.
8235 lambda-introducer:
8236 [ lambda-capture [opt] ]
8238 LAMBDA_EXPR is the current representation of the lambda expression. */
8240 static void
8242 {
8243 /* Need commas after the first capture. */
8246 /* Eat the leading `['. */
8249 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8257 {
8260 }
8263 {
8265 tree capture_id;
8266 tree capture_init_expr;
8270 enum capture_kind_type
8271 {
8272 BY_COPY,
8273 BY_REFERENCE
8274 };
8278 {
8281 }
8285 else
8288 /* Possibly capture `this'. */
8290 {
8300 explicit_init_p);
8302 }
8304 /* Remember whether we want to capture as a reference or not. */
8306 {
8309 }
8311 /* Get the identifier. */
8316 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8317 delimiters, but I modified this to stop on unnested ']' as well. It
8318 was already changed to stop on unnested '}', so the
8319 "closing_parenthesis" name is no more misleading with my change. */
8320 {
8326 }
8328 /* Find the initializer for this capture. */
8330 {
8331 /* An explicit expression exists. */
8334 "ISO C++ does not allow initializers "
8340 }
8341 else
8342 {
8345 /* Turn the identifier into an id-expression. */
8346 capture_init_expr
8347 = cp_parser_lookup_name
8349 capture_id,
8350 none_type,
8358 {
8361 }
8365 {
8368 capture_init_expr);
8371 }
8374 {
8377 capture_init_expr);
8380 }
8382 capture_init_expr
8383 = finish_id_expression
8385 capture_init_expr,
8397 }
8401 {
8406 capture_id);
8410 "capture of %qD redundant with by-reference capture "
8412 }
8415 capture_id,
8416 capture_init_expr,
8418 explicit_init_p);
8419 }
8422 }
8424 /* Parse the (optional) middle of a lambda expression.
8426 lambda-declarator:
8427 ( parameter-declaration-clause [opt] )
8428 attribute-specifier [opt]
8429 mutable [opt]
8430 exception-specification [opt]
8431 lambda-return-type-clause [opt]
8433 LAMBDA_EXPR is the current representation of the lambda expression. */
8435 static bool
8437 {
8438 /* 5.1.1.4 of the standard says:
8439 If a lambda-expression does not include a lambda-declarator, it is as if
8440 the lambda-declarator were ().
8441 This means an empty parameter list, no attributes, and no exception
8442 specification. */
8446 tree t;
8448 /* The lambda-declarator is optional, but must begin with an opening
8449 parenthesis if present. */
8451 {
8456 /* Parse parameters. */
8459 /* Default arguments shall not be specified in the
8460 parameter-declaration-clause of a lambda-declarator. */
8470 /* Parse optional `mutable' keyword. */
8472 {
8475 }
8477 /* Parse optional exception specification. */
8480 /* Parse optional trailing return type. */
8482 {
8485 }
8487 /* The function parameters must be in scope all the way until after the
8488 trailing-return-type in case of decltype. */
8493 }
8495 /* Create the function call operator.
8497 Messing with declarators like this is no uglier than building up the
8498 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8499 other code. */
8500 {
8501 cp_decl_specifier_seq return_type_specs;
8503 tree fco;
8510 else
8511 /* Maybe we will deduce the return type later. */
8517 sfk_none);
8522 VIRT_SPEC_UNSPECIFIED,
8523 exception_spec,
8528 declarator,
8529 attributes);
8531 {
8534 /* Give the object parameter a different name. */
8536 }
8543 }
8544 }
8546 /* Parse the body of a lambda expression, which is simply
8548 compound-statement
8550 but which requires special handling.
8551 LAMBDA_EXPR is the current representation of the lambda expression. */
8553 static void
8555 {
8560 else
8561 /* Still increment function_depth so that we don't GC in the
8562 middle of an expression. */
8564 /* Clear this in case we're in the middle of a default argument. */
8567 /* Finish the function call operator
8568 - class_specifier
8569 + late_parsing_for_member
8570 + function_definition_after_declarator
8571 + ctor_initializer_opt_and_function_body */
8572 {
8574 tree body;
8576 tree compound_stmt;
8577 tree cap;
8579 /* Let the front end know that we are going to be defining this
8580 function. */
8582 NULL_TREE,
8591 /* Push the proxies for any explicit captures. */
8598 /* 5.1.1.4 of the standard says:
8599 If a lambda-expression does not include a trailing-return-type, it
8600 is as if the trailing-return-type denotes the following type:
8601 * if the compound-statement is of the form
8602 { return attribute-specifier [opt] expression ; }
8603 the type of the returned expression after lvalue-to-rvalue
8604 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8605 (_conv.array_ 4.2), and function-to-pointer conversion
8606 (_conv.func_ 4.3);
8607 * otherwise, void. */
8609 /* In a lambda that has neither a lambda-return-type-clause
8610 nor a deducible form, errors should be reported for return statements
8611 in the body. Since we used void as the placeholder return type, parsing
8612 the body as usual will give such desired behavior. */
8616 {
8620 /* Parse tentatively in case there's more after the initial return
8621 statement. */
8632 {
8636 /* Will get error here if type not deduced yet. */
8640 }
8641 }
8644 {
8649 }
8653 out:
8657 /* Finish the function and generate code for it if necessary. */
8659 }
8664 else
8666 }
8668 /* Statements [gram.stmt.stmt] */
8670 /* Parse a statement.
8672 statement:
8673 labeled-statement
8674 expression-statement
8675 compound-statement
8676 selection-statement
8677 iteration-statement
8678 jump-statement
8679 declaration-statement
8680 try-block
8682 C++11:
8684 statement:
8685 labeled-statement
8686 attribute-specifier-seq (opt) expression-statement
8687 attribute-specifier-seq (opt) compound-statement
8688 attribute-specifier-seq (opt) selection-statement
8689 attribute-specifier-seq (opt) iteration-statement
8690 attribute-specifier-seq (opt) jump-statement
8691 declaration-statement
8692 attribute-specifier-seq (opt) try-block
8694 TM Extension:
8696 statement:
8697 atomic-statement
8699 IN_COMPOUND is true when the statement is nested inside a
8700 cp_parser_compound_statement; this matters for certain pragmas.
8702 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8703 is a (possibly labeled) if statement which is not enclosed in braces
8704 and has an else clause. This is used to implement -Wparentheses. */
8706 static void
8709 {
8714 restart:
8717 /* There is no statement yet. */
8723 /* In obj-c++, seing '[[' might be the either the beginning of
8724 c++11 attributes, or a nested objc-message-expression. So
8725 let's parse the c++11 attributes tentatively. */
8729 {
8732 }
8734 /* Peek at the next token. */
8736 /* Remember the location of the first token in the statement. */
8738 /* If this is a keyword, then that will often determine what kind of
8739 statement we have. */
8741 {
8745 {
8748 /* Looks like a labeled-statement with a case label.
8749 Parse the label, and then use tail recursion to parse
8750 the statement. */
8772 /* Objective-C++ exception-handling constructs. */
8786 /* This must be a namespace alias definition. */
8799 /* It might be a keyword like `int' that can start a
8800 declaration-statement. */
8802 }
8803 }
8805 {
8806 /* If the next token is a `:', then we are looking at a
8807 labeled-statement. */
8810 {
8811 /* Looks like a labeled-statement with an ordinary label.
8812 Parse the label, and then use tail recursion to parse
8813 the statement. */
8817 }
8818 }
8819 /* Anything that starts with a `{' must be a compound-statement. */
8822 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8823 a statement all its own. */
8825 {
8826 /* Only certain OpenMP pragmas are attached to statements, and thus
8827 are considered statements themselves. All others are not. In
8828 the context of a compound, accept the pragma as a "statement" and
8829 return so that we can check for a close brace. Otherwise we
8830 require a real statement and must go back and read one. */
8836 }
8838 {
8841 }
8843 /* Everything else must be a declaration-statement or an
8844 expression-statement. Try for the declaration-statement
8845 first, unless we are looking at a `;', in which case we know that
8846 we have an expression-statement. */
8848 {
8850 {
8852 {
8853 /* Attributes should be parsed as part of the the
8854 declaration, so let's un-parse them. */
8857 }
8860 /* Try to parse the declaration-statement. */
8862 /* If that worked, we're done. */
8865 }
8866 /* Look for an expression-statement instead. */
8868 }
8870 /* Set the line number for the statement. */
8874 /* Note that for now, we don't do anything with c++11 statements
8875 parsed at this level. */
8878 OPT_Wattributes,
8880 }
8882 /* Parse the label for a labeled-statement, i.e.
8884 identifier :
8885 case constant-expression :
8886 default :
8888 GNU Extension:
8889 case constant-expression ... constant-expression : statement
8891 When a label is parsed without errors, the label is added to the
8892 parse tree by the finish_* functions, so this function doesn't
8893 have to return the label. */
8895 static void
8897 {
8902 /* The next token should be an identifier. */
8906 {
8909 }
8913 {
8915 {
8919 /* Consume the `case' token. */
8921 /* Parse the constant-expression. */
8924 NULL);
8928 {
8929 /* Consume the `...' token. */
8931 expr_hi =
8934 NULL);
8935 /* We don't need to emit warnings here, as the common code
8936 will do this for us. */
8937 }
8938 else
8943 else
8946 expr);
8947 }
8951 /* Consume the `default' token. */
8956 else
8961 /* Anything else must be an ordinary label. */
8964 }
8966 /* Require the `:' token. */
8969 /* An ordinary label may optionally be followed by attributes.
8970 However, this is only permitted if the attributes are then
8971 followed by a semicolon. This is because, for backward
8972 compatibility, when parsing
8973 lab: __attribute__ ((unused)) int i;
8974 we want the attribute to attach to "i", not "lab". */
8977 {
8978 tree attrs;
8985 ;
8986 else
8988 }
8994 }
8996 /* Parse an expression-statement.
8998 expression-statement:
8999 expression [opt] ;
9001 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9002 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9003 indicates whether this expression-statement is part of an
9004 expression statement. */
9006 static tree
9008 {
9012 /* If the next token is a ';', then there is no expression
9013 statement. */
9017 /* Give a helpful message for "A<T>::type t;" and the like. */
9020 {
9027 {
9028 /* A::A a; */
9033 }
9034 }
9036 /* Consume the final `;'. */
9041 /* This is the final expression statement of a statement
9042 expression. */
9046 else
9050 }
9052 /* Parse a compound-statement.
9054 compound-statement:
9055 { statement-seq [opt] }
9057 GNU extension:
9059 compound-statement:
9060 { label-declaration-seq [opt] statement-seq [opt] }
9062 label-declaration-seq:
9063 label-declaration
9064 label-declaration-seq label-declaration
9066 Returns a tree representing the statement. */
9068 static tree
9071 {
9072 tree compound_stmt;
9074 /* Consume the `{'. */
9081 /* Begin the compound-statement. */
9083 /* If the next keyword is `__label__' we have a label declaration. */
9086 /* Parse an (optional) statement-seq. */
9088 /* Finish the compound-statement. */
9090 /* Consume the `}'. */
9094 }
9096 /* Parse an (optional) statement-seq.
9098 statement-seq:
9099 statement
9100 statement-seq [opt] statement */
9102 static void
9104 {
9105 /* Scan statements until there aren't any more. */
9107 {
9110 /* If we are looking at a `}', then we have run out of
9111 statements; the same is true if we have reached the end
9112 of file, or have stumbled upon a stray '@end'. */
9119 /* If we are in a compound statement and find 'else' then
9120 something went wrong. */
9122 {
9125 else
9126 {
9129 }
9130 }
9132 /* Parse the statement. */
9134 }
9135 }
9137 /* Parse a selection-statement.
9139 selection-statement:
9140 if ( condition ) statement
9141 if ( condition ) statement else statement
9142 switch ( condition ) statement
9144 Returns the new IF_STMT or SWITCH_STMT.
9146 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9147 is a (possibly labeled) if statement which is not enclosed in
9148 braces and has an else clause. This is used to implement
9149 -Wparentheses. */
9151 static tree
9153 {
9160 /* Peek at the next token. */
9163 /* See what kind of keyword it is. */
9166 {
9169 {
9170 tree statement;
9171 tree condition;
9173 /* Look for the `('. */
9175 {
9178 }
9180 /* Begin the selection-statement. */
9183 else
9186 /* Parse the condition. */
9188 /* Look for the `)'. */
9194 {
9198 /* Add the condition. */
9201 /* Parse the then-clause. */
9205 {
9213 }
9214 else
9220 /* If the next token is `else', parse the else-clause. */
9222 RID_ELSE))
9223 {
9224 /* Consume the `else' keyword. */
9227 /* Parse the else-clause. */
9229 {
9230 location_t loc;
9237 }
9238 else
9243 /* If we are currently parsing a then-clause, then
9244 IF_P will not be NULL. We set it to true to
9245 indicate that this if statement has an else clause.
9246 This may trigger the Wparentheses warning below
9247 when we get back up to the parent if statement. */
9250 }
9251 else
9252 {
9253 /* This if statement does not have an else clause. If
9254 NESTED_IF is true, then the then-clause is an if
9255 statement which does have an else clause. We warn
9256 about the potential ambiguity. */
9259 "suggest explicit braces to avoid ambiguous"
9261 }
9263 /* Now we're all done with the if-statement. */
9265 }
9266 else
9267 {
9271 /* Add the condition. */
9274 /* Parse the body of the switch-statement. */
9283 /* Now we're all done with the switch-statement. */
9285 }
9288 }
9294 }
9295 }
9297 /* Parse a condition.
9299 condition:
9300 expression
9301 type-specifier-seq declarator = initializer-clause
9302 type-specifier-seq declarator braced-init-list
9304 GNU Extension:
9306 condition:
9307 type-specifier-seq declarator asm-specification [opt]
9308 attributes [opt] = assignment-expression
9310 Returns the expression that should be tested. */
9312 static tree
9314 {
9315 cp_decl_specifier_seq type_specifiers;
9319 /* Try the declaration first. */
9321 /* New types are not allowed in the type-specifier-seq for a
9322 condition. */
9324 parser->type_definition_forbidden_message
9326 /* Parse the type-specifier-seq. */
9328 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9331 /* Restore the saved message. */
9333 /* If all is well, we might be looking at a declaration. */
9335 {
9336 tree decl;
9337 tree asm_specification;
9338 tree attributes;
9342 /* Parse the declarator. */
9347 /* Parse the attributes. */
9349 /* Parse the asm-specification. */
9351 /* If the next token is not an `=' or '{', then we might still be
9352 looking at an expression. For example:
9354 if (A(a).x)
9356 looks like a decl-specifier-seq and a declarator -- but then
9357 there is no `=', so this is an expression. */
9362 /* If we did see an `=' or '{', then we are looking at a declaration
9363 for sure. */
9365 {
9366 tree pushed_scope;
9370 /* Create the declaration. */
9376 /* Parse the initializer. */
9378 {
9382 }
9383 else
9384 {
9385 /* Consume the `='. */
9388 }
9392 /* Process the initializer. */
9395 asm_specification,
9396 flags);
9402 }
9403 }
9404 /* If we didn't even get past the declarator successfully, we are
9405 definitely not looking at a declaration. */
9406 else
9409 /* Otherwise, we are looking at an expression. */
9411 }
9413 /* Parses a for-statement or range-for-statement until the closing ')',
9414 not included. */
9416 static tree
9418 {
9422 /* Begin the for-statement. */
9425 /* Parse the initialization. */
9430 else
9432 }
9434 static tree
9436 {
9437 /* Normal for loop */
9440 tree stmt;
9443 /* The for-init-statement has already been parsed in
9444 cp_parser_for_init_statement, so no work is needed here. */
9447 /* If there's a condition, process it. */
9451 /* Look for the `;'. */
9454 /* If there's an expression, process it. */
9460 }
9462 /* Tries to parse a range-based for-statement:
9464 range-based-for:
9465 decl-specifier-seq declarator : expression
9467 The decl-specifier-seq declarator and the `:' are already parsed by
9468 cp_parser_for_init_statement. If processing_template_decl it returns a
9469 newly created RANGE_FOR_STMT; if not, it is converted to a
9470 regular FOR_STMT. */
9472 static tree
9474 {
9478 {
9481 }
9482 else
9485 /* If in template, STMT is converted to a normal for-statement
9486 at instantiation. If not, it is done just ahead. */
9488 {
9494 /* do_auto_deduction doesn't mess with template init-lists. */
9497 }
9498 else
9499 {
9502 }
9504 }
9506 /* Subroutine of cp_convert_range_for: given the initializer expression,
9507 builds up the range temporary. */
9509 static tree
9511 {
9514 /* Find out the type deduced by the declaration
9515 `auto &&__range = range_expr'. */
9520 /* Create the __range variable. */
9527 }
9529 /* Used by cp_parser_range_for in template context: we aren't going to
9530 do a full conversion yet, but we still need to resolve auto in the
9531 type of the for-range-declaration if present. This is basically
9532 a shortcut version of cp_convert_range_for. */
9534 static void
9536 {
9539 {
9542 iter_type = (cp_parser_perform_range_for_lookup
9546 tf_warning_or_error);
9549 }
9550 }
9552 /* Converts a range-based for-statement into a normal
9553 for-statement, as per the definition.
9555 for (RANGE_DECL : RANGE_EXPR)
9556 BLOCK
9558 should be equivalent to:
9560 {
9561 auto &&__range = RANGE_EXPR;
9562 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9563 __begin != __end;
9564 ++__begin)
9565 {
9566 RANGE_DECL = *__begin;
9567 BLOCK
9568 }
9569 }
9571 If RANGE_EXPR is an array:
9572 BEGIN_EXPR = __range
9573 END_EXPR = __range + ARRAY_SIZE(__range)
9574 Else if RANGE_EXPR has a member 'begin' or 'end':
9575 BEGIN_EXPR = __range.begin()
9576 END_EXPR = __range.end()
9577 Else:
9578 BEGIN_EXPR = begin(__range)
9579 END_EXPR = end(__range);
9581 If __range has a member 'begin' but not 'end', or vice versa, we must
9582 still use the second alternative (it will surely fail, however).
9583 When calling begin()/end() in the third alternative we must use
9584 argument dependent lookup, but always considering 'std' as an associated
9585 namespace. */
9587 tree
9589 {
9595 /* If an error happened previously do nothing or else a lot of
9596 unhelpful errors would be issued. */
9598 else
9599 {
9604 LOOKUP_ONLYCONVERTING);
9609 }
9611 /* The new for initialization statement. */
9619 LOOKUP_ONLYCONVERTING);
9628 LOOKUP_ONLYCONVERTING);
9632 /* The new for condition. */
9639 /* The new increment expression. */
9644 /* The declaration is initialized with *__begin inside the loop body. */
9647 tf_warning_or_error),
9649 LOOKUP_ONLYCONVERTING);
9652 }
9654 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9655 We need to solve both at the same time because the method used
9656 depends on the existence of members begin or end.
9657 Returns the type deduced for the iterator expression. */
9659 static tree
9661 {
9663 {
9666 }
9669 {
9674 }
9676 {
9677 /* If RANGE is an array, we will use pointer arithmetic. */
9680 range,
9684 }
9685 else
9686 {
9687 /* If it is not an array, we must do a bit of magic. */
9697 tf_warning_or_error);
9700 tf_warning_or_error);
9703 {
9704 /* Use the member functions. */
9707 else
9713 else
9716 }
9717 else
9718 {
9719 /* Use global functions with ADL. */
9727 tf_warning_or_error);
9729 tf_warning_or_error);
9732 tf_warning_or_error);
9734 tf_warning_or_error);
9737 }
9739 /* Last common checks. */
9741 {
9742 /* If one of the expressions is an error do no more checks. */
9745 }
9746 else
9747 {
9749 /* The unqualified type of the __begin and __end temporaries should
9750 be the same, as required by the multiple auto declaration. */
9756 }
9757 }
9758 }
9760 /* Helper function for cp_parser_perform_range_for_lookup.
9761 Builds a tree for RANGE.IDENTIFIER(). */
9763 static tree
9765 {
9778 tf_warning_or_error);
9781 }
9783 /* Parse an iteration-statement.
9785 iteration-statement:
9786 while ( condition ) statement
9787 do statement while ( expression ) ;
9788 for ( for-init-statement condition [opt] ; expression [opt] )
9789 statement
9791 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9793 static tree
9795 {
9798 tree statement;
9801 /* Peek at the next token. */
9806 /* Remember whether or not we are already within an iteration
9807 statement. */
9810 /* See what kind of keyword it is. */
9813 {
9815 {
9816 tree condition;
9818 /* Begin the while-statement. */
9820 /* Look for the `('. */
9822 /* Parse the condition. */
9825 /* Look for the `)'. */
9827 /* Parse the dependent statement. */
9831 /* We're done with the while-statement. */
9833 }
9837 {
9838 tree expression;
9840 /* Begin the do-statement. */
9842 /* Parse the body of the do-statement. */
9847 /* Look for the `while' keyword. */
9849 /* Look for the `('. */
9851 /* Parse the expression. */
9853 /* We're done with the do-statement. */
9855 /* Look for the `)'. */
9857 /* Look for the `;'. */
9859 }
9863 {
9864 /* Look for the `('. */
9869 /* Look for the `)'. */
9872 /* Parse the body of the for-statement. */
9877 /* We're done with the for-statement. */
9879 }
9886 }
9889 }
9891 /* Parse a for-init-statement or the declarator of a range-based-for.
9892 Returns true if a range-based-for declaration is seen.
9894 for-init-statement:
9895 expression-statement
9896 simple-declaration */
9898 static bool
9900 {
9901 /* If the next token is a `;', then we have an empty
9902 expression-statement. Grammatically, this is also a
9903 simple-declaration, but an invalid one, because it does not
9904 declare anything. Therefore, if we did not handle this case
9905 specially, we would issue an error message about an invalid
9906 declaration. */
9908 {
9914 /* We're going to speculatively look for a declaration, falling back
9915 to an expression, if necessary. */
9917 /* Parse the declaration. */
9920 decl);
9923 {
9924 /* It is a range-for, consume the ':' */
9928 {
9930 "range-based %<for%> loops are not allowed "
9933 }
9934 }
9935 else
9936 /* The ';' is not consumed yet because we told
9937 cp_parser_simple_declaration not to. */
9942 /* If the tentative parse failed, then we shall need to look for an
9943 expression-statement. */
9944 }
9945 /* If we are here, it is an expression-statement. */
9948 }
9950 /* Parse a jump-statement.
9952 jump-statement:
9953 break ;
9954 continue ;
9955 return expression [opt] ;
9956 return braced-init-list ;
9957 goto identifier ;
9959 GNU extension:
9961 jump-statement:
9962 goto * expression ;
9964 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9966 static tree
9968 {
9974 /* Peek at the next token. */
9979 /* See what kind of keyword it is. */
9982 {
9986 {
10001 }
10007 {
10020 }
10025 {
10026 tree expr;
10030 {
10033 }
10036 else
10037 /* If the next token is a `;', then there is no
10038 expression. */
10040 /* Build the return-statement. */
10042 /* Look for the final `;'. */
10044 }
10048 /* Create the goto-statement. */
10050 {
10051 /* Issue a warning about this use of a GNU extension. */
10053 /* Consume the '*' token. */
10055 /* Parse the dependent expression. */
10057 }
10058 else
10060 /* Look for the final `;'. */
10067 }
10070 }
10072 /* Parse a declaration-statement.
10074 declaration-statement:
10075 block-declaration */
10077 static void
10079 {
10082 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10085 /* Parse the block-declaration. */
10088 /* Free any declarators allocated. */
10091 /* Finish off the statement. */
10093 }
10095 /* Some dependent statements (like `if (cond) statement'), are
10096 implicitly in their own scope. In other words, if the statement is
10097 a single statement (as opposed to a compound-statement), it is
10098 none-the-less treated as if it were enclosed in braces. Any
10099 declarations appearing in the dependent statement are out of scope
10100 after control passes that point. This function parses a statement,
10101 but ensures that is in its own scope, even if it is not a
10102 compound-statement.
10104 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10105 is a (possibly labeled) if statement which is not enclosed in
10106 braces and has an else clause. This is used to implement
10107 -Wparentheses.
10109 Returns the new statement. */
10111 static tree
10113 {
10114 tree statement;
10119 /* Mark if () ; with a special NOP_EXPR. */
10121 {
10125 }
10126 /* if a compound is opened, we simply parse the statement directly. */
10129 /* If the token is not a `{', then we must take special action. */
10130 else
10131 {
10132 /* Create a compound-statement. */
10134 /* Parse the dependent-statement. */
10136 /* Finish the dummy compound-statement. */
10138 }
10140 /* Return the statement. */
10142 }
10144 /* For some dependent statements (like `while (cond) statement'), we
10145 have already created a scope. Therefore, even if the dependent
10146 statement is a compound-statement, we do not want to create another
10147 scope. */
10149 static void
10151 {
10152 /* If the token is a `{', then we must take special action. */
10155 else
10156 {
10157 /* Avoid calling cp_parser_compound_statement, so that we
10158 don't create a new scope. Do everything else by hand. */
10160 /* If the next keyword is `__label__' we have a label declaration. */
10163 /* Parse an (optional) statement-seq. */
10166 }
10167 }
10169 /* Declarations [gram.dcl.dcl] */
10171 /* Parse an optional declaration-sequence.
10173 declaration-seq:
10174 declaration
10175 declaration-seq declaration */
10177 static void
10179 {
10181 {
10192 {
10193 /* A declaration consisting of a single semicolon is
10194 invalid. Allow it unless we're being pedantic. */
10199 }
10201 /* If we're entering or exiting a region that's implicitly
10202 extern "C", modify the lang context appropriately. */
10204 {
10207 }
10209 {
10212 }
10215 {
10216 /* A top-level declaration can consist solely of a #pragma.
10217 A nested declaration cannot, so this is done here and not
10218 in cp_parser_declaration. (A #pragma at block scope is
10219 handled in cp_parser_statement.) */
10222 }
10224 /* Parse the declaration itself. */
10226 }
10227 }
10229 /* Parse a declaration.
10231 declaration:
10232 block-declaration
10233 function-definition
10234 template-declaration
10235 explicit-instantiation
10236 explicit-specialization
10237 linkage-specification
10238 namespace-definition
10240 GNU extension:
10242 declaration:
10243 __extension__ declaration */
10245 static void
10247 {
10248 cp_token token1;
10249 cp_token token2;
10254 /* Check for the `__extension__' keyword. */
10256 {
10257 /* Parse the qualified declaration. */
10259 /* Restore the PEDANTIC flag. */
10263 }
10265 /* Try to figure out what kind of declaration is present. */
10270 else
10271 {
10274 }
10276 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10279 /* If the next token is `extern' and the following token is a string
10280 literal, then we have a linkage specification. */
10284 /* If the next token is `template', then we have either a template
10285 declaration, an explicit instantiation, or an explicit
10286 specialization. */
10288 {
10289 /* `template <>' indicates a template specialization. */
10293 /* `template <' indicates a template declaration. */
10296 /* Anything else must be an explicit instantiation. */
10297 else
10299 }
10300 /* If the next token is `export', then we have a template
10301 declaration. */
10304 /* If the next token is `extern', 'static' or 'inline' and the one
10305 after that is `template', we have a GNU extended explicit
10306 instantiation directive. */
10313 /* If the next token is `namespace', check for a named or unnamed
10314 namespace definition. */
10320 /* An unnamed namespace definition. */
10324 /* An inline (associated) namespace definition. */
10328 /* Objective-C++ declaration/definition. */
10335 /* We must have either a block declaration or a function
10336 definition. */
10337 else
10338 /* Try to parse a block-declaration, or a function-definition. */
10341 /* Free any declarators allocated. */
10343 }
10345 /* Parse a block-declaration.
10347 block-declaration:
10348 simple-declaration
10349 asm-definition
10350 namespace-alias-definition
10351 using-declaration
10352 using-directive
10354 GNU Extension:
10356 block-declaration:
10357 __extension__ block-declaration
10359 C++0x Extension:
10361 block-declaration:
10362 static_assert-declaration
10364 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10365 part of a declaration-statement. */
10367 static void
10370 {
10374 /* Check for the `__extension__' keyword. */
10376 {
10377 /* Parse the qualified declaration. */
10379 /* Restore the PEDANTIC flag. */
10383 }
10385 /* Peek at the next token to figure out which kind of declaration is
10386 present. */
10389 /* If the next keyword is `asm', we have an asm-definition. */
10391 {
10395 }
10396 /* If the next keyword is `namespace', we have a
10397 namespace-alias-definition. */
10400 /* If the next keyword is `using', we have a
10401 using-declaration, a using-directive, or an alias-declaration. */
10403 {
10408 /* If the token after `using' is `namespace', then we have a
10409 using-directive. */
10413 /* If the second token after 'using' is '=', then we have an
10414 alias-declaration. */
10420 /* Otherwise, it's a using-declaration. */
10421 else
10424 }
10425 /* If the next keyword is `__label__' we have a misplaced label
10426 declaration. */
10428 {
10432 /* If the next token is now a `;', consume it. */
10435 }
10436 /* If the next token is `static_assert' we have a static assertion. */
10439 /* Anything else must be a simple-declaration. */
10440 else
10443 }
10445 /* Parse a simple-declaration.
10447 simple-declaration:
10448 decl-specifier-seq [opt] init-declarator-list [opt] ;
10450 init-declarator-list:
10451 init-declarator
10452 init-declarator-list , init-declarator
10454 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10455 function-definition as a simple-declaration.
10457 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10458 parsed declaration if it is an uninitialized single declarator not followed
10459 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10460 if present, will not be consumed. */
10462 static void
10466 {
10467 cp_decl_specifier_seq decl_specifiers;
10474 /* Defer access checks until we know what is being declared; the
10475 checks for names appearing in the decl-specifier-seq should be
10476 done as if we were in the scope of the thing being declared. */
10479 /* Parse the decl-specifier-seq. We have to keep track of whether
10480 or not the decl-specifier-seq declares a named class or
10481 enumeration type, since that is the only case in which the
10482 init-declarator-list is allowed to be empty.
10484 [dcl.dcl]
10486 In a simple-declaration, the optional init-declarator-list can be
10487 omitted only when declaring a class or enumeration, that is when
10488 the decl-specifier-seq contains either a class-specifier, an
10489 elaborated-type-specifier, or an enum-specifier. */
10491 CP_PARSER_FLAGS_OPTIONAL,
10494 /* We no longer need to defer access checks. */
10497 /* In a block scope, a valid declaration must always have a
10498 decl-specifier-seq. By not trying to parse declarators, we can
10499 resolve the declaration/expression ambiguity more quickly. */
10502 {
10505 }
10507 /* If the next two tokens are both identifiers, the code is
10508 erroneous. The usual cause of this situation is code like:
10510 T t;
10512 where "T" should name a type -- but does not. */
10515 {
10516 /* If parsing tentatively, we should commit; we really are
10517 looking at a declaration. */
10519 /* Give up. */
10521 }
10523 /* If we have seen at least one decl-specifier, and the next token
10524 is not a parenthesis, then we must be looking at a declaration.
10525 (After "int (" we might be looking at a functional cast.) */
10532 /* Keep going until we hit the `;' at the end of the simple
10533 declaration. */
10536 CPP_SEMICOLON))
10537 {
10540 tree decl;
10543 {
10544 /* If we are processing next declarator, coma is expected */
10550 }
10551 else
10554 /* Parse the init-declarator. */
10557 function_definition_allowed_p,
10559 declares_class_or_enum,
10561 maybe_range_for_decl);
10562 /* If an error occurred while parsing tentatively, exit quickly.
10563 (That usually happens when in the body of a function; each
10564 statement is treated as a declaration-statement until proven
10565 otherwise.) */
10568 /* Handle function definitions specially. */
10570 {
10571 /* If the next token is a `,', then we are probably
10572 processing something like:
10574 void f() {}, *p;
10576 which is erroneous. */
10578 {
10581 "mixing"
10583 }
10584 /* Otherwise, we're done with the list of declarators. */
10585 else
10586 {
10589 }
10590 }
10593 /* The next token should be either a `,' or a `;'. */
10595 /* If it's a `,', there are more declarators to come. */
10598 /* If it's a `;', we are done. */
10601 /* Anything else is an error. */
10602 else
10603 {
10604 /* If we have already issued an error message we don't need
10605 to issue another one. */
10609 /* Skip tokens until we reach the end of the statement. */
10611 /* If the next token is now a `;', consume it. */
10615 }
10616 /* After the first time around, a function-definition is not
10617 allowed -- even if it was OK at first. For example:
10619 int i, f() {}
10621 is not valid. */
10623 }
10625 /* Issue an error message if no declarators are present, and the
10626 decl-specifier-seq does not itself declare a class or
10627 enumeration. */
10629 {
10632 /* Perform any deferred access checks. */
10634 }
10636 /* Consume the `;'. */
10640 done:
10642 }
10644 /* Parse a decl-specifier-seq.
10646 decl-specifier-seq:
10647 decl-specifier-seq [opt] decl-specifier
10648 decl-specifier attribute-specifier-seq [opt] (C++11)
10650 decl-specifier:
10651 storage-class-specifier
10652 type-specifier
10653 function-specifier
10654 friend
10655 typedef
10657 GNU Extension:
10659 decl-specifier:
10660 attributes
10662 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10664 The parser flags FLAGS is used to control type-specifier parsing.
10666 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10667 flags:
10669 1: one of the decl-specifiers is an elaborated-type-specifier
10670 (i.e., a type declaration)
10671 2: one of the decl-specifiers is an enum-specifier or a
10672 class-specifier (i.e., a type definition)
10674 */
10676 static void
10678 cp_parser_flags flags,
10681 {
10685 cp_decl_spec ds;
10687 /* Clear DECL_SPECS. */
10690 /* Assume no class or enumeration type is declared. */
10693 /* Keep reading specifiers until there are no more to read. */
10695 {
10700 /* Peek at the next token. */
10703 /* Save the first token of the decl spec list for error
10704 reporting. */
10707 /* Handle attributes. */
10709 {
10710 /* Parse the attributes. */
10713 /* In a sequence of declaration specifiers, c++11 attributes
10714 appertain to the type that precede them. In that case
10715 [dcl.spec]/1 says:
10717 The attribute-specifier-seq affects the type only for
10718 the declaration it appears in, not other declarations
10719 involving the same type.
10721 But for now let's force the user to position the
10722 attribute either at the beginning of the declaration or
10723 after the declarator-id, which would clearly mean that it
10724 applies to the declarator. */
10726 {
10728 /* The c++11 attribute is at the beginning of the
10729 declaration. It appertains to the entity being
10731 else
10732 {
10734 {
10735 /* This is an attribute following a
10736 class-specifier. */
10741 }
10742 else
10743 {
10744 decl_specs->std_attributes
10746 attrs);
10749 }
10751 }
10752 }
10754 decl_specs->attributes
10756 attrs);
10760 }
10761 /* Assume we will find a decl-specifier keyword. */
10763 /* If the next token is an appropriate keyword, we can simply
10764 add it to the list. */
10766 {
10767 /* decl-specifier:
10768 friend
10769 constexpr */
10772 {
10775 }
10776 else
10777 {
10779 /* Consume the token. */
10781 }
10789 /* function-specifier:
10790 inline
10791 virtual
10792 explicit */
10799 /* decl-specifier:
10800 typedef */
10803 /* Consume the token. */
10805 /* A constructor declarator cannot appear in a typedef. */
10807 /* The "typedef" keyword can only occur in a declaration; we
10808 may as well commit at this point. */
10815 /* storage-class-specifier:
10816 auto
10817 register
10818 static
10819 extern
10820 mutable
10822 GNU Extension:
10823 thread */
10826 {
10827 /* Consume the token. */
10830 /* Complain about `auto' as a storage specifier, if
10831 we're complaining about C++0x compatibility. */
10835 /* Set the storage class anyway. */
10837 token);
10838 }
10839 else
10840 /* C++0x auto type-specifier. */
10848 /* Consume the token. */
10851 token);
10854 /* Consume the token. */
10860 /* We did not yet find a decl-specifier yet. */
10863 }
10873 /* Constructors are a special case. The `S' in `S()' is not a
10874 decl-specifier; it is the beginning of the declarator. */
10875 constructor_p
10876 = (!found_decl_spec
10877 && constructor_possible_p
10878 && (cp_parser_constructor_declarator_p
10881 /* If we don't have a DECL_SPEC yet, then we must be looking at
10882 a type-specifier. */
10884 {
10887 tree type_spec;
10889 type_spec
10891 decl_specs,
10897 /* If this type-specifier referenced a user-defined type
10898 (a typedef, class-name, etc.), then we can't allow any
10899 more such type-specifiers henceforth.
10901 [dcl.spec]
10903 The longest sequence of decl-specifiers that could
10904 possibly be a type name is taken as the
10905 decl-specifier-seq of a declaration. The sequence shall
10906 be self-consistent as described below.
10908 [dcl.type]
10910 As a general rule, at most one type-specifier is allowed
10911 in the complete decl-specifier-seq of a declaration. The
10912 only exceptions are the following:
10914 -- const or volatile can be combined with any other
10915 type-specifier.
10917 -- signed or unsigned can be combined with char, long,
10918 short, or int.
10920 -- ..
10922 Example:
10924 typedef char* Pc;
10925 void g (const int Pc);
10927 Here, Pc is *not* part of the decl-specifier seq; it's
10928 the declarator. Therefore, once we see a type-specifier
10929 (other than a cv-qualifier), we forbid any additional
10930 user-defined types. We *do* still allow things like `int
10931 int' to be considered a decl-specifier-seq, and issue the
10932 error message later. */
10935 /* A constructor declarator cannot follow a type-specifier. */
10937 {
10942 }
10943 }
10945 /* If we still do not have a DECL_SPEC, then there are no more
10946 decl-specifiers. */
10951 /* After we see one decl-specifier, further decl-specifiers are
10952 always optional. */
10954 }
10956 /* Don't allow a friend specifier with a class definition. */
10961 }
10963 /* Parse an (optional) storage-class-specifier.
10965 storage-class-specifier:
10966 auto
10967 register
10968 static
10969 extern
10970 mutable
10972 GNU Extension:
10974 storage-class-specifier:
10975 thread
10977 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10979 static tree
10981 {
10983 {
10987 /* Fall through for C++98. */
10994 /* Consume the token. */
10999 }
11000 }
11002 /* Parse an (optional) function-specifier.
11004 function-specifier:
11005 inline
11006 virtual
11007 explicit
11009 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11010 Updates DECL_SPECS, if it is non-NULL. */
11012 static tree
11015 {
11018 {
11024 /* 14.5.2.3 [temp.mem]
11026 A member function template shall not be virtual. */
11038 }
11040 /* Consume the token. */
11042 }
11044 /* Parse a linkage-specification.
11046 linkage-specification:
11047 extern string-literal { declaration-seq [opt] }
11048 extern string-literal declaration */
11050 static void
11052 {
11053 tree linkage;
11055 /* Look for the `extern' keyword. */
11058 /* Look for the string-literal. */
11061 /* Transform the literal into an identifier. If the literal is a
11062 wide-character string, or contains embedded NULs, then we can't
11063 handle it as the user wants. */
11066 {
11068 /* Assume C++ linkage. */
11070 }
11071 else
11074 /* We're now using the new linkage. */
11077 /* If the next token is a `{', then we're using the first
11078 production. */
11080 {
11081 /* Consume the `{' token. */
11083 /* Parse the declarations. */
11085 /* Look for the closing `}'. */
11087 }
11088 /* Otherwise, there's just one declaration. */
11089 else
11090 {
11093 saved_in_unbraced_linkage_specification_p
11097 parser->in_unbraced_linkage_specification_p
11099 }
11101 /* We're done with the linkage-specification. */
11103 }
11105 /* Parse a static_assert-declaration.
11107 static_assert-declaration:
11108 static_assert ( constant-expression , string-literal ) ;
11110 If MEMBER_P, this static_assert is a class member. */
11112 static void
11114 {
11115 tree condition;
11116 tree message;
11118 location_t saved_loc;
11121 /* Peek at the `static_assert' token so we can keep track of exactly
11122 where the static assertion started. */
11126 /* Look for the `static_assert' keyword. */
11128 RT_STATIC_ASSERT))
11131 /* We know we are in a static assertion; commit to any tentative
11132 parse. */
11136 /* Parse the `(' starting the static assertion condition. */
11139 /* Parse the constant-expression. Allow a non-constant expression
11140 here in order to give better diagnostics in finish_static_assert. */
11141 condition =
11146 /* Parse the separating `,'. */
11149 /* Parse the string-literal message. */
11154 /* A `)' completes the static assertion. */
11161 /* A semicolon terminates the declaration. */
11164 /* Complete the static assertion, which may mean either processing
11165 the static assert now or saving it for template instantiation. */
11167 }
11169 /* Parse a `decltype' type. Returns the type.
11171 simple-type-specifier:
11172 decltype ( expression ) */
11174 static tree
11176 {
11177 tree expr;
11186 {
11187 /* Already parsed. */
11190 }
11192 /* Look for the `decltype' token. */
11196 /* Types cannot be defined in a `decltype' expression. Save away the
11197 old message. */
11200 /* And create the new one. */
11201 parser->type_definition_forbidden_message
11204 /* The restrictions on constant-expressions do not apply inside
11205 decltype expressions. */
11206 saved_integral_constant_expression_p
11208 saved_non_integral_constant_expression_p
11212 /* Do not actually evaluate the expression. */
11215 /* Do not warn about problems with the expression. */
11218 /* Parse the opening `('. */
11222 /* First, try parsing an id-expression. */
11233 {
11236 cp_id_kind idk;
11240 /* Lookup the name we got back from the id-expression. */
11242 none_type,
11256 {
11257 /* Complete lookup of the id-expression. */
11258 expr = (finish_id_expression
11271 /* We found an id-expression, but it was something that we
11272 should not have found. This is an error, not something
11273 we can recover from, so note that we found an
11274 id-expression and we'll recover as gracefully as
11275 possible. */
11277 }
11282 /* We have an id-expression. */
11284 }
11287 {
11288 /* Abort the id-expression parse. */
11291 /* Parsing tentatively, again. */
11294 /* Parse a class member access. */
11302 /* We have an id-expression. */
11304 }
11307 /* We have parsed the complete id-expression or member access. */
11309 else
11310 {
11313 /* Abort our attempt to parse an id-expression or member access
11314 expression. */
11317 /* Within a parenthesized expression, a `>' token is always
11318 the greater-than operator. */
11319 saved_greater_than_is_operator_p
11323 /* Parse a full expression. */
11326 /* The `>' token might be the end of a template-id or
11327 template-parameter-list now. */
11328 parser->greater_than_is_operator_p
11330 }
11332 /* Go back to evaluating expressions. */
11336 /* Restore the old message and the integral constant expression
11337 flags. */
11339 parser->integral_constant_expression_p
11341 parser->non_integral_constant_expression_p
11344 /* Parse to the closing `)'. */
11346 {
11350 }
11353 tf_warning_or_error);
11355 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11356 it again. */
11363 }
11365 /* Special member functions [gram.special] */
11367 /* Parse a conversion-function-id.
11369 conversion-function-id:
11370 operator conversion-type-id
11372 Returns an IDENTIFIER_NODE representing the operator. */
11374 static tree
11376 {
11377 tree type;
11378 tree saved_scope;
11379 tree saved_qualifying_scope;
11380 tree saved_object_scope;
11383 /* Look for the `operator' token. */
11386 /* When we parse the conversion-type-id, the current scope will be
11387 reset. However, we need that information in able to look up the
11388 conversion function later, so we save it here. */
11392 /* We must enter the scope of the class so that the names of
11393 entities declared within the class are available in the
11394 conversion-type-id. For example, consider:
11396 struct S {
11397 typedef int I;
11398 operator I();
11399 };
11401 S::operator I() { ... }
11403 In order to see that `I' is a type-name in the definition, we
11404 must be in the scope of `S'. */
11407 /* Parse the conversion-type-id. */
11409 /* Leave the scope of the class, if any. */
11412 /* Restore the saved scope. */
11416 /* If the TYPE is invalid, indicate failure. */
11420 }
11422 /* Parse a conversion-type-id:
11424 conversion-type-id:
11425 type-specifier-seq conversion-declarator [opt]
11427 Returns the TYPE specified. */
11429 static tree
11431 {
11432 tree attributes;
11433 cp_decl_specifier_seq type_specifiers;
11435 tree type_specified;
11437 /* Parse the attributes. */
11439 /* Parse the type-specifiers. */
11443 /* If that didn't work, stop. */
11446 /* Parse the conversion-declarator. */
11454 /* Don't give this error when parsing tentatively. This happens to
11455 work because we always parse this definitively once. */
11458 {
11460 {
11463 }
11467 }
11470 }
11472 /* Parse an (optional) conversion-declarator.
11474 conversion-declarator:
11475 ptr-operator conversion-declarator [opt]
11477 */
11481 {
11484 cp_cv_quals cv_quals;
11486 /* We don't know if there's a ptr-operator next, or not. */
11488 /* Try the ptr-operator. */
11491 /* If it worked, look for more conversion-declarators. */
11493 {
11496 /* Parse another optional declarator. */
11499 declarator = cp_parser_make_indirect_declarator
11503 }
11506 }
11508 /* Parse an (optional) ctor-initializer.
11510 ctor-initializer:
11511 : mem-initializer-list
11513 Returns TRUE iff the ctor-initializer was actually present. */
11515 static bool
11517 {
11518 /* If the next token is not a `:', then there is no
11519 ctor-initializer. */
11521 {
11522 /* Do default initialization of any bases and members. */
11527 }
11529 /* Consume the `:' token. */
11531 /* And the mem-initializer-list. */
11535 }
11537 /* Parse a mem-initializer-list.
11539 mem-initializer-list:
11540 mem-initializer ... [opt]
11541 mem-initializer ... [opt] , mem-initializer-list */
11543 static void
11545 {
11550 /* Let the semantic analysis code know that we are starting the
11551 mem-initializer-list. */
11556 /* Loop through the list. */
11558 {
11559 tree mem_initializer;
11562 /* Parse the mem-initializer. */
11564 /* If the next token is a `...', we're expanding member initializers. */
11566 {
11567 /* Consume the `...'. */
11570 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11571 can be expanded but members cannot. */
11574 {
11579 }
11581 /* Construct the pack expansion type. */
11584 }
11587 {
11591 }
11592 /* Look for a target constructor. */
11596 {
11599 {
11603 }
11605 }
11606 /* Add it to the list, unless it was erroneous. */
11608 {
11611 }
11612 /* If the next token is not a `,', we're done. */
11615 /* Consume the `,' token. */
11617 }
11619 /* Perform semantic analysis. */
11622 }
11624 /* Parse a mem-initializer.
11626 mem-initializer:
11627 mem-initializer-id ( expression-list [opt] )
11628 mem-initializer-id braced-init-list
11630 GNU extension:
11632 mem-initializer:
11633 ( expression-list [opt] )
11635 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11636 class) or FIELD_DECL (for a non-static data member) to initialize;
11637 the TREE_VALUE is the expression-list. An empty initialization
11638 list is represented by void_list_node. */
11640 static tree
11642 {
11643 tree mem_initializer_id;
11644 tree expression_list;
11645 tree member;
11648 /* Find out what is being initialized. */
11650 {
11654 }
11655 else
11656 {
11660 }
11666 {
11672 }
11673 else
11674 {
11684 }
11694 }
11696 /* Parse a mem-initializer-id.
11698 mem-initializer-id:
11699 :: [opt] nested-name-specifier [opt] class-name
11700 identifier
11702 Returns a TYPE indicating the class to be initializer for the first
11703 production. Returns an IDENTIFIER_NODE indicating the data member
11704 to be initialized for the second production. */
11706 static tree
11708 {
11712 tree id;
11716 /* `typename' is not allowed in this context ([temp.res]). */
11718 {
11720 "keyword %<typename%> not allowed in this context (a qualified "
11723 }
11724 /* Look for the optional `::' operator. */
11725 global_scope_p
11729 /* Look for the optional nested-name-specifier. The simplest way to
11730 implement:
11732 [temp.res]
11734 The keyword `typename' is not permitted in a base-specifier or
11735 mem-initializer; in these contexts a qualified name that
11736 depends on a template-parameter is implicitly assumed to be a
11737 type name.
11739 is to assume that we have seen the `typename' keyword at this
11740 point. */
11741 nested_name_specifier_p
11750 /* If there is a `::' operator or a nested-name-specifier, then we
11751 are definitely looking for a class-name. */
11756 typename_type,
11760 /* Otherwise, we could also be looking for an ordinary identifier. */
11762 /* Try a class-name. */
11766 none_type,
11770 /* If we found one, we're done. */
11773 /* Otherwise, look for an ordinary identifier. */
11775 }
11777 /* Overloading [gram.over] */
11779 /* Parse an operator-function-id.
11781 operator-function-id:
11782 operator operator
11784 Returns an IDENTIFIER_NODE for the operator which is a
11785 human-readable spelling of the identifier, e.g., `operator +'. */
11787 static tree
11789 {
11790 /* Look for the `operator' keyword. */
11793 /* And then the name of the operator itself. */
11795 }
11797 /* Return an identifier node for a user-defined literal operator.
11798 The suffix identifier is chained to the operator name identifier. */
11800 static tree
11802 {
11803 tree identifier;
11808 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11811 }
11813 /* Parse an operator.
11815 operator:
11816 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11817 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11818 || ++ -- , ->* -> () []
11820 GNU Extensions:
11822 operator:
11823 <? >? <?= >?=
11825 Returns an IDENTIFIER_NODE for the operator which is a
11826 human-readable spelling of the identifier, e.g., `operator +'. */
11828 static tree
11830 {
11834 /* Peek at the next token. */
11836 /* Figure out which operator we have. */
11838 {
11840 {
11843 /* The keyword should be either `new' or `delete'. */
11848 else
11851 /* Consume the `new' or `delete' token. */
11854 /* Peek at the next token. */
11856 /* If it's a `[' token then this is the array variant of the
11857 operator. */
11859 {
11860 /* Consume the `[' token. */
11862 /* Look for the `]' token. */
11866 }
11867 /* Otherwise, we have the non-array variant. */
11868 else
11872 }
12019 /* Consume the `('. */
12021 /* Look for the matching `)'. */
12026 /* Consume the `['. */
12028 /* Look for the matching `]'. */
12036 {
12039 }
12040 /* Consume the string. */
12042 /* Look for the suffix identifier. */
12045 {
12048 {
12051 }
12052 }
12053 else
12054 {
12057 }
12064 /* Anything else is an error. */
12066 }
12068 /* If we have selected an identifier, we need to consume the
12069 operator token. */
12072 /* Otherwise, no valid operator name was present. */
12073 else
12074 {
12077 }
12080 }
12082 /* Parse a template-declaration.
12084 template-declaration:
12085 export [opt] template < template-parameter-list > declaration
12087 If MEMBER_P is TRUE, this template-declaration occurs within a
12088 class-specifier.
12090 The grammar rule given by the standard isn't correct. What
12091 is really meant is:
12093 template-declaration:
12094 export [opt] template-parameter-list-seq
12095 decl-specifier-seq [opt] init-declarator [opt] ;
12096 export [opt] template-parameter-list-seq
12097 function-definition
12099 template-parameter-list-seq:
12100 template-parameter-list-seq [opt]
12101 template < template-parameter-list > */
12103 static void
12105 {
12106 /* Check for `export'. */
12108 {
12109 /* Consume the `export' token. */
12111 /* Warn that we do not support `export'. */
12113 }
12116 }
12118 /* Parse a template-parameter-list.
12120 template-parameter-list:
12121 template-parameter
12122 template-parameter-list , template-parameter
12124 Returns a TREE_LIST. Each node represents a template parameter.
12125 The nodes are connected via their TREE_CHAINs. */
12127 static tree
12129 {
12134 /* The loop below parses the template parms. We first need to know
12135 the total number of template parms to be able to compute proper
12136 canonical types of each dependent type. So after the loop, when
12137 we know the total number of template parms,
12138 end_template_parm_list computes the proper canonical types and
12139 fixes up the dependent types accordingly. */
12141 {
12142 tree parameter;
12145 location_t parm_loc;
12147 /* Parse the template-parameter. */
12152 /* Add it to the list. */
12155 parm_loc,
12156 parameter,
12157 is_non_type,
12158 is_parameter_pack);
12159 else
12160 {
12163 }
12165 /* If the next token is not a `,', we're done. */
12168 /* Otherwise, consume the `,' token. */
12170 }
12173 }
12175 /* Parse a template-parameter.
12177 template-parameter:
12178 type-parameter
12179 parameter-declaration
12181 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12182 the parameter. The TREE_PURPOSE is the default value, if any.
12183 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12184 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12185 set to true iff this parameter is a parameter pack. */
12187 static tree
12190 {
12194 tree parm;
12196 /* Assume it is a type parameter or a template parameter. */
12198 /* Assume it not a parameter pack. */
12200 /* Peek at the next token. */
12202 /* If it is `class' or `template', we have a type-parameter. */
12205 /* If it is `class' or `typename' we do not know yet whether it is a
12206 type parameter or a non-type parameter. Consider:
12208 template <typename T, typename T::X X> ...
12210 or:
12212 template <class C, class D*> ...
12214 Here, the first parameter is a type parameter, and the second is
12215 a non-type parameter. We can tell by looking at the token after
12216 the identifier -- if it is a `,', `=', or `>' then we have a type
12217 parameter. */
12219 {
12220 /* Peek at the token after `class' or `typename'. */
12222 /* If it's an ellipsis, we have a template type parameter
12223 pack. */
12226 /* If it's an identifier, skip it. */
12229 /* Now, see if the token looks like the end of a template
12230 parameter. */
12235 }
12237 /* Otherwise, it is a non-type parameter.
12239 [temp.param]
12241 When parsing a default template-argument for a non-type
12242 template-parameter, the first non-nested `>' is taken as the end
12243 of the template parameter-list rather than a greater-than
12244 operator. */
12246 parameter_declarator
12250 /* If the parameter declaration is marked as a parameter pack, set
12251 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12252 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12253 grokdeclarator. */
12257 {
12260 }
12264 {
12265 /* Can happen in some cases of erroneous input (c++/34892). */
12267 /* Consume the `...' for better error recovery. */
12269 }
12270 /* If the next token is an ellipsis, and we don't already have it
12271 marked as a parameter pack, then we have a parameter pack (that
12272 has no declarator). */
12275 && (declarator_can_be_parameter_pack
12277 {
12278 /* Consume the `...'. */
12283 }
12284 /* We might end up with a pack expansion as the type of the non-type
12285 template parameter, in which case this is a non-type template
12286 parameter pack. */
12290 {
12294 }
12297 {
12298 /* Parameter packs cannot have default arguments. However, a
12299 user may try to do so, so we'll parse them and give an
12300 appropriate diagnostic here. */
12304 /* Find the name of the parameter pack. */
12313 else
12317 /* Parse the default argument, but throw away the result. */
12319 }
12329 }
12331 /* Parse a type-parameter.
12333 type-parameter:
12334 class identifier [opt]
12335 class identifier [opt] = type-id
12336 typename identifier [opt]
12337 typename identifier [opt] = type-id
12338 template < template-parameter-list > class identifier [opt]
12339 template < template-parameter-list > class identifier [opt]
12340 = id-expression
12342 GNU Extension (variadic templates):
12344 type-parameter:
12345 class ... identifier [opt]
12346 typename ... identifier [opt]
12348 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12349 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12350 the declaration of the parameter.
12352 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12354 static tree
12356 {
12358 tree parameter;
12360 /* Look for a keyword to tell us what kind of parameter this is. */
12366 {
12369 {
12370 tree identifier;
12371 tree default_argument;
12373 /* If the next token is an ellipsis, we have a template
12374 argument pack. */
12376 {
12377 /* Consume the `...' token. */
12382 }
12384 /* If the next token is an identifier, then it names the
12385 parameter. */
12388 else
12391 /* Create the parameter. */
12394 /* If the next token is an `=', we have a default argument. */
12396 {
12397 /* Consume the `=' token. */
12399 /* Parse the default-argument. */
12403 /* Template parameter packs cannot have default
12404 arguments. */
12406 {
12409 "template parameter pack %qD cannot have a "
12411 else
12413 "template parameter packs cannot have "
12416 }
12418 }
12419 else
12422 /* Create the combined representation of the parameter and the
12423 default argument. */
12425 }
12429 {
12430 tree identifier;
12431 tree default_argument;
12433 /* Look for the `<'. */
12435 /* Parse the template-parameter-list. */
12437 /* Look for the `>'. */
12439 /* Look for the `class' keyword. */
12441 /* If the next token is an ellipsis, we have a template
12442 argument pack. */
12444 {
12445 /* Consume the `...' token. */
12450 }
12451 /* If the next token is an `=', then there is a
12452 default-argument. If the next token is a `>', we are at
12453 the end of the parameter-list. If the next token is a `,',
12454 then we are at the end of this parameter. */
12458 {
12460 /* Treat invalid names as if the parameter were nameless. */
12463 }
12464 else
12467 /* Create the template parameter. */
12469 identifier);
12471 /* If the next token is an `=', then there is a
12472 default-argument. */
12474 {
12477 /* Consume the `='. */
12479 /* Parse the id-expression. */
12481 /* save token before parsing the id-expression, for error
12482 reporting */
12484 default_argument
12492 /* If the id-expression was a template-id that refers to
12493 a template-class, we already have the declaration here,
12494 so no further lookup is needed. */
12495 ;
12496 else
12497 /* Look up the name. */
12498 default_argument
12500 none_type,
12506 /* See if the default argument is valid. */
12507 default_argument
12510 /* Template parameter packs cannot have default
12511 arguments. */
12513 {
12516 "template parameter pack %qD cannot "
12518 identifier);
12519 else
12523 }
12525 }
12526 else
12529 /* Create the combined representation of the parameter and the
12530 default argument. */
12532 }
12538 }
12541 }
12543 /* Parse a template-id.
12545 template-id:
12546 template-name < template-argument-list [opt] >
12548 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12549 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12550 returned. Otherwise, if the template-name names a function, or set
12551 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12552 names a class, returns a TYPE_DECL for the specialization.
12554 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12555 uninstantiated templates. */
12557 static tree
12563 {
12565 tree templ;
12566 tree arguments;
12567 tree template_id;
12574 /* If the next token corresponds to a template-id, there is no need
12575 to reparse it. */
12578 {
12581 /* Get the stored value. */
12583 /* Perform any access checks that were deferred. */
12586 {
12591 tf_warning_or_error);
12592 }
12593 /* Return the stored value. */
12595 }
12597 /* Avoid performing name lookup if there is no possibility of
12598 finding a template-id. */
12601 && !cp_parser_nth_token_starts_template_argument_list_p
12603 {
12606 }
12608 /* Remember where the template-id starts. */
12614 /* Parse the template-name. */
12617 check_dependency_p,
12618 is_declaration,
12619 tag_type,
12622 {
12625 }
12627 /* If we find the sequence `[:' after a template-name, it's probably
12628 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12629 parse correctly the argument list. */
12636 {
12638 /* Change `:' into `::'. */
12640 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12641 CPP_LESS. */
12644 /* Parse the arguments. */
12647 {
12648 /* If we couldn't parse an argument list, then we revert our changes
12649 and return simply an error. Maybe this is not a template-id
12650 after all. */
12655 }
12656 /* Otherwise, emit an error about the invalid digraph, but continue
12657 parsing because we got our argument list. */
12660 {
12663 "%<<:%> is an alternate spelling for %<[%>."
12666 {
12668 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
12671 }
12672 }
12673 }
12674 else
12675 {
12676 /* Look for the `<' that starts the template-argument-list. */
12678 {
12681 }
12682 /* Parse the arguments. */
12684 }
12686 /* Build a representation of the specialization. */
12689 TEMPLATE_ID_EXPR,
12693 {
12695 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12696 template (rather than some instantiation thereof) only if
12697 is not nested within some other construct. For example, in
12698 "template <typename T> void f(T) { A<T>::", A<T> is just an
12699 instantiation of A. */
12702 CPP_SCOPE));
12703 template_id
12705 }
12706 else
12707 {
12708 /* If it's not a class-template or a template-template, it should be
12709 a function-template. */
12715 }
12717 /* If parsing tentatively, replace the sequence of tokens that makes
12718 up the template-id with a CPP_TEMPLATE_ID token. That way,
12719 should we re-parse the token stream, we will not have to repeat
12720 the effort required to do the parse, nor will we issue duplicate
12721 error messages about problems during instantiation of the
12722 template. */
12724 {
12727 /* Reset the contents of the START_OF_ID token. */
12729 /* Retrieve any deferred checks. Do not pop this access checks yet
12730 so the memory will not be reclaimed during token replacing below. */
12736 /* Purge all subsequent tokens. */
12739 /* ??? Can we actually assume that, if template_id ==
12740 error_mark_node, we will have issued a diagnostic to the
12741 user, as opposed to simply marking the tentative parse as
12742 failed? */
12745 }
12749 }
12751 /* Parse a template-name.
12753 template-name:
12754 identifier
12756 The standard should actually say:
12758 template-name:
12759 identifier
12760 operator-function-id
12762 A defect report has been filed about this issue.
12764 A conversion-function-id cannot be a template name because they cannot
12765 be part of a template-id. In fact, looking at this code:
12767 a.operator K<int>()
12769 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12770 It is impossible to call a templated conversion-function-id with an
12771 explicit argument list, since the only allowed template parameter is
12772 the type to which it is converting.
12774 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12775 `template' keyword, in a construction like:
12777 T::template f<3>()
12779 In that case `f' is taken to be a template-name, even though there
12780 is no way of knowing for sure.
12782 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12783 name refers to a set of overloaded functions, at least one of which
12784 is a template, or an IDENTIFIER_NODE with the name of the template,
12785 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12786 names are looked up inside uninstantiated templates. */
12788 static tree
12795 {
12796 tree identifier;
12797 tree decl;
12798 tree fns;
12801 /* If the next token is `operator', then we have either an
12802 operator-function-id or a conversion-function-id. */
12804 {
12805 /* We don't know whether we're looking at an
12806 operator-function-id or a conversion-function-id. */
12808 /* Try an operator-function-id. */
12810 /* If that didn't work, try a conversion-function-id. */
12812 {
12815 }
12816 }
12817 /* Look for the identifier. */
12818 else
12821 /* If we didn't find an identifier, we don't have a template-id. */
12825 /* If the name immediately followed the `template' keyword, then it
12826 is a template-name. However, if the next token is not `<', then
12827 we do not treat it as a template-name, since it is not being used
12828 as part of a template-id. This enables us to handle constructs
12829 like:
12831 template <typename T> struct S { S(); };
12832 template <typename T> S<T>::S();
12834 correctly. We would treat `S' as a template -- if it were `S<T>'
12835 -- but we do not if there is no `<'. */
12839 {
12840 /* In a declaration, in a dependent context, we pretend that the
12841 "template" keyword was present in order to improve error
12842 recovery. For example, given:
12844 template <typename T> void f(T::X<int>);
12846 we want to treat "X<int>" as a template-id. */
12848 && !template_keyword_p
12850 && check_dependency_p
12852 /* Do not do this for dtors (or ctors), since they never
12853 need the template keyword before their name. */
12855 {
12858 /* Explain what went wrong. */
12860 identifier);
12863 /* If parsing tentatively, find the location of the "<" token. */
12866 /* Parse the template arguments so that we can issue error
12867 messages about them. */
12870 /* Skip tokens until we find a good place from which to
12871 continue parsing. */
12876 /* If parsing tentatively, permanently remove the
12877 template argument list. That will prevent duplicate
12878 error messages from being issued about the missing
12879 "template" keyword. */
12885 }
12887 /* If the "template" keyword is present, then there is generally
12888 no point in doing name-lookup, so we just return IDENTIFIER.
12889 But, if the qualifying scope is non-dependent then we can
12890 (and must) do name-lookup normally. */
12896 }
12898 /* Look up the name. */
12900 tag_type,
12903 check_dependency_p,
12907 /* If DECL is a template, then the name was a template-name. */
12909 ;
12910 else
12911 {
12914 /* The standard does not explicitly indicate whether a name that
12915 names a set of overloaded declarations, some of which are
12916 templates, is a template-name. However, such a name should
12917 be a template-name; otherwise, there is no way to form a
12918 template-id for the overloaded templates. */
12926 {
12927 /* The name does not name a template. */
12930 }
12931 }
12933 /* If DECL is dependent, and refers to a function, then just return
12934 its name; we will look it up again during template instantiation. */
12936 {
12940 }
12943 }
12945 /* Parse a template-argument-list.
12947 template-argument-list:
12948 template-argument ... [opt]
12949 template-argument-list , template-argument ... [opt]
12951 Returns a TREE_VEC containing the arguments. */
12953 static tree
12955 {
12960 tree vec;
12967 /* Even if the template-id appears in an integral
12968 constant-expression, the contents of the argument list do
12969 not. */
12975 /* Parse the arguments. */
12976 do
12977 {
12978 tree argument;
12981 /* Consume the comma. */
12984 /* Parse the template-argument. */
12987 /* If the next token is an ellipsis, we're expanding a template
12988 argument pack. */
12990 {
12992 {
12996 }
12997 /* Consume the `...' token. */
13000 /* Make the argument into a TYPE_PACK_EXPANSION or
13001 EXPR_PACK_EXPANSION. */
13003 }
13006 {
13010 {
13013 }
13014 else
13016 }
13018 }
13031 #ifdef ENABLE_CHECKING
13033 #endif
13035 }
13037 /* Parse a template-argument.
13039 template-argument:
13040 assignment-expression
13041 type-id
13042 id-expression
13044 The representation is that of an assignment-expression, type-id, or
13045 id-expression -- except that the qualified id-expression is
13046 evaluated, so that the value returned is either a DECL or an
13047 OVERLOAD.
13049 Although the standard says "assignment-expression", it forbids
13050 throw-expressions or assignments in the template argument.
13051 Therefore, we use "conditional-expression" instead. */
13053 static tree
13055 {
13056 tree argument;
13062 cp_id_kind idk;
13064 /* There's really no way to know what we're looking at, so we just
13065 try each alternative in order.
13067 [temp.arg]
13069 In a template-argument, an ambiguity between a type-id and an
13070 expression is resolved to a type-id, regardless of the form of
13071 the corresponding template-parameter.
13073 Therefore, we try a type-id first. */
13076 /* If there was no error parsing the type-id but the next token is a
13077 '>>', our behavior depends on which dialect of C++ we're
13078 parsing. In C++98, we probably found a typo for '> >'. But there
13079 are type-id which are also valid expressions. For instance:
13081 struct X { int operator >> (int); };
13082 template <int V> struct Foo {};
13083 Foo<X () >> 5> r;
13085 Here 'X()' is a valid type-id of a function type, but the user just
13086 wanted to write the expression "X() >> 5". Thus, we remember that we
13087 found a valid type-id, but we still try to parse the argument as an
13088 expression to see what happens.
13090 In C++0x, the '>>' will be considered two separate '>'
13091 tokens. */
13095 {
13098 }
13099 else
13100 {
13101 /* If the next token isn't a `,' or a `>', then this argument wasn't
13102 really finished. This means that the argument is not a valid
13103 type-id. */
13106 /* If that worked, we're done. */
13109 }
13110 /* We're still not sure what the argument will be. */
13112 /* Try a template. */
13120 /* If the next token isn't a `,' or a `>', then this argument wasn't
13121 really finished. */
13125 {
13126 /* Figure out what is being referred to. If the id-expression
13127 was for a class template specialization, then we will have a
13128 TYPE_DECL at this point. There is no need to do name lookup
13129 at this point in that case. */
13132 none_type,
13141 }
13144 /* It must be a non-type argument. There permitted cases are given
13145 in [temp.arg.nontype]:
13147 -- an integral constant-expression of integral or enumeration
13148 type; or
13150 -- the name of a non-type template-parameter; or
13152 -- the name of an object or function with external linkage...
13154 -- the address of an object or function with external linkage...
13156 -- a pointer to member... */
13157 /* Look for a non-type template parameter. */
13159 {
13171 }
13173 /* If the next token is "&", the argument must be the address of an
13174 object or function with external linkage. */
13177 {
13180 }
13181 /* See if we might have an id-expression. */
13188 {
13191 address_p,
13198 else
13199 {
13200 tree probe;
13203 {
13206 }
13208 /* If we're in a template, we represent a qualified-id referring
13209 to a static data member as a SCOPE_REF even if the scope isn't
13210 dependent so that we can check access control later. */
13215 {
13216 /* A variable without external linkage might still be a
13217 valid constant-expression, so no error is issued here
13218 if the external-linkage check fails. */
13221 }
13223 /* All overloaded functions are allowed; if the external
13224 linkage test does not pass, an error will be issued
13225 later. */
13226 ;
13230 /* A pointer-to-member. */
13231 ;
13233 ;
13234 else
13238 {
13241 tf_warning_or_error);
13243 }
13244 }
13245 }
13246 /* If the argument started with "&", there are no other valid
13247 alternatives at this point. */
13249 {
13252 }
13254 /* If the argument wasn't successfully parsed as a type-id followed
13255 by '>>', the argument can only be a constant expression now.
13256 Otherwise, we try parsing the constant-expression tentatively,
13257 because the argument could really be a type-id. */
13270 /* We did our best to parse the argument as a non type-id, but that
13271 was the only alternative that matched (albeit with a '>' after
13272 it). We can assume it's just a typo from the user, and a
13273 diagnostic will then be issued. */
13275 }
13277 /* Parse an explicit-instantiation.
13279 explicit-instantiation:
13280 template declaration
13282 Although the standard says `declaration', what it really means is:
13284 explicit-instantiation:
13285 template decl-specifier-seq [opt] declarator [opt] ;
13287 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13288 supposed to be allowed. A defect report has been filed about this
13289 issue.
13291 GNU Extension:
13293 explicit-instantiation:
13294 storage-class-specifier template
13295 decl-specifier-seq [opt] declarator [opt] ;
13296 function-specifier template
13297 decl-specifier-seq [opt] declarator [opt] ; */
13299 static void
13301 {
13303 cp_decl_specifier_seq decl_specifiers;
13308 /* Look for an (optional) storage-class-specifier or
13309 function-specifier. */
13311 {
13312 extension_specifier
13315 extension_specifier
13318 }
13320 /* Look for the `template' keyword. */
13322 /* Let the front end know that we are processing an explicit
13323 instantiation. */
13325 /* [temp.explicit] says that we are supposed to ignore access
13326 control while processing explicit instantiation directives. */
13328 /* Parse a decl-specifier-seq. */
13330 CP_PARSER_FLAGS_OPTIONAL,
13333 /* If there was exactly one decl-specifier, and it declared a class,
13334 and there's no declarator, then we have an explicit type
13335 instantiation. */
13337 {
13338 tree type;
13342 /* Turn access control back on for names used during
13343 template instantiation. */
13348 }
13349 else
13350 {
13352 tree decl;
13354 /* Parse the declarator. */
13355 declarator
13365 {
13368 "explicit instantiation shall not use"
13372 "explicit instantiation shall not use"
13377 /* Turn access control back on for names used during
13378 template instantiation. */
13380 /* Do the explicit instantiation. */
13382 }
13383 else
13384 {
13386 /* Skip the body of the explicit instantiation. */
13388 }
13389 }
13390 /* We're done with the instantiation. */
13396 }
13398 /* Parse an explicit-specialization.
13400 explicit-specialization:
13401 template < > declaration
13403 Although the standard says `declaration', what it really means is:
13405 explicit-specialization:
13406 template <> decl-specifier [opt] init-declarator [opt] ;
13407 template <> function-definition
13408 template <> explicit-specialization
13409 template <> template-declaration */
13411 static void
13413 {
13417 /* Look for the `template' keyword. */
13419 /* Look for the `<'. */
13421 /* Look for the `>'. */
13423 /* We have processed another parameter list. */
13425 /* [temp]
13427 A template ... explicit specialization ... shall not have C
13428 linkage. */
13430 {
13432 /* Give it C++ linkage to avoid confusing other parts of the
13433 front end. */
13436 }
13437 else
13439 /* Let the front end know that we are beginning a specialization. */
13441 {
13444 }
13446 /* If the next keyword is `template', we need to figure out whether
13447 or not we're looking a template-declaration. */
13449 {
13454 else
13456 }
13457 else
13458 /* Parse the dependent declaration. */
13464 /* We're done with the specialization. */
13466 /* For the erroneous case of a template with C linkage, we pushed an
13467 implicit C++ linkage scope; exit that scope now. */
13470 /* We're done with this parameter list. */
13472 }
13474 /* Parse a type-specifier.
13476 type-specifier:
13477 simple-type-specifier
13478 class-specifier
13479 enum-specifier
13480 elaborated-type-specifier
13481 cv-qualifier
13483 GNU Extension:
13485 type-specifier:
13486 __complex__
13488 Returns a representation of the type-specifier. For a
13489 class-specifier, enum-specifier, or elaborated-type-specifier, a
13490 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13492 The parser flags FLAGS is used to control type-specifier parsing.
13494 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13495 in a decl-specifier-seq.
13497 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13498 class-specifier, enum-specifier, or elaborated-type-specifier, then
13499 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13500 if a type is declared; 2 if it is defined. Otherwise, it is set to
13501 zero.
13503 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13504 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13505 is set to FALSE. */
13507 static tree
13509 cp_parser_flags flags,
13514 {
13520 /* Assume this type-specifier does not declare a new type. */
13523 /* And that it does not specify a cv-qualifier. */
13526 /* Peek at the next token. */
13529 /* If we're looking at a keyword, we can use that to guide the
13530 production we choose. */
13533 {
13538 /* Look for the enum-specifier. */
13540 /* If that worked, we're done. */
13542 {
13547 type_spec,
13548 token,
13551 }
13552 else
13555 /* Any of these indicate either a class-specifier, or an
13556 elaborated-type-specifier. */
13563 /* Parse tentatively so that we can back up if we don't find a
13564 class-specifier. */
13566 /* Look for the class-specifier. */
13569 /* If that worked, we're done. */
13571 {
13576 type_spec,
13577 token,
13580 }
13582 /* Fall through. */
13583 elaborated_type_specifier:
13584 /* We're declaring (not defining) a class or enum. */
13588 /* Fall through. */
13590 /* Look for an elaborated-type-specifier. */
13591 type_spec
13592 = (cp_parser_elaborated_type_specifier
13595 is_declaration));
13598 type_spec,
13599 token,
13622 /* The `__complex__' keyword is a GNU extension. */
13628 }
13630 /* Handle simple keywords. */
13632 {
13634 {
13637 }
13639 }
13641 /* If we do not already have a type-specifier, assume we are looking
13642 at a simple-type-specifier. */
13644 decl_specs,
13645 flags);
13647 /* If we didn't find a type-specifier, and a type-specifier was not
13648 optional in this context, issue an error message. */
13650 {
13653 }
13656 }
13658 /* Parse a simple-type-specifier.
13660 simple-type-specifier:
13661 :: [opt] nested-name-specifier [opt] type-name
13662 :: [opt] nested-name-specifier template template-id
13663 char
13664 wchar_t
13665 bool
13666 short
13667 int
13668 long
13669 signed
13670 unsigned
13671 float
13672 double
13673 void
13675 C++0x Extension:
13677 simple-type-specifier:
13678 auto
13679 decltype ( expression )
13680 char16_t
13681 char32_t
13682 __underlying_type ( type-id )
13684 GNU Extension:
13686 simple-type-specifier:
13687 __int128
13688 __typeof__ unary-expression
13689 __typeof__ ( type-id )
13691 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13692 appropriately updated. */
13694 static tree
13697 cp_parser_flags flags)
13698 {
13702 /* Peek at the next token. */
13705 /* If we're looking at a keyword, things are easy. */
13707 {
13770 /* Since DR 743, decltype can either be a simple-type-specifier by
13771 itself or begin a nested-name-specifier. Parsing it will replace
13772 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13773 handling below decide what to do. */
13779 /* Consume the `typeof' token. */
13781 /* Parse the operand to `typeof'. */
13783 /* If it is not already a TYPE, take its type. */
13789 token,
13798 token,
13808 token,
13813 }
13815 /* If token is an already-parsed decltype not followed by ::,
13816 it's a simple-type-specifier. */
13819 {
13823 token,
13827 }
13829 /* If the type-specifier was for a built-in type, we're done. */
13831 {
13832 /* Record the type. */
13839 type,
13840 token,
13845 /* Consume the token. */
13848 /* There is no valid C++ program where a non-template type is
13849 followed by a "<". That usually indicates that the user thought
13850 that the type was a template. */
13855 }
13857 /* The type-specifier must be a user-defined type. */
13859 {
13863 /* Don't gobble tokens or issue error messages if this is an
13864 optional type-specifier. */
13868 /* Look for the optional `::' operator. */
13869 global_p
13873 /* Look for the nested-name specifier. */
13874 qualified_p
13882 /* If we have seen a nested-name-specifier, and the next token
13883 is `template', then we are using the template-id production. */
13886 {
13887 /* Look for the template-id. */
13891 none_type,
13893 /* If the template-id did not name a type, we are out of
13894 luck. */
13896 {
13899 }
13900 }
13901 /* Otherwise, look for a type-name. */
13902 else
13904 /* Keep track of all name-lookups performed in class scopes. */
13906 && !global_p
13907 && !qualified_p
13911 /* If it didn't work out, we don't have a TYPE. */
13917 token,
13919 }
13921 /* If we didn't get a type-name, issue an error message. */
13923 {
13926 }
13929 {
13930 /* See if TYPE is an Objective-C type, and if so, parse and
13931 accept any protocol references following it. Do this before
13932 the cp_parser_check_for_invalid_template_id() call, because
13933 Objective-C types can be followed by '<...>' which would
13934 enclose protocol names rather than template arguments, and so
13935 everything is fine. */
13938 {
13942 /* Clobber the "unqualified" type previously entered into
13943 DECL_SPECS with the new, improved protocol-qualified version. */
13948 }
13950 /* There is no valid C++ program where a non-template type is
13951 followed by a "<". That usually indicates that the user
13952 thought that the type was a template. */
13954 none_type,
13956 }
13959 }
13961 /* Parse a type-name.
13963 type-name:
13964 class-name
13965 enum-name
13966 typedef-name
13967 simple-template-id [in c++0x]
13969 enum-name:
13970 identifier
13972 typedef-name:
13973 identifier
13975 Returns a TYPE_DECL for the type. */
13977 static tree
13979 {
13980 tree type_decl;
13982 /* We can't know yet whether it is a class-name or not. */
13984 /* Try a class-name. */
13988 none_type,
13992 /* If it's not a class-name, keep looking. */
13994 {
13996 /* It must be a typedef-name or an enum-name. */
14000 /* It is either a simple-template-id representing an
14001 instantiation of an alias template... */
14005 none_type,
14007 /* Note that this must be an instantiation of an alias template
14008 because [temp.names]/6 says:
14010 A template-id that names an alias template specialization
14011 is a type-name.
14013 Whereas [temp.names]/7 says:
14015 A simple-template-id that names a class template
14016 specialization is a class-name. */
14021 else
14025 /* ... Or a typedef-name or an enum-name. */
14027 }
14030 }
14032 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14034 enum-name:
14035 identifier
14037 typedef-name:
14038 identifier
14040 Returns a TYPE_DECL for the type. */
14042 static tree
14044 {
14045 tree type_decl;
14046 tree identifier;
14053 /* Look up the type-name. */
14057 {
14061 {
14062 /* We have found a type introduced by a using
14063 declaration at class scope that refers to a dependent
14064 type.
14066 using typename :: [opt] nested-name-specifier unqualified-id ;
14067 */
14073 }
14074 }
14078 {
14079 /* See if this is an Objective-C type. */
14084 }
14086 /* Issue an error if we did not find a type-name. */
14088 /* In Objective-C, we have the complication that class names are
14089 normally type names and start declarations (eg, the
14090 "NSObject" in "NSObject *object;"), but can be used in an
14091 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14092 is an expression. So, a classname followed by a dot is not a
14093 valid type-name. */
14096 {
14101 }
14102 /* Remember that the name was used in the definition of the
14103 current class so that we can check later to see if the
14104 meaning would have been different after the class was
14105 entirely defined. */
14111 }
14113 /* Parse an elaborated-type-specifier. Note that the grammar given
14114 here incorporates the resolution to DR68.
14116 elaborated-type-specifier:
14117 class-key :: [opt] nested-name-specifier [opt] identifier
14118 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14119 enum-key :: [opt] nested-name-specifier [opt] identifier
14120 typename :: [opt] nested-name-specifier identifier
14121 typename :: [opt] nested-name-specifier template [opt]
14122 template-id
14124 GNU extension:
14126 elaborated-type-specifier:
14127 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14128 class-key attributes :: [opt] nested-name-specifier [opt]
14129 template [opt] template-id
14130 enum attributes :: [opt] nested-name-specifier [opt] identifier
14132 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14133 declared `friend'. If IS_DECLARATION is TRUE, then this
14134 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14135 something is being declared.
14137 Returns the TYPE specified. */
14139 static tree
14143 {
14145 tree identifier;
14148 tree globalscope;
14151 /* See if we're looking at the `enum' keyword. */
14153 {
14154 /* Consume the `enum' token. */
14156 /* Remember that it's an enumeration type. */
14158 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14159 enums) is used here. */
14162 {
14166 /* Consume the `struct' or `class' and parse it anyway. */
14168 }
14169 /* Parse the attributes. */
14171 }
14172 /* Or, it might be `typename'. */
14174 RID_TYPENAME))
14175 {
14176 /* Consume the `typename' token. */
14178 /* Remember that it's a `typename' type. */
14180 }
14181 /* Otherwise it must be a class-key. */
14182 else
14183 {
14187 /* Parse the attributes. */
14189 }
14191 /* Look for the `::' operator. */
14194 /* Look for the nested-name-specifier. */
14196 {
14201 is_declaration))
14203 }
14204 else
14205 /* Even though `typename' is not present, the proposed resolution
14206 to Core Issue 180 says that in `class A<T>::B', `B' should be
14207 considered a type-name, even if `A<T>' is dependent. */
14212 is_declaration);
14213 /* For everything but enumeration types, consider a template-id.
14214 For an enumeration type, consider only a plain identifier. */
14216 {
14218 tree decl;
14220 /* Allow the `template' keyword. */
14222 /* If we didn't see `template', we don't know if there's a
14223 template-id or not. */
14226 /* Parse the template-id. */
14230 tag_type,
14231 is_declaration);
14232 /* If we didn't find a template-id, look for an ordinary
14233 identifier. */
14235 ;
14236 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14237 in effect, then we must assume that, upon instantiation, the
14238 template will correspond to a class. */
14242 typename_type,
14244 /* If the `typename' keyword is in effect and DECL is not a type
14245 decl. Then type is non existant. */
14248 else
14251 }
14254 {
14259 {
14262 }
14264 /* For a `typename', we needn't call xref_tag. */
14268 identifier,
14270 /* Look up a qualified name in the usual way. */
14272 {
14273 tree decl;
14274 tree ambiguous_decls;
14277 tag_type,
14284 /* If the lookup was ambiguous, an error will already have been
14285 issued. */
14289 /* If we are parsing friend declaration, DECL may be a
14290 TEMPLATE_DECL tree node here. However, we need to check
14291 whether this TEMPLATE_DECL results in valid code. Consider
14292 the following example:
14294 namespace N {
14295 template <class T> class C {};
14296 }
14297 class X {
14298 template <class T> friend class N::C; // #1, valid code
14299 };
14300 template <class T> class Y {
14301 friend class N::C; // #2, invalid code
14302 };
14304 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14305 name lookup of `N::C'. We see that friend declaration must
14306 be template for the code to be valid. Note that
14307 processing_template_decl does not work here since it is
14308 always 1 for the above two cases. */
14310 decl = (cp_parser_maybe_treat_template_as_class
14315 {
14318 identifier,
14321 }
14324 {
14328 allow_template);
14332 }
14334 /* Forward declarations of nested types, such as
14336 class C1::C2;
14337 class C1::C2::C3;
14339 are invalid unless all components preceding the final '::'
14340 are complete. If all enclosing types are complete, these
14341 declarations become merely pointless.
14343 Invalid forward declarations of nested types are errors
14344 caught elsewhere in parsing. Those that are pointless arrive
14345 here. */
14352 }
14353 else
14354 {
14355 /* An elaborated-type-specifier sometimes introduces a new type and
14356 sometimes names an existing type. Normally, the rule is that it
14357 introduces a new type only if there is not an existing type of
14358 the same name already in scope. For example, given:
14360 struct S {};
14361 void f() { struct S s; }
14363 the `struct S' in the body of `f' is the same `struct S' as in
14364 the global scope; the existing definition is used. However, if
14365 there were no global declaration, this would introduce a new
14366 local class named `S'.
14368 An exception to this rule applies to the following code:
14370 namespace N { struct S; }
14372 Here, the elaborated-type-specifier names a new type
14373 unconditionally; even if there is already an `S' in the
14374 containing scope this declaration names a new type.
14375 This exception only applies if the elaborated-type-specifier
14376 forms the complete declaration:
14378 [class.name]
14380 A declaration consisting solely of `class-key identifier ;' is
14381 either a redeclaration of the name in the current scope or a
14382 forward declaration of the identifier as a class name. It
14383 introduces the name into the current scope.
14385 We are in this situation precisely when the next token is a `;'.
14387 An exception to the exception is that a `friend' declaration does
14388 *not* name a new type; i.e., given:
14390 struct S { friend struct T; };
14392 `T' is not a new type in the scope of `S'.
14394 Also, `new struct S' or `sizeof (struct S)' never results in the
14395 definition of a new type; a new type can only be declared in a
14396 declaration context. */
14398 tag_scope ts;
14402 /* Friends have special name lookup rules. */
14406 CPP_SEMICOLON))
14407 /* This is a `class-key identifier ;' */
14409 else
14412 template_p =
14416 /* An unqualified name was used to reference this type, so
14417 there were no qualifying templates. */
14424 }
14425 }
14430 /* Allow attributes on forward declarations of classes. */
14432 {
14442 else
14445 }
14448 {
14449 /* Indicate whether this class was declared as a `class' or as a
14450 `struct'. */
14454 }
14456 /* A "<" cannot follow an elaborated type specifier. If that
14457 happens, the user was probably trying to form a template-id. */
14462 }
14464 /* Parse an enum-specifier.
14466 enum-specifier:
14467 enum-head { enumerator-list [opt] }
14468 enum-head { enumerator-list , } [C++0x]
14470 enum-head:
14471 enum-key identifier [opt] enum-base [opt]
14472 enum-key nested-name-specifier identifier enum-base [opt]
14474 enum-key:
14475 enum
14476 enum class [C++0x]
14477 enum struct [C++0x]
14479 enum-base: [C++0x]
14480 : type-specifier-seq
14482 opaque-enum-specifier:
14483 enum-key identifier enum-base [opt] ;
14485 GNU Extensions:
14486 enum-key attributes[opt] identifier [opt] enum-base [opt]
14487 { enumerator-list [opt] }attributes[opt]
14488 enum-key attributes[opt] identifier [opt] enum-base [opt]
14489 { enumerator-list, }attributes[opt] [C++0x]
14491 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14492 if the token stream isn't an enum-specifier after all. */
14494 static tree
14496 {
14497 tree identifier;
14499 tree prev_scope;
14501 tree attributes;
14514 /* Parse tentatively so that we can back up if we don't find a
14515 enum-specifier. */
14518 /* Caller guarantees that the current token is 'enum', an identifier
14519 possibly follows, and the token after that is an opening brace.
14520 If we don't have an identifier, fabricate an anonymous name for
14521 the enumeration being defined. */
14524 /* Parse the "class" or "struct", which indicates a scoped
14525 enumeration type in C++0x. */
14528 {
14532 /* Consume the `struct' or `class' token. */
14536 }
14540 /* Clear the qualification. */
14545 /* Figure out in what scope the declaration is being placed. */
14551 nested_name_specifier
14559 {
14560 tree name;
14564 enum_type,
14569 input_location);
14571 {
14574 {
14575 /* Are template enums allowed in ISO? */
14579 /* ignore a typename reference, for it will be solved by name
14580 in start_enum. */
14582 }
14583 }
14584 else
14587 }
14588 else
14589 {
14592 else
14593 {
14596 }
14597 }
14600 /* Check for the `:' that denotes a specified underlying type in C++0x.
14601 Note that a ':' could also indicate a bitfield width, however. */
14603 {
14604 cp_decl_specifier_seq type_specifiers;
14606 /* Consume the `:'. */
14609 /* Parse the type-specifier-seq. */
14614 /* At this point this is surely not elaborated type specifier. */
14623 /* If that didn't work, stop. */
14625 {
14630 }
14631 }
14633 /* Look for the `{' but don't consume it yet. */
14635 {
14637 {
14640 {
14643 }
14644 }
14645 /* An opaque-enum-specifier must have a ';' here. */
14648 {
14651 {
14654 }
14655 }
14656 }
14662 {
14664 {
14668 }
14670 {
14672 }
14673 }
14675 /* Issue an error message if type-definitions are forbidden here. */
14678 else
14679 /* Create the new type. We do this before consuming the opening
14680 brace so the enum will be recorded as being on the line of its
14681 tag (or the 'enum' keyword, if there is no tag). */
14685 /* If the next token is not '{' it is an opaque-enum-specifier or an
14686 elaborated-type-specifier. */
14688 {
14691 {
14692 /* The following catches invalid code such as:
14693 enum class S<int>::E { A, B, C }; */
14700 /* If that scope does not contain the scope in which the
14701 class was originally declared, the program is invalid. */
14703 {
14706 "declaration of %qD in namespace %qD which does not "
14709 else
14714 }
14715 }
14720 /* Consume the opening brace. */
14727 {
14731 }
14732 else
14733 {
14738 }
14742 /* If the next token is not '}', then there are some enumerators. */
14746 /* Consume the final '}'. */
14752 }
14753 else
14754 {
14755 /* If a ';' follows, then it is an opaque-enum-specifier
14756 and additional restrictions apply. */
14758 {
14765 }
14766 }
14768 /* Look for trailing attributes to apply to this enumeration, and
14769 apply them if appropriate. */
14771 {
14775 trailing_attr,
14777 }
14779 /* Finish up the enumeration. */
14781 {
14786 }
14789 {
14791 {
14794 }
14796 {
14798 }
14799 }
14800 out:
14803 }
14805 /* Parse an enumerator-list. The enumerators all have the indicated
14806 TYPE.
14808 enumerator-list:
14809 enumerator-definition
14810 enumerator-list , enumerator-definition */
14812 static void
14814 {
14816 {
14817 /* Parse an enumerator-definition. */
14820 /* If the next token is not a ',', we've reached the end of
14821 the list. */
14824 /* Otherwise, consume the `,' and keep going. */
14826 /* If the next token is a `}', there is a trailing comma. */
14828 {
14833 }
14834 }
14835 }
14837 /* Parse an enumerator-definition. The enumerator has the indicated
14838 TYPE.
14840 enumerator-definition:
14841 enumerator
14842 enumerator = constant-expression
14844 enumerator:
14845 identifier */
14847 static void
14849 {
14850 tree identifier;
14851 tree value;
14852 location_t loc;
14854 /* Save the input location because we are interested in the location
14855 of the identifier and not the location of the explicit value. */
14858 /* Look for the identifier. */
14863 /* If the next token is an '=', then there is an explicit value. */
14865 {
14866 /* Consume the `=' token. */
14868 /* Parse the value. */
14871 NULL);
14872 }
14873 else
14876 /* If we are processing a template, make sure the initializer of the
14877 enumerator doesn't contain any bare template parameter pack. */
14881 /* integral_constant_value will pull out this expression, so make sure
14882 it's folded as appropriate. */
14885 /* Create the enumerator. */
14887 }
14889 /* Parse a namespace-name.
14891 namespace-name:
14892 original-namespace-name
14893 namespace-alias
14895 Returns the NAMESPACE_DECL for the namespace. */
14897 static tree
14899 {
14900 tree identifier;
14901 tree namespace_decl;
14905 /* Get the name of the namespace. */
14910 /* Look up the identifier in the currently active scope. Look only
14911 for namespaces, due to:
14913 [basic.lookup.udir]
14915 When looking up a namespace-name in a using-directive or alias
14916 definition, only namespace names are considered.
14918 And:
14920 [basic.lookup.qual]
14922 During the lookup of a name preceding the :: scope resolution
14923 operator, object, function, and enumerator names are ignored.
14925 (Note that cp_parser_qualifying_entity only calls this
14926 function if the token after the name is the scope resolution
14927 operator.) */
14929 none_type,
14935 /* If it's not a namespace, issue an error. */
14938 {
14943 }
14946 }
14948 /* Parse a namespace-definition.
14950 namespace-definition:
14951 named-namespace-definition
14952 unnamed-namespace-definition
14954 named-namespace-definition:
14955 original-namespace-definition
14956 extension-namespace-definition
14958 original-namespace-definition:
14959 namespace identifier { namespace-body }
14961 extension-namespace-definition:
14962 namespace original-namespace-name { namespace-body }
14964 unnamed-namespace-definition:
14965 namespace { namespace-body } */
14967 static void
14969 {
14975 {
14979 }
14980 else
14983 /* Look for the `namespace' keyword. */
14986 /* Get the name of the namespace. We do not attempt to distinguish
14987 between an original-namespace-definition and an
14988 extension-namespace-definition at this point. The semantic
14989 analysis routines are responsible for that. */
14992 else
14995 /* Parse any specified attributes. */
14998 /* Look for the `{' to start the namespace. */
15000 /* Start the namespace. */
15003 /* "inline namespace" is equivalent to a stub namespace definition
15004 followed by a strong using directive. */
15006 {
15008 /* Set up namespace association. */
15012 /* Import the contents of the inline namespace. */
15016 }
15020 /* Parse the body of the namespace. */
15026 /* Finish the namespace. */
15028 /* Look for the final `}'. */
15030 }
15032 /* Parse a namespace-body.
15034 namespace-body:
15035 declaration-seq [opt] */
15037 static void
15039 {
15041 }
15043 /* Parse a namespace-alias-definition.
15045 namespace-alias-definition:
15046 namespace identifier = qualified-namespace-specifier ; */
15048 static void
15050 {
15051 tree identifier;
15052 tree namespace_specifier;
15056 /* Look for the `namespace' keyword. */
15058 /* Look for the identifier. */
15062 /* Look for the `=' token. */
15065 {
15067 /* Skip the definition. */
15072 }
15074 /* Look for the qualified-namespace-specifier. */
15075 namespace_specifier
15077 /* Look for the `;' token. */
15080 /* Register the alias in the symbol table. */
15082 }
15084 /* Parse a qualified-namespace-specifier.
15086 qualified-namespace-specifier:
15087 :: [opt] nested-name-specifier [opt] namespace-name
15089 Returns a NAMESPACE_DECL corresponding to the specified
15090 namespace. */
15092 static tree
15094 {
15095 /* Look for the optional `::'. */
15099 /* Look for the optional nested-name-specifier. */
15107 }
15109 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15110 access declaration.
15112 using-declaration:
15113 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15114 using :: unqualified-id ;
15116 access-declaration:
15117 qualified-id ;
15119 */
15121 static bool
15124 {
15128 tree decl;
15129 tree identifier;
15130 tree qscope;
15135 {
15138 }
15139 else
15140 {
15141 /* Look for the `using' keyword. */
15144 /* Peek at the next token. */
15146 /* See if it's `typename'. */
15148 {
15149 /* Remember that we've seen it. */
15151 /* Consume the `typename' token. */
15153 }
15154 }
15156 /* Look for the optional global scope qualification. */
15157 global_scope_p
15162 /* If we saw `typename', or didn't see `::', then there must be a
15163 nested-name-specifier present. */
15169 /* Otherwise, we could be in either of the two productions. In that
15170 case, treat the nested-name-specifier as optional. */
15171 else
15181 /* Something has already gone wrong; there's no need to parse
15182 further. Since an error has occurred, the return value of
15183 cp_parser_parse_definitely will be false, as required. */
15187 /* Parse the unqualified-id. */
15195 {
15200 }
15202 /* The function we call to handle a using-declaration is different
15203 depending on what scope we are in. */
15205 ;
15208 /* [namespace.udecl]
15210 A using declaration shall not name a template-id. */
15213 else
15214 {
15216 {
15217 /* Create the USING_DECL. */
15225 else
15226 /* Add it to the list of members in this class. */
15228 }
15229 else
15230 {
15232 identifier,
15242 else
15244 }
15245 }
15247 /* Look for the final `;'. */
15252 "access declarations are deprecated "
15253 "in favour of using-declarations; "
15257 }
15259 /* Parse an alias-declaration.
15261 alias-declaration:
15262 using identifier attribute-specifier-seq [opt] = type-id */
15264 static tree
15266 {
15268 location_t id_location;
15270 cp_decl_specifier_seq decl_specs;
15274 /* Look for the `using' keyword. */
15275 cp_token *using_token
15297 /* Now we are going to parse the type-id of the declaration. */
15299 /*
15300 [dcl.type]/3 says:
15302 "A type-specifier-seq shall not define a class or enumeration
15303 unless it appears in the type-id of an alias-declaration (7.1.3) that
15304 is not the declaration of a template-declaration."
15306 In other words, if we currently are in an alias template, the
15307 type-id should not define a type.
15309 So let's set parser->type_definition_forbidden_message in that
15310 case; cp_parser_check_type_definition (called by
15311 cp_parser_class_specifier) will then emit an error if a type is
15312 defined in the type-id. */
15314 {
15318 }
15322 /* Restore the error message if need be. */
15327 {
15330 }
15335 {
15338 }
15340 /* A typedef-name can also be introduced by an alias-declaration. The
15341 identifier following the using keyword becomes a typedef-name. It has
15342 the same semantics as if it were introduced by the typedef
15343 specifier. In particular, it does not define a new type and it shall
15344 not appear in the type-id. */
15349 {
15352 ds_attribute,
15353 attrs_token);
15354 }
15356 ds_typedef,
15357 using_token);
15359 ds_alias,
15360 using_token);
15369 else
15380 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15381 added into the symbol table; otherwise, return the TYPE_DECL. */
15385 {
15389 }
15392 }
15394 /* Parse a using-directive.
15396 using-directive:
15397 using namespace :: [opt] nested-name-specifier [opt]
15398 namespace-name ; */
15400 static void
15402 {
15403 tree namespace_decl;
15404 tree attribs;
15406 /* Look for the `using' keyword. */
15408 /* And the `namespace' keyword. */
15410 /* Look for the optional `::' operator. */
15412 /* And the optional nested-name-specifier. */
15418 /* Get the namespace being used. */
15420 /* And any specified attributes. */
15422 /* Update the symbol table. */
15424 /* Look for the final `;'. */
15426 }
15428 /* Parse an asm-definition.
15430 asm-definition:
15431 asm ( string-literal ) ;
15433 GNU Extension:
15435 asm-definition:
15436 asm volatile [opt] ( string-literal ) ;
15437 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15438 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15439 : asm-operand-list [opt] ) ;
15440 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15441 : asm-operand-list [opt]
15442 : asm-clobber-list [opt] ) ;
15443 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15444 : asm-clobber-list [opt]
15445 : asm-goto-list ) ; */
15447 static void
15449 {
15450 tree string;
15455 tree asm_stmt;
15463 /* Look for the `asm' keyword. */
15465 /* See if the next token is `volatile'. */
15468 {
15469 /* Remember that we saw the `volatile' keyword. */
15471 /* Consume the token. */
15473 }
15477 {
15478 /* Remember that we saw the `goto' keyword. */
15480 /* Consume the token. */
15482 }
15483 /* Look for the opening `('. */
15486 /* Look for the string. */
15489 {
15493 }
15495 /* If we're allowing GNU extensions, check for the extended assembly
15496 syntax. Unfortunately, the `:' tokens need not be separated by
15497 a space in C, and so, for compatibility, we tolerate that here
15498 too. Doing that means that we have to treat the `::' operator as
15499 two `:' tokens. */
15504 {
15509 /* The extended syntax was used. */
15512 /* Look for outputs. */
15514 {
15515 /* Consume the `:'. */
15517 /* Parse the output-operands. */
15519 CPP_COLON)
15521 CPP_SCOPE)
15523 CPP_CLOSE_PAREN)
15529 }
15530 /* If the next token is `::', there are no outputs, and the
15531 next token is the beginning of the inputs. */
15533 /* The inputs are coming next. */
15536 /* Look for inputs. */
15539 {
15540 /* Consume the `:' or `::'. */
15542 /* Parse the output-operands. */
15544 CPP_COLON)
15546 CPP_SCOPE)
15548 CPP_CLOSE_PAREN))
15553 }
15555 /* The clobbers are coming next. */
15558 /* Look for clobbers. */
15561 {
15563 /* Consume the `:' or `::'. */
15565 /* Parse the clobbers. */
15567 CPP_COLON)
15569 CPP_CLOSE_PAREN))
15571 }
15574 /* The labels are coming next. */
15577 /* Look for labels. */
15580 {
15582 /* Consume the `:' or `::'. */
15584 /* Parse the labels. */
15586 }
15590 }
15594 /* Look for the closing `)'. */
15602 {
15603 /* Create the ASM_EXPR. */
15605 {
15608 /* If the extended syntax was not used, mark the ASM_EXPR. */
15610 {
15616 }
15617 }
15618 else
15620 }
15621 }
15623 /* Declarators [gram.dcl.decl] */
15625 /* Parse an init-declarator.
15627 init-declarator:
15628 declarator initializer [opt]
15630 GNU Extension:
15632 init-declarator:
15633 declarator asm-specification [opt] attributes [opt] initializer [opt]
15635 function-definition:
15636 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15637 function-body
15638 decl-specifier-seq [opt] declarator function-try-block
15640 GNU Extension:
15642 function-definition:
15643 __extension__ function-definition
15645 TM Extension:
15647 function-definition:
15648 decl-specifier-seq [opt] declarator function-transaction-block
15650 The DECL_SPECIFIERS apply to this declarator. Returns a
15651 representation of the entity declared. If MEMBER_P is TRUE, then
15652 this declarator appears in a class scope. The new DECL created by
15653 this declarator is returned.
15655 The CHECKS are access checks that should be performed once we know
15656 what entity is being declared (and, therefore, what classes have
15657 befriended it).
15659 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15660 for a function-definition here as well. If the declarator is a
15661 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15662 be TRUE upon return. By that point, the function-definition will
15663 have been completely parsed.
15665 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15666 is FALSE.
15668 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15669 parsed declaration if it is an uninitialized single declarator not followed
15670 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15671 if present, will not be consumed. If returned, this declarator will be
15672 created with SD_INITIALIZED but will not call cp_finish_decl. */
15674 static tree
15683 {
15687 tree prefix_attributes;
15689 tree asm_specification;
15690 tree initializer;
15692 tree scope;
15694 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15695 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15696 "(...)". */
15705 /* Gather the attributes that were provided with the
15706 decl-specifiers. */
15709 /* Assume that this is not the declarator for a function
15710 definition. */
15714 /* Defer access checks while parsing the declarator; we cannot know
15715 what names are accessible until we know what is being
15716 declared. */
15719 /* Parse the declarator. */
15721 declarator
15725 member_p);
15726 /* Gather up the deferred checks. */
15729 /* If the DECLARATOR was erroneous, there's no need to go
15730 further. */
15734 /* Check that the number of template-parameter-lists is OK. */
15744 /* Figure out what scope the entity declared by the DECLARATOR is
15745 located in. `grokdeclarator' sometimes changes the scope, so
15746 we compute it now. */
15749 /* Perform any lookups in the declared type which were thought to be
15750 dependent, but are not in the scope of the declarator. */
15751 decl_specifiers->type
15754 /* If we're allowing GNU extensions, look for an
15755 asm-specification. */
15757 {
15758 /* Look for an asm-specification. */
15761 }
15762 else
15765 /* Look for attributes. */
15769 /* Peek at the next token. */
15771 /* Check to see if the token indicates the start of a
15772 function-definition. */
15775 {
15777 {
15778 /* If a function-definition should not appear here, issue an
15779 error message. */
15783 }
15784 else
15785 {
15786 location_t func_brace_location
15789 /* Neither attributes nor an asm-specification are allowed
15790 on a function-definition. */
15793 "an asm-specification is not allowed "
15798 /* This is a function-definition. */
15801 /* Parse the function definition. */
15804 decl_specifiers,
15805 declarator,
15806 prefix_attributes);
15807 else
15808 decl
15809 = (cp_parser_function_definition_from_specifiers_and_declarator
15813 {
15814 /* This is where the prologue starts... */
15817 }
15820 }
15821 }
15823 /* [dcl.dcl]
15825 Only in function declarations for constructors, destructors, and
15826 type conversions can the decl-specifier-seq be omitted.
15828 We explicitly postpone this check past the point where we handle
15829 function-definitions because we tolerate function-definitions
15830 that are missing their return types in some modes. */
15832 {
15836 }
15838 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15842 {
15850 {
15856 }
15857 }
15858 else
15859 {
15860 /* If the init-declarator isn't initialized and isn't followed by a
15861 `,' or `;', it's not a valid init-declarator. */
15864 {
15867 else
15868 {
15871 }
15872 }
15875 }
15877 /* Because start_decl has side-effects, we should only call it if we
15878 know we're going ahead. By this point, we know that we cannot
15879 possibly be looking at any other construct. */
15882 /* If the decl specifiers were bad, issue an error now that we're
15883 sure this was intended to be a declarator. Then continue
15884 declaring the variable(s), as int, to try to cut down on further
15885 errors. */
15888 {
15891 }
15893 /* Check to see whether or not this declaration is a friend. */
15896 /* Enter the newly declared entry in the symbol table. If we're
15897 processing a declaration in a class-specifier, we wait until
15898 after processing the initializer. */
15900 {
15907 /* Adjust location of decl if declarator->id_loc is more appropriate:
15908 set, and decl wasn't merged with another decl, in which case its
15909 location would be different from input_location, and more accurate. */
15914 }
15916 /* Enter the SCOPE. That way unqualified names appearing in the
15917 initializer will be looked up in SCOPE. */
15920 /* Perform deferred access control checks, now that we know in which
15921 SCOPE the declared entity resides. */
15923 {
15926 /* If the entity being declared is a function, pretend that we
15927 are in its scope. If it is a `friend', it may have access to
15928 things that would not otherwise be accessible. */
15930 {
15933 }
15935 /* Perform access checks for template parameters. */
15938 /* Perform the access control checks for the declarator and the
15939 decl-specifiers. */
15942 /* Restore the saved value. */
15945 }
15947 /* Parse the initializer. */
15952 {
15954 {
15958 else
15959 {
15960 /* If the declaration was erroneous, we don't really
15961 know what the user intended, so just silently
15962 consume the initializer. */
15970 }
15971 }
15972 else
15973 {
15974 /* We want to record the extra mangling scope for in-class
15975 initializers of class members and initializers of static data
15976 member templates. The former involves deferring
15977 parsing of the initializer until end of class as with default
15978 arguments. So right here we only handle the latter. */
15988 }
15989 }
15991 /* The old parser allows attributes to appear after a parenthesized
15992 initializer. Mark Mitchell proposed removing this functionality
15993 on the GCC mailing lists on 2002-08-13. This parser accepts the
15994 attributes -- but ignores them. */
16001 /* For an in-class declaration, use `grokfield' to create the
16002 declaration. */
16004 {
16006 {
16009 }
16013 prefix_attributes);
16016 }
16018 /* Finish processing the declaration. But, skip member
16019 declarations. */
16021 {
16024 asm_specification,
16025 /* If the initializer is in parentheses, then this is
16026 a direct-initialization, which means that an
16027 `explicit' constructor is OK. Otherwise, an
16028 `explicit' constructor cannot be used. */
16031 }
16034 /* Core issue #226 (C++0x only): A default template-argument
16035 shall not be specified in a friend class template
16036 declaration. */
16044 }
16046 /* Parse a declarator.
16048 declarator:
16049 direct-declarator
16050 ptr-operator declarator
16052 abstract-declarator:
16053 ptr-operator abstract-declarator [opt]
16054 direct-abstract-declarator
16056 GNU Extensions:
16058 declarator:
16059 attributes [opt] direct-declarator
16060 attributes [opt] ptr-operator declarator
16062 abstract-declarator:
16063 attributes [opt] ptr-operator abstract-declarator [opt]
16064 attributes [opt] direct-abstract-declarator
16066 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16067 detect constructor, destructor or conversion operators. It is set
16068 to -1 if the declarator is a name, and +1 if it is a
16069 function. Otherwise it is set to zero. Usually you just want to
16070 test for >0, but internally the negative value is used.
16072 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16073 a decl-specifier-seq unless it declares a constructor, destructor,
16074 or conversion. It might seem that we could check this condition in
16075 semantic analysis, rather than parsing, but that makes it difficult
16076 to handle something like `f()'. We want to notice that there are
16077 no decl-specifiers, and therefore realize that this is an
16078 expression, not a declaration.)
16080 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16081 the declarator is a direct-declarator of the form "(...)".
16083 MEMBER_P is true iff this declarator is a member-declarator. */
16087 cp_parser_declarator_kind dcl_kind,
16091 {
16094 cp_cv_quals cv_quals;
16095 tree class_type;
16098 /* Assume this is not a constructor, destructor, or type-conversion
16099 operator. */
16106 /* Check for the ptr-operator production. */
16108 /* Parse the ptr-operator. */
16114 /* If that worked, then we have a ptr-operator. */
16116 {
16117 /* If a ptr-operator was found, then this declarator was not
16118 parenthesized. */
16121 /* The dependent declarator is optional if we are parsing an
16122 abstract-declarator. */
16126 /* Parse the dependent declarator. */
16132 /* If we are parsing an abstract-declarator, we must handle the
16133 case where the dependent declarator is absent. */
16138 declarator = cp_parser_make_indirect_declarator
16140 }
16141 /* Everything else is a direct-declarator. */
16142 else
16143 {
16146 CPP_OPEN_PAREN);
16148 ctor_dtor_or_conv_p,
16149 member_p);
16150 }
16155 }
16157 /* Parse a direct-declarator or direct-abstract-declarator.
16159 direct-declarator:
16160 declarator-id
16161 direct-declarator ( parameter-declaration-clause )
16162 cv-qualifier-seq [opt]
16163 exception-specification [opt]
16164 direct-declarator [ constant-expression [opt] ]
16165 ( declarator )
16167 direct-abstract-declarator:
16168 direct-abstract-declarator [opt]
16169 ( parameter-declaration-clause )
16170 cv-qualifier-seq [opt]
16171 exception-specification [opt]
16172 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16173 ( abstract-declarator )
16175 Returns a representation of the declarator. DCL_KIND is
16176 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16177 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16178 we are parsing a direct-declarator. It is
16179 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16180 of ambiguity we prefer an abstract declarator, as per
16181 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16182 cp_parser_declarator. */
16186 cp_parser_declarator_kind dcl_kind,
16189 {
16199 {
16200 /* Peek at the next token. */
16203 {
16204 /* This is either a parameter-declaration-clause, or a
16205 parenthesized declarator. When we know we are parsing a
16206 named declarator, it must be a parenthesized declarator
16207 if FIRST is true. For instance, `(int)' is a
16208 parameter-declaration-clause, with an omitted
16209 direct-abstract-declarator. But `((*))', is a
16210 parenthesized abstract declarator. Finally, when T is a
16211 template parameter `(T)' is a
16212 parameter-declaration-clause, and not a parenthesized
16213 named declarator.
16215 We first try and parse a parameter-declaration-clause,
16216 and then try a nested declarator (if FIRST is true).
16218 It is not an error for it not to be a
16219 parameter-declaration-clause, even when FIRST is
16220 false. Consider,
16222 int i (int);
16223 int i (3);
16225 The first is the declaration of a function while the
16226 second is the definition of a variable, including its
16227 initializer.
16229 Having seen only the parenthesis, we cannot know which of
16230 these two alternatives should be selected. Even more
16231 complex are examples like:
16233 int i (int (a));
16234 int i (int (3));
16236 The former is a function-declaration; the latter is a
16237 variable initialization.
16239 Thus again, we try a parameter-declaration-clause, and if
16240 that fails, we back out and return. */
16243 {
16244 tree params;
16247 tree t;
16249 /* In a member-declarator, the only valid interpretation
16250 of a parenthesis is the start of a
16251 parameter-declaration-clause. (It is invalid to
16252 initialize a static data member with a parenthesized
16253 initializer; only the "=" form of initialization is
16254 permitted.) */
16258 /* Consume the `('. */
16261 {
16262 /* If this is going to be an abstract declarator, we're
16263 in a declarator and we can't have default args. */
16266 }
16268 /* Inside the function parameter list, surrounding
16269 template-parameter-lists do not apply. */
16270 saved_num_template_parameter_lists
16276 /* Parse the parameter-declaration-clause. */
16279 parser->num_template_parameter_lists
16282 /* Consume the `)'. */
16285 /* If all went well, parse the cv-qualifier-seq and the
16286 exception-specification. */
16288 {
16289 cp_cv_quals cv_quals;
16290 cp_virt_specifiers virt_specifiers;
16291 tree exception_specification;
16292 tree late_return;
16293 tree attrs;
16301 /* Parse the cv-qualifier-seq. */
16303 /* And the exception-specification. */
16304 exception_specification
16309 late_return = (cp_parser_late_return_type_opt
16312 /* Parse the virt-specifier-seq. */
16315 /* Create the function-declarator. */
16317 params,
16318 cv_quals,
16319 virt_specifiers,
16320 exception_specification,
16321 late_return);
16323 /* Any subsequent parameter lists are to do with
16324 return type, so are not those of the declared
16325 function. */
16327 }
16329 /* Remove the function parms from scope. */
16335 /* Repeat the main loop. */
16337 }
16339 /* If this is the first, we can try a parenthesized
16340 declarator. */
16342 {
16348 /* Consume the `('. */
16350 /* Parse the nested declarator. */
16353 declarator
16356 member_p);
16359 /* Expect a `)'. */
16366 }
16367 /* Otherwise, we must be done. */
16368 else
16370 }
16374 {
16375 /* Parse an array-declarator. */
16384 /* Consume the `['. */
16386 /* Peek at the next token. */
16388 /* If the next token is `]', then there is no
16389 constant-expression. */
16391 {
16394 bounds
16404 {
16405 /* Normally, the array bound must be an integral constant
16406 expression. However, as an extension, we allow VLAs
16407 in function scopes as long as they aren't part of a
16408 parameter declaration. */
16412 }
16414 {
16415 /* Remember this wasn't a constant-expression. */
16418 }
16419 }
16420 else
16422 /* Look for the closing `]'. */
16424 {
16427 }
16432 }
16434 {
16435 {
16436 tree qualifying_scope;
16437 tree unqualified_name;
16438 tree attrs;
16439 special_function_kind sfk;
16444 /* Parse a declarator-id */
16447 {
16450 /* If we see an ellipsis, we should be looking at a
16451 parameter pack. */
16453 {
16454 /* Consume the `...' */
16458 }
16459 }
16462 unqualified_name
16466 {
16470 {
16471 /* Check whether an error occurred. */
16474 /* We already consumed the ellipsis to mark a
16475 parameter pack, but we have no way to report it,
16476 so abort the tentative parse. We will be exiting
16477 immediately anyway. */
16479 }
16480 else
16486 && (qualifying_scope
16489 {
16492 }
16493 }
16498 {
16503 }
16509 {
16510 /* In the declaration of a member of a template class
16511 outside of the class itself, the SCOPE will sometimes
16512 be a TYPENAME_TYPE. For example, given:
16514 template <typename T>
16515 int S<T>::R::i = 3;
16517 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16518 this context, we must resolve S<T>::R to an ordinary
16519 type, rather than a typename type.
16521 The reason we normally avoid resolving TYPENAME_TYPEs
16522 is that a specialization of `S' might render
16523 `S<T>::R' not a type. However, if `S' is
16524 specialized, then this `i' will not be used, so there
16525 is no harm in resolving the types here. */
16526 tree type;
16528 /* Resolve the TYPENAME_TYPE. */
16531 /* If that failed, the declarator is invalid. */
16533 {
16536 "cannot define member of dependent typedef "
16538 else
16543 }
16545 }
16550 {
16551 tree class_type;
16556 else
16560 {
16563 {
16566 {
16570 "use %<%T::%D%> instead of %<%T::%D%> to "
16572 class_type,
16577 }
16578 else
16580 }
16581 else
16582 {
16583 /* We do not attempt to print the declarator
16584 here because we do not have enough
16585 information about its original syntactic
16586 form. */
16590 }
16591 }
16594 {
16600 for an anonymous type, even if the type
16601 got a name for linkage purposes. */
16604 class_type))
16605 {
16608 }
16616 }
16617 }
16619 unqualified_name,
16620 sfk);
16627 }
16629 handle_declarator:;
16632 /* Any names that appear after the declarator-id for a
16633 member are looked up in the containing scope. */
16638 /* Default args are only allowed on function
16639 declarations. */
16641 else
16645 }
16646 /* We're done. */
16647 else
16649 }
16651 /* For an abstract declarator, we might wind up with nothing at this
16652 point. That's an error; the declarator is not optional. */
16656 /* If we entered a scope, we must exit it now. */
16664 }
16666 /* Parse a ptr-operator.
16668 ptr-operator:
16669 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16670 * cv-qualifier-seq [opt]
16671 &
16672 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16673 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16675 GNU Extension:
16677 ptr-operator:
16678 & cv-qualifier-seq [opt]
16680 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16681 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16682 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16683 filled in with the TYPE containing the member. *CV_QUALS is
16684 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16685 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16686 Note that the tree codes returned by this function have nothing
16687 to do with the types of trees that will be eventually be created
16688 to represent the pointer or reference type being parsed. They are
16689 just constants with suggestive names. */
16690 static enum tree_code
16695 {
16700 /* Assume that it's not a pointer-to-member. */
16702 /* And that there are no cv-qualifiers. */
16705 /* Peek at the next token. */
16708 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16718 {
16719 /* Consume the `*', `&' or `&&'. */
16722 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16723 `&', if we are allowing GNU extensions. (The only qualifier
16724 that can legally appear after `&' is `restrict', but that is
16725 enforced during semantic analysis. */
16733 }
16734 else
16735 {
16736 /* Try the pointer-to-member case. */
16738 /* Look for the optional `::' operator. */
16741 /* Look for the nested-name specifier. */
16748 /* If we found it, and the next token is a `*', then we are
16749 indeed looking at a pointer-to-member operator. */
16752 {
16753 /* Indicate that the `*' operator was used. */
16761 else
16762 {
16763 /* The type of which the member is a member is given by the
16764 current SCOPE. */
16766 /* The next name will not be qualified. */
16770 /* Look for optional c++11 attributes. */
16774 /* Look for the optional cv-qualifier-seq. */
16776 }
16777 }
16778 /* If that didn't work we don't have a ptr-operator. */
16781 }
16784 }
16786 /* Parse an (optional) cv-qualifier-seq.
16788 cv-qualifier-seq:
16789 cv-qualifier cv-qualifier-seq [opt]
16791 cv-qualifier:
16792 const
16793 volatile
16795 GNU Extension:
16797 cv-qualifier:
16798 __restrict__
16800 Returns a bitmask representing the cv-qualifiers. */
16802 static cp_cv_quals
16804 {
16808 {
16810 cp_cv_quals cv_qualifier;
16812 /* Peek at the next token. */
16814 /* See if it's a cv-qualifier. */
16816 {
16832 }
16838 {
16841 }
16842 else
16843 {
16846 }
16847 }
16850 }
16852 /* Parse an (optional) virt-specifier-seq.
16854 virt-specifier-seq:
16855 virt-specifier virt-specifier-seq [opt]
16857 virt-specifier:
16858 override
16859 final
16861 Returns a bitmask representing the virt-specifiers. */
16863 static cp_virt_specifiers
16865 {
16869 {
16871 cp_virt_specifiers virt_specifier;
16873 /* Peek at the next token. */
16875 /* See if it's a virt-specifier-qualifier. */
16879 {
16882 }
16884 {
16887 }
16889 {
16891 }
16892 else
16896 {
16899 }
16900 else
16901 {
16904 }
16905 }
16907 }
16909 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16910 is in scope even though it isn't real. */
16912 static void
16914 {
16915 tree this_parm;
16918 {
16919 /* We don't clear this between NSDMIs. Is it already what we want? */
16924 }
16927 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16929 current_class_ref
16932 }
16934 /* Parse a late-specified return type, if any. This is not a separate
16935 non-terminal, but part of a function declarator, which looks like
16937 -> trailing-type-specifier-seq abstract-declarator(opt)
16939 Returns the type indicated by the type-id.
16941 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16942 function. */
16944 static tree
16946 {
16948 tree type;
16950 /* Peek at the next token. */
16952 /* A late-specified return type is indicated by an initial '->'. */
16956 /* Consume the ->. */
16960 {
16961 /* DR 1207: 'this' is in scope in the trailing return type. */
16964 }
16972 }
16974 /* Parse a declarator-id.
16976 declarator-id:
16977 id-expression
16978 :: [opt] nested-name-specifier [opt] type-name
16980 In the `id-expression' case, the value returned is as for
16981 cp_parser_id_expression if the id-expression was an unqualified-id.
16982 If the id-expression was a qualified-id, then a SCOPE_REF is
16983 returned. The first operand is the scope (either a NAMESPACE_DECL
16984 or TREE_TYPE), but the second is still just a representation of an
16985 unqualified-id. */
16987 static tree
16989 {
16990 tree id;
16991 /* The expression must be an id-expression. Assume that qualified
16992 names are the names of types so that:
16994 template <class T>
16995 int S<T>::R::i = 3;
16997 will work; we must treat `S<T>::R' as the name of a type.
16998 Similarly, assume that qualified names are templates, where
16999 required, so that:
17001 template <class T>
17002 int S<T>::R<T>::i = 3;
17004 will work, too. */
17010 optional_p);
17014 }
17016 /* Parse a type-id.
17018 type-id:
17019 type-specifier-seq abstract-declarator [opt]
17021 Returns the TYPE specified. */
17023 static tree
17026 {
17027 cp_decl_specifier_seq type_specifier_seq;
17030 /* Parse the type-specifier-seq. */
17032 is_trailing_return,
17037 /* There might or might not be an abstract declarator. */
17039 /* Look for the declarator. */
17040 abstract_declarator
17044 /* Check to see if there really was a declarator. */
17050 {
17051 /* A type-id with type 'auto' is only ok if the abstract declarator
17052 is a function declarator with a late-specified return type. */
17057 else
17058 {
17061 }
17062 }
17065 is_template_arg);
17066 }
17069 {
17071 }
17074 {
17075 tree r;
17077 parser->type_definition_forbidden_message
17082 }
17085 {
17087 }
17089 /* Parse a type-specifier-seq.
17091 type-specifier-seq:
17092 type-specifier type-specifier-seq [opt]
17094 GNU extension:
17096 type-specifier-seq:
17097 attributes type-specifier-seq [opt]
17099 If IS_DECLARATION is true, we are at the start of a "condition" or
17100 exception-declaration, so we might be followed by a declarator-id.
17102 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17103 i.e. we've just seen "->".
17105 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17107 static void
17112 {
17117 /* Clear the TYPE_SPECIFIER_SEQ. */
17120 /* In the context of a trailing return type, enum E { } is an
17121 elaborated-type-specifier followed by a function-body, not an
17122 enum-specifier. */
17126 /* Parse the type-specifiers and attributes. */
17128 {
17129 tree type_specifier;
17132 /* Check for attributes first. */
17134 {
17139 }
17141 /* record the token of the beginning of the type specifier seq,
17142 for error reporting purposes*/
17146 /* Look for the type-specifier. */
17148 flags,
17149 type_specifier_seq,
17151 NULL,
17154 {
17155 /* If the first type-specifier could not be found, this is not a
17156 type-specifier-seq at all. */
17158 {
17162 }
17163 /* If subsequent type-specifiers could not be found, the
17164 type-specifier-seq is complete. */
17166 }
17169 /* The standard says that a condition can be:
17171 type-specifier-seq declarator = assignment-expression
17173 However, given:
17175 struct S {};
17176 if (int S = ...)
17178 we should treat the "S" as a declarator, not as a
17179 type-specifier. The standard doesn't say that explicitly for
17180 type-specifier-seq, but it does say that for
17181 decl-specifier-seq in an ordinary declaration. Perhaps it
17182 would be clearer just to allow a decl-specifier-seq here, and
17183 then add a semantic restriction that if any decl-specifiers
17184 that are not type-specifiers appear, the program is invalid. */
17187 }
17188 }
17190 /* Parse a parameter-declaration-clause.
17192 parameter-declaration-clause:
17193 parameter-declaration-list [opt] ... [opt]
17194 parameter-declaration-list , ...
17196 Returns a representation for the parameter declarations. A return
17197 value of NULL indicates a parameter-declaration-clause consisting
17198 only of an ellipsis. */
17200 static tree
17202 {
17203 tree parameters;
17208 /* Peek at the next token. */
17210 /* Check for trivial parameter-declaration-clauses. */
17212 {
17213 /* Consume the `...' token. */
17216 }
17218 /* There are no parameters. */
17219 {
17220 #ifndef NO_IMPLICIT_EXTERN_C
17224 else
17225 #endif
17227 }
17228 /* Check for `(void)', too, which is a special case. */
17232 {
17233 /* Consume the `void' token. */
17235 /* There are no parameters. */
17237 }
17239 /* Parse the parameter-declaration-list. */
17241 /* If a parse error occurred while parsing the
17242 parameter-declaration-list, then the entire
17243 parameter-declaration-clause is erroneous. */
17247 /* Peek at the next token. */
17249 /* If it's a `,', the clause should terminate with an ellipsis. */
17251 {
17252 /* Consume the `,'. */
17254 /* Expect an ellipsis. */
17255 ellipsis_p
17257 }
17258 /* It might also be `...' if the optional trailing `,' was
17259 omitted. */
17261 {
17262 /* Consume the `...' token. */
17264 /* And remember that we saw it. */
17266 }
17267 else
17270 /* Finish the parameter list. */
17275 }
17277 /* Parse a parameter-declaration-list.
17279 parameter-declaration-list:
17280 parameter-declaration
17281 parameter-declaration-list , parameter-declaration
17283 Returns a representation of the parameter-declaration-list, as for
17284 cp_parser_parameter_declaration_clause. However, the
17285 `void_list_node' is never appended to the list. Upon return,
17286 *IS_ERROR will be true iff an error occurred. */
17288 static tree
17290 {
17296 /* Assume all will go well. */
17298 /* The special considerations that apply to a function within an
17299 unbraced linkage specifications do not apply to the parameters
17300 to the function. */
17301 saved_in_unbraced_linkage_specification_p
17305 /* Look for more parameters. */
17307 {
17311 /* Parse the parameter. */
17312 parameter
17317 /* We don't know yet if the enclosing context is deprecated, so wait
17318 and warn in grokparms if appropriate. */
17324 PARM,
17330 /* If a parse error occurred parsing the parameter declaration,
17331 then the entire parameter-declaration-list is erroneous. */
17333 {
17337 }
17347 {
17351 }
17353 /* Add the new parameter to the list. */
17357 /* Peek at the next token. */
17360 /* These are for Objective-C++ */
17363 /* The parameter-declaration-list is complete. */
17366 {
17369 /* Peek at the next token. */
17371 /* If it's an ellipsis, then the list is complete. */
17374 /* Otherwise, there must be more parameters. Consume the
17375 `,'. */
17377 /* When parsing something like:
17379 int i(float f, double d)
17381 we can tell after seeing the declaration for "f" that we
17382 are not looking at an initialization of a variable "i",
17383 but rather at the declaration of a function "i".
17385 Due to the fact that the parsing of template arguments
17386 (as specified to a template-id) requires backtracking we
17387 cannot use this technique when inside a template argument
17388 list. */
17392 /* However, a parameter-declaration of the form
17393 "foat(f)" (which is a valid declaration of a
17394 parameter "f") can also be interpreted as an
17395 expression (the conversion of "f" to "float"). */
17398 }
17399 else
17400 {
17408 }
17409 }
17411 parser->in_unbraced_linkage_specification_p
17415 }
17417 /* Parse a parameter declaration.
17419 parameter-declaration:
17420 decl-specifier-seq ... [opt] declarator
17421 decl-specifier-seq declarator = assignment-expression
17422 decl-specifier-seq ... [opt] abstract-declarator [opt]
17423 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17425 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17426 declares a template parameter. (In that case, a non-nested `>'
17427 token encountered during the parsing of the assignment-expression
17428 is not interpreted as a greater-than operator.)
17430 Returns a representation of the parameter, or NULL if an error
17431 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17432 true iff the declarator is of the form "(p)". */
17438 {
17440 cp_decl_specifier_seq decl_specifiers;
17442 tree default_argument;
17446 /* In a template parameter, `>' is not an operator.
17448 [temp.param]
17450 When parsing a default template-argument for a non-type
17451 template-parameter, the first non-nested `>' is taken as the end
17452 of the template parameter-list rather than a greater-than
17453 operator. */
17455 /* Type definitions may not appear in parameter types. */
17457 parser->type_definition_forbidden_message
17460 /* Parse the declaration-specifiers. */
17462 CP_PARSER_FLAGS_NONE,
17466 /* Complain about missing 'typename' or other invalid type names. */
17470 /* If an error occurred, there's no reason to attempt to parse the
17471 rest of the declaration. */
17473 {
17476 }
17478 /* Peek at the next token. */
17481 /* If the next token is a `)', `,', `=', `>', or `...', then there
17482 is no declarator. However, when variadic templates are enabled,
17483 there may be a declarator following `...'. */
17488 {
17492 }
17493 /* Otherwise, there should be a declarator. */
17494 else
17495 {
17499 /* After seeing a decl-specifier-seq, if the next token is not a
17500 "(", there is no possibility that the code is a valid
17501 expression. Therefore, if parsing tentatively, we commit at
17502 this point. */
17504 /* In an expression context, having seen:
17506 (int((char ...
17508 we cannot be sure whether we are looking at a
17509 function-type (taking a "char" as a parameter) or a cast
17510 of some object of type "char" to "int". */
17516 /* Parse the declarator. */
17519 CP_PARSER_DECLARATOR_EITHER,
17521 parenthesized_p,
17524 /* After the declarator, allow more attributes. */
17525 decl_specifiers.attributes
17528 }
17530 /* If the next token is an ellipsis, and we have not seen a
17531 declarator name, and the type of the declarator contains parameter
17532 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17533 a parameter pack expansion expression. Otherwise, leave the
17534 ellipsis for a C-style variadic function. */
17537 {
17548 {
17549 /* Consume the `...'. */
17553 /* Build a pack expansion type */
17556 else
17558 }
17559 }
17561 /* The restriction on defining new types applies only to the type
17562 of the parameter, not to the default argument. */
17565 /* If the next token is `=', then process a default argument. */
17567 {
17569 /* If we are defining a class, then the tokens that make up the
17570 default argument must be saved and processed later. */
17575 /* Outside of a class definition, we can just parse the
17576 assignment-expression. */
17577 else
17578 default_argument
17582 {
17585 else
17586 {
17588 "default arguments are only "
17591 }
17592 }
17596 {
17597 /* Find the name of the parameter pack. */
17604 template_parm_p
17610 else
17612 template_parm_p
17619 }
17620 }
17621 else
17625 declarator,
17626 default_argument);
17627 }
17629 /* Parse a default argument and return it.
17631 TEMPLATE_PARM_P is true if this is a default argument for a
17632 non-type template parameter. */
17633 static tree
17635 {
17641 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17642 set correctly. */
17645 /* Local variable names (and the `this' keyword) may not
17646 appear in a default argument. */
17649 /* Parse the assignment-expression. */
17652 default_argument
17662 }
17664 /* Parse a function-body.
17666 function-body:
17667 compound_statement */
17669 static void
17671 {
17673 }
17675 /* Parse a ctor-initializer-opt followed by a function-body. Return
17676 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17677 is true we are parsing a function-try-block. */
17679 static bool
17682 {
17690 /* Begin the function body. */
17692 /* Parse the optional ctor-initializer. */
17695 /* If we're parsing a constexpr constructor definition, we need
17696 to check that the constructor body is indeed empty. However,
17697 before we get to cp_parser_function_body lot of junk has been
17698 generated, so we can't just check that we have an empty block.
17699 Rather we take a snapshot of the outermost block, and check whether
17700 cp_parser_function_body changed its state. */
17702 {
17706 }
17707 /* Parse the function-body. */
17711 /* Finish the function body. */
17715 }
17717 /* Parse an initializer.
17719 initializer:
17720 = initializer-clause
17721 ( expression-list )
17723 Returns an expression representing the initializer. If no
17724 initializer is present, NULL_TREE is returned.
17726 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17727 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17728 set to TRUE if there is no initializer present. If there is an
17729 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17730 is set to true; otherwise it is set to false. */
17732 static tree
17735 {
17737 tree init;
17739 /* Peek at the next token. */
17742 /* Let our caller know whether or not this initializer was
17743 parenthesized. */
17745 /* Assume that the initializer is constant. */
17749 {
17750 /* Consume the `='. */
17752 /* Parse the initializer-clause. */
17754 }
17756 {
17761 non_constant_p);
17766 }
17768 {
17772 }
17773 else
17774 {
17775 /* Anything else is an error. */
17778 }
17781 }
17783 /* Parse an initializer-clause.
17785 initializer-clause:
17786 assignment-expression
17787 braced-init-list
17789 Returns an expression representing the initializer.
17791 If the `assignment-expression' production is used the value
17792 returned is simply a representation for the expression.
17794 Otherwise, calls cp_parser_braced_list. */
17796 static tree
17798 {
17799 tree initializer;
17801 /* Assume the expression is constant. */
17804 /* If it is not a `{', then we are looking at an
17805 assignment-expression. */
17807 {
17808 initializer
17811 non_constant_p);
17812 }
17813 else
17817 }
17819 /* Parse a brace-enclosed initializer list.
17821 braced-init-list:
17822 { initializer-list , [opt] }
17823 { }
17825 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17826 the elements of the initializer-list (or NULL, if the last
17827 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17828 NULL_TREE. There is no way to detect whether or not the optional
17829 trailing `,' was provided. NON_CONSTANT_P is as for
17830 cp_parser_initializer. */
17832 static tree
17834 {
17835 tree initializer;
17837 /* Consume the `{' token. */
17839 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17841 /* If it's not a `}', then there is a non-trivial initializer. */
17843 {
17844 /* Parse the initializer list. */
17847 /* A trailing `,' token is allowed. */
17850 }
17851 /* Now, there should be a trailing `}'. */
17855 }
17857 /* Parse an initializer-list.
17859 initializer-list:
17860 initializer-clause ... [opt]
17861 initializer-list , initializer-clause ... [opt]
17863 GNU Extension:
17865 initializer-list:
17866 designation initializer-clause ...[opt]
17867 initializer-list , designation initializer-clause ...[opt]
17869 designation:
17870 . identifier =
17871 identifier :
17872 [ constant-expression ] =
17874 Returns a vec of constructor_elt. The VALUE of each elt is an expression
17875 for the initializer. If the INDEX of the elt is non-NULL, it is the
17876 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17877 as for cp_parser_initializer. */
17881 {
17884 /* Assume all of the expressions are constant. */
17887 /* Parse the rest of the list. */
17889 {
17891 tree designator;
17892 tree initializer;
17895 /* If the next token is an identifier and the following one is a
17896 colon, we are looking at the GNU designated-initializer
17897 syntax. */
17901 {
17902 /* Warn the user that they are using an extension. */
17905 /* Consume the identifier. */
17907 /* Consume the `:'. */
17909 }
17910 /* Also handle the C99 syntax, '. id ='. */
17915 {
17916 /* Warn the user that they are using an extension. */
17919 /* Consume the `.'. */
17921 /* Consume the identifier. */
17923 /* Consume the `='. */
17925 }
17926 /* Also handle C99 array designators, '[ const ] ='. */
17930 {
17931 /* In C++11, [ could start a lambda-introducer. */
17943 }
17944 else
17947 /* Parse the initializer. */
17950 /* If any clause is non-constant, so is the entire initializer. */
17954 /* If we have an ellipsis, this is an initializer pack
17955 expansion. */
17957 {
17958 /* Consume the `...'. */
17961 /* Turn the initializer into an initializer expansion. */
17963 }
17965 /* Add it to the vector. */
17968 /* If the next token is not a comma, we have reached the end of
17969 the list. */
17973 /* Peek at the next token. */
17975 /* If the next token is a `}', then we're still done. An
17976 initializer-clause can have a trailing `,' after the
17977 initializer-list and before the closing `}'. */
17981 /* Consume the `,' token. */
17983 }
17986 }
17988 /* Classes [gram.class] */
17990 /* Parse a class-name.
17992 class-name:
17993 identifier
17994 template-id
17996 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17997 to indicate that names looked up in dependent types should be
17998 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17999 keyword has been used to indicate that the name that appears next
18000 is a template. TAG_TYPE indicates the explicit tag given before
18001 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
18002 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
18003 is the class being defined in a class-head.
18005 Returns the TYPE_DECL representing the class. */
18007 static tree
18015 {
18016 tree decl;
18017 tree scope;
18022 /* All class-names start with an identifier. */
18025 {
18028 }
18030 /* PARSER->SCOPE can be cleared when parsing the template-arguments
18031 to a template-id, so we save it here. */
18036 /* Any name names a type if we're following the `typename' keyword
18037 in a qualified name where the enclosing scope is type-dependent. */
18040 /* Handle the common case (an identifier, but not a template-id)
18041 efficiently. */
18044 {
18048 /* Look for the identifier. */
18052 /* If the next token isn't an identifier, we are certainly not
18053 looking at a class-name. */
18056 /* If we know this is a type-name, there's no need to look it
18057 up. */
18060 else
18061 {
18062 tree ambiguous_decls;
18063 /* If we already know that this lookup is ambiguous, then
18064 we've already issued an error message; there's no reason
18065 to check again. */
18067 {
18070 }
18071 /* If the next token is a `::', then the name must be a type
18072 name.
18074 [basic.lookup.qual]
18076 During the lookup for a name preceding the :: scope
18077 resolution operator, object, function, and enumerator
18078 names are ignored. */
18081 /* Look up the name. */
18083 tag_type,
18086 check_dependency_p,
18090 {
18094 }
18095 }
18096 }
18097 else
18098 {
18099 /* Try a template-id. */
18101 check_dependency_p,
18102 tag_type,
18103 is_declaration);
18106 }
18110 /* If this is a typename, create a TYPENAME_TYPE. */
18112 {
18117 }
18121 /* Check to see that it is really the name of a class. */
18125 /* Situations like this:
18127 template <typename T> struct A {
18128 typename T::template X<int>::I i;
18129 };
18131 are problematic. Is `T::template X<int>' a class-name? The
18132 standard does not seem to be definitive, but there is no other
18133 valid interpretation of the following `::'. Therefore, those
18134 names are considered class-names. */
18135 {
18139 }
18143 /* In Objective-C 2.0, a classname followed by '.' starts a
18144 dot-syntax expression, and it's not a type-name. */
18156 }
18158 /* Parse a class-specifier.
18160 class-specifier:
18161 class-head { member-specification [opt] }
18163 Returns the TREE_TYPE representing the class. */
18165 static tree
18167 {
18168 tree type;
18182 /* Parse the class-head. */
18185 /* If the class-head was a semantic disaster, skip the entire body
18186 of the class. */
18188 {
18192 }
18194 /* Look for the `{'. */
18196 {
18199 }
18201 /* Issue an error message if type-definitions are forbidden here. */
18203 /* Remember that we are defining one more class. */
18205 /* Inside the class, surrounding template-parameter-lists do not
18206 apply. */
18207 saved_num_template_parameter_lists
18210 /* We are not in a function body. */
18213 /* Or in a loop. */
18216 /* Or in a switch. */
18219 /* We are not immediately inside an extern "lang" block. */
18220 saved_in_unbraced_linkage_specification_p
18224 /* Start the class. */
18226 {
18229 }
18233 /* If the type is erroneous, skip the entire body of the class. */
18235 else
18236 /* Parse the member-specification. */
18239 /* Look for the trailing `}'. */
18241 /* Look for trailing attributes to apply to this class. */
18249 /* We've finished a type definition. Check for the common syntax
18250 error of forgetting a semicolon after the definition. We need to
18251 be careful, as we can't just check for not-a-semicolon and be done
18252 with it; the user might have typed:
18254 class X { } c = ...;
18255 class X { } *p = ...;
18257 and so forth. Instead, enumerate all the possible tokens that
18258 might follow this production; if we don't see one of them, then
18259 complain and silently insert the semicolon. */
18260 {
18265 /* Don't try to parse c++11 attributes here. As per the
18266 grammar, that should be a task for
18267 cp_parser_decl_specifier_seq. */
18271 {
18282 /* While it's legal for type qualifiers and storage class
18283 specifiers to follow type definitions in the grammar, only
18284 compiler testsuites contain code like that. Assume that if
18285 we see such code, then what we're really seeing is a case
18286 like:
18288 class X { }
18289 const <type> var = ...;
18291 or
18293 class Y { }
18294 static <type> func (...) ...
18296 i.e. the qualifier or specifier applies to the next
18297 declaration. To do so, however, we need to look ahead one
18298 more token to see if *that* token is a type specifier.
18300 This code could be improved to handle:
18302 class Z { }
18303 static const <type> var = ...; */
18306 {
18309 /* Handling user-defined types here would be nice, but very
18310 tricky. */
18311 want_semicolon
18314 }
18318 }
18320 /* If we don't have a type, then something is very wrong and we
18321 shouldn't try to do anything clever. Likewise for not seeing the
18322 closing brace. */
18324 {
18325 cp_token_position prev
18336 else
18339 /* Unget one token and smash it to look as though we encountered
18340 a semicolon in the input stream. */
18345 }
18346 }
18348 /* If this class is not itself within the scope of another class,
18349 then we need to parse the bodies of all of the queued function
18350 definitions. Note that the queued functions defined in a class
18351 are not always processed immediately following the
18352 class-specifier for that class. Consider:
18354 struct A {
18355 struct B { void f() { sizeof (A); } };
18356 };
18358 If `f' were processed before the processing of `A' were
18359 completed, there would be no way to compute the size of `A'.
18360 Note that the nesting we are interested in here is lexical --
18361 not the semantic nesting given by TYPE_CONTEXT. In particular,
18362 for:
18364 struct A { struct B; };
18365 struct A::B { void f() { } };
18367 there is no need to delay the parsing of `A::B::f'. */
18369 {
18370 tree decl;
18377 /* In a first pass, parse default arguments to the functions.
18378 Then, in a second pass, parse the bodies of the functions.
18379 This two-phased approach handles cases like:
18381 struct S {
18382 void f() { g(); }
18383 void g(int i = 3);
18384 };
18386 */
18388 {
18390 /* If there are default arguments that have not yet been processed,
18391 take care of them now. */
18393 {
18398 }
18399 /* Make sure that any template parameters are in scope. */
18401 /* Parse the default argument expressions. */
18403 /* Remove any template parameters from the symbol table. */
18405 }
18407 /* Now parse any NSDMIs. */
18411 {
18413 {
18418 }
18421 }
18427 /* Now parse the body of the functions. */
18431 }
18433 /* Put back any saved access checks. */
18436 /* Restore saved state. */
18440 parser->num_template_parameter_lists
18442 parser->in_unbraced_linkage_specification_p
18446 }
18448 static tree
18450 {
18451 tree ret;
18456 }
18458 /* Parse a class-head.
18460 class-head:
18461 class-key identifier [opt] base-clause [opt]
18462 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18463 class-key nested-name-specifier [opt] template-id
18464 base-clause [opt]
18466 class-virt-specifier:
18467 final
18469 GNU Extensions:
18470 class-key attributes identifier [opt] base-clause [opt]
18471 class-key attributes nested-name-specifier identifier base-clause [opt]
18472 class-key attributes nested-name-specifier [opt] template-id
18473 base-clause [opt]
18475 Upon return BASES is initialized to the list of base classes (or
18476 NULL, if there are none) in the same form returned by
18477 cp_parser_base_clause.
18479 Returns the TYPE of the indicated class. Sets
18480 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18481 involving a nested-name-specifier was used, and FALSE otherwise.
18483 Returns error_mark_node if this is not a class-head.
18485 Returns NULL_TREE if the class-head is syntactically valid, but
18486 semantically invalid in a way that means we should skip the entire
18487 body of the class. */
18489 static tree
18492 {
18493 tree nested_name_specifier;
18497 tree attributes;
18498 tree bases;
18508 /* Assume no nested-name-specifier will be present. */
18510 /* Assume no template parameter lists will be used in defining the
18511 type. */
18515 /* Look for the class-key. */
18520 /* Parse the attributes. */
18523 /* If the next token is `::', that is invalid -- but sometimes
18524 people do try to write:
18526 struct ::S {};
18528 Handle this gracefully by accepting the extra qualifier, and then
18529 issuing an error about it later if this really is a
18530 class-head. If it turns out just to be an elaborated type
18531 specifier, remain silent. */
18537 /* Determine the name of the class. Begin by looking for an
18538 optional nested-name-specifier. */
18540 nested_name_specifier
18546 /* If there was a nested-name-specifier, then there *must* be an
18547 identifier. */
18549 {
18551 /* Although the grammar says `identifier', it really means
18552 `class-name' or `template-name'. You are only allowed to
18553 define a class that has already been declared with this
18554 syntax.
18556 The proposed resolution for Core Issue 180 says that wherever
18557 you see `class T::X' you should treat `X' as a type-name.
18559 It is OK to define an inaccessible class; for example:
18561 class A { class B; };
18562 class A::B {};
18564 We do not know if we will see a class-name, or a
18565 template-name. We look for a class-name first, in case the
18566 class-name is a template-id; if we looked for the
18567 template-name first we would stop after the template-name. */
18572 class_type,
18576 /* If that didn't work, ignore the nested-name-specifier. */
18578 {
18584 }
18585 /* If we could not find a corresponding TYPE, treat this
18586 declaration like an unqualified declaration. */
18589 /* Otherwise, count the number of templates used in TYPE and its
18590 containing scopes. */
18591 else
18592 {
18593 tree scope;
18607 }
18608 }
18609 /* Otherwise, the identifier is optional. */
18610 else
18611 {
18612 /* We don't know whether what comes next is a template-id,
18613 an identifier, or nothing at all. */
18615 /* Check for a template-id. */
18620 class_key,
18622 /* If that didn't work, it could still be an identifier. */
18624 {
18626 {
18629 }
18630 else
18632 }
18633 else
18634 {
18637 }
18638 }
18643 {
18645 class_key,
18647 }
18650 /* If it's not a `:' or a `{' then we can't really be looking at a
18651 class-head, since a class-head only appears as part of a
18652 class-specifier. We have to detect this situation before calling
18653 xref_tag, since that has irreversible side-effects. */
18655 {
18659 }
18661 /* At this point, we're going ahead with the class-specifier, even
18662 if some other problem occurs. */
18665 {
18670 }
18671 /* Issue the error about the overly-qualified name now. */
18673 {
18678 }
18680 {
18685 }
18687 {
18688 tree scope;
18690 /* Reject typedef-names in class heads. */
18692 {
18695 type);
18698 }
18700 /* Figure out in what scope the declaration is being placed. */
18702 /* If that scope does not contain the scope in which the
18703 class was originally declared, the program is invalid. */
18705 {
18708 "declaration of %qD in namespace %qD which does not "
18711 else
18717 }
18718 /* [dcl.meaning]
18720 A declarator-id shall not be qualified except for the
18721 definition of a ... nested class outside of its class
18722 ... [or] the definition or explicit instantiation of a
18723 class member of a namespace outside of its namespace. */
18725 {
18730 }
18731 }
18732 /* An explicit-specialization must be preceded by "template <>". If
18733 it is not, try to recover gracefully. */
18737 {
18741 /* Take the same action that would have been taken by
18742 cp_parser_explicit_specialization. */
18745 }
18746 /* There must be no "return" statements between this point and the
18747 end of this function; set "type "to the correct return value and
18748 use "goto done;" to return. */
18749 /* Make sure that the right number of template parameters were
18750 present. */
18754 {
18755 /* If something went wrong, there is no point in even trying to
18756 process the class-definition. */
18759 }
18761 /* Look up the type. */
18763 {
18767 {
18771 }
18772 else
18773 {
18776 }
18779 }
18781 {
18782 tree class_type;
18784 /* Given:
18786 template <typename T> struct S { struct T };
18787 template <typename T> struct S<T>::T { };
18789 we will get a TYPENAME_TYPE when processing the definition of
18790 `S::T'. We need to resolve it to the actual type before we
18791 try to define it. */
18793 {
18798 else
18799 {
18802 }
18803 }
18807 {
18810 }
18813 /* Enter the scope indicated by the nested-name-specifier. */
18815 /* Get the canonical version of this type. */
18819 {
18822 {
18825 }
18826 }
18830 }
18832 {
18833 /* If the class was unnamed, create a dummy name. */
18838 }
18840 /* Indicate whether this class was declared as a `class' or as a
18841 `struct'. */
18846 /* If this type was already complete, and we see another definition,
18847 that's an error. */
18849 {
18851 type);
18853 type);
18856 }
18861 {
18862 /* Apply attributes now, before any use of the class as a template
18863 argument in its base list. */
18866 }
18868 /* We will have entered the scope containing the class; the names of
18869 base classes should be looked up in that context. For example:
18871 struct A { struct B {}; struct C; };
18872 struct A::C : B {};
18874 is valid. */
18876 /* Get the list of base-classes, if there is one. */
18879 else
18882 /* If we're really defining a class, process the base classes.
18883 If they're invalid, fail. */
18888 done:
18889 /* Leave the scope given by the nested-name-specifier. We will
18890 enter the class scope itself while processing the members. */
18895 {
18898 }
18904 out:
18907 }
18909 /* Parse a class-key.
18911 class-key:
18912 class
18913 struct
18914 union
18916 Returns the kind of class-key specified, or none_type to indicate
18917 error. */
18919 static enum tag_types
18921 {
18925 /* Look for the class-key. */
18930 /* Check to see if the TOKEN is a class-key. */
18935 }
18937 /* Parse an (optional) member-specification.
18939 member-specification:
18940 member-declaration member-specification [opt]
18941 access-specifier : member-specification [opt] */
18943 static void
18945 {
18947 {
18951 /* Peek at the next token. */
18953 /* If it's a `}', or EOF then we've seen all the members. */
18959 /* See if this token is a keyword. */
18962 {
18966 /* Consume the access-specifier. */
18968 /* Remember which access-specifier is active. */
18970 /* Look for the `:'. */
18975 /* Accept #pragmas at class scope. */
18977 {
18980 }
18982 /* Otherwise, the next construction must be a
18983 member-declaration. */
18985 }
18986 }
18987 }
18989 /* Parse a member-declaration.
18991 member-declaration:
18992 decl-specifier-seq [opt] member-declarator-list [opt] ;
18993 function-definition ; [opt]
18994 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18995 using-declaration
18996 template-declaration
18997 alias-declaration
18999 member-declarator-list:
19000 member-declarator
19001 member-declarator-list , member-declarator
19003 member-declarator:
19004 declarator pure-specifier [opt]
19005 declarator constant-initializer [opt]
19006 identifier [opt] : constant-expression
19008 GNU Extensions:
19010 member-declaration:
19011 __extension__ member-declaration
19013 member-declarator:
19014 declarator attributes [opt] pure-specifier [opt]
19015 declarator attributes [opt] constant-initializer [opt]
19016 identifier [opt] attributes [opt] : constant-expression
19018 C++0x Extensions:
19020 member-declaration:
19021 static_assert-declaration */
19023 static void
19025 {
19026 cp_decl_specifier_seq decl_specifiers;
19027 tree prefix_attributes;
19028 tree decl;
19037 /* Check for the `__extension__' keyword. */
19039 {
19040 /* Recurse. */
19042 /* Restore the old value of the PEDANTIC flag. */
19046 }
19048 /* Check for a template-declaration. */
19050 {
19051 /* An explicit specialization here is an error condition, and we
19052 expect the specialization handler to detect and report this. */
19056 else
19060 }
19062 /* Check for a using-declaration. */
19064 {
19066 {
19067 /* Parse the using-declaration. */
19071 }
19072 else
19073 {
19074 tree decl;
19078 /* Note that if we actually see the '=' token after the
19079 identifier, cp_parser_alias_declaration commits the
19080 tentative parse. In that case, we really expects an
19081 alias-declaration. Otherwise, we expect a using
19082 declaration. */
19083 alias_decl_expected =
19089 else
19093 }
19094 }
19096 /* Check for @defs. */
19098 {
19103 {
19108 }
19110 }
19112 /* If the next token is `static_assert' we have a static assertion. */
19114 {
19117 }
19124 /* Parse the decl-specifier-seq. */
19127 CP_PARSER_FLAGS_OPTIONAL,
19130 /* Check for an invalid type-name. */
19134 /* If there is no declarator, then the decl-specifier-seq should
19135 specify a type. */
19137 {
19138 /* If there was no decl-specifier-seq, and the next token is a
19139 `;', then we have something like:
19141 struct S { ; };
19143 [class.mem]
19145 Each member-declaration shall declare at least one member
19146 name of the class. */
19148 {
19152 }
19153 else
19154 {
19155 tree type;
19157 /* See if this declaration is a friend. */
19159 /* If there were decl-specifiers, check to see if there was
19160 a class-declaration. */
19163 /* Nested classes have already been added to the class, but
19164 a `friend' needs to be explicitly registered. */
19166 {
19167 /* If the `friend' keyword was present, the friend must
19168 be introduced with a class-key. */
19171 "in C++03 a class-key must be used "
19173 /* In this case:
19175 template <typename T> struct A {
19176 friend struct A<T>::B;
19177 };
19179 A<T>::B will be represented by a TYPENAME_TYPE, and
19180 therefore not recognized by check_tag_decl. */
19182 {
19186 }
19189 "friend declaration does not name a class or "
19191 else
19194 }
19195 /* If there is no TYPE, an error message will already have
19196 been issued. */
19198 ;
19199 /* An anonymous aggregate has to be handled specially; such
19200 a declaration really declares a data member (with a
19201 particular type), as opposed to a nested class. */
19203 {
19204 /* C++11 9.5/6. */
19207 "a storage class on an anonymous aggregate "
19210 /* Remove constructors and such from TYPE, now that we
19211 know it is an anonymous aggregate. */
19213 /* And make the corresponding data member. */
19216 /* Add it to the class. */
19218 }
19219 else
19220 cp_parser_check_access_in_redeclaration
19223 }
19224 }
19225 else
19226 {
19229 /* Clear attributes from the decl_specifiers but keep them
19230 around as prefix attributes that apply them to the entity
19231 being declared. */
19235 /* See if these declarations will be friends. */
19238 /* Keep going until we hit the `;' at the end of the
19239 declaration. */
19241 {
19243 tree first_attribute;
19245 /* Peek at the next token. */
19248 /* Check for a bitfield declaration. */
19253 {
19254 tree identifier;
19255 tree width;
19257 /* Get the name of the bitfield. Note that we cannot just
19258 check TOKEN here because it may have been invalidated by
19259 the call to cp_lexer_peek_nth_token above. */
19262 else
19265 /* Consume the `:' token. */
19267 /* Get the width of the bitfield. */
19268 width
19271 NULL);
19273 /* Look for attributes that apply to the bitfield. */
19275 /* Remember which attributes are prefix attributes and
19276 which are not. */
19278 /* Combine the attributes. */
19281 /* Create the bitfield declaration. */
19284 identifier,
19285 sfk_none)
19288 width,
19289 attributes);
19290 }
19291 else
19292 {
19294 tree initializer;
19295 tree asm_specification;
19298 /* Parse the declarator. */
19299 declarator
19305 /* If something went wrong parsing the declarator, make sure
19306 that we at least consume some tokens. */
19308 {
19309 /* Skip to the end of the statement. */
19311 /* If the next token is not a semicolon, that is
19312 probably because we just skipped over the body of
19313 a function. So, we consume a semicolon if
19314 present, but do not issue an error message if it
19315 is not present. */
19317 CPP_SEMICOLON))
19320 }
19323 cp_parser_check_for_definition_in_return_type
19327 /* Look for an asm-specification. */
19329 /* Look for attributes that apply to the declaration. */
19331 /* Remember which attributes are prefix attributes and
19332 which are not. */
19334 /* Combine the attributes. */
19337 /* If it's an `=', then we have a constant-initializer or a
19338 pure-specifier. It is not correct to parse the
19339 initializer before registering the member declaration
19340 since the member declaration should be in scope while
19341 its initializer is processed. However, the rest of the
19342 front end does not yet provide an interface that allows
19343 us to handle this correctly. */
19345 {
19346 /* In [class.mem]:
19348 A pure-specifier shall be used only in the declaration of
19349 a virtual function.
19351 A member-declarator can contain a constant-initializer
19352 only if it declares a static member of integral or
19353 enumeration type.
19355 Therefore, if the DECLARATOR is for a function, we look
19356 for a pure-specifier; otherwise, we look for a
19357 constant-initializer. When we call `grokfield', it will
19358 perform more stringent semantics checks. */
19369 {
19371 /* Don't require a constant rvalue in C++11, since we
19372 might want a reference constant. We'll enforce
19373 constancy later. */
19375 /* Parse the initializer. */
19378 }
19379 else
19380 /* Parse the initializer. */
19382 }
19385 {
19389 else
19391 }
19392 /* Otherwise, there is no initializer. */
19393 else
19396 /* See if we are probably looking at a function
19397 definition. We are certainly not looking at a
19398 member-declarator. Calling `grokfield' has
19399 side-effects, so we must not do it unless we are sure
19400 that we are looking at a member-declarator. */
19403 {
19404 /* The grammar does not allow a pure-specifier to be
19405 used when a member function is defined. (It is
19406 possible that this fact is an oversight in the
19407 standard, since a pure function may be defined
19408 outside of the class-specifier. */
19414 declarator,
19415 attributes);
19416 /* If the member was not a friend, declare it here. */
19419 /* Peek at the next token. */
19421 /* If the next token is a semicolon, consume it. */
19425 }
19426 else
19429 /* Create the declaration. */
19432 asm_specification,
19433 attributes);
19434 }
19436 /* Reset PREFIX_ATTRIBUTES. */
19442 /* If there is any qualification still in effect, clear it
19443 now; we will be starting fresh with the next declarator. */
19447 /* If it's a `,', then there are more declarators. */
19449 {
19452 {
19456 }
19457 }
19458 /* If the next token isn't a `;', then we have a parse error. */
19460 CPP_SEMICOLON))
19461 {
19462 /* The next token might be a ways away from where the
19463 actual semicolon is missing. Find the previous token
19464 and use that for our error position. */
19469 /* Assume that the user meant to provide a semicolon. If
19470 we were to cp_parser_skip_to_end_of_statement, we might
19471 skip to a semicolon inside a member function definition
19472 and issue nonsensical error messages. */
19474 }
19477 {
19478 /* Add DECL to the list of members. */
19487 /* Add DECL to the queue of NSDMI to be parsed later. */
19489 }
19493 }
19494 }
19497 out:
19499 }
19501 /* Parse a pure-specifier.
19503 pure-specifier:
19504 = 0
19506 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19507 Otherwise, ERROR_MARK_NODE is returned. */
19509 static tree
19511 {
19514 /* Look for the `=' token. */
19517 /* Look for the `0' token. */
19526 /* Accept = default or = delete in c++0x mode. */
19529 {
19532 }
19534 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19536 {
19541 }
19543 {
19546 }
19549 }
19551 /* Parse a constant-initializer.
19553 constant-initializer:
19554 = constant-expression
19556 Returns a representation of the constant-expression. */
19558 static tree
19560 {
19561 /* Look for the `=' token. */
19565 /* It is invalid to write:
19567 struct S { static const int i = { 7 }; };
19569 */
19571 {
19574 /* Consume the opening brace. */
19576 /* Skip the initializer. */
19578 /* Look for the trailing `}'. */
19582 }
19586 NULL);
19587 }
19589 /* Derived classes [gram.class.derived] */
19591 /* Parse a base-clause.
19593 base-clause:
19594 : base-specifier-list
19596 base-specifier-list:
19597 base-specifier ... [opt]
19598 base-specifier-list , base-specifier ... [opt]
19600 Returns a TREE_LIST representing the base-classes, in the order in
19601 which they were declared. The representation of each node is as
19602 described by cp_parser_base_specifier.
19604 In the case that no bases are specified, this function will return
19605 NULL_TREE, not ERROR_MARK_NODE. */
19607 static tree
19609 {
19612 /* Look for the `:' that begins the list. */
19615 /* Scan the base-specifier-list. */
19617 {
19619 tree base;
19622 /* Look for the base-specifier. */
19624 /* Look for the (optional) ellipsis. */
19626 {
19627 /* Consume the `...'. */
19631 }
19633 /* Add BASE to the front of the list. */
19635 {
19637 /* Make this a pack expansion type. */
19641 {
19644 }
19645 }
19646 /* Peek at the next token. */
19648 /* If it's not a comma, then the list is complete. */
19651 /* Consume the `,'. */
19653 }
19655 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19656 base class had a qualified name. However, the next name that
19657 appears is certainly not qualified. */
19663 }
19665 /* Parse a base-specifier.
19667 base-specifier:
19668 :: [opt] nested-name-specifier [opt] class-name
19669 virtual access-specifier [opt] :: [opt] nested-name-specifier
19670 [opt] class-name
19671 access-specifier virtual [opt] :: [opt] nested-name-specifier
19672 [opt] class-name
19674 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19675 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19676 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19677 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19679 static tree
19681 {
19689 tree type;
19691 /* Process the optional `virtual' and `access-specifier'. */
19693 {
19694 /* Peek at the next token. */
19696 /* Process `virtual'. */
19698 {
19700 /* If `virtual' appears more than once, issue an error. */
19702 {
19706 }
19710 /* Consume the `virtual' token. */
19718 /* If more than one access specifier appears, issue an
19719 error. */
19722 {
19726 }
19730 /* Consume the access-specifier. */
19738 }
19739 }
19740 /* It is not uncommon to see programs mechanically, erroneously, use
19741 the 'typename' keyword to denote (dependent) qualified types
19742 as base classes. */
19744 {
19749 else
19751 "keyword %<typename%> not allowed in this context "
19754 }
19756 /* Look for the optional `::' operator. */
19758 /* Look for the nested-name-specifier. The simplest way to
19759 implement:
19761 [temp.res]
19763 The keyword `typename' is not permitted in a base-specifier or
19764 mem-initializer; in these contexts a qualified name that
19765 depends on a template-parameter is implicitly assumed to be a
19766 type name.
19768 is to pretend that we have seen the `typename' keyword at this
19769 point. */
19773 typename_type,
19775 /* If the base class is given by a qualified name, assume that names
19776 we see are type names or templates, as appropriate. */
19782 /* DR 950 allows decltype as a base-specifier. */
19784 else
19785 {
19786 /* Otherwise, look for the class-name. */
19788 class_scope_p,
19789 template_p,
19790 typename_type,
19795 }
19801 }
19803 /* Exception handling [gram.exception] */
19805 /* Parse an (optional) noexcept-specification.
19807 noexcept-specification:
19808 noexcept ( constant-expression ) [opt]
19810 If no noexcept-specification is present, returns NULL_TREE.
19811 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19812 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19813 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19814 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19815 in which case a boolean condition is returned instead. */
19817 static tree
19822 {
19826 /* Peek at the next token. */
19829 /* Is it a noexcept-specification? */
19831 {
19832 tree expr;
19836 {
19840 {
19841 /* Types may not be defined in an exception-specification. */
19843 parser->type_definition_forbidden_message
19848 /* Restore the saved message. */
19850 }
19851 else
19852 {
19855 }
19858 }
19859 else
19860 {
19864 }
19866 /* We cannot build a noexcept-spec right away because this will check
19867 that expr is a constexpr. */
19870 else
19872 }
19873 else
19875 }
19877 /* Parse an (optional) exception-specification.
19879 exception-specification:
19880 throw ( type-id-list [opt] )
19882 Returns a TREE_LIST representing the exception-specification. The
19883 TREE_VALUE of each node is a type. */
19885 static tree
19887 {
19889 tree type_id_list;
19892 /* Peek at the next token. */
19895 /* Is it a noexcept-specification? */
19901 /* If it's not `throw', then there's no exception-specification. */
19905 #if 0
19906 /* Enable this once a lot of code has transitioned to noexcept? */
19910 #endif
19912 /* Consume the `throw'. */
19915 /* Look for the `('. */
19918 /* Peek at the next token. */
19920 /* If it's not a `)', then there is a type-id-list. */
19922 {
19923 /* Types may not be defined in an exception-specification. */
19925 parser->type_definition_forbidden_message
19927 /* Parse the type-id-list. */
19929 /* Restore the saved message. */
19931 }
19932 else
19935 /* Look for the `)'. */
19939 }
19941 /* Parse an (optional) type-id-list.
19943 type-id-list:
19944 type-id ... [opt]
19945 type-id-list , type-id ... [opt]
19947 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19948 in the order that the types were presented. */
19950 static tree
19952 {
19956 {
19958 tree type;
19960 /* Get the next type-id. */
19962 /* Parse the optional ellipsis. */
19964 {
19965 /* Consume the `...'. */
19968 /* Turn the type into a pack expansion expression. */
19970 }
19971 /* Add it to the list. */
19973 /* Peek at the next token. */
19975 /* If it is not a `,', we are done. */
19978 /* Consume the `,'. */
19980 }
19983 }
19985 /* Parse a try-block.
19987 try-block:
19988 try compound-statement handler-seq */
19990 static tree
19992 {
19993 tree try_block;
20003 }
20005 /* Parse a function-try-block.
20007 function-try-block:
20008 try ctor-initializer [opt] function-body handler-seq */
20010 static bool
20012 {
20013 tree compound_stmt;
20014 tree try_block;
20017 /* Look for the `try' keyword. */
20020 /* Let the rest of the front end know where we are. */
20022 /* Parse the function-body. */
20023 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
20025 /* We're done with the `try' part. */
20027 /* Parse the handlers. */
20029 /* We're done with the handlers. */
20033 }
20035 /* Parse a handler-seq.
20037 handler-seq:
20038 handler handler-seq [opt] */
20040 static void
20042 {
20044 {
20047 /* Parse the handler. */
20049 /* Peek at the next token. */
20051 /* If it's not `catch' then there are no more handlers. */
20054 }
20055 }
20057 /* Parse a handler.
20059 handler:
20060 catch ( exception-declaration ) compound-statement */
20062 static void
20064 {
20065 tree handler;
20066 tree declaration;
20076 }
20078 /* Parse an exception-declaration.
20080 exception-declaration:
20081 type-specifier-seq declarator
20082 type-specifier-seq abstract-declarator
20083 type-specifier-seq
20084 ...
20086 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20087 ellipsis variant is used. */
20089 static tree
20091 {
20092 cp_decl_specifier_seq type_specifiers;
20096 /* If it's an ellipsis, it's easy to handle. */
20098 {
20099 /* Consume the `...' token. */
20102 }
20104 /* Types may not be defined in exception-declarations. */
20106 parser->type_definition_forbidden_message
20109 /* Parse the type-specifier-seq. */
20113 /* If it's a `)', then there is no declarator. */
20116 else
20122 /* Restore the saved message. */
20129 }
20131 /* Parse a throw-expression.
20133 throw-expression:
20134 throw assignment-expression [opt]
20136 Returns a THROW_EXPR representing the throw-expression. */
20138 static tree
20140 {
20141 tree expression;
20146 /* Figure out whether or not there is an assignment-expression
20147 following the "throw" keyword. */
20155 else
20160 }
20162 /* GNU Extensions */
20164 /* Parse an (optional) asm-specification.
20166 asm-specification:
20167 asm ( string-literal )
20169 If the asm-specification is present, returns a STRING_CST
20170 corresponding to the string-literal. Otherwise, returns
20171 NULL_TREE. */
20173 static tree
20175 {
20177 tree asm_specification;
20179 /* Peek at the next token. */
20181 /* If the next token isn't the `asm' keyword, then there's no
20182 asm-specification. */
20186 /* Consume the `asm' token. */
20188 /* Look for the `('. */
20191 /* Look for the string-literal. */
20194 /* Look for the `)'. */
20198 }
20200 /* Parse an asm-operand-list.
20202 asm-operand-list:
20203 asm-operand
20204 asm-operand-list , asm-operand
20206 asm-operand:
20207 string-literal ( expression )
20208 [ string-literal ] string-literal ( expression )
20210 Returns a TREE_LIST representing the operands. The TREE_VALUE of
20211 each node is the expression. The TREE_PURPOSE is itself a
20212 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
20213 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
20214 is a STRING_CST for the string literal before the parenthesis. Returns
20215 ERROR_MARK_NODE if any of the operands are invalid. */
20217 static tree
20219 {
20224 {
20225 tree string_literal;
20226 tree expression;
20227 tree name;
20230 {
20231 /* Consume the `[' token. */
20233 /* Read the operand name. */
20238 /* Look for the closing `]'. */
20240 }
20241 else
20243 /* Look for the string-literal. */
20246 /* Look for the `('. */
20248 /* Parse the expression. */
20250 /* Look for the `)'. */
20258 /* Add this operand to the list. */
20260 expression,
20261 asm_operands);
20262 /* If the next token is not a `,', there are no more
20263 operands. */
20266 /* Consume the `,'. */
20268 }
20271 }
20273 /* Parse an asm-clobber-list.
20275 asm-clobber-list:
20276 string-literal
20277 asm-clobber-list , string-literal
20279 Returns a TREE_LIST, indicating the clobbers in the order that they
20280 appeared. The TREE_VALUE of each node is a STRING_CST. */
20282 static tree
20284 {
20288 {
20289 tree string_literal;
20291 /* Look for the string literal. */
20293 /* Add it to the list. */
20295 /* If the next token is not a `,', then the list is
20296 complete. */
20299 /* Consume the `,' token. */
20301 }
20304 }
20306 /* Parse an asm-label-list.
20308 asm-label-list:
20309 identifier
20310 asm-label-list , identifier
20312 Returns a TREE_LIST, indicating the labels in the order that they
20313 appeared. The TREE_VALUE of each node is a label. */
20315 static tree
20317 {
20321 {
20324 /* Look for the identifier. */
20327 {
20330 {
20336 }
20337 }
20338 /* If the next token is not a `,', then the list is
20339 complete. */
20342 /* Consume the `,' token. */
20344 }
20347 }
20349 /* Return TRUE iff the next tokens in the stream are possibly the
20350 beginning of a GNU extension attribute. */
20352 static bool
20354 {
20356 }
20358 /* Return TRUE iff the next tokens in the stream are possibly the
20359 beginning of a standard C++-11 attribute specifier. */
20361 static bool
20363 {
20365 }
20367 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20368 beginning of a standard C++-11 attribute specifier. */
20370 static bool
20372 {
20380 }
20382 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20383 beginning of a GNU extension attribute. */
20385 static bool
20387 {
20391 }
20393 /* Return true iff the next tokens can be the beginning of either a
20394 GNU attribute list, or a standard C++11 attribute sequence. */
20396 static bool
20398 {
20401 }
20403 /* Return true iff the next Nth tokens can be the beginning of either
20404 a GNU attribute list, or a standard C++11 attribute sequence. */
20406 static bool
20408 {
20411 }
20413 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
20414 of GNU attributes, or return NULL. */
20416 static tree
20418 {
20422 }
20424 /* Parse an (optional) series of attributes.
20426 attributes:
20427 attributes attribute
20429 attribute:
20430 __attribute__ (( attribute-list [opt] ))
20432 The return value is as for cp_parser_gnu_attribute_list. */
20434 static tree
20436 {
20440 {
20442 tree attribute_list;
20445 /* Peek at the next token. */
20447 /* If it's not `__attribute__', then we're done. */
20451 /* Consume the `__attribute__' keyword. */
20453 /* Look for the two `(' tokens. */
20457 /* Peek at the next token. */
20460 /* Parse the attribute-list. */
20462 else
20463 /* If the next token is a `)', then there is no attribute
20464 list. */
20467 /* Look for the two `)' tokens. */
20475 /* Add these new attributes to the list. */
20477 }
20480 }
20482 /* Parse a GNU attribute-list.
20484 attribute-list:
20485 attribute
20486 attribute-list , attribute
20488 attribute:
20489 identifier
20490 identifier ( identifier )
20491 identifier ( identifier , expression-list )
20492 identifier ( expression-list )
20494 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20495 to an attribute. The TREE_PURPOSE of each node is the identifier
20496 indicating which attribute is in use. The TREE_VALUE represents
20497 the arguments, if any. */
20499 static tree
20501 {
20507 {
20509 tree identifier;
20510 tree attribute;
20512 /* Look for the identifier. We also allow keywords here; for
20513 example `__attribute__ ((const))' is legal. */
20517 {
20520 /* Consume the token. */
20523 /* Save away the identifier that indicates which attribute
20524 this is. */
20526 /* For keywords, use the canonical spelling, not the
20527 parsed identifier. */
20533 /* Peek at the next token. */
20535 /* If it's an `(', then parse the attribute arguments. */
20537 {
20541 vec = cp_parser_parenthesized_expression_list
20547 else
20548 {
20551 }
20552 /* Save the arguments away. */
20554 }
20557 {
20558 /* Add this attribute to the list. */
20561 }
20564 }
20565 /* Now, look for more attributes. If the next token isn't a
20566 `,', we're done. */
20570 /* Consume the comma and keep going. */
20572 }
20575 /* We built up the list in reverse order. */
20577 }
20579 /* Parse a standard C++11 attribute.
20581 The returned representation is a TREE_LIST which TREE_PURPOSE is
20582 the scoped name of the attribute, and the TREE_VALUE is its
20583 arguments list.
20585 Note that the scoped name of the attribute is itself a TREE_LIST
20586 which TREE_PURPOSE is the namespace of the attribute, and
20587 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
20588 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
20589 and which TREE_PURPOSE is directly the attribute name.
20591 Clients of the attribute code should use get_attribute_namespace
20592 and get_attribute_name to get the actual namespace and name of
20593 attributes, regardless of their being GNU or C++11 attributes.
20595 attribute:
20596 attribute-token attribute-argument-clause [opt]
20598 attribute-token:
20599 identifier
20600 attribute-scoped-token
20602 attribute-scoped-token:
20603 attribute-namespace :: identifier
20605 attribute-namespace:
20606 identifier
20608 attribute-argument-clause:
20609 ( balanced-token-seq )
20611 balanced-token-seq:
20612 balanced-token [opt]
20613 balanced-token-seq balanced-token
20615 balanced-token:
20616 ( balanced-token-seq )
20617 [ balanced-token-seq ]
20618 { balanced-token-seq }. */
20620 static tree
20622 {
20626 /* First, parse name of the the attribute, a.k.a
20627 attribute-token. */
20644 {
20645 /* We are seeing a scoped attribute token. */
20655 else
20656 {
20660 }
20662 NULL_TREE);
20664 }
20665 else
20667 NULL_TREE);
20669 /* Now parse the optional argument clause of the attribute. */
20674 {
20680 /* A GNU attribute that takes an identifier in parameter. */
20683 vec = cp_parser_parenthesized_expression_list
20689 else
20690 {
20693 }
20697 else
20699 }
20702 }
20704 /* Parse a list of standard C++-11 attributes.
20706 attribute-list:
20707 attribute [opt]
20708 attribute-list , attribute[opt]
20709 attribute ...
20710 attribute-list , attribute ...
20711 */
20713 static tree
20715 {
20720 {
20725 {
20728 }
20733 }
20736 }
20738 /* Parse a standard C++-11 attribute specifier.
20740 attribute-specifier:
20741 [ [ attribute-list ] ]
20742 alignment-specifier
20744 alignment-specifier:
20745 alignas ( type-id ... [opt] )
20746 alignas ( alignment-expression ... [opt] ). */
20748 static tree
20750 {
20756 {
20765 else
20766 /* Warn about parsing c++11 attribute in non-c++1 mode, only
20767 when we are sure that we have actually parsed them. */
20769 }
20770 else
20771 {
20772 tree alignas_expr;
20774 /* Look for an alignment-specifier. */
20786 {
20789 }
20795 {
20799 alignas_expr =
20805 }
20808 {
20811 }
20815 /* Build the C++-11 representation of an 'aligned'
20816 attribute. */
20817 attributes =
20821 }
20824 }
20826 /* Parse a standard C++-11 attribute-specifier-seq.
20828 attribute-specifier-seq:
20829 attribute-specifier-seq [opt] attribute-specifier
20830 */
20832 static tree
20834 {
20838 {
20847 }
20851 }
20853 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20854 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20855 current value of the PEDANTIC flag, regardless of whether or not
20856 the `__extension__' keyword is present. The caller is responsible
20857 for restoring the value of the PEDANTIC flag. */
20859 static bool
20861 {
20862 /* Save the old value of the PEDANTIC flag. */
20866 {
20867 /* Consume the `__extension__' token. */
20869 /* We're not being pedantic while the `__extension__' keyword is
20870 in effect. */
20874 }
20877 }
20879 /* Parse a label declaration.
20881 label-declaration:
20882 __label__ label-declarator-seq ;
20884 label-declarator-seq:
20885 identifier , label-declarator-seq
20886 identifier */
20888 static void
20890 {
20891 /* Look for the `__label__' keyword. */
20895 {
20896 tree identifier;
20898 /* Look for an identifier. */
20900 /* If we failed, stop. */
20903 /* Declare it as a label. */
20905 /* If the next token is a `;', stop. */
20908 /* Look for the `,' separating the label declarations. */
20910 }
20912 /* Look for the final `;'. */
20914 }
20916 /* Support Functions */
20918 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20919 NAME should have one of the representations used for an
20920 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20921 is returned. If PARSER->SCOPE is a dependent type, then a
20922 SCOPE_REF is returned.
20924 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20925 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20926 was formed. Abstractly, such entities should not be passed to this
20927 function, because they do not need to be looked up, but it is
20928 simpler to check for this special case here, rather than at the
20929 call-sites.
20931 In cases not explicitly covered above, this function returns a
20932 DECL, OVERLOAD, or baselink representing the result of the lookup.
20933 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20934 is returned.
20936 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20937 (e.g., "struct") that was used. In that case bindings that do not
20938 refer to types are ignored.
20940 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20941 ignored.
20943 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20944 are ignored.
20946 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20947 types.
20949 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20950 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20951 NULL_TREE otherwise. */
20953 static tree
20960 location_t name_location)
20961 {
20962 tree decl;
20965 /* Assume that the lookup will be unambiguous. */
20969 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20970 no longer valid. Note that if we are parsing tentatively, and
20971 the parse fails, OBJECT_TYPE will be automatically restored. */
20977 /* A template-id has already been resolved; there is no lookup to
20978 do. */
20982 {
20986 }
20988 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20989 it should already have been checked to make sure that the name
20990 used matches the type being destroyed. */
20992 {
20993 tree type;
20995 /* Figure out to which type this destructor applies. */
21000 else
21002 /* If that's not a class type, there is no destructor. */
21009 /* If it was a class type, return the destructor. */
21011 }
21013 /* By this point, the NAME should be an ordinary identifier. If
21014 the id-expression was a qualified name, the qualifying scope is
21015 stored in PARSER->SCOPE at this point. */
21018 /* Perform the lookup. */
21020 {
21026 /* If the SCOPE is dependent, the lookup must be deferred until
21027 the template is instantiated -- unless we are explicitly
21028 looking up names in uninstantiated templates. Even then, we
21029 cannot look up the name if the scope is not a class type; it
21030 might, for example, be a template type parameter. */
21035 /* Defer lookup. */
21037 else
21038 {
21041 /* If PARSER->SCOPE is a dependent type, then it must be a
21042 class type, and we must not be checking dependencies;
21043 otherwise, we would have processed this lookup above. So
21044 that PARSER->SCOPE is not considered a dependent base by
21045 lookup_member, we must enter the scope here. */
21049 /* If the PARSER->SCOPE is a template specialization, it
21050 may be instantiated during name lookup. In that case,
21051 errors may be issued. Even if we rollback the current
21052 tentative parse, those errors are valid. */
21057 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21058 lookup result and the nested-name-specifier nominates a class C:
21059 * if the name specified after the nested-name-specifier, when
21060 looked up in C, is the injected-class-name of C (Clause 9), or
21061 * if the name specified after the nested-name-specifier is the
21062 same as the identifier or the simple-template-id's template-
21063 name in the last component of the nested-name-specifier,
21064 the name is instead considered to name the constructor of
21065 class C. [ Note: for example, the constructor is not an
21066 acceptable lookup result in an elaborated-type-specifier so
21067 the constructor would not be used in place of the
21068 injected-class-name. --end note ] Such a constructor name
21069 shall be used only in the declarator-id of a declaration that
21070 names a constructor or in a using-declaration. */
21078 /* If we have a single function from a using decl, pull it out. */
21085 }
21087 /* If the scope is a dependent type and either we deferred lookup or
21088 we did lookup but didn't find the name, rememeber the name. */
21091 {
21093 {
21094 tree type;
21096 /* The resolution to Core Issue 180 says that `struct
21097 A::B' should be considered a type-name, even if `A'
21098 is dependent. */
21102 }
21106 CPP_CLOSE_PAREN)))
21110 else
21113 is_template);
21114 }
21117 }
21119 {
21121 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21122 OBJECT_TYPE is not a class. */
21124 /* If the OBJECT_TYPE is a template specialization, it may
21125 be instantiated during name lookup. In that case, errors
21126 may be issued. Even if we rollback the current tentative
21127 parse, those errors are valid. */
21129 name,
21132 tf_warning_or_error);
21133 /* Look it up in the enclosing context, too. */
21141 }
21142 else
21143 {
21149 }
21151 /* If the lookup failed, let our caller know. */
21155 /* Pull out the template from an injected-class-name (or multiple). */
21159 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21161 {
21164 /* The error message we have to print is too complicated for
21165 cp_parser_error, so we incorporate its actions directly. */
21167 {
21169 name);
21171 }
21173 }
21181 /* If we have resolved the name of a member declaration, check to
21182 see if the declaration is accessible. When the name resolves to
21183 set of overloaded functions, accessibility is checked when
21184 overload resolution is done.
21186 During an explicit instantiation, access is not checked at all,
21187 as per [temp.explicit]. */
21194 }
21196 /* Like cp_parser_lookup_name, but for use in the typical case where
21197 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
21198 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
21200 static tree
21202 {
21204 none_type,
21209 location);
21210 }
21212 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
21213 the current context, return the TYPE_DECL. If TAG_NAME_P is
21214 true, the DECL indicates the class being defined in a class-head,
21215 or declared in an elaborated-type-specifier.
21217 Otherwise, return DECL. */
21219 static tree
21221 {
21222 /* If the TEMPLATE_DECL is being declared as part of a class-head,
21223 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
21225 struct A {
21226 template <typename T> struct B;
21227 };
21229 template <typename T> struct A::B {};
21231 Similarly, in an elaborated-type-specifier:
21233 namespace N { struct X{}; }
21235 struct A {
21236 template <typename T> friend struct N::X;
21237 };
21239 However, if the DECL refers to a class type, and we are in
21240 the scope of the class, then the name lookup automatically
21241 finds the TYPE_DECL created by build_self_reference rather
21242 than a TEMPLATE_DECL. For example, in:
21244 template <class T> struct S {
21245 S s;
21246 };
21248 there is no need to handle such case. */
21254 }
21256 /* If too many, or too few, template-parameter lists apply to the
21257 declarator, issue an error message. Returns TRUE if all went well,
21258 and FALSE otherwise. */
21260 static bool
21263 location_t declarator_location)
21264 {
21266 {
21268 {
21276 /* If the DECLARATOR has the form `X<y>' then it uses one
21277 additional level of template parameters. */
21280 return cp_parser_check_template_parameters
21282 }
21297 }
21299 }
21301 /* NUM_TEMPLATES were used in the current declaration. If that is
21302 invalid, return FALSE and issue an error messages. Otherwise,
21303 return TRUE. If DECLARATOR is non-NULL, then we are checking a
21304 declarator and we can print more accurate diagnostics. */
21306 static bool
21309 location_t location,
21311 {
21312 /* If there are the same number of template classes and parameter
21313 lists, that's OK. */
21316 /* If there are more, but only one more, then we are referring to a
21317 member template. That's OK too. */
21320 /* If there are more template classes than parameter lists, we have
21321 something like:
21323 template <class T> void S<T>::R<T>::f (); */
21325 {
21335 else
21338 }
21339 /* Otherwise, there are too many template parameter lists. We have
21340 something like:
21342 template <class T> template <class U> void S::f(); */
21345 }
21347 /* Parse an optional `::' token indicating that the following name is
21348 from the global namespace. If so, PARSER->SCOPE is set to the
21349 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
21350 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
21351 Returns the new value of PARSER->SCOPE, if the `::' token is
21352 present, and NULL_TREE otherwise. */
21354 static tree
21356 {
21359 /* Peek at the next token. */
21361 /* If we're looking at a `::' token then we're starting from the
21362 global namespace, not our current location. */
21364 {
21365 /* Consume the `::' token. */
21367 /* Set the SCOPE so that we know where to start the lookup. */
21373 }
21375 {
21379 }
21382 }
21384 /* Returns TRUE if the upcoming token sequence is the start of a
21385 constructor declarator. If FRIEND_P is true, the declarator is
21386 preceded by the `friend' specifier. */
21388 static bool
21390 {
21392 tree nested_name_specifier;
21395 /* The common case is that this is not a constructor declarator, so
21396 try to avoid doing lots of work if at all possible. It's not
21397 valid declare a constructor at function scope. */
21400 /* And only certain tokens can begin a constructor declarator. */
21408 /* Parse tentatively; we are going to roll back all of the tokens
21409 consumed here. */
21411 /* Assume that we are looking at a constructor declarator. */
21414 /* Look for the optional `::' operator. */
21417 /* Look for the nested-name-specifier. */
21418 nested_name_specifier
21424 /* Outside of a class-specifier, there must be a
21425 nested-name-specifier. */
21433 /* If we have a class scope, this is easy; DR 147 says that S::S always
21434 names the constructor, and no other qualified name could. */
21437 {
21447 }
21448 /* If we still think that this might be a constructor-declarator,
21449 look for a class-name. */
21451 {
21452 /* If we have:
21454 template <typename T> struct S {
21455 S();
21456 };
21458 we must recognize that the nested `S' names a class. */
21459 tree type_decl;
21463 none_type,
21467 /* If there was no class-name, then this is not a constructor. */
21470 /* If we're still considering a constructor, we have to see a `(',
21471 to begin the parameter-declaration-clause, followed by either a
21472 `)', an `...', or a decl-specifier. We need to check for a
21473 type-specifier to avoid being fooled into thinking that:
21475 S (f) (int);
21477 is a constructor. (It is actually a function named `f' that
21478 takes one parameter (of type `int') and returns a value of type
21479 `S'. */
21487 /* A parameter declaration begins with a decl-specifier,
21488 which is either the "attribute" keyword, a storage class
21489 specifier, or (usually) a type-specifier. */
21491 {
21492 tree type;
21496 /* Names appearing in the type-specifier should be looked up
21497 in the scope of the class. */
21500 else
21501 {
21504 {
21508 {
21511 }
21512 }
21514 }
21516 /* Inside the constructor parameter list, surrounding
21517 template-parameter-lists do not apply. */
21518 saved_num_template_parameter_lists
21522 /* Look for the type-specifier. */
21524 CP_PARSER_FLAGS_NONE,
21530 parser->num_template_parameter_lists
21533 /* Leave the scope of the class. */
21538 }
21539 }
21541 /* We did not really want to consume any tokens. */
21545 }
21547 /* Parse the definition of the function given by the DECL_SPECIFIERS,
21548 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
21549 they must be performed once we are in the scope of the function.
21551 Returns the function defined. */
21553 static tree
21554 cp_parser_function_definition_from_specifiers_and_declarator
21557 tree attributes,
21559 {
21560 tree fn;
21563 /* Begin the function-definition. */
21566 /* The things we're about to see are not directly qualified by any
21567 template headers we've seen thus far. */
21570 /* If there were names looked up in the decl-specifier-seq that we
21571 did not check, check them now. We must wait until we are in the
21572 scope of the function to perform the checks, since the function
21573 might be a friend. */
21577 {
21578 /* Skip the entire function. */
21581 }
21583 {
21584 /* Seen already, skip it. An error message has already been output. */
21588 /* If this is a function from a class, pop the nested class. */
21591 }
21592 else
21593 {
21594 timevar_id_t tv;
21597 else
21603 }
21606 }
21608 /* Parse the part of a function-definition that follows the
21609 declarator. INLINE_P is TRUE iff this function is an inline
21610 function defined within a class-specifier.
21612 Returns the function defined. */
21614 static tree
21617 {
21618 tree fn;
21627 /* If the next token is `return', then the code may be trying to
21628 make use of the "named return value" extension that G++ used to
21629 support. */
21632 {
21633 /* Consume the `return' keyword. */
21635 /* Look for the identifier that indicates what value is to be
21636 returned. */
21638 /* Issue an error message. */
21641 /* Skip tokens until we reach the start of the function body. */
21643 {
21650 }
21651 }
21652 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21653 anything declared inside `f'. */
21654 saved_in_unbraced_linkage_specification_p
21657 /* Inside the function, surrounding template-parameter-lists do not
21658 apply. */
21659 saved_num_template_parameter_lists
21665 /* If the next token is `try', `__transaction_atomic', or
21666 `__transaction_relaxed`, then we are looking at either function-try-block
21667 or function-transaction-block. Note that all of these include the
21668 function-body. */
21671 RID_TRANSACTION_ATOMIC);
21673 RID_TRANSACTION_RELAXED))
21675 RID_TRANSACTION_RELAXED);
21678 else
21679 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21684 /* Finish the function. */
21687 /* Generate code for it, if necessary. */
21689 /* Restore the saved values. */
21690 parser->in_unbraced_linkage_specification_p
21692 parser->num_template_parameter_lists
21697 }
21699 /* Parse a template-declaration, assuming that the `export' (and
21700 `extern') keywords, if present, has already been scanned. MEMBER_P
21701 is as for cp_parser_template_declaration. */
21703 static void
21705 {
21708 tree parameter_list;
21713 /* Look for the `template' keyword. */
21718 /* And the `<'. */
21722 {
21723 /* 14.5.2.2 [temp.mem]
21725 A local class shall not have member templates. */
21730 }
21731 /* [temp]
21733 A template ... shall not have C linkage. */
21735 {
21737 /* Give it C++ linkage to avoid confusing other parts of the
21738 front end. */
21741 }
21742 else
21745 /* We cannot perform access checks on the template parameter
21746 declarations until we know what is being declared, just as we
21747 cannot check the decl-specifier list. */
21750 /* If the next token is `>', then we have an invalid
21751 specialization. Rather than complain about an invalid template
21752 parameter, issue an error message here. */
21754 {
21758 }
21759 else
21760 {
21761 /* Parse the template parameters. */
21763 }
21765 /* Get the deferred access checks from the parameter list. These
21766 will be checked once we know what is being declared, as for a
21767 member template the checks must be performed in the scope of the
21768 class containing the member. */
21771 /* Look for the `>'. */
21773 /* We just processed one more parameter list. */
21775 /* If the next token is `template', there are more template
21776 parameters. */
21778 RID_TEMPLATE))
21783 else
21784 {
21785 /* There are no access checks when parsing a template, as we do not
21786 know if a specialization will be a friend. */
21790 checks,
21791 member_p,
21796 /* If this is a member template declaration, let the front
21797 end know. */
21799 {
21804 }
21810 }
21811 /* We are done with the current parameter list. */
21816 /* Finish up. */
21819 /* Check the template arguments for a literal operator template. */
21823 {
21827 else
21828 {
21832 else
21833 {
21839 }
21840 }
21844 decl);
21845 }
21846 /* Register member declarations. */
21849 /* For the erroneous case of a template with C linkage, we pushed an
21850 implicit C++ linkage scope; exit that scope now. */
21853 /* If DECL is a function template, we must return to parse it later.
21854 (Even though there is no definition, there might be default
21855 arguments that need handling.) */
21860 }
21862 /* Perform the deferred access checks from a template-parameter-list.
21863 CHECKS is a TREE_LIST of access checks, as returned by
21864 get_deferred_access_checks. */
21866 static void
21867 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
21868 {
21872 }
21874 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21875 `function-definition' sequence that follows a template header.
21876 If MEMBER_P is true, this declaration appears in a class scope.
21878 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21879 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21881 static tree
21887 {
21890 cp_decl_specifier_seq decl_specifiers;
21894 /* This function is only used when processing a template
21895 declaration. */
21899 /* Defer access checks until we know what is being declared. */
21902 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21903 alternative. */
21906 CP_PARSER_FLAGS_OPTIONAL,
21912 /* There are no template typedefs. */
21914 {
21918 }
21920 /* Gather up the access checks that occurred the
21921 decl-specifier-seq. */
21924 /* Check for the declaration of a template class. */
21926 {
21928 {
21931 /* In this case:
21933 struct C {
21934 friend template <typename T> struct A<T>::B;
21935 };
21937 A<T>::B will be represented by a TYPENAME_TYPE, and
21938 therefore not recognized by shadow_tag. */
21940 && !decl
21947 else
21950 /* Perform access checks for template parameters. */
21952 }
21953 }
21955 /* Complain about missing 'typename' or other invalid type names. */
21958 {
21959 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21960 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21961 the rest of this declaration. */
21964 }
21966 /* If it's not a template class, try for a template function. If
21967 the next token is a `;', then this declaration does not declare
21968 anything. But, if there were errors in the decl-specifiers, then
21969 the error might well have come from an attempted class-specifier.
21970 In that case, there's no need to warn about a missing declarator. */
21974 {
21977 checks,
21979 member_p,
21980 declares_class_or_enum,
21982 NULL);
21984 /* 7.1.1-1 [dcl.stc]
21986 A storage-class-specifier shall not be specified in an explicit
21987 specialization... */
21989 && explicit_specialization_p
21991 {
21995 }
21999 }
22001 /* Look for a trailing `;' after the declaration. */
22007 out:
22010 /* Clear any current qualification; whatever comes next is the start
22011 of something new. */
22017 }
22019 /* Parse a cast-expression that is not the operand of a unary "&". */
22021 static tree
22023 {
22026 }
22028 /* Parse a functional cast to TYPE. Returns an expression
22029 representing the cast. */
22031 static tree
22033 {
22035 tree expression_list;
22036 tree cast;
22040 {
22047 tf_warning_or_error);
22048 }
22057 else
22058 {
22061 }
22064 tf_warning_or_error);
22065 /* [expr.const]/1: In an integral constant expression "only type
22066 conversions to integral or enumeration type can be used". */
22072 NIC_CONSTRUCTOR))
22075 }
22077 /* Save the tokens that make up the body of a member function defined
22078 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22079 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22080 specifiers applied to the declaration. Returns the FUNCTION_DECL
22081 for the member function. */
22083 static tree
22087 tree attributes)
22088 {
22091 tree fn;
22093 /* Create the FUNCTION_DECL. */
22095 /* If something went badly wrong, bail out now. */
22097 {
22098 /* If there's a function-body, skip it. */
22103 }
22105 /* Remember it, if there default args to post process. */
22108 /* Save away the tokens that make up the body of the
22109 function. */
22111 /* We can have braced-init-list mem-initializers before the fn body. */
22113 {
22117 {
22118 /* cache_group will stop after an un-nested { } pair, too. */
22122 /* variadic mem-inits have ... after the ')'. */
22125 }
22126 }
22128 /* Handle function try blocks. */
22133 /* Save away the inline definition; we will process it when the
22134 class is complete. */
22138 /* We need to know that this was defined in the class, so that
22139 friend templates are handled correctly. */
22142 /* Add FN to the queue of functions to be parsed later. */
22146 }
22148 /* Save the tokens that make up the in-class initializer for a non-static
22149 data member. Returns a DEFAULT_ARG. */
22151 static tree
22153 {
22155 }
22157 /* Parse a template-argument-list, as well as the trailing ">" (but
22158 not the opening "<"). See cp_parser_template_argument_list for the
22159 return value. */
22161 static tree
22163 {
22164 tree arguments;
22165 tree saved_scope;
22166 tree saved_qualifying_scope;
22167 tree saved_object_scope;
22172 /* [temp.names]
22174 When parsing a template-id, the first non-nested `>' is taken as
22175 the end of the template-argument-list rather than a greater-than
22176 operator. */
22177 saved_greater_than_is_operator_p
22180 /* Parsing the argument list may modify SCOPE, so we save it
22181 here. */
22185 /* We need to evaluate the template arguments, even though this
22186 template-id may be nested within a "sizeof". */
22191 /* Parse the template-argument-list itself. */
22195 else
22197 /* Look for the `>' that ends the template-argument-list. If we find
22198 a '>>' instead, it's probably just a typo. */
22200 {
22202 {
22203 /* In C++0x, a `>>' in a template argument list or cast
22204 expression is considered to be two separate `>'
22205 tokens. So, change the current token to a `>', but don't
22206 consume it: it will be consumed later when the outer
22207 template argument list (or cast expression) is parsed.
22208 Note that this replacement of `>' for `>>' is necessary
22209 even if we are parsing tentatively: in the tentative
22210 case, after calling
22211 cp_parser_enclosed_template_argument_list we will always
22212 throw away all of the template arguments and the first
22213 closing `>', either because the template argument list
22214 was erroneous or because we are replacing those tokens
22215 with a CPP_TEMPLATE_ID token. The second `>' (which will
22216 not have been thrown away) is needed either to close an
22217 outer template argument list or to complete a new-style
22218 cast. */
22221 }
22223 {
22224 /* If we're in a nested template argument list, the '>>' has
22225 to be a typo for '> >'. We emit the error message, but we
22226 continue parsing and we push a '>' as next token, so that
22227 the argument list will be parsed correctly. Note that the
22228 global source location is still on the token before the
22229 '>>', so we need to say explicitly where we want it. */
22235 }
22236 else
22237 {
22238 /* If this is not a nested template argument list, the '>>'
22239 is a typo for '>'. Emit an error message and continue.
22240 Same deal about the token location, but here we can get it
22241 right by consuming the '>>' before issuing the diagnostic. */
22244 "spurious %<>>%>, use %<>%> to terminate "
22246 }
22247 }
22248 else
22250 /* The `>' token might be a greater-than operator again now. */
22251 parser->greater_than_is_operator_p
22253 /* Restore the SAVED_SCOPE. */
22261 }
22263 /* MEMBER_FUNCTION is a member function, or a friend. If default
22264 arguments, or the body of the function have not yet been parsed,
22265 parse them now. */
22267 static void
22269 {
22271 /* If this member is a template, get the underlying
22272 FUNCTION_DECL. */
22276 /* There should not be any class definitions in progress at this
22277 point; the bodies of members are only parsed outside of all class
22278 definitions. */
22280 /* While we're parsing the member functions we might encounter more
22281 classes. We want to handle them right away, but we don't want
22282 them getting mixed up with functions that are currently in the
22283 queue. */
22286 /* Make sure that any template parameters are in scope. */
22289 /* If the body of the function has not yet been parsed, parse it
22290 now. */
22292 {
22293 tree function_scope;
22296 /* The function is no longer pending; we are processing it. */
22301 /* If this is a local class, enter the scope of the containing
22302 function. */
22307 /* Push the body of the function onto the lexer stack. */
22310 /* Let the front end know that we going to be defining this
22311 function. */
22315 /* Don't do access checking if it is a templated function. */
22319 /* Now, parse the body of the function. */
22326 /* Leave the scope of the containing function. */
22330 }
22332 /* Remove any template parameters from the symbol table. */
22335 /* Restore the queue. */
22338 }
22340 /* If DECL contains any default args, remember it on the unparsed
22341 functions queue. */
22343 static void
22345 {
22346 tree probe;
22349 probe;
22352 {
22356 }
22357 }
22359 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
22360 which is either a FIELD_DECL or PARM_DECL. Parse it and return
22361 the result. For a PARM_DECL, PARMTYPE is the corresponding type
22362 from the parameter-type-list. */
22364 static tree
22367 {
22369 tree parsed_arg;
22375 /* Push the saved tokens for the default argument onto the parser's
22376 lexer stack. */
22382 /* Parse the default argument. */
22393 {
22394 /* In a non-template class, check conversions now. In a template,
22395 we'll wait and instantiate these as needed. */
22398 else
22399 {
22405 }
22406 }
22408 /* If the token stream has not been completely used up, then
22409 there was extra junk after the end of the default
22410 argument. */
22412 {
22415 else
22417 }
22419 /* Revert to the main lexer. */
22423 }
22425 /* FIELD is a non-static data member with an initializer which we saved for
22426 later; parse it now. */
22428 static void
22430 {
22431 tree def;
22436 NULL_TREE);
22440 }
22442 /* FN is a FUNCTION_DECL which may contains a parameter with an
22443 unparsed DEFAULT_ARG. Parse the default args now. This function
22444 assumes that the current scope is the scope in which the default
22445 argument should be processed. */
22447 static void
22449 {
22453 /* While we're parsing the default args, we might (due to the
22454 statement expression extension) encounter more classes. We want
22455 to handle them right away, but we don't want them getting mixed
22456 up with default args that are currently in the queue. */
22459 /* Local variable names (and the `this' keyword) may not appear
22460 in a default argument. */
22471 {
22473 tree parsed_arg;
22475 tree copy;
22482 /* This can happen for a friend declaration for a function
22483 already declared with default arguments. */
22486 parsed_arg
22488 default_arg,
22491 {
22493 }
22497 /* Update any instantiations we've already created. */
22501 }
22505 /* Make sure no default arg is missing. */
22508 /* Restore the state of local_variables_forbidden_p. */
22511 /* Restore the queue. */
22513 }
22515 /* Parse the operand of `sizeof' (or a similar operator). Returns
22516 either a TYPE or an expression, depending on the form of the
22517 input. The KEYWORD indicates which kind of expression we have
22518 encountered. */
22520 static tree
22522 {
22530 /* Types cannot be defined in a `sizeof' expression. Save away the
22531 old message. */
22533 /* And create the new one. */
22539 /* The restrictions on constant-expressions do not apply inside
22540 sizeof expressions. */
22541 saved_integral_constant_expression_p
22543 saved_non_integral_constant_expression_p
22547 /* If it's a `...', then we are computing the length of a parameter
22548 pack. */
22551 {
22552 /* Consume the `...'. */
22556 /* Note that this is an expansion. */
22558 }
22560 /* Do not actually evaluate the expression. */
22563 /* If it's a `(', then we might be looking at the type-id
22564 construction. */
22566 {
22567 tree type;
22570 /* We can't be sure yet whether we're looking at a type-id or an
22571 expression. */
22573 /* Consume the `('. */
22575 /* Parse the type-id. */
22580 /* Now, look for the trailing `)'. */
22582 /* If all went well, then we're done. */
22584 {
22585 cp_decl_specifier_seq decl_specs;
22587 /* Build a trivial decl-specifier-seq. */
22591 /* Call grokdeclarator to figure out what type this is. */
22594 TYPENAME,
22597 }
22598 }
22603 /* If the type-id production did not work out, then we must be
22604 looking at the unary-expression production. */
22610 /* Build a pack expansion. */
22613 /* Go back to evaluating expressions. */
22617 /* Free the message we created. */
22619 /* And restore the old one. */
22621 parser->integral_constant_expression_p
22623 parser->non_integral_constant_expression_p
22627 }
22629 /* If the current declaration has no declarator, return true. */
22631 static bool
22633 {
22634 /* If the next token is a `;' or a `,' then there is no
22635 declarator. */
22638 }
22640 /* Update the DECL_SPECS to reflect the storage class indicated by
22641 KEYWORD. */
22643 static void
22648 {
22649 cp_storage_class storage_class;
22652 {
22656 }
22658 {
22661 }
22666 {
22669 }
22672 {
22690 }
22694 /* A storage class specifier cannot be applied alongside a typedef
22695 specifier. If there is a typedef specifier present then set
22696 conflicting_specifiers_p which will trigger an error later
22697 on in grokdeclarator. */
22700 }
22702 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22703 is true, the type is a class or enum definition. */
22705 static void
22707 tree type_spec,
22710 {
22713 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22714 (with, for example, in "typedef int wchar_t;") we remember that
22715 this is what happened. In system headers, we ignore these
22716 declarations so that G++ can work with system headers that are not
22717 C++-safe. */
22719 && !type_definition_p
22729 {
22732 ds_redefined_builtin_type_spec,
22733 token);
22735 {
22739 }
22740 }
22743 else
22744 {
22749 }
22750 }
22752 /* True iff TOKEN is the GNU keyword __thread. */
22754 static bool
22756 {
22759 }
22761 /* Set the location for a declarator specifier and check if it is
22762 duplicated.
22764 DECL_SPECS is the sequence of declarator specifiers onto which to
22765 set the location.
22767 DS is the single declarator specifier to set which location is to
22768 be set onto the existing sequence of declarators.
22770 LOCATION is the location for the declarator specifier to
22771 consider. */
22773 static void
22776 {
22785 {
22789 }
22790 else
22791 {
22793 {
22797 else
22798 {
22801 OPT_Wlong_long,
22803 }
22804 }
22806 {
22811 else
22813 }
22814 else
22815 {
22831 "__complex"
22832 };
22835 }
22836 }
22837 }
22839 /* Return true iff the declarator specifier DS is present in the
22840 sequence of declarator specifiers DECL_SPECS. */
22842 bool
22844 cp_decl_spec ds)
22845 {
22852 }
22854 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22855 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22857 static bool
22859 {
22861 }
22863 /* Issue an error message indicating that TOKEN_DESC was expected.
22864 If KEYWORD is true, it indicated this function is called by
22865 cp_parser_require_keword and the required token can only be
22866 a indicated keyword. */
22868 static void
22870 required_token token_desc,
22872 {
22874 {
22943 }
22945 {
22947 {
23026 }
23027 }
23028 else
23030 }
23034 /* If the next token is of the indicated TYPE, consume it. Otherwise,
23035 issue an error message indicating that TOKEN_DESC was expected.
23037 Returns the token consumed, if the token had the appropriate type.
23038 Otherwise, returns NULL. */
23043 required_token token_desc)
23044 {
23047 else
23048 {
23049 /* Output the MESSAGE -- unless we're parsing tentatively. */
23053 }
23054 }
23056 /* An error message is produced if the next token is not '>'.
23057 All further tokens are skipped until the desired token is
23058 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23060 static void
23062 {
23063 /* Current level of '< ... >'. */
23065 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23068 /* Are we ready, yet? If not, issue error message. */
23072 /* Skip tokens until the desired token is found. */
23074 {
23075 /* Peek at the next token. */
23077 {
23085 /* C++0x views the `>>' operator as two `>' tokens, but
23086 C++98 does not. */
23089 {
23090 /* We've hit a `>>' where the first `>' closes the
23091 template argument list, and the second `>' is
23092 spurious. Just consume the `>>' and stop; we've
23093 already produced at least one error. */
23096 }
23097 /* Fall through for C++0x, so we handle the second `>' in
23098 the `>>'. */
23102 {
23103 /* We've reached the token we want, consume it and stop. */
23106 }
23125 /* The '>' was probably forgotten, don't look further. */
23130 }
23132 /* Consume this token. */
23134 }
23135 }
23137 /* If the next token is the indicated keyword, consume it. Otherwise,
23138 issue an error message indicating that TOKEN_DESC was expected.
23140 Returns the token consumed, if the token had the appropriate type.
23141 Otherwise, returns NULL. */
23146 required_token token_desc)
23147 {
23151 {
23154 }
23157 }
23159 /* Returns TRUE iff TOKEN is a token that can begin the body of a
23160 function-definition. */
23162 static bool
23164 {
23167 /* A ctor-initializer begins with a `:'. */
23169 /* A function-try-block begins with `try'. */
23171 /* A function-transaction-block begins with `__transaction_atomic'
23172 or `__transaction_relaxed'. */
23175 /* The named return value extension begins with `return'. */
23177 }
23179 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
23180 definition. */
23182 static bool
23184 {
23189 }
23191 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
23192 C++0x) ending a template-argument. */
23194 static bool
23196 {
23204 }
23206 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
23207 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
23209 static bool
23212 {
23218 /* Check for the sequence `<::' in the original code. It would be lexed as
23219 `[:', where `[' is a digraph, and there is no whitespace before
23220 `:'. */
23222 {
23227 }
23229 }
23231 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
23232 or none_type otherwise. */
23234 static enum tag_types
23236 {
23238 {
23248 }
23249 }
23251 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
23253 static void
23255 {
23259 {
23263 type);
23266 }
23267 }
23269 /* Issue an error message if DECL is redeclared with different
23270 access than its original declaration [class.access.spec/3].
23271 This applies to nested classes and nested class templates.
23272 [class.mem/1]. */
23274 static void
23276 {
23285 }
23287 /* Look for the `template' keyword, as a syntactic disambiguator.
23288 Return TRUE iff it is present, in which case it will be
23289 consumed. */
23291 static bool
23293 {
23295 {
23296 /* In C++98 the `template' keyword can only be used within templates;
23297 outside templates the parser can always figure out what is a
23298 template and what is not. In C++11, per the resolution of DR 468,
23299 `template' is allowed in cases where it is not strictly necessary. */
23302 {
23305 "in C++98 %<template%> (as a disambiguator) is only "
23307 /* If this part of the token stream is rescanned, the same
23308 error message would be generated. So, we purge the token
23309 from the stream. */
23312 }
23313 else
23314 {
23315 /* Consume the `template' keyword. */
23318 }
23319 }
23321 }
23323 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
23324 set PARSER->SCOPE, and perform other related actions. */
23326 static void
23328 {
23334 /* Get the stored value. */
23336 /* Perform any access checks that were deferred. */
23339 {
23344 }
23345 /* Set the scope from the stored value. */
23349 }
23351 /* Consume tokens up through a non-nested END token. Returns TRUE if we
23352 encounter the end of a block before what we were looking for. */
23354 static bool
23358 {
23360 {
23363 /* Abort a parenthesized expression if we encounter a semicolon. */
23367 /* If we've reached the end of the file, stop. */
23373 /* We've hit the end of an enclosing block, so there's been some
23374 kind of syntax error. */
23377 /* Consume the token. */
23379 /* See if it starts a new group. */
23381 {
23383 /* In theory this should probably check end == '}', but
23384 cp_parser_save_member_function_body needs it to exit
23385 after either '}' or ')' when called with ')'. */
23388 }
23390 {
23394 }
23399 }
23400 }
23402 /* Like above, for caching a default argument or NSDMI. Both of these are
23403 terminated by a non-nested comma, but it can be unclear whether or not a
23404 comma is nested in a template argument list unless we do more parsing.
23405 In order to handle this ambiguity, when we encounter a ',' after a '<'
23406 we try to parse what follows as a parameter-declaration-list (in the
23407 case of a default argument) or a member-declarator (in the case of an
23408 NSDMI). If that succeeds, then we stop caching. */
23410 static tree
23412 {
23417 tree default_argument;
23419 /* Add tokens until we have processed the entire default
23420 argument. We add the range [first_token, token). */
23423 {
23424 /* For list-initialization, this is straightforward. */
23427 }
23429 {
23432 /* Peek at the next token. */
23434 /* What we do depends on what token we have. */
23436 {
23437 /* In valid code, a default argument must be
23438 immediately followed by a `,' `)', or `...'. */
23441 {
23442 /* If we've seen a '<', we might be in a
23443 template-argument-list. Until Core issue 325 is
23444 resolved, we don't know how this situation ought
23445 to be handled, so try to DTRT. We check whether
23446 what comes after the comma is a valid parameter
23447 declaration list. If it is, then the comma ends
23448 the default argument; otherwise the default
23449 argument continues. */
23451 tree t;
23453 /* Set ITALP so cp_parser_parameter_declaration_list
23454 doesn't decide to commit to this parse. */
23462 {
23468 }
23469 else
23470 {
23476 }
23483 }
23486 /* If we run into a non-nested `;', `}', or `]',
23487 then the code is invalid -- but the default
23488 argument is certainly over. */
23494 /* Update DEPTH, if necessary. */
23509 /* This might be the comparison operator, or it might
23510 start a template argument list. */
23517 /* Fall through for C++0x, which treats the `>>'
23518 operator like two `>' tokens in certain
23519 cases. */
23523 {
23524 /* This might be an operator, or it might close a
23525 template argument list. But if a previous '<'
23526 started a template argument list, this will have
23527 closed it, so we can't be in one anymore. */
23531 }
23534 /* If we run out of tokens, issue an error message. */
23543 /* In these cases, we should look for template-ids.
23544 For example, if the default argument is
23545 `X<int, double>()', we need to do name lookup to
23546 figure out whether or not `X' is a template; if
23547 so, the `,' does not end the default argument.
23549 That is not yet done. */
23554 }
23556 /* If we've reached the end, stop. */
23560 /* Add the token to the token block. */
23562 }
23564 /* Create a DEFAULT_ARG to represent the unparsed default
23565 argument. */
23572 }
23574 /* Begin parsing tentatively. We always save tokens while parsing
23575 tentatively so that if the tentative parsing fails we can restore the
23576 tokens. */
23578 static void
23580 {
23581 /* Enter a new parsing context. */
23583 /* Begin saving tokens. */
23585 /* In order to avoid repetitive access control error messages,
23586 access checks are queued up until we are no longer parsing
23587 tentatively. */
23589 }
23591 /* Commit to the currently active tentative parse. */
23593 static void
23595 {
23599 /* Mark all of the levels as committed. */
23602 {
23609 }
23610 }
23612 /* Abort the currently active tentative parse. All consumed tokens
23613 will be rolled back, and no diagnostics will be issued. */
23615 static void
23617 {
23621 /* Now, pretend that we want to see if the construct was
23622 successfully parsed. */
23624 }
23626 /* Stop parsing tentatively. If a parse error has occurred, restore the
23627 token stream. Otherwise, commit to the tokens we have consumed.
23628 Returns true if no error occurred; false otherwise. */
23630 static bool
23632 {
23636 /* Remember whether or not an error occurred, since we are about to
23637 destroy that information. */
23639 /* Remove the topmost context from the stack. */
23642 /* If no parse errors occurred, commit to the tentative parse. */
23644 {
23645 /* Commit to the tokens read tentatively, unless that was
23646 already done. */
23651 }
23652 /* Otherwise, if errors occurred, roll back our state so that things
23653 are just as they were before we began the tentative parse. */
23654 else
23655 {
23658 }
23659 /* Add the context to the front of the free list. */
23664 }
23666 /* Returns true if we are parsing tentatively and are not committed to
23667 this tentative parse. */
23669 static bool
23671 {
23674 }
23676 /* Returns nonzero iff an error has occurred during the most recent
23677 tentative parse. */
23679 static bool
23681 {
23684 }
23686 /* Returns nonzero if GNU extensions are allowed. */
23688 static bool
23690 {
23692 }
23693 \f
23694 /* Objective-C++ Productions */
23697 /* Parse an Objective-C expression, which feeds into a primary-expression
23698 above.
23700 objc-expression:
23701 objc-message-expression
23702 objc-string-literal
23703 objc-encode-expression
23704 objc-protocol-expression
23705 objc-selector-expression
23707 Returns a tree representation of the expression. */
23709 static tree
23711 {
23712 /* Try to figure out what kind of declaration is present. */
23716 {
23726 {
23738 }
23744 }
23747 }
23749 /* Parse an Objective-C message expression.
23751 objc-message-expression:
23752 [ objc-message-receiver objc-message-args ]
23754 Returns a representation of an Objective-C message. */
23756 static tree
23758 {
23767 }
23769 /* Parse an objc-message-receiver.
23771 objc-message-receiver:
23772 expression
23773 simple-type-specifier
23775 Returns a representation of the type or expression. */
23777 static tree
23779 {
23780 tree rcv;
23782 /* An Objective-C message receiver may be either (1) a type
23783 or (2) an expression. */
23792 CP_PARSER_FLAGS_NONE);
23795 }
23797 /* Parse the arguments and selectors comprising an Objective-C message.
23799 objc-message-args:
23800 objc-selector
23801 objc-selector-args
23802 objc-selector-args , objc-comma-args
23804 objc-selector-args:
23805 objc-selector [opt] : assignment-expression
23806 objc-selector-args objc-selector [opt] : assignment-expression
23808 objc-comma-args:
23809 assignment-expression
23810 objc-comma-args , assignment-expression
23812 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23813 selector arguments and TREE_VALUE containing a list of comma
23814 arguments. */
23816 static tree
23818 {
23824 {
23830 /* Detect if we have a unary selector. */
23839 sel_args
23844 }
23846 /* Handle non-selector arguments, if any. */
23848 {
23849 tree arg;
23854 addl_args
23859 }
23862 {
23865 }
23868 }
23870 /* Parse an Objective-C encode expression.
23872 objc-encode-expression:
23873 @encode objc-typename
23875 Returns an encoded representation of the type argument. */
23877 static tree
23879 {
23880 tree type;
23890 {
23894 }
23896 /* This happens if we find @encode(T) (where T is a template
23897 typename or something dependent on a template typename) when
23898 parsing a template. In that case, we can't compile it
23899 immediately, but we rather create an AT_ENCODE_EXPR which will
23900 need to be instantiated when the template is used.
23901 */
23903 {
23907 }
23910 }
23912 /* Parse an Objective-C @defs expression. */
23914 static tree
23916 {
23917 tree name;
23925 }
23927 /* Parse an Objective-C protocol expression.
23929 objc-protocol-expression:
23930 @protocol ( identifier )
23932 Returns a representation of the protocol expression. */
23934 static tree
23936 {
23937 tree proto;
23945 }
23947 /* Parse an Objective-C selector expression.
23949 objc-selector-expression:
23950 @selector ( objc-method-signature )
23952 objc-method-signature:
23953 objc-selector
23954 objc-selector-seq
23956 objc-selector-seq:
23957 objc-selector :
23958 objc-selector-seq objc-selector :
23960 Returns a representation of the method selector. */
23962 static tree
23964 {
23976 {
23985 {
23986 /* Detect if we have a unary selector. */
23988 {
23991 }
23992 else
23993 {
23995 }
23996 }
24001 {
24002 sel_seq
24005 sel_seq
24008 }
24009 else
24010 sel_seq
24015 }
24017 finish_selector:
24021 }
24023 /* Parse a list of identifiers.
24025 objc-identifier-list:
24026 identifier
24027 objc-identifier-list , identifier
24029 Returns a TREE_LIST of identifier nodes. */
24031 static tree
24033 {
24034 tree identifier;
24035 tree list;
24046 {
24053 identifier));
24055 }
24058 }
24060 /* Parse an Objective-C alias declaration.
24062 objc-alias-declaration:
24063 @compatibility_alias identifier identifier ;
24065 This function registers the alias mapping with the Objective-C front end.
24066 It returns nothing. */
24068 static void
24070 {
24078 }
24080 /* Parse an Objective-C class forward-declaration.
24082 objc-class-declaration:
24083 @class objc-identifier-list ;
24085 The function registers the forward declarations with the Objective-C
24086 front end. It returns nothing. */
24088 static void
24090 {
24093 {
24094 tree id;
24104 else
24106 }
24108 }
24110 /* Parse a list of Objective-C protocol references.
24112 objc-protocol-refs-opt:
24113 objc-protocol-refs [opt]
24115 objc-protocol-refs:
24116 < objc-identifier-list >
24118 Returns a TREE_LIST of identifiers, if any. */
24120 static tree
24122 {
24126 {
24130 }
24133 }
24135 /* Parse a Objective-C visibility specification. */
24137 static void
24139 {
24143 {
24158 }
24160 /* Eat '@private'/'@protected'/'@public'. */
24162 }
24164 /* Parse an Objective-C method type. Return 'true' if it is a class
24165 (+) method, and 'false' if it is an instance (-) method. */
24169 {
24172 else
24174 }
24176 /* Parse an Objective-C protocol qualifier. */
24178 static tree
24180 {
24193 {
24198 }
24201 }
24203 /* Parse an Objective-C typename. */
24205 static tree
24207 {
24211 {
24217 /* An ObjC type name may consist of just protocol qualifiers, in which
24218 case the type shall default to 'id'. */
24220 {
24223 /* If the type could not be parsed, an error has already
24224 been produced. For error recovery, behave as if it had
24225 not been specified, which will use the default type
24226 'id'. */
24228 {
24230 /* We need to skip to the closing parenthesis as
24231 cp_parser_type_id() does not seem to do it for
24232 us. */
24237 }
24238 }
24242 }
24245 }
24247 /* Check to see if TYPE refers to an Objective-C selector name. */
24249 static bool
24251 {
24257 }
24259 /* Parse an Objective-C selector. */
24261 static tree
24263 {
24267 {
24270 }
24272 /* C++ operator names are allowed to appear in ObjC selectors. */
24274 {
24287 }
24288 }
24290 /* Parse an Objective-C params list. */
24292 static tree
24294 {
24300 {
24310 /* Detect if we have a unary selector. */
24313 {
24316 }
24320 {
24321 /* Something went quite wrong. There should be a colon
24322 here, but there is not. Stop parsing parameters. */
24324 }
24326 /* New ObjC allows attributes on parameters too. */
24331 params
24334 type_name,
24335 identifier,
24336 parm_attr));
24339 }
24342 {
24345 }
24347 /* We allow tail attributes for the method. */
24349 {
24357 }
24360 {
24363 }
24365 }
24367 /* Parse the non-keyword Objective-C params. */
24369 static tree
24372 {
24378 {
24380 tree parm;
24386 {
24391 }
24393 /* TODO: parse attributes for tail parameters. */
24402 }
24404 /* We allow tail attributes for the method. */
24406 {
24408 {
24413 }
24414 else
24415 /* We have an error, but parse the attributes, so that we can
24416 carry on. */
24422 }
24425 }
24427 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
24429 static void
24431 {
24434 /* If the next token is `extern' and the following token is a string
24435 literal, then we have a linkage specification. */
24437 && cp_parser_is_pure_string_literal
24440 /* Handle #pragma, if any. */
24443 /* Allow stray semicolons. */
24446 /* Mark methods as optional or required, when building protocols. */
24448 {
24451 }
24453 {
24456 }
24459 /* Other stray characters must generate errors. */
24461 {
24465 }
24466 /* Finally, try to parse a block-declaration, or a function-definition. */
24467 else
24469 }
24471 /* Parse a method signature. */
24473 static tree
24475 {
24491 }
24493 static bool
24495 {
24496 tree tattr;
24501 /* If the attributes are followed by a method introducer, this is not allowed.
24502 Dump the attributes and flag the situation. */
24507 /* Otherwise, the attributes introduce some interstitial code, possibly so
24508 rewind to allow that check. */
24511 }
24513 /* Parse an Objective-C method prototype list. */
24515 static void
24517 {
24521 {
24523 {
24528 else
24532 {
24536 }
24539 }
24545 OPT_Wattributes,
24547 else
24548 /* Allow for interspersed non-ObjC++ code. */
24552 }
24556 else
24560 }
24562 /* Parse an Objective-C method definition list. */
24564 static void
24566 {
24570 {
24571 tree meth;
24574 {
24580 else
24585 {
24589 }
24591 NULL_TREE);
24593 /* For historical reasons, we accept an optional semicolon. */
24600 {
24607 }
24608 }
24609 /* The following case will be removed once @synthesize is
24610 completely implemented. */
24621 else
24622 /* Allow for interspersed non-ObjC++ code. */
24626 }
24630 else
24634 }
24636 /* Parse Objective-C ivars. */
24638 static void
24640 {
24651 {
24652 cp_decl_specifier_seq declspecs;
24654 tree prefix_attributes;
24662 CP_PARSER_FLAGS_OPTIONAL,
24666 /* auto, register, static, extern, mutable. */
24668 {
24671 }
24673 /* thread_local. */
24675 {
24678 }
24680 /* typedef. */
24682 {
24685 }
24690 /* Keep going until we hit the `;' at the end of the
24691 declaration. */
24693 {
24698 /* Check for a (possibly unnamed) bitfield declaration. */
24706 {
24707 /* Get the name of the bitfield. */
24710 sfk_none);
24712 eat_colon:
24714 /* Get the width of the bitfield. */
24715 width
24718 NULL);
24719 }
24720 else
24721 {
24722 /* Parse the declarator. */
24723 declarator
24728 }
24730 /* Look for attributes that apply to the ivar. */
24732 /* Remember which attributes are prefix attributes and
24733 which are not. */
24735 /* Combine the attributes. */
24739 /* Create the bitfield declaration. */
24741 width,
24742 attributes);
24743 else
24748 /* Add the instance variable. */
24752 /* Reset PREFIX_ATTRIBUTES. */
24761 {
24764 }
24766 }
24770 }
24775 /* Do not consume the RID_AT_END, so it will be read again as terminating
24776 the @interface of @implementation. */
24780 /* For historical reasons, we accept an optional semicolon. */
24783 }
24785 /* Parse an Objective-C protocol declaration. */
24787 static void
24789 {
24795 {
24800 }
24802 /* See if we have a forward declaration or a definition. */
24805 /* Try a forward declaration first. */
24807 {
24809 {
24810 tree id;
24820 else
24822 }
24824 }
24826 /* Ok, we got a full-fledged definition (or at least should). */
24827 else
24828 {
24833 }
24834 }
24836 /* Parse an Objective-C superclass or category. */
24838 static void
24843 {
24849 {
24852 }
24854 {
24857 /* If there is no category name, and this is an @interface, we
24858 have a class extension. */
24860 {
24863 }
24864 else
24868 }
24869 }
24871 /* Parse an Objective-C class interface. */
24873 static void
24875 {
24882 {
24883 /* It's hard to recover because even if valid @interface stuff
24884 is to follow, we can't compile it (or validate it) if we
24885 don't even know which class it refers to. Let's assume this
24886 was a stray '@interface' token in the stream and skip it.
24887 */
24889 }
24894 /* We have either a class or a category on our hands. */
24897 else
24898 {
24900 /* Handle instance variable declarations, if any. */
24903 }
24906 }
24908 /* Parse an Objective-C class implementation. */
24910 static void
24912 {
24919 {
24920 /* It's hard to recover because even if valid @implementation
24921 stuff is to follow, we can't compile it (or validate it) if
24922 we don't even know which class it refers to. Let's assume
24923 this was a stray '@implementation' token in the stream and
24924 skip it.
24925 */
24927 }
24931 /* We have either a class or a category on our hands. */
24934 else
24935 {
24937 /* Handle instance variable declarations, if any. */
24940 }
24943 }
24945 /* Consume the @end token and finish off the implementation. */
24947 static void
24949 {
24952 }
24954 /* Parse an Objective-C declaration. */
24956 static void
24958 {
24959 /* Try to figure out what kind of declaration is present. */
24964 {
24980 }
24983 {
25006 }
25007 }
25009 /* Parse an Objective-C try-catch-finally statement.
25011 objc-try-catch-finally-stmt:
25012 @try compound-statement objc-catch-clause-seq [opt]
25013 objc-finally-clause [opt]
25015 objc-catch-clause-seq:
25016 objc-catch-clause objc-catch-clause-seq [opt]
25018 objc-catch-clause:
25019 @catch ( objc-exception-declaration ) compound-statement
25021 objc-finally-clause:
25022 @finally compound-statement
25024 objc-exception-declaration:
25025 parameter-declaration
25026 '...'
25028 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
25030 Returns NULL_TREE.
25032 PS: This function is identical to c_parser_objc_try_catch_finally_statement
25033 for C. Keep them in sync. */
25035 static tree
25037 {
25038 location_t location;
25039 tree stmt;
25044 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
25045 node, lest it get absorbed into the surrounding block. */
25051 {
25060 {
25061 /* We have "@catch (...)" (where the '...' are literally
25062 what is in the code). Skip the '...'.
25063 parameter_declaration is set to NULL_TREE, and
25064 objc_being_catch_clauses() knows that that means
25065 '...'. */
25068 }
25069 else
25070 {
25071 /* We have "@catch (NSException *exception)" or something
25072 like that. Parse the parameter declaration. */
25076 else
25081 }
25084 else
25085 {
25086 /* If there was no open parenthesis, we are recovering from
25087 an error, and we are trying to figure out what mistake
25088 the user has made. */
25090 /* If there is an immediate closing parenthesis, the user
25091 probably forgot the opening one (ie, they typed "@catch
25092 NSException *e)". Parse the closing parenthesis and keep
25093 going. */
25097 /* If these is no immediate closing parenthesis, the user
25098 probably doesn't know that parenthesis are required at
25099 all (ie, they typed "@catch NSException *e"). So, just
25100 forget about the closing parenthesis and keep going. */
25101 }
25105 }
25107 {
25110 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
25111 node, lest it get absorbed into the surrounding block. */
25115 }
25118 }
25120 /* Parse an Objective-C synchronized statement.
25122 objc-synchronized-stmt:
25123 @synchronized ( expression ) compound-statement
25125 Returns NULL_TREE. */
25127 static tree
25129 {
25130 location_t location;
25141 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
25142 node, lest it get absorbed into the surrounding block. */
25147 }
25149 /* Parse an Objective-C throw statement.
25151 objc-throw-stmt:
25152 @throw assignment-expression [opt] ;
25154 Returns a constructed '@throw' statement. */
25156 static tree
25158 {
25170 }
25172 /* Parse an Objective-C statement. */
25174 static tree
25176 {
25177 /* Try to figure out what kind of declaration is present. */
25181 {
25192 }
25195 }
25197 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
25198 look ahead to see if an objc keyword follows the attributes. This
25199 is to detect the use of prefix attributes on ObjC @interface and
25200 @protocol. */
25202 static bool
25204 {
25209 {
25212 }
25215 }
25217 /* This routine is a minimal replacement for
25218 c_parser_struct_declaration () used when parsing the list of
25219 types/names or ObjC++ properties. For example, when parsing the
25220 code
25222 @property (readonly) int a, b, c;
25224 this function is responsible for parsing "int a, int b, int c" and
25225 returning the declarations as CHAIN of DECLs.
25227 TODO: Share this code with cp_parser_objc_class_ivars. It's very
25228 similar parsing. */
25229 static tree
25231 {
25233 cp_decl_specifier_seq declspecs;
25235 tree prefix_attributes;
25238 CP_PARSER_FLAGS_NONE,
25245 /* auto, register, static, extern, mutable. */
25247 {
25250 }
25252 /* thread_local. */
25254 {
25257 }
25259 /* typedef. */
25261 {
25264 }
25269 /* Keep going until we hit the `;' at the end of the declaration. */
25271 {
25276 /* Parse the declarator. */
25280 /* Look for attributes that apply to the ivar. */
25282 /* Remember which attributes are prefix attributes and
25283 which are not. */
25285 /* Combine the attributes. */
25295 /* Reset PREFIX_ATTRIBUTES. */
25306 {
25309 }
25310 else
25312 }
25314 }
25316 /* Parse an Objective-C @property declaration. The syntax is:
25318 objc-property-declaration:
25319 '@property' objc-property-attributes[opt] struct-declaration ;
25321 objc-property-attributes:
25322 '(' objc-property-attribute-list ')'
25324 objc-property-attribute-list:
25325 objc-property-attribute
25326 objc-property-attribute-list, objc-property-attribute
25328 objc-property-attribute
25329 'getter' = identifier
25330 'setter' = identifier
25331 'readonly'
25332 'readwrite'
25333 'assign'
25334 'retain'
25335 'copy'
25336 'nonatomic'
25338 For example:
25339 @property NSString *name;
25340 @property (readonly) id object;
25341 @property (retain, nonatomic, getter=getTheName) id name;
25342 @property int a, b, c;
25344 PS: This function is identical to
25345 c_parser_objc_at_property_declaration for C. Keep them in sync. */
25346 static void
25348 {
25349 /* The following variables hold the attributes of the properties as
25350 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
25351 seen. When we see an attribute, we set them to 'true' (if they
25352 are boolean properties) or to the identifier (if they have an
25353 argument, ie, for getter and setter). Note that here we only
25354 parse the list of attributes, check the syntax and accumulate the
25355 attributes that we find. objc_add_property_declaration() will
25356 then process the information. */
25366 /* 'properties' is the list of properties that we read. Usually a
25367 single one, but maybe more (eg, in "@property int a, b, c;" there
25368 are three). */
25369 tree properties;
25370 location_t loc;
25376 /* Parse the optional attribute list... */
25378 {
25379 /* Eat the '('. */
25383 {
25389 {
25392 }
25396 {
25407 {
25411 else
25416 }
25419 {
25423 }
25425 {
25427 {
25430 }
25431 else
25435 else
25437 }
25438 else
25439 {
25441 {
25444 }
25445 else
25447 }
25453 }
25460 else
25462 }
25464 /* FIXME: "@property (setter, assign);" will generate a spurious
25465 "error: expected ‘)’ before ‘,’ token". This is because
25466 cp_parser_require, unlike the C counterpart, will produce an
25467 error even if we are in error recovery. */
25469 {
25474 }
25475 }
25477 /* ... and the property declaration(s). */
25481 {
25483 /* If the next token is now a `;', consume it. */
25487 }
25491 else
25492 {
25493 /* Comma-separated properties are chained together in
25494 reverse order; add them one by one. */
25503 }
25506 }
25508 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
25510 objc-synthesize-declaration:
25511 @synthesize objc-synthesize-identifier-list ;
25513 objc-synthesize-identifier-list:
25514 objc-synthesize-identifier
25515 objc-synthesize-identifier-list, objc-synthesize-identifier
25517 objc-synthesize-identifier
25518 identifier
25519 identifier = identifier
25521 For example:
25522 @synthesize MyProperty;
25523 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
25525 PS: This function is identical to c_parser_objc_at_synthesize_declaration
25526 for C. Keep them in sync.
25527 */
25528 static void
25530 {
25532 location_t loc;
25537 {
25541 {
25544 }
25546 {
25550 {
25553 }
25554 }
25555 else
25560 else
25562 }
25565 }
25567 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
25569 objc-dynamic-declaration:
25570 @dynamic identifier-list ;
25572 For example:
25573 @dynamic MyProperty;
25574 @dynamic MyProperty, AnotherProperty;
25576 PS: This function is identical to c_parser_objc_at_dynamic_declaration
25577 for C. Keep them in sync.
25578 */
25579 static void
25581 {
25583 location_t loc;
25588 {
25589 tree property;
25592 {
25595 }
25599 else
25601 }
25604 }
25606 \f
25607 /* OpenMP 2.5 parsing routines. */
25609 /* Returns name of the next clause.
25610 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25611 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25612 returned and the token is consumed. */
25614 static pragma_omp_clause
25616 {
25626 {
25631 {
25678 }
25679 }
25685 }
25687 /* Validate that a clause of the given type does not already exist. */
25689 static void
25692 {
25693 tree c;
25697 {
25700 }
25701 }
25703 /* OpenMP 2.5:
25704 variable-list:
25705 identifier
25706 variable-list , identifier
25708 In addition, we match a closing parenthesis. An opening parenthesis
25709 will have been consumed by the caller.
25711 If KIND is nonzero, create the appropriate node and install the decl
25712 in OMP_CLAUSE_DECL and add the node to the head of the list.
25714 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25715 return the list created. */
25717 static tree
25719 tree list)
25720 {
25723 {
25740 {
25745 }
25746 else
25749 get_comma:
25753 }
25756 {
25759 /* Try to resync to an unnested comma. Copied from
25760 cp_parser_parenthesized_expression_list. */
25761 skip_comma:
25768 }
25771 }
25773 /* Similarly, but expect leading and trailing parenthesis. This is a very
25774 common case for omp clauses. */
25776 static tree
25778 {
25782 }
25784 /* OpenMP 3.0:
25785 collapse ( constant-expression ) */
25787 static tree
25789 {
25791 location_t loc;
25792 HOST_WIDE_INT n;
25812 {
25815 }
25823 }
25825 /* OpenMP 2.5:
25826 default ( shared | none ) */
25828 static tree
25830 {
25832 tree c;
25837 {
25842 {
25857 }
25860 }
25861 else
25862 {
25863 invalid_kind:
25865 }
25881 }
25883 /* OpenMP 3.1:
25884 final ( expression ) */
25886 static tree
25888 {
25909 }
25911 /* OpenMP 2.5:
25912 if ( expression ) */
25914 static tree
25916 {
25937 }
25939 /* OpenMP 3.1:
25940 mergeable */
25942 static tree
25945 {
25946 tree c;
25949 location);
25954 }
25956 /* OpenMP 2.5:
25957 nowait */
25959 static tree
25962 {
25963 tree c;
25970 }
25972 /* OpenMP 2.5:
25973 num_threads ( expression ) */
25975 static tree
25977 location_t location)
25978 {
26000 }
26002 /* OpenMP 2.5:
26003 ordered */
26005 static tree
26008 {
26009 tree c;
26017 }
26019 /* OpenMP 2.5:
26020 reduction ( reduction-operator : variable-list )
26022 reduction-operator:
26023 One of: + * - & ^ | && ||
26025 OpenMP 3.1:
26027 reduction-operator:
26028 One of: + * - & ^ | && || min max */
26030 static tree
26032 {
26040 {
26066 {
26071 {
26074 }
26076 {
26079 }
26080 }
26081 /* FALLTHROUGH */
26085 resync_fail:
26090 }
26101 }
26103 /* OpenMP 2.5:
26104 schedule ( schedule-kind )
26105 schedule ( schedule-kind , expression )
26107 schedule-kind:
26108 static | dynamic | guided | runtime | auto */
26110 static tree
26112 {
26121 {
26126 {
26147 }
26148 }
26153 else
26158 {
26173 else
26178 }
26186 invalid_kind:
26188 resync_fail:
26193 }
26195 /* OpenMP 3.0:
26196 untied */
26198 static tree
26201 {
26202 tree c;
26209 }
26211 /* Parse all OpenMP clauses. The set clauses allowed by the directive
26212 is a bitmask in MASK. Return the list of clauses found; the result
26213 of clause default goes in *pdefault. */
26215 static tree
26218 {
26224 {
26225 pragma_omp_clause c_kind;
26237 {
26249 clauses);
26263 clauses);
26272 clauses);
26296 clauses);
26310 clauses);
26321 }
26324 {
26325 /* Remove the invalid clause(s) from the list to avoid
26326 confusing the rest of the compiler. */
26329 }
26330 }
26331 saw_error:
26334 }
26336 /* OpenMP 2.5:
26337 structured-block:
26338 statement
26340 In practice, we're also interested in adding the statement to an
26341 outer node. So it is convenient if we work around the fact that
26342 cp_parser_statement calls add_stmt. */
26344 static unsigned
26346 {
26349 /* Only move the values to IN_OMP_BLOCK if they weren't false.
26350 This preserves the "not within loop or switch" style error messages
26351 for nonsense cases like
26352 void foo() {
26353 #pragma omp single
26354 break;
26355 }
26356 */
26361 }
26363 static void
26365 {
26367 }
26369 static tree
26371 {
26379 }
26381 /* OpenMP 2.5:
26382 # pragma omp atomic new-line
26383 expression-stmt
26385 expression-stmt:
26386 x binop= expr | x++ | ++x | x-- | --x
26387 binop:
26388 +, *, -, /, &, ^, |, <<, >>
26390 where x is an lvalue expression with scalar type.
26392 OpenMP 3.1:
26393 # pragma omp atomic new-line
26394 update-stmt
26396 # pragma omp atomic read new-line
26397 read-stmt
26399 # pragma omp atomic write new-line
26400 write-stmt
26402 # pragma omp atomic update new-line
26403 update-stmt
26405 # pragma omp atomic capture new-line
26406 capture-stmt
26408 # pragma omp atomic capture new-line
26409 capture-block
26411 read-stmt:
26412 v = x
26413 write-stmt:
26414 x = expr
26415 update-stmt:
26416 expression-stmt | x = x binop expr
26417 capture-stmt:
26418 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
26419 capture-block:
26420 { v = x; update-stmt; } | { update-stmt; v = x; }
26422 where x and v are lvalue expressions with scalar type. */
26424 static void
26426 {
26433 {
26445 else
26449 }
26453 {
26464 else
26470 {
26471 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
26472 opcode. */
26477 }
26481 {
26484 }
26485 else
26486 {
26493 }
26496 }
26498 restart:
26503 {
26510 /* FALLTHROUGH */
26520 /* FALLTHROUGH */
26535 /* Undo effects of boolean_increment for post {in,de}crement. */
26537 /* FALLTHRU */
26541 {
26542 /* Undo effects of boolean_increment. */
26544 {
26545 /* This is pre or post increment. */
26550 && !structured_block
26554 }
26555 }
26556 /* FALLTHRU */
26559 {
26589 {
26599 {
26602 {
26610 }
26645 }
26656 }
26657 /* FALLTHROUGH */
26662 }
26669 }
26670 stmt_done:
26672 {
26685 }
26687 {
26690 }
26691 done:
26697 saw_error:
26700 {
26704 {
26708 }
26709 }
26710 }
26713 /* OpenMP 2.5:
26714 # pragma omp barrier new-line */
26716 static void
26718 {
26721 }
26723 /* OpenMP 2.5:
26724 # pragma omp critical [(name)] new-line
26725 structured-block */
26727 static tree
26729 {
26733 {
26745 }
26750 }
26752 /* OpenMP 2.5:
26753 # pragma omp flush flush-vars[opt] new-line
26755 flush-vars:
26756 ( variable-list ) */
26758 static void
26760 {
26766 }
26768 /* Helper function, to parse omp for increment expression. */
26770 static tree
26772 {
26777 {
26780 }
26783 {
26791 }
26793 /* If decl is an iterator, preserve LHS and RHS of the relational
26794 expr until finish_omp_for. */
26804 }
26806 /* Helper function, to parse omp for increment expression. */
26808 static tree
26810 {
26814 cp_id_kind idk;
26818 {
26826 }
26834 {
26839 }
26846 {
26850 }
26862 do
26863 {
26870 {
26872 {
26875 else
26877 tf_warning_or_error);
26878 }
26879 else
26882 }
26883 }
26887 {
26891 }
26892 else
26896 }
26898 /* Parse the restricted form of the for statement allowed by OpenMP. */
26900 static tree
26902 {
26906 location_t loc_first;
26925 {
26928 location_t loc;
26931 {
26934 }
26943 {
26944 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26946 init-expr:
26947 var = lb
26948 integer-type var = lb
26949 random-access-iterator-type var = lb
26950 pointer-type var = lb
26951 */
26952 cp_decl_specifier_seq type_specifiers;
26954 /* First, try to parse as an initialized declaration. See
26955 cp_parser_condition, from whence the bulk of this is copied. */
26962 {
26963 /* If parsing a type specifier seq succeeded, then this
26964 MUST be a initialized declaration. */
26969 CP_PARSER_DECLARATOR_NAMED,
26979 else
26980 {
26990 {
26992 CPP_OPEN_PAREN))
26995 else
26996 /* Trigger an error. */
27001 }
27005 {
27013 {
27016 auto_node);
27021 }
27024 asm_specification,
27025 LOOKUP_ONLYCONVERTING);
27027 {
27030 }
27031 else
27034 }
27035 else
27036 {
27037 /* Consume '='. */
27041 non_class:
27044 else
27047 asm_specification,
27048 LOOKUP_ONLYCONVERTING);
27049 }
27053 }
27054 }
27055 else
27056 {
27057 cp_id_kind idk;
27058 /* If parsing a type specifier sequence failed, then
27059 this MUST be a simple expression. */
27064 && decl
27067 {
27068 tree rhs;
27075 rhs,
27076 tf_warning_or_error));
27078 }
27079 else
27080 {
27085 {
27089 }
27090 }
27091 }
27092 }
27095 {
27098 {
27104 }
27105 else
27107 }
27112 {
27117 {
27121 }
27124 {
27125 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
27126 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
27135 }
27136 else
27137 {
27142 }
27143 }
27146 {
27147 tree c;
27149 {
27158 decl);
27162 decl);
27163 }
27165 {
27170 {
27173 }
27174 }
27175 }
27184 {
27185 /* If decl is an iterator, preserve the operator on decl
27186 until finish_omp_for. */
27188 && ((processing_template_decl
27192 else
27196 }
27211 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
27212 in between the collapsed for loops to be still considered perfectly
27213 nested. Hopefully the final version clarifies this.
27214 For now handle (multiple) {'s and empty statements. */
27216 do
27217 {
27221 {
27223 bracecount++;
27224 }
27228 else
27229 {
27236 }
27237 }
27241 {
27244 }
27245 }
27247 /* Note that we saved the original contents of this flag when we entered
27248 the structured block, and so we don't need to re-save it here. */
27251 /* Note that the grammar doesn't call for a structured block here,
27252 though the loop as a whole is a structured block. */
27259 else
27264 {
27266 {
27268 nbraces--;
27269 }
27272 else
27273 {
27275 {
27278 }
27283 }
27284 }
27291 }
27293 /* OpenMP 2.5:
27294 #pragma omp for for-clause[optseq] new-line
27295 for-loop */
27297 #define OMP_FOR_CLAUSE_MASK \
27298 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27299 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27300 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27301 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27302 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
27303 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
27304 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
27305 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
27307 static tree
27309 {
27325 }
27327 /* OpenMP 2.5:
27328 # pragma omp master new-line
27329 structured-block */
27331 static tree
27333 {
27337 }
27339 /* OpenMP 2.5:
27340 # pragma omp ordered new-line
27341 structured-block */
27343 static tree
27345 {
27349 }
27351 /* OpenMP 2.5:
27353 section-scope:
27354 { section-sequence }
27356 section-sequence:
27357 section-directive[opt] structured-block
27358 section-sequence section-directive structured-block */
27360 static tree
27362 {
27373 {
27380 {
27390 }
27396 }
27399 {
27407 {
27411 }
27413 {
27416 }
27421 }
27432 }
27434 /* OpenMP 2.5:
27435 # pragma omp sections sections-clause[optseq] newline
27436 sections-scope */
27438 #define OMP_SECTIONS_CLAUSE_MASK \
27439 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27440 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27441 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27442 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27443 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27445 static tree
27447 {
27458 }
27460 /* OpenMP 2.5:
27461 # pragma parallel parallel-clause new-line
27462 # pragma parallel for parallel-for-clause new-line
27463 # pragma parallel sections parallel-sections-clause new-line */
27465 #define OMP_PARALLEL_CLAUSE_MASK \
27466 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27467 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27468 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27469 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27470 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27471 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
27472 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27473 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
27475 static tree
27477 {
27486 {
27492 }
27494 {
27498 {
27504 }
27505 }
27512 {
27532 }
27539 }
27541 /* OpenMP 2.5:
27542 # pragma omp single single-clause[optseq] new-line
27543 structured-block */
27545 #define OMP_SINGLE_CLAUSE_MASK \
27546 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27547 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27548 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
27549 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27551 static tree
27553 {
27563 }
27565 /* OpenMP 3.0:
27566 # pragma omp task task-clause[optseq] new-line
27567 structured-block */
27569 #define OMP_TASK_CLAUSE_MASK \
27570 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27571 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
27572 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27573 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27574 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27575 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27576 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
27577 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
27579 static tree
27581 {
27592 }
27594 /* OpenMP 3.0:
27595 # pragma omp taskwait new-line */
27597 static void
27599 {
27602 }
27604 /* OpenMP 3.1:
27605 # pragma omp taskyield new-line */
27607 static void
27609 {
27612 }
27614 /* OpenMP 2.5:
27615 # pragma omp threadprivate (variable-list) */
27617 static void
27619 {
27620 tree vars;
27626 }
27628 /* Main entry point to OpenMP statement pragmas. */
27630 static void
27632 {
27633 tree stmt;
27636 {
27666 }
27670 }
27671 \f
27672 /* Transactional Memory parsing routines. */
27674 /* Parse a transaction attribute.
27676 txn-attribute:
27677 attribute
27678 [ [ identifier ] ]
27680 ??? Simplify this when C++0x bracket attributes are
27681 implemented properly. */
27683 static tree
27685 {
27700 {
27704 /* For keywords, use the canonical spelling,
27705 not the parsed identifier. */
27709 }
27710 else
27714 error1:
27717 }
27719 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27721 transaction-statement:
27722 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27723 compound-statement
27724 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27725 */
27727 static tree
27729 {
27744 else
27745 {
27749 }
27751 /* Parse a noexcept specification. */
27754 /* Keep track if we're in the lexical scope of an outer transaction. */
27766 }
27768 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27770 transaction-expression:
27771 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27772 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27773 */
27775 static tree
27777 {
27802 /* Set this early. This might mean that we allow transaction_cancel in
27803 an expression that we find out later actually has to be a constexpr.
27804 However, we expect that cxx_constant_value will be able to deal with
27805 this; also, if the noexcept has no constexpr, then what we parse next
27806 really is a transaction's body. */
27809 /* Parse a noexcept specification. */
27815 {
27822 }
27823 else
27824 {
27825 /* The only expression that is available got parsed for the noexcept
27826 already. noexcept is true then. */
27829 }
27838 }
27840 /* Parse a function-transaction-block.
27842 function-transaction-block:
27843 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27844 function-body
27845 __transaction_atomic txn-attribute[opt] function-try-block
27846 __transaction_relaxed ctor-initializer[opt] function-body
27847 __transaction_relaxed function-try-block
27848 */
27850 static bool
27852 {
27868 else
27869 {
27873 }
27881 else
27882 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27890 }
27892 /* Parse a __transaction_cancel statement.
27894 cancel-statement:
27895 __transaction_cancel txn-attribute[opt] ;
27896 __transaction_cancel txn-attribute[opt] throw-expression ;
27898 ??? Cancel and throw is not yet implemented. */
27900 static tree
27902 {
27908 RT_TRANSACTION_CANCEL);
27915 /* ??? Parse cancel-and-throw here. */
27920 {
27924 }
27926 {
27930 }
27932 {
27935 {
27941 }
27942 }
27944 {
27948 }
27955 }
27956 \f
27957 /* The parser. */
27961 \f
27962 /* Special handling for the first token or line in the file. The first
27963 thing in the file might be #pragma GCC pch_preprocess, which loads a
27964 PCH file, which is a GC collection point. So we need to handle this
27965 first pragma without benefit of an existing lexer structure.
27967 Always returns one token to the caller in *FIRST_TOKEN. This is
27968 either the true first token of the file, or the first token after
27969 the initial pragma. */
27971 static void
27973 {
27982 {
27989 }
27990 else
27993 /* Skip to the end of the pragma. */
27997 /* Now actually load the PCH file. */
28001 /* Read one more token to return to our caller. We have to do this
28002 after reading the PCH file in, since its pointers have to be
28003 live. */
28005 }
28007 /* Normal parsing of a pragma token. Here we can (and must) use the
28008 regular lexer. */
28010 static bool
28012 {
28022 {
28030 {
28040 }
28045 {
28055 }
28060 {
28066 "%<#pragma omp taskwait%> may only be "
28071 }
28076 {
28082 "%<#pragma omp taskyield%> may only be "
28087 }
28110 "%<#pragma omp section%> may only be used in "
28119 bad_stmt:
28122 }
28126 }
28128 /* The interface the pragma parsers have to the lexer. */
28130 enum cpp_ttype
28132 {
28145 else
28146 {
28150 }
28153 }
28155 \f
28156 /* External interface. */
28158 /* Parse one entire translation unit. */
28160 void
28162 {
28166 {
28169 }
28177 }