| blob | 057b7de3faaafced0dc5df2fde2d1517d5c3c1a3 |
1 /* C++ Parser.
2 Copyright (C) 2000-2014 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/>. */
48 \f
51 // A helper function. Returns the object pointed to by P
52 // and sets P to NULL.
55 {
59 }
63 /* The lexer. */
65 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
66 and c-lex.c) and the C++ parser. */
69 {
71 };
73 /* The various kinds of non integral constant we encounter. */
75 NIC_NONE,
76 /* floating-point literal */
77 NIC_FLOAT,
78 /* %<this%> */
79 NIC_THIS,
80 /* %<__FUNCTION__%> */
81 NIC_FUNC_NAME,
82 /* %<__PRETTY_FUNCTION__%> */
83 NIC_PRETTY_FUNC,
84 /* %<__func__%> */
85 NIC_C99_FUNC,
86 /* "%<va_arg%> */
87 NIC_VA_ARG,
88 /* a cast */
89 NIC_CAST,
90 /* %<typeid%> operator */
91 NIC_TYPEID,
92 /* non-constant compound literals */
93 NIC_NCC,
94 /* a function call */
95 NIC_FUNC_CALL,
96 /* an increment */
97 NIC_INC,
98 /* an decrement */
99 NIC_DEC,
100 /* an array reference */
101 NIC_ARRAY_REF,
102 /* %<->%> */
103 NIC_ARROW,
104 /* %<.%> */
105 NIC_POINT,
106 /* the address of a label */
107 NIC_ADDR_LABEL,
108 /* %<*%> */
109 NIC_STAR,
110 /* %<&%> */
111 NIC_ADDR,
112 /* %<++%> */
113 NIC_PREINCREMENT,
114 /* %<--%> */
115 NIC_PREDECREMENT,
116 /* %<new%> */
117 NIC_NEW,
118 /* %<delete%> */
119 NIC_DEL,
120 /* calls to overloaded operators */
121 NIC_OVERLOADED,
122 /* an assignment */
123 NIC_ASSIGNMENT,
124 /* a comma operator */
125 NIC_COMMA,
126 /* a call to a constructor */
127 NIC_CONSTRUCTOR,
128 /* a transaction expression */
129 NIC_TRANSACTION
132 /* The various kinds of errors about name-lookup failing. */
134 /* NULL */
135 NLE_NULL,
136 /* is not a type */
137 NLE_TYPE,
138 /* is not a class or namespace */
139 NLE_CXX98,
140 /* is not a class, namespace, or enumeration */
141 NLE_NOT_CXX98
144 /* The various kinds of required token */
146 RT_NONE,
168 /* The type is CPP_KEYWORD */
197 RT_TRANSACTION_CANCEL /* __transaction_cancel */
200 /* Prototypes. */
206 static void cp_lexer_destroy
208 static int cp_lexer_saving_tokens
212 static void cp_lexer_get_preprocessor_token
220 static bool cp_lexer_next_token_is_not
222 static bool cp_lexer_next_token_is_keyword
226 static void cp_lexer_purge_token
228 static void cp_lexer_purge_tokens_after
230 static void cp_lexer_save_tokens
232 static void cp_lexer_commit_tokens
234 static void cp_lexer_rollback_tokens
236 static void cp_lexer_print_token
240 static void cp_lexer_start_debugging
242 static void cp_lexer_stop_debugging
248 static void cp_parser_initial_pragma
251 static tree cp_literal_operator_id
254 static void cp_parser_cilk_simd
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
261 /* Manifest constants. */
262 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
263 #define CP_SAVED_TOKEN_STACK 5
265 /* Variables. */
267 /* The stream to which debugging output should be written. */
270 /* Nonzero if we are parsing an unevaluated operand: an operand to
271 sizeof, typeof, or alignof. */
274 /* Dump up to NUM tokens in BUFFER to FILE starting with token
275 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
276 first token in BUFFER. If NUM is 0, dump all the tokens. If
277 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
278 highlighted by surrounding it in [[ ]]. */
280 static void
284 {
301 {
304 }
309 {
316 nprinted++;
326 {
336 }
337 }
340 {
343 }
346 }
349 /* Dump all tokens in BUFFER to stderr. */
351 void
353 {
355 }
357 DEBUG_FUNCTION void
359 {
361 }
363 DEBUG_FUNCTION void
365 {
368 else
370 }
373 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
374 description for T. */
376 static void
378 {
380 {
383 }
384 }
387 /* Dump parser context C to FILE. */
389 static void
391 {
396 }
399 /* Print the stack of parsing contexts to FILE starting with FIRST. */
401 static void
403 {
409 {
412 }
413 }
416 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
418 static void
420 {
423 }
426 /* Print an unparsed function entry UF to FILE. */
428 static void
430 {
433 tree fn;
438 i++)
439 {
445 }
450 {
453 }
459 {
462 }
464 }
467 /* Print the stack of unparsed member functions S to FILE. */
469 static void
472 {
478 {
481 }
482 }
485 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
486 the given PARSER. If FILE is NULL, the output is printed on stderr. */
488 static void
490 {
502 next_token);
503 }
506 /* Dump debugging information for the given PARSER. If FILE is NULL,
507 the output is printed on stderr. */
509 void
511 {
514 expanded_location eloc;
592 }
594 DEBUG_FUNCTION void
596 {
598 }
600 DEBUG_FUNCTION void
602 {
605 else
607 }
609 /* Allocate memory for a new lexer object and return it. */
613 {
618 /* Allocate the memory. */
621 /* Initially we are not debugging. */
626 /* Create the buffer. */
630 }
633 /* Create a new main C++ lexer, the lexer that gets tokens from the
634 preprocessor. */
638 {
640 cp_token token;
642 /* It's possible that parsing the first pragma will load a PCH file,
643 which is a GC collection point. So we have to do that before
644 allocating any memory. */
649 /* Put the first token in the buffer. */
652 /* Get the remaining tokens from the preprocessor. */
654 {
657 }
666 /* Subsequent preprocessor diagnostics should use compiler
667 diagnostic functions to get the compiler source location. */
672 }
674 /* Create a new lexer whose token stream is primed with the tokens in
675 CACHE. When these tokens are exhausted, no new tokens will be read. */
679 {
684 /* We do not own the buffer. */
691 /* Initially we are not debugging. */
696 }
698 /* Frees all resources associated with LEXER. */
700 static void
702 {
706 }
708 /* Returns nonzero if debugging information should be output. */
712 {
714 }
719 {
723 }
727 {
729 }
733 {
735 }
739 {
742 else
744 }
748 {
752 }
754 /* nonzero if we are presently saving tokens. */
758 {
760 }
762 /* Store the next token from the preprocessor in *TOKEN. Return true
763 if we reach EOF. If LEXER is NULL, assume we are handling an
764 initial #pragma pch_preprocess, and thus want the lexer to return
765 processed strings. */
767 static void
769 {
772 /* Get a new token from the preprocessor. */
773 token->type
781 /* On some systems, some header files are surrounded by an
782 implicit extern "C" block. Set a flag in the token if it
783 comes from such a header. */
788 /* Check to see if this token is a keyword. */
790 {
792 {
793 /* Mark this token as a keyword. */
795 /* Record which keyword. */
797 }
798 else
799 {
803 {
804 /* Warn about the C++0x keyword (but still treat it as
805 an identifier). */
810 /* Clear out the C_RID_CODE so we don't warn about this
811 particular identifier-turned-keyword again. */
813 }
816 }
817 }
819 {
820 /* This only happens in Objective-C++; it must be a keyword. */
823 {
824 /* Replace 'class' with '@class', 'private' with '@private',
825 etc. This prevents confusion with the C++ keyword
826 'class', and makes the tokens consistent with other
827 Objective-C 'AT' keywords. For example '@class' is
828 reported as RID_AT_CLASS which is consistent with
829 '@synchronized', which is reported as
830 RID_AT_SYNCHRONIZED.
831 */
840 }
841 }
843 {
844 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
848 }
849 }
851 /* Update the globals input_location and the input file stack from TOKEN. */
854 {
856 {
858 }
859 }
861 /* Update the globals input_location and the input file stack from LEXER. */
864 {
867 }
869 /* Return a pointer to the next token in the token stream, but do not
870 consume it. */
874 {
876 {
880 }
882 }
884 /* Return true if the next token has the indicated TYPE. */
888 {
890 }
892 /* Return true if the next token does not have the indicated TYPE. */
896 {
898 }
900 /* Return true if the next token is the indicated KEYWORD. */
904 {
906 }
910 {
912 }
914 /* Return true if the next token is not the indicated KEYWORD. */
918 {
920 }
922 /* Return true if the next token is a keyword for a decl-specifier. */
924 static bool
926 {
931 {
932 /* auto specifier: storage-class-specifier in C++,
933 simple-type-specifier in C++0x. */
935 /* Storage classes. */
941 /* Elaborated type specifiers. */
947 /* Simple type specifiers. */
962 /* GNU extensions. */
965 /* C++0x extensions. */
972 }
973 }
975 /* Returns TRUE iff the token T begins a decltype type. */
977 static bool
979 {
982 }
984 /* Returns TRUE iff the next token begins a decltype type. */
986 static bool
988 {
991 }
993 /* Return a pointer to the Nth token in the token stream. If N is 1,
994 then this is precisely equivalent to cp_lexer_peek_token (except
995 that it is not inline). One would like to disallow that case, but
996 there is one case (cp_parser_nth_token_starts_template_id) where
997 the caller passes a variable for N and it might be 1. */
1001 {
1004 /* N is 1-based, not zero-based. */
1015 {
1018 {
1021 }
1025 }
1028 {
1031 }
1034 }
1036 /* Return the next token, and advance the lexer's next_token pointer
1037 to point to the next non-purged token. */
1041 {
1047 do
1048 {
1051 {
1054 }
1056 }
1061 /* Provide debugging output. */
1063 {
1067 }
1070 }
1072 /* Permanently remove the next token from the token stream, and
1073 advance the next_token pointer to refer to the next non-purged
1074 token. */
1076 static void
1078 {
1087 do
1088 {
1089 tok++;
1091 {
1094 }
1095 }
1098 }
1100 /* Permanently remove all tokens after TOK, up to, but not
1101 including, the token that will be returned next by
1102 cp_lexer_peek_token. */
1104 static void
1106 {
1115 {
1120 }
1121 }
1123 /* Begin saving tokens. All tokens consumed after this point will be
1124 preserved. */
1126 static void
1128 {
1129 /* Provide debugging output. */
1134 }
1136 /* Commit to the portion of the token stream most recently saved. */
1138 static void
1140 {
1141 /* Provide debugging output. */
1146 }
1148 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1149 to the token stream. Stop saving tokens. */
1151 static void
1153 {
1154 /* Provide debugging output. */
1159 }
1161 /* Print a representation of the TOKEN on the STREAM. */
1163 static void
1165 {
1166 /* We don't use cpp_type2name here because the parser defines
1167 a few tokens of its own. */
1169 /* cpplib-defined token types */
1170 #define OP(e, s) #e,
1171 #define TK(e, s) #e,
1172 TTYPE_TABLE
1173 #undef OP
1174 #undef TK
1175 /* C++ parser token types - see "Manifest constants", above. */
1179 };
1181 /* For some tokens, print the associated data. */
1183 {
1185 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1186 For example, `struct' is mapped to an INTEGER_CST. */
1189 /* else fall through */
1207 /* If we have a name for the token, print it out. Otherwise, we
1208 simply give the numeric code. */
1211 else
1214 }
1215 }
1217 DEBUG_FUNCTION void
1219 {
1222 }
1224 DEBUG_FUNCTION void
1226 {
1229 else
1231 }
1234 /* Start emitting debugging information. */
1236 static void
1238 {
1241 }
1243 /* Stop emitting debugging information. */
1245 static void
1247 {
1250 }
1252 /* Create a new cp_token_cache, representing a range of tokens. */
1256 {
1261 }
1263 /* Diagnose if #pragma omp declare simd isn't followed immediately
1264 by function declaration or definition. */
1268 {
1270 {
1274 }
1275 }
1277 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1278 and put that into "omp declare simd" attribute. */
1282 {
1284 {
1286 {
1289 }
1291 {
1294 }
1295 }
1296 }
1297 \f
1298 /* Decl-specifiers. */
1300 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1302 static void
1304 {
1306 }
1308 /* Declarators. */
1310 /* Nothing other than the parser should be creating declarators;
1311 declarators are a semi-syntactic representation of C++ entities.
1312 Other parts of the front end that need to create entities (like
1313 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1328 /* An erroneous declarator. */
1331 /* The obstack on which declarators and related data structures are
1332 allocated. */
1335 /* Alloc BYTES from the declarator memory pool. */
1339 {
1341 }
1343 /* Allocate a declarator of the indicated KIND. Clear fields that are
1344 common to all declarators. */
1348 {
1360 }
1362 /* Make a declarator for a generalized identifier. If
1363 QUALIFYING_SCOPE is non-NULL, the identifier is
1364 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1365 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1366 is, if any. */
1370 special_function_kind sfk)
1371 {
1374 /* It is valid to write:
1376 class C { void f(); };
1377 typedef C D;
1378 void D::f();
1380 The standard is not clear about whether `typedef const C D' is
1381 legal; as of 2002-09-15 the committee is considering that
1382 question. EDG 3.0 allows that syntax. Therefore, we do as
1383 well. */
1397 }
1399 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1400 of modifiers such as const or volatile to apply to the pointer
1401 type, represented as identifiers. ATTRIBUTES represent the attributes that
1402 appertain to the pointer or reference. */
1404 cp_declarator *
1406 tree attributes)
1407 {
1415 {
1419 }
1420 else
1426 }
1428 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1429 represent the attributes that appertain to the pointer or
1430 reference. */
1432 cp_declarator *
1435 {
1443 {
1447 }
1448 else
1454 }
1456 /* Like make_pointer_declarator -- but for a pointer to a non-static
1457 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1458 appertain to the pointer or reference. */
1460 cp_declarator *
1463 tree attributes)
1464 {
1473 {
1476 }
1477 else
1483 }
1485 /* Make a declarator for the function given by TARGET, with the
1486 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1487 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1488 indicates what exceptions can be thrown. */
1490 cp_declarator *
1492 tree parms,
1493 cp_cv_quals cv_qualifiers,
1494 cp_virt_specifiers virt_specifiers,
1495 cp_ref_qualifier ref_qualifier,
1496 tree exception_specification,
1497 tree late_return_type)
1498 {
1510 {
1514 }
1515 else
1519 }
1521 /* Make a declarator for an array of BOUNDS elements, each of which is
1522 defined by ELEMENT. */
1524 cp_declarator *
1526 {
1533 {
1537 }
1538 else
1542 }
1544 /* Determine whether the declarator we've seen so far can be a
1545 parameter pack, when followed by an ellipsis. */
1546 static bool
1548 {
1549 /* Search for a declarator name, or any other declarator that goes
1550 after the point where the ellipsis could appear in a parameter
1551 pack. If we find any of these, then this declarator can not be
1552 made into a parameter pack. */
1555 {
1557 {
1569 }
1570 }
1573 }
1577 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1578 DECLARATOR and DEFAULT_ARGUMENT. */
1580 cp_parameter_declarator *
1583 tree default_argument)
1584 {
1592 else
1599 }
1601 /* Returns true iff DECLARATOR is a declaration for a function. */
1603 static bool
1605 {
1607 {
1615 }
1617 }
1619 /* The parser. */
1621 /* Overview
1622 --------
1624 A cp_parser parses the token stream as specified by the C++
1625 grammar. Its job is purely parsing, not semantic analysis. For
1626 example, the parser breaks the token stream into declarators,
1627 expressions, statements, and other similar syntactic constructs.
1628 It does not check that the types of the expressions on either side
1629 of an assignment-statement are compatible, or that a function is
1630 not declared with a parameter of type `void'.
1632 The parser invokes routines elsewhere in the compiler to perform
1633 semantic analysis and to build up the abstract syntax tree for the
1634 code processed.
1636 The parser (and the template instantiation code, which is, in a
1637 way, a close relative of parsing) are the only parts of the
1638 compiler that should be calling push_scope and pop_scope, or
1639 related functions. The parser (and template instantiation code)
1640 keeps track of what scope is presently active; everything else
1641 should simply honor that. (The code that generates static
1642 initializers may also need to set the scope, in order to check
1643 access control correctly when emitting the initializers.)
1645 Methodology
1646 -----------
1648 The parser is of the standard recursive-descent variety. Upcoming
1649 tokens in the token stream are examined in order to determine which
1650 production to use when parsing a non-terminal. Some C++ constructs
1651 require arbitrary look ahead to disambiguate. For example, it is
1652 impossible, in the general case, to tell whether a statement is an
1653 expression or declaration without scanning the entire statement.
1654 Therefore, the parser is capable of "parsing tentatively." When the
1655 parser is not sure what construct comes next, it enters this mode.
1656 Then, while we attempt to parse the construct, the parser queues up
1657 error messages, rather than issuing them immediately, and saves the
1658 tokens it consumes. If the construct is parsed successfully, the
1659 parser "commits", i.e., it issues any queued error messages and
1660 the tokens that were being preserved are permanently discarded.
1661 If, however, the construct is not parsed successfully, the parser
1662 rolls back its state completely so that it can resume parsing using
1663 a different alternative.
1665 Future Improvements
1666 -------------------
1668 The performance of the parser could probably be improved substantially.
1669 We could often eliminate the need to parse tentatively by looking ahead
1670 a little bit. In some places, this approach might not entirely eliminate
1671 the need to parse tentatively, but it might still speed up the average
1672 case. */
1674 /* Flags that are passed to some parsing functions. These values can
1675 be bitwise-ored together. */
1677 enum
1678 {
1679 /* No flags. */
1681 /* The construct is optional. If it is not present, then no error
1682 should be issued. */
1684 /* When parsing a type-specifier, treat user-defined type-names
1685 as non-type identifiers. */
1687 /* When parsing a type-specifier, do not try to parse a class-specifier
1688 or enum-specifier. */
1690 /* When parsing a decl-specifier-seq, only allow type-specifier or
1691 constexpr. */
1693 };
1695 /* This type is used for parameters and variables which hold
1696 combinations of the above flags. */
1699 /* The different kinds of declarators we want to parse. */
1702 {
1703 /* We want an abstract declarator. */
1704 CP_PARSER_DECLARATOR_ABSTRACT,
1705 /* We want a named declarator. */
1706 CP_PARSER_DECLARATOR_NAMED,
1707 /* We don't mind, but the name must be an unqualified-id. */
1708 CP_PARSER_DECLARATOR_EITHER
1711 /* The precedence values used to parse binary expressions. The minimum value
1712 of PREC must be 1, because zero is reserved to quickly discriminate
1713 binary operators from other tokens. */
1715 enum cp_parser_prec
1716 {
1717 PREC_NOT_OPERATOR,
1718 PREC_LOGICAL_OR_EXPRESSION,
1719 PREC_LOGICAL_AND_EXPRESSION,
1720 PREC_INCLUSIVE_OR_EXPRESSION,
1721 PREC_EXCLUSIVE_OR_EXPRESSION,
1722 PREC_AND_EXPRESSION,
1723 PREC_EQUALITY_EXPRESSION,
1724 PREC_RELATIONAL_EXPRESSION,
1725 PREC_SHIFT_EXPRESSION,
1726 PREC_ADDITIVE_EXPRESSION,
1727 PREC_MULTIPLICATIVE_EXPRESSION,
1728 PREC_PM_EXPRESSION,
1729 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1730 };
1732 /* A mapping from a token type to a corresponding tree node type, with a
1733 precedence value. */
1736 {
1737 /* The token type. */
1739 /* The corresponding tree code. */
1741 /* The precedence of this operator. */
1746 {
1747 /* Left hand side of the binary operation we are currently
1748 parsing. */
1749 tree lhs;
1750 /* Original tree code for left hand side, if it was a binary
1751 expression itself (used for -Wparentheses). */
1753 /* Tree code for the binary operation we are parsing. */
1755 /* Precedence of the binary operation we are parsing. */
1757 /* Location of the binary operation we are parsing. */
1758 location_t loc;
1761 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1762 entries because precedence levels on the stack are monotonically
1763 increasing. */
1767 /* Prototypes. */
1769 /* Constructors and destructors. */
1774 /* Class variables. */
1778 /* The operator-precedence table used by cp_parser_binary_expression.
1779 Transformed into an associative array (binops_by_token) by
1780 cp_parser_new. */
1813 };
1815 /* The same as binops, but initialized by cp_parser_new so that
1816 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1817 for speed. */
1820 /* Constructors and destructors. */
1822 /* Construct a new context. The context below this one on the stack
1823 is given by NEXT. */
1827 {
1830 /* Allocate the storage. */
1832 {
1833 /* Pull the first entry from the free list. */
1837 }
1838 else
1841 /* No errors have occurred yet in this context. */
1843 /* If this is not the bottommost context, copy information that we
1844 need from the previous context. */
1846 {
1847 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1848 expression, then we are parsing one in this context, too. */
1850 /* Thread the stack. */
1852 }
1855 }
1857 /* Managing the unparsed function queues. */
1859 #define unparsed_funs_with_default_args \
1860 parser->unparsed_queues->last ().funs_with_default_args
1861 #define unparsed_funs_with_definitions \
1862 parser->unparsed_queues->last ().funs_with_definitions
1863 #define unparsed_nsdmis \
1864 parser->unparsed_queues->last ().nsdmis
1865 #define unparsed_classes \
1866 parser->unparsed_queues->last ().classes
1868 static void
1870 {
1873 }
1875 static void
1877 {
1880 }
1882 /* Prototypes. */
1884 /* Constructors and destructors. */
1889 /* Routines to parse various constructs.
1891 Those that return `tree' will return the error_mark_node (rather
1892 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1893 Sometimes, they will return an ordinary node if error-recovery was
1894 attempted, even though a parse error occurred. So, to check
1895 whether or not a parse error occurred, you should always use
1896 cp_parser_error_occurred. If the construct is optional (indicated
1897 either by an `_opt' in the name of the function that does the
1898 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1899 the construct is not present. */
1901 /* Lexical conventions [gram.lex] */
1903 static tree cp_parser_identifier
1905 static tree cp_parser_string_literal
1907 static tree cp_parser_userdef_char_literal
1909 static tree cp_parser_userdef_string_literal
1911 static tree cp_parser_userdef_numeric_literal
1914 /* Basic concepts [gram.basic] */
1916 static bool cp_parser_translation_unit
1919 /* Expressions [gram.expr] */
1921 static tree cp_parser_primary_expression
1923 static tree cp_parser_id_expression
1925 static tree cp_parser_unqualified_id
1927 static tree cp_parser_nested_name_specifier_opt
1929 static tree cp_parser_nested_name_specifier
1931 static tree cp_parser_qualifying_entity
1933 static tree cp_parser_postfix_expression
1935 static tree cp_parser_postfix_open_square_expression
1937 static tree cp_parser_postfix_dot_deref_expression
1941 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1943 static void cp_parser_pseudo_destructor_name
1945 static tree cp_parser_unary_expression
1947 static enum tree_code cp_parser_unary_operator
1949 static tree cp_parser_new_expression
1953 static tree cp_parser_new_type_id
1961 static tree cp_parser_delete_expression
1963 static tree cp_parser_cast_expression
1965 static tree cp_parser_binary_expression
1967 static tree cp_parser_question_colon_clause
1969 static tree cp_parser_assignment_expression
1971 static enum tree_code cp_parser_assignment_operator_opt
1973 static tree cp_parser_expression
1975 static tree cp_parser_expression
1977 static tree cp_parser_constant_expression
1979 static tree cp_parser_builtin_offsetof
1981 static tree cp_parser_lambda_expression
1983 static void cp_parser_lambda_introducer
1985 static bool cp_parser_lambda_declarator_opt
1987 static void cp_parser_lambda_body
1990 /* Statements [gram.stmt.stmt] */
1992 static void cp_parser_statement
1994 static void cp_parser_label_for_labeled_statement
1996 static tree cp_parser_expression_statement
1998 static tree cp_parser_compound_statement
2000 static void cp_parser_statement_seq_opt
2002 static tree cp_parser_selection_statement
2004 static tree cp_parser_condition
2006 static tree cp_parser_iteration_statement
2008 static bool cp_parser_for_init_statement
2010 static tree cp_parser_for
2012 static tree cp_parser_c_for
2014 static tree cp_parser_range_for
2016 static void do_range_for_auto_deduction
2018 static tree cp_parser_perform_range_for_lookup
2020 static tree cp_parser_range_for_member_function
2022 static tree cp_parser_jump_statement
2024 static void cp_parser_declaration_statement
2027 static tree cp_parser_implicitly_scoped_statement
2029 static void cp_parser_already_scoped_statement
2032 /* Declarations [gram.dcl.dcl] */
2034 static void cp_parser_declaration_seq_opt
2036 static void cp_parser_declaration
2038 static void cp_parser_block_declaration
2040 static void cp_parser_simple_declaration
2042 static void cp_parser_decl_specifier_seq
2044 static tree cp_parser_storage_class_specifier_opt
2046 static tree cp_parser_function_specifier_opt
2048 static tree cp_parser_type_specifier
2051 static tree cp_parser_simple_type_specifier
2053 static tree cp_parser_type_name
2055 static tree cp_parser_nonclass_name
2057 static tree cp_parser_elaborated_type_specifier
2059 static tree cp_parser_enum_specifier
2061 static void cp_parser_enumerator_list
2063 static void cp_parser_enumerator_definition
2065 static tree cp_parser_namespace_name
2067 static void cp_parser_namespace_definition
2069 static void cp_parser_namespace_body
2071 static tree cp_parser_qualified_namespace_specifier
2073 static void cp_parser_namespace_alias_definition
2075 static bool cp_parser_using_declaration
2077 static void cp_parser_using_directive
2079 static tree cp_parser_alias_declaration
2081 static void cp_parser_asm_definition
2083 static void cp_parser_linkage_specification
2085 static void cp_parser_static_assert
2087 static tree cp_parser_decltype
2090 /* Declarators [gram.dcl.decl] */
2092 static tree cp_parser_init_declarator
2093 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2098 static enum tree_code cp_parser_ptr_operator
2100 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2102 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2104 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2106 static tree cp_parser_late_return_type_opt
2108 static tree cp_parser_declarator_id
2110 static tree cp_parser_type_id
2112 static tree cp_parser_template_type_arg
2115 static tree cp_parser_type_id_1
2117 static void cp_parser_type_specifier_seq
2119 static tree cp_parser_parameter_declaration_clause
2121 static tree cp_parser_parameter_declaration_list
2125 static tree cp_parser_default_argument
2127 static void cp_parser_function_body
2129 static tree cp_parser_initializer
2131 static tree cp_parser_initializer_clause
2133 static tree cp_parser_braced_list
2138 static bool cp_parser_ctor_initializer_opt_and_function_body
2141 static tree cp_parser_late_parsing_omp_declare_simd
2144 static tree cp_parser_late_parsing_cilk_simd_fn_info
2147 static tree synthesize_implicit_template_parm
2149 static tree finish_fully_implicit_template
2152 /* Classes [gram.class] */
2154 static tree cp_parser_class_name
2156 static tree cp_parser_class_specifier
2158 static tree cp_parser_class_head
2160 static enum tag_types cp_parser_class_key
2162 static void cp_parser_member_specification_opt
2164 static void cp_parser_member_declaration
2166 static tree cp_parser_pure_specifier
2168 static tree cp_parser_constant_initializer
2171 /* Derived classes [gram.class.derived] */
2173 static tree cp_parser_base_clause
2175 static tree cp_parser_base_specifier
2178 /* Special member functions [gram.special] */
2180 static tree cp_parser_conversion_function_id
2182 static tree cp_parser_conversion_type_id
2186 static bool cp_parser_ctor_initializer_opt
2188 static void cp_parser_mem_initializer_list
2190 static tree cp_parser_mem_initializer
2192 static tree cp_parser_mem_initializer_id
2195 /* Overloading [gram.over] */
2197 static tree cp_parser_operator_function_id
2199 static tree cp_parser_operator
2202 /* Templates [gram.temp] */
2204 static void cp_parser_template_declaration
2206 static tree cp_parser_template_parameter_list
2208 static tree cp_parser_template_parameter
2210 static tree cp_parser_type_parameter
2212 static tree cp_parser_template_id
2214 static tree cp_parser_template_name
2216 static tree cp_parser_template_argument_list
2218 static tree cp_parser_template_argument
2220 static void cp_parser_explicit_instantiation
2222 static void cp_parser_explicit_specialization
2225 /* Exception handling [gram.exception] */
2227 static tree cp_parser_try_block
2229 static bool cp_parser_function_try_block
2231 static void cp_parser_handler_seq
2233 static void cp_parser_handler
2235 static tree cp_parser_exception_declaration
2237 static tree cp_parser_throw_expression
2239 static tree cp_parser_exception_specification_opt
2241 static tree cp_parser_type_id_list
2244 /* GNU Extensions */
2246 static tree cp_parser_asm_specification_opt
2248 static tree cp_parser_asm_operand_list
2250 static tree cp_parser_asm_clobber_list
2252 static tree cp_parser_asm_label_list
2254 static bool cp_next_tokens_can_be_attribute_p
2256 static bool cp_next_tokens_can_be_gnu_attribute_p
2258 static bool cp_next_tokens_can_be_std_attribute_p
2260 static bool cp_nth_tokens_can_be_std_attribute_p
2262 static bool cp_nth_tokens_can_be_gnu_attribute_p
2264 static bool cp_nth_tokens_can_be_attribute_p
2266 static tree cp_parser_attributes_opt
2268 static tree cp_parser_gnu_attributes_opt
2270 static tree cp_parser_gnu_attribute_list
2272 static tree cp_parser_std_attribute
2274 static tree cp_parser_std_attribute_spec
2276 static tree cp_parser_std_attribute_spec_seq
2278 static bool cp_parser_extension_opt
2280 static void cp_parser_label_declaration
2283 /* Concept Extensions */
2285 static tree cp_parser_requires_clause
2287 static tree cp_parser_requires_clause_opt
2289 static tree cp_parser_requires_expression
2291 static tree cp_parser_requirement_parameter_list
2293 static tree cp_parser_requirement_body
2295 static tree cp_parser_requirement_list
2297 static tree cp_parser_requirement
2299 static tree cp_parser_simple_requirement
2301 static tree cp_parser_compound_requirement
2303 static tree cp_parser_type_requirement
2305 static tree cp_parser_nested_requirement
2307 static tree cp_parser_constexpr_constraint_spec
2309 static tree cp_parser_noexcept_constraint_spec
2311 static tree cp_parser_constraint_spec
2313 static tree cp_parser_constraint_specifier_seq
2316 /* Transactional Memory Extensions */
2318 static tree cp_parser_transaction
2320 static tree cp_parser_transaction_expression
2322 static bool cp_parser_function_transaction
2324 static tree cp_parser_transaction_cancel
2328 pragma_external,
2329 pragma_member,
2330 pragma_objc_icode,
2331 pragma_stmt,
2332 pragma_compound
2333 };
2334 static bool cp_parser_pragma
2337 /* Objective-C++ Productions */
2339 static tree cp_parser_objc_message_receiver
2341 static tree cp_parser_objc_message_args
2343 static tree cp_parser_objc_message_expression
2345 static tree cp_parser_objc_encode_expression
2347 static tree cp_parser_objc_defs_expression
2349 static tree cp_parser_objc_protocol_expression
2351 static tree cp_parser_objc_selector_expression
2353 static tree cp_parser_objc_expression
2355 static bool cp_parser_objc_selector_p
2357 static tree cp_parser_objc_selector
2359 static tree cp_parser_objc_protocol_refs_opt
2361 static void cp_parser_objc_declaration
2363 static tree cp_parser_objc_statement
2365 static bool cp_parser_objc_valid_prefix_attributes
2367 static void cp_parser_objc_at_property_declaration
2369 static void cp_parser_objc_at_synthesize_declaration
2371 static void cp_parser_objc_at_dynamic_declaration
2373 static tree cp_parser_objc_struct_declaration
2376 /* Utility Routines */
2378 static tree cp_parser_lookup_name
2380 static tree cp_parser_lookup_name_simple
2382 static tree cp_parser_maybe_treat_template_as_class
2384 static bool cp_parser_check_declarator_template_parameters
2386 static bool cp_parser_check_template_parameters
2388 static tree cp_parser_simple_cast_expression
2390 static tree cp_parser_global_scope_opt
2392 static bool cp_parser_constructor_declarator_p
2394 static tree cp_parser_function_definition_from_specifiers_and_declarator
2396 static tree cp_parser_function_definition_after_declarator
2398 static void cp_parser_template_declaration_after_export
2400 static void cp_parser_perform_template_parameter_access_checks
2402 static tree cp_parser_single_declaration
2404 static tree cp_parser_functional_cast
2406 static tree cp_parser_save_member_function_body
2408 static tree cp_parser_save_nsdmi
2410 static tree cp_parser_enclosed_template_argument_list
2412 static void cp_parser_save_default_args
2414 static void cp_parser_late_parsing_for_member
2416 static tree cp_parser_late_parse_one_default_arg
2418 static void cp_parser_late_parsing_nsdmi
2420 static void cp_parser_late_parsing_default_args
2422 static tree cp_parser_sizeof_operand
2424 static tree cp_parser_trait_expr
2426 static bool cp_parser_declares_only_class_p
2428 static void cp_parser_set_storage_class
2430 static void cp_parser_set_decl_spec_type
2432 static void set_and_check_decl_spec_loc
2435 static bool cp_parser_friend_p
2437 static void cp_parser_required_error
2443 static bool cp_parser_token_starts_function_definition_p
2445 static bool cp_parser_next_token_starts_class_definition_p
2447 static bool cp_parser_next_token_ends_template_argument_p
2449 static bool cp_parser_nth_token_starts_template_argument_list_p
2451 static enum tag_types cp_parser_token_is_class_key
2453 static void cp_parser_check_class_key
2455 static void cp_parser_check_access_in_redeclaration
2457 static bool cp_parser_optional_template_keyword
2459 static void cp_parser_pre_parsed_nested_name_specifier
2461 static bool cp_parser_cache_group
2463 static tree cp_parser_cache_defarg
2465 static void cp_parser_parse_tentatively
2467 static void cp_parser_commit_to_tentative_parse
2469 static void cp_parser_commit_to_topmost_tentative_parse
2471 static void cp_parser_abort_tentative_parse
2473 static bool cp_parser_parse_definitely
2477 static bool cp_parser_uncommitted_to_tentative_parse_p
2479 static void cp_parser_error
2481 static void cp_parser_name_lookup_error
2483 static bool cp_parser_simulate_error
2485 static bool cp_parser_check_type_definition
2487 static void cp_parser_check_for_definition_in_return_type
2489 static void cp_parser_check_for_invalid_template_id
2491 static bool cp_parser_non_integral_constant_expression
2493 static void cp_parser_diagnose_invalid_type_name
2495 static bool cp_parser_parse_and_diagnose_invalid_type_name
2497 static int cp_parser_skip_to_closing_parenthesis
2499 static void cp_parser_skip_to_end_of_statement
2501 static void cp_parser_consume_semicolon_at_end_of_statement
2503 static void cp_parser_skip_to_end_of_block_or_statement
2505 static bool cp_parser_skip_to_closing_brace
2507 static void cp_parser_skip_to_end_of_template_parameter_list
2509 static void cp_parser_skip_to_pragma_eol
2511 static bool cp_parser_error_occurred
2513 static bool cp_parser_allow_gnu_extensions_p
2515 static bool cp_parser_is_pure_string_literal
2517 static bool cp_parser_is_string_literal
2519 static bool cp_parser_is_keyword
2521 static tree cp_parser_make_typename_type
2528 // -------------------------------------------------------------------------- //
2529 // Unevaluated Operand Guard
2530 //
2531 // Implementation of an RAII helper for unevaluated operand parsing.
2533 {
2536 }
2539 {
2542 }
2544 // -------------------------------------------------------------------------- //
2545 // Tentative Parsing
2547 /* Returns nonzero if we are parsing tentatively. */
2551 {
2553 }
2555 /* Returns nonzero if TOKEN is a string literal. */
2557 static bool
2559 {
2565 }
2567 /* Returns nonzero if TOKEN is a string literal
2568 of a user-defined string literal. */
2570 static bool
2572 {
2579 }
2581 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2583 static bool
2585 {
2587 }
2589 /* If not parsing tentatively, issue a diagnostic of the form
2590 FILE:LINE: MESSAGE before TOKEN
2591 where TOKEN is the next token in the input stream. MESSAGE
2592 (specified by the caller) is usually of the form "expected
2593 OTHER-TOKEN". */
2595 static void
2597 {
2599 {
2601 /* This diagnostic makes more sense if it is tagged to the line
2602 of the token we just peeked at. */
2606 {
2611 }
2614 /* Because c_parser_error does not understand
2615 CPP_KEYWORD, keywords are treated like
2616 identifiers. */
2619 }
2620 }
2622 /* Issue an error about name-lookup failing. NAME is the
2623 IDENTIFIER_NODE DECL is the result of
2624 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2625 the thing that we hoped to find. */
2627 static void
2629 tree name,
2630 tree decl,
2631 name_lookup_error desired,
2632 location_t location)
2633 {
2634 /* If name lookup completely failed, tell the user that NAME was not
2635 declared. */
2637 {
2650 else
2652 }
2654 {
2656 {
2673 }
2674 }
2676 {
2678 {
2688 name);
2692 }
2693 }
2694 else
2695 {
2697 {
2710 }
2711 }
2712 }
2714 /* If we are parsing tentatively, remember that an error has occurred
2715 during this tentative parse. Returns true if the error was
2716 simulated; false if a message should be issued by the caller. */
2718 static bool
2720 {
2722 {
2725 }
2727 }
2729 /* This function is called when a type is defined. If type
2730 definitions are forbidden at this point, an error message is
2731 issued. */
2733 static bool
2735 {
2736 /* If types are forbidden here, issue a message. */
2738 {
2739 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2740 in the message need to be interpreted. */
2743 }
2745 }
2747 /* This function is called when the DECLARATOR is processed. The TYPE
2748 was a type defined in the decl-specifiers. If it is invalid to
2749 define a type in the decl-specifiers for DECLARATOR, an error is
2750 issued. TYPE_LOCATION is the location of TYPE and is used
2751 for error reporting. */
2753 static void
2756 {
2757 /* [dcl.fct] forbids type definitions in return types.
2758 Unfortunately, it's not easy to know whether or not we are
2759 processing a return type until after the fact. */
2767 {
2772 type);
2773 }
2774 }
2776 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2777 "<" in any valid C++ program. If the next token is indeed "<",
2778 issue a message warning the user about what appears to be an
2779 invalid attempt to form a template-id. LOCATION is the location
2780 of the type-specifier (TYPE) */
2782 static void
2784 tree type,
2786 location_t location)
2787 {
2791 {
2795 {
2798 else
2800 }
2801 else
2803 /* Remember the location of the invalid "<". */
2806 /* Consume the "<". */
2808 /* Parse the template arguments. */
2810 /* Permanently remove the invalid template arguments so that
2811 this error message is not issued again. */
2814 }
2815 }
2817 /* If parsing an integral constant-expression, issue an error message
2818 about the fact that THING appeared and return true. Otherwise,
2819 return false. In either case, set
2820 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2822 static bool
2824 non_integral_constant thing)
2825 {
2828 {
2830 {
2833 {
2840 "enumeration type cannot appear in a "
2931 }
2935 }
2936 }
2938 }
2940 /* Emit a diagnostic for an invalid type name. SCOPE is the
2941 qualifying scope (or NULL, if none) for ID. This function commits
2942 to the current active tentative parse, if any. (Otherwise, the
2943 problematic construct might be encountered again later, resulting
2944 in duplicate error messages.) LOCATION is the location of ID. */
2946 static void
2949 location_t location)
2950 {
2953 /* Try to lookup the identifier. */
2963 /* If the lookup was ambiguous, an error will already have
2964 been issued. */
2966 /* If the lookup found a template-name, it means that the user forgot
2967 to specify an argument list. Emit a useful error message. */
2971 decl);
2975 /* Something like 'unsigned A a;' */
2978 {
2979 /* Issue an error message. */
2981 /* If we're in a template class, it's possible that the user was
2982 referring to a type from a base class. For example:
2984 template <typename T> struct A { typedef T X; };
2985 template <typename T> struct B : public A<T> { X x; };
2987 The user should have said "typename A<T>::X". */
3000 {
3001 tree b;
3004 b;
3006 {
3010 {
3011 tree field;
3012 /* Go from a particular instantiation of the
3013 template (which will have an empty TYPE_FIELDs),
3014 to the main version. */
3017 field;
3021 {
3026 }
3029 }
3030 }
3031 }
3032 }
3033 /* Here we diagnose qualified-ids where the scope is actually correct,
3034 but the identifier does not resolve to a valid type name. */
3036 {
3038 {
3043 else
3047 }
3050 {
3051 /* A<T>::A<T>() */
3057 }
3064 {
3069 else
3073 }
3074 else
3076 }
3077 }
3079 /* Check for a common situation where a type-name should be present,
3080 but is not, and issue a sensible error message. Returns true if an
3081 invalid type-name was detected.
3083 The situation handled by this function are variable declarations of the
3084 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3085 Usually, `ID' should name a type, but if we got here it means that it
3086 does not. We try to emit the best possible error message depending on
3087 how exactly the id-expression looks like. */
3089 static bool
3091 {
3092 tree id;
3095 /* Avoid duplicate error about ambiguous lookup. */
3097 {
3101 }
3110 /* If the next token is a (, this is a function with no explicit return
3111 type, i.e. constructor, destructor or conversion op. */
3114 {
3117 }
3121 /* Emit a diagnostic for the invalid type. */
3124 out:
3125 /* If we aren't in the middle of a declarator (i.e. in a
3126 parameter-declaration-clause), skip to the end of the declaration;
3127 there's no point in trying to process it. */
3131 }
3133 /* Consume tokens up to, and including, the next non-nested closing `)'.
3134 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3135 are doing error recovery. Returns -1 if OR_COMMA is true and we
3136 found an unnested comma. */
3138 static int
3143 {
3153 {
3157 {
3160 /* If we've run out of tokens, then there is no closing `)'. */
3163 /* This is good for lambda expression capture-lists. */
3173 /* This matches the processing in skip_to_end_of_statement. */
3199 {
3203 }
3208 }
3210 /* Consume the token. */
3212 }
3213 }
3215 /* Consume tokens until we reach the end of the current statement.
3216 Normally, that will be just before consuming a `;'. However, if a
3217 non-nested `}' comes first, then we stop before consuming that. */
3219 static void
3221 {
3224 /* Unwind generic function template scope if necessary. */
3229 {
3233 {
3236 /* If we've run out of tokens, stop. */
3240 /* If the next token is a `;', we have reached the end of the
3241 statement. */
3247 /* If this is a non-nested '}', stop before consuming it.
3248 That way, when confronted with something like:
3250 { 3 + }
3252 we stop before consuming the closing '}', even though we
3253 have not yet reached a `;'. */
3257 /* If it is the closing '}' for a block that we have
3258 scanned, stop -- but only after consuming the token.
3259 That way given:
3261 void f g () { ... }
3262 typedef int I;
3264 we will stop after the body of the erroneously declared
3265 function, but before consuming the following `typedef'
3266 declaration. */
3268 {
3271 }
3279 }
3281 /* Consume the token. */
3283 }
3284 }
3286 /* This function is called at the end of a statement or declaration.
3287 If the next token is a semicolon, it is consumed; otherwise, error
3288 recovery is attempted. */
3290 static void
3292 {
3293 /* Look for the trailing `;'. */
3295 {
3296 /* If there is additional (erroneous) input, skip to the end of
3297 the statement. */
3299 /* If the next token is now a `;', consume it. */
3302 }
3303 }
3305 /* Skip tokens until we have consumed an entire block, or until we
3306 have consumed a non-nested `;'. */
3308 static void
3310 {
3313 /* Unwind generic function template scope if necessary. */
3318 {
3322 {
3325 /* If we've run out of tokens, stop. */
3329 /* Stop if this is an unnested ';'. */
3335 /* Stop if this is an unnested '}', or closes the outermost
3336 nesting level. */
3337 nesting_depth--;
3345 /* Nest. */
3346 nesting_depth++;
3351 }
3353 /* Consume the token. */
3355 }
3356 }
3358 /* Skip tokens until a non-nested closing curly brace is the next
3359 token, or there are no more tokens. Return true in the first case,
3360 false otherwise. */
3362 static bool
3364 {
3368 {
3372 {
3375 /* If we've run out of tokens, stop. */
3379 /* If the next token is a non-nested `}', then we have reached
3380 the end of the current block. */
3386 /* If it the next token is a `{', then we are entering a new
3387 block. Consume the entire block. */
3393 }
3395 /* Consume the token. */
3397 }
3398 }
3400 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3401 parameter is the PRAGMA token, allowing us to purge the entire pragma
3402 sequence. */
3404 static void
3406 {
3411 do
3415 /* Ensure that the pragma is not parsed again. */
3417 }
3419 /* Require pragma end of line, resyncing with it as necessary. The
3420 arguments are as for cp_parser_skip_to_pragma_eol. */
3422 static void
3424 {
3428 }
3430 /* This is a simple wrapper around make_typename_type. When the id is
3431 an unresolved identifier node, we can provide a superior diagnostic
3432 using cp_parser_diagnose_invalid_type_name. */
3434 static tree
3437 {
3438 tree result;
3440 {
3446 }
3448 }
3450 /* This is a wrapper around the
3451 make_{pointer,ptrmem,reference}_declarator functions that decides
3452 which one to call based on the CODE and CLASS_TYPE arguments. The
3453 CODE argument should be one of the values returned by
3454 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3455 appertain to the pointer or reference. */
3459 cp_cv_quals cv_qualifiers,
3461 tree attributes)
3462 {
3469 else
3479 }
3481 /* Create a new C++ parser. */
3485 {
3490 /* cp_lexer_new_main is called before doing GC allocation because
3491 cp_lexer_new_main might load a PCH file. */
3494 /* Initialize the binops_by_token so that we can get the tree
3495 directly from the token. */
3503 /* For now, we always accept GNU extensions. */
3506 /* The `>' token is a greater-than operator, not the end of a
3507 template-id. */
3512 /* We are not parsing a constant-expression. */
3517 /* Local variable names are not forbidden. */
3520 /* We are not processing an `extern "C"' declaration. */
3523 /* We are not processing a declarator. */
3526 /* We are not processing a template-argument-list. */
3529 /* We are not in an iteration statement. */
3532 /* We are not in a switch statement. */
3535 /* We are not parsing a type-id inside an expression. */
3538 /* Declarations aren't implicitly extern "C". */
3541 /* String literals should be translated to the execution character set. */
3544 /* We are not parsing a function body. */
3547 /* We can correct until told otherwise. */
3550 /* The unparsed function queue is empty. */
3553 /* There are no classes being defined. */
3556 /* No template parameters apply. */
3559 /* Not declaring an implicit function template. */
3566 }
3568 /* Create a cp_lexer structure which will emit the tokens in CACHE
3569 and push it onto the parser's lexer stack. This is used for delayed
3570 parsing of in-class method bodies and default arguments, and should
3571 not be confused with tentative parsing. */
3572 static void
3574 {
3579 /* Move the current source position to that of the first token in the
3580 new lexer. */
3582 }
3584 /* Pop the top lexer off the parser stack. This is never used for the
3585 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3586 static void
3588 {
3593 /* Put the current source position back where it was before this
3594 lexer was pushed. */
3596 }
3598 /* Lexical conventions [gram.lex] */
3600 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3601 identifier. */
3603 static tree
3605 {
3608 /* Look for the identifier. */
3610 /* Return the value. */
3612 }
3614 /* Parse a sequence of adjacent string constants. Returns a
3615 TREE_STRING representing the combined, nul-terminated string
3616 constant. If TRANSLATE is true, translate the string to the
3617 execution character set. If WIDE_OK is true, a wide string is
3618 invalid here.
3620 C++98 [lex.string] says that if a narrow string literal token is
3621 adjacent to a wide string literal token, the behavior is undefined.
3622 However, C99 6.4.5p4 says that this results in a wide string literal.
3623 We follow C99 here, for consistency with the C front end.
3625 This code is largely lifted from lex_string() in c-lex.c.
3627 FUTURE: ObjC++ will need to handle @-strings here. */
3628 static tree
3630 {
3631 tree value;
3638 tree string_tree;
3644 {
3647 }
3650 {
3654 }
3655 else
3656 {
3659 }
3662 /* Try to avoid the overhead of creating and destroying an obstack
3663 for the common case of just one string. */
3666 {
3674 {
3678 }
3679 else
3683 }
3684 else
3685 {
3689 do
3690 {
3692 count++;
3697 {
3700 {
3703 }
3706 {
3711 }
3713 }
3714 else
3718 {
3723 "unsupported non-standard concatenation "
3725 }
3731 {
3735 }
3736 else
3737 {
3741 }
3742 }
3746 }
3749 {
3752 }
3756 {
3761 {
3776 }
3781 {
3786 }
3787 }
3788 else
3789 /* cpp_interpret_string has issued an error. */
3796 }
3798 /* Look up a literal operator with the name and the exact arguments. */
3800 static tree
3802 {
3809 {
3815 {
3818 {
3828 }
3831 /* May be this should be sufficient_parms_p instead,
3832 depending on how exactly should user-defined literals
3833 work in presence of default arguments on the literal
3834 operator parameters. */
3837 }
3838 }
3841 }
3843 /* Parse a user-defined char constant. Returns a call to a user-defined
3844 literal operator taking the character as an argument. */
3846 static tree
3848 {
3856 /* Build up a call to the user-defined operator */
3857 /* Lookup the name we got back from the id-expression. */
3862 {
3867 }
3876 }
3878 /* A subroutine of cp_parser_userdef_numeric_literal to
3879 create a char... template parameter pack from a string node. */
3881 static tree
3883 {
3884 tree charvec;
3890 /* Fill in CHARVEC with all of the parameters. */
3895 /* Build the argument packs. */
3902 }
3904 /* A subroutine of cp_parser_userdef_numeric_literal to
3905 create a char... template parameter pack from a string node. */
3907 static tree
3909 {
3910 tree charvec;
3921 /* First template parm is character type. */
3924 /* Fill in CHARVEC with all of the parameters. */
3931 /* Build the argument packs. */
3938 }
3940 /* Parse a user-defined numeric constant. returns a call to a user-defined
3941 literal operator. */
3943 static tree
3945 {
3956 /* Look for a literal operator taking the exact type of numeric argument
3957 as the literal value. */
3962 {
3965 {
3969 long_long_unsigned_type_node);
3970 else
3971 {
3975 long_double_type_node);
3979 }
3982 }
3983 }
3986 /* If the numeric argument didn't work, look for a raw literal
3987 operator taking a const char* argument consisting of the number
3988 in string format. */
3993 {
3996 {
3999 }
4000 }
4003 /* If the raw literal didn't work, look for a non-type template
4004 function with parameter pack char.... Call the function with
4005 template parameter characters representing the number. */
4009 {
4014 {
4017 }
4018 }
4026 }
4028 /* Parse a user-defined string constant. Returns a call to a user-defined
4029 literal operator taking a character pointer and the length of the string
4030 as arguments. */
4032 static tree
4034 {
4044 /* Look for a template function with typename parameter CharT
4045 and parameter pack CharT... Call the function with
4046 template parameter characters representing the string. */
4050 {
4055 {
4058 }
4059 }
4062 /* Build up a call to the user-defined operator */
4063 /* Lookup the name we got back from the id-expression. */
4069 {
4073 }
4082 }
4085 /* Basic concepts [gram.basic] */
4087 /* Parse a translation-unit.
4089 translation-unit:
4090 declaration-seq [opt]
4092 Returns TRUE if all went well. */
4094 static bool
4096 {
4097 /* The address of the first non-permanent object on the declarator
4098 obstack. */
4103 /* Create the declarator obstack, if necessary. */
4105 {
4107 /* Create the error declarator. */
4109 /* Create the empty parameter list. */
4111 /* Remember where the base of the declarator obstack lies. */
4113 }
4117 /* If there are no tokens left then all went well. */
4119 {
4120 /* Get rid of the token array; we don't need it any more. */
4124 /* This file might have been a context that's implicitly extern
4125 "C". If so, pop the lang context. (Only relevant for PCH.) */
4127 {
4130 }
4132 /* Finish up. */
4136 }
4137 else
4138 {
4141 }
4143 /* Make sure the declarator obstack was fully cleaned up. */
4147 /* All went well. */
4149 }
4151 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4152 decltype context. */
4156 {
4161 }
4163 /* Expressions [gram.expr] */
4165 /* Parse a primary-expression.
4167 primary-expression:
4168 literal
4169 this
4170 ( expression )
4171 id-expression
4173 GNU Extensions:
4175 primary-expression:
4176 ( compound-statement )
4177 __builtin_va_arg ( assignment-expression , type-id )
4178 __builtin_offsetof ( type-id , offsetof-expression )
4180 C++ Extensions:
4181 __has_nothrow_assign ( type-id )
4182 __has_nothrow_constructor ( type-id )
4183 __has_nothrow_copy ( type-id )
4184 __has_trivial_assign ( type-id )
4185 __has_trivial_constructor ( type-id )
4186 __has_trivial_copy ( type-id )
4187 __has_trivial_destructor ( type-id )
4188 __has_virtual_destructor ( type-id )
4189 __is_abstract ( type-id )
4190 __is_base_of ( type-id , type-id )
4191 __is_class ( type-id )
4192 __is_convertible_to ( type-id , type-id )
4193 __is_empty ( type-id )
4194 __is_enum ( type-id )
4195 __is_final ( type-id )
4196 __is_literal_type ( type-id )
4197 __is_pod ( type-id )
4198 __is_polymorphic ( type-id )
4199 __is_std_layout ( type-id )
4200 __is_trivial ( type-id )
4201 __is_union ( type-id )
4203 Objective-C++ Extension:
4205 primary-expression:
4206 objc-expression
4208 literal:
4209 __null
4211 ADDRESS_P is true iff this expression was immediately preceded by
4212 "&" and therefore might denote a pointer-to-member. CAST_P is true
4213 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4214 true iff this expression is a template argument.
4216 Returns a representation of the expression. Upon return, *IDK
4217 indicates what kind of id-expression (if any) was present. */
4219 static tree
4226 {
4229 /* Assume the primary expression is not an id-expression. */
4232 /* Peek at the next token. */
4235 {
4236 /* literal:
4237 integer-literal
4238 character-literal
4239 floating-literal
4240 string-literal
4241 boolean-literal
4242 pointer-literal
4243 user-defined-literal */
4253 {
4257 }
4258 /* Floating-point literals are only allowed in an integral
4259 constant expression if they are cast to an integral or
4260 enumeration type. */
4264 {
4265 /* CAST_P will be set even in invalid code like "int(2.7 +
4266 ...)". Therefore, we have to check that the next token
4267 is sure to end the cast. */
4269 {
4274 enumerator-definition. */
4276 /* The curly brace at the end of an enum-specifier. */
4278 /* The end of a statement. */
4280 /* The end of the cast-expression. */
4282 /* The end of an array bound. */
4284 /* The closing ">" in a template-argument-list. */
4287 /* C++0x only: A ">>" treated like two ">" tokens,
4288 in a template-argument-list. */
4293 }
4295 /* If we are within a cast, then the constraint that the
4296 cast is to an integral or enumeration type will be
4297 checked at that point. If we are not within a cast, then
4298 this code is invalid. */
4301 }
4320 /* ??? Should wide strings be allowed when parser->translate_strings_p
4321 is false (i.e. in attributes)? If not, we can kill the third
4322 argument to cp_parser_string_literal. */
4328 {
4329 tree expr;
4332 /* Consume the `('. */
4334 /* Within a parenthesized expression, a `>' token is always
4335 the greater-than operator. */
4336 saved_greater_than_is_operator_p
4339 /* If we see `( { ' then we are looking at the beginning of
4340 a GNU statement-expression. */
4343 {
4344 /* Statement-expressions are not allowed by the standard. */
4348 /* And they're not allowed outside of a function-body; you
4349 cannot, for example, write:
4351 int i = ({ int j = 3; j + 1; });
4353 at class or namespace scope. */
4356 {
4358 "statement-expressions are not allowed outside "
4362 }
4363 else
4364 {
4365 /* Start the statement-expression. */
4367 /* Parse the compound-statement. */
4369 /* Finish up. */
4371 }
4372 }
4373 else
4374 {
4375 /* Parse the parenthesized expression. */
4377 /* Let the front end know that this expression was
4378 enclosed in parentheses. This matters in case, for
4379 example, the expression is of the form `A::B', since
4380 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4381 not. */
4383 /* DR 705: Wrapping an unqualified name in parentheses
4384 suppresses arg-dependent lookup. We want to pass back
4385 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4386 (c++/37862), but none of the others. */
4389 }
4390 /* The `>' token might be the end of a template-id or
4391 template-parameter-list now. */
4392 parser->greater_than_is_operator_p
4394 /* Consume the `)'. */
4399 }
4403 /* We have an Objective-C++ message. */
4405 {
4407 /* Don't warn about a failed tentative parse. */
4412 }
4416 /* We have an Objective-C++ string literal. */
4423 {
4424 /* These two are the boolean literals. */
4432 /* The `__null' literal. */
4437 /* The `nullptr' literal. */
4442 /* Recognize the `this' keyword. */
4446 {
4450 }
4451 /* Pointers cannot appear in constant-expressions. */
4456 /* The `operator' keyword can be the beginning of an
4457 id-expression. */
4464 {
4465 non_integral_constant name;
4467 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4468 __func__ are the names of variables -- but they are
4469 treated specially. Therefore, they are handled here,
4470 rather than relying on the generic id-expression logic
4471 below. Grammatically, these names are id-expressions.
4473 Consume the token. */
4477 {
4489 }
4494 /* Look up the name. */
4496 }
4499 {
4500 tree expression;
4501 tree type;
4502 source_location type_location;
4504 /* The `__builtin_va_arg' construct is used to handle
4505 `va_arg'. Consume the `__builtin_va_arg' token. */
4507 /* Look for the opening `('. */
4509 /* Now, parse the assignment-expression. */
4512 /* Look for the `,'. */
4515 /* Parse the type-id. */
4517 /* Look for the closing `)'. */
4519 /* Using `va_arg' in a constant-expression is not
4520 allowed. */
4522 NIC_VA_ARG))
4525 }
4554 // C++ concepts
4558 /* Objective-C++ expressions. */
4568 {
4573 }
4577 }
4579 /* An id-expression can start with either an identifier, a
4580 `::' as the beginning of a qualified-id, or the "operator"
4581 keyword. */
4586 {
4587 tree id_expression;
4588 tree decl;
4594 id_expression:
4595 /* Parse the id-expression. */
4596 id_expression
4613 /* If we have a template-id, then no further lookup is
4614 required. If the template-id was for a template-class, we
4615 will sometimes have a TYPE_DECL at this point. */
4619 /* Look up the name. */
4620 else
4621 {
4622 tree ambiguous_decls;
4624 /* If we already know that this lookup is ambiguous, then
4625 we've already issued an error message; there's no reason
4626 to check again. */
4629 {
4632 }
4635 none_type,
4636 template_p,
4641 /* If the lookup was ambiguous, an error will already have
4642 been issued. */
4646 /* In Objective-C++, we may have an Objective-C 2.0
4647 dot-syntax for classes here. */
4652 {
4653 tree component;
4660 }
4662 /* In Objective-C++, an instance variable (ivar) may be preferred
4663 to whatever cp_parser_lookup_name() found. */
4666 /* If name lookup gives us a SCOPE_REF, then the
4667 qualifying scope was dependent. */
4669 {
4670 /* At this point, we do not know if DECL is a valid
4671 integral constant expression. We assume that it is
4672 in fact such an expression, so that code like:
4674 template <int N> struct A {
4675 int a[B<N>::i];
4676 };
4678 is accepted. At template-instantiation time, we
4679 will check that B<N>::i is actually a constant. */
4681 }
4682 /* Check to see if DECL is a local variable in a context
4683 where that is forbidden. */
4686 {
4687 /* It might be that we only found DECL because we are
4688 trying to be generous with pre-ISO scoping rules.
4689 For example, consider:
4691 int i;
4692 void g() {
4693 for (int i = 0; i < 10; ++i) {}
4694 extern void f(int j = i);
4695 }
4697 Here, name look up will originally find the out
4698 of scope `i'. We need to issue a warning message,
4699 but then use the global `i'. */
4702 {
4705 decl);
4707 }
4708 }
4709 }
4711 decl = (finish_id_expression
4713 idk,
4718 template_arg_p,
4724 }
4726 /* Anything else is an error. */
4730 }
4731 }
4739 {
4742 }
4744 /* Parse an id-expression.
4746 id-expression:
4747 unqualified-id
4748 qualified-id
4750 qualified-id:
4751 :: [opt] nested-name-specifier template [opt] unqualified-id
4752 :: identifier
4753 :: operator-function-id
4754 :: template-id
4756 Return a representation of the unqualified portion of the
4757 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4758 a `::' or nested-name-specifier.
4760 Often, if the id-expression was a qualified-id, the caller will
4761 want to make a SCOPE_REF to represent the qualified-id. This
4762 function does not do this in order to avoid wastefully creating
4763 SCOPE_REFs when they are not required.
4765 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4766 `template' keyword.
4768 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4769 uninstantiated templates.
4771 If *TEMPLATE_P is non-NULL, it is set to true iff the
4772 `template' keyword is used to explicitly indicate that the entity
4773 named is a template.
4775 If DECLARATOR_P is true, the id-expression is appearing as part of
4776 a declarator, rather than as part of an expression. */
4778 static tree
4785 {
4789 /* Assume the `template' keyword was not used. */
4793 /* Look for the optional `::' operator. */
4794 global_scope_p
4797 /* Look for the optional nested-name-specifier. */
4798 nested_name_specifier_p
4801 check_dependency_p,
4803 declarator_p)
4805 /* If there is a nested-name-specifier, then we are looking at
4806 the first qualified-id production. */
4808 {
4809 tree saved_scope;
4810 tree saved_object_scope;
4811 tree saved_qualifying_scope;
4812 tree unqualified_id;
4815 /* See if the next token is the `template' keyword. */
4819 /* Name lookup we do during the processing of the
4820 unqualified-id might obliterate SCOPE. */
4824 /* Process the final unqualified-id. */
4826 check_dependency_p,
4827 declarator_p,
4829 /* Restore the SAVED_SCOPE for our caller. */
4835 }
4836 /* Otherwise, if we are in global scope, then we are looking at one
4837 of the other qualified-id productions. */
4839 {
4841 tree id;
4843 /* Peek at the next token. */
4846 /* If it's an identifier, and the next token is not a "<", then
4847 we can avoid the template-id case. This is an optimization
4848 for this common case. */
4850 && !cp_parser_nth_token_starts_template_argument_list_p
4855 /* Try a template-id. */
4859 none_type,
4860 declarator_p);
4861 /* If that worked, we're done. */
4865 /* Peek at the next token. (Changes in the token buffer may
4866 have invalidated the pointer obtained above.) */
4870 {
4877 /* Fall through. */
4882 }
4883 }
4884 else
4887 declarator_p,
4888 optional_p);
4889 }
4891 /* Parse an unqualified-id.
4893 unqualified-id:
4894 identifier
4895 operator-function-id
4896 conversion-function-id
4897 ~ class-name
4898 template-id
4900 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4901 keyword, in a construct like `A::template ...'.
4903 Returns a representation of unqualified-id. For the `identifier'
4904 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4905 production a BIT_NOT_EXPR is returned; the operand of the
4906 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4907 other productions, see the documentation accompanying the
4908 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4909 names are looked up in uninstantiated templates. If DECLARATOR_P
4910 is true, the unqualified-id is appearing as part of a declarator,
4911 rather than as part of an expression. */
4913 static tree
4919 {
4922 /* Peek at the next token. */
4926 {
4928 {
4929 tree id;
4931 /* We don't know yet whether or not this will be a
4932 template-id. */
4934 /* Try a template-id. */
4936 check_dependency_p,
4937 none_type,
4938 declarator_p);
4939 /* If it worked, we're done. */
4942 /* Otherwise, it's an ordinary identifier. */
4944 }
4948 check_dependency_p,
4949 none_type,
4950 declarator_p);
4953 {
4954 tree type_decl;
4955 tree qualifying_scope;
4956 tree object_scope;
4957 tree scope;
4960 /* Consume the `~' token. */
4962 /* Parse the class-name. The standard, as written, seems to
4963 say that:
4965 template <typename T> struct S { ~S (); };
4966 template <typename T> S<T>::~S() {}
4968 is invalid, since `~' must be followed by a class-name, but
4969 `S<T>' is dependent, and so not known to be a class.
4970 That's not right; we need to look in uninstantiated
4971 templates. A further complication arises from:
4973 template <typename T> void f(T t) {
4974 t.T::~T();
4975 }
4977 Here, it is not possible to look up `T' in the scope of `T'
4978 itself. We must look in both the current scope, and the
4979 scope of the containing complete expression.
4981 Yet another issue is:
4983 struct S {
4984 int S;
4985 ~S();
4986 };
4988 S::~S() {}
4990 The standard does not seem to say that the `S' in `~S'
4991 should refer to the type `S' and not the data member
4992 `S::S'. */
4994 /* DR 244 says that we look up the name after the "~" in the
4995 same scope as we looked up the qualifying name. That idea
4996 isn't fully worked out; it's more complicated than that. */
5001 /* Check for invalid scopes. */
5003 {
5007 }
5009 {
5013 scope);
5018 }
5021 /* If the name is of the form "X::~X" it's OK even if X is a
5022 typedef. */
5031 {
5034 }
5036 /* ~auto means the destructor of whatever the object is. */
5038 {
5041 "%<~auto%> only available with "
5045 }
5047 /* If there was an explicit qualification (S::~T), first look
5048 in the scope given by the qualification (i.e., S).
5050 Note: in the calls to cp_parser_class_name below we pass
5051 typename_type so that lookup finds the injected-class-name
5052 rather than the constructor. */
5056 {
5061 typename_type,
5064 declarator_p);
5067 }
5068 /* In "N::S::~S", look in "N" as well. */
5070 {
5075 type_decl
5079 typename_type,
5082 declarator_p);
5085 }
5086 /* In "p->S::~T", look in the scope given by "*p" as well. */
5088 {
5093 type_decl
5097 typename_type,
5100 declarator_p);
5103 }
5104 /* Look in the surrounding context. */
5106 {
5112 type_decl
5116 typename_type,
5119 declarator_p);
5122 {
5123 /* We couldn't find a type with this name, so just accept
5124 it and check for a match at instantiation time. */
5129 }
5130 }
5131 /* If an error occurred, assume that the name of the
5132 destructor is the same as the name of the qualifying
5133 class. That allows us to keep parsing after running
5134 into ill-formed destructor names. */
5140 /* Check that destructor name and scope match. */
5142 {
5149 }
5151 /* [class.dtor]
5153 A typedef-name that names a class shall not be used as the
5154 identifier in the declarator for a destructor declaration. */
5161 type_decl);
5164 }
5168 {
5169 tree id;
5171 /* This could be a template-id, so we try that first. */
5173 /* Try a template-id. */
5176 none_type,
5177 declarator_p);
5178 /* If that worked, we're done. */
5181 /* We still don't know whether we're looking at an
5182 operator-function-id or a conversion-function-id. */
5184 /* Try an operator-function-id. */
5186 /* If that didn't work, try a conversion-function-id. */
5190 {
5191 /* 17.6.3.3.5 */
5197 }
5200 }
5201 /* Fall through. */
5208 }
5209 }
5211 /* Parse an (optional) nested-name-specifier.
5213 nested-name-specifier: [C++98]
5214 class-or-namespace-name :: nested-name-specifier [opt]
5215 class-or-namespace-name :: template nested-name-specifier [opt]
5217 nested-name-specifier: [C++0x]
5218 type-name ::
5219 namespace-name ::
5220 nested-name-specifier identifier ::
5221 nested-name-specifier template [opt] simple-template-id ::
5223 PARSER->SCOPE should be set appropriately before this function is
5224 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5225 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5226 in name lookups.
5228 Sets PARSER->SCOPE to the class (TYPE) or namespace
5229 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5230 it unchanged if there is no nested-name-specifier. Returns the new
5231 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5233 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5234 part of a declaration and/or decl-specifier. */
5236 static tree
5242 {
5247 /* Remember where the nested-name-specifier starts. */
5249 {
5252 }
5255 {
5256 tree new_scope;
5257 tree old_scope;
5258 tree saved_qualifying_scope;
5261 /* Spot cases that cannot be the beginning of a
5262 nested-name-specifier. */
5265 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5266 the already parsed nested-name-specifier. */
5268 {
5269 /* Grab the nested-name-specifier and continue the loop. */
5271 /* If we originally encountered this nested-name-specifier
5272 with IS_DECLARATION set to false, we will not have
5273 resolved TYPENAME_TYPEs, so we must do so here. */
5276 {
5281 }
5284 }
5286 /* Spot cases that cannot be the beginning of a
5287 nested-name-specifier. On the second and subsequent times
5288 through the loop, we look for the `template' keyword. */
5290 ;
5291 /* A template-id can start a nested-name-specifier. */
5293 ;
5294 /* DR 743: decltype can be used in a nested-name-specifier. */
5296 ;
5297 else
5298 {
5299 /* If the next token is not an identifier, then it is
5300 definitely not a type-name or namespace-name. */
5303 /* If the following token is neither a `<' (to begin a
5304 template-id), nor a `::', then we are not looking at a
5305 nested-name-specifier. */
5311 {
5315 }
5318 && !cp_parser_nth_token_starts_template_argument_list_p
5321 }
5323 /* The nested-name-specifier is optional, so we parse
5324 tentatively. */
5327 /* Look for the optional `template' keyword, if this isn't the
5328 first time through the loop. */
5331 else
5334 /* Save the old scope since the name lookup we are about to do
5335 might destroy it. */
5338 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5339 look up names in "X<T>::I" in order to determine that "Y" is
5340 a template. So, if we have a typename at this point, we make
5341 an effort to look through it. */
5343 && !typename_keyword_p
5348 /* Parse the qualifying entity. */
5349 new_scope
5351 typename_keyword_p,
5352 template_keyword_p,
5353 check_dependency_p,
5354 type_p,
5355 is_declaration);
5356 /* Look for the `::' token. */
5359 /* If we found what we wanted, we keep going; otherwise, we're
5360 done. */
5362 {
5365 /* Restore the OLD_SCOPE since it was valid before the
5366 failed attempt at finding the last
5367 class-or-namespace-name. */
5371 /* If the next token is a decltype, and the one after that is a
5372 `::', then the decltype has failed to resolve to a class or
5373 enumeration type. Give this error even when parsing
5374 tentatively since it can't possibly be valid--and we're going
5375 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5376 won't get another chance.*/
5380 {
5387 /* As below. */
5390 }
5394 /* If the next token is an identifier, and the one after
5395 that is a `::', then any valid interpretation would have
5396 found a class-or-namespace-name. */
5402 {
5405 {
5407 {
5408 tree decl;
5409 tree ambiguous_decls;
5412 none_type,
5421 decl);
5423 {
5424 // cp_parser_lookup_name has the same diagnostic,
5425 // thus make sure to emit it at most once.
5428 {
5433 }
5435 }
5436 else
5437 {
5439 cp_parser_name_lookup_error
5442 else
5443 cp_parser_name_lookup_error
5446 }
5447 }
5450 /* Treat this as a successful nested-name-specifier
5451 due to:
5453 [basic.lookup.qual]
5455 If the name found is not a class-name (clause
5456 _class_) or namespace-name (_namespace.def_), the
5457 program is ill-formed. */
5459 }
5461 }
5463 }
5464 /* We've found one valid nested-name-specifier. */
5466 /* Name lookup always gives us a DECL. */
5469 /* Uses of "template" must be followed by actual templates. */
5481 new_scope);
5482 /* If it is a class scope, try to complete it; we are about to
5483 be looking up names inside the class. */
5485 /* Since checking types for dependency can be expensive,
5486 avoid doing it if the type is already complete. */
5488 /* Do not try to complete dependent types. */
5490 {
5492 /* If it is a typedef to current class, use the current
5493 class instead, as the typedef won't have any names inside
5494 it yet. */
5498 }
5499 /* Make sure we look in the right scope the next time through
5500 the loop. */
5502 }
5504 /* If parsing tentatively, replace the sequence of tokens that makes
5505 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5506 token. That way, should we re-parse the token stream, we will
5507 not have to repeat the effort required to do the parse, nor will
5508 we issue duplicate error messages. */
5510 {
5514 /* Reset the contents of the START token. */
5516 /* Retrieve any deferred checks. Do not pop this access checks yet
5517 so the memory will not be reclaimed during token replacing below. */
5525 /* Purge all subsequent tokens. */
5527 }
5533 }
5535 /* Parse a nested-name-specifier. See
5536 cp_parser_nested_name_specifier_opt for details. This function
5537 behaves identically, except that it will an issue an error if no
5538 nested-name-specifier is present. */
5540 static tree
5546 {
5547 tree scope;
5549 /* Look for the nested-name-specifier. */
5551 typename_keyword_p,
5552 check_dependency_p,
5553 type_p,
5554 is_declaration);
5555 /* If it was not present, issue an error message. */
5557 {
5560 }
5563 }
5565 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5566 this is either a class-name or a namespace-name (which corresponds
5567 to the class-or-namespace-name production in the grammar). For
5568 C++0x, it can also be a type-name that refers to an enumeration
5569 type or a simple-template-id.
5571 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5572 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5573 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5574 TYPE_P is TRUE iff the next name should be taken as a class-name,
5575 even the same name is declared to be another entity in the same
5576 scope.
5578 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5579 specified by the class-or-namespace-name. If neither is found the
5580 ERROR_MARK_NODE is returned. */
5582 static tree
5589 {
5590 tree saved_scope;
5591 tree saved_qualifying_scope;
5592 tree saved_object_scope;
5593 tree scope;
5597 /* DR 743: decltype can appear in a nested-name-specifier. */
5599 {
5603 {
5606 }
5610 }
5612 /* Before we try to parse the class-name, we must save away the
5613 current PARSER->SCOPE since cp_parser_class_name will destroy
5614 it. */
5618 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5619 there is no need to look for a namespace-name. */
5620 only_class_p = template_keyword_p
5625 typename_keyword_p,
5626 template_keyword_p,
5628 check_dependency_p,
5630 is_declaration);
5632 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5636 {
5637 /* Restore the saved scope. */
5642 /* Parse tentatively. */
5645 /* Parse a type-name */
5648 /* "If the name found does not designate a namespace or a class,
5649 enumeration, or dependent type, the program is ill-formed."
5651 We cover classes and dependent types above and namespaces below,
5652 so this code is only looking for enums. */
5658 }
5659 /* If that didn't work, try for a namespace-name. */
5661 {
5662 /* Restore the saved scope. */
5666 /* If we are not looking at an identifier followed by the scope
5667 resolution operator, then this is not part of a
5668 nested-name-specifier. (Note that this function is only used
5669 to parse the components of a nested-name-specifier.) */
5674 }
5677 }
5679 /* Parse a postfix-expression.
5681 postfix-expression:
5682 primary-expression
5683 postfix-expression [ expression ]
5684 postfix-expression ( expression-list [opt] )
5685 simple-type-specifier ( expression-list [opt] )
5686 typename :: [opt] nested-name-specifier identifier
5687 ( expression-list [opt] )
5688 typename :: [opt] nested-name-specifier template [opt] template-id
5689 ( expression-list [opt] )
5690 postfix-expression . template [opt] id-expression
5691 postfix-expression -> template [opt] id-expression
5692 postfix-expression . pseudo-destructor-name
5693 postfix-expression -> pseudo-destructor-name
5694 postfix-expression ++
5695 postfix-expression --
5696 dynamic_cast < type-id > ( expression )
5697 static_cast < type-id > ( expression )
5698 reinterpret_cast < type-id > ( expression )
5699 const_cast < type-id > ( expression )
5700 typeid ( expression )
5701 typeid ( type-id )
5703 GNU Extension:
5705 postfix-expression:
5706 ( type-id ) { initializer-list , [opt] }
5708 This extension is a GNU version of the C99 compound-literal
5709 construct. (The C99 grammar uses `type-name' instead of `type-id',
5710 but they are essentially the same concept.)
5712 If ADDRESS_P is true, the postfix expression is the operand of the
5713 `&' operator. CAST_P is true if this expression is the target of a
5714 cast.
5716 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5717 class member access expressions [expr.ref].
5719 Returns a representation of the expression. */
5721 static tree
5725 {
5727 location_t loc;
5734 /* Peek at the next token. */
5737 /* Some of the productions are determined by keywords. */
5740 {
5745 {
5746 tree type;
5747 tree expression;
5751 /* All of these can be handled in the same way from the point
5752 of view of parsing. Begin by consuming the token
5753 identifying the cast. */
5756 /* New types cannot be defined in the cast. */
5758 parser->type_definition_forbidden_message
5761 /* Look for the opening `<'. */
5763 /* Parse the type to which we are casting. */
5768 /* Look for the closing `>'. */
5770 /* Restore the old message. */
5773 bool saved_greater_than_is_operator_p
5777 /* And the expression which is being cast. */
5782 parser->greater_than_is_operator_p
5785 /* Only type conversions to integral or enumeration types
5786 can be used in constant-expressions. */
5792 {
5794 postfix_expression
5798 postfix_expression
5802 postfix_expression
5804 tf_warning_or_error);
5807 postfix_expression
5812 }
5813 }
5817 {
5818 tree type;
5822 /* Consume the `typeid' token. */
5824 /* Look for the `(' token. */
5826 /* Types cannot be defined in a `typeid' expression. */
5828 parser->type_definition_forbidden_message
5830 /* We can't be sure yet whether we're looking at a type-id or an
5831 expression. */
5833 /* Try a type-id first. */
5838 /* Look for the `)' token. Otherwise, we can't be sure that
5839 we're not looking at an expression: consider `typeid (int
5840 (3))', for example. */
5842 /* If all went well, simply lookup the type-id. */
5845 /* Otherwise, fall back to the expression variant. */
5846 else
5847 {
5848 tree expression;
5850 /* Look for an expression. */
5852 /* Compute its typeid. */
5854 /* Look for the `)' token. */
5856 }
5857 /* Restore the saved message. */
5859 /* `typeid' may not appear in an integral constant expression. */
5862 }
5866 {
5867 tree type;
5868 /* The syntax permitted here is the same permitted for an
5869 elaborated-type-specifier. */
5874 }
5878 {
5882 {
5887 }
5889 {
5894 }
5895 else
5896 {
5897 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5900 }
5902 postfix_expression =
5906 {
5910 }
5912 {
5917 }
5918 else
5919 {
5921 postfix_expression);
5925 }
5927 }
5930 {
5933 tree p;
5947 tf_warning_or_error);
5950 tf_warning_or_error);
5951 else
5952 {
5956 }
5958 }
5961 {
5962 tree type;
5964 /* If the next thing is a simple-type-specifier, we may be
5965 looking at a functional cast. We could also be looking at
5966 an id-expression. So, we try the functional cast, and if
5967 that doesn't work we fall back to the primary-expression. */
5969 /* Look for the simple-type-specifier. */
5972 CP_PARSER_FLAGS_NONE);
5973 /* Parse the cast itself. */
5975 postfix_expression
5977 /* If that worked, we're done. */
5981 /* If the functional-cast didn't work out, try a
5982 compound-literal. */
5985 {
5990 /* Consume the `('. */
5993 /* Avoid calling cp_parser_type_id pointlessly, see comment
5994 in cp_parser_cast_expression about c++/29234. */
5997 compound_literal_p
6002 /* Roll back the tokens we skipped. */
6007 else
6008 {
6009 /* Parse the type. */
6014 /* Look for the `)'. */
6016 }
6018 /* If things aren't going well, there's no need to
6019 keep going. */
6021 {
6023 /* Parse the brace-enclosed initializer list. */
6026 }
6027 /* If that worked, we're definitely looking at a
6028 compound-literal expression. */
6030 {
6031 /* Warn the user that a compound literal is not
6032 allowed in standard C++. */
6035 /* For simplicity, we disallow compound literals in
6036 constant-expressions. We could
6037 allow compound literals of integer type, whose
6038 initializer was a constant, in constant
6039 expressions. Permitting that usage, as a further
6040 extension, would not change the meaning of any
6041 currently accepted programs. (Of course, as
6042 compound literals are not part of ISO C++, the
6043 standard has nothing to say.) */
6045 NIC_NCC))
6046 {
6049 }
6050 /* Form the representation of the compound-literal. */
6051 postfix_expression
6053 tf_warning_or_error);
6055 }
6056 }
6058 /* It must be a primary-expression. */
6059 postfix_expression
6062 decltype_p,
6064 }
6066 }
6068 /* Note that we don't need to worry about calling build_cplus_new on a
6069 class-valued CALL_EXPR in decltype when it isn't the end of the
6070 postfix-expression; unary_complex_lvalue will take care of that for
6071 all these cases. */
6073 /* Keep looping until the postfix-expression is complete. */
6075 {
6079 /* It is not a Koenig lookup function call. */
6080 postfix_expression
6083 /* Peek at the next token. */
6087 {
6090 {
6092 "two consecutive %<[%> shall "
6095 }
6096 postfix_expression
6098 postfix_expression,
6100 decltype_p);
6106 /* postfix-expression ( expression-list [opt] ) */
6107 {
6117 is_builtin_constant_p
6120 {
6121 /* The whole point of __builtin_constant_p is to allow
6122 non-constant expressions to appear as arguments. */
6123 saved_integral_constant_expression_p
6125 saved_non_integral_constant_expression_p
6128 }
6129 args = (cp_parser_parenthesized_expression_list
6134 {
6135 parser->integral_constant_expression_p
6137 parser->non_integral_constant_expression_p
6139 }
6142 {
6145 }
6147 /* Function calls are not permitted in
6148 constant-expressions. */
6151 NIC_FUNC_CALL))
6152 {
6156 }
6161 {
6163 {
6165 {
6168 postfix_expression
6170 complain);
6171 }
6172 else
6173 postfix_expression
6175 }
6176 /* We do not perform argument-dependent lookup if
6177 normal lookup finds a non-function, in accordance
6178 with the expected resolution of DR 218. */
6181 {
6185 /* Do not do argument dependent lookup if regular
6186 lookup finds a member function or a block-scope
6187 function declaration. [basic.lookup.argdep]/3 */
6190 {
6193 postfix_expression
6195 complain);
6196 }
6197 }
6198 }
6201 {
6211 {
6212 postfix_expression
6216 }
6219 {
6220 postfix_expression
6221 = (build_new_method_call
6227 complain));
6228 }
6229 else
6230 postfix_expression
6234 complain);
6235 }
6239 postfix_expression = (build_offset_ref_call_from_tree
6241 complain));
6243 /* A call to a static class member, or a namespace-scope
6244 function. */
6245 postfix_expression
6248 koenig_p,
6249 complain);
6250 else
6251 /* All other function calls. */
6252 postfix_expression
6255 koenig_p,
6256 complain);
6258 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6262 }
6267 /* postfix-expression . template [opt] id-expression
6268 postfix-expression . pseudo-destructor-name
6269 postfix-expression -> template [opt] id-expression
6270 postfix-expression -> pseudo-destructor-name */
6272 /* Consume the `.' or `->' operator. */
6275 postfix_expression
6277 postfix_expression,
6284 /* postfix-expression ++ */
6285 /* Consume the `++' token. */
6287 /* Generate a representation for the complete expression. */
6288 postfix_expression
6290 POSTINCREMENT_EXPR);
6291 /* Increments may not appear in constant-expressions. */
6299 /* postfix-expression -- */
6300 /* Consume the `--' token. */
6302 /* Generate a representation for the complete expression. */
6303 postfix_expression
6305 POSTDECREMENT_EXPR);
6306 /* Decrements may not appear in constant-expressions. */
6318 else
6320 }
6321 }
6323 /* We should never get here. */
6326 }
6328 /* This function parses Cilk Plus array notations. If a normal array expr. is
6329 parsed then the array index is passed back to the caller through *INIT_INDEX
6330 and the function returns a NULL_TREE. If array notation expr. is parsed,
6331 then *INIT_INDEX is ignored by the caller and the function returns
6332 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6333 error_mark_node. */
6335 static tree
6337 tree array_value)
6338 {
6342 {
6345 }
6354 {
6357 }
6359 {
6360 /* Consume the ':'. */
6363 /* If we are here, then we have a case like this A[:]. */
6365 {
6369 }
6373 }
6374 else
6375 {
6376 /* If we are here, then there are three valid possibilities:
6377 1. ARRAY [ EXP ]
6378 2. ARRAY [ EXP : EXP ]
6379 3. ARRAY [ EXP : EXP : EXP ] */
6383 {
6384 /* This indicates that we have a normal array expression. */
6387 }
6389 /* Consume the ':'. */
6393 {
6396 }
6397 }
6402 {
6406 }
6412 }
6414 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6415 by cp_parser_builtin_offsetof. We're looking for
6417 postfix-expression [ expression ]
6418 postfix-expression [ braced-init-list ] (C++11)
6420 FOR_OFFSETOF is set if we're being called in that context, which
6421 changes how we deal with integer constant expressions. */
6423 static tree
6425 tree postfix_expression,
6428 {
6433 /* Consume the `[' token. */
6439 /* Parse the index expression. */
6440 /* ??? For offsetof, there is a question of what to allow here. If
6441 offsetof is not being used in an integral constant expression context,
6442 then we *could* get the right answer by computing the value at runtime.
6443 If we are in an integral constant expression context, then we might
6444 could accept any constant expression; hard to say without analysis.
6445 Rather than open the barn door too wide right away, allow only integer
6446 constant expressions here. */
6449 else
6450 {
6452 {
6459 {
6461 "braced list index is not allowed with array "
6465 }
6466 }
6468 {
6469 /* Here are have these two options:
6470 ARRAY[EXP : EXP] - Array notation expr with default
6471 stride of 1.
6472 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6473 stride. */
6475 postfix_expression);
6478 }
6479 else
6481 }
6485 /* Look for the closing `]'. */
6488 /* Build the ARRAY_REF. */
6492 /* When not doing offsetof, array references are not permitted in
6493 constant-expressions. */
6499 }
6501 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6502 by cp_parser_builtin_offsetof. We're looking for
6504 postfix-expression . template [opt] id-expression
6505 postfix-expression . pseudo-destructor-name
6506 postfix-expression -> template [opt] id-expression
6507 postfix-expression -> pseudo-destructor-name
6509 FOR_OFFSETOF is set if we're being called in that context. That sorta
6510 limits what of the above we'll actually accept, but nevermind.
6511 TOKEN_TYPE is the "." or "->" token, which will already have been
6512 removed from the stream. */
6514 static tree
6517 tree postfix_expression,
6519 location_t location)
6520 {
6521 tree name;
6526 /* If this is a `->' operator, dereference the pointer. */
6529 tf_warning_or_error);
6530 /* Check to see whether or not the expression is type-dependent. */
6532 /* The identifier following the `->' or `.' is not qualified. */
6538 /* Enter the scope corresponding to the type of the object
6539 given by the POSTFIX_EXPRESSION. */
6541 {
6543 /* According to the standard, no expression should ever have
6544 reference type. Unfortunately, we do not currently match
6545 the standard in this respect in that our internal representation
6546 of an expression may have reference type even when the standard
6547 says it does not. Therefore, we have to manually obtain the
6548 underlying type here. */
6550 /* The type of the POSTFIX_EXPRESSION must be complete. */
6552 {
6554 postfix_expression);
6556 }
6557 /* Unlike the object expression in other contexts, *this is not
6558 required to be of complete type for purposes of class member
6559 access (5.2.5) outside the member function body. */
6563 /* Let the name lookup machinery know that we are processing a
6564 class member access expression. */
6566 /* If something went wrong, we want to be able to discern that case,
6567 as opposed to the case where there was no SCOPE due to the type
6568 of expression being dependent. */
6571 /* If the SCOPE was erroneous, make the various semantic analysis
6572 functions exit quickly -- and without issuing additional error
6573 messages. */
6576 }
6578 /* Assume this expression is not a pseudo-destructor access. */
6581 /* If the SCOPE is a scalar type, then, if this is a valid program,
6582 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6583 is type dependent, it can be pseudo-destructor-name or something else.
6584 Try to parse it as pseudo-destructor-name first. */
6586 {
6587 tree s;
6588 tree type;
6591 /* Parse the pseudo-destructor-name. */
6600 {
6602 postfix_expression
6605 }
6606 }
6609 {
6610 /* If the SCOPE is not a scalar type, we are looking at an
6611 ordinary class member access expression, rather than a
6612 pseudo-destructor-name. */
6615 /* Parse the id-expression. */
6616 name = (cp_parser_id_expression
6623 /* In general, build a SCOPE_REF if the member name is qualified.
6624 However, if the name was not dependent and has already been
6625 resolved; there is no need to build the SCOPE_REF. For example;
6627 struct X { void f(); };
6628 template <typename T> void f(T* t) { t->X::f(); }
6630 Even though "t" is dependent, "X::f" is not and has been resolved
6631 to a BASELINK; there is no need to include scope information. */
6633 /* But we do need to remember that there was an explicit scope for
6634 virtual function calls. */
6638 /* If the name is a template-id that names a type, we will get a
6639 TYPE_DECL here. That is invalid code. */
6641 {
6644 }
6645 else
6646 {
6648 {
6650 {
6654 }
6655 else
6658 name,
6659 template_p);
6663 }
6665 adjust_result_of_qualified_name_lookup
6667 postfix_expression
6669 template_p,
6670 tf_warning_or_error);
6671 }
6672 }
6674 /* We no longer need to look up names in the scope of the object on
6675 the left-hand side of the `.' or `->' operator. */
6678 /* Outside of offsetof, these operators may not appear in
6679 constant-expressions. */
6681 && (cp_parser_non_integral_constant_expression
6686 }
6688 /* Parse a parenthesized expression-list.
6690 expression-list:
6691 assignment-expression
6692 expression-list, assignment-expression
6694 attribute-list:
6695 expression-list
6696 identifier
6697 identifier, expression-list
6699 CAST_P is true if this expression is the target of a cast.
6701 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6702 argument pack.
6704 Returns a vector of trees. Each element is a representation of an
6705 assignment-expression. NULL is returned if the ( and or ) are
6706 missing. An empty, but allocated, vector is returned on no
6707 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6708 if we are parsing an attribute list for an attribute that wants a
6709 plain identifier argument, normal_attr for an attribute that wants
6710 an expression, or non_attr if we aren't parsing an attribute list. If
6711 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6712 not all of the expressions in the list were constant. */
6720 {
6726 /* Assume all the expressions will be constant. */
6735 /* Within a parenthesized expression, a `>' token is always
6736 the greater-than operator. */
6737 saved_greater_than_is_operator_p
6741 /* Consume expressions until there are no more. */
6744 {
6745 tree expr;
6747 /* At the beginning of attribute lists, check to see if the
6748 next token is an identifier. */
6751 {
6754 /* Consume the identifier. */
6756 /* Save the identifier. */
6758 }
6759 else
6760 {
6763 /* Parse the next assignment-expression. */
6765 {
6766 /* A braced-init-list. */
6772 }
6774 {
6775 expr = (cp_parser_constant_expression
6780 }
6781 else
6787 /* If we have an ellipsis, then this is an expression
6788 expansion. */
6791 {
6792 /* Consume the `...'. */
6795 /* Build the argument pack. */
6797 }
6799 /* Add it to the list. We add error_mark_node
6800 expressions to the list, so that we can still tell if
6801 the correct form for a parenthesized expression-list
6802 is found. That gives better errors. */
6807 }
6809 /* After the first item, attribute lists look the same as
6810 expression lists. */
6813 get_comma:;
6814 /* If the next token isn't a `,', then we are done. */
6818 /* Otherwise, consume the `,' and keep going. */
6820 }
6823 {
6826 skip_comma:;
6827 /* We try and resync to an unnested comma, as that will give the
6828 user better diagnostics. */
6836 {
6837 parser->greater_than_is_operator_p
6840 }
6841 }
6843 parser->greater_than_is_operator_p
6850 }
6852 /* Parse a pseudo-destructor-name.
6854 pseudo-destructor-name:
6855 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6856 :: [opt] nested-name-specifier template template-id :: ~ type-name
6857 :: [opt] nested-name-specifier [opt] ~ type-name
6859 If either of the first two productions is used, sets *SCOPE to the
6860 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6861 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6862 or ERROR_MARK_NODE if the parse fails. */
6864 static void
6866 tree object,
6869 {
6872 /* Handle ~auto. */
6876 {
6879 "%<~auto%> only available with "
6886 }
6888 /* Assume that things will not work out. */
6891 /* Look for the optional `::' operator. */
6893 /* Look for the optional nested-name-specifier. */
6894 nested_name_specifier_p
6901 /* Now, if we saw a nested-name-specifier, we might be doing the
6902 second production. */
6905 {
6906 /* Consume the `template' keyword. */
6908 /* Parse the template-id. */
6912 class_type,
6914 /* Look for the `::' token. */
6916 }
6917 /* If the next token is not a `~', then there might be some
6918 additional qualification. */
6920 {
6921 /* At this point, we're looking for "type-name :: ~". The type-name
6922 must not be a class-name, since this is a pseudo-destructor. So,
6923 it must be either an enum-name, or a typedef-name -- both of which
6924 are just identifiers. So, we peek ahead to check that the "::"
6925 and "~" tokens are present; if they are not, then we can avoid
6926 calling type_name. */
6930 {
6933 }
6935 /* Look for the type-name. */
6940 /* Look for the `::' token. */
6942 }
6943 else
6946 /* Look for the `~'. */
6949 /* Once we see the ~, this has to be a pseudo-destructor. */
6953 /* Look for the type-name again. We are not responsible for
6954 checking that it matches the first type-name. */
6956 }
6958 /* Parse a unary-expression.
6960 unary-expression:
6961 postfix-expression
6962 ++ cast-expression
6963 -- cast-expression
6964 unary-operator cast-expression
6965 sizeof unary-expression
6966 sizeof ( type-id )
6967 alignof ( type-id ) [C++0x]
6968 new-expression
6969 delete-expression
6971 GNU Extensions:
6973 unary-expression:
6974 __extension__ cast-expression
6975 __alignof__ unary-expression
6976 __alignof__ ( type-id )
6977 alignof unary-expression [C++0x]
6978 __real__ cast-expression
6979 __imag__ cast-expression
6980 && identifier
6981 sizeof ( type-id ) { initializer-list , [opt] }
6982 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6983 __alignof__ ( type-id ) { initializer-list , [opt] }
6985 ADDRESS_P is true iff the unary-expression is appearing as the
6986 operand of the `&' operator. CAST_P is true if this expression is
6987 the target of a cast.
6989 Returns a representation of the expression. */
6991 static tree
6994 {
6998 /* Peek at the next token. */
7000 /* Some keywords give away the kind of expression. */
7002 {
7006 {
7009 {
7012 location_t first_loc;
7015 /* Consume the token. */
7018 /* Parse the operand. */
7023 else
7024 {
7025 /* ISO C++ defines alignof only with types, not with
7026 expressions. So pedwarn if alignof is used with a non-
7027 type expression. However, __alignof__ is ok. */
7030 "ISO C++ does not allow %<alignof%> "
7034 }
7035 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7036 SIZEOF_EXPR with the original operand. */
7038 {
7040 {
7042 {
7045 error_mark_node));
7047 }
7048 else
7052 }
7054 }
7056 }
7065 {
7066 /* The saved value of the PEDANTIC flag. */
7068 tree expr;
7070 /* Save away the PEDANTIC flag. */
7072 /* Parse the cast-expression. */
7074 /* Restore the PEDANTIC flag. */
7078 }
7082 {
7083 tree expression;
7085 /* Consume the `__real__' or `__imag__' token. */
7087 /* Parse the cast-expression. */
7089 /* Create the complete representation. */
7093 expression,
7094 tf_warning_or_error);
7095 }
7103 {
7104 tree expr;
7114 parser->type_definition_forbidden_message
7117 saved_integral_constant_expression_p
7119 saved_non_integral_constant_expression_p
7123 saved_greater_than_is_operator_p
7133 parser->greater_than_is_operator_p
7136 parser->integral_constant_expression_p
7138 parser->non_integral_constant_expression_p
7145 }
7149 }
7150 }
7152 /* Look for the `:: new' and `:: delete', which also signal the
7153 beginning of a new-expression, or delete-expression,
7154 respectively. If the next token is `::', then it might be one of
7155 these. */
7157 {
7160 /* See if the token after the `::' is one of the keywords in
7161 which we're interested. */
7163 /* If it's `new', we have a new-expression. */
7166 /* Similarly, for `delete'. */
7169 }
7171 /* Look for a unary operator. */
7173 /* The `++' and `--' operators can be handled similarly, even though
7174 they are not technically unary-operators in the grammar. */
7176 {
7181 /* Handle the GNU address-of-label extension. */
7184 {
7185 tree identifier;
7186 tree expression;
7189 /* Consume the '&&' token. */
7191 /* Look for the identifier. */
7193 /* Create an expression representing the address. */
7196 NIC_ADDR_LABEL))
7199 }
7200 }
7202 {
7203 tree cast_expression;
7209 /* Consume the operator token. */
7211 /* Parse the cast-expression. */
7212 cast_expression
7217 pidk);
7218 /* Now, build an appropriate representation. */
7220 {
7224 RO_UNARY_STAR,
7225 complain);
7230 /* Fall through. */
7233 cast_expression,
7234 complain);
7241 /* Fall through. */
7251 }
7255 non_constant_p))
7259 }
7263 decltype_p,
7264 pidk);
7265 }
7270 {
7273 }
7275 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7276 unary-operator, the corresponding tree code is returned. */
7278 static enum tree_code
7280 {
7282 {
7303 }
7304 }
7306 /* Parse a new-expression.
7308 new-expression:
7309 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7310 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7312 Returns a representation of the expression. */
7314 static tree
7316 {
7319 tree type;
7322 tree ret;
7324 /* Look for the optional `::' operator. */
7325 global_scope_p
7329 /* Look for the `new' operator. */
7331 /* There's no easy way to tell a new-placement from the
7332 `( type-id )' construct. */
7334 /* Look for a new-placement. */
7336 /* If that didn't work out, there's no new-placement. */
7338 {
7342 }
7344 /* If the next token is a `(', then we have a parenthesized
7345 type-id. */
7347 {
7351 /* Consume the `('. */
7354 /* Parse the type-id. */
7355 parser->type_definition_forbidden_message
7360 /* Look for the closing `)'. */
7363 /* There should not be a direct-new-declarator in this production,
7364 but GCC used to allowed this, so we check and emit a sensible error
7365 message for this case. */
7367 {
7373 }
7374 }
7375 /* Otherwise, there must be a new-type-id. */
7376 else
7379 /* If the next token is a `(' or '{', then we have a new-initializer. */
7383 else
7386 /* A new-expression may not appear in an integral constant
7387 expression. */
7390 else
7391 {
7392 /* Create a representation of the new-expression. */
7394 tf_warning_or_error);
7395 }
7403 }
7405 /* Parse a new-placement.
7407 new-placement:
7408 ( expression-list )
7410 Returns the same representation as for an expression-list. */
7414 {
7417 /* Parse the expression-list. */
7418 expression_list = (cp_parser_parenthesized_expression_list
7424 }
7426 /* Parse a new-type-id.
7428 new-type-id:
7429 type-specifier-seq new-declarator [opt]
7431 Returns the TYPE allocated. If the new-type-id indicates an array
7432 type, *NELTS is set to the number of elements in the last array
7433 bound; the TYPE will not include the last array bound. */
7435 static tree
7437 {
7438 cp_decl_specifier_seq type_specifier_seq;
7444 /* The type-specifier sequence must not contain type definitions.
7445 (It cannot contain declarations of new types either, but if they
7446 are not definitions we will catch that because they are not
7447 complete.) */
7449 parser->type_definition_forbidden_message
7451 /* Parse the type-specifier-seq. */
7455 /* Restore the old message. */
7461 /* Parse the new-declarator. */
7464 /* Determine the number of elements in the last array dimension, if
7465 any. */
7467 /* Skip down to the last array dimension. */
7472 {
7475 }
7480 {
7483 }
7486 {
7493 else
7495 }
7498 }
7500 /* Parse an (optional) new-declarator.
7502 new-declarator:
7503 ptr-operator new-declarator [opt]
7504 direct-new-declarator
7506 Returns the declarator. */
7510 {
7513 cp_cv_quals cv_quals;
7515 /* We don't know if there's a ptr-operator next, or not. */
7517 /* Look for a ptr-operator. */
7519 /* If that worked, look for more new-declarators. */
7521 {
7524 /* Parse another optional declarator. */
7527 declarator = cp_parser_make_indirect_declarator
7531 }
7533 /* If the next token is a `[', there is a direct-new-declarator. */
7538 }
7540 /* Parse a direct-new-declarator.
7542 direct-new-declarator:
7543 [ expression ]
7544 direct-new-declarator [constant-expression]
7546 */
7550 {
7554 {
7555 tree expression;
7558 /* Look for the opening `['. */
7563 /* The standard requires that the expression have integral
7564 type. DR 74 adds enumeration types. We believe that the
7565 real intent is that these expressions be handled like the
7566 expression in a `switch' condition, which also allows
7567 classes with a single conversion to integral or
7568 enumeration type. */
7570 {
7571 expression
7573 expression,
7576 {
7578 "expression in new-declarator must have integral "
7581 }
7582 }
7584 /* Look for the closing `]'. */
7587 /* Add this bound to the declarator. */
7590 /* If the next token is not a `[', then there are no more
7591 bounds. */
7594 }
7597 }
7599 /* Parse a new-initializer.
7601 new-initializer:
7602 ( expression-list [opt] )
7603 braced-init-list
7605 Returns a representation of the expression-list. */
7609 {
7613 {
7614 tree t;
7621 }
7622 else
7623 expression_list = (cp_parser_parenthesized_expression_list
7629 }
7631 /* Parse a delete-expression.
7633 delete-expression:
7634 :: [opt] delete cast-expression
7635 :: [opt] delete [ ] cast-expression
7637 Returns a representation of the expression. */
7639 static tree
7641 {
7644 tree expression;
7646 /* Look for the optional `::' operator. */
7647 global_scope_p
7651 /* Look for the `delete' keyword. */
7653 /* See if the array syntax is in use. */
7655 {
7656 /* Consume the `[' token. */
7658 /* Look for the `]' token. */
7660 /* Remember that this is the `[]' construct. */
7662 }
7663 else
7666 /* Parse the cast-expression. */
7669 /* A delete-expression may not appear in an integral constant
7670 expression. */
7675 tf_warning_or_error);
7676 }
7678 /* Returns true if TOKEN may start a cast-expression and false
7679 otherwise. */
7681 static bool
7683 {
7686 {
7727 /* In ((type ()) () the last () isn't a valid cast-expression,
7728 so the whole must be parsed as postfix-expression. */
7732 /* '[' may start a primary-expression in obj-c++. */
7738 }
7739 }
7741 /* Parse a cast-expression.
7743 cast-expression:
7744 unary-expression
7745 ( type-id ) cast-expression
7747 ADDRESS_P is true iff the unary-expression is appearing as the
7748 operand of the `&' operator. CAST_P is true if this expression is
7749 the target of a cast.
7751 Returns a representation of the expression. */
7753 static tree
7756 {
7757 /* If it's a `(', then we might be looking at a cast. */
7759 {
7765 /* There's no way to know yet whether or not this is a cast.
7766 For example, `(int (3))' is a unary-expression, while `(int)
7767 3' is a cast. So, we resort to parsing tentatively. */
7769 /* Types may not be defined in a cast. */
7771 parser->type_definition_forbidden_message
7773 /* Consume the `('. */
7775 /* A very tricky bit is that `(struct S) { 3 }' is a
7776 compound-literal (which we permit in C++ as an extension).
7777 But, that construct is not a cast-expression -- it is a
7778 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7779 is legal; if the compound-literal were a cast-expression,
7780 you'd need an extra set of parentheses.) But, if we parse
7781 the type-id, and it happens to be a class-specifier, then we
7782 will commit to the parse at that point, because we cannot
7783 undo the action that is done when creating a new class. So,
7784 then we cannot back up and do a postfix-expression.
7785 Another tricky case is the following (c++/29234):
7787 struct S { void operator () (); };
7789 void foo ()
7790 {
7791 ( S()() );
7792 }
7794 As a type-id we parse the parenthesized S()() as a function
7795 returning a function, groktypename complains and we cannot
7796 back up in this case either.
7798 Therefore, we scan ahead to the closing `)', and check to see
7799 if the tokens after the `)' can start a cast-expression. Otherwise
7800 we are dealing with an unary-expression, a postfix-expression
7801 or something else.
7803 Save tokens so that we can put them back. */
7806 /* We may be looking at a cast-expression. */
7807 cast_expression_p
7812 /* Roll back the tokens we skipped. */
7814 /* If we aren't looking at a cast-expression, simulate an error so
7815 that the call to cp_parser_parse_definitely below will fail. */
7818 else
7819 {
7822 /* Look for the type-id. */
7824 /* Look for the closing `)'. */
7827 }
7829 /* Restore the saved message. */
7832 /* At this point this can only be either a cast or a
7833 parenthesized ctor such as `(T ())' that looks like a cast to
7834 function returning T. */
7836 {
7842 pidk);
7844 /* Warn about old-style casts, if so requested. */
7851 /* Only type conversions to integral or enumeration types
7852 can be used in constant-expressions. */
7855 NIC_CAST))
7858 /* Perform the cast. */
7861 }
7862 else
7864 }
7866 /* If we get here, then it's not a cast, so it must be a
7867 unary-expression. */
7870 }
7872 /* Parse a binary expression of the general form:
7874 pm-expression:
7875 cast-expression
7876 pm-expression .* cast-expression
7877 pm-expression ->* cast-expression
7879 multiplicative-expression:
7880 pm-expression
7881 multiplicative-expression * pm-expression
7882 multiplicative-expression / pm-expression
7883 multiplicative-expression % pm-expression
7885 additive-expression:
7886 multiplicative-expression
7887 additive-expression + multiplicative-expression
7888 additive-expression - multiplicative-expression
7890 shift-expression:
7891 additive-expression
7892 shift-expression << additive-expression
7893 shift-expression >> additive-expression
7895 relational-expression:
7896 shift-expression
7897 relational-expression < shift-expression
7898 relational-expression > shift-expression
7899 relational-expression <= shift-expression
7900 relational-expression >= shift-expression
7902 GNU Extension:
7904 relational-expression:
7905 relational-expression <? shift-expression
7906 relational-expression >? shift-expression
7908 equality-expression:
7909 relational-expression
7910 equality-expression == relational-expression
7911 equality-expression != relational-expression
7913 and-expression:
7914 equality-expression
7915 and-expression & equality-expression
7917 exclusive-or-expression:
7918 and-expression
7919 exclusive-or-expression ^ and-expression
7921 inclusive-or-expression:
7922 exclusive-or-expression
7923 inclusive-or-expression | exclusive-or-expression
7925 logical-and-expression:
7926 inclusive-or-expression
7927 logical-and-expression && inclusive-or-expression
7929 logical-or-expression:
7930 logical-and-expression
7931 logical-or-expression || logical-and-expression
7933 All these are implemented with a single function like:
7935 binary-expression:
7936 simple-cast-expression
7937 binary-expression <token> binary-expression
7939 CAST_P is true if this expression is the target of a cast.
7941 The binops_by_token map is used to get the tree codes for each <token> type.
7942 binary-expressions are associated according to a precedence table. */
7944 #define TOKEN_PRECEDENCE(token) \
7945 (((token->type == CPP_GREATER \
7946 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7947 && !parser->greater_than_is_operator_p) \
7948 ? PREC_NOT_OPERATOR \
7949 : binops_by_token[token->type].prec)
7951 static tree
7957 {
7958 cp_parser_expression_stack stack;
7960 cp_parser_expression_stack_entry current;
7961 tree rhs;
7965 tree overload;
7966 bool parenthesized_not_lhs_warn
7969 /* Parse the first expression. */
7979 {
7980 /* Get an operator token. */
7986 {
7988 "%<>>%> operator is treated"
7992 }
7996 /* Popping an entry off the stack means we completed a subexpression:
7997 - either we found a token which is not an operator (`>' where it is not
7998 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7999 will happen repeatedly;
8000 - or, we found an operator which has lower priority. This is the case
8001 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8002 parsing `3 * 4'. */
8004 {
8007 else
8009 }
8011 get_rhs:
8015 /* We used the operator token. */
8018 /* For "false && x" or "true || x", x will never be executed;
8019 disable warnings while evaluating it. */
8025 /* Extract another operand. It may be the RHS of this expression
8026 or the LHS of a new, higher priority expression. */
8030 /* Get another operator token. Look up its precedence to avoid
8031 building a useless (immediately popped) stack entry for common
8032 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8036 {
8037 /* ... and prepare to parse the RHS of the new, higher priority
8038 expression. Since precedence levels on the stack are
8039 monotonically increasing, we do not have to care about
8040 stack overflows. */
8049 pop:
8051 /* If the stack is not empty, we have parsed into LHS the right side
8052 (`4' in the example above) of an expression we had suspended.
8053 We can use the information on the stack to recover the LHS (`3')
8054 from the stack together with the tree code (`MULT_EXPR'), and
8055 the precedence of the higher level subexpression
8056 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8057 which will be used to actually build the additive expression. */
8062 }
8064 /* Undo the disabling of warnings done above. */
8076 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8077 ERROR_MARK for everything that is not a binary expression.
8078 This makes warn_about_parentheses miss some warnings that
8079 involve unary operators. For unary expressions we should
8080 pass the correct tree_code unless the unary expression was
8081 surrounded by parentheses.
8082 */
8088 == tcc_comparison
8091 else
8100 /* If the binary operator required the use of an overloaded operator,
8101 then this expression cannot be an integral constant-expression.
8102 An overloaded operator can be used even if both operands are
8103 otherwise permissible in an integral constant-expression if at
8104 least one of the operands is of enumeration type. */
8108 NIC_OVERLOADED))
8110 }
8113 }
8115 static tree
8120 {
8123 }
8125 /* Parse the `? expression : assignment-expression' part of a
8126 conditional-expression. The LOGICAL_OR_EXPR is the
8127 logical-or-expression that started the conditional-expression.
8128 Returns a representation of the entire conditional-expression.
8130 This routine is used by cp_parser_assignment_expression.
8132 ? expression : assignment-expression
8134 GNU Extensions:
8136 ? : assignment-expression */
8138 static tree
8140 {
8141 tree expr;
8142 tree assignment_expr;
8146 /* Consume the `?' token. */
8151 {
8154 /* Implicit true clause. */
8158 }
8159 else
8160 {
8163 /* Parse the expression. */
8166 c_inhibit_evaluation_warnings +=
8170 }
8172 /* The next token should be a `:'. */
8174 /* Parse the assignment-expression. */
8178 /* Build the conditional-expression. */
8180 expr,
8181 assignment_expr,
8182 tf_warning_or_error);
8183 }
8185 /* Parse an assignment-expression.
8187 assignment-expression:
8188 conditional-expression
8189 logical-or-expression assignment-operator assignment_expression
8190 throw-expression
8192 CAST_P is true if this expression is the target of a cast.
8193 DECLTYPE_P is true if this expression is the operand of decltype.
8195 Returns a representation for the expression. */
8197 static tree
8200 {
8201 tree expr;
8203 /* If the next token is the `throw' keyword, then we're looking at
8204 a throw-expression. */
8207 /* Otherwise, it must be that we are looking at a
8208 logical-or-expression. */
8209 else
8210 {
8211 /* Parse the binary expressions (logical-or-expression). */
8213 decltype_p,
8215 /* If the next token is a `?' then we're actually looking at a
8216 conditional-expression. */
8219 else
8220 {
8223 /* If it's an assignment-operator, we're using the second
8224 production. */
8225 enum tree_code assignment_operator
8228 {
8230 location_t saved_input_location;
8232 /* Parse the right-hand side of the assignment. */
8238 /* An assignment may not appear in a
8239 constant-expression. */
8241 NIC_ASSIGNMENT))
8243 /* Build the assignment expression. Its default
8244 location is the location of the '=' token. */
8248 assignment_operator,
8249 rhs,
8252 }
8253 }
8254 }
8257 }
8259 static tree
8262 {
8265 }
8267 /* Parse an (optional) assignment-operator.
8269 assignment-operator: one of
8270 = *= /= %= += -= >>= <<= &= ^= |=
8272 GNU Extension:
8274 assignment-operator: one of
8275 <?= >?=
8277 If the next token is an assignment operator, the corresponding tree
8278 code is returned, and the token is consumed. For example, for
8279 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8280 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8281 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8282 operator, ERROR_MARK is returned. */
8284 static enum tree_code
8286 {
8290 /* Peek at the next token. */
8294 {
8340 /* Nothing else is an assignment operator. */
8342 }
8344 /* If it was an assignment operator, consume it. */
8349 }
8351 /* Parse an expression.
8353 expression:
8354 assignment-expression
8355 expression , assignment-expression
8357 CAST_P is true if this expression is the target of a cast.
8358 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8359 except possibly parenthesized or on the RHS of a comma (N3276).
8361 Returns a representation of the expression. */
8363 static tree
8366 {
8371 {
8372 tree assignment_expression;
8374 /* Parse the next assignment-expression. */
8375 assignment_expression
8378 /* We don't create a temporary for a call that is the immediate operand
8379 of decltype or on the RHS of a comma. But when we see a comma, we
8380 need to create a temporary for a call on the LHS. */
8385 assignment_expression
8389 /* If this is the first assignment-expression, we can just
8390 save it away. */
8393 else
8395 assignment_expression,
8397 /* If the next token is not a comma, then we are done with the
8398 expression. */
8401 /* Consume the `,'. */
8404 /* A comma operator cannot appear in a constant-expression. */
8407 }
8410 }
8414 {
8416 }
8418 /* Parse a constant-expression.
8420 constant-expression:
8421 conditional-expression
8423 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8424 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8425 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8426 is false, NON_CONSTANT_P should be NULL. */
8428 static tree
8432 {
8436 tree expression;
8438 /* It might seem that we could simply parse the
8439 conditional-expression, and then check to see if it were
8440 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8441 one that the compiler can figure out is constant, possibly after
8442 doing some simplifications or optimizations. The standard has a
8443 precise definition of constant-expression, and we must honor
8444 that, even though it is somewhat more restrictive.
8446 For example:
8448 int i[(2, 3)];
8450 is not a legal declaration, because `(2, 3)' is not a
8451 constant-expression. The `,' operator is forbidden in a
8452 constant-expression. However, GCC's constant-folding machinery
8453 will fold this operation to an INTEGER_CST for `3'. */
8455 /* Save the old settings. */
8457 saved_allow_non_integral_constant_expression_p
8460 /* We are now parsing a constant-expression. */
8462 parser->allow_non_integral_constant_expression_p
8465 /* Although the grammar says "conditional-expression", we parse an
8466 "assignment-expression", which also permits "throw-expression"
8467 and the use of assignment operators. In the case that
8468 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8469 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8470 actually essential that we look for an assignment-expression.
8471 For example, cp_parser_initializer_clauses uses this function to
8472 determine whether a particular assignment-expression is in fact
8473 constant. */
8475 /* Restore the old settings. */
8476 parser->integral_constant_expression_p
8478 parser->allow_non_integral_constant_expression_p
8481 {
8482 /* Require an rvalue constant expression here; that's what our
8483 callers expect. Reference constant expressions are handled
8484 separately in e.g. cp_parser_template_argument. */
8489 }
8492 parser->non_integral_constant_expression_p
8496 }
8498 /* Parse __builtin_offsetof.
8500 offsetof-expression:
8501 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8503 offsetof-member-designator:
8504 id-expression
8505 | offsetof-member-designator "." id-expression
8506 | offsetof-member-designator "[" expression "]"
8507 | offsetof-member-designator "->" id-expression */
8509 static tree
8511 {
8514 cp_id_kind dummy;
8517 /* We're about to accept non-integral-constant things, but will
8518 definitely yield an integral constant expression. Save and
8519 restore these values around our local parsing. */
8523 /* Consume the "__builtin_offsetof" token. */
8525 /* Consume the opening `('. */
8527 /* Parse the type-id. */
8529 /* Look for the `,'. */
8533 /* Build the (type *)null that begins the traditional offsetof macro. */
8535 tf_warning_or_error);
8537 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8541 {
8544 {
8546 /* offsetof-member-designator "[" expression "]" */
8552 /* offsetof-member-designator "->" identifier */
8555 /* FALLTHRU */
8558 /* offsetof-member-designator "." identifier */
8566 /* Consume the ")" token. */
8571 /* Error. We know the following require will fail, but
8572 that gives the proper error message. */
8577 }
8578 }
8580 success:
8581 /* If we're processing a template, we can't finish the semantics yet.
8582 Otherwise we can fold the entire expression now. */
8585 else
8588 failure:
8593 }
8595 /* Parse a trait expression.
8597 Returns a representation of the expression, the underlying type
8598 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8600 static tree
8602 {
8603 cp_trait_kind kind;
8606 cp_decl_specifier_seq decl_specs;
8609 {
8690 }
8692 /* Consume the token. */
8702 /* Build a trivial decl-specifier-seq. */
8706 /* Call grokdeclarator to figure out what type this is. */
8711 {
8719 /* Build a trivial decl-specifier-seq. */
8723 /* Call grokdeclarator to figure out what type this is. */
8726 }
8730 /* Complete the trait expression, which may mean either processing
8731 the trait expr now or saving it for template instantiation. */
8733 {
8742 }
8743 }
8745 /* Lambdas that appear in variable initializer or default argument scope
8746 get that in their mangling, so we need to record it. We might as well
8747 use the count for function and namespace scopes as well. */
8751 {
8752 tree t;
8757 static void
8759 {
8760 tree_int ti;
8762 /* Once we're inside a function, we ignore other scopes and just push
8763 the function again so that popping works properly. */
8770 {
8771 /* Don't reset the count if we're still in the same function. */
8774 }
8775 }
8777 static void
8779 {
8782 }
8784 static void
8786 {
8789 {
8792 }
8794 }
8796 /* Parse a lambda expression.
8798 lambda-expression:
8799 lambda-introducer lambda-declarator [opt] compound-statement
8801 Returns a representation of the expression. */
8803 static tree
8805 {
8807 tree type;
8814 {
8816 {
8820 }
8822 }
8824 /* We may be in the middle of deferred access check. Disable
8825 it now. */
8836 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8839 /* Now that we've started the type, add the capture fields for any
8840 explicit captures. */
8843 {
8844 /* Inside the class, surrounding template-parameter-lists do not apply. */
8845 unsigned int saved_num_template_parameter_lists
8849 bool fully_implicit_function_template_p
8853 bool auto_is_implicit_function_template_parm_p
8864 /* By virtue of defining a local class, a lambda expression has access to
8865 the private variables of enclosing classes. */
8872 {
8875 }
8877 /* The capture list was built up in reverse order; fix that now. */
8889 parser->fully_implicit_function_template_p
8893 parser->auto_is_implicit_function_template_parm_p
8895 }
8899 /* This field is only used during parsing of the lambda. */
8902 /* This lambda shouldn't have any proxies left at this point. */
8904 /* And now that we're done, push proxies for an enclosing lambda. */
8909 else
8911 }
8913 /* Parse the beginning of a lambda expression.
8915 lambda-introducer:
8916 [ lambda-capture [opt] ]
8918 LAMBDA_EXPR is the current representation of the lambda expression. */
8920 static void
8922 {
8923 /* Need commas after the first capture. */
8926 /* Eat the leading `['. */
8929 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8937 {
8940 }
8943 {
8945 tree capture_id;
8946 tree capture_init_expr;
8950 enum capture_kind_type
8951 {
8952 BY_COPY,
8953 BY_REFERENCE
8954 };
8958 {
8961 }
8965 else
8968 /* Possibly capture `this'. */
8970 {
8980 explicit_init_p);
8982 }
8984 /* Remember whether we want to capture as a reference or not. */
8986 {
8989 }
8991 /* Get the identifier. */
8996 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8997 delimiters, but I modified this to stop on unnested ']' as well. It
8998 was already changed to stop on unnested '}', so the
8999 "closing_parenthesis" name is no more misleading with my change. */
9000 {
9006 }
9008 /* Find the initializer for this capture. */
9012 {
9014 /* An explicit initializer exists. */
9017 "lambda capture initializers "
9023 {
9026 }
9027 }
9028 else
9029 {
9032 /* Turn the identifier into an id-expression. */
9033 capture_init_expr
9038 {
9041 }
9045 {
9048 capture_init_expr);
9051 }
9054 {
9057 capture_init_expr))
9060 }
9062 capture_init_expr
9063 = finish_id_expression
9065 capture_init_expr,
9079 {
9082 }
9083 else
9085 }
9089 {
9094 capture_id);
9098 "capture of %qD redundant with by-reference capture "
9100 }
9103 capture_id,
9104 capture_init_expr,
9106 explicit_init_p);
9107 }
9110 }
9112 /* Parse the (optional) middle of a lambda expression.
9114 lambda-declarator:
9115 < template-parameter-list [opt] >
9116 ( parameter-declaration-clause [opt] )
9117 attribute-specifier [opt]
9118 mutable [opt]
9119 exception-specification [opt]
9120 lambda-return-type-clause [opt]
9122 LAMBDA_EXPR is the current representation of the lambda expression. */
9124 static bool
9126 {
9127 /* 5.1.1.4 of the standard says:
9128 If a lambda-expression does not include a lambda-declarator, it is as if
9129 the lambda-declarator were ().
9130 This means an empty parameter list, no attributes, and no exception
9131 specification. */
9137 /* The template-parameter-list is optional, but must begin with
9138 an opening angle if present. */
9140 {
9143 "lambda templates are only available with "
9152 /* We just processed one more parameter list. */
9154 }
9156 /* The parameter-declaration-clause is optional (unless
9157 template-parameter-list was given), but must begin with an
9158 opening parenthesis if present. */
9160 {
9165 /* Parse parameters. */
9168 /* Default arguments shall not be specified in the
9169 parameter-declaration-clause of a lambda-declarator. */
9179 /* Parse optional `mutable' keyword. */
9181 {
9184 }
9186 /* Parse optional exception specification. */
9189 /* Parse optional trailing return type. */
9191 {
9195 }
9197 /* The function parameters must be in scope all the way until after the
9198 trailing-return-type in case of decltype. */
9200 }
9204 /* Create the function call operator.
9206 Messing with declarators like this is no uglier than building up the
9207 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9208 other code. */
9209 {
9210 cp_decl_specifier_seq return_type_specs;
9212 tree fco;
9219 else
9220 /* Maybe we will deduce the return type later. */
9226 sfk_none);
9231 VIRT_SPEC_UNSPECIFIED,
9232 REF_QUAL_NONE,
9233 exception_spec,
9238 declarator,
9239 attributes);
9241 {
9244 /* Give the object parameter a different name. */
9248 }
9250 {
9254 }
9263 }
9264 }
9266 /* Parse the body of a lambda expression, which is simply
9268 compound-statement
9270 but which requires special handling.
9271 LAMBDA_EXPR is the current representation of the lambda expression. */
9273 static void
9275 {
9280 else
9281 /* Still increment function_depth so that we don't GC in the
9282 middle of an expression. */
9284 /* Clear this in case we're in the middle of a default argument. */
9287 /* Finish the function call operator
9288 - class_specifier
9289 + late_parsing_for_member
9290 + function_definition_after_declarator
9291 + ctor_initializer_opt_and_function_body */
9292 {
9294 tree body;
9296 tree compound_stmt;
9297 tree cap;
9299 /* Let the front end know that we are going to be defining this
9300 function. */
9302 NULL_TREE,
9311 /* Push the proxies for any explicit captures. */
9318 /* 5.1.1.4 of the standard says:
9319 If a lambda-expression does not include a trailing-return-type, it
9320 is as if the trailing-return-type denotes the following type:
9321 * if the compound-statement is of the form
9322 { return attribute-specifier [opt] expression ; }
9323 the type of the returned expression after lvalue-to-rvalue
9324 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9325 (_conv.array_ 4.2), and function-to-pointer conversion
9326 (_conv.func_ 4.3);
9327 * otherwise, void. */
9329 /* In a lambda that has neither a lambda-return-type-clause
9330 nor a deducible form, errors should be reported for return statements
9331 in the body. Since we used void as the placeholder return type, parsing
9332 the body as usual will give such desired behavior. */
9336 {
9340 /* Parse tentatively in case there's more after the initial return
9341 statement. */
9352 {
9356 /* Will get error here if type not deduced yet. */
9360 }
9361 }
9364 {
9369 }
9373 out:
9377 /* Finish the function and generate code for it if necessary. */
9380 /* Only expand if the call op is not a template. */
9383 }
9388 else
9390 }
9392 /* Statements [gram.stmt.stmt] */
9394 /* Parse a statement.
9396 statement:
9397 labeled-statement
9398 expression-statement
9399 compound-statement
9400 selection-statement
9401 iteration-statement
9402 jump-statement
9403 declaration-statement
9404 try-block
9406 C++11:
9408 statement:
9409 labeled-statement
9410 attribute-specifier-seq (opt) expression-statement
9411 attribute-specifier-seq (opt) compound-statement
9412 attribute-specifier-seq (opt) selection-statement
9413 attribute-specifier-seq (opt) iteration-statement
9414 attribute-specifier-seq (opt) jump-statement
9415 declaration-statement
9416 attribute-specifier-seq (opt) try-block
9418 TM Extension:
9420 statement:
9421 atomic-statement
9423 IN_COMPOUND is true when the statement is nested inside a
9424 cp_parser_compound_statement; this matters for certain pragmas.
9426 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9427 is a (possibly labeled) if statement which is not enclosed in braces
9428 and has an else clause. This is used to implement -Wparentheses. */
9430 static void
9433 {
9438 restart:
9441 /* There is no statement yet. */
9447 /* In obj-c++, seeing '[[' might be the either the beginning of
9448 c++11 attributes, or a nested objc-message-expression. So
9449 let's parse the c++11 attributes tentatively. */
9453 {
9456 }
9458 /* Peek at the next token. */
9460 /* Remember the location of the first token in the statement. */
9462 /* If this is a keyword, then that will often determine what kind of
9463 statement we have. */
9465 {
9469 {
9472 /* Looks like a labeled-statement with a case label.
9473 Parse the label, and then use tail recursion to parse
9474 the statement. */
9499 {
9504 }
9505 else
9506 {
9510 }
9514 /* Objective-C++ exception-handling constructs. */
9528 /* This must be a namespace alias definition. */
9541 /* It might be a keyword like `int' that can start a
9542 declaration-statement. */
9544 }
9545 }
9547 {
9548 /* If the next token is a `:', then we are looking at a
9549 labeled-statement. */
9552 {
9553 /* Looks like a labeled-statement with an ordinary label.
9554 Parse the label, and then use tail recursion to parse
9555 the statement. */
9559 }
9560 }
9561 /* Anything that starts with a `{' must be a compound-statement. */
9564 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9565 a statement all its own. */
9567 {
9568 /* Only certain OpenMP pragmas are attached to statements, and thus
9569 are considered statements themselves. All others are not. In
9570 the context of a compound, accept the pragma as a "statement" and
9571 return so that we can check for a close brace. Otherwise we
9572 require a real statement and must go back and read one. */
9578 }
9580 {
9583 }
9585 /* Everything else must be a declaration-statement or an
9586 expression-statement. Try for the declaration-statement
9587 first, unless we are looking at a `;', in which case we know that
9588 we have an expression-statement. */
9590 {
9592 {
9594 {
9595 /* Attributes should be parsed as part of the the
9596 declaration, so let's un-parse them. */
9599 }
9602 /* Try to parse the declaration-statement. */
9604 /* If that worked, we're done. */
9607 }
9608 /* Look for an expression-statement instead. */
9610 }
9612 /* Set the line number for the statement. */
9616 /* Note that for now, we don't do anything with c++11 statements
9617 parsed at this level. */
9620 OPT_Wattributes,
9622 }
9624 /* Parse the label for a labeled-statement, i.e.
9626 identifier :
9627 case constant-expression :
9628 default :
9630 GNU Extension:
9631 case constant-expression ... constant-expression : statement
9633 When a label is parsed without errors, the label is added to the
9634 parse tree by the finish_* functions, so this function doesn't
9635 have to return the label. */
9637 static void
9639 {
9644 /* The next token should be an identifier. */
9648 {
9651 }
9655 {
9657 {
9661 /* Consume the `case' token. */
9663 /* Parse the constant-expression. */
9666 NULL);
9670 {
9671 /* Consume the `...' token. */
9673 expr_hi =
9676 NULL);
9677 /* We don't need to emit warnings here, as the common code
9678 will do this for us. */
9679 }
9680 else
9685 else
9688 expr);
9689 }
9693 /* Consume the `default' token. */
9698 else
9703 /* Anything else must be an ordinary label. */
9706 }
9708 /* Require the `:' token. */
9711 /* An ordinary label may optionally be followed by attributes.
9712 However, this is only permitted if the attributes are then
9713 followed by a semicolon. This is because, for backward
9714 compatibility, when parsing
9715 lab: __attribute__ ((unused)) int i;
9716 we want the attribute to attach to "i", not "lab". */
9719 {
9720 tree attrs;
9727 ;
9728 else
9730 }
9736 }
9738 /* Parse an expression-statement.
9740 expression-statement:
9741 expression [opt] ;
9743 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9744 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9745 indicates whether this expression-statement is part of an
9746 expression statement. */
9748 static tree
9750 {
9754 /* If the next token is a ';', then there is no expression
9755 statement. */
9757 {
9761 {
9764 }
9765 }
9767 /* Give a helpful message for "A<T>::type t;" and the like. */
9770 {
9777 {
9778 /* A::A a; */
9783 }
9784 }
9786 /* Consume the final `;'. */
9791 /* This is the final expression statement of a statement
9792 expression. */
9798 }
9800 /* Parse a compound-statement.
9802 compound-statement:
9803 { statement-seq [opt] }
9805 GNU extension:
9807 compound-statement:
9808 { label-declaration-seq [opt] statement-seq [opt] }
9810 label-declaration-seq:
9811 label-declaration
9812 label-declaration-seq label-declaration
9814 Returns a tree representing the statement. */
9816 static tree
9819 {
9820 tree compound_stmt;
9822 /* Consume the `{'. */
9829 /* Begin the compound-statement. */
9831 /* If the next keyword is `__label__' we have a label declaration. */
9834 /* Parse an (optional) statement-seq. */
9836 /* Finish the compound-statement. */
9838 /* Consume the `}'. */
9842 }
9844 /* Parse an (optional) statement-seq.
9846 statement-seq:
9847 statement
9848 statement-seq [opt] statement */
9850 static void
9852 {
9853 /* Scan statements until there aren't any more. */
9855 {
9858 /* If we are looking at a `}', then we have run out of
9859 statements; the same is true if we have reached the end
9860 of file, or have stumbled upon a stray '@end'. */
9867 /* If we are in a compound statement and find 'else' then
9868 something went wrong. */
9870 {
9873 else
9874 {
9877 }
9878 }
9880 /* Parse the statement. */
9882 }
9883 }
9885 /* Parse a selection-statement.
9887 selection-statement:
9888 if ( condition ) statement
9889 if ( condition ) statement else statement
9890 switch ( condition ) statement
9892 Returns the new IF_STMT or SWITCH_STMT.
9894 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9895 is a (possibly labeled) if statement which is not enclosed in
9896 braces and has an else clause. This is used to implement
9897 -Wparentheses. */
9899 static tree
9901 {
9908 /* Peek at the next token. */
9911 /* See what kind of keyword it is. */
9914 {
9917 {
9918 tree statement;
9919 tree condition;
9921 /* Look for the `('. */
9923 {
9926 }
9928 /* Begin the selection-statement. */
9931 else
9934 /* Parse the condition. */
9936 /* Look for the `)'. */
9942 {
9946 /* Add the condition. */
9949 /* Parse the then-clause. */
9953 {
9961 }
9962 else
9968 /* If the next token is `else', parse the else-clause. */
9970 RID_ELSE))
9971 {
9972 /* Consume the `else' keyword. */
9975 /* Parse the else-clause. */
9977 {
9978 location_t loc;
9985 }
9986 else
9991 /* If we are currently parsing a then-clause, then
9992 IF_P will not be NULL. We set it to true to
9993 indicate that this if statement has an else clause.
9994 This may trigger the Wparentheses warning below
9995 when we get back up to the parent if statement. */
9998 }
9999 else
10000 {
10001 /* This if statement does not have an else clause. If
10002 NESTED_IF is true, then the then-clause is an if
10003 statement which does have an else clause. We warn
10004 about the potential ambiguity. */
10007 "suggest explicit braces to avoid ambiguous"
10009 }
10011 /* Now we're all done with the if-statement. */
10013 }
10014 else
10015 {
10019 /* Add the condition. */
10022 /* Parse the body of the switch-statement. */
10031 /* Now we're all done with the switch-statement. */
10033 }
10036 }
10042 }
10043 }
10045 /* Parse a condition.
10047 condition:
10048 expression
10049 type-specifier-seq declarator = initializer-clause
10050 type-specifier-seq declarator braced-init-list
10052 GNU Extension:
10054 condition:
10055 type-specifier-seq declarator asm-specification [opt]
10056 attributes [opt] = assignment-expression
10058 Returns the expression that should be tested. */
10060 static tree
10062 {
10063 cp_decl_specifier_seq type_specifiers;
10067 /* Try the declaration first. */
10069 /* New types are not allowed in the type-specifier-seq for a
10070 condition. */
10072 parser->type_definition_forbidden_message
10074 /* Parse the type-specifier-seq. */
10076 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10079 /* Restore the saved message. */
10081 /* If all is well, we might be looking at a declaration. */
10083 {
10084 tree decl;
10085 tree asm_specification;
10086 tree attributes;
10090 /* Parse the declarator. */
10095 /* Parse the attributes. */
10097 /* Parse the asm-specification. */
10099 /* If the next token is not an `=' or '{', then we might still be
10100 looking at an expression. For example:
10102 if (A(a).x)
10104 looks like a decl-specifier-seq and a declarator -- but then
10105 there is no `=', so this is an expression. */
10110 /* If we did see an `=' or '{', then we are looking at a declaration
10111 for sure. */
10113 {
10114 tree pushed_scope;
10118 /* Create the declaration. */
10124 /* Parse the initializer. */
10126 {
10130 }
10131 else
10132 {
10133 /* Consume the `='. */
10136 }
10140 /* Process the initializer. */
10143 asm_specification,
10144 flags);
10150 }
10151 }
10152 /* If we didn't even get past the declarator successfully, we are
10153 definitely not looking at a declaration. */
10154 else
10157 /* Otherwise, we are looking at an expression. */
10159 }
10161 /* Parses a for-statement or range-for-statement until the closing ')',
10162 not included. */
10164 static tree
10166 {
10170 /* Begin the for-statement. */
10173 /* Parse the initialization. */
10178 else
10180 }
10182 static tree
10184 {
10185 /* Normal for loop */
10188 tree stmt;
10191 /* The for-init-statement has already been parsed in
10192 cp_parser_for_init_statement, so no work is needed here. */
10195 /* If there's a condition, process it. */
10199 {
10203 }
10205 /* Look for the `;'. */
10208 /* If there's an expression, process it. */
10214 }
10216 /* Tries to parse a range-based for-statement:
10218 range-based-for:
10219 decl-specifier-seq declarator : expression
10221 The decl-specifier-seq declarator and the `:' are already parsed by
10222 cp_parser_for_init_statement. If processing_template_decl it returns a
10223 newly created RANGE_FOR_STMT; if not, it is converted to a
10224 regular FOR_STMT. */
10226 static tree
10229 {
10233 {
10236 }
10237 else
10240 /* If in template, STMT is converted to a normal for-statement
10241 at instantiation. If not, it is done just ahead. */
10243 {
10251 /* do_auto_deduction doesn't mess with template init-lists. */
10254 }
10255 else
10256 {
10259 }
10261 }
10263 /* Subroutine of cp_convert_range_for: given the initializer expression,
10264 builds up the range temporary. */
10266 static tree
10268 {
10271 /* Find out the type deduced by the declaration
10272 `auto &&__range = range_expr'. */
10277 /* Create the __range variable. */
10284 }
10286 /* Used by cp_parser_range_for in template context: we aren't going to
10287 do a full conversion yet, but we still need to resolve auto in the
10288 type of the for-range-declaration if present. This is basically
10289 a shortcut version of cp_convert_range_for. */
10291 static void
10293 {
10296 {
10299 iter_type = (cp_parser_perform_range_for_lookup
10302 {
10304 iter_type);
10306 tf_warning_or_error);
10309 }
10310 }
10311 }
10313 /* Converts a range-based for-statement into a normal
10314 for-statement, as per the definition.
10316 for (RANGE_DECL : RANGE_EXPR)
10317 BLOCK
10319 should be equivalent to:
10321 {
10322 auto &&__range = RANGE_EXPR;
10323 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10324 __begin != __end;
10325 ++__begin)
10326 {
10327 RANGE_DECL = *__begin;
10328 BLOCK
10329 }
10330 }
10332 If RANGE_EXPR is an array:
10333 BEGIN_EXPR = __range
10334 END_EXPR = __range + ARRAY_SIZE(__range)
10335 Else if RANGE_EXPR has a member 'begin' or 'end':
10336 BEGIN_EXPR = __range.begin()
10337 END_EXPR = __range.end()
10338 Else:
10339 BEGIN_EXPR = begin(__range)
10340 END_EXPR = end(__range);
10342 If __range has a member 'begin' but not 'end', or vice versa, we must
10343 still use the second alternative (it will surely fail, however).
10344 When calling begin()/end() in the third alternative we must use
10345 argument dependent lookup, but always considering 'std' as an associated
10346 namespace. */
10348 tree
10351 {
10357 /* If an error happened previously do nothing or else a lot of
10358 unhelpful errors would be issued. */
10360 else
10361 {
10362 tree range_temp;
10366 /* Can't bind a reference to an array of runtime bound. */
10368 else
10369 {
10374 LOOKUP_ONLYCONVERTING);
10376 }
10379 }
10381 /* The new for initialization statement. */
10389 LOOKUP_ONLYCONVERTING);
10398 LOOKUP_ONLYCONVERTING);
10402 /* The new for condition. */
10409 /* The new increment expression. */
10412 tf_warning_or_error);
10415 /* The declaration is initialized with *__begin inside the loop body. */
10418 tf_warning_or_error),
10420 LOOKUP_ONLYCONVERTING);
10423 }
10425 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10426 We need to solve both at the same time because the method used
10427 depends on the existence of members begin or end.
10428 Returns the type deduced for the iterator expression. */
10430 static tree
10432 {
10434 {
10437 }
10440 {
10445 }
10447 {
10448 /* If RANGE is an array, we will use pointer arithmetic. */
10451 range,
10455 }
10456 else
10457 {
10458 /* If it is not an array, we must do a bit of magic. */
10468 tf_warning_or_error);
10471 tf_warning_or_error);
10474 {
10475 /* Use the member functions. */
10478 else
10484 else
10487 }
10488 else
10489 {
10490 /* Use global functions with ADL. */
10497 tf_warning_or_error);
10499 tf_warning_or_error);
10501 tf_warning_or_error);
10503 tf_warning_or_error);
10506 }
10508 /* Last common checks. */
10510 {
10511 /* If one of the expressions is an error do no more checks. */
10514 }
10517 /* Can happen, when, eg, in a template context, Koenig lookup
10518 can't resolve begin/end (c++/58503). */
10520 else
10521 {
10523 /* The unqualified type of the __begin and __end temporaries should
10524 be the same, as required by the multiple auto declaration. */
10530 }
10531 }
10532 }
10534 /* Helper function for cp_parser_perform_range_for_lookup.
10535 Builds a tree for RANGE.IDENTIFIER(). */
10537 static tree
10539 {
10552 tf_warning_or_error);
10555 }
10557 /* Parse an iteration-statement.
10559 iteration-statement:
10560 while ( condition ) statement
10561 do statement while ( expression ) ;
10562 for ( for-init-statement condition [opt] ; expression [opt] )
10563 statement
10565 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10567 static tree
10569 {
10572 tree statement;
10575 /* Peek at the next token. */
10580 /* Remember whether or not we are already within an iteration
10581 statement. */
10584 /* See what kind of keyword it is. */
10587 {
10589 {
10590 tree condition;
10592 /* Begin the while-statement. */
10594 /* Look for the `('. */
10596 /* Parse the condition. */
10599 /* Look for the `)'. */
10601 /* Parse the dependent statement. */
10605 /* We're done with the while-statement. */
10607 }
10611 {
10612 tree expression;
10614 /* Begin the do-statement. */
10616 /* Parse the body of the do-statement. */
10621 /* Look for the `while' keyword. */
10623 /* Look for the `('. */
10625 /* Parse the expression. */
10627 /* We're done with the do-statement. */
10629 /* Look for the `)'. */
10631 /* Look for the `;'. */
10633 }
10637 {
10638 /* Look for the `('. */
10643 /* Look for the `)'. */
10646 /* Parse the body of the for-statement. */
10651 /* We're done with the for-statement. */
10653 }
10660 }
10663 }
10665 /* Parse a for-init-statement or the declarator of a range-based-for.
10666 Returns true if a range-based-for declaration is seen.
10668 for-init-statement:
10669 expression-statement
10670 simple-declaration */
10672 static bool
10674 {
10675 /* If the next token is a `;', then we have an empty
10676 expression-statement. Grammatically, this is also a
10677 simple-declaration, but an invalid one, because it does not
10678 declare anything. Therefore, if we did not handle this case
10679 specially, we would issue an error message about an invalid
10680 declaration. */
10682 {
10688 /* We're going to speculatively look for a declaration, falling back
10689 to an expression, if necessary. */
10691 /* Parse the declaration. */
10694 decl);
10697 {
10698 /* It is a range-for, consume the ':' */
10702 {
10704 "range-based %<for%> loops are not allowed "
10707 }
10708 }
10709 else
10710 /* The ';' is not consumed yet because we told
10711 cp_parser_simple_declaration not to. */
10716 /* If the tentative parse failed, then we shall need to look for an
10717 expression-statement. */
10718 }
10719 /* If we are here, it is an expression-statement. */
10722 }
10724 /* Parse a jump-statement.
10726 jump-statement:
10727 break ;
10728 continue ;
10729 return expression [opt] ;
10730 return braced-init-list ;
10731 goto identifier ;
10733 GNU extension:
10735 jump-statement:
10736 goto * expression ;
10738 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10740 static tree
10742 {
10748 /* Peek at the next token. */
10753 /* See what kind of keyword it is. */
10756 {
10760 {
10780 }
10786 {
10793 /* Fall through. */
10803 }
10808 {
10809 tree expr;
10813 {
10817 }
10820 else
10821 /* If the next token is a `;', then there is no
10822 expression. */
10824 /* Build the return-statement. */
10826 /* Look for the final `;'. */
10828 }
10832 /* Create the goto-statement. */
10834 {
10835 /* Issue a warning about this use of a GNU extension. */
10837 /* Consume the '*' token. */
10839 /* Parse the dependent expression. */
10841 }
10842 else
10844 /* Look for the final `;'. */
10851 }
10854 }
10856 /* Parse a declaration-statement.
10858 declaration-statement:
10859 block-declaration */
10861 static void
10863 {
10866 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10869 /* Parse the block-declaration. */
10872 /* Free any declarators allocated. */
10874 }
10876 /* Some dependent statements (like `if (cond) statement'), are
10877 implicitly in their own scope. In other words, if the statement is
10878 a single statement (as opposed to a compound-statement), it is
10879 none-the-less treated as if it were enclosed in braces. Any
10880 declarations appearing in the dependent statement are out of scope
10881 after control passes that point. This function parses a statement,
10882 but ensures that is in its own scope, even if it is not a
10883 compound-statement.
10885 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10886 is a (possibly labeled) if statement which is not enclosed in
10887 braces and has an else clause. This is used to implement
10888 -Wparentheses.
10890 Returns the new statement. */
10892 static tree
10894 {
10895 tree statement;
10900 /* Mark if () ; with a special NOP_EXPR. */
10902 {
10906 }
10907 /* if a compound is opened, we simply parse the statement directly. */
10910 /* If the token is not a `{', then we must take special action. */
10911 else
10912 {
10913 /* Create a compound-statement. */
10915 /* Parse the dependent-statement. */
10917 /* Finish the dummy compound-statement. */
10919 }
10921 /* Return the statement. */
10923 }
10925 /* For some dependent statements (like `while (cond) statement'), we
10926 have already created a scope. Therefore, even if the dependent
10927 statement is a compound-statement, we do not want to create another
10928 scope. */
10930 static void
10932 {
10933 /* If the token is a `{', then we must take special action. */
10936 else
10937 {
10938 /* Avoid calling cp_parser_compound_statement, so that we
10939 don't create a new scope. Do everything else by hand. */
10941 /* If the next keyword is `__label__' we have a label declaration. */
10944 /* Parse an (optional) statement-seq. */
10947 }
10948 }
10950 /* Declarations [gram.dcl.dcl] */
10952 /* Parse an optional declaration-sequence.
10954 declaration-seq:
10955 declaration
10956 declaration-seq declaration */
10958 static void
10960 {
10962 {
10973 {
10974 /* A declaration consisting of a single semicolon is
10975 invalid. Allow it unless we're being pedantic. */
10980 }
10982 /* If we're entering or exiting a region that's implicitly
10983 extern "C", modify the lang context appropriately. */
10985 {
10988 }
10990 {
10993 }
10996 {
10997 /* A top-level declaration can consist solely of a #pragma.
10998 A nested declaration cannot, so this is done here and not
10999 in cp_parser_declaration. (A #pragma at block scope is
11000 handled in cp_parser_statement.) */
11003 }
11005 /* Parse the declaration itself. */
11007 }
11008 }
11010 /* Parse a declaration.
11012 declaration:
11013 block-declaration
11014 function-definition
11015 template-declaration
11016 explicit-instantiation
11017 explicit-specialization
11018 linkage-specification
11019 namespace-definition
11021 GNU extension:
11023 declaration:
11024 __extension__ declaration */
11026 static void
11028 {
11029 cp_token token1;
11030 cp_token token2;
11035 /* Check for the `__extension__' keyword. */
11037 {
11038 /* Parse the qualified declaration. */
11040 /* Restore the PEDANTIC flag. */
11044 }
11046 /* Try to figure out what kind of declaration is present. */
11051 else
11052 {
11055 }
11057 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11060 /* If the next token is `extern' and the following token is a string
11061 literal, then we have a linkage specification. */
11065 /* If the next token is `template', then we have either a template
11066 declaration, an explicit instantiation, or an explicit
11067 specialization. */
11069 {
11070 /* `template <>' indicates a template specialization. */
11074 /* `template <' indicates a template declaration. */
11077 /* Anything else must be an explicit instantiation. */
11078 else
11080 }
11081 /* If the next token is `export', then we have a template
11082 declaration. */
11085 /* If the next token is `extern', 'static' or 'inline' and the one
11086 after that is `template', we have a GNU extended explicit
11087 instantiation directive. */
11094 /* If the next token is `namespace', check for a named or unnamed
11095 namespace definition. */
11101 /* An unnamed namespace definition. */
11105 /* An inline (associated) namespace definition. */
11109 /* Objective-C++ declaration/definition. */
11116 /* We must have either a block declaration or a function
11117 definition. */
11118 else
11119 /* Try to parse a block-declaration, or a function-definition. */
11122 /* Free any declarators allocated. */
11124 }
11126 /* Parse a block-declaration.
11128 block-declaration:
11129 simple-declaration
11130 asm-definition
11131 namespace-alias-definition
11132 using-declaration
11133 using-directive
11135 GNU Extension:
11137 block-declaration:
11138 __extension__ block-declaration
11140 C++0x Extension:
11142 block-declaration:
11143 static_assert-declaration
11145 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11146 part of a declaration-statement. */
11148 static void
11151 {
11155 /* Check for the `__extension__' keyword. */
11157 {
11158 /* Parse the qualified declaration. */
11160 /* Restore the PEDANTIC flag. */
11164 }
11166 /* Peek at the next token to figure out which kind of declaration is
11167 present. */
11170 /* If the next keyword is `asm', we have an asm-definition. */
11172 {
11176 }
11177 /* If the next keyword is `namespace', we have a
11178 namespace-alias-definition. */
11181 /* If the next keyword is `using', we have a
11182 using-declaration, a using-directive, or an alias-declaration. */
11184 {
11189 /* If the token after `using' is `namespace', then we have a
11190 using-directive. */
11194 /* If the second token after 'using' is '=', then we have an
11195 alias-declaration. */
11201 /* Otherwise, it's a using-declaration. */
11202 else
11205 }
11206 /* If the next keyword is `__label__' we have a misplaced label
11207 declaration. */
11209 {
11213 /* If the next token is now a `;', consume it. */
11216 }
11217 /* If the next token is `static_assert' we have a static assertion. */
11220 /* Anything else must be a simple-declaration. */
11221 else
11224 }
11226 /* Parse a simple-declaration.
11228 simple-declaration:
11229 decl-specifier-seq [opt] init-declarator-list [opt] ;
11231 init-declarator-list:
11232 init-declarator
11233 init-declarator-list , init-declarator
11235 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11236 function-definition as a simple-declaration.
11238 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11239 parsed declaration if it is an uninitialized single declarator not followed
11240 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11241 if present, will not be consumed. */
11243 static void
11247 {
11248 cp_decl_specifier_seq decl_specifiers;
11255 /* Defer access checks until we know what is being declared; the
11256 checks for names appearing in the decl-specifier-seq should be
11257 done as if we were in the scope of the thing being declared. */
11260 /* Parse the decl-specifier-seq. We have to keep track of whether
11261 or not the decl-specifier-seq declares a named class or
11262 enumeration type, since that is the only case in which the
11263 init-declarator-list is allowed to be empty.
11265 [dcl.dcl]
11267 In a simple-declaration, the optional init-declarator-list can be
11268 omitted only when declaring a class or enumeration, that is when
11269 the decl-specifier-seq contains either a class-specifier, an
11270 elaborated-type-specifier, or an enum-specifier. */
11272 CP_PARSER_FLAGS_OPTIONAL,
11275 /* We no longer need to defer access checks. */
11278 /* In a block scope, a valid declaration must always have a
11279 decl-specifier-seq. By not trying to parse declarators, we can
11280 resolve the declaration/expression ambiguity more quickly. */
11283 {
11286 }
11288 /* If the next two tokens are both identifiers, the code is
11289 erroneous. The usual cause of this situation is code like:
11291 T t;
11293 where "T" should name a type -- but does not. */
11296 {
11297 /* If parsing tentatively, we should commit; we really are
11298 looking at a declaration. */
11300 /* Give up. */
11302 }
11304 /* If we have seen at least one decl-specifier, and the next token
11305 is not a parenthesis, then we must be looking at a declaration.
11306 (After "int (" we might be looking at a functional cast.) */
11313 /* Keep going until we hit the `;' at the end of the simple
11314 declaration. */
11317 CPP_SEMICOLON))
11318 {
11321 tree decl;
11324 {
11325 /* If we are processing next declarator, coma is expected */
11331 }
11332 else
11335 /* Parse the init-declarator. */
11338 function_definition_allowed_p,
11340 declares_class_or_enum,
11342 maybe_range_for_decl);
11343 /* If an error occurred while parsing tentatively, exit quickly.
11344 (That usually happens when in the body of a function; each
11345 statement is treated as a declaration-statement until proven
11346 otherwise.) */
11349 /* Handle function definitions specially. */
11351 {
11352 /* If the next token is a `,', then we are probably
11353 processing something like:
11355 void f() {}, *p;
11357 which is erroneous. */
11359 {
11362 "mixing"
11364 }
11365 /* Otherwise, we're done with the list of declarators. */
11366 else
11367 {
11370 }
11371 }
11374 /* The next token should be either a `,' or a `;'. */
11376 /* If it's a `,', there are more declarators to come. */
11379 /* If it's a `;', we are done. */
11382 /* Anything else is an error. */
11383 else
11384 {
11385 /* If we have already issued an error message we don't need
11386 to issue another one. */
11390 /* Skip tokens until we reach the end of the statement. */
11392 /* If the next token is now a `;', consume it. */
11396 }
11397 /* After the first time around, a function-definition is not
11398 allowed -- even if it was OK at first. For example:
11400 int i, f() {}
11402 is not valid. */
11404 }
11406 /* Issue an error message if no declarators are present, and the
11407 decl-specifier-seq does not itself declare a class or
11408 enumeration: [dcl.dcl]/3. */
11410 {
11412 {
11416 /* Ensure an error is issued anyway when finish_decltype_type,
11417 called via cp_parser_decl_specifier_seq, returns a class or
11418 an enumeration (c++/51786). */
11421 }
11422 /* Perform any deferred access checks. */
11424 }
11426 /* Consume the `;'. */
11430 done:
11432 }
11434 /* Parse a decl-specifier-seq.
11436 decl-specifier-seq:
11437 decl-specifier-seq [opt] decl-specifier
11438 decl-specifier attribute-specifier-seq [opt] (C++11)
11440 decl-specifier:
11441 storage-class-specifier
11442 type-specifier
11443 function-specifier
11444 friend
11445 typedef
11447 GNU Extension:
11449 decl-specifier:
11450 attributes
11452 Concepts Extension:
11454 decl-specifier:
11455 concept
11458 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11460 The parser flags FLAGS is used to control type-specifier parsing.
11462 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11463 flags:
11465 1: one of the decl-specifiers is an elaborated-type-specifier
11466 (i.e., a type declaration)
11467 2: one of the decl-specifiers is an enum-specifier or a
11468 class-specifier (i.e., a type definition)
11470 */
11472 static void
11474 cp_parser_flags flags,
11477 {
11481 cp_decl_spec ds;
11483 /* Clear DECL_SPECS. */
11486 /* Assume no class or enumeration type is declared. */
11489 /* Keep reading specifiers until there are no more to read. */
11491 {
11496 /* Peek at the next token. */
11499 /* Save the first token of the decl spec list for error
11500 reporting. */
11503 /* Handle attributes. */
11505 {
11506 /* Parse the attributes. */
11509 /* In a sequence of declaration specifiers, c++11 attributes
11510 appertain to the type that precede them. In that case
11511 [dcl.spec]/1 says:
11513 The attribute-specifier-seq affects the type only for
11514 the declaration it appears in, not other declarations
11515 involving the same type.
11517 But for now let's force the user to position the
11518 attribute either at the beginning of the declaration or
11519 after the declarator-id, which would clearly mean that it
11520 applies to the declarator. */
11522 {
11524 /* The c++11 attribute is at the beginning of the
11525 declaration. It appertains to the entity being
11527 else
11528 {
11530 {
11531 /* This is an attribute following a
11532 class-specifier. */
11537 }
11538 else
11539 {
11540 decl_specs->std_attributes
11542 attrs);
11545 }
11547 }
11548 }
11550 decl_specs->attributes
11552 attrs);
11556 }
11557 /* Assume we will find a decl-specifier keyword. */
11559 /* If the next token is an appropriate keyword, we can simply
11560 add it to the list. */
11562 {
11563 /* decl-specifier:
11564 friend
11565 constexpr */
11568 {
11571 }
11572 else
11573 {
11575 /* Consume the token. */
11577 }
11590 /* function-specifier:
11591 inline
11592 virtual
11593 explicit */
11600 /* decl-specifier:
11601 typedef */
11604 /* Consume the token. */
11606 /* A constructor declarator cannot appear in a typedef. */
11608 /* The "typedef" keyword can only occur in a declaration; we
11609 may as well commit at this point. */
11616 /* storage-class-specifier:
11617 auto
11618 register
11619 static
11620 extern
11621 mutable
11623 GNU Extension:
11624 thread */
11627 {
11628 /* Consume the token. */
11631 /* Complain about `auto' as a storage specifier, if
11632 we're complaining about C++0x compatibility. */
11636 /* Set the storage class anyway. */
11638 token);
11639 }
11640 else
11641 /* C++0x auto type-specifier. */
11649 /* Consume the token. */
11652 token);
11655 /* Consume the token. */
11661 /* We did not yet find a decl-specifier yet. */
11664 }
11674 /* Constructors are a special case. The `S' in `S()' is not a
11675 decl-specifier; it is the beginning of the declarator. */
11676 constructor_p
11677 = (!found_decl_spec
11678 && constructor_possible_p
11679 && (cp_parser_constructor_declarator_p
11682 /* If we don't have a DECL_SPEC yet, then we must be looking at
11683 a type-specifier. */
11685 {
11688 tree type_spec;
11690 type_spec
11692 decl_specs,
11698 /* If this type-specifier referenced a user-defined type
11699 (a typedef, class-name, etc.), then we can't allow any
11700 more such type-specifiers henceforth.
11702 [dcl.spec]
11704 The longest sequence of decl-specifiers that could
11705 possibly be a type name is taken as the
11706 decl-specifier-seq of a declaration. The sequence shall
11707 be self-consistent as described below.
11709 [dcl.type]
11711 As a general rule, at most one type-specifier is allowed
11712 in the complete decl-specifier-seq of a declaration. The
11713 only exceptions are the following:
11715 -- const or volatile can be combined with any other
11716 type-specifier.
11718 -- signed or unsigned can be combined with char, long,
11719 short, or int.
11721 -- ..
11723 Example:
11725 typedef char* Pc;
11726 void g (const int Pc);
11728 Here, Pc is *not* part of the decl-specifier seq; it's
11729 the declarator. Therefore, once we see a type-specifier
11730 (other than a cv-qualifier), we forbid any additional
11731 user-defined types. We *do* still allow things like `int
11732 int' to be considered a decl-specifier-seq, and issue the
11733 error message later. */
11736 /* A constructor declarator cannot follow a type-specifier. */
11738 {
11743 }
11744 }
11746 /* If we still do not have a DECL_SPEC, then there are no more
11747 decl-specifiers. */
11752 /* After we see one decl-specifier, further decl-specifiers are
11753 always optional. */
11755 }
11757 /* Don't allow a friend specifier with a class definition. */
11762 }
11764 /* Parse an (optional) storage-class-specifier.
11766 storage-class-specifier:
11767 auto
11768 register
11769 static
11770 extern
11771 mutable
11773 GNU Extension:
11775 storage-class-specifier:
11776 thread
11778 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11780 static tree
11782 {
11784 {
11788 /* Fall through for C++98. */
11795 /* Consume the token. */
11800 }
11801 }
11803 /* Parse an (optional) function-specifier.
11805 function-specifier:
11806 inline
11807 virtual
11808 explicit
11810 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11811 Updates DECL_SPECS, if it is non-NULL. */
11813 static tree
11816 {
11819 {
11825 /* 14.5.2.3 [temp.mem]
11827 A member function template shall not be virtual. */
11830 else
11840 }
11842 /* Consume the token. */
11844 }
11846 /* Parse a linkage-specification.
11848 linkage-specification:
11849 extern string-literal { declaration-seq [opt] }
11850 extern string-literal declaration */
11852 static void
11854 {
11855 tree linkage;
11857 /* Look for the `extern' keyword. */
11860 /* Look for the string-literal. */
11863 /* Transform the literal into an identifier. If the literal is a
11864 wide-character string, or contains embedded NULs, then we can't
11865 handle it as the user wants. */
11868 {
11870 /* Assume C++ linkage. */
11872 }
11873 else
11876 /* We're now using the new linkage. */
11879 /* If the next token is a `{', then we're using the first
11880 production. */
11882 {
11885 /* Consume the `{' token. */
11887 /* Parse the declarations. */
11889 /* Look for the closing `}'. */
11891 }
11892 /* Otherwise, there's just one declaration. */
11893 else
11894 {
11897 saved_in_unbraced_linkage_specification_p
11901 parser->in_unbraced_linkage_specification_p
11903 }
11905 /* We're done with the linkage-specification. */
11907 }
11909 /* Parse a static_assert-declaration.
11911 static_assert-declaration:
11912 static_assert ( constant-expression , string-literal ) ;
11914 If MEMBER_P, this static_assert is a class member. */
11916 static void
11918 {
11919 tree condition;
11920 tree message;
11922 location_t saved_loc;
11925 /* Peek at the `static_assert' token so we can keep track of exactly
11926 where the static assertion started. */
11930 /* Look for the `static_assert' keyword. */
11932 RT_STATIC_ASSERT))
11935 /* We know we are in a static assertion; commit to any tentative
11936 parse. */
11940 /* Parse the `(' starting the static assertion condition. */
11943 /* Parse the constant-expression. Allow a non-constant expression
11944 here in order to give better diagnostics in finish_static_assert. */
11945 condition =
11950 /* Parse the separating `,'. */
11953 /* Parse the string-literal message. */
11958 /* A `)' completes the static assertion. */
11965 /* A semicolon terminates the declaration. */
11968 /* Complete the static assertion, which may mean either processing
11969 the static assert now or saving it for template instantiation. */
11971 }
11973 /* Parse the expression in decltype ( expression ). */
11975 static tree
11978 {
11980 tree expr;
11982 /* First, try parsing an id-expression. */
11993 {
11996 cp_id_kind idk;
12000 /* Lookup the name we got back from the id-expression. */
12011 {
12012 /* Complete lookup of the id-expression. */
12013 expr = (finish_id_expression
12026 /* We found an id-expression, but it was something that we
12027 should not have found. This is an error, not something
12028 we can recover from, so note that we found an
12029 id-expression and we'll recover as gracefully as
12030 possible. */
12032 }
12037 /* We have an id-expression. */
12039 }
12042 {
12043 /* Abort the id-expression parse. */
12046 /* Parsing tentatively, again. */
12049 /* Parse a class member access. */
12057 /* We have an id-expression. */
12059 }
12062 /* We have parsed the complete id-expression or member access. */
12064 else
12065 {
12066 /* Abort our attempt to parse an id-expression or member access
12067 expression. */
12070 /* Parse a full expression. */
12073 }
12076 }
12078 /* Parse a `decltype' type. Returns the type.
12080 simple-type-specifier:
12081 decltype ( expression )
12082 C++14 proposal:
12083 decltype ( auto ) */
12085 static tree
12087 {
12088 tree expr;
12097 {
12098 /* Already parsed. */
12101 }
12103 /* Look for the `decltype' token. */
12107 /* Parse the opening `('. */
12111 /* decltype (auto) */
12114 {
12121 }
12123 /* Types cannot be defined in a `decltype' expression. Save away the
12124 old message. */
12127 /* And create the new one. */
12128 parser->type_definition_forbidden_message
12131 /* The restrictions on constant-expressions do not apply inside
12132 decltype expressions. */
12133 saved_integral_constant_expression_p
12135 saved_non_integral_constant_expression_p
12139 /* Within a parenthesized expression, a `>' token is always
12140 the greater-than operator. */
12141 saved_greater_than_is_operator_p
12145 /* Do not actually evaluate the expression. */
12148 /* Do not warn about problems with the expression. */
12153 /* Go back to evaluating expressions. */
12157 /* The `>' token might be the end of a template-id or
12158 template-parameter-list now. */
12159 parser->greater_than_is_operator_p
12162 /* Restore the old message and the integral constant expression
12163 flags. */
12165 parser->integral_constant_expression_p
12167 parser->non_integral_constant_expression_p
12170 /* Parse to the closing `)'. */
12172 {
12176 }
12179 tf_warning_or_error);
12181 rewrite:
12182 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12183 it again. */
12190 }
12192 /* Special member functions [gram.special] */
12194 /* Parse a conversion-function-id.
12196 conversion-function-id:
12197 operator conversion-type-id
12199 Returns an IDENTIFIER_NODE representing the operator. */
12201 static tree
12203 {
12204 tree type;
12205 tree saved_scope;
12206 tree saved_qualifying_scope;
12207 tree saved_object_scope;
12210 /* Look for the `operator' token. */
12213 /* When we parse the conversion-type-id, the current scope will be
12214 reset. However, we need that information in able to look up the
12215 conversion function later, so we save it here. */
12219 /* We must enter the scope of the class so that the names of
12220 entities declared within the class are available in the
12221 conversion-type-id. For example, consider:
12223 struct S {
12224 typedef int I;
12225 operator I();
12226 };
12228 S::operator I() { ... }
12230 In order to see that `I' is a type-name in the definition, we
12231 must be in the scope of `S'. */
12234 /* Parse the conversion-type-id. */
12236 /* Leave the scope of the class, if any. */
12239 /* Restore the saved scope. */
12243 /* If the TYPE is invalid, indicate failure. */
12247 }
12249 /* Parse a conversion-type-id:
12251 conversion-type-id:
12252 type-specifier-seq conversion-declarator [opt]
12254 Returns the TYPE specified. */
12256 static tree
12258 {
12259 tree attributes;
12260 cp_decl_specifier_seq type_specifiers;
12262 tree type_specified;
12265 /* Parse the attributes. */
12269 parser->type_definition_forbidden_message
12272 /* Parse the type-specifiers. */
12279 /* If that didn't work, stop. */
12282 /* Parse the conversion-declarator. */
12290 /* Don't give this error when parsing tentatively. This happens to
12291 work because we always parse this definitively once. */
12294 {
12296 {
12299 }
12303 }
12306 }
12308 /* Parse an (optional) conversion-declarator.
12310 conversion-declarator:
12311 ptr-operator conversion-declarator [opt]
12313 */
12317 {
12320 cp_cv_quals cv_quals;
12322 /* We don't know if there's a ptr-operator next, or not. */
12324 /* Try the ptr-operator. */
12327 /* If it worked, look for more conversion-declarators. */
12329 {
12332 /* Parse another optional declarator. */
12335 declarator = cp_parser_make_indirect_declarator
12339 }
12342 }
12344 /* Parse an (optional) ctor-initializer.
12346 ctor-initializer:
12347 : mem-initializer-list
12349 Returns TRUE iff the ctor-initializer was actually present. */
12351 static bool
12353 {
12354 /* If the next token is not a `:', then there is no
12355 ctor-initializer. */
12357 {
12358 /* Do default initialization of any bases and members. */
12363 }
12365 /* Consume the `:' token. */
12367 /* And the mem-initializer-list. */
12371 }
12373 /* Parse a mem-initializer-list.
12375 mem-initializer-list:
12376 mem-initializer ... [opt]
12377 mem-initializer ... [opt] , mem-initializer-list */
12379 static void
12381 {
12386 /* Let the semantic analysis code know that we are starting the
12387 mem-initializer-list. */
12392 /* Loop through the list. */
12394 {
12395 tree mem_initializer;
12398 /* Parse the mem-initializer. */
12400 /* If the next token is a `...', we're expanding member initializers. */
12402 {
12403 /* Consume the `...'. */
12406 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12407 can be expanded but members cannot. */
12410 {
12415 }
12417 /* Construct the pack expansion type. */
12420 }
12423 {
12427 }
12428 /* Look for a target constructor. */
12432 {
12435 {
12439 }
12441 }
12442 /* Add it to the list, unless it was erroneous. */
12444 {
12447 }
12448 /* If the next token is not a `,', we're done. */
12451 /* Consume the `,' token. */
12453 }
12455 /* Perform semantic analysis. */
12458 }
12460 /* Parse a mem-initializer.
12462 mem-initializer:
12463 mem-initializer-id ( expression-list [opt] )
12464 mem-initializer-id braced-init-list
12466 GNU extension:
12468 mem-initializer:
12469 ( expression-list [opt] )
12471 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12472 class) or FIELD_DECL (for a non-static data member) to initialize;
12473 the TREE_VALUE is the expression-list. An empty initialization
12474 list is represented by void_list_node. */
12476 static tree
12478 {
12479 tree mem_initializer_id;
12480 tree expression_list;
12481 tree member;
12484 /* Find out what is being initialized. */
12486 {
12490 }
12491 else
12492 {
12496 }
12502 {
12509 }
12510 else
12511 {
12521 }
12531 }
12533 /* Parse a mem-initializer-id.
12535 mem-initializer-id:
12536 :: [opt] nested-name-specifier [opt] class-name
12537 identifier
12539 Returns a TYPE indicating the class to be initializer for the first
12540 production. Returns an IDENTIFIER_NODE indicating the data member
12541 to be initialized for the second production. */
12543 static tree
12545 {
12549 tree id;
12553 /* `typename' is not allowed in this context ([temp.res]). */
12555 {
12557 "keyword %<typename%> not allowed in this context (a qualified "
12560 }
12561 /* Look for the optional `::' operator. */
12562 global_scope_p
12566 /* Look for the optional nested-name-specifier. The simplest way to
12567 implement:
12569 [temp.res]
12571 The keyword `typename' is not permitted in a base-specifier or
12572 mem-initializer; in these contexts a qualified name that
12573 depends on a template-parameter is implicitly assumed to be a
12574 type name.
12576 is to assume that we have seen the `typename' keyword at this
12577 point. */
12578 nested_name_specifier_p
12587 /* If there is a `::' operator or a nested-name-specifier, then we
12588 are definitely looking for a class-name. */
12593 typename_type,
12597 /* Otherwise, we could also be looking for an ordinary identifier. */
12599 /* Try a class-name. */
12603 none_type,
12607 /* If we found one, we're done. */
12610 /* Otherwise, look for an ordinary identifier. */
12612 }
12614 /* Overloading [gram.over] */
12616 /* Parse an operator-function-id.
12618 operator-function-id:
12619 operator operator
12621 Returns an IDENTIFIER_NODE for the operator which is a
12622 human-readable spelling of the identifier, e.g., `operator +'. */
12624 static tree
12626 {
12627 /* Look for the `operator' keyword. */
12630 /* And then the name of the operator itself. */
12632 }
12634 /* Return an identifier node for a user-defined literal operator.
12635 The suffix identifier is chained to the operator name identifier. */
12637 static tree
12639 {
12640 tree identifier;
12647 }
12649 /* Parse an operator.
12651 operator:
12652 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12653 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12654 || ++ -- , ->* -> () []
12656 GNU Extensions:
12658 operator:
12659 <? >? <?= >?=
12661 Returns an IDENTIFIER_NODE for the operator which is a
12662 human-readable spelling of the identifier, e.g., `operator +'. */
12664 static tree
12666 {
12671 /* Peek at the next token. */
12673 /* Figure out which operator we have. */
12675 {
12677 {
12680 /* The keyword should be either `new' or `delete'. */
12685 else
12688 /* Consume the `new' or `delete' token. */
12691 /* Peek at the next token. */
12693 /* If it's a `[' token then this is the array variant of the
12694 operator. */
12696 {
12697 /* Consume the `[' token. */
12699 /* Look for the `]' token. */
12703 }
12704 /* Otherwise, we have the non-array variant. */
12705 else
12709 }
12856 /* Consume the `('. */
12858 /* Look for the matching `)'. */
12863 /* Consume the `['. */
12865 /* Look for the matching `]'. */
12874 /* Fall through. */
12880 {
12883 }
12885 {
12888 }
12889 /* Consume the string. */
12891 /* Look for the suffix identifier. */
12894 {
12897 {
12900 }
12901 }
12903 {
12907 }
12908 else
12909 {
12912 }
12919 /* Fall through. */
12925 {
12928 }
12929 {
12932 {
12935 }
12937 /* Consume the user-defined string literal. */
12940 {
12943 }
12944 else
12946 }
12949 /* Anything else is an error. */
12951 }
12953 /* If we have selected an identifier, we need to consume the
12954 operator token. */
12957 /* Otherwise, no valid operator name was present. */
12958 else
12959 {
12962 }
12965 }
12967 /* Parse a template-declaration.
12969 template-declaration:
12970 export [opt] template < template-parameter-list > declaration
12972 If MEMBER_P is TRUE, this template-declaration occurs within a
12973 class-specifier.
12975 The grammar rule given by the standard isn't correct. What
12976 is really meant is:
12978 template-declaration:
12979 export [opt] template-parameter-list-seq
12980 decl-specifier-seq [opt] init-declarator [opt] ;
12981 export [opt] template-parameter-list-seq
12982 function-definition
12984 template-parameter-list-seq:
12985 template-parameter-list-seq [opt]
12986 template < template-parameter-list >
12988 Concept Extensions:
12990 template-parameter-list-seq:
12991 template < template-parameter-list > template-requirement [opt]
12993 template-requirement:
12994 requires logical-or-expression
12995 */
12997 static void
12999 {
13000 /* Check for `export'. */
13002 {
13003 /* Consume the `export' token. */
13005 /* Warn that we do not support `export'. */
13007 }
13010 }
13012 /* Parse a template-parameter-list.
13014 template-parameter-list:
13015 template-parameter
13016 template-parameter-list , template-parameter
13018 Returns a TREE_LIST. Each node represents a template parameter.
13019 The nodes are connected via their TREE_CHAINs. */
13021 static tree
13023 {
13028 /* The loop below parses the template parms. We first need to know
13029 the total number of template parms to be able to compute proper
13030 canonical types of each dependent type. So after the loop, when
13031 we know the total number of template parms,
13032 end_template_parm_list computes the proper canonical types and
13033 fixes up the dependent types accordingly. */
13035 {
13036 tree parameter;
13039 location_t parm_loc;
13041 /* Parse the template-parameter. */
13046 /* Add it to the list. */
13049 parm_loc,
13050 parameter,
13051 is_non_type,
13052 is_parameter_pack);
13053 else
13054 {
13057 }
13059 /* If the next token is not a `,', we're done. */
13062 /* Otherwise, consume the `,' token. */
13064 }
13067 }
13069 // Returns true if PARM declares a constrained-parameter.
13072 {
13080 }
13083 // Check that the type parameter is only a declarator-id, and that its
13084 // type is not cv-qualified.
13085 bool
13088 {
13089 // Don't ptr, ref, function, or array declarators for a constrained type
13090 // or templtae template parameter.
13092 {
13095 }
13097 // Don't allow cv-qualified type parameters.
13100 {
13103 }
13106 }
13108 // Finish parsing/processing a template type parameter and chekcing
13109 // various restrictions.
13112 tree id,
13114 {
13117 else
13119 }
13121 // Finish parsing/processing a template template parameter by borrowing
13122 // the template parameter list from the prototype parameter.
13123 static tree
13125 tree proto,
13126 tree id,
13128 {
13132 // FIXME: This should probably be copied, and we may need to adjust
13133 // the template parameter depths.
13142 }
13144 // Create a new non-type template parameter from the given PARM declarator.
13145 static tree
13148 {
13154 }
13156 // Build a constrained template parameter based on the PARMDECL
13157 // declarator. The type of PARMDECL is the constrained type, which
13158 // refers to the prototype template parameter that ultimately
13159 // specifies the type of the declared parameter.
13160 static tree
13165 {
13171 // Remember if the user declared this as a parameter pack and
13172 // erase that flag on the annotation. Template packs are dealt
13173 // with separately.
13178 // Is the prototype a parameter pack? If so, but the declaration
13179 // does not include "...", then emit an error.
13184 // The prototype is a template parameter pack, then the resulting
13185 // parameter also needs to be a pack.
13189 // Build the parameter. Return an error if the declarator
13190 // was invalid.
13191 tree parm;
13196 else
13201 // Finish the parameter decl and create a node attaching the
13202 // default argument and constraint.
13206 }
13209 /* Parse a template-parameter.
13211 template-parameter:
13212 type-parameter
13213 parameter-declaration
13215 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13216 the parameter. The TREE_PURPOSE is the default value, if any.
13217 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13218 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13219 set to true iff this parameter is a parameter pack. */
13221 static tree
13224 {
13228 tree parm;
13230 /* Assume it is a type parameter or a template parameter. */
13232 /* Assume it not a parameter pack. */
13234 /* Peek at the next token. */
13236 /* If it is `class' or `template', we have a type-parameter. */
13239 /* If it is `class' or `typename' we do not know yet whether it is a
13240 type parameter or a non-type parameter. Consider:
13242 template <typename T, typename T::X X> ...
13244 or:
13246 template <class C, class D*> ...
13248 Here, the first parameter is a type parameter, and the second is
13249 a non-type parameter. We can tell by looking at the token after
13250 the identifier -- if it is a `,', `=', or `>' then we have a type
13251 parameter. */
13253 {
13254 /* Peek at the token after `class' or `typename'. */
13256 /* If it's an ellipsis, we have a template type parameter
13257 pack. */
13260 /* If it's an identifier, skip it. */
13263 /* Now, see if the token looks like the end of a template
13264 parameter. */
13269 }
13271 /* Otherwise, it is a non-type parameter.
13273 [temp.param]
13275 When parsing a default template-argument for a non-type
13276 template-parameter, the first non-nested `>' is taken as the end
13277 of the template parameter-list rather than a greater-than
13278 operator. */
13279 parameter_declarator
13286 // The parameter may have been constrained.
13289 parameter_declarator,
13290 is_non_type,
13291 is_parameter_pack);
13293 // Now we're sure that the parameter is a non-type parameter.
13296 /* If the parameter declaration is marked as a parameter pack, set
13297 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13298 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13299 grokdeclarator. */
13302 {
13305 }
13308 {
13309 /* Can happen in some cases of erroneous input (c++/34892). */
13311 /* Consume the `...' for better error recovery. */
13313 }
13314 /* If the next token is an ellipsis, and we don't already have it
13315 marked as a parameter pack, then we have a parameter pack (that
13316 has no declarator). */
13319 && (declarator_can_be_parameter_pack
13321 {
13322 /* Consume the `...'. */
13327 }
13328 /* We might end up with a pack expansion as the type of the non-type
13329 template parameter, in which case this is a non-type template
13330 parameter pack. */
13333 {
13337 }
13340 {
13341 /* Parameter packs cannot have default arguments. However, a
13342 user may try to do so, so we'll parse them and give an
13343 appropriate diagnostic here. */
13347 /* Find the name of the parameter pack. */
13356 else
13360 /* Parse the default argument, but throw away the result. */
13362 }
13372 }
13374 /* Parse a type-parameter.
13376 type-parameter:
13377 class identifier [opt]
13378 class identifier [opt] = type-id
13379 typename identifier [opt]
13380 typename identifier [opt] = type-id
13381 template < template-parameter-list > class identifier [opt]
13382 template < template-parameter-list > class identifier [opt]
13383 = id-expression
13385 GNU Extension (variadic templates):
13387 type-parameter:
13388 class ... identifier [opt]
13389 typename ... identifier [opt]
13391 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13392 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13393 the declaration of the parameter.
13395 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13397 static tree
13399 {
13401 tree parameter;
13403 /* Look for a keyword to tell us what kind of parameter this is. */
13409 {
13412 {
13413 tree identifier;
13414 tree default_argument;
13416 /* If the next token is an ellipsis, we have a template
13417 argument pack. */
13419 {
13420 /* Consume the `...' token. */
13425 }
13427 /* If the next token is an identifier, then it names the
13428 parameter. */
13431 else
13434 /* Create the parameter. */
13437 /* If the next token is an `=', we have a default argument. */
13439 {
13440 /* Consume the `=' token. */
13442 /* Parse the default-argument. */
13446 /* Template parameter packs cannot have default
13447 arguments. */
13449 {
13452 "template parameter pack %qD cannot have a "
13454 else
13456 "template parameter packs cannot have "
13459 }
13461 }
13462 else
13465 /* Create the combined representation of the parameter and the
13466 default argument. */
13468 }
13472 {
13473 tree identifier;
13474 tree default_argument;
13476 // Save the current requirements before parsing the
13477 // template parameter list.
13480 /* Look for the `<'. */
13482 /* Parse the template-parameter-list. */
13484 /* Look for the `>'. */
13487 // If template requirements are present, parse them.
13489 {
13495 // Attach the constraints to the parameter list.
13498 }
13500 /* Look for the `class' keyword. */
13502 /* If the next token is an ellipsis, we have a template
13503 argument pack. */
13505 {
13506 /* Consume the `...' token. */
13511 }
13512 /* If the next token is an `=', then there is a
13513 default-argument. If the next token is a `>', we are at
13514 the end of the parameter-list. If the next token is a `,',
13515 then we are at the end of this parameter. */
13519 {
13521 /* Treat invalid names as if the parameter were nameless. */
13524 }
13525 else
13528 /* Create the template parameter. */
13530 identifier);
13532 // Restore the saved constraints.
13535 /* If the next token is an `=', then there is a
13536 default-argument. */
13538 {
13541 /* Consume the `='. */
13543 /* Parse the id-expression. */
13545 /* save token before parsing the id-expression, for error
13546 reporting */
13548 default_argument
13556 /* If the id-expression was a template-id that refers to
13557 a template-class, we already have the declaration here,
13558 so no further lookup is needed. */
13559 ;
13560 else
13561 /* Look up the name. */
13562 default_argument
13564 none_type,
13570 /* See if the default argument is valid. */
13571 default_argument
13574 /* Template parameter packs cannot have default
13575 arguments. */
13577 {
13580 "template parameter pack %qD cannot "
13582 identifier);
13583 else
13587 }
13589 }
13590 else
13593 /* Create the combined representation of the parameter and the
13594 default argument. */
13596 }
13602 }
13605 }
13607 /* Parse a template-id.
13609 template-id:
13610 template-name < template-argument-list [opt] >
13612 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13613 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13614 returned. Otherwise, if the template-name names a function, or set
13615 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13616 names a class, returns a TYPE_DECL for the specialization.
13618 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13619 uninstantiated templates. */
13621 static tree
13627 {
13629 tree templ;
13630 tree arguments;
13631 tree template_id;
13638 /* If the next token corresponds to a template-id, there is no need
13639 to reparse it. */
13642 {
13645 /* Get the stored value. */
13647 /* Perform any access checks that were deferred. */
13650 {
13655 tf_warning_or_error);
13656 }
13657 /* Return the stored value. */
13659 }
13661 /* Avoid performing name lookup if there is no possibility of
13662 finding a template-id. */
13665 && !cp_parser_nth_token_starts_template_argument_list_p
13667 {
13670 }
13672 /* Remember where the template-id starts. */
13678 /* Parse the template-name. */
13681 check_dependency_p,
13682 is_declaration,
13683 tag_type,
13686 {
13689 }
13691 /* If we find the sequence `[:' after a template-name, it's probably
13692 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13693 parse correctly the argument list. */
13700 {
13702 /* Change `:' into `::'. */
13704 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13705 CPP_LESS. */
13708 /* Parse the arguments. */
13711 {
13712 /* If we couldn't parse an argument list, then we revert our changes
13713 and return simply an error. Maybe this is not a template-id
13714 after all. */
13719 }
13720 /* Otherwise, emit an error about the invalid digraph, but continue
13721 parsing because we got our argument list. */
13724 {
13727 "%<<:%> is an alternate spelling for %<[%>."
13730 {
13732 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13735 }
13736 }
13737 }
13738 else
13739 {
13740 /* Look for the `<' that starts the template-argument-list. */
13742 {
13745 }
13746 /* Parse the arguments. */
13748 }
13750 /* Build a representation of the specialization. */
13753 TEMPLATE_ID_EXPR,
13757 {
13759 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13760 template (rather than some instantiation thereof) only if
13761 is not nested within some other construct. For example, in
13762 "template <typename T> void f(T) { A<T>::", A<T> is just an
13763 instantiation of A. */
13766 CPP_SCOPE));
13767 template_id
13769 }
13770 else
13771 {
13772 /* If it's not a class-template or a template-template, it should be
13773 a function-template. */
13779 }
13781 /* If parsing tentatively, replace the sequence of tokens that makes
13782 up the template-id with a CPP_TEMPLATE_ID token. That way,
13783 should we re-parse the token stream, we will not have to repeat
13784 the effort required to do the parse, nor will we issue duplicate
13785 error messages about problems during instantiation of the
13786 template. */
13788 /* Don't do this if we had a parse error in a declarator; re-parsing
13789 might succeed if a name changes meaning (60361). */
13793 {
13796 /* Reset the contents of the START_OF_ID token. */
13798 /* Retrieve any deferred checks. Do not pop this access checks yet
13799 so the memory will not be reclaimed during token replacing below. */
13805 /* Purge all subsequent tokens. */
13808 /* ??? Can we actually assume that, if template_id ==
13809 error_mark_node, we will have issued a diagnostic to the
13810 user, as opposed to simply marking the tentative parse as
13811 failed? */
13814 }
13818 }
13820 /* Parse a template-name.
13822 template-name:
13823 identifier
13825 The standard should actually say:
13827 template-name:
13828 identifier
13829 operator-function-id
13831 A defect report has been filed about this issue.
13833 A conversion-function-id cannot be a template name because they cannot
13834 be part of a template-id. In fact, looking at this code:
13836 a.operator K<int>()
13838 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13839 It is impossible to call a templated conversion-function-id with an
13840 explicit argument list, since the only allowed template parameter is
13841 the type to which it is converting.
13843 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13844 `template' keyword, in a construction like:
13846 T::template f<3>()
13848 In that case `f' is taken to be a template-name, even though there
13849 is no way of knowing for sure.
13851 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13852 name refers to a set of overloaded functions, at least one of which
13853 is a template, or an IDENTIFIER_NODE with the name of the template,
13854 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13855 names are looked up inside uninstantiated templates. */
13857 static tree
13864 {
13865 tree identifier;
13866 tree decl;
13867 tree fns;
13870 /* If the next token is `operator', then we have either an
13871 operator-function-id or a conversion-function-id. */
13873 {
13874 /* We don't know whether we're looking at an
13875 operator-function-id or a conversion-function-id. */
13877 /* Try an operator-function-id. */
13879 /* If that didn't work, try a conversion-function-id. */
13881 {
13884 }
13885 }
13886 /* Look for the identifier. */
13887 else
13890 /* If we didn't find an identifier, we don't have a template-id. */
13894 /* If the name immediately followed the `template' keyword, then it
13895 is a template-name. However, if the next token is not `<', then
13896 we do not treat it as a template-name, since it is not being used
13897 as part of a template-id. This enables us to handle constructs
13898 like:
13900 template <typename T> struct S { S(); };
13901 template <typename T> S<T>::S();
13903 correctly. We would treat `S' as a template -- if it were `S<T>'
13904 -- but we do not if there is no `<'. */
13908 {
13909 /* In a declaration, in a dependent context, we pretend that the
13910 "template" keyword was present in order to improve error
13911 recovery. For example, given:
13913 template <typename T> void f(T::X<int>);
13915 we want to treat "X<int>" as a template-id. */
13917 && !template_keyword_p
13919 && check_dependency_p
13921 /* Do not do this for dtors (or ctors), since they never
13922 need the template keyword before their name. */
13924 {
13927 /* Explain what went wrong. */
13929 identifier);
13932 /* If parsing tentatively, find the location of the "<" token. */
13935 /* Parse the template arguments so that we can issue error
13936 messages about them. */
13939 /* Skip tokens until we find a good place from which to
13940 continue parsing. */
13945 /* If parsing tentatively, permanently remove the
13946 template argument list. That will prevent duplicate
13947 error messages from being issued about the missing
13948 "template" keyword. */
13954 }
13956 /* If the "template" keyword is present, then there is generally
13957 no point in doing name-lookup, so we just return IDENTIFIER.
13958 But, if the qualifying scope is non-dependent then we can
13959 (and must) do name-lookup normally. */
13965 }
13967 /* Look up the name. */
13969 tag_type,
13972 check_dependency_p,
13976 /* If DECL is a template, then the name was a template-name. */
13978 ;
13979 else
13980 {
13983 /* The standard does not explicitly indicate whether a name that
13984 names a set of overloaded declarations, some of which are
13985 templates, is a template-name. However, such a name should
13986 be a template-name; otherwise, there is no way to form a
13987 template-id for the overloaded templates. */
13995 {
13996 /* The name does not name a template. */
13999 }
14000 }
14002 /* If DECL is dependent, and refers to a function, then just return
14003 its name; we will look it up again during template instantiation. */
14005 {
14009 }
14012 }
14014 /* Parse a template-argument-list.
14016 template-argument-list:
14017 template-argument ... [opt]
14018 template-argument-list , template-argument ... [opt]
14020 Returns a TREE_VEC containing the arguments. */
14022 static tree
14024 {
14029 tree vec;
14036 /* Even if the template-id appears in an integral
14037 constant-expression, the contents of the argument list do
14038 not. */
14044 /* Parse the arguments. */
14045 do
14046 {
14047 tree argument;
14050 /* Consume the comma. */
14053 /* Parse the template-argument. */
14056 /* If the next token is an ellipsis, we're expanding a template
14057 argument pack. */
14059 {
14061 {
14065 }
14066 /* Consume the `...' token. */
14069 /* Make the argument into a TYPE_PACK_EXPANSION or
14070 EXPR_PACK_EXPANSION. */
14072 }
14075 {
14079 {
14082 }
14083 else
14085 }
14087 }
14100 #ifdef ENABLE_CHECKING
14102 #endif
14104 }
14106 /* Parse a template-argument.
14108 template-argument:
14109 assignment-expression
14110 type-id
14111 id-expression
14113 The representation is that of an assignment-expression, type-id, or
14114 id-expression -- except that the qualified id-expression is
14115 evaluated, so that the value returned is either a DECL or an
14116 OVERLOAD.
14118 Although the standard says "assignment-expression", it forbids
14119 throw-expressions or assignments in the template argument.
14120 Therefore, we use "conditional-expression" instead. */
14122 static tree
14124 {
14125 tree argument;
14131 cp_id_kind idk;
14133 /* There's really no way to know what we're looking at, so we just
14134 try each alternative in order.
14136 [temp.arg]
14138 In a template-argument, an ambiguity between a type-id and an
14139 expression is resolved to a type-id, regardless of the form of
14140 the corresponding template-parameter.
14142 Therefore, we try a type-id first. */
14145 /* If there was no error parsing the type-id but the next token is a
14146 '>>', our behavior depends on which dialect of C++ we're
14147 parsing. In C++98, we probably found a typo for '> >'. But there
14148 are type-id which are also valid expressions. For instance:
14150 struct X { int operator >> (int); };
14151 template <int V> struct Foo {};
14152 Foo<X () >> 5> r;
14154 Here 'X()' is a valid type-id of a function type, but the user just
14155 wanted to write the expression "X() >> 5". Thus, we remember that we
14156 found a valid type-id, but we still try to parse the argument as an
14157 expression to see what happens.
14159 In C++0x, the '>>' will be considered two separate '>'
14160 tokens. */
14164 {
14167 }
14168 else
14169 {
14170 /* If the next token isn't a `,' or a `>', then this argument wasn't
14171 really finished. This means that the argument is not a valid
14172 type-id. */
14175 /* If that worked, we're done. */
14178 }
14179 /* We're still not sure what the argument will be. */
14181 /* Try a template. */
14189 /* If the next token isn't a `,' or a `>', then this argument wasn't
14190 really finished. */
14194 {
14195 /* Figure out what is being referred to. If the id-expression
14196 was for a class template specialization, then we will have a
14197 TYPE_DECL at this point. There is no need to do name lookup
14198 at this point in that case. */
14201 none_type,
14210 }
14213 /* It must be a non-type argument. There permitted cases are given
14214 in [temp.arg.nontype]:
14216 -- an integral constant-expression of integral or enumeration
14217 type; or
14219 -- the name of a non-type template-parameter; or
14221 -- the name of an object or function with external linkage...
14223 -- the address of an object or function with external linkage...
14225 -- a pointer to member... */
14226 /* Look for a non-type template parameter. */
14228 {
14240 }
14242 /* If the next token is "&", the argument must be the address of an
14243 object or function with external linkage. */
14246 {
14249 }
14250 /* See if we might have an id-expression. */
14257 {
14260 address_p,
14267 else
14268 {
14269 tree probe;
14272 {
14273 /* Strip the dereference temporarily. */
14276 }
14278 /* If we're in a template, we represent a qualified-id referring
14279 to a static data member as a SCOPE_REF even if the scope isn't
14280 dependent so that we can check access control later. */
14285 {
14286 /* A variable without external linkage might still be a
14287 valid constant-expression, so no error is issued here
14288 if the external-linkage check fails. */
14291 }
14293 /* All overloaded functions are allowed; if the external
14294 linkage test does not pass, an error will be issued
14295 later. */
14296 ;
14300 /* A pointer-to-member. */
14301 ;
14303 ;
14304 else
14308 {
14311 tf_warning_or_error);
14312 else
14315 }
14316 }
14317 }
14318 /* If the argument started with "&", there are no other valid
14319 alternatives at this point. */
14321 {
14324 }
14326 /* If the argument wasn't successfully parsed as a type-id followed
14327 by '>>', the argument can only be a constant expression now.
14328 Otherwise, we try parsing the constant-expression tentatively,
14329 because the argument could really be a type-id. */
14341 /* We did our best to parse the argument as a non type-id, but that
14342 was the only alternative that matched (albeit with a '>' after
14343 it). We can assume it's just a typo from the user, and a
14344 diagnostic will then be issued. */
14346 }
14348 /* Parse an explicit-instantiation.
14350 explicit-instantiation:
14351 template declaration
14353 Although the standard says `declaration', what it really means is:
14355 explicit-instantiation:
14356 template decl-specifier-seq [opt] declarator [opt] ;
14358 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14359 supposed to be allowed. A defect report has been filed about this
14360 issue.
14362 GNU Extension:
14364 explicit-instantiation:
14365 storage-class-specifier template
14366 decl-specifier-seq [opt] declarator [opt] ;
14367 function-specifier template
14368 decl-specifier-seq [opt] declarator [opt] ; */
14370 static void
14372 {
14374 cp_decl_specifier_seq decl_specifiers;
14379 /* Look for an (optional) storage-class-specifier or
14380 function-specifier. */
14382 {
14383 extension_specifier
14386 extension_specifier
14389 }
14391 /* Look for the `template' keyword. */
14393 /* Let the front end know that we are processing an explicit
14394 instantiation. */
14396 /* [temp.explicit] says that we are supposed to ignore access
14397 control while processing explicit instantiation directives. */
14399 /* Parse a decl-specifier-seq. */
14401 CP_PARSER_FLAGS_OPTIONAL,
14404 /* If there was exactly one decl-specifier, and it declared a class,
14405 and there's no declarator, then we have an explicit type
14406 instantiation. */
14408 {
14409 tree type;
14413 /* Turn access control back on for names used during
14414 template instantiation. */
14419 }
14420 else
14421 {
14423 tree decl;
14425 /* Parse the declarator. */
14426 declarator
14436 {
14439 "explicit instantiation shall not use"
14443 "explicit instantiation shall not use"
14448 /* Turn access control back on for names used during
14449 template instantiation. */
14451 /* Do the explicit instantiation. */
14453 }
14454 else
14455 {
14457 /* Skip the body of the explicit instantiation. */
14459 }
14460 }
14461 /* We're done with the instantiation. */
14467 }
14469 /* Parse an explicit-specialization.
14471 explicit-specialization:
14472 template < > declaration
14474 Although the standard says `declaration', what it really means is:
14476 explicit-specialization:
14477 template <> decl-specifier [opt] init-declarator [opt] ;
14478 template <> function-definition
14479 template <> explicit-specialization
14480 template <> template-declaration */
14482 static void
14484 {
14488 /* Look for the `template' keyword. */
14490 /* Look for the `<'. */
14492 /* Look for the `>'. */
14494 /* We have processed another parameter list. */
14496 /* [temp]
14498 A template ... explicit specialization ... shall not have C
14499 linkage. */
14501 {
14503 /* Give it C++ linkage to avoid confusing other parts of the
14504 front end. */
14507 }
14508 else
14510 /* Let the front end know that we are beginning a specialization. */
14512 {
14515 }
14517 /* If the next keyword is `template', we need to figure out whether
14518 or not we're looking a template-declaration. */
14520 {
14525 else
14527 }
14528 else
14529 /* Parse the dependent declaration. */
14535 /* We're done with the specialization. */
14537 /* For the erroneous case of a template with C linkage, we pushed an
14538 implicit C++ linkage scope; exit that scope now. */
14541 /* We're done with this parameter list. */
14543 }
14545 /* Parse a type-specifier.
14547 type-specifier:
14548 simple-type-specifier
14549 class-specifier
14550 enum-specifier
14551 elaborated-type-specifier
14552 cv-qualifier
14554 GNU Extension:
14556 type-specifier:
14557 __complex__
14559 Returns a representation of the type-specifier. For a
14560 class-specifier, enum-specifier, or elaborated-type-specifier, a
14561 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14563 The parser flags FLAGS is used to control type-specifier parsing.
14565 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14566 in a decl-specifier-seq.
14568 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14569 class-specifier, enum-specifier, or elaborated-type-specifier, then
14570 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14571 if a type is declared; 2 if it is defined. Otherwise, it is set to
14572 zero.
14574 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14575 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14576 is set to FALSE. */
14578 static tree
14580 cp_parser_flags flags,
14585 {
14591 /* Assume this type-specifier does not declare a new type. */
14594 /* And that it does not specify a cv-qualifier. */
14597 /* Peek at the next token. */
14600 /* If we're looking at a keyword, we can use that to guide the
14601 production we choose. */
14604 {
14609 /* Look for the enum-specifier. */
14611 /* If that worked, we're done. */
14613 {
14618 type_spec,
14619 token,
14622 }
14623 else
14626 /* Any of these indicate either a class-specifier, or an
14627 elaborated-type-specifier. */
14634 /* Parse tentatively so that we can back up if we don't find a
14635 class-specifier. */
14637 /* Look for the class-specifier. */
14640 /* If that worked, we're done. */
14642 {
14647 type_spec,
14648 token,
14651 }
14653 /* Fall through. */
14654 elaborated_type_specifier:
14655 /* We're declaring (not defining) a class or enum. */
14659 /* Fall through. */
14661 /* Look for an elaborated-type-specifier. */
14662 type_spec
14663 = (cp_parser_elaborated_type_specifier
14666 is_declaration));
14669 type_spec,
14670 token,
14693 /* The `__complex__' keyword is a GNU extension. */
14699 }
14701 /* Handle simple keywords. */
14703 {
14705 {
14708 }
14710 }
14712 /* If we do not already have a type-specifier, assume we are looking
14713 at a simple-type-specifier. */
14715 decl_specs,
14716 flags);
14718 /* If we didn't find a type-specifier, and a type-specifier was not
14719 optional in this context, issue an error message. */
14721 {
14724 }
14727 }
14729 /* Parse a simple-type-specifier.
14731 simple-type-specifier:
14732 :: [opt] nested-name-specifier [opt] type-name
14733 :: [opt] nested-name-specifier template template-id
14734 char
14735 wchar_t
14736 bool
14737 short
14738 int
14739 long
14740 signed
14741 unsigned
14742 float
14743 double
14744 void
14746 C++0x Extension:
14748 simple-type-specifier:
14749 auto
14750 decltype ( expression )
14751 char16_t
14752 char32_t
14753 __underlying_type ( type-id )
14755 GNU Extension:
14757 simple-type-specifier:
14758 __int128
14759 __typeof__ unary-expression
14760 __typeof__ ( type-id )
14761 __typeof__ ( type-id ) { initializer-list , [opt] }
14763 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14764 appropriately updated. */
14766 static tree
14769 cp_parser_flags flags)
14770 {
14774 /* Peek at the next token. */
14777 /* If we're looking at a keyword, things are easy. */
14779 {
14839 {
14843 {
14846 "use of %<auto%> in lambda parameter declaration "
14847 "only available with "
14849 }
14852 "use of %<auto%> in parameter declaration "
14853 "only available with "
14855 else
14857 "ISO C++ forbids use of %<auto%> in parameter "
14859 }
14860 else
14865 /* Since DR 743, decltype can either be a simple-type-specifier by
14866 itself or begin a nested-name-specifier. Parsing it will replace
14867 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14868 handling below decide what to do. */
14874 /* Consume the `typeof' token. */
14876 /* Parse the operand to `typeof'. */
14878 /* If it is not already a TYPE, take its type. */
14884 token,
14893 token,
14903 token,
14908 }
14910 /* If token is an already-parsed decltype not followed by ::,
14911 it's a simple-type-specifier. */
14914 {
14918 token,
14922 }
14924 /* If the type-specifier was for a built-in type, we're done. */
14926 {
14927 /* Record the type. */
14934 type,
14935 token,
14940 /* Consume the token. */
14943 /* There is no valid C++ program where a non-template type is
14944 followed by a "<". That usually indicates that the user thought
14945 that the type was a template. */
14950 }
14952 /* The type-specifier must be a user-defined type. */
14954 {
14958 /* Don't gobble tokens or issue error messages if this is an
14959 optional type-specifier. */
14963 /* Look for the optional `::' operator. */
14964 global_p
14968 /* Look for the nested-name specifier. */
14969 qualified_p
14977 /* If we have seen a nested-name-specifier, and the next token
14978 is `template', then we are using the template-id production. */
14981 {
14982 /* Look for the template-id. */
14986 none_type,
14988 /* If the template-id did not name a type, we are out of
14989 luck. */
14991 {
14994 }
14995 }
14996 /* Otherwise, look for a type-name. */
14997 else
14999 /* Keep track of all name-lookups performed in class scopes. */
15001 && !global_p
15002 && !qualified_p
15006 /* If it didn't work out, we don't have a TYPE. */
15012 token,
15014 }
15016 /* If we didn't get a type-name, issue an error message. */
15018 {
15021 }
15024 {
15025 /* See if TYPE is an Objective-C type, and if so, parse and
15026 accept any protocol references following it. Do this before
15027 the cp_parser_check_for_invalid_template_id() call, because
15028 Objective-C types can be followed by '<...>' which would
15029 enclose protocol names rather than template arguments, and so
15030 everything is fine. */
15033 {
15037 /* Clobber the "unqualified" type previously entered into
15038 DECL_SPECS with the new, improved protocol-qualified version. */
15043 }
15045 /* There is no valid C++ program where a non-template type is
15046 followed by a "<". That usually indicates that the user
15047 thought that the type was a template. */
15049 none_type,
15051 }
15054 }
15056 /* Parse a type-name.
15058 type-name:
15059 class-name
15060 enum-name
15061 typedef-name
15062 simple-template-id [in c++0x]
15064 enum-name:
15065 identifier
15067 typedef-name:
15068 identifier
15070 Concepts:
15072 type-name:
15073 concept-name
15075 concept-name:
15076 identifier
15078 Returns a TYPE_DECL for the type. */
15080 static tree
15082 {
15083 tree type_decl;
15085 /* We can't know yet whether it is a class-name or not. */
15087 /* Try a class-name. */
15091 none_type,
15095 /* If it's not a class-name, keep looking. */
15097 {
15099 /* It must be a typedef-name or an enum-name. */
15103 /* It is either a simple-template-id representing an
15104 instantiation of an alias template... */
15108 none_type,
15110 /* Note that this must be an instantiation of an alias template
15111 because [temp.names]/6 says:
15113 A template-id that names an alias template specialization
15114 is a type-name.
15116 Whereas [temp.names]/7 says:
15118 A simple-template-id that names a class template
15119 specialization is a class-name. */
15124 else
15128 /* ... Or a typedef-name or an enum-name. */
15130 }
15133 }
15137 // If DECL refers to a concept, return a TYPE_DECL representing the result
15138 // of using the constrained type specifier in the current context.
15140 // DECL refers to a concept if
15141 // - it is an overload set containing a function concept taking a single
15142 // type argument, or
15143 // - it is a variable concept taking a single type argument
15144 //
15145 //
15146 // TODO: DECL could be a variable concept.
15147 static tree
15149 {
15152 // Try to build a call expression that evaluates the concept. This
15153 // can fail if the overload set refers only to non-templates.
15158 // Resolve the constraint check to deduce the declared parameter.
15163 // Get function and argument from the resolved check expression. If
15164 // the argument was a pack expansion, then get the first element
15165 // of that pack.
15171 // Get the protyping parameter bound to the placeholder.
15174 // In template paramteer scope, this results in a constrained parameter.
15175 // Return a descriptor of that parm.
15179 // In a parameter-declaration-clause, constrained-type specifiers
15180 // result in invented template parameters.
15182 {
15186 }
15188 // A concept-name appearing in a result-type constraint is a
15189 // constrained auto. Meaning that type deduction will be applied
15190 // and the constraint checked.
15191 //
15192 // TODO: Actually bind the constraint to the auto.
15196 // FIXME: What other contexts accept a constrained-type-specifier?
15197 // - variable declarations
15198 // - trailing return types
15201 }
15203 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
15204 or a concept-name.
15206 enum-name:
15207 identifier
15209 typedef-name:
15210 identifier
15212 concept-name:
15213 identifier
15215 Returns a TYPE_DECL for the type. */
15217 static tree
15219 {
15220 tree type_decl;
15221 tree identifier;
15228 /* Look up the type-name. */
15232 // If we found an overload set, then it may refer to a concept-name.
15233 //
15234 // TODO: The name could also refer to a variable template or an
15235 // introduction (if followed by '{').
15237 {
15238 // Determine whether the overload refers to a concept.
15241 }
15244 {
15248 {
15249 /* We have found a type introduced by a using
15250 declaration at class scope that refers to a dependent
15251 type.
15253 using typename :: [opt] nested-name-specifier unqualified-id ;
15254 */
15260 }
15261 }
15265 {
15266 /* See if this is an Objective-C type. */
15271 }
15273 /* Issue an error if we did not find a type-name. */
15275 /* In Objective-C, we have the complication that class names are
15276 normally type names and start declarations (eg, the
15277 "NSObject" in "NSObject *object;"), but can be used in an
15278 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15279 is an expression. So, a classname followed by a dot is not a
15280 valid type-name. */
15283 {
15288 }
15289 /* Remember that the name was used in the definition of the
15290 current class so that we can check later to see if the
15291 meaning would have been different after the class was
15292 entirely defined. */
15298 }
15300 /* Parse an elaborated-type-specifier. Note that the grammar given
15301 here incorporates the resolution to DR68.
15303 elaborated-type-specifier:
15304 class-key :: [opt] nested-name-specifier [opt] identifier
15305 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15306 enum-key :: [opt] nested-name-specifier [opt] identifier
15307 typename :: [opt] nested-name-specifier identifier
15308 typename :: [opt] nested-name-specifier template [opt]
15309 template-id
15311 GNU extension:
15313 elaborated-type-specifier:
15314 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15315 class-key attributes :: [opt] nested-name-specifier [opt]
15316 template [opt] template-id
15317 enum attributes :: [opt] nested-name-specifier [opt] identifier
15319 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15320 declared `friend'. If IS_DECLARATION is TRUE, then this
15321 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15322 something is being declared.
15324 Returns the TYPE specified. */
15326 static tree
15330 {
15332 tree identifier;
15335 tree globalscope;
15338 /* See if we're looking at the `enum' keyword. */
15340 {
15341 /* Consume the `enum' token. */
15343 /* Remember that it's an enumeration type. */
15345 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15346 enums) is used here. */
15349 {
15353 /* Consume the `struct' or `class' and parse it anyway. */
15355 }
15356 /* Parse the attributes. */
15358 }
15359 /* Or, it might be `typename'. */
15361 RID_TYPENAME))
15362 {
15363 /* Consume the `typename' token. */
15365 /* Remember that it's a `typename' type. */
15367 }
15368 /* Otherwise it must be a class-key. */
15369 else
15370 {
15374 /* Parse the attributes. */
15376 }
15378 /* Look for the `::' operator. */
15381 /* Look for the nested-name-specifier. */
15383 {
15388 is_declaration))
15390 }
15391 else
15392 /* Even though `typename' is not present, the proposed resolution
15393 to Core Issue 180 says that in `class A<T>::B', `B' should be
15394 considered a type-name, even if `A<T>' is dependent. */
15399 is_declaration);
15400 /* For everything but enumeration types, consider a template-id.
15401 For an enumeration type, consider only a plain identifier. */
15403 {
15405 tree decl;
15407 /* Allow the `template' keyword. */
15409 /* If we didn't see `template', we don't know if there's a
15410 template-id or not. */
15413 /* Parse the template-id. */
15417 tag_type,
15418 is_declaration);
15419 /* If we didn't find a template-id, look for an ordinary
15420 identifier. */
15422 ;
15423 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15424 in effect, then we must assume that, upon instantiation, the
15425 template will correspond to a class. */
15429 typename_type,
15431 /* If the `typename' keyword is in effect and DECL is not a type
15432 decl, then type is non existent. */
15434 ;
15440 }
15443 {
15448 {
15451 }
15453 /* For a `typename', we needn't call xref_tag. */
15457 identifier,
15459 /* Look up a qualified name in the usual way. */
15461 {
15462 tree decl;
15463 tree ambiguous_decls;
15466 tag_type,
15473 /* If the lookup was ambiguous, an error will already have been
15474 issued. */
15478 /* If we are parsing friend declaration, DECL may be a
15479 TEMPLATE_DECL tree node here. However, we need to check
15480 whether this TEMPLATE_DECL results in valid code. Consider
15481 the following example:
15483 namespace N {
15484 template <class T> class C {};
15485 }
15486 class X {
15487 template <class T> friend class N::C; // #1, valid code
15488 };
15489 template <class T> class Y {
15490 friend class N::C; // #2, invalid code
15491 };
15493 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15494 name lookup of `N::C'. We see that friend declaration must
15495 be template for the code to be valid. Note that
15496 processing_template_decl does not work here since it is
15497 always 1 for the above two cases. */
15499 decl = (cp_parser_maybe_treat_template_as_class
15504 {
15507 identifier,
15510 }
15513 {
15517 allow_template);
15521 }
15523 /* Forward declarations of nested types, such as
15525 class C1::C2;
15526 class C1::C2::C3;
15528 are invalid unless all components preceding the final '::'
15529 are complete. If all enclosing types are complete, these
15530 declarations become merely pointless.
15532 Invalid forward declarations of nested types are errors
15533 caught elsewhere in parsing. Those that are pointless arrive
15534 here. */
15541 }
15542 else
15543 {
15544 /* An elaborated-type-specifier sometimes introduces a new type and
15545 sometimes names an existing type. Normally, the rule is that it
15546 introduces a new type only if there is not an existing type of
15547 the same name already in scope. For example, given:
15549 struct S {};
15550 void f() { struct S s; }
15552 the `struct S' in the body of `f' is the same `struct S' as in
15553 the global scope; the existing definition is used. However, if
15554 there were no global declaration, this would introduce a new
15555 local class named `S'.
15557 An exception to this rule applies to the following code:
15559 namespace N { struct S; }
15561 Here, the elaborated-type-specifier names a new type
15562 unconditionally; even if there is already an `S' in the
15563 containing scope this declaration names a new type.
15564 This exception only applies if the elaborated-type-specifier
15565 forms the complete declaration:
15567 [class.name]
15569 A declaration consisting solely of `class-key identifier ;' is
15570 either a redeclaration of the name in the current scope or a
15571 forward declaration of the identifier as a class name. It
15572 introduces the name into the current scope.
15574 We are in this situation precisely when the next token is a `;'.
15576 An exception to the exception is that a `friend' declaration does
15577 *not* name a new type; i.e., given:
15579 struct S { friend struct T; };
15581 `T' is not a new type in the scope of `S'.
15583 Also, `new struct S' or `sizeof (struct S)' never results in the
15584 definition of a new type; a new type can only be declared in a
15585 declaration context. */
15587 tag_scope ts;
15591 /* Friends have special name lookup rules. */
15595 CPP_SEMICOLON))
15596 /* This is a `class-key identifier ;' */
15598 else
15601 template_p =
15605 /* An unqualified name was used to reference this type, so
15606 there were no qualifying templates. */
15613 }
15614 }
15619 /* Allow attributes on forward declarations of classes. */
15621 {
15631 else
15634 }
15637 {
15638 /* Indicate whether this class was declared as a `class' or as a
15639 `struct'. */
15643 }
15645 /* A "<" cannot follow an elaborated type specifier. If that
15646 happens, the user was probably trying to form a template-id. */
15651 }
15653 /* Parse an enum-specifier.
15655 enum-specifier:
15656 enum-head { enumerator-list [opt] }
15657 enum-head { enumerator-list , } [C++0x]
15659 enum-head:
15660 enum-key identifier [opt] enum-base [opt]
15661 enum-key nested-name-specifier identifier enum-base [opt]
15663 enum-key:
15664 enum
15665 enum class [C++0x]
15666 enum struct [C++0x]
15668 enum-base: [C++0x]
15669 : type-specifier-seq
15671 opaque-enum-specifier:
15672 enum-key identifier enum-base [opt] ;
15674 GNU Extensions:
15675 enum-key attributes[opt] identifier [opt] enum-base [opt]
15676 { enumerator-list [opt] }attributes[opt]
15677 enum-key attributes[opt] identifier [opt] enum-base [opt]
15678 { enumerator-list, }attributes[opt] [C++0x]
15680 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15681 if the token stream isn't an enum-specifier after all. */
15683 static tree
15685 {
15686 tree identifier;
15688 tree prev_scope;
15690 tree attributes;
15703 /* Parse tentatively so that we can back up if we don't find a
15704 enum-specifier. */
15707 /* Caller guarantees that the current token is 'enum', an identifier
15708 possibly follows, and the token after that is an opening brace.
15709 If we don't have an identifier, fabricate an anonymous name for
15710 the enumeration being defined. */
15713 /* Parse the "class" or "struct", which indicates a scoped
15714 enumeration type in C++0x. */
15717 {
15721 /* Consume the `struct' or `class' token. */
15725 }
15729 /* Clear the qualification. */
15734 /* Figure out in what scope the declaration is being placed. */
15740 nested_name_specifier
15748 {
15749 tree name;
15753 enum_type,
15758 input_location);
15760 {
15763 {
15764 /* Are template enums allowed in ISO? */
15768 /* ignore a typename reference, for it will be solved by name
15769 in start_enum. */
15771 }
15772 }
15775 else
15778 }
15779 else
15780 {
15783 else
15784 {
15790 }
15791 }
15794 /* Check for the `:' that denotes a specified underlying type in C++0x.
15795 Note that a ':' could also indicate a bitfield width, however. */
15797 {
15798 cp_decl_specifier_seq type_specifiers;
15800 /* Consume the `:'. */
15803 /* Parse the type-specifier-seq. */
15808 /* At this point this is surely not elaborated type specifier. */
15817 /* If that didn't work, stop. */
15819 {
15825 }
15826 }
15828 /* Look for the `{' but don't consume it yet. */
15830 {
15832 {
15835 {
15838 }
15839 }
15840 /* An opaque-enum-specifier must have a ';' here. */
15843 {
15846 {
15849 }
15850 }
15851 }
15857 {
15859 {
15863 }
15865 {
15867 }
15868 }
15870 /* Issue an error message if type-definitions are forbidden here. */
15873 else
15874 /* Create the new type. We do this before consuming the opening
15875 brace so the enum will be recorded as being on the line of its
15876 tag (or the 'enum' keyword, if there is no tag). */
15880 /* If the next token is not '{' it is an opaque-enum-specifier or an
15881 elaborated-type-specifier. */
15883 {
15887 {
15888 /* The following catches invalid code such as:
15889 enum class S<int>::E { A, B, C }; */
15897 {
15901 nested_name_specifier);
15903 }
15904 /* If that scope does not contain the scope in which the
15905 class was originally declared, the program is invalid. */
15907 nested_name_specifier))
15908 {
15911 "declaration of %qD in namespace %qD which does not "
15914 else
15916 "declaration of %qD in %qD which does not "
15920 }
15921 }
15926 /* Consume the opening brace. */
15933 {
15937 }
15938 else
15939 {
15945 }
15949 /* If the next token is not '}', then there are some enumerators. */
15951 {
15955 }
15956 else
15959 /* Consume the final '}'. */
15965 }
15966 else
15967 {
15968 /* If a ';' follows, then it is an opaque-enum-specifier
15969 and additional restrictions apply. */
15971 {
15978 }
15979 }
15981 /* Look for trailing attributes to apply to this enumeration, and
15982 apply them if appropriate. */
15984 {
15988 trailing_attr,
15990 }
15992 /* Finish up the enumeration. */
15994 {
15999 }
16002 {
16004 {
16007 }
16009 {
16011 }
16012 }
16013 out:
16016 }
16018 /* Parse an enumerator-list. The enumerators all have the indicated
16019 TYPE.
16021 enumerator-list:
16022 enumerator-definition
16023 enumerator-list , enumerator-definition */
16025 static void
16027 {
16029 {
16030 /* Parse an enumerator-definition. */
16033 /* If the next token is not a ',', we've reached the end of
16034 the list. */
16037 /* Otherwise, consume the `,' and keep going. */
16039 /* If the next token is a `}', there is a trailing comma. */
16041 {
16046 }
16047 }
16048 }
16050 /* Parse an enumerator-definition. The enumerator has the indicated
16051 TYPE.
16053 enumerator-definition:
16054 enumerator
16055 enumerator = constant-expression
16057 enumerator:
16058 identifier */
16060 static void
16062 {
16063 tree identifier;
16064 tree value;
16065 location_t loc;
16067 /* Save the input location because we are interested in the location
16068 of the identifier and not the location of the explicit value. */
16071 /* Look for the identifier. */
16076 /* If the next token is an '=', then there is an explicit value. */
16078 {
16079 /* Consume the `=' token. */
16081 /* Parse the value. */
16084 NULL);
16085 }
16086 else
16089 /* If we are processing a template, make sure the initializer of the
16090 enumerator doesn't contain any bare template parameter pack. */
16094 /* integral_constant_value will pull out this expression, so make sure
16095 it's folded as appropriate. */
16098 /* Create the enumerator. */
16100 }
16102 /* Parse a namespace-name.
16104 namespace-name:
16105 original-namespace-name
16106 namespace-alias
16108 Returns the NAMESPACE_DECL for the namespace. */
16110 static tree
16112 {
16113 tree identifier;
16114 tree namespace_decl;
16118 /* Get the name of the namespace. */
16123 /* Look up the identifier in the currently active scope. Look only
16124 for namespaces, due to:
16126 [basic.lookup.udir]
16128 When looking up a namespace-name in a using-directive or alias
16129 definition, only namespace names are considered.
16131 And:
16133 [basic.lookup.qual]
16135 During the lookup of a name preceding the :: scope resolution
16136 operator, object, function, and enumerator names are ignored.
16138 (Note that cp_parser_qualifying_entity only calls this
16139 function if the token after the name is the scope resolution
16140 operator.) */
16142 none_type,
16148 /* If it's not a namespace, issue an error. */
16151 {
16156 }
16159 }
16161 /* Parse a namespace-definition.
16163 namespace-definition:
16164 named-namespace-definition
16165 unnamed-namespace-definition
16167 named-namespace-definition:
16168 original-namespace-definition
16169 extension-namespace-definition
16171 original-namespace-definition:
16172 namespace identifier { namespace-body }
16174 extension-namespace-definition:
16175 namespace original-namespace-name { namespace-body }
16177 unnamed-namespace-definition:
16178 namespace { namespace-body } */
16180 static void
16182 {
16189 {
16193 }
16194 else
16197 /* Look for the `namespace' keyword. */
16200 /* Get the name of the namespace. We do not attempt to distinguish
16201 between an original-namespace-definition and an
16202 extension-namespace-definition at this point. The semantic
16203 analysis routines are responsible for that. */
16206 else
16209 /* Parse any specified attributes. */
16212 /* Look for the `{' to start the namespace. */
16214 /* Start the namespace. */
16217 /* "inline namespace" is equivalent to a stub namespace definition
16218 followed by a strong using directive. */
16220 {
16222 /* Set up namespace association. */
16226 /* Import the contents of the inline namespace. */
16230 }
16234 /* Parse the body of the namespace. */
16240 /* Finish the namespace. */
16242 /* Look for the final `}'. */
16244 }
16246 /* Parse a namespace-body.
16248 namespace-body:
16249 declaration-seq [opt] */
16251 static void
16253 {
16255 }
16257 /* Parse a namespace-alias-definition.
16259 namespace-alias-definition:
16260 namespace identifier = qualified-namespace-specifier ; */
16262 static void
16264 {
16265 tree identifier;
16266 tree namespace_specifier;
16270 /* Look for the `namespace' keyword. */
16272 /* Look for the identifier. */
16276 /* Look for the `=' token. */
16279 {
16281 /* Skip the definition. */
16286 }
16288 /* Look for the qualified-namespace-specifier. */
16289 namespace_specifier
16291 /* Look for the `;' token. */
16294 /* Register the alias in the symbol table. */
16296 }
16298 /* Parse a qualified-namespace-specifier.
16300 qualified-namespace-specifier:
16301 :: [opt] nested-name-specifier [opt] namespace-name
16303 Returns a NAMESPACE_DECL corresponding to the specified
16304 namespace. */
16306 static tree
16308 {
16309 /* Look for the optional `::'. */
16313 /* Look for the optional nested-name-specifier. */
16321 }
16323 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16324 access declaration.
16326 using-declaration:
16327 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16328 using :: unqualified-id ;
16330 access-declaration:
16331 qualified-id ;
16333 */
16335 static bool
16338 {
16342 tree decl;
16343 tree identifier;
16344 tree qscope;
16349 {
16352 }
16353 else
16354 {
16355 /* Look for the `using' keyword. */
16358 /* Peek at the next token. */
16360 /* See if it's `typename'. */
16362 {
16363 /* Remember that we've seen it. */
16365 /* Consume the `typename' token. */
16367 }
16368 }
16370 /* Look for the optional global scope qualification. */
16371 global_scope_p
16376 /* If we saw `typename', or didn't see `::', then there must be a
16377 nested-name-specifier present. */
16379 {
16385 {
16388 }
16389 }
16390 /* Otherwise, we could be in either of the two productions. In that
16391 case, treat the nested-name-specifier as optional. */
16392 else
16402 /* Something has already gone wrong; there's no need to parse
16403 further. Since an error has occurred, the return value of
16404 cp_parser_parse_definitely will be false, as required. */
16408 /* Parse the unqualified-id. */
16416 {
16421 }
16423 /* The function we call to handle a using-declaration is different
16424 depending on what scope we are in. */
16426 ;
16429 /* [namespace.udecl]
16431 A using declaration shall not name a template-id. */
16434 else
16435 {
16437 {
16438 /* Create the USING_DECL. */
16445 {
16448 }
16449 else
16450 /* Add it to the list of members in this class. */
16452 }
16453 else
16454 {
16456 identifier,
16463 {
16466 }
16469 else
16471 }
16472 }
16474 /* Look for the final `;'. */
16479 "access declarations are deprecated "
16480 "in favour of using-declarations; "
16484 }
16486 /* Parse an alias-declaration.
16488 alias-declaration:
16489 using identifier attribute-specifier-seq [opt] = type-id */
16491 static tree
16493 {
16495 location_t id_location;
16497 cp_decl_specifier_seq decl_specs;
16501 /* Look for the `using' keyword. */
16502 cp_token *using_token
16524 /* Now we are going to parse the type-id of the declaration. */
16526 /*
16527 [dcl.type]/3 says:
16529 "A type-specifier-seq shall not define a class or enumeration
16530 unless it appears in the type-id of an alias-declaration (7.1.3) that
16531 is not the declaration of a template-declaration."
16533 In other words, if we currently are in an alias template, the
16534 type-id should not define a type.
16536 So let's set parser->type_definition_forbidden_message in that
16537 case; cp_parser_check_type_definition (called by
16538 cp_parser_class_specifier) will then emit an error if a type is
16539 defined in the type-id. */
16541 {
16545 }
16549 /* Restore the error message if need be. */
16555 {
16558 }
16560 /* A typedef-name can also be introduced by an alias-declaration. The
16561 identifier following the using keyword becomes a typedef-name. It has
16562 the same semantics as if it were introduced by the typedef
16563 specifier. In particular, it does not define a new type and it shall
16564 not appear in the type-id. */
16569 {
16572 ds_attribute,
16573 attrs_token);
16574 }
16576 ds_typedef,
16577 using_token);
16579 ds_alias,
16580 using_token);
16589 else
16600 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16601 added into the symbol table; otherwise, return the TYPE_DECL. */
16605 {
16609 }
16612 }
16614 /* Parse a using-directive.
16616 using-directive:
16617 using namespace :: [opt] nested-name-specifier [opt]
16618 namespace-name ; */
16620 static void
16622 {
16623 tree namespace_decl;
16624 tree attribs;
16626 /* Look for the `using' keyword. */
16628 /* And the `namespace' keyword. */
16630 /* Look for the optional `::' operator. */
16632 /* And the optional nested-name-specifier. */
16638 /* Get the namespace being used. */
16640 /* And any specified attributes. */
16642 /* Update the symbol table. */
16644 /* Look for the final `;'. */
16646 }
16648 /* Parse an asm-definition.
16650 asm-definition:
16651 asm ( string-literal ) ;
16653 GNU Extension:
16655 asm-definition:
16656 asm volatile [opt] ( string-literal ) ;
16657 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16658 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16659 : asm-operand-list [opt] ) ;
16660 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16661 : asm-operand-list [opt]
16662 : asm-clobber-list [opt] ) ;
16663 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16664 : asm-clobber-list [opt]
16665 : asm-goto-list ) ; */
16667 static void
16669 {
16670 tree string;
16675 tree asm_stmt;
16683 /* Look for the `asm' keyword. */
16685 /* See if the next token is `volatile'. */
16688 {
16689 /* Remember that we saw the `volatile' keyword. */
16691 /* Consume the token. */
16693 }
16697 {
16698 /* Remember that we saw the `goto' keyword. */
16700 /* Consume the token. */
16702 }
16703 /* Look for the opening `('. */
16706 /* Look for the string. */
16709 {
16713 }
16715 /* If we're allowing GNU extensions, check for the extended assembly
16716 syntax. Unfortunately, the `:' tokens need not be separated by
16717 a space in C, and so, for compatibility, we tolerate that here
16718 too. Doing that means that we have to treat the `::' operator as
16719 two `:' tokens. */
16724 {
16729 /* The extended syntax was used. */
16732 /* Look for outputs. */
16734 {
16735 /* Consume the `:'. */
16737 /* Parse the output-operands. */
16739 CPP_COLON)
16741 CPP_SCOPE)
16743 CPP_CLOSE_PAREN)
16749 }
16750 /* If the next token is `::', there are no outputs, and the
16751 next token is the beginning of the inputs. */
16753 /* The inputs are coming next. */
16756 /* Look for inputs. */
16759 {
16760 /* Consume the `:' or `::'. */
16762 /* Parse the output-operands. */
16764 CPP_COLON)
16766 CPP_SCOPE)
16768 CPP_CLOSE_PAREN))
16773 }
16775 /* The clobbers are coming next. */
16778 /* Look for clobbers. */
16781 {
16783 /* Consume the `:' or `::'. */
16785 /* Parse the clobbers. */
16787 CPP_COLON)
16789 CPP_CLOSE_PAREN))
16791 }
16794 /* The labels are coming next. */
16797 /* Look for labels. */
16800 {
16802 /* Consume the `:' or `::'. */
16804 /* Parse the labels. */
16806 }
16810 }
16814 /* Look for the closing `)'. */
16822 {
16823 /* Create the ASM_EXPR. */
16825 {
16828 /* If the extended syntax was not used, mark the ASM_EXPR. */
16830 {
16836 }
16837 }
16838 else
16840 }
16841 }
16843 // An RAII guard that manages the current template reuqirememts. The
16844 // constructor takes a boolean value, SAVE that, when true, resets
16845 // the current template requirements on construction. Otherwise, no change
16846 // is made. When the destructor is invoked, the current template requirements
16847 // are reset (made null) preventing subsequent parsing routines from using
16848 // them.
16851 tree reqs;
16853 // Construct the guard. If SAVE is true, the current requirements
16854 // saved and reset. Otherwise, no action is taken.
16857 { }
16860 {
16862 }
16863 };
16865 // A DECLARATOR may have a trailing requires clause; it may also have
16866 // requirements introduced through the use of terse notation in the
16867 // declaration of function parameters. Returns the parsed and analyzed
16868 // template requirements.
16869 static tree
16871 {
16873 {
16874 // Get any constraints induced by the terse notaiton.
16879 // An optional requires clause can yield an additional constraint.
16882 // If requirements were specified in either the implicit
16883 // template parameter list or an explicit requires clause,
16884 // prepare to associate those with the declaration.
16887 }
16890 }
16893 /* Declarators [gram.dcl.decl] */
16895 /* Parse an init-declarator.
16897 init-declarator:
16898 declarator initializer [opt]
16900 GNU Extension:
16902 init-declarator:
16903 declarator asm-specification [opt] attributes [opt] initializer [opt]
16905 function-definition:
16906 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16907 function-body
16908 decl-specifier-seq [opt] declarator function-try-block
16910 GNU Extension:
16912 function-definition:
16913 __extension__ function-definition
16915 TM Extension:
16917 function-definition:
16918 decl-specifier-seq [opt] declarator function-transaction-block
16920 The DECL_SPECIFIERS apply to this declarator. Returns a
16921 representation of the entity declared. If MEMBER_P is TRUE, then
16922 this declarator appears in a class scope. The new DECL created by
16923 this declarator is returned.
16925 The CHECKS are access checks that should be performed once we know
16926 what entity is being declared (and, therefore, what classes have
16927 befriended it).
16929 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16930 for a function-definition here as well. If the declarator is a
16931 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16932 be TRUE upon return. By that point, the function-definition will
16933 have been completely parsed.
16935 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16936 is FALSE.
16938 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16939 parsed declaration if it is an uninitialized single declarator not followed
16940 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16941 if present, will not be consumed. If returned, this declarator will be
16942 created with SD_INITIALIZED but will not call cp_finish_decl. */
16944 static tree
16953 {
16957 tree prefix_attributes;
16959 tree asm_specification;
16960 tree initializer;
16962 tree scope;
16964 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16965 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16966 "(...)". */
16976 /* Gather the attributes that were provided with the
16977 decl-specifiers. */
16980 /* Assume that this is not the declarator for a function
16981 definition. */
16985 /* Default arguments are only permitted for function parameters. */
16989 /* Defer access checks while parsing the declarator; we cannot know
16990 what names are accessible until we know what is being
16991 declared. */
16994 /* Parse the declarator. */
16996 declarator
17000 member_p);
17001 /* Gather up the deferred checks. */
17006 /* If the DECLARATOR was erroneous, there's no need to go
17007 further. */
17011 /* Check that the number of template-parameter-lists is OK. */
17021 /* Figure out what scope the entity declared by the DECLARATOR is
17022 located in. `grokdeclarator' sometimes changes the scope, so
17023 we compute it now. */
17026 /* Perform any lookups in the declared type which were thought to be
17027 dependent, but are not in the scope of the declarator. */
17028 decl_specifiers->type
17031 /* If we're allowing GNU extensions, look for an
17032 asm-specification. */
17034 {
17035 /* Look for an asm-specification. */
17038 }
17039 else
17042 /* Look for attributes. */
17047 // If scope is non-null, then we're parsing a declarator with
17048 // a nested-name specifier. It's possible that some component of
17049 // that specifier is bringing template contsraints with it, which
17050 // we need to suppress for for the time being. For example:
17051 //
17052 // template<typename T>
17053 // requires C<T>()
17054 // void S<T>::f() requires D<T>() { ... }
17055 //
17056 // At the point we parse the 2nd requires clause, the previous the
17057 // current constraints will have been used to resolve the enclosing
17058 // class S<T>. The D<T>() requirement applies only to the definition
17059 // of f and do not include C<T>().
17060 //
17061 // Save requirements, resetting them if the scope was established.
17064 // TODO: Check that a declaration does not have 2 requires clauses.
17066 // Parse an optional trailing requires clause for the parsed declarator.
17070 /* Peek at the next token. */
17074 {
17075 /* Check to see if the token indicates the start of a
17076 function-definition. */
17078 {
17080 {
17081 /* If a function-definition should not appear here, issue an
17082 error message. */
17086 }
17088 location_t func_brace_location
17091 /* Neither attributes nor an asm-specification are allowed
17092 on a function-definition. */
17095 "an asm-specification is not allowed "
17099 "attributes are not allowed "
17101 /* This is a function-definition. */
17104 /* Parse the function definition. */
17107 decl_specifiers,
17108 declarator,
17109 prefix_attributes);
17110 else
17111 decl =
17112 (cp_parser_function_definition_from_specifiers_and_declarator
17116 {
17117 /* This is where the prologue starts... */
17120 }
17123 }
17124 }
17126 /* [dcl.dcl]
17128 Only in function declarations for constructors, destructors, and
17129 type conversions can the decl-specifier-seq be omitted.
17131 We explicitly postpone this check past the point where we handle
17132 function-definitions because we tolerate function-definitions
17133 that are missing their return types in some modes. */
17135 {
17139 }
17141 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17145 {
17153 {
17159 }
17160 }
17161 else
17162 {
17163 /* If the init-declarator isn't initialized and isn't followed by a
17164 `,' or `;', it's not a valid init-declarator. */
17167 {
17170 else
17171 {
17174 }
17175 }
17178 }
17180 /* Because start_decl has side-effects, we should only call it if we
17181 know we're going ahead. By this point, we know that we cannot
17182 possibly be looking at any other construct. */
17185 /* If the decl specifiers were bad, issue an error now that we're
17186 sure this was intended to be a declarator. Then continue
17187 declaring the variable(s), as int, to try to cut down on further
17188 errors. */
17191 {
17194 }
17196 /* Check to see whether or not this declaration is a friend. */
17199 /* Enter the newly declared entry in the symbol table. If we're
17200 processing a declaration in a class-specifier, we wait until
17201 after processing the initializer. */
17203 {
17210 /* Adjust location of decl if declarator->id_loc is more appropriate:
17211 set, and decl wasn't merged with another decl, in which case its
17212 location would be different from input_location, and more accurate. */
17217 }
17219 /* Enter the SCOPE. That way unqualified names appearing in the
17220 initializer will be looked up in SCOPE. */
17223 /* Perform deferred access control checks, now that we know in which
17224 SCOPE the declared entity resides. */
17226 {
17229 /* If the entity being declared is a function, pretend that we
17230 are in its scope. If it is a `friend', it may have access to
17231 things that would not otherwise be accessible. */
17233 {
17236 }
17238 /* Perform access checks for template parameters. */
17241 /* Perform the access control checks for the declarator and the
17242 decl-specifiers. */
17245 /* Restore the saved value. */
17248 }
17250 /* Parse the initializer. */
17255 {
17257 {
17261 else
17262 {
17263 /* If the declaration was erroneous, we don't really
17264 know what the user intended, so just silently
17265 consume the initializer. */
17273 }
17274 }
17275 else
17276 {
17277 /* We want to record the extra mangling scope for in-class
17278 initializers of class members and initializers of static data
17279 member templates. The former involves deferring
17280 parsing of the initializer until end of class as with default
17281 arguments. So right here we only handle the latter. */
17291 }
17292 }
17294 /* The old parser allows attributes to appear after a parenthesized
17295 initializer. Mark Mitchell proposed removing this functionality
17296 on the GCC mailing lists on 2002-08-13. This parser accepts the
17297 attributes -- but ignores them. */
17304 /* A non-template declaration involving a function parameter list containing
17305 an implicit template parameter will have been made into a template. If it
17306 turns out that the resulting declaration is not an actual function then
17307 finish the template declaration here. An error message will already have
17308 been issued. */
17311 {
17313 {
17316 }
17318 }
17320 /* For an in-class declaration, use `grokfield' to create the
17321 declaration. */
17323 {
17325 {
17328 }
17336 }
17338 /* Finish processing the declaration. But, skip member
17339 declarations. */
17341 {
17344 asm_specification,
17345 /* If the initializer is in parentheses, then this is
17346 a direct-initialization, which means that an
17347 `explicit' constructor is OK. Otherwise, an
17348 `explicit' constructor cannot be used. */
17351 }
17354 /* Core issue #226 (C++0x only): A default template-argument
17355 shall not be specified in a friend class template
17356 declaration. */
17365 {
17368 else
17370 }
17373 }
17375 /* Parse a declarator.
17377 declarator:
17378 direct-declarator
17379 ptr-operator declarator
17381 abstract-declarator:
17382 ptr-operator abstract-declarator [opt]
17383 direct-abstract-declarator
17385 GNU Extensions:
17387 declarator:
17388 attributes [opt] direct-declarator
17389 attributes [opt] ptr-operator declarator
17391 abstract-declarator:
17392 attributes [opt] ptr-operator abstract-declarator [opt]
17393 attributes [opt] direct-abstract-declarator
17395 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17396 detect constructor, destructor or conversion operators. It is set
17397 to -1 if the declarator is a name, and +1 if it is a
17398 function. Otherwise it is set to zero. Usually you just want to
17399 test for >0, but internally the negative value is used.
17401 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17402 a decl-specifier-seq unless it declares a constructor, destructor,
17403 or conversion. It might seem that we could check this condition in
17404 semantic analysis, rather than parsing, but that makes it difficult
17405 to handle something like `f()'. We want to notice that there are
17406 no decl-specifiers, and therefore realize that this is an
17407 expression, not a declaration.)
17409 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17410 the declarator is a direct-declarator of the form "(...)".
17412 MEMBER_P is true iff this declarator is a member-declarator. */
17416 cp_parser_declarator_kind dcl_kind,
17420 {
17423 cp_cv_quals cv_quals;
17424 tree class_type;
17427 /* Assume this is not a constructor, destructor, or type-conversion
17428 operator. */
17435 /* Check for the ptr-operator production. */
17437 /* Parse the ptr-operator. */
17443 /* If that worked, then we have a ptr-operator. */
17445 {
17446 /* If a ptr-operator was found, then this declarator was not
17447 parenthesized. */
17450 /* The dependent declarator is optional if we are parsing an
17451 abstract-declarator. */
17455 /* Parse the dependent declarator. */
17461 /* If we are parsing an abstract-declarator, we must handle the
17462 case where the dependent declarator is absent. */
17467 declarator = cp_parser_make_indirect_declarator
17469 }
17470 /* Everything else is a direct-declarator. */
17471 else
17472 {
17475 CPP_OPEN_PAREN);
17477 ctor_dtor_or_conv_p,
17478 member_p);
17479 }
17485 }
17487 /* Parse a direct-declarator or direct-abstract-declarator.
17489 direct-declarator:
17490 declarator-id
17491 direct-declarator ( parameter-declaration-clause )
17492 cv-qualifier-seq [opt]
17493 ref-qualifier [opt]
17494 exception-specification [opt]
17495 direct-declarator [ constant-expression [opt] ]
17496 ( declarator )
17498 direct-abstract-declarator:
17499 direct-abstract-declarator [opt]
17500 ( parameter-declaration-clause )
17501 cv-qualifier-seq [opt]
17502 ref-qualifier [opt]
17503 exception-specification [opt]
17504 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17505 ( abstract-declarator )
17507 Returns a representation of the declarator. DCL_KIND is
17508 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17509 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17510 we are parsing a direct-declarator. It is
17511 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17512 of ambiguity we prefer an abstract declarator, as per
17513 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
17514 cp_parser_declarator. */
17518 cp_parser_declarator_kind dcl_kind,
17521 {
17531 {
17532 /* Peek at the next token. */
17535 {
17536 /* This is either a parameter-declaration-clause, or a
17537 parenthesized declarator. When we know we are parsing a
17538 named declarator, it must be a parenthesized declarator
17539 if FIRST is true. For instance, `(int)' is a
17540 parameter-declaration-clause, with an omitted
17541 direct-abstract-declarator. But `((*))', is a
17542 parenthesized abstract declarator. Finally, when T is a
17543 template parameter `(T)' is a
17544 parameter-declaration-clause, and not a parenthesized
17545 named declarator.
17547 We first try and parse a parameter-declaration-clause,
17548 and then try a nested declarator (if FIRST is true).
17550 It is not an error for it not to be a
17551 parameter-declaration-clause, even when FIRST is
17552 false. Consider,
17554 int i (int);
17555 int i (3);
17557 The first is the declaration of a function while the
17558 second is the definition of a variable, including its
17559 initializer.
17561 Having seen only the parenthesis, we cannot know which of
17562 these two alternatives should be selected. Even more
17563 complex are examples like:
17565 int i (int (a));
17566 int i (int (3));
17568 The former is a function-declaration; the latter is a
17569 variable initialization.
17571 Thus again, we try a parameter-declaration-clause, and if
17572 that fails, we back out and return. */
17575 {
17576 tree params;
17579 /* In a member-declarator, the only valid interpretation
17580 of a parenthesis is the start of a
17581 parameter-declaration-clause. (It is invalid to
17582 initialize a static data member with a parenthesized
17583 initializer; only the "=" form of initialization is
17584 permitted.) */
17588 /* Consume the `('. */
17591 {
17592 /* If this is going to be an abstract declarator, we're
17593 in a declarator and we can't have default args. */
17596 }
17600 /* Parse the parameter-declaration-clause. */
17603 /* Consume the `)'. */
17606 /* If all went well, parse the cv-qualifier-seq,
17607 ref-qualifier and the exception-specification. */
17609 {
17610 cp_cv_quals cv_quals;
17611 cp_virt_specifiers virt_specifiers;
17612 cp_ref_qualifier ref_qual;
17613 tree exception_specification;
17614 tree late_return;
17615 tree attrs;
17625 /* Parse the cv-qualifier-seq. */
17627 /* Parse the ref-qualifier. */
17629 /* And the exception-specification. */
17630 exception_specification
17635 /* In here, we handle cases where attribute is used after
17636 the function declaration. For example:
17637 void func (int x) __attribute__((vector(..))); */
17640 {
17644 CPP_SEMICOLON)
17646 CPP_OPEN_BRACE))
17649 ;
17650 else
17652 }
17653 late_return = (cp_parser_late_return_type_opt
17658 /* Parse the virt-specifier-seq. */
17661 /* Create the function-declarator. */
17663 params,
17664 cv_quals,
17665 virt_specifiers,
17666 ref_qual,
17667 exception_specification,
17668 late_return);
17670 /* Any subsequent parameter lists are to do with
17671 return type, so are not those of the declared
17672 function. */
17674 }
17676 /* Remove the function parms from scope. */
17680 /* Repeat the main loop. */
17682 }
17684 /* If this is the first, we can try a parenthesized
17685 declarator. */
17687 {
17693 /* Consume the `('. */
17695 /* Parse the nested declarator. */
17698 declarator
17701 member_p);
17704 /* Expect a `)'. */
17711 }
17712 /* Otherwise, we must be done. */
17713 else
17715 }
17719 {
17720 /* Parse an array-declarator. */
17729 /* Consume the `['. */
17731 /* Peek at the next token. */
17733 /* If the next token is `]', then there is no
17734 constant-expression. */
17736 {
17738 bounds
17748 {
17749 /* Normally, the array bound must be an integral constant
17750 expression. However, as an extension, we allow VLAs
17751 in function scopes as long as they aren't part of a
17752 parameter declaration. */
17756 }
17759 {
17760 /* Remember this wasn't a constant-expression. */
17763 }
17764 }
17765 else
17767 /* Look for the closing `]'. */
17769 {
17772 }
17777 }
17779 {
17780 {
17781 tree qualifying_scope;
17782 tree unqualified_name;
17783 tree attrs;
17784 special_function_kind sfk;
17789 /* Parse a declarator-id */
17792 {
17795 /* If we see an ellipsis, we should be looking at a
17796 parameter pack. */
17798 {
17799 /* Consume the `...' */
17803 }
17804 }
17807 unqualified_name
17811 {
17815 {
17816 /* Check whether an error occurred. */
17819 /* We already consumed the ellipsis to mark a
17820 parameter pack, but we have no way to report it,
17821 so abort the tentative parse. We will be exiting
17822 immediately anyway. */
17824 }
17825 else
17831 && (qualifying_scope
17833 {
17836 }
17837 }
17842 {
17847 }
17853 {
17854 /* In the declaration of a member of a template class
17855 outside of the class itself, the SCOPE will sometimes
17856 be a TYPENAME_TYPE. For example, given:
17858 template <typename T>
17859 int S<T>::R::i = 3;
17861 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17862 this context, we must resolve S<T>::R to an ordinary
17863 type, rather than a typename type.
17865 The reason we normally avoid resolving TYPENAME_TYPEs
17866 is that a specialization of `S' might render
17867 `S<T>::R' not a type. However, if `S' is
17868 specialized, then this `i' will not be used, so there
17869 is no harm in resolving the types here. */
17870 tree type;
17872 /* Resolve the TYPENAME_TYPE. */
17875 /* If that failed, the declarator is invalid. */
17877 {
17880 "cannot define member of dependent typedef "
17882 else
17887 }
17889 }
17894 {
17895 tree class_type;
17900 else
17904 {
17907 {
17910 {
17914 "use %<%T::%D%> instead of %<%T::%D%> to "
17916 class_type,
17921 }
17922 else
17924 }
17925 else
17926 {
17927 /* We do not attempt to print the declarator
17928 here because we do not have enough
17929 information about its original syntactic
17930 form. */
17934 }
17935 }
17938 {
17944 for an anonymous type, even if the type
17945 got a name for linkage purposes. */
17948 class_type))
17949 {
17952 }
17960 }
17961 }
17963 unqualified_name,
17964 sfk);
17971 }
17973 handle_declarator:;
17976 {
17977 /* Any names that appear after the declarator-id for a
17978 member are looked up in the containing scope. */
17980 {
17981 /* But declarations with qualified-ids can't appear in a
17982 function. */
17986 }
17988 }
17992 /* Default args are only allowed on function
17993 declarations. */
17995 else
17999 }
18000 /* We're done. */
18001 else
18003 }
18005 /* For an abstract declarator, we might wind up with nothing at this
18006 point. That's an error; the declarator is not optional. */
18010 /* If we entered a scope, we must exit it now. */
18018 }
18020 /* Parse a ptr-operator.
18022 ptr-operator:
18023 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18024 * cv-qualifier-seq [opt]
18025 &
18026 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18027 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18029 GNU Extension:
18031 ptr-operator:
18032 & cv-qualifier-seq [opt]
18034 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18035 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18036 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18037 filled in with the TYPE containing the member. *CV_QUALS is
18038 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18039 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18040 Note that the tree codes returned by this function have nothing
18041 to do with the types of trees that will be eventually be created
18042 to represent the pointer or reference type being parsed. They are
18043 just constants with suggestive names. */
18044 static enum tree_code
18049 {
18054 /* Assume that it's not a pointer-to-member. */
18056 /* And that there are no cv-qualifiers. */
18059 /* Peek at the next token. */
18062 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18072 {
18073 /* Consume the `*', `&' or `&&'. */
18076 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18077 `&', if we are allowing GNU extensions. (The only qualifier
18078 that can legally appear after `&' is `restrict', but that is
18079 enforced during semantic analysis. */
18087 }
18088 else
18089 {
18090 /* Try the pointer-to-member case. */
18092 /* Look for the optional `::' operator. */
18095 /* Look for the nested-name specifier. */
18102 /* If we found it, and the next token is a `*', then we are
18103 indeed looking at a pointer-to-member operator. */
18106 {
18107 /* Indicate that the `*' operator was used. */
18115 else
18116 {
18117 /* The type of which the member is a member is given by the
18118 current SCOPE. */
18120 /* The next name will not be qualified. */
18124 /* Look for optional c++11 attributes. */
18128 /* Look for the optional cv-qualifier-seq. */
18130 }
18131 }
18132 /* If that didn't work we don't have a ptr-operator. */
18135 }
18138 }
18140 /* Parse an (optional) cv-qualifier-seq.
18142 cv-qualifier-seq:
18143 cv-qualifier cv-qualifier-seq [opt]
18145 cv-qualifier:
18146 const
18147 volatile
18149 GNU Extension:
18151 cv-qualifier:
18152 __restrict__
18154 Returns a bitmask representing the cv-qualifiers. */
18156 static cp_cv_quals
18158 {
18162 {
18164 cp_cv_quals cv_qualifier;
18166 /* Peek at the next token. */
18168 /* See if it's a cv-qualifier. */
18170 {
18186 }
18192 {
18195 }
18196 else
18197 {
18200 }
18201 }
18204 }
18206 /* Parse an (optional) ref-qualifier
18208 ref-qualifier:
18209 &
18210 &&
18212 Returns cp_ref_qualifier representing ref-qualifier. */
18214 static cp_ref_qualifier
18216 {
18219 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18224 {
18229 {
18241 }
18246 {
18249 }
18250 else
18251 {
18254 }
18255 }
18258 }
18260 /* Parse an (optional) virt-specifier-seq.
18262 virt-specifier-seq:
18263 virt-specifier virt-specifier-seq [opt]
18265 virt-specifier:
18266 override
18267 final
18269 Returns a bitmask representing the virt-specifiers. */
18271 static cp_virt_specifiers
18273 {
18277 {
18279 cp_virt_specifiers virt_specifier;
18281 /* Peek at the next token. */
18283 /* See if it's a virt-specifier-qualifier. */
18287 {
18290 }
18292 {
18295 }
18297 {
18299 }
18300 else
18304 {
18307 }
18308 else
18309 {
18312 }
18313 }
18315 }
18317 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18318 is in scope even though it isn't real. */
18320 void
18322 {
18323 tree this_parm;
18326 {
18327 /* We don't clear this between NSDMIs. Is it already what we want? */
18332 }
18335 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18337 current_class_ref
18340 }
18342 /* Return true iff our current scope is a non-static data member
18343 initializer. */
18345 bool
18347 {
18348 /* We recognize NSDMI context by the context-less 'this' pointer set up
18349 by the function above. */
18353 }
18355 /* Parse a late-specified return type, if any. This is not a separate
18356 non-terminal, but part of a function declarator, which looks like
18358 -> trailing-type-specifier-seq abstract-declarator(opt)
18360 Returns the type indicated by the type-id.
18362 In addition to this this parses any queued up omp declare simd
18363 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18365 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18366 function. */
18368 static tree
18370 cp_cv_quals quals)
18371 {
18375 && declarator
18381 /* Peek at the next token. */
18383 /* A late-specified return type is indicated by an initial '->'. */
18390 {
18391 /* DR 1207: 'this' is in scope in the trailing return type. */
18393 }
18396 {
18397 /* Consume the ->. */
18400 }
18403 declarator->std_attributes
18407 declarator->std_attributes
18412 {
18415 }
18418 }
18420 /* Parse a declarator-id.
18422 declarator-id:
18423 id-expression
18424 :: [opt] nested-name-specifier [opt] type-name
18426 In the `id-expression' case, the value returned is as for
18427 cp_parser_id_expression if the id-expression was an unqualified-id.
18428 If the id-expression was a qualified-id, then a SCOPE_REF is
18429 returned. The first operand is the scope (either a NAMESPACE_DECL
18430 or TREE_TYPE), but the second is still just a representation of an
18431 unqualified-id. */
18433 static tree
18435 {
18436 tree id;
18437 /* The expression must be an id-expression. Assume that qualified
18438 names are the names of types so that:
18440 template <class T>
18441 int S<T>::R::i = 3;
18443 will work; we must treat `S<T>::R' as the name of a type.
18444 Similarly, assume that qualified names are templates, where
18445 required, so that:
18447 template <class T>
18448 int S<T>::R<T>::i = 3;
18450 will work, too. */
18456 optional_p);
18460 }
18462 /* Parse a type-id.
18464 type-id:
18465 type-specifier-seq abstract-declarator [opt]
18467 Returns the TYPE specified. */
18469 static tree
18472 {
18473 cp_decl_specifier_seq type_specifier_seq;
18476 /* Parse the type-specifier-seq. */
18478 is_trailing_return,
18483 /* There might or might not be an abstract declarator. */
18485 /* Look for the declarator. */
18486 abstract_declarator
18490 /* Check to see if there really was a declarator. */
18495 /* None of the valid uses of 'auto' in C++14 involve the type-id
18496 nonterminal, but it is valid in a trailing-return-type. */
18499 {
18500 /* A type-id with type 'auto' is only ok if the abstract declarator
18501 is a function declarator with a late-specified return type.
18503 A type-id with 'auto' is also valid in a trailing-return-type
18504 in a compound-requirment. */
18511 else
18512 {
18515 }
18516 }
18519 is_template_arg);
18520 }
18523 {
18525 }
18528 {
18529 tree r;
18531 parser->type_definition_forbidden_message
18536 {
18539 }
18541 }
18544 {
18546 }
18548 /* Parse a type-specifier-seq.
18550 type-specifier-seq:
18551 type-specifier type-specifier-seq [opt]
18553 GNU extension:
18555 type-specifier-seq:
18556 attributes type-specifier-seq [opt]
18558 If IS_DECLARATION is true, we are at the start of a "condition" or
18559 exception-declaration, so we might be followed by a declarator-id.
18561 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18562 i.e. we've just seen "->".
18564 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18566 static void
18571 {
18576 /* Clear the TYPE_SPECIFIER_SEQ. */
18579 /* In the context of a trailing return type, enum E { } is an
18580 elaborated-type-specifier followed by a function-body, not an
18581 enum-specifier. */
18585 /* Parse the type-specifiers and attributes. */
18587 {
18588 tree type_specifier;
18591 /* Check for attributes first. */
18593 {
18598 }
18600 /* record the token of the beginning of the type specifier seq,
18601 for error reporting purposes*/
18605 /* Look for the type-specifier. */
18607 flags,
18608 type_specifier_seq,
18610 NULL,
18613 {
18614 /* If the first type-specifier could not be found, this is not a
18615 type-specifier-seq at all. */
18617 {
18618 /* Set in_declarator_p to avoid skipping to the semicolon. */
18630 }
18631 /* If subsequent type-specifiers could not be found, the
18632 type-specifier-seq is complete. */
18634 }
18637 /* The standard says that a condition can be:
18639 type-specifier-seq declarator = assignment-expression
18641 However, given:
18643 struct S {};
18644 if (int S = ...)
18646 we should treat the "S" as a declarator, not as a
18647 type-specifier. The standard doesn't say that explicitly for
18648 type-specifier-seq, but it does say that for
18649 decl-specifier-seq in an ordinary declaration. Perhaps it
18650 would be clearer just to allow a decl-specifier-seq here, and
18651 then add a semantic restriction that if any decl-specifiers
18652 that are not type-specifiers appear, the program is invalid. */
18655 }
18656 }
18658 /* Return whether the function currently being declared has an associated
18659 template parameter list. */
18661 static bool
18663 {
18676 }
18678 /* Parse a parameter-declaration-clause.
18680 parameter-declaration-clause:
18681 parameter-declaration-list [opt] ... [opt]
18682 parameter-declaration-list , ...
18684 Returns a representation for the parameter declarations. A return
18685 value of NULL indicates a parameter-declaration-clause consisting
18686 only of an ellipsis. */
18688 static tree
18690 {
18691 tree parameters;
18700 parser->auto_is_implicit_function_template_parm_p
18702 }
18708 && !processing_template_parmlist
18714 /* Peek at the next token. */
18716 /* Check for trivial parameter-declaration-clauses. */
18718 {
18719 /* Consume the `...' token. */
18722 }
18724 /* There are no parameters. */
18725 {
18726 #ifndef NO_IMPLICIT_EXTERN_C
18731 else
18732 #endif
18734 }
18735 /* Check for `(void)', too, which is a special case. */
18739 {
18740 /* Consume the `void' token. */
18742 /* There are no parameters. */
18744 }
18746 /* Parse the parameter-declaration-list. */
18748 /* If a parse error occurred while parsing the
18749 parameter-declaration-list, then the entire
18750 parameter-declaration-clause is erroneous. */
18754 /* Peek at the next token. */
18756 /* If it's a `,', the clause should terminate with an ellipsis. */
18758 {
18759 /* Consume the `,'. */
18761 /* Expect an ellipsis. */
18762 ellipsis_p
18764 }
18765 /* It might also be `...' if the optional trailing `,' was
18766 omitted. */
18768 {
18769 /* Consume the `...' token. */
18771 /* And remember that we saw it. */
18773 }
18774 else
18777 /* Finish the parameter list. */
18782 }
18784 /* Parse a parameter-declaration-list.
18786 parameter-declaration-list:
18787 parameter-declaration
18788 parameter-declaration-list , parameter-declaration
18790 Returns a representation of the parameter-declaration-list, as for
18791 cp_parser_parameter_declaration_clause. However, the
18792 `void_list_node' is never appended to the list. Upon return,
18793 *IS_ERROR will be true iff an error occurred. */
18795 static tree
18797 {
18803 /* Assume all will go well. */
18805 /* The special considerations that apply to a function within an
18806 unbraced linkage specifications do not apply to the parameters
18807 to the function. */
18808 saved_in_unbraced_linkage_specification_p
18812 /* Look for more parameters. */
18814 {
18822 /* Parse the parameter. */
18823 parameter
18828 /* We don't know yet if the enclosing context is deprecated, so wait
18829 and warn in grokparms if appropriate. */
18833 {
18834 /* If a function parameter pack was specified and an implicit template
18835 parameter was introduced during cp_parser_parameter_declaration,
18836 change any implicit parameters introduced into packs. */
18840 {
18848 }
18852 PARM,
18855 }
18859 /* If a parse error occurred parsing the parameter declaration,
18860 then the entire parameter-declaration-list is erroneous. */
18862 {
18866 }
18876 {
18880 }
18882 /* Add the new parameter to the list. */
18886 /* Peek at the next token. */
18889 /* These are for Objective-C++ */
18892 /* The parameter-declaration-list is complete. */
18895 {
18898 /* Peek at the next token. */
18900 /* If it's an ellipsis, then the list is complete. */
18903 /* Otherwise, there must be more parameters. Consume the
18904 `,'. */
18906 /* When parsing something like:
18908 int i(float f, double d)
18910 we can tell after seeing the declaration for "f" that we
18911 are not looking at an initialization of a variable "i",
18912 but rather at the declaration of a function "i".
18914 Due to the fact that the parsing of template arguments
18915 (as specified to a template-id) requires backtracking we
18916 cannot use this technique when inside a template argument
18917 list. */
18921 /* However, a parameter-declaration of the form
18922 "float(f)" (which is a valid declaration of a
18923 parameter "f") can also be interpreted as an
18924 expression (the conversion of "f" to "float"). */
18927 }
18928 else
18929 {
18937 }
18938 }
18940 parser->in_unbraced_linkage_specification_p
18943 /* Reset implicit_template_scope if we are about to leave the function
18944 parameter list that introduced it. Note that for out-of-line member
18945 definitions, there will be one or more class scopes before we get to
18946 the template parameter scope. */
18950 {
18954 {
18957 }
18958 }
18961 }
18963 /* Parse a parameter declaration.
18965 parameter-declaration:
18966 decl-specifier-seq ... [opt] declarator
18967 decl-specifier-seq declarator = assignment-expression
18968 decl-specifier-seq ... [opt] abstract-declarator [opt]
18969 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18971 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18972 declares a template parameter. (In that case, a non-nested `>'
18973 token encountered during the parsing of the assignment-expression
18974 is not interpreted as a greater-than operator.)
18976 Returns a representation of the parameter, or NULL if an error
18977 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18978 true iff the declarator is of the form "(p)". */
18984 {
18986 cp_decl_specifier_seq decl_specifiers;
18988 tree default_argument;
18992 /* In a template parameter, `>' is not an operator.
18994 [temp.param]
18996 When parsing a default template-argument for a non-type
18997 template-parameter, the first non-nested `>' is taken as the end
18998 of the template parameter-list rather than a greater-than
18999 operator. */
19001 /* Type definitions may not appear in parameter types. */
19003 parser->type_definition_forbidden_message
19006 /* Parse the declaration-specifiers. */
19008 CP_PARSER_FLAGS_NONE,
19012 /* Complain about missing 'typename' or other invalid type names. */
19017 /* If an error occurred, there's no reason to attempt to parse the
19018 rest of the declaration. */
19020 {
19023 }
19025 /* Peek at the next token. */
19028 /* If the next token is a `)', `,', `=', `>', or `...', then there
19029 is no declarator. However, when variadic templates are enabled,
19030 there may be a declarator following `...'. */
19035 {
19039 }
19040 /* Otherwise, there should be a declarator. */
19041 else
19042 {
19046 /* After seeing a decl-specifier-seq, if the next token is not a
19047 "(", there is no possibility that the code is a valid
19048 expression. Therefore, if parsing tentatively, we commit at
19049 this point. */
19051 /* In an expression context, having seen:
19053 (int((char ...
19055 we cannot be sure whether we are looking at a
19056 function-type (taking a "char" as a parameter) or a cast
19057 of some object of type "char" to "int". */
19063 /* Parse the declarator. */
19066 CP_PARSER_DECLARATOR_EITHER,
19068 parenthesized_p,
19071 /* After the declarator, allow more attributes. */
19072 decl_specifiers.attributes
19075 }
19077 /* If the next token is an ellipsis, and we have not seen a
19078 declarator name, and the type of the declarator contains parameter
19079 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19080 a parameter pack expansion expression. Otherwise, leave the
19081 ellipsis for a C-style variadic function. */
19084 {
19095 {
19096 /* Consume the `...'. */
19100 /* Build a pack expansion type */
19103 else
19105 }
19106 }
19108 /* The restriction on defining new types applies only to the type
19109 of the parameter, not to the default argument. */
19112 /* If the next token is `=', then process a default argument. */
19114 {
19116 /* If we are defining a class, then the tokens that make up the
19117 default argument must be saved and processed later. */
19122 /* Outside of a class definition, we can just parse the
19123 assignment-expression. */
19124 else
19125 default_argument
19129 {
19132 else
19133 {
19135 "default arguments are only "
19138 }
19139 }
19143 {
19144 /* Find the name of the parameter pack. */
19151 template_parm_p
19157 else
19159 template_parm_p
19166 }
19167 }
19168 else
19172 declarator,
19173 default_argument);
19174 }
19176 /* Parse a default argument and return it.
19178 TEMPLATE_PARM_P is true if this is a default argument for a
19179 non-type template parameter. */
19180 static tree
19182 {
19188 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19189 set correctly. */
19192 /* Local variable names (and the `this' keyword) may not
19193 appear in a default argument. */
19196 /* Parse the assignment-expression. */
19201 /* The "this" pointer is not valid in a default argument. */
19203 {
19208 }
19209 default_argument
19211 /* Restore the "this" pointer. */
19213 {
19216 }
19225 }
19227 /* Parse a function-body.
19229 function-body:
19230 compound_statement */
19232 static void
19234 {
19236 }
19238 /* Parse a ctor-initializer-opt followed by a function-body. Return
19239 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19240 is true we are parsing a function-try-block. */
19242 static bool
19245 {
19253 /* Begin the function body. */
19255 /* Parse the optional ctor-initializer. */
19258 /* If we're parsing a constexpr constructor definition, we need
19259 to check that the constructor body is indeed empty. However,
19260 before we get to cp_parser_function_body lot of junk has been
19261 generated, so we can't just check that we have an empty block.
19262 Rather we take a snapshot of the outermost block, and check whether
19263 cp_parser_function_body changed its state. */
19265 {
19269 }
19270 /* Parse the function-body. */
19274 /* Finish the function body. */
19278 }
19280 /* Parse an initializer.
19282 initializer:
19283 = initializer-clause
19284 ( expression-list )
19286 Returns an expression representing the initializer. If no
19287 initializer is present, NULL_TREE is returned.
19289 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19290 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19291 set to TRUE if there is no initializer present. If there is an
19292 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19293 is set to true; otherwise it is set to false. */
19295 static tree
19298 {
19300 tree init;
19302 /* Peek at the next token. */
19305 /* Let our caller know whether or not this initializer was
19306 parenthesized. */
19308 /* Assume that the initializer is constant. */
19312 {
19313 /* Consume the `='. */
19315 /* Parse the initializer-clause. */
19317 }
19319 {
19324 non_constant_p);
19329 }
19331 {
19336 }
19337 else
19338 {
19339 /* Anything else is an error. */
19342 }
19345 }
19347 /* Parse an initializer-clause.
19349 initializer-clause:
19350 assignment-expression
19351 braced-init-list
19353 Returns an expression representing the initializer.
19355 If the `assignment-expression' production is used the value
19356 returned is simply a representation for the expression.
19358 Otherwise, calls cp_parser_braced_list. */
19360 static tree
19362 {
19363 tree initializer;
19365 /* Assume the expression is constant. */
19368 /* If it is not a `{', then we are looking at an
19369 assignment-expression. */
19371 {
19372 initializer
19375 non_constant_p);
19376 }
19377 else
19381 }
19383 /* Parse a brace-enclosed initializer list.
19385 braced-init-list:
19386 { initializer-list , [opt] }
19387 { }
19389 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19390 the elements of the initializer-list (or NULL, if the last
19391 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19392 NULL_TREE. There is no way to detect whether or not the optional
19393 trailing `,' was provided. NON_CONSTANT_P is as for
19394 cp_parser_initializer. */
19396 static tree
19398 {
19399 tree initializer;
19401 /* Consume the `{' token. */
19403 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19405 /* If it's not a `}', then there is a non-trivial initializer. */
19407 {
19408 /* Parse the initializer list. */
19411 /* A trailing `,' token is allowed. */
19414 }
19415 else
19417 /* Now, there should be a trailing `}'. */
19421 }
19423 /* Parse an initializer-list.
19425 initializer-list:
19426 initializer-clause ... [opt]
19427 initializer-list , initializer-clause ... [opt]
19429 GNU Extension:
19431 initializer-list:
19432 designation initializer-clause ...[opt]
19433 initializer-list , designation initializer-clause ...[opt]
19435 designation:
19436 . identifier =
19437 identifier :
19438 [ constant-expression ] =
19440 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19441 for the initializer. If the INDEX of the elt is non-NULL, it is the
19442 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19443 as for cp_parser_initializer. */
19447 {
19450 /* Assume all of the expressions are constant. */
19453 /* Parse the rest of the list. */
19455 {
19457 tree designator;
19458 tree initializer;
19461 /* If the next token is an identifier and the following one is a
19462 colon, we are looking at the GNU designated-initializer
19463 syntax. */
19467 {
19468 /* Warn the user that they are using an extension. */
19471 /* Consume the identifier. */
19473 /* Consume the `:'. */
19475 }
19476 /* Also handle the C99 syntax, '. id ='. */
19481 {
19482 /* Warn the user that they are using an extension. */
19485 /* Consume the `.'. */
19487 /* Consume the identifier. */
19489 /* Consume the `='. */
19491 }
19492 /* Also handle C99 array designators, '[ const ] ='. */
19496 {
19497 /* In C++11, [ could start a lambda-introducer. */
19509 }
19510 else
19513 /* Parse the initializer. */
19516 /* If any clause is non-constant, so is the entire initializer. */
19520 /* If we have an ellipsis, this is an initializer pack
19521 expansion. */
19523 {
19524 /* Consume the `...'. */
19527 /* Turn the initializer into an initializer expansion. */
19529 }
19531 /* Add it to the vector. */
19534 /* If the next token is not a comma, we have reached the end of
19535 the list. */
19539 /* Peek at the next token. */
19541 /* If the next token is a `}', then we're still done. An
19542 initializer-clause can have a trailing `,' after the
19543 initializer-list and before the closing `}'. */
19547 /* Consume the `,' token. */
19549 }
19552 }
19554 /* Classes [gram.class] */
19556 /* Parse a class-name.
19558 class-name:
19559 identifier
19560 template-id
19562 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19563 to indicate that names looked up in dependent types should be
19564 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19565 keyword has been used to indicate that the name that appears next
19566 is a template. TAG_TYPE indicates the explicit tag given before
19567 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19568 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19569 is the class being defined in a class-head.
19571 Returns the TYPE_DECL representing the class. */
19573 static tree
19581 {
19582 tree decl;
19583 tree scope;
19588 /* All class-names start with an identifier. */
19591 {
19594 }
19596 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19597 to a template-id, so we save it here. */
19602 /* Any name names a type if we're following the `typename' keyword
19603 in a qualified name where the enclosing scope is type-dependent. */
19606 /* Handle the common case (an identifier, but not a template-id)
19607 efficiently. */
19610 {
19614 /* Look for the identifier. */
19618 /* If the next token isn't an identifier, we are certainly not
19619 looking at a class-name. */
19622 /* If we know this is a type-name, there's no need to look it
19623 up. */
19626 else
19627 {
19628 tree ambiguous_decls;
19629 /* If we already know that this lookup is ambiguous, then
19630 we've already issued an error message; there's no reason
19631 to check again. */
19633 {
19636 }
19637 /* If the next token is a `::', then the name must be a type
19638 name.
19640 [basic.lookup.qual]
19642 During the lookup for a name preceding the :: scope
19643 resolution operator, object, function, and enumerator
19644 names are ignored. */
19647 /* Look up the name. */
19649 tag_type,
19652 check_dependency_p,
19656 {
19660 }
19661 }
19662 }
19663 else
19664 {
19665 /* Try a template-id. */
19667 check_dependency_p,
19668 tag_type,
19669 is_declaration);
19672 }
19676 /* If this is a typename, create a TYPENAME_TYPE. */
19678 {
19683 }
19687 /* Check to see that it is really the name of a class. */
19691 /* Situations like this:
19693 template <typename T> struct A {
19694 typename T::template X<int>::I i;
19695 };
19697 are problematic. Is `T::template X<int>' a class-name? The
19698 standard does not seem to be definitive, but there is no other
19699 valid interpretation of the following `::'. Therefore, those
19700 names are considered class-names. */
19701 {
19705 }
19709 /* In Objective-C 2.0, a classname followed by '.' starts a
19710 dot-syntax expression, and it's not a type-name. */
19722 }
19724 /* Parse a class-specifier.
19726 class-specifier:
19727 class-head { member-specification [opt] }
19729 Returns the TREE_TYPE representing the class. */
19731 static tree
19733 {
19734 tree type;
19748 /* Parse the class-head. */
19751 /* If the class-head was a semantic disaster, skip the entire body
19752 of the class. */
19754 {
19758 }
19760 /* Look for the `{'. */
19762 {
19765 }
19769 /* Issue an error message if type-definitions are forbidden here. */
19771 /* Remember that we are defining one more class. */
19773 /* Inside the class, surrounding template-parameter-lists do not
19774 apply. */
19775 saved_num_template_parameter_lists
19778 /* We are not in a function body. */
19781 /* Or in a loop. */
19784 /* Or in a switch. */
19787 /* We are not immediately inside an extern "lang" block. */
19788 saved_in_unbraced_linkage_specification_p
19792 /* Start the class. */
19794 {
19797 }
19801 /* If the type is erroneous, skip the entire body of the class. */
19803 else
19804 /* Parse the member-specification. */
19807 /* Look for the trailing `}'. */
19809 /* Look for trailing attributes to apply to this class. */
19817 /* We've finished a type definition. Check for the common syntax
19818 error of forgetting a semicolon after the definition. We need to
19819 be careful, as we can't just check for not-a-semicolon and be done
19820 with it; the user might have typed:
19822 class X { } c = ...;
19823 class X { } *p = ...;
19825 and so forth. Instead, enumerate all the possible tokens that
19826 might follow this production; if we don't see one of them, then
19827 complain and silently insert the semicolon. */
19828 {
19833 /* Don't try to parse c++11 attributes here. As per the
19834 grammar, that should be a task for
19835 cp_parser_decl_specifier_seq. */
19839 {
19850 /* While it's legal for type qualifiers and storage class
19851 specifiers to follow type definitions in the grammar, only
19852 compiler testsuites contain code like that. Assume that if
19853 we see such code, then what we're really seeing is a case
19854 like:
19856 class X { }
19857 const <type> var = ...;
19859 or
19861 class Y { }
19862 static <type> func (...) ...
19864 i.e. the qualifier or specifier applies to the next
19865 declaration. To do so, however, we need to look ahead one
19866 more token to see if *that* token is a type specifier.
19868 This code could be improved to handle:
19870 class Z { }
19871 static const <type> var = ...; */
19874 {
19877 /* Handling user-defined types here would be nice, but very
19878 tricky. */
19879 want_semicolon
19882 }
19886 }
19888 /* If we don't have a type, then something is very wrong and we
19889 shouldn't try to do anything clever. Likewise for not seeing the
19890 closing brace. */
19892 {
19893 cp_token_position prev
19904 else
19907 /* Unget one token and smash it to look as though we encountered
19908 a semicolon in the input stream. */
19913 }
19914 }
19916 /* If this class is not itself within the scope of another class,
19917 then we need to parse the bodies of all of the queued function
19918 definitions. Note that the queued functions defined in a class
19919 are not always processed immediately following the
19920 class-specifier for that class. Consider:
19922 struct A {
19923 struct B { void f() { sizeof (A); } };
19924 };
19926 If `f' were processed before the processing of `A' were
19927 completed, there would be no way to compute the size of `A'.
19928 Note that the nesting we are interested in here is lexical --
19929 not the semantic nesting given by TYPE_CONTEXT. In particular,
19930 for:
19932 struct A { struct B; };
19933 struct A::B { void f() { } };
19935 there is no need to delay the parsing of `A::B::f'. */
19937 {
19938 tree decl;
19945 /* In a first pass, parse default arguments to the functions.
19946 Then, in a second pass, parse the bodies of the functions.
19947 This two-phased approach handles cases like:
19949 struct S {
19950 void f() { g(); }
19951 void g(int i = 3);
19952 };
19954 */
19956 {
19958 /* If there are default arguments that have not yet been processed,
19959 take care of them now. */
19961 {
19966 }
19967 /* Make sure that any template parameters are in scope. */
19969 /* Parse the default argument expressions. */
19971 /* Remove any template parameters from the symbol table. */
19973 }
19975 /* Now parse any NSDMIs. */
19979 {
19981 {
19986 }
19989 }
19996 /* Now do some post-NSDMI bookkeeping. */
20002 /* Now parse the body of the functions. */
20004 {
20005 /* OpenMP UDRs need to be parsed before all other functions. */
20012 }
20013 else
20017 }
20018 else
20021 /* Put back any saved access checks. */
20024 /* Restore saved state. */
20028 parser->num_template_parameter_lists
20030 parser->in_unbraced_linkage_specification_p
20034 }
20036 static tree
20038 {
20039 tree ret;
20044 }
20046 /* Parse a class-head.
20048 class-head:
20049 class-key identifier [opt] base-clause [opt]
20050 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20051 class-key nested-name-specifier [opt] template-id
20052 base-clause [opt]
20054 class-virt-specifier:
20055 final
20057 GNU Extensions:
20058 class-key attributes identifier [opt] base-clause [opt]
20059 class-key attributes nested-name-specifier identifier base-clause [opt]
20060 class-key attributes nested-name-specifier [opt] template-id
20061 base-clause [opt]
20063 Upon return BASES is initialized to the list of base classes (or
20064 NULL, if there are none) in the same form returned by
20065 cp_parser_base_clause.
20067 Returns the TYPE of the indicated class. Sets
20068 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20069 involving a nested-name-specifier was used, and FALSE otherwise.
20071 Returns error_mark_node if this is not a class-head.
20073 Returns NULL_TREE if the class-head is syntactically valid, but
20074 semantically invalid in a way that means we should skip the entire
20075 body of the class. */
20077 static tree
20080 {
20081 tree nested_name_specifier;
20085 tree attributes;
20086 tree bases;
20096 /* Assume no nested-name-specifier will be present. */
20098 /* Assume no template parameter lists will be used in defining the
20099 type. */
20103 /* Look for the class-key. */
20108 /* Parse the attributes. */
20111 /* If the next token is `::', that is invalid -- but sometimes
20112 people do try to write:
20114 struct ::S {};
20116 Handle this gracefully by accepting the extra qualifier, and then
20117 issuing an error about it later if this really is a
20118 class-head. If it turns out just to be an elaborated type
20119 specifier, remain silent. */
20125 /* Determine the name of the class. Begin by looking for an
20126 optional nested-name-specifier. */
20128 nested_name_specifier
20134 /* If there was a nested-name-specifier, then there *must* be an
20135 identifier. */
20137 {
20139 /* Although the grammar says `identifier', it really means
20140 `class-name' or `template-name'. You are only allowed to
20141 define a class that has already been declared with this
20142 syntax.
20144 The proposed resolution for Core Issue 180 says that wherever
20145 you see `class T::X' you should treat `X' as a type-name.
20147 It is OK to define an inaccessible class; for example:
20149 class A { class B; };
20150 class A::B {};
20152 We do not know if we will see a class-name, or a
20153 template-name. We look for a class-name first, in case the
20154 class-name is a template-id; if we looked for the
20155 template-name first we would stop after the template-name. */
20160 class_type,
20164 /* If that didn't work, ignore the nested-name-specifier. */
20166 {
20172 }
20173 /* If we could not find a corresponding TYPE, treat this
20174 declaration like an unqualified declaration. */
20177 /* Otherwise, count the number of templates used in TYPE and its
20178 containing scopes. */
20179 else
20180 {
20181 tree scope;
20193 }
20194 }
20195 /* Otherwise, the identifier is optional. */
20196 else
20197 {
20198 /* We don't know whether what comes next is a template-id,
20199 an identifier, or nothing at all. */
20201 /* Check for a template-id. */
20206 class_key,
20208 /* If that didn't work, it could still be an identifier. */
20210 {
20212 {
20215 }
20216 else
20218 }
20219 else
20220 {
20223 }
20224 }
20229 {
20231 class_key,
20233 }
20236 /* If it's not a `:' or a `{' then we can't really be looking at a
20237 class-head, since a class-head only appears as part of a
20238 class-specifier. We have to detect this situation before calling
20239 xref_tag, since that has irreversible side-effects. */
20241 {
20245 }
20247 /* At this point, we're going ahead with the class-specifier, even
20248 if some other problem occurs. */
20251 {
20256 }
20257 /* Issue the error about the overly-qualified name now. */
20259 {
20264 }
20266 {
20271 }
20273 {
20274 tree scope;
20276 /* Reject typedef-names in class heads. */
20278 {
20281 type);
20284 }
20286 /* Figure out in what scope the declaration is being placed. */
20288 /* If that scope does not contain the scope in which the
20289 class was originally declared, the program is invalid. */
20291 {
20294 "declaration of %qD in namespace %qD which does not "
20297 else
20303 }
20304 /* [dcl.meaning]
20306 A declarator-id shall not be qualified except for the
20307 definition of a ... nested class outside of its class
20308 ... [or] the definition or explicit instantiation of a
20309 class member of a namespace outside of its namespace. */
20311 {
20316 }
20317 }
20318 /* An explicit-specialization must be preceded by "template <>". If
20319 it is not, try to recover gracefully. */
20323 {
20327 /* Take the same action that would have been taken by
20328 cp_parser_explicit_specialization. */
20331 }
20332 /* There must be no "return" statements between this point and the
20333 end of this function; set "type "to the correct return value and
20334 use "goto done;" to return. */
20335 /* Make sure that the right number of template parameters were
20336 present. */
20340 {
20341 /* If something went wrong, there is no point in even trying to
20342 process the class-definition. */
20345 }
20347 /* Look up the type. */
20349 {
20353 {
20357 }
20358 else
20359 {
20362 }
20365 }
20367 {
20368 tree class_type;
20370 /* Given:
20372 template <typename T> struct S { struct T };
20373 template <typename T> struct S<T>::T { };
20375 we will get a TYPENAME_TYPE when processing the definition of
20376 `S::T'. We need to resolve it to the actual type before we
20377 try to define it. */
20379 {
20384 else
20385 {
20388 }
20389 }
20393 {
20396 }
20399 /* Enter the scope indicated by the nested-name-specifier. */
20401 /* Get the canonical version of this type. */
20403 /* Call push_template_decl if it seems like we should be defining a
20404 template either from the template headers or the type we're
20405 defining, so that we diagnose both extra and missing headers. */
20411 {
20414 {
20417 }
20418 }
20422 }
20424 {
20425 /* If the class was unnamed, create a dummy name. */
20430 }
20432 /* Indicate whether this class was declared as a `class' or as a
20433 `struct'. */
20438 /* If this type was already complete, and we see another definition,
20439 that's an error. */
20441 {
20443 type);
20445 type);
20448 }
20453 {
20454 /* Apply attributes now, before any use of the class as a template
20455 argument in its base list. */
20458 }
20460 /* We will have entered the scope containing the class; the names of
20461 base classes should be looked up in that context. For example:
20463 struct A { struct B {}; struct C; };
20464 struct A::C : B {};
20466 is valid. */
20468 /* Get the list of base-classes, if there is one. */
20470 {
20471 /* PR59482: enter the class scope so that base-specifiers are looked
20472 up correctly. */
20476 /* PR59482: get out of the previously pushed class scope so that the
20477 subsequent pops pop the right thing. */
20480 }
20481 else
20484 /* If we're really defining a class, process the base classes.
20485 If they're invalid, fail. */
20490 done:
20491 /* Leave the scope given by the nested-name-specifier. We will
20492 enter the class scope itself while processing the members. */
20497 {
20500 }
20506 out:
20509 }
20511 /* Parse a class-key.
20513 class-key:
20514 class
20515 struct
20516 union
20518 Returns the kind of class-key specified, or none_type to indicate
20519 error. */
20521 static enum tag_types
20523 {
20527 /* Look for the class-key. */
20532 /* Check to see if the TOKEN is a class-key. */
20537 }
20539 /* Parse an (optional) member-specification.
20541 member-specification:
20542 member-declaration member-specification [opt]
20543 access-specifier : member-specification [opt] */
20545 static void
20547 {
20549 {
20553 /* Peek at the next token. */
20555 /* If it's a `}', or EOF then we've seen all the members. */
20561 /* See if this token is a keyword. */
20564 {
20568 /* Consume the access-specifier. */
20570 /* Remember which access-specifier is active. */
20572 /* Look for the `:'. */
20577 /* Accept #pragmas at class scope. */
20579 {
20582 }
20584 /* Otherwise, the next construction must be a
20585 member-declaration. */
20587 }
20588 }
20589 }
20591 /* Parse a member-declaration.
20593 member-declaration:
20594 decl-specifier-seq [opt] member-declarator-list [opt] ;
20595 function-definition ; [opt]
20596 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20597 using-declaration
20598 template-declaration
20599 alias-declaration
20601 member-declarator-list:
20602 member-declarator
20603 member-declarator-list , member-declarator
20605 member-declarator:
20606 declarator pure-specifier [opt]
20607 declarator constant-initializer [opt]
20608 identifier [opt] : constant-expression
20610 GNU Extensions:
20612 member-declaration:
20613 __extension__ member-declaration
20615 member-declarator:
20616 declarator attributes [opt] pure-specifier [opt]
20617 declarator attributes [opt] constant-initializer [opt]
20618 identifier [opt] attributes [opt] : constant-expression
20620 C++0x Extensions:
20622 member-declaration:
20623 static_assert-declaration */
20625 static void
20627 {
20628 cp_decl_specifier_seq decl_specifiers;
20629 tree prefix_attributes;
20630 tree decl;
20639 /* Check for the `__extension__' keyword. */
20641 {
20642 /* Recurse. */
20644 /* Restore the old value of the PEDANTIC flag. */
20648 }
20650 /* Check for a template-declaration. */
20652 {
20653 /* An explicit specialization here is an error condition, and we
20654 expect the specialization handler to detect and report this. */
20658 else
20662 }
20664 /* Check for a using-declaration. */
20666 {
20668 {
20669 /* Parse the using-declaration. */
20673 }
20674 else
20675 {
20676 tree decl;
20680 /* Note that if we actually see the '=' token after the
20681 identifier, cp_parser_alias_declaration commits the
20682 tentative parse. In that case, we really expects an
20683 alias-declaration. Otherwise, we expect a using
20684 declaration. */
20685 alias_decl_expected =
20691 else
20695 }
20696 }
20698 /* Check for @defs. */
20700 {
20705 {
20710 }
20712 }
20714 /* If the next token is `static_assert' we have a static assertion. */
20716 {
20719 }
20726 /* Parse the decl-specifier-seq. */
20729 CP_PARSER_FLAGS_OPTIONAL,
20732 /* Check for an invalid type-name. */
20736 /* If there is no declarator, then the decl-specifier-seq should
20737 specify a type. */
20739 {
20740 /* If there was no decl-specifier-seq, and the next token is a
20741 `;', then we have something like:
20743 struct S { ; };
20745 [class.mem]
20747 Each member-declaration shall declare at least one member
20748 name of the class. */
20750 {
20754 }
20755 else
20756 {
20757 tree type;
20759 /* See if this declaration is a friend. */
20761 /* If there were decl-specifiers, check to see if there was
20762 a class-declaration. */
20765 /* Nested classes have already been added to the class, but
20766 a `friend' needs to be explicitly registered. */
20768 {
20769 /* If the `friend' keyword was present, the friend must
20770 be introduced with a class-key. */
20773 "in C++03 a class-key must be used "
20775 /* In this case:
20777 template <typename T> struct A {
20778 friend struct A<T>::B;
20779 };
20781 A<T>::B will be represented by a TYPENAME_TYPE, and
20782 therefore not recognized by check_tag_decl. */
20784 {
20788 }
20791 "friend declaration does not name a class or "
20793 else
20796 }
20797 /* If there is no TYPE, an error message will already have
20798 been issued. */
20800 ;
20801 /* An anonymous aggregate has to be handled specially; such
20802 a declaration really declares a data member (with a
20803 particular type), as opposed to a nested class. */
20805 {
20806 /* C++11 9.5/6. */
20809 "a storage class on an anonymous aggregate "
20812 /* Remove constructors and such from TYPE, now that we
20813 know it is an anonymous aggregate. */
20815 /* And make the corresponding data member. */
20818 /* Add it to the class. */
20820 }
20821 else
20822 cp_parser_check_access_in_redeclaration
20825 }
20826 }
20827 else
20828 {
20831 /* Clear attributes from the decl_specifiers but keep them
20832 around as prefix attributes that apply them to the entity
20833 being declared. */
20837 /* See if these declarations will be friends. */
20840 /* Keep going until we hit the `;' at the end of the
20841 declaration. */
20843 {
20845 tree first_attribute;
20847 /* Peek at the next token. */
20850 /* Check for a bitfield declaration. */
20855 {
20856 tree identifier;
20857 tree width;
20859 /* Get the name of the bitfield. Note that we cannot just
20860 check TOKEN here because it may have been invalidated by
20861 the call to cp_lexer_peek_nth_token above. */
20864 else
20867 /* Consume the `:' token. */
20869 /* Get the width of the bitfield. */
20870 width
20873 NULL);
20875 /* Look for attributes that apply to the bitfield. */
20877 /* Remember which attributes are prefix attributes and
20878 which are not. */
20880 /* Combine the attributes. */
20883 /* Create the bitfield declaration. */
20886 identifier,
20887 sfk_none)
20890 width,
20891 attributes);
20892 }
20893 else
20894 {
20896 tree initializer;
20897 tree asm_specification;
20900 /* Parse the declarator. */
20901 declarator
20907 /* If something went wrong parsing the declarator, make sure
20908 that we at least consume some tokens. */
20910 {
20911 /* Skip to the end of the statement. */
20913 /* If the next token is not a semicolon, that is
20914 probably because we just skipped over the body of
20915 a function. So, we consume a semicolon if
20916 present, but do not issue an error message if it
20917 is not present. */
20919 CPP_SEMICOLON))
20922 }
20925 cp_parser_check_for_definition_in_return_type
20929 /* Look for an asm-specification. */
20931 /* Look for attributes that apply to the declaration. */
20933 /* Remember which attributes are prefix attributes and
20934 which are not. */
20936 /* Combine the attributes. */
20939 /* If it's an `=', then we have a constant-initializer or a
20940 pure-specifier. It is not correct to parse the
20941 initializer before registering the member declaration
20942 since the member declaration should be in scope while
20943 its initializer is processed. However, the rest of the
20944 front end does not yet provide an interface that allows
20945 us to handle this correctly. */
20947 {
20948 /* In [class.mem]:
20950 A pure-specifier shall be used only in the declaration of
20951 a virtual function.
20953 A member-declarator can contain a constant-initializer
20954 only if it declares a static member of integral or
20955 enumeration type.
20957 Therefore, if the DECLARATOR is for a function, we look
20958 for a pure-specifier; otherwise, we look for a
20959 constant-initializer. When we call `grokfield', it will
20960 perform more stringent semantics checks. */
20972 {
20974 /* Don't require a constant rvalue in C++11, since we
20975 might want a reference constant. We'll enforce
20976 constancy later. */
20978 /* Parse the initializer. */
20981 }
20982 else
20983 /* Parse the initializer. */
20985 }
20988 {
20992 else
20994 }
20995 /* Otherwise, there is no initializer. */
20996 else
20999 // Save and reset the current template requirements. Handle
21000 // the trailing requirements, if there are any.
21005 /* See if we are probably looking at a function
21006 definition. We are certainly not looking at a
21007 member-declarator. Calling `grokfield' has
21008 side-effects, so we must not do it unless we are sure
21009 that we are looking at a member-declarator. */
21012 {
21013 /* The grammar does not allow a pure-specifier to be
21014 used when a member function is defined. (It is
21015 possible that this fact is an oversight in the
21016 standard, since a pure function may be defined
21017 outside of the class-specifier. */
21023 declarator,
21024 attributes);
21027 /* If the member was not a friend, declare it here. */
21034 /* Peek at the next token. */
21036 /* If the next token is a semicolon, consume it. */
21041 }
21042 else
21045 /* Create the declaration. */
21050 {
21053 else
21055 }
21056 }
21060 /* Reset PREFIX_ATTRIBUTES. */
21066 /* If there is any qualification still in effect, clear it
21067 now; we will be starting fresh with the next declarator. */
21071 /* If it's a `,', then there are more declarators. */
21073 {
21076 {
21080 }
21081 }
21082 /* If the next token isn't a `;', then we have a parse error. */
21084 CPP_SEMICOLON))
21085 {
21086 /* The next token might be a ways away from where the
21087 actual semicolon is missing. Find the previous token
21088 and use that for our error position. */
21093 /* Assume that the user meant to provide a semicolon. If
21094 we were to cp_parser_skip_to_end_of_statement, we might
21095 skip to a semicolon inside a member function definition
21096 and issue nonsensical error messages. */
21098 }
21101 {
21102 /* Add DECL to the list of members. */
21111 /* Add DECL to the queue of NSDMI to be parsed later. */
21113 }
21117 }
21118 }
21121 out:
21123 }
21125 /* Parse a pure-specifier.
21127 pure-specifier:
21128 = 0
21130 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21131 Otherwise, ERROR_MARK_NODE is returned. */
21133 static tree
21135 {
21138 /* Look for the `=' token. */
21141 /* Look for the `0' token. */
21150 /* Accept = default or = delete in c++0x mode. */
21153 {
21156 }
21158 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21160 {
21165 }
21167 {
21170 }
21173 }
21175 /* Parse a constant-initializer.
21177 constant-initializer:
21178 = constant-expression
21180 Returns a representation of the constant-expression. */
21182 static tree
21184 {
21185 /* Look for the `=' token. */
21189 /* It is invalid to write:
21191 struct S { static const int i = { 7 }; };
21193 */
21195 {
21198 /* Consume the opening brace. */
21200 /* Skip the initializer. */
21202 /* Look for the trailing `}'. */
21206 }
21210 NULL);
21211 }
21213 /* Derived classes [gram.class.derived] */
21215 /* Parse a base-clause.
21217 base-clause:
21218 : base-specifier-list
21220 base-specifier-list:
21221 base-specifier ... [opt]
21222 base-specifier-list , base-specifier ... [opt]
21224 Returns a TREE_LIST representing the base-classes, in the order in
21225 which they were declared. The representation of each node is as
21226 described by cp_parser_base_specifier.
21228 In the case that no bases are specified, this function will return
21229 NULL_TREE, not ERROR_MARK_NODE. */
21231 static tree
21233 {
21236 /* Look for the `:' that begins the list. */
21239 /* Scan the base-specifier-list. */
21241 {
21243 tree base;
21246 /* Look for the base-specifier. */
21248 /* Look for the (optional) ellipsis. */
21250 {
21251 /* Consume the `...'. */
21255 }
21257 /* Add BASE to the front of the list. */
21259 {
21261 /* Make this a pack expansion type. */
21265 {
21268 }
21269 }
21270 /* Peek at the next token. */
21272 /* If it's not a comma, then the list is complete. */
21275 /* Consume the `,'. */
21277 }
21279 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21280 base class had a qualified name. However, the next name that
21281 appears is certainly not qualified. */
21287 }
21289 /* Parse a base-specifier.
21291 base-specifier:
21292 :: [opt] nested-name-specifier [opt] class-name
21293 virtual access-specifier [opt] :: [opt] nested-name-specifier
21294 [opt] class-name
21295 access-specifier virtual [opt] :: [opt] nested-name-specifier
21296 [opt] class-name
21298 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21299 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21300 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21301 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21303 static tree
21305 {
21313 tree type;
21315 /* Process the optional `virtual' and `access-specifier'. */
21317 {
21318 /* Peek at the next token. */
21320 /* Process `virtual'. */
21322 {
21324 /* If `virtual' appears more than once, issue an error. */
21326 {
21330 }
21334 /* Consume the `virtual' token. */
21342 /* If more than one access specifier appears, issue an
21343 error. */
21346 {
21350 }
21354 /* Consume the access-specifier. */
21362 }
21363 }
21364 /* It is not uncommon to see programs mechanically, erroneously, use
21365 the 'typename' keyword to denote (dependent) qualified types
21366 as base classes. */
21368 {
21373 else
21375 "keyword %<typename%> not allowed in this context "
21378 }
21380 /* Look for the optional `::' operator. */
21382 /* Look for the nested-name-specifier. The simplest way to
21383 implement:
21385 [temp.res]
21387 The keyword `typename' is not permitted in a base-specifier or
21388 mem-initializer; in these contexts a qualified name that
21389 depends on a template-parameter is implicitly assumed to be a
21390 type name.
21392 is to pretend that we have seen the `typename' keyword at this
21393 point. */
21397 typename_type,
21399 /* If the base class is given by a qualified name, assume that names
21400 we see are type names or templates, as appropriate. */
21406 /* DR 950 allows decltype as a base-specifier. */
21408 else
21409 {
21410 /* Otherwise, look for the class-name. */
21412 class_scope_p,
21413 template_p,
21414 typename_type,
21419 }
21425 }
21427 /* Exception handling [gram.exception] */
21429 /* Parse an (optional) noexcept-specification.
21431 noexcept-specification:
21432 noexcept ( constant-expression ) [opt]
21434 If no noexcept-specification is present, returns NULL_TREE.
21435 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21436 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21437 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21438 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21439 in which case a boolean condition is returned instead. */
21441 static tree
21446 {
21450 /* Peek at the next token. */
21453 /* Is it a noexcept-specification? */
21455 {
21456 tree expr;
21460 {
21464 {
21465 /* Types may not be defined in an exception-specification. */
21467 parser->type_definition_forbidden_message
21472 /* Restore the saved message. */
21474 }
21475 else
21476 {
21479 }
21482 }
21483 else
21484 {
21488 }
21490 /* We cannot build a noexcept-spec right away because this will check
21491 that expr is a constexpr. */
21494 else
21496 }
21497 else
21499 }
21501 /* Parse an (optional) exception-specification.
21503 exception-specification:
21504 throw ( type-id-list [opt] )
21506 Returns a TREE_LIST representing the exception-specification. The
21507 TREE_VALUE of each node is a type. */
21509 static tree
21511 {
21513 tree type_id_list;
21516 /* Peek at the next token. */
21519 /* Is it a noexcept-specification? */
21525 /* If it's not `throw', then there's no exception-specification. */
21529 #if 0
21530 /* Enable this once a lot of code has transitioned to noexcept? */
21534 #endif
21536 /* Consume the `throw'. */
21539 /* Look for the `('. */
21542 /* Peek at the next token. */
21544 /* If it's not a `)', then there is a type-id-list. */
21546 {
21547 /* Types may not be defined in an exception-specification. */
21549 parser->type_definition_forbidden_message
21551 /* Parse the type-id-list. */
21553 /* Restore the saved message. */
21555 }
21556 else
21559 /* Look for the `)'. */
21563 }
21565 /* Parse an (optional) type-id-list.
21567 type-id-list:
21568 type-id ... [opt]
21569 type-id-list , type-id ... [opt]
21571 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21572 in the order that the types were presented. */
21574 static tree
21576 {
21580 {
21582 tree type;
21584 /* Get the next type-id. */
21586 /* Parse the optional ellipsis. */
21588 {
21589 /* Consume the `...'. */
21592 /* Turn the type into a pack expansion expression. */
21594 }
21595 /* Add it to the list. */
21597 /* Peek at the next token. */
21599 /* If it is not a `,', we are done. */
21602 /* Consume the `,'. */
21604 }
21607 }
21609 /* Parse a try-block.
21611 try-block:
21612 try compound-statement handler-seq */
21614 static tree
21616 {
21617 tree try_block;
21627 }
21629 /* Parse a function-try-block.
21631 function-try-block:
21632 try ctor-initializer [opt] function-body handler-seq */
21634 static bool
21636 {
21637 tree compound_stmt;
21638 tree try_block;
21641 /* Look for the `try' keyword. */
21644 /* Let the rest of the front end know where we are. */
21646 /* Parse the function-body. */
21647 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21649 /* We're done with the `try' part. */
21651 /* Parse the handlers. */
21653 /* We're done with the handlers. */
21657 }
21659 /* Parse a handler-seq.
21661 handler-seq:
21662 handler handler-seq [opt] */
21664 static void
21666 {
21668 {
21671 /* Parse the handler. */
21673 /* Peek at the next token. */
21675 /* If it's not `catch' then there are no more handlers. */
21678 }
21679 }
21681 /* Parse a handler.
21683 handler:
21684 catch ( exception-declaration ) compound-statement */
21686 static void
21688 {
21689 tree handler;
21690 tree declaration;
21700 }
21702 /* Parse an exception-declaration.
21704 exception-declaration:
21705 type-specifier-seq declarator
21706 type-specifier-seq abstract-declarator
21707 type-specifier-seq
21708 ...
21710 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21711 ellipsis variant is used. */
21713 static tree
21715 {
21716 cp_decl_specifier_seq type_specifiers;
21720 /* If it's an ellipsis, it's easy to handle. */
21722 {
21723 /* Consume the `...' token. */
21726 }
21728 /* Types may not be defined in exception-declarations. */
21730 parser->type_definition_forbidden_message
21733 /* Parse the type-specifier-seq. */
21737 /* If it's a `)', then there is no declarator. */
21740 else
21746 /* Restore the saved message. */
21753 }
21755 /* Parse a throw-expression.
21757 throw-expression:
21758 throw assignment-expression [opt]
21760 Returns a THROW_EXPR representing the throw-expression. */
21762 static tree
21764 {
21765 tree expression;
21770 /* Figure out whether or not there is an assignment-expression
21771 following the "throw" keyword. */
21779 else
21784 }
21786 /* GNU Extensions */
21788 /* Parse an (optional) asm-specification.
21790 asm-specification:
21791 asm ( string-literal )
21793 If the asm-specification is present, returns a STRING_CST
21794 corresponding to the string-literal. Otherwise, returns
21795 NULL_TREE. */
21797 static tree
21799 {
21801 tree asm_specification;
21803 /* Peek at the next token. */
21805 /* If the next token isn't the `asm' keyword, then there's no
21806 asm-specification. */
21810 /* Consume the `asm' token. */
21812 /* Look for the `('. */
21815 /* Look for the string-literal. */
21818 /* Look for the `)'. */
21822 }
21824 /* Parse an asm-operand-list.
21826 asm-operand-list:
21827 asm-operand
21828 asm-operand-list , asm-operand
21830 asm-operand:
21831 string-literal ( expression )
21832 [ string-literal ] string-literal ( expression )
21834 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21835 each node is the expression. The TREE_PURPOSE is itself a
21836 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21837 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21838 is a STRING_CST for the string literal before the parenthesis. Returns
21839 ERROR_MARK_NODE if any of the operands are invalid. */
21841 static tree
21843 {
21848 {
21849 tree string_literal;
21850 tree expression;
21851 tree name;
21854 {
21855 /* Consume the `[' token. */
21857 /* Read the operand name. */
21862 /* Look for the closing `]'. */
21864 }
21865 else
21867 /* Look for the string-literal. */
21870 /* Look for the `('. */
21872 /* Parse the expression. */
21874 /* Look for the `)'. */
21882 /* Add this operand to the list. */
21884 expression,
21885 asm_operands);
21886 /* If the next token is not a `,', there are no more
21887 operands. */
21890 /* Consume the `,'. */
21892 }
21895 }
21897 /* Parse an asm-clobber-list.
21899 asm-clobber-list:
21900 string-literal
21901 asm-clobber-list , string-literal
21903 Returns a TREE_LIST, indicating the clobbers in the order that they
21904 appeared. The TREE_VALUE of each node is a STRING_CST. */
21906 static tree
21908 {
21912 {
21913 tree string_literal;
21915 /* Look for the string literal. */
21917 /* Add it to the list. */
21919 /* If the next token is not a `,', then the list is
21920 complete. */
21923 /* Consume the `,' token. */
21925 }
21928 }
21930 /* Parse an asm-label-list.
21932 asm-label-list:
21933 identifier
21934 asm-label-list , identifier
21936 Returns a TREE_LIST, indicating the labels in the order that they
21937 appeared. The TREE_VALUE of each node is a label. */
21939 static tree
21941 {
21945 {
21948 /* Look for the identifier. */
21951 {
21954 {
21960 }
21961 }
21962 /* If the next token is not a `,', then the list is
21963 complete. */
21966 /* Consume the `,' token. */
21968 }
21971 }
21973 /* Return TRUE iff the next tokens in the stream are possibly the
21974 beginning of a GNU extension attribute. */
21976 static bool
21978 {
21980 }
21982 /* Return TRUE iff the next tokens in the stream are possibly the
21983 beginning of a standard C++-11 attribute specifier. */
21985 static bool
21987 {
21989 }
21991 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21992 beginning of a standard C++-11 attribute specifier. */
21994 static bool
21996 {
22004 }
22006 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22007 beginning of a GNU extension attribute. */
22009 static bool
22011 {
22015 }
22017 /* Return true iff the next tokens can be the beginning of either a
22018 GNU attribute list, or a standard C++11 attribute sequence. */
22020 static bool
22022 {
22025 }
22027 /* Return true iff the next Nth tokens can be the beginning of either
22028 a GNU attribute list, or a standard C++11 attribute sequence. */
22030 static bool
22032 {
22035 }
22037 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22038 of GNU attributes, or return NULL. */
22040 static tree
22042 {
22046 }
22048 #define CILK_SIMD_FN_CLAUSE_MASK \
22049 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22050 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22051 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22052 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22053 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22055 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22056 vector [(<clauses>)] */
22058 static void
22060 {
22064 {
22069 }
22072 {
22075 paren_scope++;
22076 }
22078 {
22081 paren_scope++;
22083 paren_scope--;
22084 /* Do not push the last ')' */
22087 }
22096 }
22098 /* Parse an (optional) series of attributes.
22100 attributes:
22101 attributes attribute
22103 attribute:
22104 __attribute__ (( attribute-list [opt] ))
22106 The return value is as for cp_parser_gnu_attribute_list. */
22108 static tree
22110 {
22114 {
22116 tree attribute_list;
22119 /* Peek at the next token. */
22121 /* If it's not `__attribute__', then we're done. */
22125 /* Consume the `__attribute__' keyword. */
22127 /* Look for the two `(' tokens. */
22131 /* Peek at the next token. */
22134 /* Parse the attribute-list. */
22136 else
22137 /* If the next token is a `)', then there is no attribute
22138 list. */
22141 /* Look for the two `)' tokens. */
22149 /* Add these new attributes to the list. */
22151 }
22154 }
22156 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22157 "__vector" or "__vector__." */
22161 {
22165 }
22167 /* Parse a GNU attribute-list.
22169 attribute-list:
22170 attribute
22171 attribute-list , attribute
22173 attribute:
22174 identifier
22175 identifier ( identifier )
22176 identifier ( identifier , expression-list )
22177 identifier ( expression-list )
22179 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22180 to an attribute. The TREE_PURPOSE of each node is the identifier
22181 indicating which attribute is in use. The TREE_VALUE represents
22182 the arguments, if any. */
22184 static tree
22186 {
22192 {
22194 tree identifier;
22195 tree attribute;
22197 /* Look for the identifier. We also allow keywords here; for
22198 example `__attribute__ ((const))' is legal. */
22202 {
22205 /* Consume the token, but save it since we need it for the
22206 SIMD enabled function parsing. */
22209 /* Save away the identifier that indicates which attribute
22210 this is. */
22212 /* For keywords, use the canonical spelling, not the
22213 parsed identifier. */
22219 /* Peek at the next token. */
22221 /* If it's an `(', then parse the attribute arguments. */
22223 {
22228 {
22231 }
22232 else
22233 vec = cp_parser_parenthesized_expression_list
22239 else
22240 {
22243 }
22244 /* Save the arguments away. */
22246 }
22248 {
22251 }
22254 {
22255 /* Add this attribute to the list. */
22258 }
22261 }
22262 /* Now, look for more attributes. If the next token isn't a
22263 `,', we're done. */
22267 /* Consume the comma and keep going. */
22269 }
22272 /* We built up the list in reverse order. */
22274 }
22276 /* Parse a standard C++11 attribute.
22278 The returned representation is a TREE_LIST which TREE_PURPOSE is
22279 the scoped name of the attribute, and the TREE_VALUE is its
22280 arguments list.
22282 Note that the scoped name of the attribute is itself a TREE_LIST
22283 which TREE_PURPOSE is the namespace of the attribute, and
22284 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22285 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22286 and which TREE_PURPOSE is directly the attribute name.
22288 Clients of the attribute code should use get_attribute_namespace
22289 and get_attribute_name to get the actual namespace and name of
22290 attributes, regardless of their being GNU or C++11 attributes.
22292 attribute:
22293 attribute-token attribute-argument-clause [opt]
22295 attribute-token:
22296 identifier
22297 attribute-scoped-token
22299 attribute-scoped-token:
22300 attribute-namespace :: identifier
22302 attribute-namespace:
22303 identifier
22305 attribute-argument-clause:
22306 ( balanced-token-seq )
22308 balanced-token-seq:
22309 balanced-token [opt]
22310 balanced-token-seq balanced-token
22312 balanced-token:
22313 ( balanced-token-seq )
22314 [ balanced-token-seq ]
22315 { balanced-token-seq }. */
22317 static tree
22319 {
22323 /* First, parse name of the the attribute, a.k.a
22324 attribute-token. */
22341 {
22342 /* We are seeing a scoped attribute token. */
22352 else
22353 {
22357 }
22359 NULL_TREE);
22361 }
22362 else
22363 {
22365 NULL_TREE);
22366 /* C++11 noreturn attribute is equivalent to GNU's. */
22369 /* C++14 deprecated attribute is equivalent to GNU's. */
22372 }
22374 /* Now parse the optional argument clause of the attribute. */
22379 {
22385 /* A GNU attribute that takes an identifier in parameter. */
22388 vec = cp_parser_parenthesized_expression_list
22394 else
22395 {
22398 }
22402 else
22404 }
22407 }
22409 /* Parse a list of standard C++-11 attributes.
22411 attribute-list:
22412 attribute [opt]
22413 attribute-list , attribute[opt]
22414 attribute ...
22415 attribute-list , attribute ...
22416 */
22418 static tree
22420 {
22425 {
22430 {
22433 }
22438 }
22441 }
22443 /* Parse a standard C++-11 attribute specifier.
22445 attribute-specifier:
22446 [ [ attribute-list ] ]
22447 alignment-specifier
22449 alignment-specifier:
22450 alignas ( type-id ... [opt] )
22451 alignas ( alignment-expression ... [opt] ). */
22453 static tree
22455 {
22461 {
22470 else
22471 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22472 when we are sure that we have actually parsed them. */
22474 }
22475 else
22476 {
22477 tree alignas_expr;
22479 /* Look for an alignment-specifier. */
22491 {
22494 }
22500 {
22504 alignas_expr =
22512 }
22515 {
22518 }
22522 /* Build the C++-11 representation of an 'aligned'
22523 attribute. */
22524 attributes =
22528 }
22531 }
22533 /* Parse a standard C++-11 attribute-specifier-seq.
22535 attribute-specifier-seq:
22536 attribute-specifier-seq [opt] attribute-specifier
22537 */
22539 static tree
22541 {
22545 {
22554 }
22558 }
22560 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22561 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22562 current value of the PEDANTIC flag, regardless of whether or not
22563 the `__extension__' keyword is present. The caller is responsible
22564 for restoring the value of the PEDANTIC flag. */
22566 static bool
22568 {
22569 /* Save the old value of the PEDANTIC flag. */
22573 {
22574 /* Consume the `__extension__' token. */
22576 /* We're not being pedantic while the `__extension__' keyword is
22577 in effect. */
22581 }
22584 }
22586 /* Parse a label declaration.
22588 label-declaration:
22589 __label__ label-declarator-seq ;
22591 label-declarator-seq:
22592 identifier , label-declarator-seq
22593 identifier */
22595 static void
22597 {
22598 /* Look for the `__label__' keyword. */
22602 {
22603 tree identifier;
22605 /* Look for an identifier. */
22607 /* If we failed, stop. */
22610 /* Declare it as a label. */
22612 /* If the next token is a `;', stop. */
22615 /* Look for the `,' separating the label declarations. */
22617 }
22619 /* Look for the final `;'. */
22621 }
22623 // -------------------------------------------------------------------------- //
22624 // Requires Clause
22626 // Parse a requires clause.
22627 //
22628 // requires-clause:
22629 // 'requires' logical-or-expression
22630 //
22631 // The required logical-or-expression must be a constant expression.
22632 static tree
22634 {
22635 // Parse the constant expression.
22636 tree expr =
22641 }
22643 // Optionally parse a requires clause:
22644 //
22645 // requires-clause:
22646 // 'requires' logical-or-expression
22647 //
22648 // The required logical-or-expression must be a constant expression.
22649 static tree
22651 {
22656 }
22659 // -------------------------------------------------------------------------- //
22660 // Requires Expression
22663 // An RAII helper that provides scoped control for entering and exiting
22664 // the local scope defined by a requires expression. Name bindings introduced
22665 // within the scope are popped prior to exiting the scope.
22666 struct cp_parser_requires_expr_scope
22667 {
22668 // Enter a scope of kind K belonging to the decl D.
22670 {
22672 }
22675 {
22679 }
22680 };
22682 // Parse a requires expression
22683 //
22684 // requirement-expression:
22685 // 'requires' requirement-parameter-list requirement-body
22686 static tree
22688 {
22692 // TODO: Earlier versions of the concepts lite spec did not allow
22693 // requires expressions outside of template declarations. That
22694 // restriction was relaxed in Chicago, but it has not been implemented.
22696 {
22700 }
22703 // TODO: Check that requires expressions are only written inside of
22704 // template declarations. They don't need to be concepts, just templates.
22706 // Parse the optional parameter list. Any local parameter declarations
22707 // are added to a new scope and are visible within the nested
22708 // requirement list.
22709 cp_parser_requires_expr_scope guard;
22714 // Parse the requirement body.
22720 }
22722 // Parse a parameterized requirement.
22723 //
22724 // requirement-parameter-list:
22725 // '(' parameter-declaration-clause ')'
22726 static tree
22728 {
22732 // Parse the nested parameter declaration clause.
22741 }
22743 // Parse the body of a requirement.
22744 //
22745 // requirement-body:
22746 // '{' requirement-list '}'
22747 static tree
22749 {
22759 }
22761 // Parse a list of requirements.
22762 //
22763 // requirement-list:
22764 // requirement
22765 // requirement-list ';' requirement[opt]
22766 static tree
22768 {
22771 {
22778 // If we see a semi-colon, consume it.
22782 // If we've found the end of the list, stop processing
22783 // the list.
22786 }
22788 // Reverse the order of requirements so they are analyzed in
22789 // declaration order.
22791 }
22793 // Parse a syntactic requirement or type requirement.
22794 //
22795 // requirement:
22796 // simple-requirement
22797 // compound-requirement
22798 // type-requirement
22799 // nested-requirement
22800 static tree
22802 {
22809 // Try parsing a type requirement first.
22816 }
22818 // Parse a nested requirement. This is the same as a requires clause.
22819 //
22820 // nested-requirement:
22821 // requires-clause
22822 static tree
22824 {
22830 }
22832 // Parse a simple requirement.
22833 //
22834 // simple-requirement:
22835 // expression
22836 static tree
22838 {
22843 }
22845 // Parse a compound requirement
22846 //
22847 // compound-requirement:
22848 // '{' expression '}' trailing-constraint-specifiers
22849 //
22850 // trailing-constraint-specifiers:
22851 // constraint-specifiers-seq[opt] result-type-requirement[opt]
22852 //
22853 // result-type-requirement:
22854 // '->' type-id
22855 static tree
22857 {
22858 // Parse an expression enclosed in '{ }'s.
22869 // Parse trailing expression specifiers.
22872 // Parse the optional trailing type requirement.
22875 {
22883 }
22886 }
22888 // Parse a type requirement
22889 //
22890 // type-requirement
22891 // type-id
22892 static tree
22894 {
22895 // Try parsing the type-id
22900 // It can only be a type requirement if nothing comes after it.
22901 // For example, this:
22902 //
22903 // typename T::value_type x = a;
22904 //
22905 // Is not a type requirement even though it stars with a type-id.
22910 }
22912 // Parse an optional constexpr specifier in a constraint expression.
22913 static tree
22915 {
22918 }
22920 // Parse an optional noexcept specifier in a constraint expression.
22921 static tree
22923 {
22926 }
22928 static tree
22930 {
22936 }
22938 // Parse an optional expression specifier sequence.
22939 //
22940 // constraint-specifier-sequence:
22941 // constexpr [opt] noexcept [opt]
22942 static tree
22944 {
22947 {
22948 // If we can parse a constraint specifier, insert it into
22949 // the list of requirements.
22951 {
22954 }
22956 }
22958 }
22960 /* Support Functions */
22962 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22963 NAME should have one of the representations used for an
22964 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22965 is returned. If PARSER->SCOPE is a dependent type, then a
22966 SCOPE_REF is returned.
22968 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22969 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22970 was formed. Abstractly, such entities should not be passed to this
22971 function, because they do not need to be looked up, but it is
22972 simpler to check for this special case here, rather than at the
22973 call-sites.
22975 In cases not explicitly covered above, this function returns a
22976 DECL, OVERLOAD, or baselink representing the result of the lookup.
22977 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22978 is returned.
22980 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22981 (e.g., "struct") that was used. In that case bindings that do not
22982 refer to types are ignored.
22984 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22985 ignored.
22987 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22988 are ignored.
22990 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22991 types.
22993 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22994 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22995 NULL_TREE otherwise. */
22997 static tree
23004 location_t name_location)
23005 {
23006 tree decl;
23009 /* Assume that the lookup will be unambiguous. */
23013 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
23014 no longer valid. Note that if we are parsing tentatively, and
23015 the parse fails, OBJECT_TYPE will be automatically restored. */
23021 /* A template-id has already been resolved; there is no lookup to
23022 do. */
23026 {
23030 }
23032 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
23033 it should already have been checked to make sure that the name
23034 used matches the type being destroyed. */
23036 {
23037 tree type;
23039 /* Figure out to which type this destructor applies. */
23044 else
23046 /* If that's not a class type, there is no destructor. */
23053 /* If it was a class type, return the destructor. */
23055 }
23057 /* By this point, the NAME should be an ordinary identifier. If
23058 the id-expression was a qualified name, the qualifying scope is
23059 stored in PARSER->SCOPE at this point. */
23062 /* Perform the lookup. */
23064 {
23070 /* If the SCOPE is dependent, the lookup must be deferred until
23071 the template is instantiated -- unless we are explicitly
23072 looking up names in uninstantiated templates. Even then, we
23073 cannot look up the name if the scope is not a class type; it
23074 might, for example, be a template type parameter. */
23079 /* Defer lookup. */
23081 else
23082 {
23085 /* If PARSER->SCOPE is a dependent type, then it must be a
23086 class type, and we must not be checking dependencies;
23087 otherwise, we would have processed this lookup above. So
23088 that PARSER->SCOPE is not considered a dependent base by
23089 lookup_member, we must enter the scope here. */
23093 /* If the PARSER->SCOPE is a template specialization, it
23094 may be instantiated during name lookup. In that case,
23095 errors may be issued. Even if we rollback the current
23096 tentative parse, those errors are valid. */
23101 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
23102 lookup result and the nested-name-specifier nominates a class C:
23103 * if the name specified after the nested-name-specifier, when
23104 looked up in C, is the injected-class-name of C (Clause 9), or
23105 * if the name specified after the nested-name-specifier is the
23106 same as the identifier or the simple-template-id's template-
23107 name in the last component of the nested-name-specifier,
23108 the name is instead considered to name the constructor of
23109 class C. [ Note: for example, the constructor is not an
23110 acceptable lookup result in an elaborated-type-specifier so
23111 the constructor would not be used in place of the
23112 injected-class-name. --end note ] Such a constructor name
23113 shall be used only in the declarator-id of a declaration that
23114 names a constructor or in a using-declaration. */
23122 /* If we have a single function from a using decl, pull it out. */
23129 }
23131 /* If the scope is a dependent type and either we deferred lookup or
23132 we did lookup but didn't find the name, rememeber the name. */
23135 {
23137 {
23138 tree type;
23140 /* The resolution to Core Issue 180 says that `struct
23141 A::B' should be considered a type-name, even if `A'
23142 is dependent. */
23147 }
23151 CPP_CLOSE_PAREN)))
23155 else
23158 is_template);
23159 }
23162 }
23164 {
23165 /* Look up the name in the scope of the OBJECT_TYPE, unless the
23166 OBJECT_TYPE is not a class. */
23168 /* If the OBJECT_TYPE is a template specialization, it may
23169 be instantiated during name lookup. In that case, errors
23170 may be issued. Even if we rollback the current tentative
23171 parse, those errors are valid. */
23173 name,
23176 tf_warning_or_error);
23177 else
23181 /* Look it up in the enclosing context. */
23187 }
23188 else
23189 {
23195 }
23197 /* If the lookup failed, let our caller know. */
23201 /* Pull out the template from an injected-class-name (or multiple). */
23205 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23207 {
23210 /* The error message we have to print is too complicated for
23211 cp_parser_error, so we incorporate its actions directly. */
23213 {
23215 name);
23217 }
23219 }
23227 /* If we have resolved the name of a member declaration, check to
23228 see if the declaration is accessible. When the name resolves to
23229 set of overloaded functions, accessibility is checked when
23230 overload resolution is done.
23232 During an explicit instantiation, access is not checked at all,
23233 as per [temp.explicit]. */
23240 }
23242 /* Like cp_parser_lookup_name, but for use in the typical case where
23243 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23244 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23246 static tree
23248 {
23250 none_type,
23255 location);
23256 }
23258 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23259 the current context, return the TYPE_DECL. If TAG_NAME_P is
23260 true, the DECL indicates the class being defined in a class-head,
23261 or declared in an elaborated-type-specifier.
23263 Otherwise, return DECL. */
23265 static tree
23267 {
23268 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23269 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23271 struct A {
23272 template <typename T> struct B;
23273 };
23275 template <typename T> struct A::B {};
23277 Similarly, in an elaborated-type-specifier:
23279 namespace N { struct X{}; }
23281 struct A {
23282 template <typename T> friend struct N::X;
23283 };
23285 However, if the DECL refers to a class type, and we are in
23286 the scope of the class, then the name lookup automatically
23287 finds the TYPE_DECL created by build_self_reference rather
23288 than a TEMPLATE_DECL. For example, in:
23290 template <class T> struct S {
23291 S s;
23292 };
23294 there is no need to handle such case. */
23300 }
23302 /* If too many, or too few, template-parameter lists apply to the
23303 declarator, issue an error message. Returns TRUE if all went well,
23304 and FALSE otherwise. */
23306 static bool
23309 location_t declarator_location)
23310 {
23312 {
23314 {
23322 /* If the DECLARATOR has the form `X<y>' then it uses one
23323 additional level of template parameters. */
23326 return cp_parser_check_template_parameters
23328 }
23343 }
23345 }
23347 /* NUM_TEMPLATES were used in the current declaration. If that is
23348 invalid, return FALSE and issue an error messages. Otherwise,
23349 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23350 declarator and we can print more accurate diagnostics. */
23352 static bool
23355 location_t location,
23357 {
23358 /* If there are the same number of template classes and parameter
23359 lists, that's OK. */
23362 /* If there are more, but only one more, then we are referring to a
23363 member template. That's OK too. */
23366 /* If there are more template classes than parameter lists, we have
23367 something like:
23369 template <class T> void S<T>::R<T>::f (); */
23371 {
23381 else
23384 }
23385 /* Otherwise, there are too many template parameter lists. We have
23386 something like:
23388 template <class T> template <class U> void S::f(); */
23391 }
23393 /* Parse an optional `::' token indicating that the following name is
23394 from the global namespace. If so, PARSER->SCOPE is set to the
23395 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23396 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23397 Returns the new value of PARSER->SCOPE, if the `::' token is
23398 present, and NULL_TREE otherwise. */
23400 static tree
23402 {
23405 /* Peek at the next token. */
23407 /* If we're looking at a `::' token then we're starting from the
23408 global namespace, not our current location. */
23410 {
23411 /* Consume the `::' token. */
23413 /* Set the SCOPE so that we know where to start the lookup. */
23419 }
23421 {
23425 }
23428 }
23430 /* Returns TRUE if the upcoming token sequence is the start of a
23431 constructor declarator. If FRIEND_P is true, the declarator is
23432 preceded by the `friend' specifier. */
23434 static bool
23436 {
23439 tree nested_name_specifier;
23442 /* The common case is that this is not a constructor declarator, so
23443 try to avoid doing lots of work if at all possible. It's not
23444 valid declare a constructor at function scope. */
23447 /* And only certain tokens can begin a constructor declarator. */
23455 /* Parse tentatively; we are going to roll back all of the tokens
23456 consumed here. */
23458 /* Assume that we are looking at a constructor declarator. */
23461 /* Look for the optional `::' operator. */
23464 /* Look for the nested-name-specifier. */
23465 nested_name_specifier
23476 /* Outside of a class-specifier, there must be a
23477 nested-name-specifier. */
23483 /* If we have a class scope, this is easy; DR 147 says that S::S always
23484 names the constructor, and no other qualified name could. */
23487 {
23497 }
23498 /* If we still think that this might be a constructor-declarator,
23499 look for a class-name. */
23501 {
23502 /* If we have:
23504 template <typename T> struct S {
23505 S();
23506 };
23508 we must recognize that the nested `S' names a class. */
23509 tree type_decl;
23513 none_type,
23517 /* If there was no class-name, then this is not a constructor.
23518 Otherwise, if we are in a class-specifier and we aren't
23519 handling a friend declaration, check that its type matches
23520 current_class_type (c++/38313). Note: error_mark_node
23521 is left alone for error recovery purposes. */
23523 && (outside_class_specifier_p
23528 /* If we're still considering a constructor, we have to see a `(',
23529 to begin the parameter-declaration-clause, followed by either a
23530 `)', an `...', or a decl-specifier. We need to check for a
23531 type-specifier to avoid being fooled into thinking that:
23533 S (f) (int);
23535 is a constructor. (It is actually a function named `f' that
23536 takes one parameter (of type `int') and returns a value of type
23537 `S'. */
23545 /* A parameter declaration begins with a decl-specifier,
23546 which is either the "attribute" keyword, a storage class
23547 specifier, or (usually) a type-specifier. */
23549 {
23550 tree type;
23554 /* Names appearing in the type-specifier should be looked up
23555 in the scope of the class. */
23558 else
23559 {
23562 {
23566 {
23569 }
23570 }
23572 }
23574 /* Inside the constructor parameter list, surrounding
23575 template-parameter-lists do not apply. */
23576 saved_num_template_parameter_lists
23580 /* Look for the type-specifier. */
23582 CP_PARSER_FLAGS_NONE,
23588 parser->num_template_parameter_lists
23591 /* Leave the scope of the class. */
23596 }
23597 }
23599 /* We did not really want to consume any tokens. */
23603 }
23605 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23606 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23607 they must be performed once we are in the scope of the function.
23609 Returns the function defined. */
23611 static tree
23612 cp_parser_function_definition_from_specifiers_and_declarator
23615 tree attributes,
23617 {
23618 tree fn;
23621 /* Begin the function-definition. */
23624 /* The things we're about to see are not directly qualified by any
23625 template headers we've seen thus far. */
23628 /* If there were names looked up in the decl-specifier-seq that we
23629 did not check, check them now. We must wait until we are in the
23630 scope of the function to perform the checks, since the function
23631 might be a friend. */
23635 {
23638 }
23641 {
23642 /* Skip the entire function. */
23645 }
23647 {
23648 /* Seen already, skip it. An error message has already been output. */
23652 /* If this is a function from a class, pop the nested class. */
23655 }
23656 else
23657 {
23658 timevar_id_t tv;
23661 else
23667 }
23670 }
23672 /* Parse the part of a function-definition that follows the
23673 declarator. INLINE_P is TRUE iff this function is an inline
23674 function defined within a class-specifier.
23676 Returns the function defined. */
23678 static tree
23681 {
23682 tree fn;
23688 bool fully_implicit_function_template_p
23691 tree implicit_template_parms
23694 cp_binding_level* implicit_template_scope
23700 /* If the next token is `return', then the code may be trying to
23701 make use of the "named return value" extension that G++ used to
23702 support. */
23705 {
23706 /* Consume the `return' keyword. */
23708 /* Look for the identifier that indicates what value is to be
23709 returned. */
23711 /* Issue an error message. */
23714 /* Skip tokens until we reach the start of the function body. */
23716 {
23723 }
23724 }
23725 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23726 anything declared inside `f'. */
23727 saved_in_unbraced_linkage_specification_p
23730 /* Inside the function, surrounding template-parameter-lists do not
23731 apply. */
23732 saved_num_template_parameter_lists
23738 /* If the next token is `try', `__transaction_atomic', or
23739 `__transaction_relaxed`, then we are looking at either function-try-block
23740 or function-transaction-block. Note that all of these include the
23741 function-body. */
23744 RID_TRANSACTION_ATOMIC);
23746 RID_TRANSACTION_RELAXED))
23748 RID_TRANSACTION_RELAXED);
23751 else
23752 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23757 /* Finish the function. */
23760 /* Generate code for it, if necessary. */
23762 /* Restore the saved values. */
23763 parser->in_unbraced_linkage_specification_p
23765 parser->num_template_parameter_lists
23769 parser->fully_implicit_function_template_p
23771 parser->implicit_template_parms
23773 parser->implicit_template_scope
23780 }
23782 /* Parse a template-declaration, assuming that the `export' (and
23783 `extern') keywords, if present, has already been scanned. MEMBER_P
23784 is as for cp_parser_template_declaration. */
23786 static void
23788 {
23791 tree parameter_list;
23796 /* Look for the `template' keyword. */
23801 /* And the `<'. */
23805 {
23806 /* 14.5.2.2 [temp.mem]
23808 A local class shall not have member templates. */
23813 }
23814 /* [temp]
23816 A template ... shall not have C linkage. */
23818 {
23820 /* Give it C++ linkage to avoid confusing other parts of the
23821 front end. */
23824 }
23825 else
23828 /* We cannot perform access checks on the template parameter
23829 declarations until we know what is being declared, just as we
23830 cannot check the decl-specifier list. */
23833 // Save the current template requirements.
23836 /* If the next token is `>', then we have an invalid
23837 specialization. Rather than complain about an invalid template
23838 parameter, issue an error message here. */
23840 {
23844 }
23845 else
23846 {
23847 /* Parse the template parameters. */
23849 }
23851 /* Get the deferred access checks from the parameter list. These
23852 will be checked once we know what is being declared, as for a
23853 member template the checks must be performed in the scope of the
23854 class containing the member. */
23857 /* Look for the `>'. */
23859 /* We just processed one more parameter list. */
23862 // Manage template requirements
23864 {
23870 // Attach the constraints to the template parameter list.
23873 }
23875 /* If the next token is `template', there are more template
23876 parameters. */
23878 RID_TEMPLATE))
23883 else
23884 {
23885 /* There are no access checks when parsing a template, as we do not
23886 know if a specialization will be a friend. */
23890 checks,
23891 member_p,
23896 /* If this is a member template declaration, let the front
23897 end know. */
23899 {
23904 }
23909 }
23910 /* We are done with the current parameter list. */
23915 /* Finish up. */
23918 // Restore the current template requirements.
23921 /* Check the template arguments for a literal operator template. */
23925 {
23929 else
23930 {
23933 {
23939 }
23941 {
23949 }
23950 else
23952 }
23955 " Expected non-type template argument pack <char...>"
23957 decl);
23958 }
23959 /* Register member declarations. */
23962 /* For the erroneous case of a template with C linkage, we pushed an
23963 implicit C++ linkage scope; exit that scope now. */
23966 /* If DECL is a function template, we must return to parse it later.
23967 (Even though there is no definition, there might be default
23968 arguments that need handling.) */
23972 }
23974 /* Perform the deferred access checks from a template-parameter-list.
23975 CHECKS is a TREE_LIST of access checks, as returned by
23976 get_deferred_access_checks. */
23978 static void
23979 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23980 {
23984 }
23986 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23987 `function-definition' sequence that follows a template header.
23988 If MEMBER_P is true, this declaration appears in a class scope.
23990 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23991 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23993 static tree
23999 {
24002 cp_decl_specifier_seq decl_specifiers;
24006 /* This function is only used when processing a template
24007 declaration. */
24011 /* Defer access checks until we know what is being declared. */
24014 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
24015 alternative. */
24018 CP_PARSER_FLAGS_OPTIONAL,
24024 /* There are no template typedefs. */
24026 {
24030 }
24032 /* Gather up the access checks that occurred the
24033 decl-specifier-seq. */
24036 /* Check for the declaration of a template class. */
24038 {
24040 {
24043 /* In this case:
24045 struct C {
24046 friend template <typename T> struct A<T>::B;
24047 };
24049 A<T>::B will be represented by a TYPENAME_TYPE, and
24050 therefore not recognized by shadow_tag. */
24052 && !decl
24059 else
24062 /* Perform access checks for template parameters. */
24064 }
24065 }
24067 /* Complain about missing 'typename' or other invalid type names. */
24070 {
24071 /* cp_parser_parse_and_diagnose_invalid_type_name calls
24072 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
24073 the rest of this declaration. */
24076 }
24078 /* If it's not a template class, try for a template function. If
24079 the next token is a `;', then this declaration does not declare
24080 anything. But, if there were errors in the decl-specifiers, then
24081 the error might well have come from an attempted class-specifier.
24082 In that case, there's no need to warn about a missing declarator. */
24086 {
24089 checks,
24091 member_p,
24092 declares_class_or_enum,
24094 NULL);
24096 /* 7.1.1-1 [dcl.stc]
24098 A storage-class-specifier shall not be specified in an explicit
24099 specialization... */
24101 && explicit_specialization_p
24103 {
24107 }
24111 }
24113 /* Look for a trailing `;' after the declaration. */
24119 out:
24122 /* Clear any current qualification; whatever comes next is the start
24123 of something new. */
24129 }
24131 /* Parse a cast-expression that is not the operand of a unary "&". */
24133 static tree
24135 {
24138 }
24140 /* Parse a functional cast to TYPE. Returns an expression
24141 representing the cast. */
24143 static tree
24145 {
24147 tree expression_list;
24148 tree cast;
24155 {
24163 tf_warning_or_error);
24164 }
24173 else
24174 {
24177 }
24180 tf_warning_or_error);
24181 /* [expr.const]/1: In an integral constant expression "only type
24182 conversions to integral or enumeration type can be used". */
24188 NIC_CONSTRUCTOR))
24191 }
24193 /* Save the tokens that make up the body of a member function defined
24194 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
24195 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
24196 specifiers applied to the declaration. Returns the FUNCTION_DECL
24197 for the member function. */
24199 static tree
24203 tree attributes)
24204 {
24207 tree fn;
24209 /* Create the FUNCTION_DECL. */
24212 /* If something went badly wrong, bail out now. */
24214 {
24215 /* If there's a function-body, skip it. */
24220 }
24222 /* Remember it, if there default args to post process. */
24225 /* Save away the tokens that make up the body of the
24226 function. */
24228 /* Handle function try blocks. */
24231 /* We can have braced-init-list mem-initializers before the fn body. */
24233 {
24236 {
24237 /* cache_group will stop after an un-nested { } pair, too. */
24241 /* variadic mem-inits have ... after the ')'. */
24244 }
24245 }
24247 /* Handle function try blocks. */
24252 /* Save away the inline definition; we will process it when the
24253 class is complete. */
24257 /* We need to know that this was defined in the class, so that
24258 friend templates are handled correctly. */
24261 /* Add FN to the queue of functions to be parsed later. */
24265 }
24267 /* Save the tokens that make up the in-class initializer for a non-static
24268 data member. Returns a DEFAULT_ARG. */
24270 static tree
24272 {
24274 }
24276 /* Parse a template-argument-list, as well as the trailing ">" (but
24277 not the opening "<"). See cp_parser_template_argument_list for the
24278 return value. */
24280 static tree
24282 {
24283 tree arguments;
24284 tree saved_scope;
24285 tree saved_qualifying_scope;
24286 tree saved_object_scope;
24291 /* [temp.names]
24293 When parsing a template-id, the first non-nested `>' is taken as
24294 the end of the template-argument-list rather than a greater-than
24295 operator. */
24296 saved_greater_than_is_operator_p
24299 /* Parsing the argument list may modify SCOPE, so we save it
24300 here. */
24304 /* We need to evaluate the template arguments, even though this
24305 template-id may be nested within a "sizeof". */
24310 /* Parse the template-argument-list itself. */
24314 else
24316 /* Look for the `>' that ends the template-argument-list. If we find
24317 a '>>' instead, it's probably just a typo. */
24319 {
24321 {
24322 /* In C++0x, a `>>' in a template argument list or cast
24323 expression is considered to be two separate `>'
24324 tokens. So, change the current token to a `>', but don't
24325 consume it: it will be consumed later when the outer
24326 template argument list (or cast expression) is parsed.
24327 Note that this replacement of `>' for `>>' is necessary
24328 even if we are parsing tentatively: in the tentative
24329 case, after calling
24330 cp_parser_enclosed_template_argument_list we will always
24331 throw away all of the template arguments and the first
24332 closing `>', either because the template argument list
24333 was erroneous or because we are replacing those tokens
24334 with a CPP_TEMPLATE_ID token. The second `>' (which will
24335 not have been thrown away) is needed either to close an
24336 outer template argument list or to complete a new-style
24337 cast. */
24340 }
24342 {
24343 /* If we're in a nested template argument list, the '>>' has
24344 to be a typo for '> >'. We emit the error message, but we
24345 continue parsing and we push a '>' as next token, so that
24346 the argument list will be parsed correctly. Note that the
24347 global source location is still on the token before the
24348 '>>', so we need to say explicitly where we want it. */
24354 }
24355 else
24356 {
24357 /* If this is not a nested template argument list, the '>>'
24358 is a typo for '>'. Emit an error message and continue.
24359 Same deal about the token location, but here we can get it
24360 right by consuming the '>>' before issuing the diagnostic. */
24363 "spurious %<>>%>, use %<>%> to terminate "
24365 }
24366 }
24367 else
24369 /* The `>' token might be a greater-than operator again now. */
24370 parser->greater_than_is_operator_p
24372 /* Restore the SAVED_SCOPE. */
24380 }
24382 /* MEMBER_FUNCTION is a member function, or a friend. If default
24383 arguments, or the body of the function have not yet been parsed,
24384 parse them now. */
24386 static void
24388 {
24390 /* If this member is a template, get the underlying
24391 FUNCTION_DECL. */
24395 /* There should not be any class definitions in progress at this
24396 point; the bodies of members are only parsed outside of all class
24397 definitions. */
24399 /* While we're parsing the member functions we might encounter more
24400 classes. We want to handle them right away, but we don't want
24401 them getting mixed up with functions that are currently in the
24402 queue. */
24405 /* Make sure that any template parameters are in scope. */
24408 // Restore the declaration's requirements for the parsing of
24409 // the definition.
24410 //
24414 /* If the body of the function has not yet been parsed, parse it
24415 now. */
24417 {
24418 tree function_scope;
24421 /* The function is no longer pending; we are processing it. */
24426 /* If this is a local class, enter the scope of the containing
24427 function. */
24432 /* Push the body of the function onto the lexer stack. */
24435 /* Let the front end know that we going to be defining this
24436 function. */
24440 /* Don't do access checking if it is a templated function. */
24444 /* #pragma omp declare reduction needs special parsing. */
24446 {
24451 }
24452 else
24453 /* Now, parse the body of the function. */
24460 /* Leave the scope of the containing function. */
24464 }
24466 /* Remove any template parameters from the symbol table. */
24469 // Restore the template requirements.
24472 /* Restore the queue. */
24475 }
24477 /* If DECL contains any default args, remember it on the unparsed
24478 functions queue. */
24480 static void
24482 {
24483 tree probe;
24486 probe;
24489 {
24493 }
24494 }
24496 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24497 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24498 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24499 from the parameter-type-list. */
24501 static tree
24504 {
24506 tree parsed_arg;
24512 /* Push the saved tokens for the default argument onto the parser's
24513 lexer stack. */
24519 /* Parse the default argument. */
24530 {
24531 /* In a non-template class, check conversions now. In a template,
24532 we'll wait and instantiate these as needed. */
24535 tf_warning_or_error);
24536 else
24538 }
24540 /* If the token stream has not been completely used up, then
24541 there was extra junk after the end of the default
24542 argument. */
24544 {
24547 else
24549 }
24551 /* Revert to the main lexer. */
24555 }
24557 /* FIELD is a non-static data member with an initializer which we saved for
24558 later; parse it now. */
24560 static void
24562 {
24563 tree def;
24570 NULL_TREE);
24576 }
24578 /* FN is a FUNCTION_DECL which may contains a parameter with an
24579 unparsed DEFAULT_ARG. Parse the default args now. This function
24580 assumes that the current scope is the scope in which the default
24581 argument should be processed. */
24583 static void
24585 {
24589 /* While we're parsing the default args, we might (due to the
24590 statement expression extension) encounter more classes. We want
24591 to handle them right away, but we don't want them getting mixed
24592 up with default args that are currently in the queue. */
24595 /* Local variable names (and the `this' keyword) may not appear
24596 in a default argument. */
24607 {
24609 tree parsed_arg;
24611 tree copy;
24618 /* This can happen for a friend declaration for a function
24619 already declared with default arguments. */
24622 parsed_arg
24624 default_arg,
24627 {
24629 }
24633 /* Update any instantiations we've already created. */
24637 }
24641 /* Make sure no default arg is missing. */
24644 /* Restore the state of local_variables_forbidden_p. */
24647 /* Restore the queue. */
24649 }
24651 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24653 sizeof ... ( identifier )
24655 where the 'sizeof' token has already been consumed. */
24657 static tree
24659 {
24660 /* Consume the `...'. */
24667 else
24675 /* The name is not qualified. */
24693 }
24695 /* Parse the operand of `sizeof' (or a similar operator). Returns
24696 either a TYPE or an expression, depending on the form of the
24697 input. The KEYWORD indicates which kind of expression we have
24698 encountered. */
24700 static tree
24702 {
24709 /* If it's a `...', then we are computing the length of a parameter
24710 pack. */
24715 /* Types cannot be defined in a `sizeof' expression. Save away the
24716 old message. */
24718 /* And create the new one. */
24724 /* The restrictions on constant-expressions do not apply inside
24725 sizeof expressions. */
24726 saved_integral_constant_expression_p
24728 saved_non_integral_constant_expression_p
24732 /* Do not actually evaluate the expression. */
24735 /* If it's a `(', then we might be looking at the type-id
24736 construction. */
24738 {
24742 /* We can't be sure yet whether we're looking at a type-id or an
24743 expression. */
24745 /* Consume the `('. */
24747 /* Note: as a GNU Extension, compound literals are considered
24748 postfix-expressions as they are in C99, so they are valid
24749 arguments to sizeof. See comment in cp_parser_cast_expression
24750 for details. */
24752 /* Skip tokens until the next token is a closing parenthesis.
24753 If we find the closing `)', and the next token is a `{', then
24754 we are looking at a compound-literal. */
24755 compound_literal_p
24759 /* Roll back the tokens we skipped. */
24761 /* If we were looking at a compound-literal, simulate an error
24762 so that the call to cp_parser_parse_definitely below will
24763 fail. */
24766 else
24767 {
24770 /* Look for the type-id. */
24772 /* Look for the closing `)'. */
24775 }
24777 /* If all went well, then we're done. */
24779 {
24780 cp_decl_specifier_seq decl_specs;
24782 /* Build a trivial decl-specifier-seq. */
24786 /* Call grokdeclarator to figure out what type this is. */
24789 TYPENAME,
24792 }
24793 }
24795 /* If the type-id production did not work out, then we must be
24796 looking at the unary-expression production. */
24801 /* Go back to evaluating expressions. */
24805 /* Free the message we created. */
24807 /* And restore the old one. */
24809 parser->integral_constant_expression_p
24811 parser->non_integral_constant_expression_p
24815 }
24817 /* If the current declaration has no declarator, return true. */
24819 static bool
24821 {
24822 /* If the next token is a `;' or a `,' then there is no
24823 declarator. */
24826 }
24828 /* Update the DECL_SPECS to reflect the storage class indicated by
24829 KEYWORD. */
24831 static void
24836 {
24837 cp_storage_class storage_class;
24840 {
24844 }
24846 {
24849 }
24854 {
24857 }
24860 {
24878 }
24882 /* A storage class specifier cannot be applied alongside a typedef
24883 specifier. If there is a typedef specifier present then set
24884 conflicting_specifiers_p which will trigger an error later
24885 on in grokdeclarator. */
24888 }
24890 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24891 is true, the type is a class or enum definition. */
24893 static void
24895 tree type_spec,
24898 {
24901 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24902 (with, for example, in "typedef int wchar_t;") we remember that
24903 this is what happened. In system headers, we ignore these
24904 declarations so that G++ can work with system headers that are not
24905 C++-safe. */
24907 && !type_definition_p
24917 {
24920 ds_redefined_builtin_type_spec,
24921 token);
24923 {
24927 }
24928 }
24931 else
24932 {
24937 }
24938 }
24940 /* True iff TOKEN is the GNU keyword __thread. */
24942 static bool
24944 {
24947 }
24949 /* Set the location for a declarator specifier and check if it is
24950 duplicated.
24952 DECL_SPECS is the sequence of declarator specifiers onto which to
24953 set the location.
24955 DS is the single declarator specifier to set which location is to
24956 be set onto the existing sequence of declarators.
24958 LOCATION is the location for the declarator specifier to
24959 consider. */
24961 static void
24964 {
24973 {
24977 }
24978 else
24979 {
24981 {
24985 else
24986 {
24989 OPT_Wlong_long,
24991 }
24992 }
24994 {
24999 else
25001 }
25002 else
25003 {
25019 "__complex"
25020 };
25023 }
25024 }
25025 }
25027 /* Return true iff the declarator specifier DS is present in the
25028 sequence of declarator specifiers DECL_SPECS. */
25030 bool
25032 cp_decl_spec ds)
25033 {
25040 }
25042 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
25043 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
25045 static bool
25047 {
25049 }
25051 /* Issue an error message indicating that TOKEN_DESC was expected.
25052 If KEYWORD is true, it indicated this function is called by
25053 cp_parser_require_keword and the required token can only be
25054 a indicated keyword. */
25056 static void
25058 required_token token_desc,
25060 {
25062 {
25131 }
25133 {
25135 {
25214 }
25215 }
25216 else
25218 }
25222 /* If the next token is of the indicated TYPE, consume it. Otherwise,
25223 issue an error message indicating that TOKEN_DESC was expected.
25225 Returns the token consumed, if the token had the appropriate type.
25226 Otherwise, returns NULL. */
25231 required_token token_desc)
25232 {
25235 else
25236 {
25237 /* Output the MESSAGE -- unless we're parsing tentatively. */
25241 }
25242 }
25244 /* An error message is produced if the next token is not '>'.
25245 All further tokens are skipped until the desired token is
25246 found or '{', '}', ';' or an unbalanced ')' or ']'. */
25248 static void
25250 {
25251 /* Current level of '< ... >'. */
25253 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
25256 /* Are we ready, yet? If not, issue error message. */
25260 /* Skip tokens until the desired token is found. */
25262 {
25263 /* Peek at the next token. */
25265 {
25273 /* C++0x views the `>>' operator as two `>' tokens, but
25274 C++98 does not. */
25277 {
25278 /* We've hit a `>>' where the first `>' closes the
25279 template argument list, and the second `>' is
25280 spurious. Just consume the `>>' and stop; we've
25281 already produced at least one error. */
25284 }
25285 /* Fall through for C++0x, so we handle the second `>' in
25286 the `>>'. */
25290 {
25291 /* We've reached the token we want, consume it and stop. */
25294 }
25313 /* The '>' was probably forgotten, don't look further. */
25318 }
25320 /* Consume this token. */
25322 }
25323 }
25325 /* If the next token is the indicated keyword, consume it. Otherwise,
25326 issue an error message indicating that TOKEN_DESC was expected.
25328 Returns the token consumed, if the token had the appropriate type.
25329 Otherwise, returns NULL. */
25334 required_token token_desc)
25335 {
25339 {
25342 }
25345 }
25347 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25348 function-definition. */
25350 static bool
25352 {
25355 /* A ctor-initializer begins with a `:'. */
25357 /* A function-try-block begins with `try'. */
25359 /* A function-transaction-block begins with `__transaction_atomic'
25360 or `__transaction_relaxed'. */
25363 /* The named return value extension begins with `return'. */
25365 }
25367 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25368 definition. */
25370 static bool
25372 {
25379 }
25381 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25382 C++0x) ending a template-argument. */
25384 static bool
25386 {
25394 }
25396 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25397 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25399 static bool
25402 {
25408 /* Check for the sequence `<::' in the original code. It would be lexed as
25409 `[:', where `[' is a digraph, and there is no whitespace before
25410 `:'. */
25412 {
25417 }
25419 }
25421 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25422 or none_type otherwise. */
25424 static enum tag_types
25426 {
25428 {
25438 }
25439 }
25441 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25443 static void
25445 {
25449 {
25453 type))
25456 }
25457 }
25459 /* Issue an error message if DECL is redeclared with different
25460 access than its original declaration [class.access.spec/3].
25461 This applies to nested classes and nested class templates.
25462 [class.mem/1]. */
25464 static void
25466 {
25475 }
25477 /* Look for the `template' keyword, as a syntactic disambiguator.
25478 Return TRUE iff it is present, in which case it will be
25479 consumed. */
25481 static bool
25483 {
25485 {
25486 /* In C++98 the `template' keyword can only be used within templates;
25487 outside templates the parser can always figure out what is a
25488 template and what is not. In C++11, per the resolution of DR 468,
25489 `template' is allowed in cases where it is not strictly necessary. */
25492 {
25495 "in C++98 %<template%> (as a disambiguator) is only "
25497 /* If this part of the token stream is rescanned, the same
25498 error message would be generated. So, we purge the token
25499 from the stream. */
25502 }
25503 else
25504 {
25505 /* Consume the `template' keyword. */
25508 }
25509 }
25511 }
25513 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25514 set PARSER->SCOPE, and perform other related actions. */
25516 static void
25518 {
25524 /* Get the stored value. */
25526 /* Perform any access checks that were deferred. */
25529 {
25534 }
25535 /* Set the scope from the stored value. */
25539 }
25541 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25542 encounter the end of a block before what we were looking for. */
25544 static bool
25548 {
25550 {
25553 /* Abort a parenthesized expression if we encounter a semicolon. */
25557 /* If we've reached the end of the file, stop. */
25563 /* We've hit the end of an enclosing block, so there's been some
25564 kind of syntax error. */
25567 /* Consume the token. */
25569 /* See if it starts a new group. */
25571 {
25573 /* In theory this should probably check end == '}', but
25574 cp_parser_save_member_function_body needs it to exit
25575 after either '}' or ')' when called with ')'. */
25578 }
25580 {
25584 }
25589 }
25590 }
25592 /* Like above, for caching a default argument or NSDMI. Both of these are
25593 terminated by a non-nested comma, but it can be unclear whether or not a
25594 comma is nested in a template argument list unless we do more parsing.
25595 In order to handle this ambiguity, when we encounter a ',' after a '<'
25596 we try to parse what follows as a parameter-declaration-list (in the
25597 case of a default argument) or a member-declarator (in the case of an
25598 NSDMI). If that succeeds, then we stop caching. */
25600 static tree
25602 {
25607 tree default_argument;
25609 /* Add tokens until we have processed the entire default
25610 argument. We add the range [first_token, token). */
25613 {
25614 /* For list-initialization, this is straightforward. */
25617 }
25619 {
25622 /* Peek at the next token. */
25624 /* What we do depends on what token we have. */
25626 {
25627 /* In valid code, a default argument must be
25628 immediately followed by a `,' `)', or `...'. */
25631 {
25632 /* If we've seen a '<', we might be in a
25633 template-argument-list. Until Core issue 325 is
25634 resolved, we don't know how this situation ought
25635 to be handled, so try to DTRT. We check whether
25636 what comes after the comma is a valid parameter
25637 declaration list. If it is, then the comma ends
25638 the default argument; otherwise the default
25639 argument continues. */
25642 /* Set ITALP so cp_parser_parameter_declaration_list
25643 doesn't decide to commit to this parse. */
25651 {
25657 }
25658 else
25659 {
25663 }
25670 }
25673 /* If we run into a non-nested `;', `}', or `]',
25674 then the code is invalid -- but the default
25675 argument is certainly over. */
25680 /* Handle correctly int n = sizeof ... ( p ); */
25683 /* Update DEPTH, if necessary. */
25698 /* This might be the comparison operator, or it might
25699 start a template argument list. */
25706 /* Fall through for C++0x, which treats the `>>'
25707 operator like two `>' tokens in certain
25708 cases. */
25712 {
25713 /* This might be an operator, or it might close a
25714 template argument list. But if a previous '<'
25715 started a template argument list, this will have
25716 closed it, so we can't be in one anymore. */
25720 }
25723 /* If we run out of tokens, issue an error message. */
25732 /* In these cases, we should look for template-ids.
25733 For example, if the default argument is
25734 `X<int, double>()', we need to do name lookup to
25735 figure out whether or not `X' is a template; if
25736 so, the `,' does not end the default argument.
25738 That is not yet done. */
25743 }
25745 /* If we've reached the end, stop. */
25749 /* Add the token to the token block. */
25751 }
25753 /* Create a DEFAULT_ARG to represent the unparsed default
25754 argument. */
25761 }
25763 /* Begin parsing tentatively. We always save tokens while parsing
25764 tentatively so that if the tentative parsing fails we can restore the
25765 tokens. */
25767 static void
25769 {
25770 /* Enter a new parsing context. */
25772 /* Begin saving tokens. */
25774 /* In order to avoid repetitive access control error messages,
25775 access checks are queued up until we are no longer parsing
25776 tentatively. */
25778 }
25780 /* Commit to the currently active tentative parse. */
25782 static void
25784 {
25788 /* Mark all of the levels as committed. */
25791 {
25798 }
25799 }
25801 /* Commit to the topmost currently active tentative parse.
25803 Note that this function shouldn't be called when there are
25804 irreversible side-effects while in a tentative state. For
25805 example, we shouldn't create a permanent entry in the symbol
25806 table, or issue an error message that might not apply if the
25807 tentative parse is aborted. */
25809 static void
25811 {
25816 {
25824 }
25825 }
25827 /* Abort the currently active tentative parse. All consumed tokens
25828 will be rolled back, and no diagnostics will be issued. */
25830 static void
25832 {
25836 /* Now, pretend that we want to see if the construct was
25837 successfully parsed. */
25839 }
25841 /* Stop parsing tentatively. If a parse error has occurred, restore the
25842 token stream. Otherwise, commit to the tokens we have consumed.
25843 Returns true if no error occurred; false otherwise. */
25845 static bool
25847 {
25851 /* Remember whether or not an error occurred, since we are about to
25852 destroy that information. */
25854 /* Remove the topmost context from the stack. */
25857 /* If no parse errors occurred, commit to the tentative parse. */
25859 {
25860 /* Commit to the tokens read tentatively, unless that was
25861 already done. */
25866 }
25867 /* Otherwise, if errors occurred, roll back our state so that things
25868 are just as they were before we began the tentative parse. */
25869 else
25870 {
25873 }
25874 /* Add the context to the front of the free list. */
25879 }
25881 /* Returns true if we are parsing tentatively and are not committed to
25882 this tentative parse. */
25884 static bool
25886 {
25889 }
25891 /* Returns nonzero iff an error has occurred during the most recent
25892 tentative parse. */
25894 static bool
25896 {
25899 }
25901 /* Returns nonzero if GNU extensions are allowed. */
25903 static bool
25905 {
25907 }
25908 \f
25909 /* Objective-C++ Productions */
25912 /* Parse an Objective-C expression, which feeds into a primary-expression
25913 above.
25915 objc-expression:
25916 objc-message-expression
25917 objc-string-literal
25918 objc-encode-expression
25919 objc-protocol-expression
25920 objc-selector-expression
25922 Returns a tree representation of the expression. */
25924 static tree
25926 {
25927 /* Try to figure out what kind of declaration is present. */
25931 {
25941 {
25953 }
25959 }
25962 }
25964 /* Parse an Objective-C message expression.
25966 objc-message-expression:
25967 [ objc-message-receiver objc-message-args ]
25969 Returns a representation of an Objective-C message. */
25971 static tree
25973 {
25982 }
25984 /* Parse an objc-message-receiver.
25986 objc-message-receiver:
25987 expression
25988 simple-type-specifier
25990 Returns a representation of the type or expression. */
25992 static tree
25994 {
25995 tree rcv;
25997 /* An Objective-C message receiver may be either (1) a type
25998 or (2) an expression. */
26007 CP_PARSER_FLAGS_NONE);
26010 }
26012 /* Parse the arguments and selectors comprising an Objective-C message.
26014 objc-message-args:
26015 objc-selector
26016 objc-selector-args
26017 objc-selector-args , objc-comma-args
26019 objc-selector-args:
26020 objc-selector [opt] : assignment-expression
26021 objc-selector-args objc-selector [opt] : assignment-expression
26023 objc-comma-args:
26024 assignment-expression
26025 objc-comma-args , assignment-expression
26027 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
26028 selector arguments and TREE_VALUE containing a list of comma
26029 arguments. */
26031 static tree
26033 {
26039 {
26045 /* Detect if we have a unary selector. */
26054 sel_args
26059 }
26061 /* Handle non-selector arguments, if any. */
26063 {
26064 tree arg;
26069 addl_args
26074 }
26077 {
26080 }
26083 }
26085 /* Parse an Objective-C encode expression.
26087 objc-encode-expression:
26088 @encode objc-typename
26090 Returns an encoded representation of the type argument. */
26092 static tree
26094 {
26095 tree type;
26105 {
26109 }
26111 /* This happens if we find @encode(T) (where T is a template
26112 typename or something dependent on a template typename) when
26113 parsing a template. In that case, we can't compile it
26114 immediately, but we rather create an AT_ENCODE_EXPR which will
26115 need to be instantiated when the template is used.
26116 */
26118 {
26122 }
26125 }
26127 /* Parse an Objective-C @defs expression. */
26129 static tree
26131 {
26132 tree name;
26140 }
26142 /* Parse an Objective-C protocol expression.
26144 objc-protocol-expression:
26145 @protocol ( identifier )
26147 Returns a representation of the protocol expression. */
26149 static tree
26151 {
26152 tree proto;
26160 }
26162 /* Parse an Objective-C selector expression.
26164 objc-selector-expression:
26165 @selector ( objc-method-signature )
26167 objc-method-signature:
26168 objc-selector
26169 objc-selector-seq
26171 objc-selector-seq:
26172 objc-selector :
26173 objc-selector-seq objc-selector :
26175 Returns a representation of the method selector. */
26177 static tree
26179 {
26191 {
26200 {
26201 /* Detect if we have a unary selector. */
26203 {
26206 }
26207 else
26208 {
26210 }
26211 }
26216 {
26217 sel_seq
26220 sel_seq
26223 }
26224 else
26225 sel_seq
26230 }
26232 finish_selector:
26236 }
26238 /* Parse a list of identifiers.
26240 objc-identifier-list:
26241 identifier
26242 objc-identifier-list , identifier
26244 Returns a TREE_LIST of identifier nodes. */
26246 static tree
26248 {
26249 tree identifier;
26250 tree list;
26261 {
26268 identifier));
26270 }
26273 }
26275 /* Parse an Objective-C alias declaration.
26277 objc-alias-declaration:
26278 @compatibility_alias identifier identifier ;
26280 This function registers the alias mapping with the Objective-C front end.
26281 It returns nothing. */
26283 static void
26285 {
26293 }
26295 /* Parse an Objective-C class forward-declaration.
26297 objc-class-declaration:
26298 @class objc-identifier-list ;
26300 The function registers the forward declarations with the Objective-C
26301 front end. It returns nothing. */
26303 static void
26305 {
26308 {
26309 tree id;
26319 else
26321 }
26323 }
26325 /* Parse a list of Objective-C protocol references.
26327 objc-protocol-refs-opt:
26328 objc-protocol-refs [opt]
26330 objc-protocol-refs:
26331 < objc-identifier-list >
26333 Returns a TREE_LIST of identifiers, if any. */
26335 static tree
26337 {
26341 {
26345 }
26348 }
26350 /* Parse a Objective-C visibility specification. */
26352 static void
26354 {
26358 {
26373 }
26375 /* Eat '@private'/'@protected'/'@public'. */
26377 }
26379 /* Parse an Objective-C method type. Return 'true' if it is a class
26380 (+) method, and 'false' if it is an instance (-) method. */
26384 {
26387 else
26389 }
26391 /* Parse an Objective-C protocol qualifier. */
26393 static tree
26395 {
26408 {
26413 }
26416 }
26418 /* Parse an Objective-C typename. */
26420 static tree
26422 {
26426 {
26432 /* An ObjC type name may consist of just protocol qualifiers, in which
26433 case the type shall default to 'id'. */
26435 {
26438 /* If the type could not be parsed, an error has already
26439 been produced. For error recovery, behave as if it had
26440 not been specified, which will use the default type
26441 'id'. */
26443 {
26445 /* We need to skip to the closing parenthesis as
26446 cp_parser_type_id() does not seem to do it for
26447 us. */
26452 }
26453 }
26457 }
26460 }
26462 /* Check to see if TYPE refers to an Objective-C selector name. */
26464 static bool
26466 {
26472 }
26474 /* Parse an Objective-C selector. */
26476 static tree
26478 {
26482 {
26485 }
26487 /* C++ operator names are allowed to appear in ObjC selectors. */
26489 {
26502 }
26503 }
26505 /* Parse an Objective-C params list. */
26507 static tree
26509 {
26515 {
26525 /* Detect if we have a unary selector. */
26528 {
26531 }
26535 {
26536 /* Something went quite wrong. There should be a colon
26537 here, but there is not. Stop parsing parameters. */
26539 }
26541 /* New ObjC allows attributes on parameters too. */
26546 params
26549 type_name,
26550 identifier,
26551 parm_attr));
26554 }
26557 {
26560 }
26562 /* We allow tail attributes for the method. */
26564 {
26572 }
26575 {
26578 }
26580 }
26582 /* Parse the non-keyword Objective-C params. */
26584 static tree
26587 {
26593 {
26595 tree parm;
26601 {
26606 }
26608 /* TODO: parse attributes for tail parameters. */
26617 }
26619 /* We allow tail attributes for the method. */
26621 {
26623 {
26628 }
26629 else
26630 /* We have an error, but parse the attributes, so that we can
26631 carry on. */
26637 }
26640 }
26642 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26644 static void
26646 {
26649 /* If the next token is `extern' and the following token is a string
26650 literal, then we have a linkage specification. */
26652 && cp_parser_is_pure_string_literal
26655 /* Handle #pragma, if any. */
26658 /* Allow stray semicolons. */
26661 /* Mark methods as optional or required, when building protocols. */
26663 {
26666 }
26668 {
26671 }
26674 /* Other stray characters must generate errors. */
26676 {
26680 }
26681 /* Finally, try to parse a block-declaration, or a function-definition. */
26682 else
26684 }
26686 /* Parse a method signature. */
26688 static tree
26690 {
26706 }
26708 static bool
26710 {
26711 tree tattr;
26716 /* If the attributes are followed by a method introducer, this is not allowed.
26717 Dump the attributes and flag the situation. */
26722 /* Otherwise, the attributes introduce some interstitial code, possibly so
26723 rewind to allow that check. */
26726 }
26728 /* Parse an Objective-C method prototype list. */
26730 static void
26732 {
26736 {
26738 {
26743 else
26747 {
26751 }
26754 }
26760 OPT_Wattributes,
26762 else
26763 /* Allow for interspersed non-ObjC++ code. */
26767 }
26771 else
26775 }
26777 /* Parse an Objective-C method definition list. */
26779 static void
26781 {
26785 {
26786 tree meth;
26789 {
26795 else
26800 {
26804 }
26806 NULL_TREE);
26808 /* For historical reasons, we accept an optional semicolon. */
26815 {
26822 }
26823 }
26824 /* The following case will be removed once @synthesize is
26825 completely implemented. */
26836 else
26837 /* Allow for interspersed non-ObjC++ code. */
26841 }
26845 else
26849 }
26851 /* Parse Objective-C ivars. */
26853 static void
26855 {
26866 {
26867 cp_decl_specifier_seq declspecs;
26869 tree prefix_attributes;
26877 CP_PARSER_FLAGS_OPTIONAL,
26881 /* auto, register, static, extern, mutable. */
26883 {
26886 }
26888 /* thread_local. */
26890 {
26893 }
26895 /* typedef. */
26897 {
26900 }
26905 /* Keep going until we hit the `;' at the end of the
26906 declaration. */
26908 {
26913 /* Check for a (possibly unnamed) bitfield declaration. */
26921 {
26922 /* Get the name of the bitfield. */
26925 sfk_none);
26927 eat_colon:
26929 /* Get the width of the bitfield. */
26930 width
26933 NULL);
26934 }
26935 else
26936 {
26937 /* Parse the declarator. */
26938 declarator
26943 }
26945 /* Look for attributes that apply to the ivar. */
26947 /* Remember which attributes are prefix attributes and
26948 which are not. */
26950 /* Combine the attributes. */
26954 /* Create the bitfield declaration. */
26956 width,
26957 attributes);
26958 else
26963 /* Add the instance variable. */
26967 /* Reset PREFIX_ATTRIBUTES. */
26976 {
26979 }
26981 }
26985 }
26990 /* Do not consume the RID_AT_END, so it will be read again as terminating
26991 the @interface of @implementation. */
26995 /* For historical reasons, we accept an optional semicolon. */
26998 }
27000 /* Parse an Objective-C protocol declaration. */
27002 static void
27004 {
27010 {
27015 }
27017 /* See if we have a forward declaration or a definition. */
27020 /* Try a forward declaration first. */
27022 {
27024 {
27025 tree id;
27035 else
27037 }
27039 }
27041 /* Ok, we got a full-fledged definition (or at least should). */
27042 else
27043 {
27048 }
27049 }
27051 /* Parse an Objective-C superclass or category. */
27053 static void
27058 {
27064 {
27067 }
27069 {
27072 /* If there is no category name, and this is an @interface, we
27073 have a class extension. */
27075 {
27078 }
27079 else
27083 }
27084 }
27086 /* Parse an Objective-C class interface. */
27088 static void
27090 {
27097 {
27098 /* It's hard to recover because even if valid @interface stuff
27099 is to follow, we can't compile it (or validate it) if we
27100 don't even know which class it refers to. Let's assume this
27101 was a stray '@interface' token in the stream and skip it.
27102 */
27104 }
27109 /* We have either a class or a category on our hands. */
27112 else
27113 {
27115 /* Handle instance variable declarations, if any. */
27118 }
27121 }
27123 /* Parse an Objective-C class implementation. */
27125 static void
27127 {
27134 {
27135 /* It's hard to recover because even if valid @implementation
27136 stuff is to follow, we can't compile it (or validate it) if
27137 we don't even know which class it refers to. Let's assume
27138 this was a stray '@implementation' token in the stream and
27139 skip it.
27140 */
27142 }
27146 /* We have either a class or a category on our hands. */
27149 else
27150 {
27152 /* Handle instance variable declarations, if any. */
27155 }
27158 }
27160 /* Consume the @end token and finish off the implementation. */
27162 static void
27164 {
27167 }
27169 /* Parse an Objective-C declaration. */
27171 static void
27173 {
27174 /* Try to figure out what kind of declaration is present. */
27179 {
27195 }
27198 {
27221 }
27222 }
27224 /* Parse an Objective-C try-catch-finally statement.
27226 objc-try-catch-finally-stmt:
27227 @try compound-statement objc-catch-clause-seq [opt]
27228 objc-finally-clause [opt]
27230 objc-catch-clause-seq:
27231 objc-catch-clause objc-catch-clause-seq [opt]
27233 objc-catch-clause:
27234 @catch ( objc-exception-declaration ) compound-statement
27236 objc-finally-clause:
27237 @finally compound-statement
27239 objc-exception-declaration:
27240 parameter-declaration
27241 '...'
27243 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27245 Returns NULL_TREE.
27247 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27248 for C. Keep them in sync. */
27250 static tree
27252 {
27253 location_t location;
27254 tree stmt;
27259 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27260 node, lest it get absorbed into the surrounding block. */
27266 {
27275 {
27276 /* We have "@catch (...)" (where the '...' are literally
27277 what is in the code). Skip the '...'.
27278 parameter_declaration is set to NULL_TREE, and
27279 objc_being_catch_clauses() knows that that means
27280 '...'. */
27283 }
27284 else
27285 {
27286 /* We have "@catch (NSException *exception)" or something
27287 like that. Parse the parameter declaration. */
27291 else
27296 }
27299 else
27300 {
27301 /* If there was no open parenthesis, we are recovering from
27302 an error, and we are trying to figure out what mistake
27303 the user has made. */
27305 /* If there is an immediate closing parenthesis, the user
27306 probably forgot the opening one (ie, they typed "@catch
27307 NSException *e)". Parse the closing parenthesis and keep
27308 going. */
27312 /* If these is no immediate closing parenthesis, the user
27313 probably doesn't know that parenthesis are required at
27314 all (ie, they typed "@catch NSException *e"). So, just
27315 forget about the closing parenthesis and keep going. */
27316 }
27320 }
27322 {
27325 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27326 node, lest it get absorbed into the surrounding block. */
27330 }
27333 }
27335 /* Parse an Objective-C synchronized statement.
27337 objc-synchronized-stmt:
27338 @synchronized ( expression ) compound-statement
27340 Returns NULL_TREE. */
27342 static tree
27344 {
27345 location_t location;
27356 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27357 node, lest it get absorbed into the surrounding block. */
27362 }
27364 /* Parse an Objective-C throw statement.
27366 objc-throw-stmt:
27367 @throw assignment-expression [opt] ;
27369 Returns a constructed '@throw' statement. */
27371 static tree
27373 {
27385 }
27387 /* Parse an Objective-C statement. */
27389 static tree
27391 {
27392 /* Try to figure out what kind of declaration is present. */
27396 {
27407 }
27410 }
27412 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27413 look ahead to see if an objc keyword follows the attributes. This
27414 is to detect the use of prefix attributes on ObjC @interface and
27415 @protocol. */
27417 static bool
27419 {
27424 {
27427 }
27430 }
27432 /* This routine is a minimal replacement for
27433 c_parser_struct_declaration () used when parsing the list of
27434 types/names or ObjC++ properties. For example, when parsing the
27435 code
27437 @property (readonly) int a, b, c;
27439 this function is responsible for parsing "int a, int b, int c" and
27440 returning the declarations as CHAIN of DECLs.
27442 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27443 similar parsing. */
27444 static tree
27446 {
27448 cp_decl_specifier_seq declspecs;
27450 tree prefix_attributes;
27453 CP_PARSER_FLAGS_NONE,
27460 /* auto, register, static, extern, mutable. */
27462 {
27465 }
27467 /* thread_local. */
27469 {
27472 }
27474 /* typedef. */
27476 {
27479 }
27484 /* Keep going until we hit the `;' at the end of the declaration. */
27486 {
27491 /* Parse the declarator. */
27495 /* Look for attributes that apply to the ivar. */
27497 /* Remember which attributes are prefix attributes and
27498 which are not. */
27500 /* Combine the attributes. */
27510 /* Reset PREFIX_ATTRIBUTES. */
27521 {
27524 }
27525 else
27527 }
27529 }
27531 /* Parse an Objective-C @property declaration. The syntax is:
27533 objc-property-declaration:
27534 '@property' objc-property-attributes[opt] struct-declaration ;
27536 objc-property-attributes:
27537 '(' objc-property-attribute-list ')'
27539 objc-property-attribute-list:
27540 objc-property-attribute
27541 objc-property-attribute-list, objc-property-attribute
27543 objc-property-attribute
27544 'getter' = identifier
27545 'setter' = identifier
27546 'readonly'
27547 'readwrite'
27548 'assign'
27549 'retain'
27550 'copy'
27551 'nonatomic'
27553 For example:
27554 @property NSString *name;
27555 @property (readonly) id object;
27556 @property (retain, nonatomic, getter=getTheName) id name;
27557 @property int a, b, c;
27559 PS: This function is identical to
27560 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27561 static void
27563 {
27564 /* The following variables hold the attributes of the properties as
27565 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27566 seen. When we see an attribute, we set them to 'true' (if they
27567 are boolean properties) or to the identifier (if they have an
27568 argument, ie, for getter and setter). Note that here we only
27569 parse the list of attributes, check the syntax and accumulate the
27570 attributes that we find. objc_add_property_declaration() will
27571 then process the information. */
27581 /* 'properties' is the list of properties that we read. Usually a
27582 single one, but maybe more (eg, in "@property int a, b, c;" there
27583 are three). */
27584 tree properties;
27585 location_t loc;
27591 /* Parse the optional attribute list... */
27593 {
27594 /* Eat the '('. */
27598 {
27604 {
27607 }
27611 {
27622 {
27626 else
27631 }
27634 {
27638 }
27640 {
27642 {
27645 }
27646 else
27650 else
27652 }
27653 else
27654 {
27656 {
27659 }
27660 else
27662 }
27668 }
27675 else
27677 }
27679 /* FIXME: "@property (setter, assign);" will generate a spurious
27680 "error: expected ‘)’ before ‘,’ token". This is because
27681 cp_parser_require, unlike the C counterpart, will produce an
27682 error even if we are in error recovery. */
27684 {
27689 }
27690 }
27692 /* ... and the property declaration(s). */
27696 {
27698 /* If the next token is now a `;', consume it. */
27702 }
27706 else
27707 {
27708 /* Comma-separated properties are chained together in
27709 reverse order; add them one by one. */
27718 }
27721 }
27723 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27725 objc-synthesize-declaration:
27726 @synthesize objc-synthesize-identifier-list ;
27728 objc-synthesize-identifier-list:
27729 objc-synthesize-identifier
27730 objc-synthesize-identifier-list, objc-synthesize-identifier
27732 objc-synthesize-identifier
27733 identifier
27734 identifier = identifier
27736 For example:
27737 @synthesize MyProperty;
27738 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27740 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27741 for C. Keep them in sync.
27742 */
27743 static void
27745 {
27747 location_t loc;
27752 {
27756 {
27759 }
27761 {
27765 {
27768 }
27769 }
27770 else
27775 else
27777 }
27780 }
27782 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27784 objc-dynamic-declaration:
27785 @dynamic identifier-list ;
27787 For example:
27788 @dynamic MyProperty;
27789 @dynamic MyProperty, AnotherProperty;
27791 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27792 for C. Keep them in sync.
27793 */
27794 static void
27796 {
27798 location_t loc;
27803 {
27804 tree property;
27807 {
27810 }
27814 else
27816 }
27819 }
27821 \f
27822 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27824 /* Returns name of the next clause.
27825 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27826 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27827 returned and the token is consumed. */
27829 static pragma_omp_clause
27831 {
27843 {
27848 {
27951 }
27952 }
27958 }
27960 /* Validate that a clause of the given type does not already exist. */
27962 static void
27965 {
27966 tree c;
27970 {
27973 }
27974 }
27976 /* OpenMP 2.5:
27977 variable-list:
27978 identifier
27979 variable-list , identifier
27981 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27982 colon). An opening parenthesis will have been consumed by the caller.
27984 If KIND is nonzero, create the appropriate node and install the decl
27985 in OMP_CLAUSE_DECL and add the node to the head of the list.
27987 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27988 return the list created.
27990 COLON can be NULL if only closing parenthesis should end the list,
27991 or pointer to bool which will receive false if the list is terminated
27992 by closing parenthesis or true if the list is terminated by colon. */
27994 static tree
27997 {
28001 {
28004 }
28006 {
28023 {
28025 {
28031 {
28038 NULL);
28040 parser->colon_corrects_to_scope_p
28044 else
28045 {
28046 /* Look for `:'. */
28050 CPP_CLOSE_SQUARE))
28053 NULL);
28054 }
28055 /* Look for the closing `]'. */
28057 RT_CLOSE_SQUARE))
28060 }
28064 }
28070 }
28071 else
28074 get_comma:
28078 }
28084 {
28088 }
28091 {
28094 /* Try to resync to an unnested comma. Copied from
28095 cp_parser_parenthesized_expression_list. */
28096 skip_comma:
28105 }
28108 }
28110 /* Similarly, but expect leading and trailing parenthesis. This is a very
28111 common case for omp clauses. */
28113 static tree
28115 {
28119 }
28121 /* OpenMP 3.0:
28122 collapse ( constant-expression ) */
28124 static tree
28126 {
28128 location_t loc;
28129 HOST_WIDE_INT n;
28149 {
28152 }
28160 }
28162 /* OpenMP 2.5:
28163 default ( shared | none ) */
28165 static tree
28167 {
28169 tree c;
28174 {
28179 {
28194 }
28197 }
28198 else
28199 {
28200 invalid_kind:
28202 }
28218 }
28220 /* OpenMP 3.1:
28221 final ( expression ) */
28223 static tree
28225 {
28246 }
28248 /* OpenMP 2.5:
28249 if ( expression ) */
28251 static tree
28253 {
28274 }
28276 /* OpenMP 3.1:
28277 mergeable */
28279 static tree
28282 {
28283 tree c;
28286 location);
28291 }
28293 /* OpenMP 2.5:
28294 nowait */
28296 static tree
28299 {
28300 tree c;
28307 }
28309 /* OpenMP 2.5:
28310 num_threads ( expression ) */
28312 static tree
28314 location_t location)
28315 {
28337 }
28339 /* OpenMP 2.5:
28340 ordered */
28342 static tree
28345 {
28346 tree c;
28354 }
28356 /* OpenMP 2.5:
28357 reduction ( reduction-operator : variable-list )
28359 reduction-operator:
28360 One of: + * - & ^ | && ||
28362 OpenMP 3.1:
28364 reduction-operator:
28365 One of: + * - & ^ | && || min max
28367 OpenMP 4.0:
28369 reduction-operator:
28370 One of: + * - & ^ | && ||
28371 id-expression */
28373 static tree
28375 {
28383 {
28393 }
28397 else
28398 {
28409 {
28439 }
28440 else
28441 {
28443 resync_fail:
28448 }
28449 }
28455 NULL);
28457 {
28460 }
28463 }
28465 /* OpenMP 2.5:
28466 schedule ( schedule-kind )
28467 schedule ( schedule-kind , expression )
28469 schedule-kind:
28470 static | dynamic | guided | runtime | auto */
28472 static tree
28474 {
28483 {
28488 {
28509 }
28510 }
28515 else
28520 {
28535 else
28540 }
28548 invalid_kind:
28550 resync_fail:
28555 }
28557 /* OpenMP 3.0:
28558 untied */
28560 static tree
28563 {
28564 tree c;
28571 }
28573 /* OpenMP 4.0:
28574 inbranch
28575 notinbranch */
28577 static tree
28580 {
28585 }
28587 /* OpenMP 4.0:
28588 parallel
28589 for
28590 sections
28591 taskgroup */
28593 static tree
28597 {
28601 }
28603 /* OpenMP 4.0:
28604 num_teams ( expression ) */
28606 static tree
28608 location_t location)
28609 {
28631 }
28633 /* OpenMP 4.0:
28634 thread_limit ( expression ) */
28636 static tree
28638 location_t location)
28639 {
28661 }
28663 /* OpenMP 4.0:
28664 aligned ( variable-list )
28665 aligned ( variable-list : constant-expression ) */
28667 static tree
28669 {
28680 {
28690 }
28696 }
28698 /* OpenMP 4.0:
28699 linear ( variable-list )
28700 linear ( variable-list : expression ) */
28702 static tree
28705 {
28716 {
28720 {
28723 }
28731 }
28737 }
28739 /* OpenMP 4.0:
28740 safelen ( constant-expression ) */
28742 static tree
28744 location_t location)
28745 {
28766 }
28768 /* OpenMP 4.0:
28769 simdlen ( constant-expression ) */
28771 static tree
28773 location_t location)
28774 {
28795 }
28797 /* OpenMP 4.0:
28798 depend ( depend-kind : variable-list )
28800 depend-kind:
28801 in | out | inout */
28803 static tree
28805 {
28813 {
28823 else
28825 }
28826 else
28834 NULL);
28841 invalid_kind:
28843 resync_fail:
28848 }
28850 /* OpenMP 4.0:
28851 map ( map-kind : variable-list )
28852 map ( variable-list )
28854 map-kind:
28855 alloc | to | from | tofrom */
28857 static tree
28859 {
28868 {
28880 else
28881 {
28887 }
28890 }
28893 NULL);
28899 }
28901 /* OpenMP 4.0:
28902 device ( expression ) */
28904 static tree
28906 location_t location)
28907 {
28929 }
28931 /* OpenMP 4.0:
28932 dist_schedule ( static )
28933 dist_schedule ( static , expression ) */
28935 static tree
28937 location_t location)
28938 {
28951 {
28962 }
28967 location);
28971 invalid_kind:
28973 resync_fail:
28978 }
28980 /* OpenMP 4.0:
28981 proc_bind ( proc-bind-kind )
28983 proc-bind-kind:
28984 master | close | spread */
28986 static tree
28988 location_t location)
28989 {
28990 tree c;
28997 {
29007 else
29009 }
29010 else
29019 location);
29024 invalid_kind:
29026 resync_fail:
29031 }
29033 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29034 is a bitmask in MASK. Return the list of clauses found; the result
29035 of clause default goes in *pdefault. */
29037 static tree
29041 {
29048 {
29049 pragma_omp_clause c_kind;
29060 {
29072 clauses);
29086 clauses);
29095 clauses);
29119 clauses);
29133 clauses);
29150 OMP_CLAUSE_NOTINBRANCH,
29159 {
29160 clause_not_first:
29164 }
29189 clauses);
29194 clauses);
29199 clauses);
29262 }
29267 {
29268 /* Remove the invalid clause(s) from the list to avoid
29269 confusing the rest of the compiler. */
29272 }
29273 }
29274 saw_error:
29275 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29276 no reason to skip to the end. */
29282 }
29284 /* OpenMP 2.5:
29285 structured-block:
29286 statement
29288 In practice, we're also interested in adding the statement to an
29289 outer node. So it is convenient if we work around the fact that
29290 cp_parser_statement calls add_stmt. */
29292 static unsigned
29294 {
29297 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29298 This preserves the "not within loop or switch" style error messages
29299 for nonsense cases like
29300 void foo() {
29301 #pragma omp single
29302 break;
29303 }
29304 */
29309 }
29311 static void
29313 {
29315 }
29317 static tree
29319 {
29327 }
29329 /* OpenMP 2.5:
29330 # pragma omp atomic new-line
29331 expression-stmt
29333 expression-stmt:
29334 x binop= expr | x++ | ++x | x-- | --x
29335 binop:
29336 +, *, -, /, &, ^, |, <<, >>
29338 where x is an lvalue expression with scalar type.
29340 OpenMP 3.1:
29341 # pragma omp atomic new-line
29342 update-stmt
29344 # pragma omp atomic read new-line
29345 read-stmt
29347 # pragma omp atomic write new-line
29348 write-stmt
29350 # pragma omp atomic update new-line
29351 update-stmt
29353 # pragma omp atomic capture new-line
29354 capture-stmt
29356 # pragma omp atomic capture new-line
29357 capture-block
29359 read-stmt:
29360 v = x
29361 write-stmt:
29362 x = expr
29363 update-stmt:
29364 expression-stmt | x = x binop expr
29365 capture-stmt:
29366 v = expression-stmt
29367 capture-block:
29368 { v = x; update-stmt; } | { update-stmt; v = x; }
29370 OpenMP 4.0:
29371 update-stmt:
29372 expression-stmt | x = x binop expr | x = expr binop x
29373 capture-stmt:
29374 v = update-stmt
29375 capture-block:
29376 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29378 where x and v are lvalue expressions with scalar type. */
29380 static void
29382 {
29390 {
29395 {
29401 }
29402 }
29404 {
29416 else
29420 }
29422 {
29428 {
29433 {
29436 }
29437 }
29438 }
29442 {
29453 else
29459 {
29460 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29461 opcode. */
29466 }
29470 {
29473 }
29474 else
29475 {
29482 }
29485 }
29487 restart:
29492 {
29499 /* FALLTHROUGH */
29509 /* FALLTHROUGH */
29524 /* Undo effects of boolean_increment for post {in,de}crement. */
29526 /* FALLTHRU */
29530 {
29531 /* Undo effects of boolean_increment. */
29533 {
29534 /* This is pre or post increment. */
29539 && !structured_block
29543 }
29544 }
29545 /* FALLTHRU */
29548 {
29583 {
29587 }
29590 {
29596 {
29601 }
29603 {
29614 {
29616 {
29621 }
29622 else
29624 }
29628 }
29631 {
29638 }
29642 }
29646 {
29649 {
29657 }
29659 {
29664 }
29699 }
29710 /* FALLTHROUGH */
29715 }
29722 }
29723 stmt_done:
29725 {
29738 }
29740 {
29743 }
29744 done:
29750 saw_error:
29753 {
29757 {
29761 }
29762 }
29763 }
29766 /* OpenMP 2.5:
29767 # pragma omp barrier new-line */
29769 static void
29771 {
29774 }
29776 /* OpenMP 2.5:
29777 # pragma omp critical [(name)] new-line
29778 structured-block */
29780 static tree
29782 {
29786 {
29798 }
29803 }
29805 /* OpenMP 2.5:
29806 # pragma omp flush flush-vars[opt] new-line
29808 flush-vars:
29809 ( variable-list ) */
29811 static void
29813 {
29819 }
29821 /* Helper function, to parse omp for increment expression. */
29823 static tree
29825 {
29830 {
29833 }
29836 {
29845 /* Fall through: OpenMP disallows NE_EXPR. */
29848 }
29850 /* If decl is an iterator, preserve LHS and RHS of the relational
29851 expr until finish_omp_for. */
29861 }
29863 /* Helper function, to parse omp for increment expression. */
29865 static tree
29867 {
29871 cp_id_kind idk;
29875 {
29883 }
29891 {
29896 }
29903 {
29907 }
29919 do
29920 {
29927 {
29929 {
29932 else
29934 tf_warning_or_error);
29935 }
29936 else
29939 }
29940 }
29944 {
29948 }
29949 else
29953 }
29955 /* Parse the initialization statement of either an OpenMP for loop or
29956 a Cilk Plus for loop.
29958 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29959 Plus.
29961 Return true if the resulting construct should have an
29962 OMP_CLAUSE_PRIVATE added to it. */
29964 static bool
29972 {
29978 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29980 init-expr:
29981 var = lb
29982 integer-type var = lb
29983 random-access-iterator-type var = lb
29984 pointer-type var = lb
29985 */
29986 cp_decl_specifier_seq type_specifiers;
29988 /* First, try to parse as an initialized declaration. See
29989 cp_parser_condition, from whence the bulk of this is copied. */
29996 {
29997 /* If parsing a type specifier seq succeeded, then this
29998 MUST be a initialized declaration. */
30003 CP_PARSER_DECLARATOR_NAMED,
30013 else
30014 {
30024 {
30026 CPP_OPEN_PAREN))
30027 {
30031 else
30034 }
30035 else
30036 /* Trigger an error. */
30041 }
30045 {
30053 {
30056 auto_node);
30061 }
30064 asm_specification,
30065 LOOKUP_ONLYCONVERTING);
30067 {
30070 }
30071 else
30074 }
30075 else
30076 {
30077 /* Consume '='. */
30081 non_class:
30084 else
30087 asm_specification,
30088 LOOKUP_ONLYCONVERTING);
30089 }
30093 }
30094 }
30095 else
30096 {
30097 cp_id_kind idk;
30098 /* If parsing a type specifier sequence failed, then
30099 this MUST be a simple expression. */
30104 && decl
30107 {
30108 tree rhs;
30115 rhs,
30116 tf_warning_or_error));
30118 }
30119 else
30120 {
30125 {
30129 }
30130 }
30131 }
30133 }
30135 /* Parse the restricted form of the for statement allowed by OpenMP. */
30137 static tree
30140 {
30144 location_t loc_first;
30163 {
30166 location_t loc;
30169 {
30172 }
30181 add_private_clause
30189 {
30192 {
30198 }
30199 else
30201 }
30208 {
30213 {
30217 }
30220 {
30221 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30222 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30231 }
30232 else
30233 {
30238 }
30239 }
30242 {
30243 tree c;
30245 {
30254 decl);
30258 decl);
30259 }
30261 {
30266 {
30269 }
30270 }
30271 }
30280 {
30281 /* If decl is an iterator, preserve the operator on decl
30282 until finish_omp_for. */
30284 && ((processing_template_decl
30288 else
30292 }
30307 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30308 in between the collapsed for loops to be still considered perfectly
30309 nested. Hopefully the final version clarifies this.
30310 For now handle (multiple) {'s and empty statements. */
30312 do
30313 {
30317 {
30319 bracecount++;
30320 }
30324 else
30325 {
30332 }
30333 }
30337 {
30340 }
30341 }
30343 /* Note that we saved the original contents of this flag when we entered
30344 the structured block, and so we don't need to re-save it here. */
30347 else
30350 /* Note that the grammar doesn't call for a structured block here,
30351 though the loop as a whole is a structured block. */
30358 else
30363 {
30365 {
30367 nbraces--;
30368 }
30371 else
30372 {
30374 {
30377 }
30382 }
30383 }
30390 }
30392 /* Helper function for OpenMP parsing, split clauses and call
30393 finish_omp_clauses on each of the set of clauses afterwards. */
30395 static void
30398 {
30404 }
30406 /* OpenMP 4.0:
30407 #pragma omp simd simd-clause[optseq] new-line
30408 for-loop */
30410 #define OMP_SIMD_CLAUSE_MASK \
30411 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30419 static tree
30422 {
30434 {
30437 }
30448 }
30450 /* OpenMP 2.5:
30451 #pragma omp for for-clause[optseq] new-line
30452 for-loop
30454 OpenMP 4.0:
30455 #pragma omp for simd for-simd-clause[optseq] new-line
30456 for-loop */
30458 #define OMP_FOR_CLAUSE_MASK \
30459 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30468 static tree
30471 {
30482 {
30487 {
30495 cclauses);
30499 cclauses);
30511 }
30512 }
30514 {
30517 }
30522 {
30525 }
30536 }
30538 /* OpenMP 2.5:
30539 # pragma omp master new-line
30540 structured-block */
30542 static tree
30544 {
30548 }
30550 /* OpenMP 2.5:
30551 # pragma omp ordered new-line
30552 structured-block */
30554 static tree
30556 {
30560 }
30562 /* OpenMP 2.5:
30564 section-scope:
30565 { section-sequence }
30567 section-sequence:
30568 section-directive[opt] structured-block
30569 section-sequence section-directive structured-block */
30571 static tree
30573 {
30584 {
30588 }
30591 {
30599 {
30603 }
30605 {
30608 }
30613 }
30624 }
30626 /* OpenMP 2.5:
30627 # pragma omp sections sections-clause[optseq] newline
30628 sections-scope */
30630 #define OMP_SECTIONS_CLAUSE_MASK \
30631 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30637 static tree
30640 {
30652 {
30655 }
30662 }
30664 /* OpenMP 2.5:
30665 # pragma omp parallel parallel-clause[optseq] new-line
30666 structured-block
30667 # pragma omp parallel for parallel-for-clause[optseq] new-line
30668 structured-block
30669 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30670 structured-block
30672 OpenMP 4.0:
30673 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30674 structured-block */
30676 #define OMP_PARALLEL_CLAUSE_MASK \
30677 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30687 static tree
30690 {
30699 {
30712 block);
30717 }
30719 {
30723 }
30725 {
30728 }
30730 {
30734 {
30744 block);
30747 }
30748 }
30758 }
30760 /* OpenMP 2.5:
30761 # pragma omp single single-clause[optseq] new-line
30762 structured-block */
30764 #define OMP_SINGLE_CLAUSE_MASK \
30765 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30770 static tree
30772 {
30782 }
30784 /* OpenMP 3.0:
30785 # pragma omp task task-clause[optseq] new-line
30786 structured-block */
30788 #define OMP_TASK_CLAUSE_MASK \
30789 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30799 static tree
30801 {
30812 }
30814 /* OpenMP 3.0:
30815 # pragma omp taskwait new-line */
30817 static void
30819 {
30822 }
30824 /* OpenMP 3.1:
30825 # pragma omp taskyield new-line */
30827 static void
30829 {
30832 }
30834 /* OpenMP 4.0:
30835 # pragma omp taskgroup new-line
30836 structured-block */
30838 static tree
30840 {
30844 }
30847 /* OpenMP 2.5:
30848 # pragma omp threadprivate (variable-list) */
30850 static void
30852 {
30853 tree vars;
30859 }
30861 /* OpenMP 4.0:
30862 # pragma omp cancel cancel-clause[optseq] new-line */
30864 #define OMP_CANCEL_CLAUSE_MASK \
30865 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30871 static void
30873 {
30877 }
30879 /* OpenMP 4.0:
30880 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30882 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30883 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30888 static void
30890 {
30891 tree clauses;
30895 {
30900 {
30903 }
30904 }
30906 {
30910 }
30913 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30915 pragma_tok);
30917 }
30919 /* OpenMP 4.0:
30920 #pragma omp distribute distribute-clause[optseq] new-line
30921 for-loop */
30923 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30924 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30929 static tree
30932 {
30941 {
30949 else
30952 {
30958 {
30961 cclauses);
30962 else
30964 cclauses);
30965 }
30970 cclauses);
30971 else
30973 cclauses);
30985 }
30986 }
30988 {
30991 }
30996 {
30999 }
31010 }
31012 /* OpenMP 4.0:
31013 # pragma omp teams teams-clause[optseq] new-line
31014 structured-block */
31016 #define OMP_TEAMS_CLAUSE_MASK \
31017 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31025 static tree
31028 {
31037 {
31041 {
31049 cclauses);
31053 cclauses);
31064 }
31065 }
31067 {
31070 }
31075 {
31078 }
31086 }
31088 /* OpenMP 4.0:
31089 # pragma omp target data target-data-clause[optseq] new-line
31090 structured-block */
31092 #define OMP_TARGET_DATA_CLAUSE_MASK \
31093 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31097 static tree
31099 {
31111 }
31113 /* OpenMP 4.0:
31114 # pragma omp target update target-update-clause[optseq] new-line */
31116 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31117 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31122 static bool
31125 {
31127 {
31129 "%<#pragma omp target update%> may only be "
31133 }
31135 tree clauses
31140 {
31142 "%<#pragma omp target update must contain at least one "
31145 }
31153 }
31155 /* OpenMP 4.0:
31156 # pragma omp target target-clause[optseq] new-line
31157 structured-block */
31159 #define OMP_TARGET_CLAUSE_MASK \
31160 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31164 static bool
31167 {
31169 {
31173 }
31176 {
31181 {
31189 {
31191 OMP_TARGET_CLAUSE_MASK,
31192 cclauses);
31194 }
31210 }
31212 {
31215 }
31217 {
31221 }
31223 {
31226 }
31227 }
31241 }
31243 /* OpenMP 4.0:
31244 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31246 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31247 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31250 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31254 static void
31257 {
31259 cp_omp_declare_simd_data data;
31261 {
31266 }
31277 {
31281 {
31294 }
31299 "%<#pragma omp declare simd%> not immediately followed by "
31303 }
31304 }
31306 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31307 This function is modelled similar to the late parsing of omp declare
31308 simd. */
31310 static tree
31312 {
31318 {
31324 }
31326 {
31330 }
31335 {
31342 NULL);
31356 }
31361 }
31363 /* Finalize #pragma omp declare simd clauses after direct declarator has
31364 been parsed, and put that into "omp declare simd" attribute. */
31366 static tree
31368 {
31374 {
31379 }
31384 {
31402 }
31406 }
31409 /* OpenMP 4.0:
31410 # pragma omp declare target new-line
31411 declarations and definitions
31412 # pragma omp end declare target new-line */
31414 static void
31416 {
31419 }
31421 static void
31423 {
31426 {
31429 }
31431 {
31435 {
31438 }
31441 else
31442 {
31446 }
31447 }
31448 else
31449 {
31453 }
31457 "%<#pragma omp end declare target%> without corresponding "
31459 else
31461 }
31463 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31464 expression and optional initializer clause of
31465 #pragma omp declare reduction. We store the expression(s) as
31466 either 3, 6 or 7 special statements inside of the artificial function's
31467 body. The first two statements are DECL_EXPRs for the artificial
31468 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31469 expression that uses those variables.
31470 If there was any INITIALIZER clause, this is followed by further statements,
31471 the fourth and fifth statements are DECL_EXPRs for the artificial
31472 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31473 constructor variant (first token after open paren is not omp_priv),
31474 then the sixth statement is a statement with the function call expression
31475 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31476 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31477 to initialize the OMP_PRIV artificial variable and there is seventh
31478 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31480 static bool
31482 {
31494 tree combiner;
31509 {
31512 }
31515 {
31522 {
31525 }
31541 {
31545 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31549 == CPP_CLOSE_PAREN
31552 {
31556 }
31561 }
31562 else
31563 {
31579 {
31584 }
31586 tree arg;
31599 }
31610 }
31616 }
31618 /* OpenMP 4.0
31619 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31620 initializer-clause[opt] new-line
31622 initializer-clause:
31623 initializer (omp_priv initializer)
31624 initializer (function-name (argument-list)) */
31626 static void
31629 {
31639 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31646 {
31678 }
31690 /* Types may not be defined in declare reduction type list. */
31693 parser->type_definition_forbidden_message
31699 saved_colon_doesnt_start_class_def_p
31704 {
31708 ;
31729 else
31734 else
31736 }
31738 /* Restore the saved message. */
31741 parser->colon_doesnt_start_class_def_p
31746 {
31747 fail:
31750 }
31756 {
31757 tree fntype
31760 NULL_TREE);
31779 {
31784 }
31786 {
31788 {
31797 }
31804 }
31805 else
31806 {
31809 }
31812 else
31815 {
31818 }
31820 {
31823 else
31828 }
31833 else
31834 {
31843 }
31850 }
31854 done:
31855 /* Free any declarators allocated. */
31857 }
31859 /* OpenMP 4.0
31860 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31861 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31862 initializer-clause[opt] new-line
31863 #pragma omp declare target new-line */
31865 static void
31868 {
31870 {
31875 {
31878 context);
31880 }
31883 {
31886 context);
31888 }
31890 {
31893 }
31895 {
31899 }
31900 }
31904 }
31906 /* Main entry point to OpenMP statement pragmas. */
31908 static void
31910 {
31911 tree stmt;
31916 {
31964 }
31968 }
31969 \f
31970 /* Transactional Memory parsing routines. */
31972 /* Parse a transaction attribute.
31974 txn-attribute:
31975 attribute
31976 [ [ identifier ] ]
31978 ??? Simplify this when C++0x bracket attributes are
31979 implemented properly. */
31981 static tree
31983 {
31998 {
32002 /* For keywords, use the canonical spelling,
32003 not the parsed identifier. */
32007 }
32008 else
32012 error1:
32015 }
32017 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32019 transaction-statement:
32020 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32021 compound-statement
32022 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32023 */
32025 static tree
32027 {
32042 else
32043 {
32047 }
32049 /* Parse a noexcept specification. */
32052 /* Keep track if we're in the lexical scope of an outer transaction. */
32064 }
32066 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32068 transaction-expression:
32069 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32070 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32071 */
32073 static tree
32075 {
32100 /* Set this early. This might mean that we allow transaction_cancel in
32101 an expression that we find out later actually has to be a constexpr.
32102 However, we expect that cxx_constant_value will be able to deal with
32103 this; also, if the noexcept has no constexpr, then what we parse next
32104 really is a transaction's body. */
32107 /* Parse a noexcept specification. */
32113 {
32120 }
32121 else
32122 {
32123 /* The only expression that is available got parsed for the noexcept
32124 already. noexcept is true then. */
32127 }
32136 }
32138 /* Parse a function-transaction-block.
32140 function-transaction-block:
32141 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32142 function-body
32143 __transaction_atomic txn-attribute[opt] function-try-block
32144 __transaction_relaxed ctor-initializer[opt] function-body
32145 __transaction_relaxed function-try-block
32146 */
32148 static bool
32150 {
32166 else
32167 {
32171 }
32179 else
32180 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32188 }
32190 /* Parse a __transaction_cancel statement.
32192 cancel-statement:
32193 __transaction_cancel txn-attribute[opt] ;
32194 __transaction_cancel txn-attribute[opt] throw-expression ;
32196 ??? Cancel and throw is not yet implemented. */
32198 static tree
32200 {
32206 RT_TRANSACTION_CANCEL);
32213 /* ??? Parse cancel-and-throw here. */
32218 {
32222 }
32224 {
32228 }
32230 {
32233 {
32239 }
32240 }
32242 {
32246 }
32252 }
32253 \f
32254 /* The parser. */
32258 \f
32259 /* Special handling for the first token or line in the file. The first
32260 thing in the file might be #pragma GCC pch_preprocess, which loads a
32261 PCH file, which is a GC collection point. So we need to handle this
32262 first pragma without benefit of an existing lexer structure.
32264 Always returns one token to the caller in *FIRST_TOKEN. This is
32265 either the true first token of the file, or the first token after
32266 the initial pragma. */
32268 static void
32270 {
32279 {
32286 }
32287 else
32290 /* Skip to the end of the pragma. */
32294 /* Now actually load the PCH file. */
32298 /* Read one more token to return to our caller. We have to do this
32299 after reading the PCH file in, since its pointers have to be
32300 live. */
32302 }
32304 /* Normal parsing of a pragma token. Here we can (and must) use the
32305 regular lexer. */
32307 static bool
32309 {
32321 {
32329 {
32339 }
32344 {
32354 }
32359 {
32365 "%<#pragma omp taskwait%> may only be "
32370 }
32375 {
32381 "%<#pragma omp taskyield%> may only be "
32386 }
32391 {
32397 "%<#pragma omp cancel%> may only be "
32402 }
32407 {
32413 "%<#pragma omp cancellation point%> may only be "
32418 }
32456 "%<#pragma omp section%> may only be used in "
32461 {
32468 {
32471 }
32474 }
32478 {
32482 }
32491 bad_stmt:
32494 }
32498 }
32500 /* The interface the pragma parsers have to the lexer. */
32502 enum cpp_ttype
32504 {
32517 else
32518 {
32522 }
32525 }
32527 \f
32528 /* External interface. */
32530 /* Parse one entire translation unit. */
32532 void
32534 {
32538 {
32541 }
32549 }
32551 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32552 vectorlength clause:
32553 Syntax:
32554 vectorlength ( constant-expression ) */
32556 static tree
32559 {
32561 tree expr;
32562 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32563 safelen clause. Thus, vectorlength is represented as OMP 4.0
32564 safelen. For SIMD-enabled function it is represented by OMP 4.0
32565 simdlen. */
32568 loc);
32569 else
32571 loc);
32579 /* If expr == error_mark_node, then don't emit any errors nor
32580 create a clause. if any of the above functions returns
32581 error mark node then they would have emitted an error message. */
32583 ;
32591 else
32592 {
32593 tree c;
32595 {
32600 }
32601 else
32602 {
32607 }
32608 }
32613 }
32615 /* Handles the Cilk Plus #pragma simd linear clause.
32616 Syntax:
32617 linear ( simd-linear-variable-list )
32619 simd-linear-variable-list:
32620 simd-linear-variable
32621 simd-linear-variable-list , simd-linear-variable
32623 simd-linear-variable:
32624 id-expression
32625 id-expression : simd-linear-step
32627 simd-linear-step:
32628 conditional-expression */
32630 static tree
32632 {
32638 {
32642 }
32647 {
32650 {
32654 }
32661 {
32665 }
32666 else
32667 {
32671 /* If present, parse the linear step. Otherwise, assume the default
32672 value of 1. */
32674 {
32681 {
32682 /* If an error has occurred, then the whole pragma is
32683 considered ill-formed. Thus, no reason to keep
32684 parsing. */
32687 }
32695 else
32697 "step size must be an integer constant "
32699 }
32701 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32707 }
32712 else
32713 {
32718 }
32719 }
32723 }
32725 /* Returns the name of the next clause. If the clause is not
32726 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32727 token is not consumed. Otherwise, the appropriate enum from the
32728 pragma_simd_clause is returned and the token is consumed. */
32730 static pragma_omp_clause
32732 {
32733 pragma_omp_clause clause_type;
32750 else
32755 }
32757 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32759 static tree
32761 {
32766 {
32767 pragma_omp_clause c_kind;
32774 /* Use the OpenMP 4.0 equivalent function. */
32777 /* Use the OpenMP 4.0 equivalent function. */
32779 clauses);
32781 /* Use the OMP 4.0 equivalent function. */
32783 clauses);
32785 /* Use the OMP 4.0 equivalent function. */
32787 else
32788 {
32792 }
32793 }
32799 else
32801 }
32803 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32805 static void
32807 {
32814 {
32818 }
32828 }
32830 /* Create an identifier for a generic parameter type (a synthesized
32831 template parameter implied by `auto' or a concept identifier). */
32834 static tree
32836 {
32840 }
32842 /* Predicate that behaves as is_auto_or_concept but matches the parent
32843 node of the generic type rather than the generic type itself. This
32844 allows for type transformation in add_implicit_template_parms. */
32848 {
32850 }
32852 // Return the template decl being called or evaluated as part of the
32853 // constraint check.
32854 //
32855 // TODO: This is a bit of a hack. When we finish the template parameter
32856 // the constraint is just a call expression, but we don't have the full
32857 // context that we used to build that call expression. Since we're going
32858 // to be comparing declarations, it would helpful to have that. This
32859 // means we'll have to make the TREE_TYPE of the parameter node a pair
32860 // containing the context (the TYPE_DECL) and the constraint.
32861 static tree
32863 {
32869 }
32871 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32872 (creating a new template parameter list if necessary). Returns the newly
32873 created template type parm. */
32875 tree
32877 {
32880 // Before committing to modifying any scope, if we're in an implicit
32881 // template scope, and we're trying to synthesize a constrained
32882 // parameter, try to find a previous parameter with the same name.
32884 {
32887 {
32892 }
32893 }
32896 /* We are either continuing a function template that already contains implicit
32897 template parameters, creating a new fully-implicit function template, or
32898 extending an existing explicit function template with implicit template
32899 parameters. */
32907 {
32911 }
32912 else
32913 {
32914 /* Roll back to the existing template parameter scope (in the case of
32915 extending an explicit function template) or introduce a new template
32916 parameter scope ahead of the function parameter scope (or class scope
32917 in the case of out-of-line member definitions). The function scope is
32918 added back after template parameter synthesis below. */
32923 {
32926 }
32928 {
32929 /* If not defining a class, then any class scope is a scope level in
32930 an out-of-line member definition. In this case simply wind back
32931 beyond the first such scope to inject the template parameter list.
32932 Otherwise wind back to the class being defined. The latter can
32933 occur in class member friend declarations such as:
32935 class A {
32936 void foo (auto);
32937 };
32938 class B {
32939 friend void A::foo (auto);
32940 };
32942 The template parameter list synthesized for the friend declaration
32943 must be injected in the scope of 'B'. This can also occur in
32944 erroneous cases such as:
32946 struct A {
32947 struct B {
32948 void foo (auto);
32949 };
32950 void B::foo (auto) {}
32951 };
32953 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32954 but, nevertheless, the template parameter list synthesized for the
32955 declarator should be injected into the scope of 'A' as if the
32956 ill-formed template was specified explicitly. */
32959 {
32962 }
32963 }
32969 {
32970 /* Introduce a new template parameter list for implicit template
32971 parameters. */
32975 parser->implicit_template_scope
32982 }
32983 else
32984 {
32985 /* Synthesize implicit template parameters at the end of the explicit
32986 template parameter list. */
32993 parser->implicit_template_parms
32995 }
32996 }
32998 /* Synthesize a new template parameter and track the current template
32999 parameter chain with implicit_template_parms. */
33003 synth_id);
33005 // Attach the constraint to the parm before processing.
33009 tree new_parm
33011 input_location,
33012 node,
33018 parser->implicit_template_parms
33020 else
33025 /* If creating a fully implicit function template, start the new implicit
33026 template parameter list with this synthesized type, otherwise grow the
33027 current template parameter list. */
33030 {
33037 }
33038 else
33039 {
33044 }
33049 }
33051 /* Finish the declaration of a fully implicit function template. Such a
33052 template has no explicit template parameter list so has not been through the
33053 normal template head and tail processing. synthesize_implicit_template_parm
33054 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33055 provided if the declaration is a class member such that its template
33056 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33057 form is returned. Otherwise NULL_TREE is returned. */
33059 tree
33061 {
33066 {
33070 }
33080 }