| blob | d4f8d13151359213abccc591e7d0c02cd43e2e14 |
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 }
916 {
918 }
920 /* Return true if the next token is not the indicated KEYWORD. */
924 {
926 }
928 /* Return true if the next token is a keyword for a decl-specifier. */
930 static bool
932 {
937 {
938 /* auto specifier: storage-class-specifier in C++,
939 simple-type-specifier in C++0x. */
941 /* Storage classes. */
947 /* Elaborated type specifiers. */
953 /* Simple type specifiers. */
968 /* GNU extensions. */
971 /* C++0x extensions. */
978 }
979 }
981 /* Returns TRUE iff the token T begins a decltype type. */
983 static bool
985 {
988 }
990 /* Returns TRUE iff the next token begins a decltype type. */
992 static bool
994 {
997 }
999 /* Return a pointer to the Nth token in the token stream. If N is 1,
1000 then this is precisely equivalent to cp_lexer_peek_token (except
1001 that it is not inline). One would like to disallow that case, but
1002 there is one case (cp_parser_nth_token_starts_template_id) where
1003 the caller passes a variable for N and it might be 1. */
1007 {
1010 /* N is 1-based, not zero-based. */
1021 {
1024 {
1027 }
1031 }
1034 {
1037 }
1040 }
1042 /* Return the next token, and advance the lexer's next_token pointer
1043 to point to the next non-purged token. */
1047 {
1053 do
1054 {
1057 {
1060 }
1062 }
1067 /* Provide debugging output. */
1069 {
1073 }
1076 }
1078 /* Permanently remove the next token from the token stream, and
1079 advance the next_token pointer to refer to the next non-purged
1080 token. */
1082 static void
1084 {
1093 do
1094 {
1095 tok++;
1097 {
1100 }
1101 }
1104 }
1106 /* Permanently remove all tokens after TOK, up to, but not
1107 including, the token that will be returned next by
1108 cp_lexer_peek_token. */
1110 static void
1112 {
1121 {
1126 }
1127 }
1129 /* Begin saving tokens. All tokens consumed after this point will be
1130 preserved. */
1132 static void
1134 {
1135 /* Provide debugging output. */
1140 }
1142 /* Commit to the portion of the token stream most recently saved. */
1144 static void
1146 {
1147 /* Provide debugging output. */
1152 }
1154 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1155 to the token stream. Stop saving tokens. */
1157 static void
1159 {
1160 /* Provide debugging output. */
1165 }
1167 /* Print a representation of the TOKEN on the STREAM. */
1169 static void
1171 {
1172 /* We don't use cpp_type2name here because the parser defines
1173 a few tokens of its own. */
1175 /* cpplib-defined token types */
1176 #define OP(e, s) #e,
1177 #define TK(e, s) #e,
1178 TTYPE_TABLE
1179 #undef OP
1180 #undef TK
1181 /* C++ parser token types - see "Manifest constants", above. */
1185 };
1187 /* For some tokens, print the associated data. */
1189 {
1191 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1192 For example, `struct' is mapped to an INTEGER_CST. */
1195 /* else fall through */
1213 /* If we have a name for the token, print it out. Otherwise, we
1214 simply give the numeric code. */
1217 else
1220 }
1221 }
1223 DEBUG_FUNCTION void
1225 {
1228 }
1230 DEBUG_FUNCTION void
1232 {
1235 else
1237 }
1240 /* Start emitting debugging information. */
1242 static void
1244 {
1247 }
1249 /* Stop emitting debugging information. */
1251 static void
1253 {
1256 }
1258 /* Create a new cp_token_cache, representing a range of tokens. */
1262 {
1267 }
1269 /* Diagnose if #pragma omp declare simd isn't followed immediately
1270 by function declaration or definition. */
1274 {
1276 {
1280 }
1281 }
1283 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1284 and put that into "omp declare simd" attribute. */
1288 {
1290 {
1292 {
1295 }
1297 {
1300 }
1301 }
1302 }
1303 \f
1304 /* Decl-specifiers. */
1306 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1308 static void
1310 {
1312 }
1314 /* Declarators. */
1316 /* Nothing other than the parser should be creating declarators;
1317 declarators are a semi-syntactic representation of C++ entities.
1318 Other parts of the front end that need to create entities (like
1319 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1334 /* An erroneous declarator. */
1337 /* The obstack on which declarators and related data structures are
1338 allocated. */
1341 /* Alloc BYTES from the declarator memory pool. */
1345 {
1347 }
1349 /* Allocate a declarator of the indicated KIND. Clear fields that are
1350 common to all declarators. */
1354 {
1366 }
1368 /* Make a declarator for a generalized identifier. If
1369 QUALIFYING_SCOPE is non-NULL, the identifier is
1370 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1371 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1372 is, if any. */
1376 special_function_kind sfk)
1377 {
1380 /* It is valid to write:
1382 class C { void f(); };
1383 typedef C D;
1384 void D::f();
1386 The standard is not clear about whether `typedef const C D' is
1387 legal; as of 2002-09-15 the committee is considering that
1388 question. EDG 3.0 allows that syntax. Therefore, we do as
1389 well. */
1403 }
1405 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1406 of modifiers such as const or volatile to apply to the pointer
1407 type, represented as identifiers. ATTRIBUTES represent the attributes that
1408 appertain to the pointer or reference. */
1410 cp_declarator *
1412 tree attributes)
1413 {
1421 {
1425 }
1426 else
1432 }
1434 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1435 represent the attributes that appertain to the pointer or
1436 reference. */
1438 cp_declarator *
1441 {
1449 {
1453 }
1454 else
1460 }
1462 /* Like make_pointer_declarator -- but for a pointer to a non-static
1463 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1464 appertain to the pointer or reference. */
1466 cp_declarator *
1469 tree attributes)
1470 {
1479 {
1482 }
1483 else
1489 }
1491 /* Make a declarator for the function given by TARGET, with the
1492 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1493 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1494 indicates what exceptions can be thrown. */
1496 cp_declarator *
1498 tree parms,
1499 cp_cv_quals cv_qualifiers,
1500 cp_virt_specifiers virt_specifiers,
1501 cp_ref_qualifier ref_qualifier,
1502 tree exception_specification,
1503 tree late_return_type)
1504 {
1516 {
1520 }
1521 else
1525 }
1527 /* Make a declarator for an array of BOUNDS elements, each of which is
1528 defined by ELEMENT. */
1530 cp_declarator *
1532 {
1539 {
1543 }
1544 else
1548 }
1550 /* Determine whether the declarator we've seen so far can be a
1551 parameter pack, when followed by an ellipsis. */
1552 static bool
1554 {
1555 /* Search for a declarator name, or any other declarator that goes
1556 after the point where the ellipsis could appear in a parameter
1557 pack. If we find any of these, then this declarator can not be
1558 made into a parameter pack. */
1561 {
1563 {
1575 }
1576 }
1579 }
1583 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1584 DECLARATOR and DEFAULT_ARGUMENT. */
1586 cp_parameter_declarator *
1589 tree default_argument)
1590 {
1598 else
1605 }
1607 /* Returns true iff DECLARATOR is a declaration for a function. */
1609 static bool
1611 {
1613 {
1621 }
1623 }
1625 /* The parser. */
1627 /* Overview
1628 --------
1630 A cp_parser parses the token stream as specified by the C++
1631 grammar. Its job is purely parsing, not semantic analysis. For
1632 example, the parser breaks the token stream into declarators,
1633 expressions, statements, and other similar syntactic constructs.
1634 It does not check that the types of the expressions on either side
1635 of an assignment-statement are compatible, or that a function is
1636 not declared with a parameter of type `void'.
1638 The parser invokes routines elsewhere in the compiler to perform
1639 semantic analysis and to build up the abstract syntax tree for the
1640 code processed.
1642 The parser (and the template instantiation code, which is, in a
1643 way, a close relative of parsing) are the only parts of the
1644 compiler that should be calling push_scope and pop_scope, or
1645 related functions. The parser (and template instantiation code)
1646 keeps track of what scope is presently active; everything else
1647 should simply honor that. (The code that generates static
1648 initializers may also need to set the scope, in order to check
1649 access control correctly when emitting the initializers.)
1651 Methodology
1652 -----------
1654 The parser is of the standard recursive-descent variety. Upcoming
1655 tokens in the token stream are examined in order to determine which
1656 production to use when parsing a non-terminal. Some C++ constructs
1657 require arbitrary look ahead to disambiguate. For example, it is
1658 impossible, in the general case, to tell whether a statement is an
1659 expression or declaration without scanning the entire statement.
1660 Therefore, the parser is capable of "parsing tentatively." When the
1661 parser is not sure what construct comes next, it enters this mode.
1662 Then, while we attempt to parse the construct, the parser queues up
1663 error messages, rather than issuing them immediately, and saves the
1664 tokens it consumes. If the construct is parsed successfully, the
1665 parser "commits", i.e., it issues any queued error messages and
1666 the tokens that were being preserved are permanently discarded.
1667 If, however, the construct is not parsed successfully, the parser
1668 rolls back its state completely so that it can resume parsing using
1669 a different alternative.
1671 Future Improvements
1672 -------------------
1674 The performance of the parser could probably be improved substantially.
1675 We could often eliminate the need to parse tentatively by looking ahead
1676 a little bit. In some places, this approach might not entirely eliminate
1677 the need to parse tentatively, but it might still speed up the average
1678 case. */
1680 /* Flags that are passed to some parsing functions. These values can
1681 be bitwise-ored together. */
1683 enum
1684 {
1685 /* No flags. */
1687 /* The construct is optional. If it is not present, then no error
1688 should be issued. */
1690 /* When parsing a type-specifier, treat user-defined type-names
1691 as non-type identifiers. */
1693 /* When parsing a type-specifier, do not try to parse a class-specifier
1694 or enum-specifier. */
1696 /* When parsing a decl-specifier-seq, only allow type-specifier or
1697 constexpr. */
1699 };
1701 /* This type is used for parameters and variables which hold
1702 combinations of the above flags. */
1705 /* The different kinds of declarators we want to parse. */
1708 {
1709 /* We want an abstract declarator. */
1710 CP_PARSER_DECLARATOR_ABSTRACT,
1711 /* We want a named declarator. */
1712 CP_PARSER_DECLARATOR_NAMED,
1713 /* We don't mind, but the name must be an unqualified-id. */
1714 CP_PARSER_DECLARATOR_EITHER
1717 /* The precedence values used to parse binary expressions. The minimum value
1718 of PREC must be 1, because zero is reserved to quickly discriminate
1719 binary operators from other tokens. */
1721 enum cp_parser_prec
1722 {
1723 PREC_NOT_OPERATOR,
1724 PREC_LOGICAL_OR_EXPRESSION,
1725 PREC_LOGICAL_AND_EXPRESSION,
1726 PREC_INCLUSIVE_OR_EXPRESSION,
1727 PREC_EXCLUSIVE_OR_EXPRESSION,
1728 PREC_AND_EXPRESSION,
1729 PREC_EQUALITY_EXPRESSION,
1730 PREC_RELATIONAL_EXPRESSION,
1731 PREC_SHIFT_EXPRESSION,
1732 PREC_ADDITIVE_EXPRESSION,
1733 PREC_MULTIPLICATIVE_EXPRESSION,
1734 PREC_PM_EXPRESSION,
1735 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1736 };
1738 /* A mapping from a token type to a corresponding tree node type, with a
1739 precedence value. */
1742 {
1743 /* The token type. */
1745 /* The corresponding tree code. */
1747 /* The precedence of this operator. */
1752 {
1753 /* Left hand side of the binary operation we are currently
1754 parsing. */
1755 tree lhs;
1756 /* Original tree code for left hand side, if it was a binary
1757 expression itself (used for -Wparentheses). */
1759 /* Tree code for the binary operation we are parsing. */
1761 /* Precedence of the binary operation we are parsing. */
1763 /* Location of the binary operation we are parsing. */
1764 location_t loc;
1767 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1768 entries because precedence levels on the stack are monotonically
1769 increasing. */
1773 /* Prototypes. */
1775 /* Constructors and destructors. */
1780 /* Class variables. */
1784 /* The operator-precedence table used by cp_parser_binary_expression.
1785 Transformed into an associative array (binops_by_token) by
1786 cp_parser_new. */
1819 };
1821 /* The same as binops, but initialized by cp_parser_new so that
1822 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1823 for speed. */
1826 /* Constructors and destructors. */
1828 /* Construct a new context. The context below this one on the stack
1829 is given by NEXT. */
1833 {
1836 /* Allocate the storage. */
1838 {
1839 /* Pull the first entry from the free list. */
1843 }
1844 else
1847 /* No errors have occurred yet in this context. */
1849 /* If this is not the bottommost context, copy information that we
1850 need from the previous context. */
1852 {
1853 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1854 expression, then we are parsing one in this context, too. */
1856 /* Thread the stack. */
1858 }
1861 }
1863 /* Managing the unparsed function queues. */
1865 #define unparsed_funs_with_default_args \
1866 parser->unparsed_queues->last ().funs_with_default_args
1867 #define unparsed_funs_with_definitions \
1868 parser->unparsed_queues->last ().funs_with_definitions
1869 #define unparsed_nsdmis \
1870 parser->unparsed_queues->last ().nsdmis
1871 #define unparsed_classes \
1872 parser->unparsed_queues->last ().classes
1874 static void
1876 {
1879 }
1881 static void
1883 {
1886 }
1888 /* Prototypes. */
1890 /* Constructors and destructors. */
1895 /* Routines to parse various constructs.
1897 Those that return `tree' will return the error_mark_node (rather
1898 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1899 Sometimes, they will return an ordinary node if error-recovery was
1900 attempted, even though a parse error occurred. So, to check
1901 whether or not a parse error occurred, you should always use
1902 cp_parser_error_occurred. If the construct is optional (indicated
1903 either by an `_opt' in the name of the function that does the
1904 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1905 the construct is not present. */
1907 /* Lexical conventions [gram.lex] */
1909 static tree cp_parser_identifier
1911 static tree cp_parser_string_literal
1913 static tree cp_parser_userdef_char_literal
1915 static tree cp_parser_userdef_string_literal
1917 static tree cp_parser_userdef_numeric_literal
1920 /* Basic concepts [gram.basic] */
1922 static bool cp_parser_translation_unit
1925 /* Expressions [gram.expr] */
1927 static tree cp_parser_primary_expression
1929 static tree cp_parser_id_expression
1931 static tree cp_parser_unqualified_id
1933 static tree cp_parser_nested_name_specifier_opt
1935 static tree cp_parser_nested_name_specifier
1937 static tree cp_parser_qualifying_entity
1939 static tree cp_parser_postfix_expression
1941 static tree cp_parser_postfix_open_square_expression
1943 static tree cp_parser_postfix_dot_deref_expression
1947 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1949 static void cp_parser_pseudo_destructor_name
1951 static tree cp_parser_unary_expression
1953 static enum tree_code cp_parser_unary_operator
1955 static tree cp_parser_new_expression
1959 static tree cp_parser_new_type_id
1967 static tree cp_parser_delete_expression
1969 static tree cp_parser_cast_expression
1971 static tree cp_parser_binary_expression
1973 static tree cp_parser_question_colon_clause
1975 static tree cp_parser_assignment_expression
1977 static enum tree_code cp_parser_assignment_operator_opt
1979 static tree cp_parser_expression
1981 static tree cp_parser_expression
1983 static tree cp_parser_constant_expression
1985 static tree cp_parser_builtin_offsetof
1987 static tree cp_parser_lambda_expression
1989 static void cp_parser_lambda_introducer
1991 static bool cp_parser_lambda_declarator_opt
1993 static void cp_parser_lambda_body
1996 /* Statements [gram.stmt.stmt] */
1998 static void cp_parser_statement
2000 static void cp_parser_label_for_labeled_statement
2002 static tree cp_parser_expression_statement
2004 static tree cp_parser_compound_statement
2006 static void cp_parser_statement_seq_opt
2008 static tree cp_parser_selection_statement
2010 static tree cp_parser_condition
2012 static tree cp_parser_iteration_statement
2014 static bool cp_parser_for_init_statement
2016 static tree cp_parser_for
2018 static tree cp_parser_c_for
2020 static tree cp_parser_range_for
2022 static void do_range_for_auto_deduction
2024 static tree cp_parser_perform_range_for_lookup
2026 static tree cp_parser_range_for_member_function
2028 static tree cp_parser_jump_statement
2030 static void cp_parser_declaration_statement
2033 static tree cp_parser_implicitly_scoped_statement
2035 static void cp_parser_already_scoped_statement
2038 /* Declarations [gram.dcl.dcl] */
2040 static void cp_parser_declaration_seq_opt
2042 static void cp_parser_declaration
2044 static void cp_parser_block_declaration
2046 static void cp_parser_simple_declaration
2048 static void cp_parser_decl_specifier_seq
2050 static tree cp_parser_storage_class_specifier_opt
2052 static tree cp_parser_function_specifier_opt
2054 static tree cp_parser_type_specifier
2057 static tree cp_parser_simple_type_specifier
2059 static tree cp_parser_type_name
2061 static tree cp_parser_nonclass_name
2063 static tree cp_parser_elaborated_type_specifier
2065 static tree cp_parser_enum_specifier
2067 static void cp_parser_enumerator_list
2069 static void cp_parser_enumerator_definition
2071 static tree cp_parser_namespace_name
2073 static void cp_parser_namespace_definition
2075 static void cp_parser_namespace_body
2077 static tree cp_parser_qualified_namespace_specifier
2079 static void cp_parser_namespace_alias_definition
2081 static bool cp_parser_using_declaration
2083 static void cp_parser_using_directive
2085 static tree cp_parser_alias_declaration
2087 static void cp_parser_asm_definition
2089 static void cp_parser_linkage_specification
2091 static void cp_parser_static_assert
2093 static tree cp_parser_decltype
2096 /* Declarators [gram.dcl.decl] */
2098 static tree cp_parser_init_declarator
2099 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2104 static enum tree_code cp_parser_ptr_operator
2106 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2108 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2110 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2112 static tree cp_parser_late_return_type_opt
2114 static tree cp_parser_declarator_id
2116 static tree cp_parser_type_id
2118 static tree cp_parser_template_type_arg
2121 static tree cp_parser_type_id_1
2123 static void cp_parser_type_specifier_seq
2125 static tree cp_parser_parameter_declaration_clause
2127 static tree cp_parser_parameter_declaration_list
2131 static tree cp_parser_default_argument
2133 static void cp_parser_function_body
2135 static tree cp_parser_initializer
2137 static tree cp_parser_initializer_clause
2139 static tree cp_parser_braced_list
2144 static bool cp_parser_ctor_initializer_opt_and_function_body
2147 static tree cp_parser_late_parsing_omp_declare_simd
2150 static tree cp_parser_late_parsing_cilk_simd_fn_info
2153 static tree synthesize_implicit_template_parm
2155 static tree finish_fully_implicit_template
2158 /* Classes [gram.class] */
2160 static tree cp_parser_class_name
2162 static tree cp_parser_class_specifier
2164 static tree cp_parser_class_head
2166 static enum tag_types cp_parser_class_key
2168 static void cp_parser_member_specification_opt
2170 static void cp_parser_member_declaration
2172 static tree cp_parser_pure_specifier
2174 static tree cp_parser_constant_initializer
2177 /* Derived classes [gram.class.derived] */
2179 static tree cp_parser_base_clause
2181 static tree cp_parser_base_specifier
2184 /* Special member functions [gram.special] */
2186 static tree cp_parser_conversion_function_id
2188 static tree cp_parser_conversion_type_id
2192 static bool cp_parser_ctor_initializer_opt
2194 static void cp_parser_mem_initializer_list
2196 static tree cp_parser_mem_initializer
2198 static tree cp_parser_mem_initializer_id
2201 /* Overloading [gram.over] */
2203 static tree cp_parser_operator_function_id
2205 static tree cp_parser_operator
2208 /* Templates [gram.temp] */
2210 static void cp_parser_template_declaration
2212 static tree cp_parser_template_parameter_list
2214 static tree cp_parser_template_parameter
2216 static tree cp_parser_type_parameter
2218 static tree cp_parser_template_id
2220 static tree cp_parser_template_name
2222 static tree cp_parser_template_argument_list
2224 static tree cp_parser_template_argument
2226 static void cp_parser_explicit_instantiation
2228 static void cp_parser_explicit_specialization
2231 /* Exception handling [gram.exception] */
2233 static tree cp_parser_try_block
2235 static bool cp_parser_function_try_block
2237 static void cp_parser_handler_seq
2239 static void cp_parser_handler
2241 static tree cp_parser_exception_declaration
2243 static tree cp_parser_throw_expression
2245 static tree cp_parser_exception_specification_opt
2247 static tree cp_parser_type_id_list
2250 /* GNU Extensions */
2252 static tree cp_parser_asm_specification_opt
2254 static tree cp_parser_asm_operand_list
2256 static tree cp_parser_asm_clobber_list
2258 static tree cp_parser_asm_label_list
2260 static bool cp_next_tokens_can_be_attribute_p
2262 static bool cp_next_tokens_can_be_gnu_attribute_p
2264 static bool cp_next_tokens_can_be_std_attribute_p
2266 static bool cp_nth_tokens_can_be_std_attribute_p
2268 static bool cp_nth_tokens_can_be_gnu_attribute_p
2270 static bool cp_nth_tokens_can_be_attribute_p
2272 static tree cp_parser_attributes_opt
2274 static tree cp_parser_gnu_attributes_opt
2276 static tree cp_parser_gnu_attribute_list
2278 static tree cp_parser_std_attribute
2280 static tree cp_parser_std_attribute_spec
2282 static tree cp_parser_std_attribute_spec_seq
2284 static bool cp_parser_extension_opt
2286 static void cp_parser_label_declaration
2289 /* Concept Extensions */
2291 static tree cp_parser_requires_clause
2293 static tree cp_parser_requires_clause_opt
2295 static tree cp_parser_requires_expression
2297 static tree cp_parser_requirement_parameter_list
2299 static tree cp_parser_requirement_body
2301 static tree cp_parser_requirement_list
2303 static tree cp_parser_requirement
2305 static tree cp_parser_simple_requirement
2307 static tree cp_parser_compound_requirement
2309 static tree cp_parser_type_requirement
2311 static tree cp_parser_nested_requirement
2313 static tree cp_parser_constexpr_constraint_spec
2315 static tree cp_parser_noexcept_constraint_spec
2317 static tree cp_parser_constraint_spec
2319 static tree cp_parser_constraint_specifier_seq
2322 /* Transactional Memory Extensions */
2324 static tree cp_parser_transaction
2326 static tree cp_parser_transaction_expression
2328 static bool cp_parser_function_transaction
2330 static tree cp_parser_transaction_cancel
2334 pragma_external,
2335 pragma_member,
2336 pragma_objc_icode,
2337 pragma_stmt,
2338 pragma_compound
2339 };
2340 static bool cp_parser_pragma
2343 /* Objective-C++ Productions */
2345 static tree cp_parser_objc_message_receiver
2347 static tree cp_parser_objc_message_args
2349 static tree cp_parser_objc_message_expression
2351 static tree cp_parser_objc_encode_expression
2353 static tree cp_parser_objc_defs_expression
2355 static tree cp_parser_objc_protocol_expression
2357 static tree cp_parser_objc_selector_expression
2359 static tree cp_parser_objc_expression
2361 static bool cp_parser_objc_selector_p
2363 static tree cp_parser_objc_selector
2365 static tree cp_parser_objc_protocol_refs_opt
2367 static void cp_parser_objc_declaration
2369 static tree cp_parser_objc_statement
2371 static bool cp_parser_objc_valid_prefix_attributes
2373 static void cp_parser_objc_at_property_declaration
2375 static void cp_parser_objc_at_synthesize_declaration
2377 static void cp_parser_objc_at_dynamic_declaration
2379 static tree cp_parser_objc_struct_declaration
2382 /* Utility Routines */
2384 static tree cp_parser_lookup_name
2386 static tree cp_parser_lookup_name_simple
2388 static tree cp_parser_maybe_treat_template_as_class
2390 static bool cp_parser_check_declarator_template_parameters
2392 static bool cp_parser_check_template_parameters
2394 static tree cp_parser_simple_cast_expression
2396 static tree cp_parser_global_scope_opt
2398 static bool cp_parser_constructor_declarator_p
2400 static tree cp_parser_function_definition_from_specifiers_and_declarator
2402 static tree cp_parser_function_definition_after_declarator
2404 static void cp_parser_template_declaration_after_export
2406 static void cp_parser_perform_template_parameter_access_checks
2408 static tree cp_parser_single_declaration
2410 static tree cp_parser_functional_cast
2412 static tree cp_parser_save_member_function_body
2414 static tree cp_parser_save_nsdmi
2416 static tree cp_parser_enclosed_template_argument_list
2418 static void cp_parser_save_default_args
2420 static void cp_parser_late_parsing_for_member
2422 static tree cp_parser_late_parse_one_default_arg
2424 static void cp_parser_late_parsing_nsdmi
2426 static void cp_parser_late_parsing_default_args
2428 static tree cp_parser_sizeof_operand
2430 static tree cp_parser_trait_expr
2432 static bool cp_parser_declares_only_class_p
2434 static void cp_parser_set_storage_class
2436 static void cp_parser_set_decl_spec_type
2438 static void set_and_check_decl_spec_loc
2441 static bool cp_parser_friend_p
2443 static void cp_parser_required_error
2449 static bool cp_parser_token_starts_function_definition_p
2451 static bool cp_parser_next_token_starts_class_definition_p
2453 static bool cp_parser_next_token_ends_template_argument_p
2455 static bool cp_parser_nth_token_starts_template_argument_list_p
2457 static enum tag_types cp_parser_token_is_class_key
2459 static void cp_parser_check_class_key
2461 static void cp_parser_check_access_in_redeclaration
2463 static bool cp_parser_optional_template_keyword
2465 static void cp_parser_pre_parsed_nested_name_specifier
2467 static bool cp_parser_cache_group
2469 static tree cp_parser_cache_defarg
2471 static void cp_parser_parse_tentatively
2473 static void cp_parser_commit_to_tentative_parse
2475 static void cp_parser_commit_to_topmost_tentative_parse
2477 static void cp_parser_abort_tentative_parse
2479 static bool cp_parser_parse_definitely
2483 static bool cp_parser_uncommitted_to_tentative_parse_p
2485 static void cp_parser_error
2487 static void cp_parser_name_lookup_error
2489 static bool cp_parser_simulate_error
2491 static bool cp_parser_check_type_definition
2493 static void cp_parser_check_for_definition_in_return_type
2495 static void cp_parser_check_for_invalid_template_id
2497 static bool cp_parser_non_integral_constant_expression
2499 static void cp_parser_diagnose_invalid_type_name
2501 static bool cp_parser_parse_and_diagnose_invalid_type_name
2503 static int cp_parser_skip_to_closing_parenthesis
2505 static void cp_parser_skip_to_end_of_statement
2507 static void cp_parser_consume_semicolon_at_end_of_statement
2509 static void cp_parser_skip_to_end_of_block_or_statement
2511 static bool cp_parser_skip_to_closing_brace
2513 static void cp_parser_skip_to_end_of_template_parameter_list
2515 static void cp_parser_skip_to_pragma_eol
2517 static bool cp_parser_error_occurred
2519 static bool cp_parser_allow_gnu_extensions_p
2521 static bool cp_parser_is_pure_string_literal
2523 static bool cp_parser_is_string_literal
2525 static bool cp_parser_is_keyword
2527 static tree cp_parser_make_typename_type
2531 static bool cp_parser_compound_literal_p
2534 /* Concept-related syntactic transformations */
2539 // -------------------------------------------------------------------------- //
2540 // Unevaluated Operand Guard
2541 //
2542 // Implementation of an RAII helper for unevaluated operand parsing.
2544 {
2547 }
2550 {
2553 }
2555 // -------------------------------------------------------------------------- //
2556 // Tentative Parsing
2558 /* Returns nonzero if we are parsing tentatively. */
2562 {
2564 }
2566 /* Returns nonzero if TOKEN is a string literal. */
2568 static bool
2570 {
2576 }
2578 /* Returns nonzero if TOKEN is a string literal
2579 of a user-defined string literal. */
2581 static bool
2583 {
2590 }
2592 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2594 static bool
2596 {
2598 }
2600 /* If not parsing tentatively, issue a diagnostic of the form
2601 FILE:LINE: MESSAGE before TOKEN
2602 where TOKEN is the next token in the input stream. MESSAGE
2603 (specified by the caller) is usually of the form "expected
2604 OTHER-TOKEN". */
2606 static void
2608 {
2610 {
2612 /* This diagnostic makes more sense if it is tagged to the line
2613 of the token we just peeked at. */
2617 {
2622 }
2625 /* Because c_parser_error does not understand
2626 CPP_KEYWORD, keywords are treated like
2627 identifiers. */
2630 }
2631 }
2633 /* Issue an error about name-lookup failing. NAME is the
2634 IDENTIFIER_NODE DECL is the result of
2635 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2636 the thing that we hoped to find. */
2638 static void
2640 tree name,
2641 tree decl,
2642 name_lookup_error desired,
2643 location_t location)
2644 {
2645 /* If name lookup completely failed, tell the user that NAME was not
2646 declared. */
2648 {
2661 else
2663 }
2665 {
2667 {
2684 }
2685 }
2687 {
2689 {
2699 name);
2703 }
2704 }
2705 else
2706 {
2708 {
2721 }
2722 }
2723 }
2725 /* If we are parsing tentatively, remember that an error has occurred
2726 during this tentative parse. Returns true if the error was
2727 simulated; false if a message should be issued by the caller. */
2729 static bool
2731 {
2733 {
2736 }
2738 }
2740 /* This function is called when a type is defined. If type
2741 definitions are forbidden at this point, an error message is
2742 issued. */
2744 static bool
2746 {
2747 /* If types are forbidden here, issue a message. */
2749 {
2750 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2751 in the message need to be interpreted. */
2754 }
2756 }
2758 /* This function is called when the DECLARATOR is processed. The TYPE
2759 was a type defined in the decl-specifiers. If it is invalid to
2760 define a type in the decl-specifiers for DECLARATOR, an error is
2761 issued. TYPE_LOCATION is the location of TYPE and is used
2762 for error reporting. */
2764 static void
2767 {
2768 /* [dcl.fct] forbids type definitions in return types.
2769 Unfortunately, it's not easy to know whether or not we are
2770 processing a return type until after the fact. */
2778 {
2783 type);
2784 }
2785 }
2787 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2788 "<" in any valid C++ program. If the next token is indeed "<",
2789 issue a message warning the user about what appears to be an
2790 invalid attempt to form a template-id. LOCATION is the location
2791 of the type-specifier (TYPE) */
2793 static void
2795 tree type,
2797 location_t location)
2798 {
2802 {
2806 {
2809 else
2811 }
2812 else
2814 /* Remember the location of the invalid "<". */
2817 /* Consume the "<". */
2819 /* Parse the template arguments. */
2821 /* Permanently remove the invalid template arguments so that
2822 this error message is not issued again. */
2825 }
2826 }
2828 /* If parsing an integral constant-expression, issue an error message
2829 about the fact that THING appeared and return true. Otherwise,
2830 return false. In either case, set
2831 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2833 static bool
2835 non_integral_constant thing)
2836 {
2839 {
2841 {
2844 {
2851 "enumeration type cannot appear in a "
2942 }
2946 }
2947 }
2949 }
2951 /* Emit a diagnostic for an invalid type name. SCOPE is the
2952 qualifying scope (or NULL, if none) for ID. This function commits
2953 to the current active tentative parse, if any. (Otherwise, the
2954 problematic construct might be encountered again later, resulting
2955 in duplicate error messages.) LOCATION is the location of ID. */
2957 static void
2960 location_t location)
2961 {
2964 /* Try to lookup the identifier. */
2974 /* If the lookup was ambiguous, an error will already have
2975 been issued. */
2977 /* If the lookup found a template-name, it means that the user forgot
2978 to specify an argument list. Emit a useful error message. */
2982 decl);
2986 /* Something like 'unsigned A a;' */
2989 {
2990 /* Issue an error message. */
2992 /* If we're in a template class, it's possible that the user was
2993 referring to a type from a base class. For example:
2995 template <typename T> struct A { typedef T X; };
2996 template <typename T> struct B : public A<T> { X x; };
2998 The user should have said "typename A<T>::X". */
3011 {
3012 tree b;
3015 b;
3017 {
3021 {
3022 tree field;
3023 /* Go from a particular instantiation of the
3024 template (which will have an empty TYPE_FIELDs),
3025 to the main version. */
3028 field;
3032 {
3037 }
3040 }
3041 }
3042 }
3043 }
3044 /* Here we diagnose qualified-ids where the scope is actually correct,
3045 but the identifier does not resolve to a valid type name. */
3047 {
3049 {
3054 else
3058 }
3061 {
3062 /* A<T>::A<T>() */
3068 }
3075 {
3080 else
3084 }
3085 else
3087 }
3088 }
3090 /* Check for a common situation where a type-name should be present,
3091 but is not, and issue a sensible error message. Returns true if an
3092 invalid type-name was detected.
3094 The situation handled by this function are variable declarations of the
3095 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3096 Usually, `ID' should name a type, but if we got here it means that it
3097 does not. We try to emit the best possible error message depending on
3098 how exactly the id-expression looks like. */
3100 static bool
3102 {
3103 tree id;
3106 /* Avoid duplicate error about ambiguous lookup. */
3108 {
3112 }
3121 /* If the next token is a (, this is a function with no explicit return
3122 type, i.e. constructor, destructor or conversion op. */
3125 {
3128 }
3132 /* Emit a diagnostic for the invalid type. */
3135 out:
3136 /* If we aren't in the middle of a declarator (i.e. in a
3137 parameter-declaration-clause), skip to the end of the declaration;
3138 there's no point in trying to process it. */
3142 }
3144 /* Consume tokens up to, and including, the next non-nested closing `)'.
3145 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3146 are doing error recovery. Returns -1 if OR_COMMA is true and we
3147 found an unnested comma. */
3149 static int
3154 {
3164 {
3168 {
3171 /* If we've run out of tokens, then there is no closing `)'. */
3174 /* This is good for lambda expression capture-lists. */
3184 /* This matches the processing in skip_to_end_of_statement. */
3210 {
3214 }
3219 }
3221 /* Consume the token. */
3223 }
3224 }
3226 /* Consume tokens until we reach the end of the current statement.
3227 Normally, that will be just before consuming a `;'. However, if a
3228 non-nested `}' comes first, then we stop before consuming that. */
3230 static void
3232 {
3235 /* Unwind generic function template scope if necessary. */
3240 {
3244 {
3247 /* If we've run out of tokens, stop. */
3251 /* If the next token is a `;', we have reached the end of the
3252 statement. */
3258 /* If this is a non-nested '}', stop before consuming it.
3259 That way, when confronted with something like:
3261 { 3 + }
3263 we stop before consuming the closing '}', even though we
3264 have not yet reached a `;'. */
3268 /* If it is the closing '}' for a block that we have
3269 scanned, stop -- but only after consuming the token.
3270 That way given:
3272 void f g () { ... }
3273 typedef int I;
3275 we will stop after the body of the erroneously declared
3276 function, but before consuming the following `typedef'
3277 declaration. */
3279 {
3282 }
3290 }
3292 /* Consume the token. */
3294 }
3295 }
3297 /* This function is called at the end of a statement or declaration.
3298 If the next token is a semicolon, it is consumed; otherwise, error
3299 recovery is attempted. */
3301 static void
3303 {
3304 /* Look for the trailing `;'. */
3306 {
3307 /* If there is additional (erroneous) input, skip to the end of
3308 the statement. */
3310 /* If the next token is now a `;', consume it. */
3313 }
3314 }
3316 /* Skip tokens until we have consumed an entire block, or until we
3317 have consumed a non-nested `;'. */
3319 static void
3321 {
3324 /* Unwind generic function template scope if necessary. */
3329 {
3333 {
3336 /* If we've run out of tokens, stop. */
3340 /* Stop if this is an unnested ';'. */
3346 /* Stop if this is an unnested '}', or closes the outermost
3347 nesting level. */
3348 nesting_depth--;
3356 /* Nest. */
3357 nesting_depth++;
3362 }
3364 /* Consume the token. */
3366 }
3367 }
3369 /* Skip tokens until a non-nested closing curly brace is the next
3370 token, or there are no more tokens. Return true in the first case,
3371 false otherwise. */
3373 static bool
3375 {
3379 {
3383 {
3386 /* If we've run out of tokens, stop. */
3390 /* If the next token is a non-nested `}', then we have reached
3391 the end of the current block. */
3397 /* If it the next token is a `{', then we are entering a new
3398 block. Consume the entire block. */
3404 }
3406 /* Consume the token. */
3408 }
3409 }
3411 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3412 parameter is the PRAGMA token, allowing us to purge the entire pragma
3413 sequence. */
3415 static void
3417 {
3422 do
3426 /* Ensure that the pragma is not parsed again. */
3428 }
3430 /* Require pragma end of line, resyncing with it as necessary. The
3431 arguments are as for cp_parser_skip_to_pragma_eol. */
3433 static void
3435 {
3439 }
3441 /* This is a simple wrapper around make_typename_type. When the id is
3442 an unresolved identifier node, we can provide a superior diagnostic
3443 using cp_parser_diagnose_invalid_type_name. */
3445 static tree
3448 {
3449 tree result;
3451 {
3457 }
3459 }
3461 /* This is a wrapper around the
3462 make_{pointer,ptrmem,reference}_declarator functions that decides
3463 which one to call based on the CODE and CLASS_TYPE arguments. The
3464 CODE argument should be one of the values returned by
3465 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3466 appertain to the pointer or reference. */
3470 cp_cv_quals cv_qualifiers,
3472 tree attributes)
3473 {
3480 else
3490 }
3492 /* Create a new C++ parser. */
3496 {
3501 /* cp_lexer_new_main is called before doing GC allocation because
3502 cp_lexer_new_main might load a PCH file. */
3505 /* Initialize the binops_by_token so that we can get the tree
3506 directly from the token. */
3514 /* For now, we always accept GNU extensions. */
3517 /* The `>' token is a greater-than operator, not the end of a
3518 template-id. */
3523 /* We are not parsing a constant-expression. */
3528 /* Local variable names are not forbidden. */
3531 /* We are not processing an `extern "C"' declaration. */
3534 /* We are not processing a declarator. */
3537 /* We are not processing a template-argument-list. */
3540 /* We are not in an iteration statement. */
3543 /* We are not in a switch statement. */
3546 /* We are not parsing a type-id inside an expression. */
3549 /* Declarations aren't implicitly extern "C". */
3552 /* String literals should be translated to the execution character set. */
3555 /* We are not parsing a function body. */
3558 /* We can correct until told otherwise. */
3561 /* The unparsed function queue is empty. */
3564 /* There are no classes being defined. */
3567 /* No template parameters apply. */
3570 /* Not declaring an implicit function template. */
3577 }
3579 /* Create a cp_lexer structure which will emit the tokens in CACHE
3580 and push it onto the parser's lexer stack. This is used for delayed
3581 parsing of in-class method bodies and default arguments, and should
3582 not be confused with tentative parsing. */
3583 static void
3585 {
3590 /* Move the current source position to that of the first token in the
3591 new lexer. */
3593 }
3595 /* Pop the top lexer off the parser stack. This is never used for the
3596 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3597 static void
3599 {
3604 /* Put the current source position back where it was before this
3605 lexer was pushed. */
3607 }
3609 /* Lexical conventions [gram.lex] */
3611 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3612 identifier. */
3614 static tree
3616 {
3619 /* Look for the identifier. */
3621 /* Return the value. */
3623 }
3625 /* Parse a sequence of adjacent string constants. Returns a
3626 TREE_STRING representing the combined, nul-terminated string
3627 constant. If TRANSLATE is true, translate the string to the
3628 execution character set. If WIDE_OK is true, a wide string is
3629 invalid here.
3631 C++98 [lex.string] says that if a narrow string literal token is
3632 adjacent to a wide string literal token, the behavior is undefined.
3633 However, C99 6.4.5p4 says that this results in a wide string literal.
3634 We follow C99 here, for consistency with the C front end.
3636 This code is largely lifted from lex_string() in c-lex.c.
3638 FUTURE: ObjC++ will need to handle @-strings here. */
3639 static tree
3641 {
3642 tree value;
3649 tree string_tree;
3655 {
3658 }
3661 {
3665 }
3666 else
3667 {
3670 }
3673 /* Try to avoid the overhead of creating and destroying an obstack
3674 for the common case of just one string. */
3677 {
3685 {
3689 }
3690 else
3694 }
3695 else
3696 {
3700 do
3701 {
3703 count++;
3708 {
3711 {
3714 }
3717 {
3722 }
3724 }
3725 else
3729 {
3734 "unsupported non-standard concatenation "
3736 }
3742 {
3746 }
3747 else
3748 {
3752 }
3753 }
3757 }
3760 {
3763 }
3767 {
3772 {
3787 }
3792 {
3797 }
3798 }
3799 else
3800 /* cpp_interpret_string has issued an error. */
3807 }
3809 /* Look up a literal operator with the name and the exact arguments. */
3811 static tree
3813 {
3820 {
3826 {
3829 {
3839 }
3842 /* May be this should be sufficient_parms_p instead,
3843 depending on how exactly should user-defined literals
3844 work in presence of default arguments on the literal
3845 operator parameters. */
3848 }
3849 }
3852 }
3854 /* Parse a user-defined char constant. Returns a call to a user-defined
3855 literal operator taking the character as an argument. */
3857 static tree
3859 {
3867 /* Build up a call to the user-defined operator */
3868 /* Lookup the name we got back from the id-expression. */
3873 {
3878 }
3887 }
3889 /* A subroutine of cp_parser_userdef_numeric_literal to
3890 create a char... template parameter pack from a string node. */
3892 static tree
3894 {
3895 tree charvec;
3901 /* Fill in CHARVEC with all of the parameters. */
3906 /* Build the argument packs. */
3913 }
3915 /* A subroutine of cp_parser_userdef_numeric_literal to
3916 create a char... template parameter pack from a string node. */
3918 static tree
3920 {
3921 tree charvec;
3932 /* First template parm is character type. */
3935 /* Fill in CHARVEC with all of the parameters. */
3942 /* Build the argument packs. */
3949 }
3951 /* Parse a user-defined numeric constant. returns a call to a user-defined
3952 literal operator. */
3954 static tree
3956 {
3967 /* Look for a literal operator taking the exact type of numeric argument
3968 as the literal value. */
3973 {
3976 {
3980 long_long_unsigned_type_node);
3981 else
3982 {
3986 long_double_type_node);
3990 }
3993 }
3994 }
3997 /* If the numeric argument didn't work, look for a raw literal
3998 operator taking a const char* argument consisting of the number
3999 in string format. */
4004 {
4007 {
4010 }
4011 }
4014 /* If the raw literal didn't work, look for a non-type template
4015 function with parameter pack char.... Call the function with
4016 template parameter characters representing the number. */
4020 {
4025 {
4028 }
4029 }
4037 }
4039 /* Parse a user-defined string constant. Returns a call to a user-defined
4040 literal operator taking a character pointer and the length of the string
4041 as arguments. */
4043 static tree
4045 {
4055 /* Look for a template function with typename parameter CharT
4056 and parameter pack CharT... Call the function with
4057 template parameter characters representing the string. */
4061 {
4066 {
4069 }
4070 }
4073 /* Build up a call to the user-defined operator */
4074 /* Lookup the name we got back from the id-expression. */
4080 {
4084 }
4093 }
4096 /* Basic concepts [gram.basic] */
4098 /* Parse a translation-unit.
4100 translation-unit:
4101 declaration-seq [opt]
4103 Returns TRUE if all went well. */
4105 static bool
4107 {
4108 /* The address of the first non-permanent object on the declarator
4109 obstack. */
4114 /* Create the declarator obstack, if necessary. */
4116 {
4118 /* Create the error declarator. */
4120 /* Create the empty parameter list. */
4122 /* Remember where the base of the declarator obstack lies. */
4124 }
4128 /* If there are no tokens left then all went well. */
4130 {
4131 /* Get rid of the token array; we don't need it any more. */
4135 /* This file might have been a context that's implicitly extern
4136 "C". If so, pop the lang context. (Only relevant for PCH.) */
4138 {
4141 }
4143 /* Finish up. */
4147 }
4148 else
4149 {
4152 }
4154 /* Make sure the declarator obstack was fully cleaned up. */
4158 /* All went well. */
4160 }
4162 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4163 decltype context. */
4167 {
4172 }
4174 /* Expressions [gram.expr] */
4176 /* Parse a primary-expression.
4178 primary-expression:
4179 literal
4180 this
4181 ( expression )
4182 id-expression
4184 GNU Extensions:
4186 primary-expression:
4187 ( compound-statement )
4188 __builtin_va_arg ( assignment-expression , type-id )
4189 __builtin_offsetof ( type-id , offsetof-expression )
4191 C++ Extensions:
4192 __has_nothrow_assign ( type-id )
4193 __has_nothrow_constructor ( type-id )
4194 __has_nothrow_copy ( type-id )
4195 __has_trivial_assign ( type-id )
4196 __has_trivial_constructor ( type-id )
4197 __has_trivial_copy ( type-id )
4198 __has_trivial_destructor ( type-id )
4199 __has_virtual_destructor ( type-id )
4200 __is_abstract ( type-id )
4201 __is_base_of ( type-id , type-id )
4202 __is_class ( type-id )
4203 __is_convertible_to ( type-id , type-id )
4204 __is_empty ( type-id )
4205 __is_enum ( type-id )
4206 __is_final ( type-id )
4207 __is_literal_type ( type-id )
4208 __is_pod ( type-id )
4209 __is_polymorphic ( type-id )
4210 __is_std_layout ( type-id )
4211 __is_trivial ( type-id )
4212 __is_union ( type-id )
4214 Objective-C++ Extension:
4216 primary-expression:
4217 objc-expression
4219 literal:
4220 __null
4222 ADDRESS_P is true iff this expression was immediately preceded by
4223 "&" and therefore might denote a pointer-to-member. CAST_P is true
4224 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4225 true iff this expression is a template argument.
4227 Returns a representation of the expression. Upon return, *IDK
4228 indicates what kind of id-expression (if any) was present. */
4230 static tree
4237 {
4240 /* Assume the primary expression is not an id-expression. */
4243 /* Peek at the next token. */
4246 {
4247 /* literal:
4248 integer-literal
4249 character-literal
4250 floating-literal
4251 string-literal
4252 boolean-literal
4253 pointer-literal
4254 user-defined-literal */
4264 {
4268 }
4269 /* Floating-point literals are only allowed in an integral
4270 constant expression if they are cast to an integral or
4271 enumeration type. */
4275 {
4276 /* CAST_P will be set even in invalid code like "int(2.7 +
4277 ...)". Therefore, we have to check that the next token
4278 is sure to end the cast. */
4280 {
4285 enumerator-definition. */
4287 /* The curly brace at the end of an enum-specifier. */
4289 /* The end of a statement. */
4291 /* The end of the cast-expression. */
4293 /* The end of an array bound. */
4295 /* The closing ">" in a template-argument-list. */
4298 /* C++0x only: A ">>" treated like two ">" tokens,
4299 in a template-argument-list. */
4304 }
4306 /* If we are within a cast, then the constraint that the
4307 cast is to an integral or enumeration type will be
4308 checked at that point. If we are not within a cast, then
4309 this code is invalid. */
4312 }
4331 /* ??? Should wide strings be allowed when parser->translate_strings_p
4332 is false (i.e. in attributes)? If not, we can kill the third
4333 argument to cp_parser_string_literal. */
4339 {
4340 tree expr;
4343 /* Consume the `('. */
4345 /* Within a parenthesized expression, a `>' token is always
4346 the greater-than operator. */
4347 saved_greater_than_is_operator_p
4350 /* If we see `( { ' then we are looking at the beginning of
4351 a GNU statement-expression. */
4354 {
4355 /* Statement-expressions are not allowed by the standard. */
4359 /* And they're not allowed outside of a function-body; you
4360 cannot, for example, write:
4362 int i = ({ int j = 3; j + 1; });
4364 at class or namespace scope. */
4367 {
4369 "statement-expressions are not allowed outside "
4373 }
4374 else
4375 {
4376 /* Start the statement-expression. */
4378 /* Parse the compound-statement. */
4380 /* Finish up. */
4382 }
4383 }
4384 else
4385 {
4386 /* Parse the parenthesized expression. */
4388 /* Let the front end know that this expression was
4389 enclosed in parentheses. This matters in case, for
4390 example, the expression is of the form `A::B', since
4391 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4392 not. */
4394 /* DR 705: Wrapping an unqualified name in parentheses
4395 suppresses arg-dependent lookup. We want to pass back
4396 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4397 (c++/37862), but none of the others. */
4400 }
4401 /* The `>' token might be the end of a template-id or
4402 template-parameter-list now. */
4403 parser->greater_than_is_operator_p
4405 /* Consume the `)'. */
4410 }
4414 /* We have an Objective-C++ message. */
4416 {
4418 /* Don't warn about a failed tentative parse. */
4423 }
4427 /* We have an Objective-C++ string literal. */
4434 {
4435 /* These two are the boolean literals. */
4443 /* The `__null' literal. */
4448 /* The `nullptr' literal. */
4453 /* Recognize the `this' keyword. */
4457 {
4461 }
4462 /* Pointers cannot appear in constant-expressions. */
4467 /* The `operator' keyword can be the beginning of an
4468 id-expression. */
4475 {
4476 non_integral_constant name;
4478 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4479 __func__ are the names of variables -- but they are
4480 treated specially. Therefore, they are handled here,
4481 rather than relying on the generic id-expression logic
4482 below. Grammatically, these names are id-expressions.
4484 Consume the token. */
4488 {
4500 }
4505 /* Look up the name. */
4507 }
4510 {
4511 tree expression;
4512 tree type;
4513 source_location type_location;
4515 /* The `__builtin_va_arg' construct is used to handle
4516 `va_arg'. Consume the `__builtin_va_arg' token. */
4518 /* Look for the opening `('. */
4520 /* Now, parse the assignment-expression. */
4523 /* Look for the `,'. */
4526 /* Parse the type-id. */
4528 /* Look for the closing `)'. */
4530 /* Using `va_arg' in a constant-expression is not
4531 allowed. */
4533 NIC_VA_ARG))
4536 }
4565 // C++ concepts
4569 /* Objective-C++ expressions. */
4579 {
4584 }
4588 }
4590 /* An id-expression can start with either an identifier, a
4591 `::' as the beginning of a qualified-id, or the "operator"
4592 keyword. */
4597 {
4598 tree id_expression;
4599 tree decl;
4605 id_expression:
4606 /* Parse the id-expression. */
4607 id_expression
4624 /* If we have a template-id, then no further lookup is
4625 required. If the template-id was for a template-class, we
4626 will sometimes have a TYPE_DECL at this point. */
4630 /* Look up the name. */
4631 else
4632 {
4633 tree ambiguous_decls;
4635 /* If we already know that this lookup is ambiguous, then
4636 we've already issued an error message; there's no reason
4637 to check again. */
4640 {
4643 }
4646 none_type,
4647 template_p,
4652 /* If the lookup was ambiguous, an error will already have
4653 been issued. */
4657 /* In Objective-C++, we may have an Objective-C 2.0
4658 dot-syntax for classes here. */
4663 {
4664 tree component;
4671 }
4673 /* In Objective-C++, an instance variable (ivar) may be preferred
4674 to whatever cp_parser_lookup_name() found. */
4677 /* If name lookup gives us a SCOPE_REF, then the
4678 qualifying scope was dependent. */
4680 {
4681 /* At this point, we do not know if DECL is a valid
4682 integral constant expression. We assume that it is
4683 in fact such an expression, so that code like:
4685 template <int N> struct A {
4686 int a[B<N>::i];
4687 };
4689 is accepted. At template-instantiation time, we
4690 will check that B<N>::i is actually a constant. */
4692 }
4693 /* Check to see if DECL is a local variable in a context
4694 where that is forbidden. */
4697 {
4698 /* It might be that we only found DECL because we are
4699 trying to be generous with pre-ISO scoping rules.
4700 For example, consider:
4702 int i;
4703 void g() {
4704 for (int i = 0; i < 10; ++i) {}
4705 extern void f(int j = i);
4706 }
4708 Here, name look up will originally find the out
4709 of scope `i'. We need to issue a warning message,
4710 but then use the global `i'. */
4713 {
4716 decl);
4718 }
4719 }
4720 }
4722 decl = (finish_id_expression
4724 idk,
4729 template_arg_p,
4735 }
4737 /* Anything else is an error. */
4741 }
4742 }
4750 {
4753 }
4755 /* Parse an id-expression.
4757 id-expression:
4758 unqualified-id
4759 qualified-id
4761 qualified-id:
4762 :: [opt] nested-name-specifier template [opt] unqualified-id
4763 :: identifier
4764 :: operator-function-id
4765 :: template-id
4767 Return a representation of the unqualified portion of the
4768 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4769 a `::' or nested-name-specifier.
4771 Often, if the id-expression was a qualified-id, the caller will
4772 want to make a SCOPE_REF to represent the qualified-id. This
4773 function does not do this in order to avoid wastefully creating
4774 SCOPE_REFs when they are not required.
4776 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4777 `template' keyword.
4779 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4780 uninstantiated templates.
4782 If *TEMPLATE_P is non-NULL, it is set to true iff the
4783 `template' keyword is used to explicitly indicate that the entity
4784 named is a template.
4786 If DECLARATOR_P is true, the id-expression is appearing as part of
4787 a declarator, rather than as part of an expression. */
4789 static tree
4796 {
4800 /* Assume the `template' keyword was not used. */
4804 /* Look for the optional `::' operator. */
4805 global_scope_p
4808 /* Look for the optional nested-name-specifier. */
4809 nested_name_specifier_p
4812 check_dependency_p,
4814 declarator_p)
4816 /* If there is a nested-name-specifier, then we are looking at
4817 the first qualified-id production. */
4819 {
4820 tree saved_scope;
4821 tree saved_object_scope;
4822 tree saved_qualifying_scope;
4823 tree unqualified_id;
4826 /* See if the next token is the `template' keyword. */
4830 /* Name lookup we do during the processing of the
4831 unqualified-id might obliterate SCOPE. */
4835 /* Process the final unqualified-id. */
4837 check_dependency_p,
4838 declarator_p,
4840 /* Restore the SAVED_SCOPE for our caller. */
4846 }
4847 /* Otherwise, if we are in global scope, then we are looking at one
4848 of the other qualified-id productions. */
4850 {
4852 tree id;
4854 /* Peek at the next token. */
4857 /* If it's an identifier, and the next token is not a "<", then
4858 we can avoid the template-id case. This is an optimization
4859 for this common case. */
4861 && !cp_parser_nth_token_starts_template_argument_list_p
4866 /* Try a template-id. */
4870 none_type,
4871 declarator_p);
4872 /* If that worked, we're done. */
4876 /* Peek at the next token. (Changes in the token buffer may
4877 have invalidated the pointer obtained above.) */
4881 {
4888 /* Fall through. */
4893 }
4894 }
4895 else
4898 declarator_p,
4899 optional_p);
4900 }
4902 /* Parse an unqualified-id.
4904 unqualified-id:
4905 identifier
4906 operator-function-id
4907 conversion-function-id
4908 ~ class-name
4909 template-id
4911 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4912 keyword, in a construct like `A::template ...'.
4914 Returns a representation of unqualified-id. For the `identifier'
4915 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4916 production a BIT_NOT_EXPR is returned; the operand of the
4917 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4918 other productions, see the documentation accompanying the
4919 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4920 names are looked up in uninstantiated templates. If DECLARATOR_P
4921 is true, the unqualified-id is appearing as part of a declarator,
4922 rather than as part of an expression. */
4924 static tree
4930 {
4933 /* Peek at the next token. */
4937 {
4939 {
4940 tree id;
4942 /* We don't know yet whether or not this will be a
4943 template-id. */
4945 /* Try a template-id. */
4947 check_dependency_p,
4948 none_type,
4949 declarator_p);
4950 /* If it worked, we're done. */
4953 /* Otherwise, it's an ordinary identifier. */
4955 }
4959 check_dependency_p,
4960 none_type,
4961 declarator_p);
4964 {
4965 tree type_decl;
4966 tree qualifying_scope;
4967 tree object_scope;
4968 tree scope;
4971 /* Consume the `~' token. */
4973 /* Parse the class-name. The standard, as written, seems to
4974 say that:
4976 template <typename T> struct S { ~S (); };
4977 template <typename T> S<T>::~S() {}
4979 is invalid, since `~' must be followed by a class-name, but
4980 `S<T>' is dependent, and so not known to be a class.
4981 That's not right; we need to look in uninstantiated
4982 templates. A further complication arises from:
4984 template <typename T> void f(T t) {
4985 t.T::~T();
4986 }
4988 Here, it is not possible to look up `T' in the scope of `T'
4989 itself. We must look in both the current scope, and the
4990 scope of the containing complete expression.
4992 Yet another issue is:
4994 struct S {
4995 int S;
4996 ~S();
4997 };
4999 S::~S() {}
5001 The standard does not seem to say that the `S' in `~S'
5002 should refer to the type `S' and not the data member
5003 `S::S'. */
5005 /* DR 244 says that we look up the name after the "~" in the
5006 same scope as we looked up the qualifying name. That idea
5007 isn't fully worked out; it's more complicated than that. */
5012 /* Check for invalid scopes. */
5014 {
5018 }
5020 {
5024 scope);
5029 }
5032 /* If the name is of the form "X::~X" it's OK even if X is a
5033 typedef. */
5042 {
5045 }
5047 /* ~auto means the destructor of whatever the object is. */
5049 {
5052 "%<~auto%> only available with "
5056 }
5058 /* If there was an explicit qualification (S::~T), first look
5059 in the scope given by the qualification (i.e., S).
5061 Note: in the calls to cp_parser_class_name below we pass
5062 typename_type so that lookup finds the injected-class-name
5063 rather than the constructor. */
5067 {
5072 typename_type,
5075 declarator_p);
5078 }
5079 /* In "N::S::~S", look in "N" as well. */
5081 {
5086 type_decl
5090 typename_type,
5093 declarator_p);
5096 }
5097 /* In "p->S::~T", look in the scope given by "*p" as well. */
5099 {
5104 type_decl
5108 typename_type,
5111 declarator_p);
5114 }
5115 /* Look in the surrounding context. */
5117 {
5123 type_decl
5127 typename_type,
5130 declarator_p);
5133 {
5134 /* We couldn't find a type with this name, so just accept
5135 it and check for a match at instantiation time. */
5140 }
5141 }
5142 /* If an error occurred, assume that the name of the
5143 destructor is the same as the name of the qualifying
5144 class. That allows us to keep parsing after running
5145 into ill-formed destructor names. */
5151 /* Check that destructor name and scope match. */
5153 {
5160 }
5162 /* [class.dtor]
5164 A typedef-name that names a class shall not be used as the
5165 identifier in the declarator for a destructor declaration. */
5172 type_decl);
5175 }
5179 {
5180 tree id;
5182 /* This could be a template-id, so we try that first. */
5184 /* Try a template-id. */
5187 none_type,
5188 declarator_p);
5189 /* If that worked, we're done. */
5192 /* We still don't know whether we're looking at an
5193 operator-function-id or a conversion-function-id. */
5195 /* Try an operator-function-id. */
5197 /* If that didn't work, try a conversion-function-id. */
5201 {
5202 /* 17.6.3.3.5 */
5208 }
5211 }
5212 /* Fall through. */
5219 }
5220 }
5222 /* Parse an (optional) nested-name-specifier.
5224 nested-name-specifier: [C++98]
5225 class-or-namespace-name :: nested-name-specifier [opt]
5226 class-or-namespace-name :: template nested-name-specifier [opt]
5228 nested-name-specifier: [C++0x]
5229 type-name ::
5230 namespace-name ::
5231 nested-name-specifier identifier ::
5232 nested-name-specifier template [opt] simple-template-id ::
5234 PARSER->SCOPE should be set appropriately before this function is
5235 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5236 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5237 in name lookups.
5239 Sets PARSER->SCOPE to the class (TYPE) or namespace
5240 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5241 it unchanged if there is no nested-name-specifier. Returns the new
5242 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5244 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5245 part of a declaration and/or decl-specifier. */
5247 static tree
5253 {
5258 /* Remember where the nested-name-specifier starts. */
5260 {
5263 }
5266 {
5267 tree new_scope;
5268 tree old_scope;
5269 tree saved_qualifying_scope;
5272 /* Spot cases that cannot be the beginning of a
5273 nested-name-specifier. */
5276 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5277 the already parsed nested-name-specifier. */
5279 {
5280 /* Grab the nested-name-specifier and continue the loop. */
5282 /* If we originally encountered this nested-name-specifier
5283 with IS_DECLARATION set to false, we will not have
5284 resolved TYPENAME_TYPEs, so we must do so here. */
5287 {
5292 }
5295 }
5297 /* Spot cases that cannot be the beginning of a
5298 nested-name-specifier. On the second and subsequent times
5299 through the loop, we look for the `template' keyword. */
5301 ;
5302 /* A template-id can start a nested-name-specifier. */
5304 ;
5305 /* DR 743: decltype can be used in a nested-name-specifier. */
5307 ;
5308 else
5309 {
5310 /* If the next token is not an identifier, then it is
5311 definitely not a type-name or namespace-name. */
5314 /* If the following token is neither a `<' (to begin a
5315 template-id), nor a `::', then we are not looking at a
5316 nested-name-specifier. */
5322 {
5326 }
5329 && !cp_parser_nth_token_starts_template_argument_list_p
5332 }
5334 /* The nested-name-specifier is optional, so we parse
5335 tentatively. */
5338 /* Look for the optional `template' keyword, if this isn't the
5339 first time through the loop. */
5342 else
5345 /* Save the old scope since the name lookup we are about to do
5346 might destroy it. */
5349 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5350 look up names in "X<T>::I" in order to determine that "Y" is
5351 a template. So, if we have a typename at this point, we make
5352 an effort to look through it. */
5354 && !typename_keyword_p
5359 /* Parse the qualifying entity. */
5360 new_scope
5362 typename_keyword_p,
5363 template_keyword_p,
5364 check_dependency_p,
5365 type_p,
5366 is_declaration);
5367 /* Look for the `::' token. */
5370 /* If we found what we wanted, we keep going; otherwise, we're
5371 done. */
5373 {
5376 /* Restore the OLD_SCOPE since it was valid before the
5377 failed attempt at finding the last
5378 class-or-namespace-name. */
5382 /* If the next token is a decltype, and the one after that is a
5383 `::', then the decltype has failed to resolve to a class or
5384 enumeration type. Give this error even when parsing
5385 tentatively since it can't possibly be valid--and we're going
5386 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5387 won't get another chance.*/
5391 {
5398 /* As below. */
5401 }
5405 /* If the next token is an identifier, and the one after
5406 that is a `::', then any valid interpretation would have
5407 found a class-or-namespace-name. */
5413 {
5416 {
5418 {
5419 tree decl;
5420 tree ambiguous_decls;
5423 none_type,
5432 decl);
5434 {
5435 // cp_parser_lookup_name has the same diagnostic,
5436 // thus make sure to emit it at most once.
5439 {
5444 }
5446 }
5447 else
5448 {
5450 cp_parser_name_lookup_error
5453 else
5454 cp_parser_name_lookup_error
5457 }
5458 }
5461 /* Treat this as a successful nested-name-specifier
5462 due to:
5464 [basic.lookup.qual]
5466 If the name found is not a class-name (clause
5467 _class_) or namespace-name (_namespace.def_), the
5468 program is ill-formed. */
5470 }
5472 }
5474 }
5475 /* We've found one valid nested-name-specifier. */
5477 /* Name lookup always gives us a DECL. */
5480 /* Uses of "template" must be followed by actual templates. */
5492 new_scope);
5493 /* If it is a class scope, try to complete it; we are about to
5494 be looking up names inside the class. */
5496 /* Since checking types for dependency can be expensive,
5497 avoid doing it if the type is already complete. */
5499 /* Do not try to complete dependent types. */
5501 {
5503 /* If it is a typedef to current class, use the current
5504 class instead, as the typedef won't have any names inside
5505 it yet. */
5509 }
5510 /* Make sure we look in the right scope the next time through
5511 the loop. */
5513 }
5515 /* If parsing tentatively, replace the sequence of tokens that makes
5516 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5517 token. That way, should we re-parse the token stream, we will
5518 not have to repeat the effort required to do the parse, nor will
5519 we issue duplicate error messages. */
5521 {
5525 /* Reset the contents of the START token. */
5527 /* Retrieve any deferred checks. Do not pop this access checks yet
5528 so the memory will not be reclaimed during token replacing below. */
5536 /* Purge all subsequent tokens. */
5538 }
5544 }
5546 /* Parse a nested-name-specifier. See
5547 cp_parser_nested_name_specifier_opt for details. This function
5548 behaves identically, except that it will an issue an error if no
5549 nested-name-specifier is present. */
5551 static tree
5557 {
5558 tree scope;
5560 /* Look for the nested-name-specifier. */
5562 typename_keyword_p,
5563 check_dependency_p,
5564 type_p,
5565 is_declaration);
5566 /* If it was not present, issue an error message. */
5568 {
5571 }
5574 }
5576 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5577 this is either a class-name or a namespace-name (which corresponds
5578 to the class-or-namespace-name production in the grammar). For
5579 C++0x, it can also be a type-name that refers to an enumeration
5580 type or a simple-template-id.
5582 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5583 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5584 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5585 TYPE_P is TRUE iff the next name should be taken as a class-name,
5586 even the same name is declared to be another entity in the same
5587 scope.
5589 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5590 specified by the class-or-namespace-name. If neither is found the
5591 ERROR_MARK_NODE is returned. */
5593 static tree
5600 {
5601 tree saved_scope;
5602 tree saved_qualifying_scope;
5603 tree saved_object_scope;
5604 tree scope;
5608 /* DR 743: decltype can appear in a nested-name-specifier. */
5610 {
5614 {
5617 }
5621 }
5623 /* Before we try to parse the class-name, we must save away the
5624 current PARSER->SCOPE since cp_parser_class_name will destroy
5625 it. */
5629 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5630 there is no need to look for a namespace-name. */
5631 only_class_p = template_keyword_p
5636 typename_keyword_p,
5637 template_keyword_p,
5639 check_dependency_p,
5641 is_declaration);
5643 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5647 {
5648 /* Restore the saved scope. */
5653 /* Parse tentatively. */
5656 /* Parse a type-name */
5659 /* "If the name found does not designate a namespace or a class,
5660 enumeration, or dependent type, the program is ill-formed."
5662 We cover classes and dependent types above and namespaces below,
5663 so this code is only looking for enums. */
5669 }
5670 /* If that didn't work, try for a namespace-name. */
5672 {
5673 /* Restore the saved scope. */
5677 /* If we are not looking at an identifier followed by the scope
5678 resolution operator, then this is not part of a
5679 nested-name-specifier. (Note that this function is only used
5680 to parse the components of a nested-name-specifier.) */
5685 }
5688 }
5690 /* Return true if we are looking at a compound-literal, false otherwise. */
5692 static bool
5694 {
5695 /* Consume the `('. */
5700 /* Skip tokens until the next token is a closing parenthesis.
5701 If we find the closing `)', and the next token is a `{', then
5702 we are looking at a compound-literal. */
5703 bool compound_literal_p
5708 /* Roll back the tokens we skipped. */
5712 }
5714 /* Parse a postfix-expression.
5716 postfix-expression:
5717 primary-expression
5718 postfix-expression [ expression ]
5719 postfix-expression ( expression-list [opt] )
5720 simple-type-specifier ( expression-list [opt] )
5721 typename :: [opt] nested-name-specifier identifier
5722 ( expression-list [opt] )
5723 typename :: [opt] nested-name-specifier template [opt] template-id
5724 ( expression-list [opt] )
5725 postfix-expression . template [opt] id-expression
5726 postfix-expression -> template [opt] id-expression
5727 postfix-expression . pseudo-destructor-name
5728 postfix-expression -> pseudo-destructor-name
5729 postfix-expression ++
5730 postfix-expression --
5731 dynamic_cast < type-id > ( expression )
5732 static_cast < type-id > ( expression )
5733 reinterpret_cast < type-id > ( expression )
5734 const_cast < type-id > ( expression )
5735 typeid ( expression )
5736 typeid ( type-id )
5738 GNU Extension:
5740 postfix-expression:
5741 ( type-id ) { initializer-list , [opt] }
5743 This extension is a GNU version of the C99 compound-literal
5744 construct. (The C99 grammar uses `type-name' instead of `type-id',
5745 but they are essentially the same concept.)
5747 If ADDRESS_P is true, the postfix expression is the operand of the
5748 `&' operator. CAST_P is true if this expression is the target of a
5749 cast.
5751 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5752 class member access expressions [expr.ref].
5754 Returns a representation of the expression. */
5756 static tree
5760 {
5762 location_t loc;
5769 /* Peek at the next token. */
5772 /* Some of the productions are determined by keywords. */
5775 {
5780 {
5781 tree type;
5782 tree expression;
5786 /* All of these can be handled in the same way from the point
5787 of view of parsing. Begin by consuming the token
5788 identifying the cast. */
5791 /* New types cannot be defined in the cast. */
5793 parser->type_definition_forbidden_message
5796 /* Look for the opening `<'. */
5798 /* Parse the type to which we are casting. */
5803 /* Look for the closing `>'. */
5805 /* Restore the old message. */
5808 bool saved_greater_than_is_operator_p
5812 /* And the expression which is being cast. */
5817 parser->greater_than_is_operator_p
5820 /* Only type conversions to integral or enumeration types
5821 can be used in constant-expressions. */
5827 {
5829 postfix_expression
5833 postfix_expression
5837 postfix_expression
5839 tf_warning_or_error);
5842 postfix_expression
5847 }
5848 }
5852 {
5853 tree type;
5857 /* Consume the `typeid' token. */
5859 /* Look for the `(' token. */
5861 /* Types cannot be defined in a `typeid' expression. */
5863 parser->type_definition_forbidden_message
5865 /* We can't be sure yet whether we're looking at a type-id or an
5866 expression. */
5868 /* Try a type-id first. */
5873 /* Look for the `)' token. Otherwise, we can't be sure that
5874 we're not looking at an expression: consider `typeid (int
5875 (3))', for example. */
5877 /* If all went well, simply lookup the type-id. */
5880 /* Otherwise, fall back to the expression variant. */
5881 else
5882 {
5883 tree expression;
5885 /* Look for an expression. */
5887 /* Compute its typeid. */
5889 /* Look for the `)' token. */
5891 }
5892 /* Restore the saved message. */
5894 /* `typeid' may not appear in an integral constant expression. */
5897 }
5901 {
5902 tree type;
5903 /* The syntax permitted here is the same permitted for an
5904 elaborated-type-specifier. */
5909 }
5913 {
5917 {
5922 }
5924 {
5929 }
5930 else
5931 {
5932 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5935 }
5937 postfix_expression =
5941 {
5945 }
5947 {
5952 }
5953 else
5954 {
5956 postfix_expression);
5960 }
5962 }
5965 {
5968 tree p;
5982 tf_warning_or_error);
5985 tf_warning_or_error);
5986 else
5987 {
5991 }
5993 }
5996 {
5997 tree type;
5999 /* If the next thing is a simple-type-specifier, we may be
6000 looking at a functional cast. We could also be looking at
6001 an id-expression. So, we try the functional cast, and if
6002 that doesn't work we fall back to the primary-expression. */
6004 /* Look for the simple-type-specifier. */
6007 CP_PARSER_FLAGS_NONE);
6008 /* Parse the cast itself. */
6010 postfix_expression
6012 /* If that worked, we're done. */
6016 /* If the functional-cast didn't work out, try a
6017 compound-literal. */
6020 {
6025 /* Avoid calling cp_parser_type_id pointlessly, see comment
6026 in cp_parser_cast_expression about c++/29234. */
6029 else
6030 {
6031 /* Parse the type. */
6036 /* Look for the `)'. */
6038 }
6040 /* If things aren't going well, there's no need to
6041 keep going. */
6043 {
6045 /* Parse the brace-enclosed initializer list. */
6048 }
6049 /* If that worked, we're definitely looking at a
6050 compound-literal expression. */
6052 {
6053 /* Warn the user that a compound literal is not
6054 allowed in standard C++. */
6057 /* For simplicity, we disallow compound literals in
6058 constant-expressions. We could
6059 allow compound literals of integer type, whose
6060 initializer was a constant, in constant
6061 expressions. Permitting that usage, as a further
6062 extension, would not change the meaning of any
6063 currently accepted programs. (Of course, as
6064 compound literals are not part of ISO C++, the
6065 standard has nothing to say.) */
6067 NIC_NCC))
6068 {
6071 }
6072 /* Form the representation of the compound-literal. */
6073 postfix_expression
6075 tf_warning_or_error);
6077 }
6078 }
6080 /* It must be a primary-expression. */
6081 postfix_expression
6084 decltype_p,
6086 }
6088 }
6090 /* Note that we don't need to worry about calling build_cplus_new on a
6091 class-valued CALL_EXPR in decltype when it isn't the end of the
6092 postfix-expression; unary_complex_lvalue will take care of that for
6093 all these cases. */
6095 /* Keep looping until the postfix-expression is complete. */
6097 {
6101 /* It is not a Koenig lookup function call. */
6102 postfix_expression
6105 /* Peek at the next token. */
6109 {
6112 {
6114 "two consecutive %<[%> shall "
6117 }
6118 postfix_expression
6120 postfix_expression,
6122 decltype_p);
6128 /* postfix-expression ( expression-list [opt] ) */
6129 {
6139 is_builtin_constant_p
6142 {
6143 /* The whole point of __builtin_constant_p is to allow
6144 non-constant expressions to appear as arguments. */
6145 saved_integral_constant_expression_p
6147 saved_non_integral_constant_expression_p
6150 }
6151 args = (cp_parser_parenthesized_expression_list
6156 {
6157 parser->integral_constant_expression_p
6159 parser->non_integral_constant_expression_p
6161 }
6164 {
6167 }
6169 /* Function calls are not permitted in
6170 constant-expressions. */
6173 NIC_FUNC_CALL))
6174 {
6178 }
6183 {
6185 {
6187 {
6190 postfix_expression
6192 complain);
6193 }
6194 else
6195 postfix_expression
6197 }
6198 /* We do not perform argument-dependent lookup if
6199 normal lookup finds a non-function, in accordance
6200 with the expected resolution of DR 218. */
6203 {
6207 /* Do not do argument dependent lookup if regular
6208 lookup finds a member function or a block-scope
6209 function declaration. [basic.lookup.argdep]/3 */
6212 {
6215 postfix_expression
6217 complain);
6218 }
6219 }
6220 }
6223 {
6233 {
6234 postfix_expression
6238 }
6241 {
6242 postfix_expression
6243 = (build_new_method_call
6249 complain));
6250 }
6251 else
6252 postfix_expression
6256 complain);
6257 }
6261 postfix_expression = (build_offset_ref_call_from_tree
6263 complain));
6265 /* A call to a static class member, or a namespace-scope
6266 function. */
6267 postfix_expression
6270 koenig_p,
6271 complain);
6272 else
6273 /* All other function calls. */
6274 postfix_expression
6277 koenig_p,
6278 complain);
6280 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6284 }
6289 /* postfix-expression . template [opt] id-expression
6290 postfix-expression . pseudo-destructor-name
6291 postfix-expression -> template [opt] id-expression
6292 postfix-expression -> pseudo-destructor-name */
6294 /* Consume the `.' or `->' operator. */
6297 postfix_expression
6299 postfix_expression,
6306 /* postfix-expression ++ */
6307 /* Consume the `++' token. */
6309 /* Generate a representation for the complete expression. */
6310 postfix_expression
6312 POSTINCREMENT_EXPR);
6313 /* Increments may not appear in constant-expressions. */
6321 /* postfix-expression -- */
6322 /* Consume the `--' token. */
6324 /* Generate a representation for the complete expression. */
6325 postfix_expression
6327 POSTDECREMENT_EXPR);
6328 /* Decrements may not appear in constant-expressions. */
6340 else
6342 }
6343 }
6345 /* We should never get here. */
6348 }
6350 /* This function parses Cilk Plus array notations. If a normal array expr. is
6351 parsed then the array index is passed back to the caller through *INIT_INDEX
6352 and the function returns a NULL_TREE. If array notation expr. is parsed,
6353 then *INIT_INDEX is ignored by the caller and the function returns
6354 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6355 error_mark_node. */
6357 static tree
6359 tree array_value)
6360 {
6364 {
6367 }
6376 {
6379 }
6381 {
6382 /* Consume the ':'. */
6385 /* If we are here, then we have a case like this A[:]. */
6387 {
6391 }
6395 }
6396 else
6397 {
6398 /* If we are here, then there are three valid possibilities:
6399 1. ARRAY [ EXP ]
6400 2. ARRAY [ EXP : EXP ]
6401 3. ARRAY [ EXP : EXP : EXP ] */
6405 {
6406 /* This indicates that we have a normal array expression. */
6409 }
6411 /* Consume the ':'. */
6415 {
6418 }
6419 }
6424 {
6428 }
6434 }
6436 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6437 by cp_parser_builtin_offsetof. We're looking for
6439 postfix-expression [ expression ]
6440 postfix-expression [ braced-init-list ] (C++11)
6442 FOR_OFFSETOF is set if we're being called in that context, which
6443 changes how we deal with integer constant expressions. */
6445 static tree
6447 tree postfix_expression,
6450 {
6455 /* Consume the `[' token. */
6461 /* Parse the index expression. */
6462 /* ??? For offsetof, there is a question of what to allow here. If
6463 offsetof is not being used in an integral constant expression context,
6464 then we *could* get the right answer by computing the value at runtime.
6465 If we are in an integral constant expression context, then we might
6466 could accept any constant expression; hard to say without analysis.
6467 Rather than open the barn door too wide right away, allow only integer
6468 constant expressions here. */
6471 else
6472 {
6474 {
6481 {
6483 "braced list index is not allowed with array "
6487 }
6488 }
6490 {
6491 /* Here are have these two options:
6492 ARRAY[EXP : EXP] - Array notation expr with default
6493 stride of 1.
6494 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6495 stride. */
6497 postfix_expression);
6500 }
6501 else
6503 }
6507 /* Look for the closing `]'. */
6510 /* Build the ARRAY_REF. */
6514 /* When not doing offsetof, array references are not permitted in
6515 constant-expressions. */
6521 }
6523 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6524 by cp_parser_builtin_offsetof. We're looking for
6526 postfix-expression . template [opt] id-expression
6527 postfix-expression . pseudo-destructor-name
6528 postfix-expression -> template [opt] id-expression
6529 postfix-expression -> pseudo-destructor-name
6531 FOR_OFFSETOF is set if we're being called in that context. That sorta
6532 limits what of the above we'll actually accept, but nevermind.
6533 TOKEN_TYPE is the "." or "->" token, which will already have been
6534 removed from the stream. */
6536 static tree
6539 tree postfix_expression,
6541 location_t location)
6542 {
6543 tree name;
6548 /* If this is a `->' operator, dereference the pointer. */
6551 tf_warning_or_error);
6552 /* Check to see whether or not the expression is type-dependent. */
6554 /* The identifier following the `->' or `.' is not qualified. */
6560 /* Enter the scope corresponding to the type of the object
6561 given by the POSTFIX_EXPRESSION. */
6563 {
6565 /* According to the standard, no expression should ever have
6566 reference type. Unfortunately, we do not currently match
6567 the standard in this respect in that our internal representation
6568 of an expression may have reference type even when the standard
6569 says it does not. Therefore, we have to manually obtain the
6570 underlying type here. */
6572 /* The type of the POSTFIX_EXPRESSION must be complete. */
6574 {
6576 postfix_expression);
6578 }
6579 /* Unlike the object expression in other contexts, *this is not
6580 required to be of complete type for purposes of class member
6581 access (5.2.5) outside the member function body. */
6585 /* Let the name lookup machinery know that we are processing a
6586 class member access expression. */
6588 /* If something went wrong, we want to be able to discern that case,
6589 as opposed to the case where there was no SCOPE due to the type
6590 of expression being dependent. */
6593 /* If the SCOPE was erroneous, make the various semantic analysis
6594 functions exit quickly -- and without issuing additional error
6595 messages. */
6598 }
6600 /* Assume this expression is not a pseudo-destructor access. */
6603 /* If the SCOPE is a scalar type, then, if this is a valid program,
6604 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6605 is type dependent, it can be pseudo-destructor-name or something else.
6606 Try to parse it as pseudo-destructor-name first. */
6608 {
6609 tree s;
6610 tree type;
6613 /* Parse the pseudo-destructor-name. */
6622 {
6624 postfix_expression
6627 }
6628 }
6631 {
6632 /* If the SCOPE is not a scalar type, we are looking at an
6633 ordinary class member access expression, rather than a
6634 pseudo-destructor-name. */
6637 /* Parse the id-expression. */
6638 name = (cp_parser_id_expression
6645 /* In general, build a SCOPE_REF if the member name is qualified.
6646 However, if the name was not dependent and has already been
6647 resolved; there is no need to build the SCOPE_REF. For example;
6649 struct X { void f(); };
6650 template <typename T> void f(T* t) { t->X::f(); }
6652 Even though "t" is dependent, "X::f" is not and has been resolved
6653 to a BASELINK; there is no need to include scope information. */
6655 /* But we do need to remember that there was an explicit scope for
6656 virtual function calls. */
6660 /* If the name is a template-id that names a type, we will get a
6661 TYPE_DECL here. That is invalid code. */
6663 {
6666 }
6667 else
6668 {
6670 {
6672 {
6676 }
6677 else
6680 name,
6681 template_p);
6685 }
6687 adjust_result_of_qualified_name_lookup
6689 postfix_expression
6691 template_p,
6692 tf_warning_or_error);
6693 }
6694 }
6696 /* We no longer need to look up names in the scope of the object on
6697 the left-hand side of the `.' or `->' operator. */
6700 /* Outside of offsetof, these operators may not appear in
6701 constant-expressions. */
6703 && (cp_parser_non_integral_constant_expression
6708 }
6710 /* Parse a parenthesized expression-list.
6712 expression-list:
6713 assignment-expression
6714 expression-list, assignment-expression
6716 attribute-list:
6717 expression-list
6718 identifier
6719 identifier, expression-list
6721 CAST_P is true if this expression is the target of a cast.
6723 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6724 argument pack.
6726 Returns a vector of trees. Each element is a representation of an
6727 assignment-expression. NULL is returned if the ( and or ) are
6728 missing. An empty, but allocated, vector is returned on no
6729 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6730 if we are parsing an attribute list for an attribute that wants a
6731 plain identifier argument, normal_attr for an attribute that wants
6732 an expression, or non_attr if we aren't parsing an attribute list. If
6733 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6734 not all of the expressions in the list were constant. */
6742 {
6748 /* Assume all the expressions will be constant. */
6757 /* Within a parenthesized expression, a `>' token is always
6758 the greater-than operator. */
6759 saved_greater_than_is_operator_p
6763 /* Consume expressions until there are no more. */
6766 {
6767 tree expr;
6769 /* At the beginning of attribute lists, check to see if the
6770 next token is an identifier. */
6773 {
6776 /* Consume the identifier. */
6778 /* Save the identifier. */
6780 }
6781 else
6782 {
6785 /* Parse the next assignment-expression. */
6787 {
6788 /* A braced-init-list. */
6794 }
6796 {
6797 expr = (cp_parser_constant_expression
6802 }
6803 else
6809 /* If we have an ellipsis, then this is an expression
6810 expansion. */
6813 {
6814 /* Consume the `...'. */
6817 /* Build the argument pack. */
6819 }
6821 /* Add it to the list. We add error_mark_node
6822 expressions to the list, so that we can still tell if
6823 the correct form for a parenthesized expression-list
6824 is found. That gives better errors. */
6829 }
6831 /* After the first item, attribute lists look the same as
6832 expression lists. */
6835 get_comma:;
6836 /* If the next token isn't a `,', then we are done. */
6840 /* Otherwise, consume the `,' and keep going. */
6842 }
6845 {
6848 skip_comma:;
6849 /* We try and resync to an unnested comma, as that will give the
6850 user better diagnostics. */
6858 {
6859 parser->greater_than_is_operator_p
6862 }
6863 }
6865 parser->greater_than_is_operator_p
6872 }
6874 /* Parse a pseudo-destructor-name.
6876 pseudo-destructor-name:
6877 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6878 :: [opt] nested-name-specifier template template-id :: ~ type-name
6879 :: [opt] nested-name-specifier [opt] ~ type-name
6881 If either of the first two productions is used, sets *SCOPE to the
6882 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6883 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6884 or ERROR_MARK_NODE if the parse fails. */
6886 static void
6888 tree object,
6891 {
6894 /* Handle ~auto. */
6898 {
6901 "%<~auto%> only available with "
6908 }
6910 /* Assume that things will not work out. */
6913 /* Look for the optional `::' operator. */
6915 /* Look for the optional nested-name-specifier. */
6916 nested_name_specifier_p
6923 /* Now, if we saw a nested-name-specifier, we might be doing the
6924 second production. */
6927 {
6928 /* Consume the `template' keyword. */
6930 /* Parse the template-id. */
6934 class_type,
6936 /* Look for the `::' token. */
6938 }
6939 /* If the next token is not a `~', then there might be some
6940 additional qualification. */
6942 {
6943 /* At this point, we're looking for "type-name :: ~". The type-name
6944 must not be a class-name, since this is a pseudo-destructor. So,
6945 it must be either an enum-name, or a typedef-name -- both of which
6946 are just identifiers. So, we peek ahead to check that the "::"
6947 and "~" tokens are present; if they are not, then we can avoid
6948 calling type_name. */
6952 {
6955 }
6957 /* Look for the type-name. */
6962 /* Look for the `::' token. */
6964 }
6965 else
6968 /* Look for the `~'. */
6971 /* Once we see the ~, this has to be a pseudo-destructor. */
6975 /* Look for the type-name again. We are not responsible for
6976 checking that it matches the first type-name. */
6978 }
6980 /* Parse a unary-expression.
6982 unary-expression:
6983 postfix-expression
6984 ++ cast-expression
6985 -- cast-expression
6986 unary-operator cast-expression
6987 sizeof unary-expression
6988 sizeof ( type-id )
6989 alignof ( type-id ) [C++0x]
6990 new-expression
6991 delete-expression
6993 GNU Extensions:
6995 unary-expression:
6996 __extension__ cast-expression
6997 __alignof__ unary-expression
6998 __alignof__ ( type-id )
6999 alignof unary-expression [C++0x]
7000 __real__ cast-expression
7001 __imag__ cast-expression
7002 && identifier
7003 sizeof ( type-id ) { initializer-list , [opt] }
7004 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7005 __alignof__ ( type-id ) { initializer-list , [opt] }
7007 ADDRESS_P is true iff the unary-expression is appearing as the
7008 operand of the `&' operator. CAST_P is true if this expression is
7009 the target of a cast.
7011 Returns a representation of the expression. */
7013 static tree
7016 {
7020 /* Peek at the next token. */
7022 /* Some keywords give away the kind of expression. */
7024 {
7028 {
7031 {
7034 location_t first_loc;
7037 /* Consume the token. */
7040 /* Parse the operand. */
7045 else
7046 {
7047 /* ISO C++ defines alignof only with types, not with
7048 expressions. So pedwarn if alignof is used with a non-
7049 type expression. However, __alignof__ is ok. */
7052 "ISO C++ does not allow %<alignof%> "
7056 }
7057 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7058 SIZEOF_EXPR with the original operand. */
7060 {
7062 {
7064 {
7067 error_mark_node));
7069 }
7070 else
7074 }
7076 }
7078 }
7087 {
7088 /* The saved value of the PEDANTIC flag. */
7090 tree expr;
7092 /* Save away the PEDANTIC flag. */
7094 /* Parse the cast-expression. */
7096 /* Restore the PEDANTIC flag. */
7100 }
7104 {
7105 tree expression;
7107 /* Consume the `__real__' or `__imag__' token. */
7109 /* Parse the cast-expression. */
7111 /* Create the complete representation. */
7115 expression,
7116 tf_warning_or_error);
7117 }
7125 {
7126 tree expr;
7136 parser->type_definition_forbidden_message
7139 saved_integral_constant_expression_p
7141 saved_non_integral_constant_expression_p
7145 saved_greater_than_is_operator_p
7155 parser->greater_than_is_operator_p
7158 parser->integral_constant_expression_p
7160 parser->non_integral_constant_expression_p
7167 }
7171 }
7172 }
7174 /* Look for the `:: new' and `:: delete', which also signal the
7175 beginning of a new-expression, or delete-expression,
7176 respectively. If the next token is `::', then it might be one of
7177 these. */
7179 {
7182 /* See if the token after the `::' is one of the keywords in
7183 which we're interested. */
7185 /* If it's `new', we have a new-expression. */
7188 /* Similarly, for `delete'. */
7191 }
7193 /* Look for a unary operator. */
7195 /* The `++' and `--' operators can be handled similarly, even though
7196 they are not technically unary-operators in the grammar. */
7198 {
7203 /* Handle the GNU address-of-label extension. */
7206 {
7207 tree identifier;
7208 tree expression;
7211 /* Consume the '&&' token. */
7213 /* Look for the identifier. */
7215 /* Create an expression representing the address. */
7218 NIC_ADDR_LABEL))
7221 }
7222 }
7224 {
7225 tree cast_expression;
7231 /* Consume the operator token. */
7233 /* Parse the cast-expression. */
7234 cast_expression
7239 pidk);
7240 /* Now, build an appropriate representation. */
7242 {
7246 RO_UNARY_STAR,
7247 complain);
7252 /* Fall through. */
7255 cast_expression,
7256 complain);
7263 /* Fall through. */
7273 }
7277 non_constant_p))
7281 }
7285 decltype_p,
7286 pidk);
7287 }
7292 {
7295 }
7297 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7298 unary-operator, the corresponding tree code is returned. */
7300 static enum tree_code
7302 {
7304 {
7325 }
7326 }
7328 /* Parse a new-expression.
7330 new-expression:
7331 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7332 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7334 Returns a representation of the expression. */
7336 static tree
7338 {
7341 tree type;
7344 tree ret;
7346 /* Look for the optional `::' operator. */
7347 global_scope_p
7351 /* Look for the `new' operator. */
7353 /* There's no easy way to tell a new-placement from the
7354 `( type-id )' construct. */
7356 /* Look for a new-placement. */
7358 /* If that didn't work out, there's no new-placement. */
7360 {
7364 }
7366 /* If the next token is a `(', then we have a parenthesized
7367 type-id. */
7369 {
7373 /* Consume the `('. */
7376 /* Parse the type-id. */
7377 parser->type_definition_forbidden_message
7382 /* Look for the closing `)'. */
7385 /* There should not be a direct-new-declarator in this production,
7386 but GCC used to allowed this, so we check and emit a sensible error
7387 message for this case. */
7389 {
7395 }
7396 }
7397 /* Otherwise, there must be a new-type-id. */
7398 else
7401 /* If the next token is a `(' or '{', then we have a new-initializer. */
7405 else
7408 /* A new-expression may not appear in an integral constant
7409 expression. */
7412 else
7413 {
7414 /* Create a representation of the new-expression. */
7416 tf_warning_or_error);
7417 }
7425 }
7427 /* Parse a new-placement.
7429 new-placement:
7430 ( expression-list )
7432 Returns the same representation as for an expression-list. */
7436 {
7439 /* Parse the expression-list. */
7440 expression_list = (cp_parser_parenthesized_expression_list
7446 }
7448 /* Parse a new-type-id.
7450 new-type-id:
7451 type-specifier-seq new-declarator [opt]
7453 Returns the TYPE allocated. If the new-type-id indicates an array
7454 type, *NELTS is set to the number of elements in the last array
7455 bound; the TYPE will not include the last array bound. */
7457 static tree
7459 {
7460 cp_decl_specifier_seq type_specifier_seq;
7466 /* The type-specifier sequence must not contain type definitions.
7467 (It cannot contain declarations of new types either, but if they
7468 are not definitions we will catch that because they are not
7469 complete.) */
7471 parser->type_definition_forbidden_message
7473 /* Parse the type-specifier-seq. */
7477 /* Restore the old message. */
7483 /* Parse the new-declarator. */
7486 /* Determine the number of elements in the last array dimension, if
7487 any. */
7489 /* Skip down to the last array dimension. */
7494 {
7497 }
7502 {
7505 }
7508 {
7515 else
7517 }
7520 }
7522 /* Parse an (optional) new-declarator.
7524 new-declarator:
7525 ptr-operator new-declarator [opt]
7526 direct-new-declarator
7528 Returns the declarator. */
7532 {
7535 cp_cv_quals cv_quals;
7537 /* We don't know if there's a ptr-operator next, or not. */
7539 /* Look for a ptr-operator. */
7541 /* If that worked, look for more new-declarators. */
7543 {
7546 /* Parse another optional declarator. */
7549 declarator = cp_parser_make_indirect_declarator
7553 }
7555 /* If the next token is a `[', there is a direct-new-declarator. */
7560 }
7562 /* Parse a direct-new-declarator.
7564 direct-new-declarator:
7565 [ expression ]
7566 direct-new-declarator [constant-expression]
7568 */
7572 {
7576 {
7577 tree expression;
7580 /* Look for the opening `['. */
7585 /* The standard requires that the expression have integral
7586 type. DR 74 adds enumeration types. We believe that the
7587 real intent is that these expressions be handled like the
7588 expression in a `switch' condition, which also allows
7589 classes with a single conversion to integral or
7590 enumeration type. */
7592 {
7593 expression
7595 expression,
7598 {
7600 "expression in new-declarator must have integral "
7603 }
7604 }
7606 /* Look for the closing `]'. */
7609 /* Add this bound to the declarator. */
7612 /* If the next token is not a `[', then there are no more
7613 bounds. */
7616 }
7619 }
7621 /* Parse a new-initializer.
7623 new-initializer:
7624 ( expression-list [opt] )
7625 braced-init-list
7627 Returns a representation of the expression-list. */
7631 {
7635 {
7636 tree t;
7643 }
7644 else
7645 expression_list = (cp_parser_parenthesized_expression_list
7651 }
7653 /* Parse a delete-expression.
7655 delete-expression:
7656 :: [opt] delete cast-expression
7657 :: [opt] delete [ ] cast-expression
7659 Returns a representation of the expression. */
7661 static tree
7663 {
7666 tree expression;
7668 /* Look for the optional `::' operator. */
7669 global_scope_p
7673 /* Look for the `delete' keyword. */
7675 /* See if the array syntax is in use. */
7677 {
7678 /* Consume the `[' token. */
7680 /* Look for the `]' token. */
7682 /* Remember that this is the `[]' construct. */
7684 }
7685 else
7688 /* Parse the cast-expression. */
7691 /* A delete-expression may not appear in an integral constant
7692 expression. */
7697 tf_warning_or_error);
7698 }
7700 /* Returns true if TOKEN may start a cast-expression and false
7701 otherwise. */
7703 static bool
7705 {
7708 {
7749 /* In ((type ()) () the last () isn't a valid cast-expression,
7750 so the whole must be parsed as postfix-expression. */
7754 /* '[' may start a primary-expression in obj-c++. */
7760 }
7761 }
7763 /* Parse a cast-expression.
7765 cast-expression:
7766 unary-expression
7767 ( type-id ) cast-expression
7769 ADDRESS_P is true iff the unary-expression is appearing as the
7770 operand of the `&' operator. CAST_P is true if this expression is
7771 the target of a cast.
7773 Returns a representation of the expression. */
7775 static tree
7778 {
7779 /* If it's a `(', then we might be looking at a cast. */
7781 {
7787 /* There's no way to know yet whether or not this is a cast.
7788 For example, `(int (3))' is a unary-expression, while `(int)
7789 3' is a cast. So, we resort to parsing tentatively. */
7791 /* Types may not be defined in a cast. */
7793 parser->type_definition_forbidden_message
7795 /* Consume the `('. */
7797 /* A very tricky bit is that `(struct S) { 3 }' is a
7798 compound-literal (which we permit in C++ as an extension).
7799 But, that construct is not a cast-expression -- it is a
7800 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7801 is legal; if the compound-literal were a cast-expression,
7802 you'd need an extra set of parentheses.) But, if we parse
7803 the type-id, and it happens to be a class-specifier, then we
7804 will commit to the parse at that point, because we cannot
7805 undo the action that is done when creating a new class. So,
7806 then we cannot back up and do a postfix-expression.
7807 Another tricky case is the following (c++/29234):
7809 struct S { void operator () (); };
7811 void foo ()
7812 {
7813 ( S()() );
7814 }
7816 As a type-id we parse the parenthesized S()() as a function
7817 returning a function, groktypename complains and we cannot
7818 back up in this case either.
7820 Therefore, we scan ahead to the closing `)', and check to see
7821 if the tokens after the `)' can start a cast-expression. Otherwise
7822 we are dealing with an unary-expression, a postfix-expression
7823 or something else.
7825 Save tokens so that we can put them back. */
7828 /* We may be looking at a cast-expression. */
7829 cast_expression_p
7834 /* Roll back the tokens we skipped. */
7836 /* If we aren't looking at a cast-expression, simulate an error so
7837 that the call to cp_parser_parse_definitely below will fail. */
7840 else
7841 {
7844 /* Look for the type-id. */
7846 /* Look for the closing `)'. */
7849 }
7851 /* Restore the saved message. */
7854 /* At this point this can only be either a cast or a
7855 parenthesized ctor such as `(T ())' that looks like a cast to
7856 function returning T. */
7858 {
7864 pidk);
7866 /* Warn about old-style casts, if so requested. */
7873 /* Only type conversions to integral or enumeration types
7874 can be used in constant-expressions. */
7877 NIC_CAST))
7880 /* Perform the cast. */
7883 }
7884 else
7886 }
7888 /* If we get here, then it's not a cast, so it must be a
7889 unary-expression. */
7892 }
7894 /* Parse a binary expression of the general form:
7896 pm-expression:
7897 cast-expression
7898 pm-expression .* cast-expression
7899 pm-expression ->* cast-expression
7901 multiplicative-expression:
7902 pm-expression
7903 multiplicative-expression * pm-expression
7904 multiplicative-expression / pm-expression
7905 multiplicative-expression % pm-expression
7907 additive-expression:
7908 multiplicative-expression
7909 additive-expression + multiplicative-expression
7910 additive-expression - multiplicative-expression
7912 shift-expression:
7913 additive-expression
7914 shift-expression << additive-expression
7915 shift-expression >> additive-expression
7917 relational-expression:
7918 shift-expression
7919 relational-expression < shift-expression
7920 relational-expression > shift-expression
7921 relational-expression <= shift-expression
7922 relational-expression >= shift-expression
7924 GNU Extension:
7926 relational-expression:
7927 relational-expression <? shift-expression
7928 relational-expression >? shift-expression
7930 equality-expression:
7931 relational-expression
7932 equality-expression == relational-expression
7933 equality-expression != relational-expression
7935 and-expression:
7936 equality-expression
7937 and-expression & equality-expression
7939 exclusive-or-expression:
7940 and-expression
7941 exclusive-or-expression ^ and-expression
7943 inclusive-or-expression:
7944 exclusive-or-expression
7945 inclusive-or-expression | exclusive-or-expression
7947 logical-and-expression:
7948 inclusive-or-expression
7949 logical-and-expression && inclusive-or-expression
7951 logical-or-expression:
7952 logical-and-expression
7953 logical-or-expression || logical-and-expression
7955 All these are implemented with a single function like:
7957 binary-expression:
7958 simple-cast-expression
7959 binary-expression <token> binary-expression
7961 CAST_P is true if this expression is the target of a cast.
7963 The binops_by_token map is used to get the tree codes for each <token> type.
7964 binary-expressions are associated according to a precedence table. */
7966 #define TOKEN_PRECEDENCE(token) \
7967 (((token->type == CPP_GREATER \
7968 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7969 && !parser->greater_than_is_operator_p) \
7970 ? PREC_NOT_OPERATOR \
7971 : binops_by_token[token->type].prec)
7973 static tree
7979 {
7980 cp_parser_expression_stack stack;
7982 cp_parser_expression_stack_entry current;
7983 tree rhs;
7987 tree overload;
7988 bool parenthesized_not_lhs_warn
7991 /* Parse the first expression. */
8001 {
8002 /* Get an operator token. */
8008 {
8010 "%<>>%> operator is treated"
8014 }
8018 /* Popping an entry off the stack means we completed a subexpression:
8019 - either we found a token which is not an operator (`>' where it is not
8020 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8021 will happen repeatedly;
8022 - or, we found an operator which has lower priority. This is the case
8023 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8024 parsing `3 * 4'. */
8026 {
8029 else
8031 }
8033 get_rhs:
8037 /* We used the operator token. */
8040 /* For "false && x" or "true || x", x will never be executed;
8041 disable warnings while evaluating it. */
8047 /* Extract another operand. It may be the RHS of this expression
8048 or the LHS of a new, higher priority expression. */
8052 /* Get another operator token. Look up its precedence to avoid
8053 building a useless (immediately popped) stack entry for common
8054 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8058 {
8059 /* ... and prepare to parse the RHS of the new, higher priority
8060 expression. Since precedence levels on the stack are
8061 monotonically increasing, we do not have to care about
8062 stack overflows. */
8071 pop:
8073 /* If the stack is not empty, we have parsed into LHS the right side
8074 (`4' in the example above) of an expression we had suspended.
8075 We can use the information on the stack to recover the LHS (`3')
8076 from the stack together with the tree code (`MULT_EXPR'), and
8077 the precedence of the higher level subexpression
8078 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8079 which will be used to actually build the additive expression. */
8084 }
8086 /* Undo the disabling of warnings done above. */
8098 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8099 ERROR_MARK for everything that is not a binary expression.
8100 This makes warn_about_parentheses miss some warnings that
8101 involve unary operators. For unary expressions we should
8102 pass the correct tree_code unless the unary expression was
8103 surrounded by parentheses.
8104 */
8110 == tcc_comparison
8113 else
8122 /* If the binary operator required the use of an overloaded operator,
8123 then this expression cannot be an integral constant-expression.
8124 An overloaded operator can be used even if both operands are
8125 otherwise permissible in an integral constant-expression if at
8126 least one of the operands is of enumeration type. */
8130 NIC_OVERLOADED))
8132 }
8135 }
8137 static tree
8142 {
8145 }
8147 /* Parse the `? expression : assignment-expression' part of a
8148 conditional-expression. The LOGICAL_OR_EXPR is the
8149 logical-or-expression that started the conditional-expression.
8150 Returns a representation of the entire conditional-expression.
8152 This routine is used by cp_parser_assignment_expression.
8154 ? expression : assignment-expression
8156 GNU Extensions:
8158 ? : assignment-expression */
8160 static tree
8162 {
8163 tree expr;
8164 tree assignment_expr;
8168 /* Consume the `?' token. */
8173 {
8176 /* Implicit true clause. */
8180 }
8181 else
8182 {
8185 /* Parse the expression. */
8188 c_inhibit_evaluation_warnings +=
8192 }
8194 /* The next token should be a `:'. */
8196 /* Parse the assignment-expression. */
8200 /* Build the conditional-expression. */
8202 expr,
8203 assignment_expr,
8204 tf_warning_or_error);
8205 }
8207 /* Parse an assignment-expression.
8209 assignment-expression:
8210 conditional-expression
8211 logical-or-expression assignment-operator assignment_expression
8212 throw-expression
8214 CAST_P is true if this expression is the target of a cast.
8215 DECLTYPE_P is true if this expression is the operand of decltype.
8217 Returns a representation for the expression. */
8219 static tree
8222 {
8223 tree expr;
8225 /* If the next token is the `throw' keyword, then we're looking at
8226 a throw-expression. */
8229 /* Otherwise, it must be that we are looking at a
8230 logical-or-expression. */
8231 else
8232 {
8233 /* Parse the binary expressions (logical-or-expression). */
8235 decltype_p,
8237 /* If the next token is a `?' then we're actually looking at a
8238 conditional-expression. */
8241 else
8242 {
8245 /* If it's an assignment-operator, we're using the second
8246 production. */
8247 enum tree_code assignment_operator
8250 {
8252 location_t saved_input_location;
8254 /* Parse the right-hand side of the assignment. */
8260 /* An assignment may not appear in a
8261 constant-expression. */
8263 NIC_ASSIGNMENT))
8265 /* Build the assignment expression. Its default
8266 location is the location of the '=' token. */
8270 assignment_operator,
8271 rhs,
8274 }
8275 }
8276 }
8279 }
8281 static tree
8284 {
8287 }
8289 /* Parse an (optional) assignment-operator.
8291 assignment-operator: one of
8292 = *= /= %= += -= >>= <<= &= ^= |=
8294 GNU Extension:
8296 assignment-operator: one of
8297 <?= >?=
8299 If the next token is an assignment operator, the corresponding tree
8300 code is returned, and the token is consumed. For example, for
8301 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8302 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8303 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8304 operator, ERROR_MARK is returned. */
8306 static enum tree_code
8308 {
8312 /* Peek at the next token. */
8316 {
8362 /* Nothing else is an assignment operator. */
8364 }
8366 /* If it was an assignment operator, consume it. */
8371 }
8373 /* Parse an expression.
8375 expression:
8376 assignment-expression
8377 expression , assignment-expression
8379 CAST_P is true if this expression is the target of a cast.
8380 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8381 except possibly parenthesized or on the RHS of a comma (N3276).
8383 Returns a representation of the expression. */
8385 static tree
8388 {
8393 {
8394 tree assignment_expression;
8396 /* Parse the next assignment-expression. */
8397 assignment_expression
8400 /* We don't create a temporary for a call that is the immediate operand
8401 of decltype or on the RHS of a comma. But when we see a comma, we
8402 need to create a temporary for a call on the LHS. */
8407 assignment_expression
8411 /* If this is the first assignment-expression, we can just
8412 save it away. */
8415 else
8417 assignment_expression,
8419 /* If the next token is not a comma, then we are done with the
8420 expression. */
8423 /* Consume the `,'. */
8426 /* A comma operator cannot appear in a constant-expression. */
8429 }
8432 }
8436 {
8438 }
8440 /* Parse a constant-expression.
8442 constant-expression:
8443 conditional-expression
8445 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8446 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8447 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8448 is false, NON_CONSTANT_P should be NULL. */
8450 static tree
8454 {
8458 tree expression;
8460 /* It might seem that we could simply parse the
8461 conditional-expression, and then check to see if it were
8462 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8463 one that the compiler can figure out is constant, possibly after
8464 doing some simplifications or optimizations. The standard has a
8465 precise definition of constant-expression, and we must honor
8466 that, even though it is somewhat more restrictive.
8468 For example:
8470 int i[(2, 3)];
8472 is not a legal declaration, because `(2, 3)' is not a
8473 constant-expression. The `,' operator is forbidden in a
8474 constant-expression. However, GCC's constant-folding machinery
8475 will fold this operation to an INTEGER_CST for `3'. */
8477 /* Save the old settings. */
8479 saved_allow_non_integral_constant_expression_p
8482 /* We are now parsing a constant-expression. */
8484 parser->allow_non_integral_constant_expression_p
8487 /* Although the grammar says "conditional-expression", we parse an
8488 "assignment-expression", which also permits "throw-expression"
8489 and the use of assignment operators. In the case that
8490 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8491 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8492 actually essential that we look for an assignment-expression.
8493 For example, cp_parser_initializer_clauses uses this function to
8494 determine whether a particular assignment-expression is in fact
8495 constant. */
8497 /* Restore the old settings. */
8498 parser->integral_constant_expression_p
8500 parser->allow_non_integral_constant_expression_p
8503 {
8504 /* Require an rvalue constant expression here; that's what our
8505 callers expect. Reference constant expressions are handled
8506 separately in e.g. cp_parser_template_argument. */
8511 }
8514 parser->non_integral_constant_expression_p
8518 }
8520 /* Parse __builtin_offsetof.
8522 offsetof-expression:
8523 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8525 offsetof-member-designator:
8526 id-expression
8527 | offsetof-member-designator "." id-expression
8528 | offsetof-member-designator "[" expression "]"
8529 | offsetof-member-designator "->" id-expression */
8531 static tree
8533 {
8536 cp_id_kind dummy;
8539 /* We're about to accept non-integral-constant things, but will
8540 definitely yield an integral constant expression. Save and
8541 restore these values around our local parsing. */
8545 /* Consume the "__builtin_offsetof" token. */
8547 /* Consume the opening `('. */
8549 /* Parse the type-id. */
8551 /* Look for the `,'. */
8555 /* Build the (type *)null that begins the traditional offsetof macro. */
8557 tf_warning_or_error);
8559 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8563 {
8566 {
8568 /* offsetof-member-designator "[" expression "]" */
8574 /* offsetof-member-designator "->" identifier */
8577 /* FALLTHRU */
8580 /* offsetof-member-designator "." identifier */
8588 /* Consume the ")" token. */
8593 /* Error. We know the following require will fail, but
8594 that gives the proper error message. */
8599 }
8600 }
8602 success:
8603 /* If we're processing a template, we can't finish the semantics yet.
8604 Otherwise we can fold the entire expression now. */
8607 else
8610 failure:
8615 }
8617 /* Parse a trait expression.
8619 Returns a representation of the expression, the underlying type
8620 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8622 static tree
8624 {
8625 cp_trait_kind kind;
8628 cp_decl_specifier_seq decl_specs;
8631 {
8712 }
8714 /* Consume the token. */
8724 /* Build a trivial decl-specifier-seq. */
8728 /* Call grokdeclarator to figure out what type this is. */
8733 {
8741 /* Build a trivial decl-specifier-seq. */
8745 /* Call grokdeclarator to figure out what type this is. */
8748 }
8752 /* Complete the trait expression, which may mean either processing
8753 the trait expr now or saving it for template instantiation. */
8755 {
8764 }
8765 }
8767 /* Lambdas that appear in variable initializer or default argument scope
8768 get that in their mangling, so we need to record it. We might as well
8769 use the count for function and namespace scopes as well. */
8773 {
8774 tree t;
8779 static void
8781 {
8782 tree_int ti;
8784 /* Once we're inside a function, we ignore other scopes and just push
8785 the function again so that popping works properly. */
8792 {
8793 /* Don't reset the count if we're still in the same function. */
8796 }
8797 }
8799 static void
8801 {
8804 }
8806 static void
8808 {
8811 {
8814 }
8816 }
8818 /* Parse a lambda expression.
8820 lambda-expression:
8821 lambda-introducer lambda-declarator [opt] compound-statement
8823 Returns a representation of the expression. */
8825 static tree
8827 {
8829 tree type;
8836 {
8838 {
8842 }
8844 }
8846 /* We may be in the middle of deferred access check. Disable
8847 it now. */
8858 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8861 /* Now that we've started the type, add the capture fields for any
8862 explicit captures. */
8865 {
8866 /* Inside the class, surrounding template-parameter-lists do not apply. */
8867 unsigned int saved_num_template_parameter_lists
8871 bool fully_implicit_function_template_p
8875 bool auto_is_implicit_function_template_parm_p
8886 /* By virtue of defining a local class, a lambda expression has access to
8887 the private variables of enclosing classes. */
8894 {
8897 }
8899 /* The capture list was built up in reverse order; fix that now. */
8911 parser->fully_implicit_function_template_p
8915 parser->auto_is_implicit_function_template_parm_p
8917 }
8921 /* This field is only used during parsing of the lambda. */
8924 /* This lambda shouldn't have any proxies left at this point. */
8926 /* And now that we're done, push proxies for an enclosing lambda. */
8931 else
8933 }
8935 /* Parse the beginning of a lambda expression.
8937 lambda-introducer:
8938 [ lambda-capture [opt] ]
8940 LAMBDA_EXPR is the current representation of the lambda expression. */
8942 static void
8944 {
8945 /* Need commas after the first capture. */
8948 /* Eat the leading `['. */
8951 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8959 {
8962 }
8965 {
8967 tree capture_id;
8968 tree capture_init_expr;
8972 enum capture_kind_type
8973 {
8974 BY_COPY,
8975 BY_REFERENCE
8976 };
8980 {
8983 }
8987 else
8990 /* Possibly capture `this'. */
8992 {
9002 explicit_init_p);
9004 }
9006 /* Remember whether we want to capture as a reference or not. */
9008 {
9011 }
9013 /* Get the identifier. */
9018 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9019 delimiters, but I modified this to stop on unnested ']' as well. It
9020 was already changed to stop on unnested '}', so the
9021 "closing_parenthesis" name is no more misleading with my change. */
9022 {
9028 }
9030 /* Find the initializer for this capture. */
9034 {
9036 /* An explicit initializer exists. */
9039 "lambda capture initializers "
9045 {
9048 }
9049 }
9050 else
9051 {
9054 /* Turn the identifier into an id-expression. */
9055 capture_init_expr
9060 {
9063 }
9067 {
9070 capture_init_expr);
9073 }
9076 {
9079 capture_init_expr))
9082 }
9084 capture_init_expr
9085 = finish_id_expression
9087 capture_init_expr,
9101 {
9104 }
9105 else
9107 }
9111 {
9116 capture_id);
9120 "capture of %qD redundant with by-reference capture "
9122 }
9125 capture_id,
9126 capture_init_expr,
9128 explicit_init_p);
9129 }
9132 }
9134 /* Parse the (optional) middle of a lambda expression.
9136 lambda-declarator:
9137 < template-parameter-list [opt] >
9138 ( parameter-declaration-clause [opt] )
9139 attribute-specifier [opt]
9140 mutable [opt]
9141 exception-specification [opt]
9142 lambda-return-type-clause [opt]
9144 LAMBDA_EXPR is the current representation of the lambda expression. */
9146 static bool
9148 {
9149 /* 5.1.1.4 of the standard says:
9150 If a lambda-expression does not include a lambda-declarator, it is as if
9151 the lambda-declarator were ().
9152 This means an empty parameter list, no attributes, and no exception
9153 specification. */
9159 /* The template-parameter-list is optional, but must begin with
9160 an opening angle if present. */
9162 {
9165 "lambda templates are only available with "
9174 /* We just processed one more parameter list. */
9176 }
9178 /* The parameter-declaration-clause is optional (unless
9179 template-parameter-list was given), but must begin with an
9180 opening parenthesis if present. */
9182 {
9187 /* Parse parameters. */
9190 /* Default arguments shall not be specified in the
9191 parameter-declaration-clause of a lambda-declarator. */
9201 /* Parse optional `mutable' keyword. */
9203 {
9206 }
9208 /* Parse optional exception specification. */
9211 /* Parse optional trailing return type. */
9213 {
9217 }
9219 /* The function parameters must be in scope all the way until after the
9220 trailing-return-type in case of decltype. */
9222 }
9226 /* Create the function call operator.
9228 Messing with declarators like this is no uglier than building up the
9229 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9230 other code. */
9231 {
9232 cp_decl_specifier_seq return_type_specs;
9234 tree fco;
9241 else
9242 /* Maybe we will deduce the return type later. */
9248 sfk_none);
9253 VIRT_SPEC_UNSPECIFIED,
9254 REF_QUAL_NONE,
9255 exception_spec,
9260 declarator,
9261 attributes);
9263 {
9266 /* Give the object parameter a different name. */
9270 }
9272 {
9276 }
9285 }
9286 }
9288 /* Parse the body of a lambda expression, which is simply
9290 compound-statement
9292 but which requires special handling.
9293 LAMBDA_EXPR is the current representation of the lambda expression. */
9295 static void
9297 {
9302 else
9303 /* Still increment function_depth so that we don't GC in the
9304 middle of an expression. */
9306 /* Clear this in case we're in the middle of a default argument. */
9309 /* Finish the function call operator
9310 - class_specifier
9311 + late_parsing_for_member
9312 + function_definition_after_declarator
9313 + ctor_initializer_opt_and_function_body */
9314 {
9316 tree body;
9318 tree compound_stmt;
9319 tree cap;
9321 /* Let the front end know that we are going to be defining this
9322 function. */
9324 NULL_TREE,
9333 /* Push the proxies for any explicit captures. */
9340 /* 5.1.1.4 of the standard says:
9341 If a lambda-expression does not include a trailing-return-type, it
9342 is as if the trailing-return-type denotes the following type:
9343 * if the compound-statement is of the form
9344 { return attribute-specifier [opt] expression ; }
9345 the type of the returned expression after lvalue-to-rvalue
9346 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9347 (_conv.array_ 4.2), and function-to-pointer conversion
9348 (_conv.func_ 4.3);
9349 * otherwise, void. */
9351 /* In a lambda that has neither a lambda-return-type-clause
9352 nor a deducible form, errors should be reported for return statements
9353 in the body. Since we used void as the placeholder return type, parsing
9354 the body as usual will give such desired behavior. */
9358 {
9362 /* Parse tentatively in case there's more after the initial return
9363 statement. */
9374 {
9378 /* Will get error here if type not deduced yet. */
9382 }
9383 }
9386 {
9391 }
9395 out:
9399 /* Finish the function and generate code for it if necessary. */
9402 /* Only expand if the call op is not a template. */
9405 }
9410 else
9412 }
9414 /* Statements [gram.stmt.stmt] */
9416 /* Parse a statement.
9418 statement:
9419 labeled-statement
9420 expression-statement
9421 compound-statement
9422 selection-statement
9423 iteration-statement
9424 jump-statement
9425 declaration-statement
9426 try-block
9428 C++11:
9430 statement:
9431 labeled-statement
9432 attribute-specifier-seq (opt) expression-statement
9433 attribute-specifier-seq (opt) compound-statement
9434 attribute-specifier-seq (opt) selection-statement
9435 attribute-specifier-seq (opt) iteration-statement
9436 attribute-specifier-seq (opt) jump-statement
9437 declaration-statement
9438 attribute-specifier-seq (opt) try-block
9440 TM Extension:
9442 statement:
9443 atomic-statement
9445 IN_COMPOUND is true when the statement is nested inside a
9446 cp_parser_compound_statement; this matters for certain pragmas.
9448 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9449 is a (possibly labeled) if statement which is not enclosed in braces
9450 and has an else clause. This is used to implement -Wparentheses. */
9452 static void
9455 {
9460 restart:
9463 /* There is no statement yet. */
9469 /* In obj-c++, seeing '[[' might be the either the beginning of
9470 c++11 attributes, or a nested objc-message-expression. So
9471 let's parse the c++11 attributes tentatively. */
9475 {
9478 }
9480 /* Peek at the next token. */
9482 /* Remember the location of the first token in the statement. */
9484 /* If this is a keyword, then that will often determine what kind of
9485 statement we have. */
9487 {
9491 {
9494 /* Looks like a labeled-statement with a case label.
9495 Parse the label, and then use tail recursion to parse
9496 the statement. */
9521 {
9526 }
9527 else
9528 {
9532 }
9536 /* Objective-C++ exception-handling constructs. */
9550 /* This must be a namespace alias definition. */
9563 /* It might be a keyword like `int' that can start a
9564 declaration-statement. */
9566 }
9567 }
9569 {
9570 /* If the next token is a `:', then we are looking at a
9571 labeled-statement. */
9574 {
9575 /* Looks like a labeled-statement with an ordinary label.
9576 Parse the label, and then use tail recursion to parse
9577 the statement. */
9581 }
9582 }
9583 /* Anything that starts with a `{' must be a compound-statement. */
9586 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9587 a statement all its own. */
9589 {
9590 /* Only certain OpenMP pragmas are attached to statements, and thus
9591 are considered statements themselves. All others are not. In
9592 the context of a compound, accept the pragma as a "statement" and
9593 return so that we can check for a close brace. Otherwise we
9594 require a real statement and must go back and read one. */
9600 }
9602 {
9605 }
9607 /* Everything else must be a declaration-statement or an
9608 expression-statement. Try for the declaration-statement
9609 first, unless we are looking at a `;', in which case we know that
9610 we have an expression-statement. */
9612 {
9614 {
9616 {
9617 /* Attributes should be parsed as part of the the
9618 declaration, so let's un-parse them. */
9621 }
9624 /* Try to parse the declaration-statement. */
9626 /* If that worked, we're done. */
9629 }
9630 /* Look for an expression-statement instead. */
9632 }
9634 /* Set the line number for the statement. */
9638 /* Note that for now, we don't do anything with c++11 statements
9639 parsed at this level. */
9642 OPT_Wattributes,
9644 }
9646 /* Parse the label for a labeled-statement, i.e.
9648 identifier :
9649 case constant-expression :
9650 default :
9652 GNU Extension:
9653 case constant-expression ... constant-expression : statement
9655 When a label is parsed without errors, the label is added to the
9656 parse tree by the finish_* functions, so this function doesn't
9657 have to return the label. */
9659 static void
9661 {
9666 /* The next token should be an identifier. */
9670 {
9673 }
9677 {
9679 {
9683 /* Consume the `case' token. */
9685 /* Parse the constant-expression. */
9688 NULL);
9692 {
9693 /* Consume the `...' token. */
9695 expr_hi =
9698 NULL);
9699 /* We don't need to emit warnings here, as the common code
9700 will do this for us. */
9701 }
9702 else
9707 else
9710 expr);
9711 }
9715 /* Consume the `default' token. */
9720 else
9725 /* Anything else must be an ordinary label. */
9728 }
9730 /* Require the `:' token. */
9733 /* An ordinary label may optionally be followed by attributes.
9734 However, this is only permitted if the attributes are then
9735 followed by a semicolon. This is because, for backward
9736 compatibility, when parsing
9737 lab: __attribute__ ((unused)) int i;
9738 we want the attribute to attach to "i", not "lab". */
9741 {
9742 tree attrs;
9749 ;
9750 else
9752 }
9758 }
9760 /* Parse an expression-statement.
9762 expression-statement:
9763 expression [opt] ;
9765 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9766 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9767 indicates whether this expression-statement is part of an
9768 expression statement. */
9770 static tree
9772 {
9776 /* If the next token is a ';', then there is no expression
9777 statement. */
9779 {
9783 {
9786 }
9787 }
9789 /* Give a helpful message for "A<T>::type t;" and the like. */
9792 {
9799 {
9800 /* A::A a; */
9805 }
9806 }
9808 /* Consume the final `;'. */
9813 /* This is the final expression statement of a statement
9814 expression. */
9820 }
9822 /* Parse a compound-statement.
9824 compound-statement:
9825 { statement-seq [opt] }
9827 GNU extension:
9829 compound-statement:
9830 { label-declaration-seq [opt] statement-seq [opt] }
9832 label-declaration-seq:
9833 label-declaration
9834 label-declaration-seq label-declaration
9836 Returns a tree representing the statement. */
9838 static tree
9841 {
9842 tree compound_stmt;
9844 /* Consume the `{'. */
9851 /* Begin the compound-statement. */
9853 /* If the next keyword is `__label__' we have a label declaration. */
9856 /* Parse an (optional) statement-seq. */
9858 /* Finish the compound-statement. */
9860 /* Consume the `}'. */
9864 }
9866 /* Parse an (optional) statement-seq.
9868 statement-seq:
9869 statement
9870 statement-seq [opt] statement */
9872 static void
9874 {
9875 /* Scan statements until there aren't any more. */
9877 {
9880 /* If we are looking at a `}', then we have run out of
9881 statements; the same is true if we have reached the end
9882 of file, or have stumbled upon a stray '@end'. */
9889 /* If we are in a compound statement and find 'else' then
9890 something went wrong. */
9892 {
9895 else
9896 {
9899 }
9900 }
9902 /* Parse the statement. */
9904 }
9905 }
9907 /* Parse a selection-statement.
9909 selection-statement:
9910 if ( condition ) statement
9911 if ( condition ) statement else statement
9912 switch ( condition ) statement
9914 Returns the new IF_STMT or SWITCH_STMT.
9916 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9917 is a (possibly labeled) if statement which is not enclosed in
9918 braces and has an else clause. This is used to implement
9919 -Wparentheses. */
9921 static tree
9923 {
9930 /* Peek at the next token. */
9933 /* See what kind of keyword it is. */
9936 {
9939 {
9940 tree statement;
9941 tree condition;
9943 /* Look for the `('. */
9945 {
9948 }
9950 /* Begin the selection-statement. */
9953 else
9956 /* Parse the condition. */
9958 /* Look for the `)'. */
9964 {
9968 /* Add the condition. */
9971 /* Parse the then-clause. */
9975 {
9983 }
9984 else
9990 /* If the next token is `else', parse the else-clause. */
9992 RID_ELSE))
9993 {
9994 /* Consume the `else' keyword. */
9997 /* Parse the else-clause. */
9999 {
10000 location_t loc;
10007 }
10008 else
10013 /* If we are currently parsing a then-clause, then
10014 IF_P will not be NULL. We set it to true to
10015 indicate that this if statement has an else clause.
10016 This may trigger the Wparentheses warning below
10017 when we get back up to the parent if statement. */
10020 }
10021 else
10022 {
10023 /* This if statement does not have an else clause. If
10024 NESTED_IF is true, then the then-clause is an if
10025 statement which does have an else clause. We warn
10026 about the potential ambiguity. */
10029 "suggest explicit braces to avoid ambiguous"
10031 }
10033 /* Now we're all done with the if-statement. */
10035 }
10036 else
10037 {
10041 /* Add the condition. */
10044 /* Parse the body of the switch-statement. */
10053 /* Now we're all done with the switch-statement. */
10055 }
10058 }
10064 }
10065 }
10067 /* Parse a condition.
10069 condition:
10070 expression
10071 type-specifier-seq declarator = initializer-clause
10072 type-specifier-seq declarator braced-init-list
10074 GNU Extension:
10076 condition:
10077 type-specifier-seq declarator asm-specification [opt]
10078 attributes [opt] = assignment-expression
10080 Returns the expression that should be tested. */
10082 static tree
10084 {
10085 cp_decl_specifier_seq type_specifiers;
10089 /* Try the declaration first. */
10091 /* New types are not allowed in the type-specifier-seq for a
10092 condition. */
10094 parser->type_definition_forbidden_message
10096 /* Parse the type-specifier-seq. */
10098 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10101 /* Restore the saved message. */
10103 /* If all is well, we might be looking at a declaration. */
10105 {
10106 tree decl;
10107 tree asm_specification;
10108 tree attributes;
10112 /* Parse the declarator. */
10118 /* Parse the attributes. */
10120 /* Parse the asm-specification. */
10122 /* If the next token is not an `=' or '{', then we might still be
10123 looking at an expression. For example:
10125 if (A(a).x)
10127 looks like a decl-specifier-seq and a declarator -- but then
10128 there is no `=', so this is an expression. */
10133 /* If we did see an `=' or '{', then we are looking at a declaration
10134 for sure. */
10136 {
10137 tree pushed_scope;
10141 /* Create the declaration. */
10147 /* Parse the initializer. */
10149 {
10153 }
10154 else
10155 {
10156 /* Consume the `='. */
10159 }
10163 /* Process the initializer. */
10166 asm_specification,
10167 flags);
10173 }
10174 }
10175 /* If we didn't even get past the declarator successfully, we are
10176 definitely not looking at a declaration. */
10177 else
10180 /* Otherwise, we are looking at an expression. */
10182 }
10184 /* Parses a for-statement or range-for-statement until the closing ')',
10185 not included. */
10187 static tree
10189 {
10193 /* Begin the for-statement. */
10196 /* Parse the initialization. */
10201 else
10203 }
10205 static tree
10207 {
10208 /* Normal for loop */
10211 tree stmt;
10214 /* The for-init-statement has already been parsed in
10215 cp_parser_for_init_statement, so no work is needed here. */
10218 /* If there's a condition, process it. */
10222 {
10226 }
10228 /* Look for the `;'. */
10231 /* If there's an expression, process it. */
10237 }
10239 /* Tries to parse a range-based for-statement:
10241 range-based-for:
10242 decl-specifier-seq declarator : expression
10244 The decl-specifier-seq declarator and the `:' are already parsed by
10245 cp_parser_for_init_statement. If processing_template_decl it returns a
10246 newly created RANGE_FOR_STMT; if not, it is converted to a
10247 regular FOR_STMT. */
10249 static tree
10252 {
10256 {
10259 }
10260 else
10263 /* If in template, STMT is converted to a normal for-statement
10264 at instantiation. If not, it is done just ahead. */
10266 {
10274 /* do_auto_deduction doesn't mess with template init-lists. */
10277 }
10278 else
10279 {
10282 }
10284 }
10286 /* Subroutine of cp_convert_range_for: given the initializer expression,
10287 builds up the range temporary. */
10289 static tree
10291 {
10294 /* Find out the type deduced by the declaration
10295 `auto &&__range = range_expr'. */
10300 /* Create the __range variable. */
10307 }
10309 /* Used by cp_parser_range_for in template context: we aren't going to
10310 do a full conversion yet, but we still need to resolve auto in the
10311 type of the for-range-declaration if present. This is basically
10312 a shortcut version of cp_convert_range_for. */
10314 static void
10316 {
10319 {
10322 iter_type = (cp_parser_perform_range_for_lookup
10325 {
10327 iter_type);
10329 tf_warning_or_error);
10332 }
10333 }
10334 }
10336 /* Converts a range-based for-statement into a normal
10337 for-statement, as per the definition.
10339 for (RANGE_DECL : RANGE_EXPR)
10340 BLOCK
10342 should be equivalent to:
10344 {
10345 auto &&__range = RANGE_EXPR;
10346 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10347 __begin != __end;
10348 ++__begin)
10349 {
10350 RANGE_DECL = *__begin;
10351 BLOCK
10352 }
10353 }
10355 If RANGE_EXPR is an array:
10356 BEGIN_EXPR = __range
10357 END_EXPR = __range + ARRAY_SIZE(__range)
10358 Else if RANGE_EXPR has a member 'begin' or 'end':
10359 BEGIN_EXPR = __range.begin()
10360 END_EXPR = __range.end()
10361 Else:
10362 BEGIN_EXPR = begin(__range)
10363 END_EXPR = end(__range);
10365 If __range has a member 'begin' but not 'end', or vice versa, we must
10366 still use the second alternative (it will surely fail, however).
10367 When calling begin()/end() in the third alternative we must use
10368 argument dependent lookup, but always considering 'std' as an associated
10369 namespace. */
10371 tree
10374 {
10380 /* If an error happened previously do nothing or else a lot of
10381 unhelpful errors would be issued. */
10383 else
10384 {
10385 tree range_temp;
10389 /* Can't bind a reference to an array of runtime bound. */
10391 else
10392 {
10397 LOOKUP_ONLYCONVERTING);
10399 }
10402 }
10404 /* The new for initialization statement. */
10412 LOOKUP_ONLYCONVERTING);
10421 LOOKUP_ONLYCONVERTING);
10425 /* The new for condition. */
10432 /* The new increment expression. */
10435 tf_warning_or_error);
10438 /* The declaration is initialized with *__begin inside the loop body. */
10441 tf_warning_or_error),
10443 LOOKUP_ONLYCONVERTING);
10446 }
10448 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10449 We need to solve both at the same time because the method used
10450 depends on the existence of members begin or end.
10451 Returns the type deduced for the iterator expression. */
10453 static tree
10455 {
10457 {
10460 }
10463 {
10468 }
10470 {
10471 /* If RANGE is an array, we will use pointer arithmetic. */
10474 range,
10478 }
10479 else
10480 {
10481 /* If it is not an array, we must do a bit of magic. */
10491 tf_warning_or_error);
10494 tf_warning_or_error);
10497 {
10498 /* Use the member functions. */
10501 else
10507 else
10510 }
10511 else
10512 {
10513 /* Use global functions with ADL. */
10520 tf_warning_or_error);
10522 tf_warning_or_error);
10524 tf_warning_or_error);
10526 tf_warning_or_error);
10529 }
10531 /* Last common checks. */
10533 {
10534 /* If one of the expressions is an error do no more checks. */
10537 }
10540 /* Can happen, when, eg, in a template context, Koenig lookup
10541 can't resolve begin/end (c++/58503). */
10543 else
10544 {
10546 /* The unqualified type of the __begin and __end temporaries should
10547 be the same, as required by the multiple auto declaration. */
10553 }
10554 }
10555 }
10557 /* Helper function for cp_parser_perform_range_for_lookup.
10558 Builds a tree for RANGE.IDENTIFIER(). */
10560 static tree
10562 {
10575 tf_warning_or_error);
10578 }
10580 /* Parse an iteration-statement.
10582 iteration-statement:
10583 while ( condition ) statement
10584 do statement while ( expression ) ;
10585 for ( for-init-statement condition [opt] ; expression [opt] )
10586 statement
10588 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10590 static tree
10592 {
10595 tree statement;
10598 /* Peek at the next token. */
10603 /* Remember whether or not we are already within an iteration
10604 statement. */
10607 /* See what kind of keyword it is. */
10610 {
10612 {
10613 tree condition;
10615 /* Begin the while-statement. */
10617 /* Look for the `('. */
10619 /* Parse the condition. */
10622 /* Look for the `)'. */
10624 /* Parse the dependent statement. */
10628 /* We're done with the while-statement. */
10630 }
10634 {
10635 tree expression;
10637 /* Begin the do-statement. */
10639 /* Parse the body of the do-statement. */
10644 /* Look for the `while' keyword. */
10646 /* Look for the `('. */
10648 /* Parse the expression. */
10650 /* We're done with the do-statement. */
10652 /* Look for the `)'. */
10654 /* Look for the `;'. */
10656 }
10660 {
10661 /* Look for the `('. */
10666 /* Look for the `)'. */
10669 /* Parse the body of the for-statement. */
10674 /* We're done with the for-statement. */
10676 }
10683 }
10686 }
10688 /* Parse a for-init-statement or the declarator of a range-based-for.
10689 Returns true if a range-based-for declaration is seen.
10691 for-init-statement:
10692 expression-statement
10693 simple-declaration */
10695 static bool
10697 {
10698 /* If the next token is a `;', then we have an empty
10699 expression-statement. Grammatically, this is also a
10700 simple-declaration, but an invalid one, because it does not
10701 declare anything. Therefore, if we did not handle this case
10702 specially, we would issue an error message about an invalid
10703 declaration. */
10705 {
10711 {
10712 /* N3994 -- for (id : init) ... */
10715 "type-specifier only available with "
10723 }
10725 /* A colon is used in range-based for. */
10728 /* We're going to speculatively look for a declaration, falling back
10729 to an expression, if necessary. */
10731 /* Parse the declaration. */
10734 decl);
10737 {
10738 /* It is a range-for, consume the ':' */
10742 {
10744 "range-based %<for%> loops only available with "
10747 }
10748 }
10749 else
10750 /* The ';' is not consumed yet because we told
10751 cp_parser_simple_declaration not to. */
10756 /* If the tentative parse failed, then we shall need to look for an
10757 expression-statement. */
10758 }
10759 /* If we are here, it is an expression-statement. */
10762 }
10764 /* Parse a jump-statement.
10766 jump-statement:
10767 break ;
10768 continue ;
10769 return expression [opt] ;
10770 return braced-init-list ;
10771 goto identifier ;
10773 GNU extension:
10775 jump-statement:
10776 goto * expression ;
10778 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10780 static tree
10782 {
10788 /* Peek at the next token. */
10793 /* See what kind of keyword it is. */
10796 {
10800 {
10820 }
10826 {
10833 /* Fall through. */
10843 }
10848 {
10849 tree expr;
10853 {
10857 }
10860 else
10861 /* If the next token is a `;', then there is no
10862 expression. */
10864 /* Build the return-statement. */
10866 /* Look for the final `;'. */
10868 }
10872 /* Create the goto-statement. */
10874 {
10875 /* Issue a warning about this use of a GNU extension. */
10877 /* Consume the '*' token. */
10879 /* Parse the dependent expression. */
10881 }
10882 else
10884 /* Look for the final `;'. */
10891 }
10894 }
10896 /* Parse a declaration-statement.
10898 declaration-statement:
10899 block-declaration */
10901 static void
10903 {
10906 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10909 /* Parse the block-declaration. */
10912 /* Free any declarators allocated. */
10914 }
10916 /* Some dependent statements (like `if (cond) statement'), are
10917 implicitly in their own scope. In other words, if the statement is
10918 a single statement (as opposed to a compound-statement), it is
10919 none-the-less treated as if it were enclosed in braces. Any
10920 declarations appearing in the dependent statement are out of scope
10921 after control passes that point. This function parses a statement,
10922 but ensures that is in its own scope, even if it is not a
10923 compound-statement.
10925 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10926 is a (possibly labeled) if statement which is not enclosed in
10927 braces and has an else clause. This is used to implement
10928 -Wparentheses.
10930 Returns the new statement. */
10932 static tree
10934 {
10935 tree statement;
10940 /* Mark if () ; with a special NOP_EXPR. */
10942 {
10946 }
10947 /* if a compound is opened, we simply parse the statement directly. */
10950 /* If the token is not a `{', then we must take special action. */
10951 else
10952 {
10953 /* Create a compound-statement. */
10955 /* Parse the dependent-statement. */
10957 /* Finish the dummy compound-statement. */
10959 }
10961 /* Return the statement. */
10963 }
10965 /* For some dependent statements (like `while (cond) statement'), we
10966 have already created a scope. Therefore, even if the dependent
10967 statement is a compound-statement, we do not want to create another
10968 scope. */
10970 static void
10972 {
10973 /* If the token is a `{', then we must take special action. */
10976 else
10977 {
10978 /* Avoid calling cp_parser_compound_statement, so that we
10979 don't create a new scope. Do everything else by hand. */
10981 /* If the next keyword is `__label__' we have a label declaration. */
10984 /* Parse an (optional) statement-seq. */
10987 }
10988 }
10990 /* Declarations [gram.dcl.dcl] */
10992 /* Parse an optional declaration-sequence.
10994 declaration-seq:
10995 declaration
10996 declaration-seq declaration */
10998 static void
11000 {
11002 {
11013 {
11014 /* A declaration consisting of a single semicolon is
11015 invalid. Allow it unless we're being pedantic. */
11020 }
11022 /* If we're entering or exiting a region that's implicitly
11023 extern "C", modify the lang context appropriately. */
11025 {
11028 }
11030 {
11033 }
11036 {
11037 /* A top-level declaration can consist solely of a #pragma.
11038 A nested declaration cannot, so this is done here and not
11039 in cp_parser_declaration. (A #pragma at block scope is
11040 handled in cp_parser_statement.) */
11043 }
11045 /* Parse the declaration itself. */
11047 }
11048 }
11050 /* Parse a declaration.
11052 declaration:
11053 block-declaration
11054 function-definition
11055 template-declaration
11056 explicit-instantiation
11057 explicit-specialization
11058 linkage-specification
11059 namespace-definition
11061 GNU extension:
11063 declaration:
11064 __extension__ declaration */
11066 static void
11068 {
11069 cp_token token1;
11070 cp_token token2;
11075 /* Check for the `__extension__' keyword. */
11077 {
11078 /* Parse the qualified declaration. */
11080 /* Restore the PEDANTIC flag. */
11084 }
11086 /* Try to figure out what kind of declaration is present. */
11091 else
11092 {
11095 }
11097 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11100 /* If the next token is `extern' and the following token is a string
11101 literal, then we have a linkage specification. */
11105 /* If the next token is `template', then we have either a template
11106 declaration, an explicit instantiation, or an explicit
11107 specialization. */
11109 {
11110 /* `template <>' indicates a template specialization. */
11114 /* `template <' indicates a template declaration. */
11117 /* Anything else must be an explicit instantiation. */
11118 else
11120 }
11121 /* If the next token is `export', then we have a template
11122 declaration. */
11125 /* If the next token is `extern', 'static' or 'inline' and the one
11126 after that is `template', we have a GNU extended explicit
11127 instantiation directive. */
11134 /* If the next token is `namespace', check for a named or unnamed
11135 namespace definition. */
11141 /* An unnamed namespace definition. */
11145 /* An inline (associated) namespace definition. */
11149 /* Objective-C++ declaration/definition. */
11156 /* We must have either a block declaration or a function
11157 definition. */
11158 else
11159 /* Try to parse a block-declaration, or a function-definition. */
11162 /* Free any declarators allocated. */
11164 }
11166 /* Parse a block-declaration.
11168 block-declaration:
11169 simple-declaration
11170 asm-definition
11171 namespace-alias-definition
11172 using-declaration
11173 using-directive
11175 GNU Extension:
11177 block-declaration:
11178 __extension__ block-declaration
11180 C++0x Extension:
11182 block-declaration:
11183 static_assert-declaration
11185 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11186 part of a declaration-statement. */
11188 static void
11191 {
11195 /* Check for the `__extension__' keyword. */
11197 {
11198 /* Parse the qualified declaration. */
11200 /* Restore the PEDANTIC flag. */
11204 }
11206 /* Peek at the next token to figure out which kind of declaration is
11207 present. */
11210 /* If the next keyword is `asm', we have an asm-definition. */
11212 {
11216 }
11217 /* If the next keyword is `namespace', we have a
11218 namespace-alias-definition. */
11221 /* If the next keyword is `using', we have a
11222 using-declaration, a using-directive, or an alias-declaration. */
11224 {
11229 /* If the token after `using' is `namespace', then we have a
11230 using-directive. */
11234 /* If the second token after 'using' is '=', then we have an
11235 alias-declaration. */
11241 /* Otherwise, it's a using-declaration. */
11242 else
11245 }
11246 /* If the next keyword is `__label__' we have a misplaced label
11247 declaration. */
11249 {
11253 /* If the next token is now a `;', consume it. */
11256 }
11257 /* If the next token is `static_assert' we have a static assertion. */
11260 /* Anything else must be a simple-declaration. */
11261 else
11264 }
11266 /* Parse a simple-declaration.
11268 simple-declaration:
11269 decl-specifier-seq [opt] init-declarator-list [opt] ;
11271 init-declarator-list:
11272 init-declarator
11273 init-declarator-list , init-declarator
11275 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11276 function-definition as a simple-declaration.
11278 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11279 parsed declaration if it is an uninitialized single declarator not followed
11280 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11281 if present, will not be consumed. */
11283 static void
11287 {
11288 cp_decl_specifier_seq decl_specifiers;
11295 /* Defer access checks until we know what is being declared; the
11296 checks for names appearing in the decl-specifier-seq should be
11297 done as if we were in the scope of the thing being declared. */
11300 /* Parse the decl-specifier-seq. We have to keep track of whether
11301 or not the decl-specifier-seq declares a named class or
11302 enumeration type, since that is the only case in which the
11303 init-declarator-list is allowed to be empty.
11305 [dcl.dcl]
11307 In a simple-declaration, the optional init-declarator-list can be
11308 omitted only when declaring a class or enumeration, that is when
11309 the decl-specifier-seq contains either a class-specifier, an
11310 elaborated-type-specifier, or an enum-specifier. */
11312 CP_PARSER_FLAGS_OPTIONAL,
11315 /* We no longer need to defer access checks. */
11318 /* In a block scope, a valid declaration must always have a
11319 decl-specifier-seq. By not trying to parse declarators, we can
11320 resolve the declaration/expression ambiguity more quickly. */
11323 {
11326 }
11328 /* If the next two tokens are both identifiers, the code is
11329 erroneous. The usual cause of this situation is code like:
11331 T t;
11333 where "T" should name a type -- but does not. */
11336 {
11337 /* If parsing tentatively, we should commit; we really are
11338 looking at a declaration. */
11340 /* Give up. */
11342 }
11344 /* If we have seen at least one decl-specifier, and the next token
11345 is not a parenthesis, then we must be looking at a declaration.
11346 (After "int (" we might be looking at a functional cast.) */
11353 /* Keep going until we hit the `;' at the end of the simple
11354 declaration. */
11357 CPP_SEMICOLON))
11358 {
11361 tree decl;
11364 {
11365 /* If we are processing next declarator, coma is expected */
11371 }
11372 else
11375 /* Parse the init-declarator. */
11378 function_definition_allowed_p,
11380 declares_class_or_enum,
11382 maybe_range_for_decl);
11383 /* If an error occurred while parsing tentatively, exit quickly.
11384 (That usually happens when in the body of a function; each
11385 statement is treated as a declaration-statement until proven
11386 otherwise.) */
11389 /* Handle function definitions specially. */
11391 {
11392 /* If the next token is a `,', then we are probably
11393 processing something like:
11395 void f() {}, *p;
11397 which is erroneous. */
11399 {
11402 "mixing"
11404 }
11405 /* Otherwise, we're done with the list of declarators. */
11406 else
11407 {
11410 }
11411 }
11414 /* The next token should be either a `,' or a `;'. */
11416 /* If it's a `,', there are more declarators to come. */
11419 /* If it's a `;', we are done. */
11422 /* Anything else is an error. */
11423 else
11424 {
11425 /* If we have already issued an error message we don't need
11426 to issue another one. */
11430 /* Skip tokens until we reach the end of the statement. */
11432 /* If the next token is now a `;', consume it. */
11436 }
11437 /* After the first time around, a function-definition is not
11438 allowed -- even if it was OK at first. For example:
11440 int i, f() {}
11442 is not valid. */
11444 }
11446 /* Issue an error message if no declarators are present, and the
11447 decl-specifier-seq does not itself declare a class or
11448 enumeration: [dcl.dcl]/3. */
11450 {
11452 {
11456 /* Ensure an error is issued anyway when finish_decltype_type,
11457 called via cp_parser_decl_specifier_seq, returns a class or
11458 an enumeration (c++/51786). */
11461 }
11462 /* Perform any deferred access checks. */
11464 }
11466 /* Consume the `;'. */
11470 done:
11472 }
11474 /* Parse a decl-specifier-seq.
11476 decl-specifier-seq:
11477 decl-specifier-seq [opt] decl-specifier
11478 decl-specifier attribute-specifier-seq [opt] (C++11)
11480 decl-specifier:
11481 storage-class-specifier
11482 type-specifier
11483 function-specifier
11484 friend
11485 typedef
11487 GNU Extension:
11489 decl-specifier:
11490 attributes
11492 Concepts Extension:
11494 decl-specifier:
11495 concept
11498 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11500 The parser flags FLAGS is used to control type-specifier parsing.
11502 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11503 flags:
11505 1: one of the decl-specifiers is an elaborated-type-specifier
11506 (i.e., a type declaration)
11507 2: one of the decl-specifiers is an enum-specifier or a
11508 class-specifier (i.e., a type definition)
11510 */
11512 static void
11514 cp_parser_flags flags,
11517 {
11521 cp_decl_spec ds;
11523 /* Clear DECL_SPECS. */
11526 /* Assume no class or enumeration type is declared. */
11529 /* Keep reading specifiers until there are no more to read. */
11531 {
11536 /* Peek at the next token. */
11539 /* Save the first token of the decl spec list for error
11540 reporting. */
11543 /* Handle attributes. */
11545 {
11546 /* Parse the attributes. */
11549 /* In a sequence of declaration specifiers, c++11 attributes
11550 appertain to the type that precede them. In that case
11551 [dcl.spec]/1 says:
11553 The attribute-specifier-seq affects the type only for
11554 the declaration it appears in, not other declarations
11555 involving the same type.
11557 But for now let's force the user to position the
11558 attribute either at the beginning of the declaration or
11559 after the declarator-id, which would clearly mean that it
11560 applies to the declarator. */
11562 {
11564 /* The c++11 attribute is at the beginning of the
11565 declaration. It appertains to the entity being
11567 else
11568 {
11570 {
11571 /* This is an attribute following a
11572 class-specifier. */
11577 }
11578 else
11579 {
11580 decl_specs->std_attributes
11582 attrs);
11585 }
11587 }
11588 }
11590 decl_specs->attributes
11592 attrs);
11596 }
11597 /* Assume we will find a decl-specifier keyword. */
11599 /* If the next token is an appropriate keyword, we can simply
11600 add it to the list. */
11602 {
11603 /* decl-specifier:
11604 friend
11605 constexpr */
11608 {
11611 }
11612 else
11613 {
11615 /* Consume the token. */
11617 }
11630 /* function-specifier:
11631 inline
11632 virtual
11633 explicit */
11640 /* decl-specifier:
11641 typedef */
11644 /* Consume the token. */
11646 /* A constructor declarator cannot appear in a typedef. */
11648 /* The "typedef" keyword can only occur in a declaration; we
11649 may as well commit at this point. */
11656 /* storage-class-specifier:
11657 auto
11658 register
11659 static
11660 extern
11661 mutable
11663 GNU Extension:
11664 thread */
11667 {
11668 /* Consume the token. */
11671 /* Complain about `auto' as a storage specifier, if
11672 we're complaining about C++0x compatibility. */
11676 /* Set the storage class anyway. */
11678 token);
11679 }
11680 else
11681 /* C++0x auto type-specifier. */
11689 /* Consume the token. */
11692 token);
11695 /* Consume the token. */
11701 /* We did not yet find a decl-specifier yet. */
11704 }
11714 /* Constructors are a special case. The `S' in `S()' is not a
11715 decl-specifier; it is the beginning of the declarator. */
11716 constructor_p
11717 = (!found_decl_spec
11718 && constructor_possible_p
11719 && (cp_parser_constructor_declarator_p
11722 /* If we don't have a DECL_SPEC yet, then we must be looking at
11723 a type-specifier. */
11725 {
11728 tree type_spec;
11730 type_spec
11732 decl_specs,
11738 /* If this type-specifier referenced a user-defined type
11739 (a typedef, class-name, etc.), then we can't allow any
11740 more such type-specifiers henceforth.
11742 [dcl.spec]
11744 The longest sequence of decl-specifiers that could
11745 possibly be a type name is taken as the
11746 decl-specifier-seq of a declaration. The sequence shall
11747 be self-consistent as described below.
11749 [dcl.type]
11751 As a general rule, at most one type-specifier is allowed
11752 in the complete decl-specifier-seq of a declaration. The
11753 only exceptions are the following:
11755 -- const or volatile can be combined with any other
11756 type-specifier.
11758 -- signed or unsigned can be combined with char, long,
11759 short, or int.
11761 -- ..
11763 Example:
11765 typedef char* Pc;
11766 void g (const int Pc);
11768 Here, Pc is *not* part of the decl-specifier seq; it's
11769 the declarator. Therefore, once we see a type-specifier
11770 (other than a cv-qualifier), we forbid any additional
11771 user-defined types. We *do* still allow things like `int
11772 int' to be considered a decl-specifier-seq, and issue the
11773 error message later. */
11776 /* A constructor declarator cannot follow a type-specifier. */
11778 {
11783 }
11784 }
11786 /* If we still do not have a DECL_SPEC, then there are no more
11787 decl-specifiers. */
11792 /* After we see one decl-specifier, further decl-specifiers are
11793 always optional. */
11795 }
11797 /* Don't allow a friend specifier with a class definition. */
11802 }
11804 /* Parse an (optional) storage-class-specifier.
11806 storage-class-specifier:
11807 auto
11808 register
11809 static
11810 extern
11811 mutable
11813 GNU Extension:
11815 storage-class-specifier:
11816 thread
11818 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11820 static tree
11822 {
11824 {
11828 /* Fall through for C++98. */
11835 /* Consume the token. */
11840 }
11841 }
11843 /* Parse an (optional) function-specifier.
11845 function-specifier:
11846 inline
11847 virtual
11848 explicit
11850 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11851 Updates DECL_SPECS, if it is non-NULL. */
11853 static tree
11856 {
11859 {
11865 /* 14.5.2.3 [temp.mem]
11867 A member function template shall not be virtual. */
11870 else
11880 }
11882 /* Consume the token. */
11884 }
11886 /* Parse a linkage-specification.
11888 linkage-specification:
11889 extern string-literal { declaration-seq [opt] }
11890 extern string-literal declaration */
11892 static void
11894 {
11895 tree linkage;
11897 /* Look for the `extern' keyword. */
11900 /* Look for the string-literal. */
11903 /* Transform the literal into an identifier. If the literal is a
11904 wide-character string, or contains embedded NULs, then we can't
11905 handle it as the user wants. */
11908 {
11910 /* Assume C++ linkage. */
11912 }
11913 else
11916 /* We're now using the new linkage. */
11919 /* If the next token is a `{', then we're using the first
11920 production. */
11922 {
11925 /* Consume the `{' token. */
11927 /* Parse the declarations. */
11929 /* Look for the closing `}'. */
11931 }
11932 /* Otherwise, there's just one declaration. */
11933 else
11934 {
11937 saved_in_unbraced_linkage_specification_p
11941 parser->in_unbraced_linkage_specification_p
11943 }
11945 /* We're done with the linkage-specification. */
11947 }
11949 /* Parse a static_assert-declaration.
11951 static_assert-declaration:
11952 static_assert ( constant-expression , string-literal ) ;
11954 If MEMBER_P, this static_assert is a class member. */
11956 static void
11958 {
11959 tree condition;
11960 tree message;
11962 location_t saved_loc;
11965 /* Peek at the `static_assert' token so we can keep track of exactly
11966 where the static assertion started. */
11970 /* Look for the `static_assert' keyword. */
11972 RT_STATIC_ASSERT))
11975 /* We know we are in a static assertion; commit to any tentative
11976 parse. */
11980 /* Parse the `(' starting the static assertion condition. */
11983 /* Parse the constant-expression. Allow a non-constant expression
11984 here in order to give better diagnostics in finish_static_assert. */
11985 condition =
11990 /* Parse the separating `,'. */
11993 /* Parse the string-literal message. */
11998 /* A `)' completes the static assertion. */
12005 /* A semicolon terminates the declaration. */
12008 /* Complete the static assertion, which may mean either processing
12009 the static assert now or saving it for template instantiation. */
12011 }
12013 /* Parse the expression in decltype ( expression ). */
12015 static tree
12018 {
12020 tree expr;
12022 /* First, try parsing an id-expression. */
12033 {
12036 cp_id_kind idk;
12040 /* Lookup the name we got back from the id-expression. */
12051 {
12052 /* Complete lookup of the id-expression. */
12053 expr = (finish_id_expression
12066 /* We found an id-expression, but it was something that we
12067 should not have found. This is an error, not something
12068 we can recover from, so note that we found an
12069 id-expression and we'll recover as gracefully as
12070 possible. */
12072 }
12077 /* We have an id-expression. */
12079 }
12082 {
12083 /* Abort the id-expression parse. */
12086 /* Parsing tentatively, again. */
12089 /* Parse a class member access. */
12097 /* We have an id-expression. */
12099 }
12102 /* We have parsed the complete id-expression or member access. */
12104 else
12105 {
12106 /* Abort our attempt to parse an id-expression or member access
12107 expression. */
12110 /* Parse a full expression. */
12113 }
12116 }
12118 /* Parse a `decltype' type. Returns the type.
12120 simple-type-specifier:
12121 decltype ( expression )
12122 C++14 proposal:
12123 decltype ( auto ) */
12125 static tree
12127 {
12128 tree expr;
12137 {
12138 /* Already parsed. */
12141 }
12143 /* Look for the `decltype' token. */
12147 /* Parse the opening `('. */
12151 /* decltype (auto) */
12154 {
12161 }
12163 /* Types cannot be defined in a `decltype' expression. Save away the
12164 old message. */
12167 /* And create the new one. */
12168 parser->type_definition_forbidden_message
12171 /* The restrictions on constant-expressions do not apply inside
12172 decltype expressions. */
12173 saved_integral_constant_expression_p
12175 saved_non_integral_constant_expression_p
12179 /* Within a parenthesized expression, a `>' token is always
12180 the greater-than operator. */
12181 saved_greater_than_is_operator_p
12185 /* Do not actually evaluate the expression. */
12188 /* Do not warn about problems with the expression. */
12193 /* Go back to evaluating expressions. */
12197 /* The `>' token might be the end of a template-id or
12198 template-parameter-list now. */
12199 parser->greater_than_is_operator_p
12202 /* Restore the old message and the integral constant expression
12203 flags. */
12205 parser->integral_constant_expression_p
12207 parser->non_integral_constant_expression_p
12210 /* Parse to the closing `)'. */
12212 {
12216 }
12219 tf_warning_or_error);
12221 rewrite:
12222 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12223 it again. */
12230 }
12232 /* Special member functions [gram.special] */
12234 /* Parse a conversion-function-id.
12236 conversion-function-id:
12237 operator conversion-type-id
12239 Returns an IDENTIFIER_NODE representing the operator. */
12241 static tree
12243 {
12244 tree type;
12245 tree saved_scope;
12246 tree saved_qualifying_scope;
12247 tree saved_object_scope;
12250 /* Look for the `operator' token. */
12253 /* When we parse the conversion-type-id, the current scope will be
12254 reset. However, we need that information in able to look up the
12255 conversion function later, so we save it here. */
12259 /* We must enter the scope of the class so that the names of
12260 entities declared within the class are available in the
12261 conversion-type-id. For example, consider:
12263 struct S {
12264 typedef int I;
12265 operator I();
12266 };
12268 S::operator I() { ... }
12270 In order to see that `I' is a type-name in the definition, we
12271 must be in the scope of `S'. */
12274 /* Parse the conversion-type-id. */
12276 /* Leave the scope of the class, if any. */
12279 /* Restore the saved scope. */
12283 /* If the TYPE is invalid, indicate failure. */
12287 }
12289 /* Parse a conversion-type-id:
12291 conversion-type-id:
12292 type-specifier-seq conversion-declarator [opt]
12294 Returns the TYPE specified. */
12296 static tree
12298 {
12299 tree attributes;
12300 cp_decl_specifier_seq type_specifiers;
12302 tree type_specified;
12305 /* Parse the attributes. */
12309 parser->type_definition_forbidden_message
12312 /* Parse the type-specifiers. */
12319 /* If that didn't work, stop. */
12322 /* Parse the conversion-declarator. */
12330 /* Don't give this error when parsing tentatively. This happens to
12331 work because we always parse this definitively once. */
12334 {
12336 {
12339 }
12343 }
12346 }
12348 /* Parse an (optional) conversion-declarator.
12350 conversion-declarator:
12351 ptr-operator conversion-declarator [opt]
12353 */
12357 {
12360 cp_cv_quals cv_quals;
12362 /* We don't know if there's a ptr-operator next, or not. */
12364 /* Try the ptr-operator. */
12367 /* If it worked, look for more conversion-declarators. */
12369 {
12372 /* Parse another optional declarator. */
12375 declarator = cp_parser_make_indirect_declarator
12379 }
12382 }
12384 /* Parse an (optional) ctor-initializer.
12386 ctor-initializer:
12387 : mem-initializer-list
12389 Returns TRUE iff the ctor-initializer was actually present. */
12391 static bool
12393 {
12394 /* If the next token is not a `:', then there is no
12395 ctor-initializer. */
12397 {
12398 /* Do default initialization of any bases and members. */
12403 }
12405 /* Consume the `:' token. */
12407 /* And the mem-initializer-list. */
12411 }
12413 /* Parse a mem-initializer-list.
12415 mem-initializer-list:
12416 mem-initializer ... [opt]
12417 mem-initializer ... [opt] , mem-initializer-list */
12419 static void
12421 {
12426 /* Let the semantic analysis code know that we are starting the
12427 mem-initializer-list. */
12432 /* Loop through the list. */
12434 {
12435 tree mem_initializer;
12438 /* Parse the mem-initializer. */
12440 /* If the next token is a `...', we're expanding member initializers. */
12442 {
12443 /* Consume the `...'. */
12446 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12447 can be expanded but members cannot. */
12450 {
12455 }
12457 /* Construct the pack expansion type. */
12460 }
12463 {
12467 }
12468 /* Look for a target constructor. */
12472 {
12475 {
12479 }
12481 }
12482 /* Add it to the list, unless it was erroneous. */
12484 {
12487 }
12488 /* If the next token is not a `,', we're done. */
12491 /* Consume the `,' token. */
12493 }
12495 /* Perform semantic analysis. */
12498 }
12500 /* Parse a mem-initializer.
12502 mem-initializer:
12503 mem-initializer-id ( expression-list [opt] )
12504 mem-initializer-id braced-init-list
12506 GNU extension:
12508 mem-initializer:
12509 ( expression-list [opt] )
12511 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12512 class) or FIELD_DECL (for a non-static data member) to initialize;
12513 the TREE_VALUE is the expression-list. An empty initialization
12514 list is represented by void_list_node. */
12516 static tree
12518 {
12519 tree mem_initializer_id;
12520 tree expression_list;
12521 tree member;
12524 /* Find out what is being initialized. */
12526 {
12530 }
12531 else
12532 {
12536 }
12542 {
12549 }
12550 else
12551 {
12561 }
12571 }
12573 /* Parse a mem-initializer-id.
12575 mem-initializer-id:
12576 :: [opt] nested-name-specifier [opt] class-name
12577 identifier
12579 Returns a TYPE indicating the class to be initializer for the first
12580 production. Returns an IDENTIFIER_NODE indicating the data member
12581 to be initialized for the second production. */
12583 static tree
12585 {
12589 tree id;
12593 /* `typename' is not allowed in this context ([temp.res]). */
12595 {
12597 "keyword %<typename%> not allowed in this context (a qualified "
12600 }
12601 /* Look for the optional `::' operator. */
12602 global_scope_p
12606 /* Look for the optional nested-name-specifier. The simplest way to
12607 implement:
12609 [temp.res]
12611 The keyword `typename' is not permitted in a base-specifier or
12612 mem-initializer; in these contexts a qualified name that
12613 depends on a template-parameter is implicitly assumed to be a
12614 type name.
12616 is to assume that we have seen the `typename' keyword at this
12617 point. */
12618 nested_name_specifier_p
12627 /* If there is a `::' operator or a nested-name-specifier, then we
12628 are definitely looking for a class-name. */
12633 typename_type,
12637 /* Otherwise, we could also be looking for an ordinary identifier. */
12639 /* Try a class-name. */
12643 none_type,
12647 /* If we found one, we're done. */
12650 /* Otherwise, look for an ordinary identifier. */
12652 }
12654 /* Overloading [gram.over] */
12656 /* Parse an operator-function-id.
12658 operator-function-id:
12659 operator operator
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 {
12667 /* Look for the `operator' keyword. */
12670 /* And then the name of the operator itself. */
12672 }
12674 /* Return an identifier node for a user-defined literal operator.
12675 The suffix identifier is chained to the operator name identifier. */
12677 static tree
12679 {
12680 tree identifier;
12687 }
12689 /* Parse an operator.
12691 operator:
12692 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12693 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12694 || ++ -- , ->* -> () []
12696 GNU Extensions:
12698 operator:
12699 <? >? <?= >?=
12701 Returns an IDENTIFIER_NODE for the operator which is a
12702 human-readable spelling of the identifier, e.g., `operator +'. */
12704 static tree
12706 {
12711 /* Peek at the next token. */
12713 /* Figure out which operator we have. */
12715 {
12717 {
12720 /* The keyword should be either `new' or `delete'. */
12725 else
12728 /* Consume the `new' or `delete' token. */
12731 /* Peek at the next token. */
12733 /* If it's a `[' token then this is the array variant of the
12734 operator. */
12736 {
12737 /* Consume the `[' token. */
12739 /* Look for the `]' token. */
12743 }
12744 /* Otherwise, we have the non-array variant. */
12745 else
12749 }
12896 /* Consume the `('. */
12898 /* Look for the matching `)'. */
12903 /* Consume the `['. */
12905 /* Look for the matching `]'. */
12914 /* Fall through. */
12920 {
12923 }
12925 {
12928 }
12929 /* Consume the string. */
12931 /* Look for the suffix identifier. */
12934 {
12937 {
12940 }
12941 }
12943 {
12947 }
12948 else
12949 {
12952 }
12959 /* Fall through. */
12965 {
12968 }
12969 {
12972 {
12975 }
12977 /* Consume the user-defined string literal. */
12980 {
12983 }
12984 else
12986 }
12989 /* Anything else is an error. */
12991 }
12993 /* If we have selected an identifier, we need to consume the
12994 operator token. */
12997 /* Otherwise, no valid operator name was present. */
12998 else
12999 {
13002 }
13005 }
13007 /* Parse a template-declaration.
13009 template-declaration:
13010 export [opt] template < template-parameter-list > declaration
13012 If MEMBER_P is TRUE, this template-declaration occurs within a
13013 class-specifier.
13015 The grammar rule given by the standard isn't correct. What
13016 is really meant is:
13018 template-declaration:
13019 export [opt] template-parameter-list-seq
13020 decl-specifier-seq [opt] init-declarator [opt] ;
13021 export [opt] template-parameter-list-seq
13022 function-definition
13024 template-parameter-list-seq:
13025 template-parameter-list-seq [opt]
13026 template < template-parameter-list >
13028 Concept Extensions:
13030 template-parameter-list-seq:
13031 template < template-parameter-list > template-requirement [opt]
13033 template-requirement:
13034 requires logical-or-expression
13035 */
13037 static void
13039 {
13040 /* Check for `export'. */
13042 {
13043 /* Consume the `export' token. */
13045 /* Warn that we do not support `export'. */
13047 }
13050 }
13052 /* Parse a template-parameter-list.
13054 template-parameter-list:
13055 template-parameter
13056 template-parameter-list , template-parameter
13058 Returns a TREE_LIST. Each node represents a template parameter.
13059 The nodes are connected via their TREE_CHAINs. */
13061 static tree
13063 {
13068 /* The loop below parses the template parms. We first need to know
13069 the total number of template parms to be able to compute proper
13070 canonical types of each dependent type. So after the loop, when
13071 we know the total number of template parms,
13072 end_template_parm_list computes the proper canonical types and
13073 fixes up the dependent types accordingly. */
13075 {
13076 tree parameter;
13079 location_t parm_loc;
13081 /* Parse the template-parameter. */
13086 /* Add it to the list. */
13089 parm_loc,
13090 parameter,
13091 is_non_type,
13092 is_parameter_pack);
13093 else
13094 {
13097 }
13099 /* If the next token is not a `,', we're done. */
13102 /* Otherwise, consume the `,' token. */
13104 }
13107 }
13109 // Returns true if PARM declares a constrained-parameter.
13112 {
13120 }
13123 // Check that the type parameter is only a declarator-id, and that its
13124 // type is not cv-qualified.
13125 bool
13128 {
13129 // Don't ptr, ref, function, or array declarators for a constrained type
13130 // or templtae template parameter.
13132 {
13135 }
13137 // Don't allow cv-qualified type parameters.
13140 {
13143 }
13146 }
13148 // Finish parsing/processing a template type parameter and chekcing
13149 // various restrictions.
13152 tree id,
13154 {
13157 else
13159 }
13161 // Finish parsing/processing a template template parameter by borrowing
13162 // the template parameter list from the prototype parameter.
13163 static tree
13165 tree proto,
13166 tree id,
13168 {
13172 // FIXME: This should probably be copied, and we may need to adjust
13173 // the template parameter depths.
13182 }
13184 // Create a new non-type template parameter from the given PARM declarator.
13185 static tree
13188 {
13194 }
13196 // Build a constrained template parameter based on the PARMDECL
13197 // declarator. The type of PARMDECL is the constrained type, which
13198 // refers to the prototype template parameter that ultimately
13199 // specifies the type of the declared parameter.
13200 static tree
13205 {
13211 // Remember if the user declared this as a parameter pack and
13212 // erase that flag on the annotation. Template packs are dealt
13213 // with separately.
13218 // Is the prototype a parameter pack? If so, but the declaration
13219 // does not include "...", then emit an error.
13224 // The prototype is a template parameter pack, then the resulting
13225 // parameter also needs to be a pack.
13229 // Build the parameter. Return an error if the declarator
13230 // was invalid.
13231 tree parm;
13236 else
13241 // Finish the parameter decl and create a node attaching the
13242 // default argument and constraint.
13246 }
13249 /* Parse a template-parameter.
13251 template-parameter:
13252 type-parameter
13253 parameter-declaration
13255 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13256 the parameter. The TREE_PURPOSE is the default value, if any.
13257 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13258 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13259 set to true iff this parameter is a parameter pack. */
13261 static tree
13264 {
13268 tree parm;
13270 /* Assume it is a type parameter or a template parameter. */
13272 /* Assume it not a parameter pack. */
13274 /* Peek at the next token. */
13276 /* If it is `class' or `template', we have a type-parameter. */
13279 /* If it is `class' or `typename' we do not know yet whether it is a
13280 type parameter or a non-type parameter. Consider:
13282 template <typename T, typename T::X X> ...
13284 or:
13286 template <class C, class D*> ...
13288 Here, the first parameter is a type parameter, and the second is
13289 a non-type parameter. We can tell by looking at the token after
13290 the identifier -- if it is a `,', `=', or `>' then we have a type
13291 parameter. */
13293 {
13294 /* Peek at the token after `class' or `typename'. */
13296 /* If it's an ellipsis, we have a template type parameter
13297 pack. */
13300 /* If it's an identifier, skip it. */
13303 /* Now, see if the token looks like the end of a template
13304 parameter. */
13309 }
13311 /* Otherwise, it is a non-type parameter.
13313 [temp.param]
13315 When parsing a default template-argument for a non-type
13316 template-parameter, the first non-nested `>' is taken as the end
13317 of the template parameter-list rather than a greater-than
13318 operator. */
13319 parameter_declarator
13326 // The parameter may have been constrained.
13329 parameter_declarator,
13330 is_non_type,
13331 is_parameter_pack);
13333 // Now we're sure that the parameter is a non-type parameter.
13336 /* If the parameter declaration is marked as a parameter pack, set
13337 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13338 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13339 grokdeclarator. */
13342 {
13345 }
13348 {
13349 /* Can happen in some cases of erroneous input (c++/34892). */
13351 /* Consume the `...' for better error recovery. */
13353 }
13354 /* If the next token is an ellipsis, and we don't already have it
13355 marked as a parameter pack, then we have a parameter pack (that
13356 has no declarator). */
13359 && (declarator_can_be_parameter_pack
13361 {
13362 /* Consume the `...'. */
13367 }
13368 /* We might end up with a pack expansion as the type of the non-type
13369 template parameter, in which case this is a non-type template
13370 parameter pack. */
13373 {
13377 }
13380 {
13381 /* Parameter packs cannot have default arguments. However, a
13382 user may try to do so, so we'll parse them and give an
13383 appropriate diagnostic here. */
13387 /* Find the name of the parameter pack. */
13396 else
13400 /* Parse the default argument, but throw away the result. */
13402 }
13412 }
13414 /* Parse a type-parameter.
13416 type-parameter:
13417 class identifier [opt]
13418 class identifier [opt] = type-id
13419 typename identifier [opt]
13420 typename identifier [opt] = type-id
13421 template < template-parameter-list > class identifier [opt]
13422 template < template-parameter-list > class identifier [opt]
13423 = id-expression
13425 GNU Extension (variadic templates):
13427 type-parameter:
13428 class ... identifier [opt]
13429 typename ... identifier [opt]
13431 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13432 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13433 the declaration of the parameter.
13435 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13437 static tree
13439 {
13441 tree parameter;
13443 /* Look for a keyword to tell us what kind of parameter this is. */
13449 {
13452 {
13453 tree identifier;
13454 tree default_argument;
13456 /* If the next token is an ellipsis, we have a template
13457 argument pack. */
13459 {
13460 /* Consume the `...' token. */
13465 }
13467 /* If the next token is an identifier, then it names the
13468 parameter. */
13471 else
13474 /* Create the parameter. */
13477 /* If the next token is an `=', we have a default argument. */
13479 {
13480 /* Consume the `=' token. */
13482 /* Parse the default-argument. */
13486 /* Template parameter packs cannot have default
13487 arguments. */
13489 {
13492 "template parameter pack %qD cannot have a "
13494 else
13496 "template parameter packs cannot have "
13499 }
13501 }
13502 else
13505 /* Create the combined representation of the parameter and the
13506 default argument. */
13508 }
13512 {
13513 tree identifier;
13514 tree default_argument;
13516 // Save the current requirements before parsing the
13517 // template parameter list.
13520 /* Look for the `<'. */
13522 /* Parse the template-parameter-list. */
13524 /* Look for the `>'. */
13527 // If template requirements are present, parse them.
13529 {
13535 // Attach the constraints to the parameter list.
13538 }
13540 /* Look for the `class' keyword. */
13542 /* If the next token is an ellipsis, we have a template
13543 argument pack. */
13545 {
13546 /* Consume the `...' token. */
13551 }
13552 /* If the next token is an `=', then there is a
13553 default-argument. If the next token is a `>', we are at
13554 the end of the parameter-list. If the next token is a `,',
13555 then we are at the end of this parameter. */
13559 {
13561 /* Treat invalid names as if the parameter were nameless. */
13564 }
13565 else
13568 /* Create the template parameter. */
13570 identifier);
13572 // Restore the saved constraints.
13575 /* If the next token is an `=', then there is a
13576 default-argument. */
13578 {
13581 /* Consume the `='. */
13583 /* Parse the id-expression. */
13585 /* save token before parsing the id-expression, for error
13586 reporting */
13588 default_argument
13596 /* If the id-expression was a template-id that refers to
13597 a template-class, we already have the declaration here,
13598 so no further lookup is needed. */
13599 ;
13600 else
13601 /* Look up the name. */
13602 default_argument
13604 none_type,
13610 /* See if the default argument is valid. */
13611 default_argument
13614 /* Template parameter packs cannot have default
13615 arguments. */
13617 {
13620 "template parameter pack %qD cannot "
13622 identifier);
13623 else
13627 }
13629 }
13630 else
13633 /* Create the combined representation of the parameter and the
13634 default argument. */
13636 }
13642 }
13645 }
13647 /* Parse a template-id.
13649 template-id:
13650 template-name < template-argument-list [opt] >
13652 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13653 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13654 returned. Otherwise, if the template-name names a function, or set
13655 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13656 names a class, returns a TYPE_DECL for the specialization.
13658 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13659 uninstantiated templates. */
13661 static tree
13667 {
13669 tree templ;
13670 tree arguments;
13671 tree template_id;
13678 /* If the next token corresponds to a template-id, there is no need
13679 to reparse it. */
13682 {
13685 /* Get the stored value. */
13687 /* Perform any access checks that were deferred. */
13690 {
13695 tf_warning_or_error);
13696 }
13697 /* Return the stored value. */
13699 }
13701 /* Avoid performing name lookup if there is no possibility of
13702 finding a template-id. */
13705 && !cp_parser_nth_token_starts_template_argument_list_p
13707 {
13710 }
13712 /* Remember where the template-id starts. */
13718 /* Parse the template-name. */
13721 check_dependency_p,
13722 is_declaration,
13723 tag_type,
13726 {
13729 }
13731 /* If we find the sequence `[:' after a template-name, it's probably
13732 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13733 parse correctly the argument list. */
13740 {
13742 /* Change `:' into `::'. */
13744 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13745 CPP_LESS. */
13748 /* Parse the arguments. */
13751 {
13752 /* If we couldn't parse an argument list, then we revert our changes
13753 and return simply an error. Maybe this is not a template-id
13754 after all. */
13759 }
13760 /* Otherwise, emit an error about the invalid digraph, but continue
13761 parsing because we got our argument list. */
13764 {
13767 "%<<:%> is an alternate spelling for %<[%>."
13770 {
13772 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13775 }
13776 }
13777 }
13778 else
13779 {
13780 /* Look for the `<' that starts the template-argument-list. */
13782 {
13785 }
13786 /* Parse the arguments. */
13788 }
13790 /* Build a representation of the specialization. */
13793 TEMPLATE_ID_EXPR,
13797 {
13799 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13800 template (rather than some instantiation thereof) only if
13801 is not nested within some other construct. For example, in
13802 "template <typename T> void f(T) { A<T>::", A<T> is just an
13803 instantiation of A. */
13806 CPP_SCOPE));
13807 template_id
13809 }
13810 else
13811 {
13812 /* If it's not a class-template or a template-template, it should be
13813 a function-template. */
13818 // If the template + args designate a concept, then return
13819 // something else.
13824 }
13826 /* If parsing tentatively, replace the sequence of tokens that makes
13827 up the template-id with a CPP_TEMPLATE_ID token. That way,
13828 should we re-parse the token stream, we will not have to repeat
13829 the effort required to do the parse, nor will we issue duplicate
13830 error messages about problems during instantiation of the
13831 template. */
13833 /* Don't do this if we had a parse error in a declarator; re-parsing
13834 might succeed if a name changes meaning (60361). */
13838 {
13841 /* Reset the contents of the START_OF_ID token. */
13843 /* Retrieve any deferred checks. Do not pop this access checks yet
13844 so the memory will not be reclaimed during token replacing below. */
13850 /* Purge all subsequent tokens. */
13853 /* ??? Can we actually assume that, if template_id ==
13854 error_mark_node, we will have issued a diagnostic to the
13855 user, as opposed to simply marking the tentative parse as
13856 failed? */
13859 }
13863 }
13865 /* Parse a template-name.
13867 template-name:
13868 identifier
13870 The standard should actually say:
13872 template-name:
13873 identifier
13874 operator-function-id
13876 A defect report has been filed about this issue.
13878 A conversion-function-id cannot be a template name because they cannot
13879 be part of a template-id. In fact, looking at this code:
13881 a.operator K<int>()
13883 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13884 It is impossible to call a templated conversion-function-id with an
13885 explicit argument list, since the only allowed template parameter is
13886 the type to which it is converting.
13888 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13889 `template' keyword, in a construction like:
13891 T::template f<3>()
13893 In that case `f' is taken to be a template-name, even though there
13894 is no way of knowing for sure.
13896 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13897 name refers to a set of overloaded functions, at least one of which
13898 is a template, or an IDENTIFIER_NODE with the name of the template,
13899 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13900 names are looked up inside uninstantiated templates. */
13902 static tree
13909 {
13910 tree identifier;
13911 tree decl;
13912 tree fns;
13915 /* If the next token is `operator', then we have either an
13916 operator-function-id or a conversion-function-id. */
13918 {
13919 /* We don't know whether we're looking at an
13920 operator-function-id or a conversion-function-id. */
13922 /* Try an operator-function-id. */
13924 /* If that didn't work, try a conversion-function-id. */
13926 {
13929 }
13930 }
13931 /* Look for the identifier. */
13932 else
13935 /* If we didn't find an identifier, we don't have a template-id. */
13939 /* If the name immediately followed the `template' keyword, then it
13940 is a template-name. However, if the next token is not `<', then
13941 we do not treat it as a template-name, since it is not being used
13942 as part of a template-id. This enables us to handle constructs
13943 like:
13945 template <typename T> struct S { S(); };
13946 template <typename T> S<T>::S();
13948 correctly. We would treat `S' as a template -- if it were `S<T>'
13949 -- but we do not if there is no `<'. */
13953 {
13954 /* In a declaration, in a dependent context, we pretend that the
13955 "template" keyword was present in order to improve error
13956 recovery. For example, given:
13958 template <typename T> void f(T::X<int>);
13960 we want to treat "X<int>" as a template-id. */
13962 && !template_keyword_p
13964 && check_dependency_p
13966 /* Do not do this for dtors (or ctors), since they never
13967 need the template keyword before their name. */
13969 {
13972 /* Explain what went wrong. */
13974 identifier);
13977 /* If parsing tentatively, find the location of the "<" token. */
13980 /* Parse the template arguments so that we can issue error
13981 messages about them. */
13984 /* Skip tokens until we find a good place from which to
13985 continue parsing. */
13990 /* If parsing tentatively, permanently remove the
13991 template argument list. That will prevent duplicate
13992 error messages from being issued about the missing
13993 "template" keyword. */
13999 }
14001 /* If the "template" keyword is present, then there is generally
14002 no point in doing name-lookup, so we just return IDENTIFIER.
14003 But, if the qualifying scope is non-dependent then we can
14004 (and must) do name-lookup normally. */
14010 }
14012 /* Look up the name. */
14014 tag_type,
14017 check_dependency_p,
14021 /* If DECL is a template, then the name was a template-name. */
14023 ;
14024 else
14025 {
14028 /* The standard does not explicitly indicate whether a name that
14029 names a set of overloaded declarations, some of which are
14030 templates, is a template-name. However, such a name should
14031 be a template-name; otherwise, there is no way to form a
14032 template-id for the overloaded templates. */
14040 {
14041 /* The name does not name a template. */
14044 }
14045 }
14047 /* If DECL is dependent, and refers to a function, then just return
14048 its name; we will look it up again during template instantiation. */
14050 {
14054 }
14057 }
14059 /* Parse a template-argument-list.
14061 template-argument-list:
14062 template-argument ... [opt]
14063 template-argument-list , template-argument ... [opt]
14065 Returns a TREE_VEC containing the arguments. */
14067 static tree
14069 {
14074 tree vec;
14081 /* Even if the template-id appears in an integral
14082 constant-expression, the contents of the argument list do
14083 not. */
14089 /* Parse the arguments. */
14090 do
14091 {
14092 tree argument;
14095 /* Consume the comma. */
14098 /* Parse the template-argument. */
14101 /* If the next token is an ellipsis, we're expanding a template
14102 argument pack. */
14104 {
14106 {
14110 }
14111 /* Consume the `...' token. */
14114 /* Make the argument into a TYPE_PACK_EXPANSION or
14115 EXPR_PACK_EXPANSION. */
14117 }
14120 {
14124 {
14127 }
14128 else
14130 }
14132 }
14145 #ifdef ENABLE_CHECKING
14147 #endif
14149 }
14151 /* Parse a template-argument.
14153 template-argument:
14154 assignment-expression
14155 type-id
14156 id-expression
14158 The representation is that of an assignment-expression, type-id, or
14159 id-expression -- except that the qualified id-expression is
14160 evaluated, so that the value returned is either a DECL or an
14161 OVERLOAD.
14163 Although the standard says "assignment-expression", it forbids
14164 throw-expressions or assignments in the template argument.
14165 Therefore, we use "conditional-expression" instead. */
14167 static tree
14169 {
14170 tree argument;
14176 cp_id_kind idk;
14178 /* There's really no way to know what we're looking at, so we just
14179 try each alternative in order.
14181 [temp.arg]
14183 In a template-argument, an ambiguity between a type-id and an
14184 expression is resolved to a type-id, regardless of the form of
14185 the corresponding template-parameter.
14187 Therefore, we try a type-id first. */
14190 /* If there was no error parsing the type-id but the next token is a
14191 '>>', our behavior depends on which dialect of C++ we're
14192 parsing. In C++98, we probably found a typo for '> >'. But there
14193 are type-id which are also valid expressions. For instance:
14195 struct X { int operator >> (int); };
14196 template <int V> struct Foo {};
14197 Foo<X () >> 5> r;
14199 Here 'X()' is a valid type-id of a function type, but the user just
14200 wanted to write the expression "X() >> 5". Thus, we remember that we
14201 found a valid type-id, but we still try to parse the argument as an
14202 expression to see what happens.
14204 In C++0x, the '>>' will be considered two separate '>'
14205 tokens. */
14209 {
14212 }
14213 else
14214 {
14215 /* If the next token isn't a `,' or a `>', then this argument wasn't
14216 really finished. This means that the argument is not a valid
14217 type-id. */
14220 /* If that worked, we're done. */
14223 }
14224 /* We're still not sure what the argument will be. */
14226 /* Try a template. */
14234 /* If the next token isn't a `,' or a `>', then this argument wasn't
14235 really finished. */
14239 {
14240 /* Figure out what is being referred to. If the id-expression
14241 was for a class template specialization, then we will have a
14242 TYPE_DECL at this point. There is no need to do name lookup
14243 at this point in that case. */
14246 none_type,
14255 }
14258 /* It must be a non-type argument. There permitted cases are given
14259 in [temp.arg.nontype]:
14261 -- an integral constant-expression of integral or enumeration
14262 type; or
14264 -- the name of a non-type template-parameter; or
14266 -- the name of an object or function with external linkage...
14268 -- the address of an object or function with external linkage...
14270 -- a pointer to member... */
14271 /* Look for a non-type template parameter. */
14273 {
14285 }
14287 /* If the next token is "&", the argument must be the address of an
14288 object or function with external linkage. */
14291 {
14294 }
14295 /* See if we might have an id-expression. */
14302 {
14305 address_p,
14312 else
14313 {
14314 tree probe;
14317 {
14318 /* Strip the dereference temporarily. */
14321 }
14323 /* If we're in a template, we represent a qualified-id referring
14324 to a static data member as a SCOPE_REF even if the scope isn't
14325 dependent so that we can check access control later. */
14330 {
14331 /* A variable without external linkage might still be a
14332 valid constant-expression, so no error is issued here
14333 if the external-linkage check fails. */
14336 }
14338 /* All overloaded functions are allowed; if the external
14339 linkage test does not pass, an error will be issued
14340 later. */
14341 ;
14345 /* A pointer-to-member. */
14346 ;
14348 ;
14349 else
14353 {
14356 tf_warning_or_error);
14357 else
14360 }
14361 }
14362 }
14363 /* If the argument started with "&", there are no other valid
14364 alternatives at this point. */
14366 {
14369 }
14371 /* If the argument wasn't successfully parsed as a type-id followed
14372 by '>>', the argument can only be a constant expression now.
14373 Otherwise, we try parsing the constant-expression tentatively,
14374 because the argument could really be a type-id. */
14386 /* We did our best to parse the argument as a non type-id, but that
14387 was the only alternative that matched (albeit with a '>' after
14388 it). We can assume it's just a typo from the user, and a
14389 diagnostic will then be issued. */
14391 }
14393 /* Parse an explicit-instantiation.
14395 explicit-instantiation:
14396 template declaration
14398 Although the standard says `declaration', what it really means is:
14400 explicit-instantiation:
14401 template decl-specifier-seq [opt] declarator [opt] ;
14403 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14404 supposed to be allowed. A defect report has been filed about this
14405 issue.
14407 GNU Extension:
14409 explicit-instantiation:
14410 storage-class-specifier template
14411 decl-specifier-seq [opt] declarator [opt] ;
14412 function-specifier template
14413 decl-specifier-seq [opt] declarator [opt] ; */
14415 static void
14417 {
14419 cp_decl_specifier_seq decl_specifiers;
14424 /* Look for an (optional) storage-class-specifier or
14425 function-specifier. */
14427 {
14428 extension_specifier
14431 extension_specifier
14434 }
14436 /* Look for the `template' keyword. */
14438 /* Let the front end know that we are processing an explicit
14439 instantiation. */
14441 /* [temp.explicit] says that we are supposed to ignore access
14442 control while processing explicit instantiation directives. */
14444 /* Parse a decl-specifier-seq. */
14446 CP_PARSER_FLAGS_OPTIONAL,
14449 /* If there was exactly one decl-specifier, and it declared a class,
14450 and there's no declarator, then we have an explicit type
14451 instantiation. */
14453 {
14454 tree type;
14458 /* Turn access control back on for names used during
14459 template instantiation. */
14464 }
14465 else
14466 {
14468 tree decl;
14470 /* Parse the declarator. */
14471 declarator
14482 {
14485 "explicit instantiation shall not use"
14489 "explicit instantiation shall not use"
14494 /* Turn access control back on for names used during
14495 template instantiation. */
14497 /* Do the explicit instantiation. */
14499 }
14500 else
14501 {
14503 /* Skip the body of the explicit instantiation. */
14505 }
14506 }
14507 /* We're done with the instantiation. */
14513 }
14515 /* Parse an explicit-specialization.
14517 explicit-specialization:
14518 template < > declaration
14520 Although the standard says `declaration', what it really means is:
14522 explicit-specialization:
14523 template <> decl-specifier [opt] init-declarator [opt] ;
14524 template <> function-definition
14525 template <> explicit-specialization
14526 template <> template-declaration */
14528 static void
14530 {
14534 /* Look for the `template' keyword. */
14536 /* Look for the `<'. */
14538 /* Look for the `>'. */
14540 /* We have processed another parameter list. */
14542 /* [temp]
14544 A template ... explicit specialization ... shall not have C
14545 linkage. */
14547 {
14549 /* Give it C++ linkage to avoid confusing other parts of the
14550 front end. */
14553 }
14554 else
14556 /* Let the front end know that we are beginning a specialization. */
14558 {
14561 }
14563 /* If the next keyword is `template', we need to figure out whether
14564 or not we're looking a template-declaration. */
14566 {
14571 else
14573 }
14574 else
14575 /* Parse the dependent declaration. */
14581 /* We're done with the specialization. */
14583 /* For the erroneous case of a template with C linkage, we pushed an
14584 implicit C++ linkage scope; exit that scope now. */
14587 /* We're done with this parameter list. */
14589 }
14591 /* Parse a type-specifier.
14593 type-specifier:
14594 simple-type-specifier
14595 class-specifier
14596 enum-specifier
14597 elaborated-type-specifier
14598 cv-qualifier
14600 GNU Extension:
14602 type-specifier:
14603 __complex__
14605 Returns a representation of the type-specifier. For a
14606 class-specifier, enum-specifier, or elaborated-type-specifier, a
14607 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14609 The parser flags FLAGS is used to control type-specifier parsing.
14611 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14612 in a decl-specifier-seq.
14614 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14615 class-specifier, enum-specifier, or elaborated-type-specifier, then
14616 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14617 if a type is declared; 2 if it is defined. Otherwise, it is set to
14618 zero.
14620 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14621 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14622 is set to FALSE. */
14624 static tree
14626 cp_parser_flags flags,
14631 {
14637 /* Assume this type-specifier does not declare a new type. */
14640 /* And that it does not specify a cv-qualifier. */
14643 /* Peek at the next token. */
14646 /* If we're looking at a keyword, we can use that to guide the
14647 production we choose. */
14650 {
14655 /* Look for the enum-specifier. */
14657 /* If that worked, we're done. */
14659 {
14664 type_spec,
14665 token,
14668 }
14669 else
14672 /* Any of these indicate either a class-specifier, or an
14673 elaborated-type-specifier. */
14680 /* Parse tentatively so that we can back up if we don't find a
14681 class-specifier. */
14683 /* Look for the class-specifier. */
14686 /* If that worked, we're done. */
14688 {
14693 type_spec,
14694 token,
14697 }
14699 /* Fall through. */
14700 elaborated_type_specifier:
14701 /* We're declaring (not defining) a class or enum. */
14705 /* Fall through. */
14707 /* Look for an elaborated-type-specifier. */
14708 type_spec
14709 = (cp_parser_elaborated_type_specifier
14712 is_declaration));
14715 type_spec,
14716 token,
14739 /* The `__complex__' keyword is a GNU extension. */
14745 }
14747 /* Handle simple keywords. */
14749 {
14751 {
14754 }
14756 }
14758 /* If we do not already have a type-specifier, assume we are looking
14759 at a simple-type-specifier. */
14761 decl_specs,
14762 flags);
14764 /* If we didn't find a type-specifier, and a type-specifier was not
14765 optional in this context, issue an error message. */
14767 {
14770 }
14773 }
14775 /* Parse a simple-type-specifier.
14777 simple-type-specifier:
14778 :: [opt] nested-name-specifier [opt] type-name
14779 :: [opt] nested-name-specifier template template-id
14780 char
14781 wchar_t
14782 bool
14783 short
14784 int
14785 long
14786 signed
14787 unsigned
14788 float
14789 double
14790 void
14792 C++0x Extension:
14794 simple-type-specifier:
14795 auto
14796 decltype ( expression )
14797 char16_t
14798 char32_t
14799 __underlying_type ( type-id )
14801 GNU Extension:
14803 simple-type-specifier:
14804 __int128
14805 __typeof__ unary-expression
14806 __typeof__ ( type-id )
14807 __typeof__ ( type-id ) { initializer-list , [opt] }
14809 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14810 appropriately updated. */
14812 static tree
14815 cp_parser_flags flags)
14816 {
14820 /* Peek at the next token. */
14823 /* If we're looking at a keyword, things are easy. */
14825 {
14885 {
14889 {
14892 "use of %<auto%> in lambda parameter declaration "
14893 "only available with "
14895 }
14898 "use of %<auto%> in parameter declaration "
14899 "only available with "
14901 else
14903 "ISO C++ forbids use of %<auto%> in parameter "
14905 }
14906 else
14911 /* Since DR 743, decltype can either be a simple-type-specifier by
14912 itself or begin a nested-name-specifier. Parsing it will replace
14913 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14914 handling below decide what to do. */
14920 /* Consume the `typeof' token. */
14922 /* Parse the operand to `typeof'. */
14924 /* If it is not already a TYPE, take its type. */
14930 token,
14939 token,
14949 token,
14954 }
14956 /* If token is an already-parsed decltype not followed by ::,
14957 it's a simple-type-specifier. */
14960 {
14964 token,
14968 }
14970 /* If the type-specifier was for a built-in type, we're done. */
14972 {
14973 /* Record the type. */
14980 type,
14981 token,
14986 /* Consume the token. */
14989 /* There is no valid C++ program where a non-template type is
14990 followed by a "<". That usually indicates that the user thought
14991 that the type was a template. */
14996 }
14998 /* The type-specifier must be a user-defined type. */
15000 {
15004 /* Don't gobble tokens or issue error messages if this is an
15005 optional type-specifier. */
15009 /* Look for the optional `::' operator. */
15010 global_p
15014 /* Look for the nested-name specifier. */
15015 qualified_p
15023 /* If we have seen a nested-name-specifier, and the next token
15024 is `template', then we are using the template-id production. */
15027 {
15028 /* Look for the template-id. */
15032 none_type,
15034 /* If the template-id did not name a type, we are out of
15035 luck. */
15037 {
15040 }
15041 }
15042 /* Otherwise, look for a type-name. */
15043 else
15046 /* Keep track of all name-lookups performed in class scopes. */
15048 && !global_p
15049 && !qualified_p
15053 /* If it didn't work out, we don't have a TYPE. */
15059 token,
15061 }
15063 /* If we didn't get a type-name, issue an error message. */
15065 {
15068 }
15071 {
15072 /* See if TYPE is an Objective-C type, and if so, parse and
15073 accept any protocol references following it. Do this before
15074 the cp_parser_check_for_invalid_template_id() call, because
15075 Objective-C types can be followed by '<...>' which would
15076 enclose protocol names rather than template arguments, and so
15077 everything is fine. */
15080 {
15084 /* Clobber the "unqualified" type previously entered into
15085 DECL_SPECS with the new, improved protocol-qualified version. */
15090 }
15092 /* There is no valid C++ program where a non-template type is
15093 followed by a "<". That usually indicates that the user
15094 thought that the type was a template. */
15096 none_type,
15098 }
15101 }
15103 /* Parse a type-name.
15105 type-name:
15106 class-name
15107 enum-name
15108 typedef-name
15109 simple-template-id [in c++0x]
15111 enum-name:
15112 identifier
15114 typedef-name:
15115 identifier
15117 Concepts:
15119 type-name:
15120 concept-name
15121 partial-concept-id
15123 concept-name:
15124 identifier
15126 Returns a TYPE_DECL for the type. */
15128 static tree
15130 {
15131 tree type_decl;
15133 /* We can't know yet whether it is a class-name or not. */
15135 /* Try a class-name. */
15139 none_type,
15144 /* If it's not a class-name, keep looking. */
15146 {
15148 /* It must be a typedef-name or an enum-name. */
15152 /* It is either a simple-template-id representing an
15153 instantiation of an alias template... */
15157 none_type,
15160 /* Note that this must be an instantiation of an alias template
15161 because [temp.names]/6 says:
15163 A template-id that names an alias template specialization
15164 is a type-name.
15166 Whereas [temp.names]/7 says:
15168 A simple-template-id that names a class template
15169 specialization is a class-name. */
15174 else
15178 /* ... Or a typedef-name or an enum-name. */
15180 }
15183 }
15185 /// Returns true if proto is a type parameter, but not a template template
15186 /// parameter.
15187 static bool
15189 {
15191 {
15194 }
15196 }
15198 /// Returns true if the parser is in a context that allows the
15199 /// use of a constrained type specifier.
15202 {
15203 return flag_concepts
15204 && (processing_template_parmlist
15207 }
15210 // Check if DECL and ARGS can form a constrained-type-specifier. If ARGS
15211 // is non-null, we try to form a concept check of the form DECL<?, ARGS>
15212 // where ? is a placeholder for any kind of template argument. If ARGS
15213 // is NULL, then we try to form a concept check of the form DEC<?>.
15214 static tree
15216 {
15219 // Don't do any heavy lifting if we know we're not in a context
15220 // where it could succeed.
15224 // Try to build a call expression that evaluates the concept. This
15225 // can fail if the overload set refers only to non-templates.
15231 // Deduce the checked constraint and the prototype parameter.
15232 tree fn;
15233 tree proto;
15237 // In template paramteer scope, this results in a constrained parameter.
15238 // Return a descriptor of that parm.
15242 // In any other context, a concept must be a type concept.
15246 // In a parameter-declaration-clause, constrained-type specifiers
15247 // result in invented template parameters.
15249 {
15253 }
15255 // A concept-name appearing in a result-type constraint is a
15256 // constrained auto. Meaning that type deduction will be applied
15257 // and the constraint checked.
15258 //
15259 // TODO: Actually bind the constraint to the auto.
15264 }
15267 // If DECL refers to a concept, return a TYPE_DECL representing the result
15268 // of using the constrained type specifier in the current context.
15269 //
15270 // DECL refers to a concept if
15271 // - it is an overload set containing a function concept taking a single
15272 // type argument, or
15273 // - it is a variable concept taking a single type argument
15274 //
15275 // TODO: DECL could be a variable concept.
15276 static tree
15278 {
15280 }
15282 // Check if DECL and ARGS forms a partial concept id. Let C be the name
15283 // of the overload set denoted by TMPL, Args the sequence of ARGS, and
15284 // ? denote an unspecified template argument. If the template-id C<?, Args>
15285 // is valid, this denotes a partial-concept-id to be acted on.
15286 //
15287 // TODO: TMPL could be a variable concept.
15288 tree
15290 {
15292 }
15294 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
15295 or a concept-name.
15297 enum-name:
15298 identifier
15300 typedef-name:
15301 identifier
15303 concept-name:
15304 identifier
15306 Returns a TYPE_DECL for the type. */
15308 static tree
15310 {
15311 tree type_decl;
15312 tree identifier;
15319 /* Look up the type-name. */
15323 // If we found an overload set, then it may refer to a concept-name.
15324 //
15325 // TODO: The name could also refer to a variable template or an
15326 // introduction (if followed by '{').
15329 {
15330 // Determine whether the overload refers to a concept.
15333 }
15336 {
15340 {
15341 /* We have found a type introduced by a using
15342 declaration at class scope that refers to a dependent
15343 type.
15345 using typename :: [opt] nested-name-specifier unqualified-id ;
15346 */
15352 }
15353 }
15357 {
15358 /* See if this is an Objective-C type. */
15363 }
15365 /* Issue an error if we did not find a type-name. */
15367 /* In Objective-C, we have the complication that class names are
15368 normally type names and start declarations (eg, the
15369 "NSObject" in "NSObject *object;"), but can be used in an
15370 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15371 is an expression. So, a classname followed by a dot is not a
15372 valid type-name. */
15375 {
15380 }
15381 /* Remember that the name was used in the definition of the
15382 current class so that we can check later to see if the
15383 meaning would have been different after the class was
15384 entirely defined. */
15390 }
15392 /* Parse an elaborated-type-specifier. Note that the grammar given
15393 here incorporates the resolution to DR68.
15395 elaborated-type-specifier:
15396 class-key :: [opt] nested-name-specifier [opt] identifier
15397 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15398 enum-key :: [opt] nested-name-specifier [opt] identifier
15399 typename :: [opt] nested-name-specifier identifier
15400 typename :: [opt] nested-name-specifier template [opt]
15401 template-id
15403 GNU extension:
15405 elaborated-type-specifier:
15406 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15407 class-key attributes :: [opt] nested-name-specifier [opt]
15408 template [opt] template-id
15409 enum attributes :: [opt] nested-name-specifier [opt] identifier
15411 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15412 declared `friend'. If IS_DECLARATION is TRUE, then this
15413 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15414 something is being declared.
15416 Returns the TYPE specified. */
15418 static tree
15422 {
15424 tree identifier;
15427 tree globalscope;
15430 /* See if we're looking at the `enum' keyword. */
15432 {
15433 /* Consume the `enum' token. */
15435 /* Remember that it's an enumeration type. */
15437 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15438 enums) is used here. */
15441 {
15445 /* Consume the `struct' or `class' and parse it anyway. */
15447 }
15448 /* Parse the attributes. */
15450 }
15451 /* Or, it might be `typename'. */
15453 RID_TYPENAME))
15454 {
15455 /* Consume the `typename' token. */
15457 /* Remember that it's a `typename' type. */
15459 }
15460 /* Otherwise it must be a class-key. */
15461 else
15462 {
15466 /* Parse the attributes. */
15468 }
15470 /* Look for the `::' operator. */
15473 /* Look for the nested-name-specifier. */
15475 {
15480 is_declaration))
15482 }
15483 else
15484 /* Even though `typename' is not present, the proposed resolution
15485 to Core Issue 180 says that in `class A<T>::B', `B' should be
15486 considered a type-name, even if `A<T>' is dependent. */
15491 is_declaration);
15492 /* For everything but enumeration types, consider a template-id.
15493 For an enumeration type, consider only a plain identifier. */
15495 {
15497 tree decl;
15499 /* Allow the `template' keyword. */
15501 /* If we didn't see `template', we don't know if there's a
15502 template-id or not. */
15505 /* Parse the template-id. */
15509 tag_type,
15510 is_declaration);
15511 /* If we didn't find a template-id, look for an ordinary
15512 identifier. */
15514 ;
15515 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15516 in effect, then we must assume that, upon instantiation, the
15517 template will correspond to a class. */
15521 typename_type,
15523 /* If the `typename' keyword is in effect and DECL is not a type
15524 decl, then type is non existent. */
15526 ;
15532 }
15535 {
15540 {
15543 }
15545 /* For a `typename', we needn't call xref_tag. */
15549 identifier,
15552 /* Template parameter lists apply only if we are not within a
15553 function parameter list. */
15554 bool template_parm_lists_apply
15563 /* Look up a qualified name in the usual way. */
15565 {
15566 tree decl;
15567 tree ambiguous_decls;
15570 tag_type,
15577 /* If the lookup was ambiguous, an error will already have been
15578 issued. */
15582 /* If we are parsing friend declaration, DECL may be a
15583 TEMPLATE_DECL tree node here. However, we need to check
15584 whether this TEMPLATE_DECL results in valid code. Consider
15585 the following example:
15587 namespace N {
15588 template <class T> class C {};
15589 }
15590 class X {
15591 template <class T> friend class N::C; // #1, valid code
15592 };
15593 template <class T> class Y {
15594 friend class N::C; // #2, invalid code
15595 };
15597 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15598 name lookup of `N::C'. We see that friend declaration must
15599 be template for the code to be valid. Note that
15600 processing_template_decl does not work here since it is
15601 always 1 for the above two cases. */
15603 decl = (cp_parser_maybe_treat_template_as_class
15608 {
15611 identifier,
15614 }
15617 {
15621 allow_template);
15625 }
15627 /* Forward declarations of nested types, such as
15629 class C1::C2;
15630 class C1::C2::C3;
15632 are invalid unless all components preceding the final '::'
15633 are complete. If all enclosing types are complete, these
15634 declarations become merely pointless.
15636 Invalid forward declarations of nested types are errors
15637 caught elsewhere in parsing. Those that are pointless arrive
15638 here. */
15645 }
15646 else
15647 {
15648 /* An elaborated-type-specifier sometimes introduces a new type and
15649 sometimes names an existing type. Normally, the rule is that it
15650 introduces a new type only if there is not an existing type of
15651 the same name already in scope. For example, given:
15653 struct S {};
15654 void f() { struct S s; }
15656 the `struct S' in the body of `f' is the same `struct S' as in
15657 the global scope; the existing definition is used. However, if
15658 there were no global declaration, this would introduce a new
15659 local class named `S'.
15661 An exception to this rule applies to the following code:
15663 namespace N { struct S; }
15665 Here, the elaborated-type-specifier names a new type
15666 unconditionally; even if there is already an `S' in the
15667 containing scope this declaration names a new type.
15668 This exception only applies if the elaborated-type-specifier
15669 forms the complete declaration:
15671 [class.name]
15673 A declaration consisting solely of `class-key identifier ;' is
15674 either a redeclaration of the name in the current scope or a
15675 forward declaration of the identifier as a class name. It
15676 introduces the name into the current scope.
15678 We are in this situation precisely when the next token is a `;'.
15680 An exception to the exception is that a `friend' declaration does
15681 *not* name a new type; i.e., given:
15683 struct S { friend struct T; };
15685 `T' is not a new type in the scope of `S'.
15687 Also, `new struct S' or `sizeof (struct S)' never results in the
15688 definition of a new type; a new type can only be declared in a
15689 declaration context. */
15691 tag_scope ts;
15695 /* Friends have special name lookup rules. */
15699 CPP_SEMICOLON))
15700 /* This is a `class-key identifier ;' */
15702 else
15705 template_p =
15706 (template_parm_lists_apply
15709 /* An unqualified name was used to reference this type, so
15710 there were no qualifying templates. */
15718 }
15719 }
15724 /* Allow attributes on forward declarations of classes. */
15726 {
15736 else
15739 }
15742 {
15743 /* Indicate whether this class was declared as a `class' or as a
15744 `struct'. */
15748 }
15750 /* A "<" cannot follow an elaborated type specifier. If that
15751 happens, the user was probably trying to form a template-id. */
15756 }
15758 /* Parse an enum-specifier.
15760 enum-specifier:
15761 enum-head { enumerator-list [opt] }
15762 enum-head { enumerator-list , } [C++0x]
15764 enum-head:
15765 enum-key identifier [opt] enum-base [opt]
15766 enum-key nested-name-specifier identifier enum-base [opt]
15768 enum-key:
15769 enum
15770 enum class [C++0x]
15771 enum struct [C++0x]
15773 enum-base: [C++0x]
15774 : type-specifier-seq
15776 opaque-enum-specifier:
15777 enum-key identifier enum-base [opt] ;
15779 GNU Extensions:
15780 enum-key attributes[opt] identifier [opt] enum-base [opt]
15781 { enumerator-list [opt] }attributes[opt]
15782 enum-key attributes[opt] identifier [opt] enum-base [opt]
15783 { enumerator-list, }attributes[opt] [C++0x]
15785 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15786 if the token stream isn't an enum-specifier after all. */
15788 static tree
15790 {
15791 tree identifier;
15793 tree prev_scope;
15795 tree attributes;
15808 /* Parse tentatively so that we can back up if we don't find a
15809 enum-specifier. */
15812 /* Caller guarantees that the current token is 'enum', an identifier
15813 possibly follows, and the token after that is an opening brace.
15814 If we don't have an identifier, fabricate an anonymous name for
15815 the enumeration being defined. */
15818 /* Parse the "class" or "struct", which indicates a scoped
15819 enumeration type in C++0x. */
15822 {
15826 /* Consume the `struct' or `class' token. */
15830 }
15834 /* Clear the qualification. */
15839 /* Figure out in what scope the declaration is being placed. */
15845 nested_name_specifier
15853 {
15854 tree name;
15858 enum_type,
15863 input_location);
15865 {
15868 {
15869 /* Are template enums allowed in ISO? */
15873 /* ignore a typename reference, for it will be solved by name
15874 in start_enum. */
15876 }
15877 }
15880 else
15883 }
15884 else
15885 {
15888 else
15889 {
15895 }
15896 }
15899 /* Check for the `:' that denotes a specified underlying type in C++0x.
15900 Note that a ':' could also indicate a bitfield width, however. */
15902 {
15903 cp_decl_specifier_seq type_specifiers;
15905 /* Consume the `:'. */
15908 /* Parse the type-specifier-seq. */
15913 /* At this point this is surely not elaborated type specifier. */
15922 /* If that didn't work, stop. */
15924 {
15930 }
15931 }
15933 /* Look for the `{' but don't consume it yet. */
15935 {
15937 {
15940 {
15943 }
15944 }
15945 /* An opaque-enum-specifier must have a ';' here. */
15948 {
15951 {
15954 }
15955 }
15956 }
15962 {
15964 {
15968 }
15970 {
15972 }
15973 }
15975 /* Issue an error message if type-definitions are forbidden here. */
15978 else
15979 /* Create the new type. We do this before consuming the opening
15980 brace so the enum will be recorded as being on the line of its
15981 tag (or the 'enum' keyword, if there is no tag). */
15985 /* If the next token is not '{' it is an opaque-enum-specifier or an
15986 elaborated-type-specifier. */
15988 {
15992 {
15993 /* The following catches invalid code such as:
15994 enum class S<int>::E { A, B, C }; */
16002 {
16006 nested_name_specifier);
16008 }
16009 /* If that scope does not contain the scope in which the
16010 class was originally declared, the program is invalid. */
16012 nested_name_specifier))
16013 {
16016 "declaration of %qD in namespace %qD which does not "
16019 else
16021 "declaration of %qD in %qD which does not "
16025 }
16026 }
16031 /* Consume the opening brace. */
16038 {
16042 }
16043 else
16044 {
16050 }
16054 /* If the next token is not '}', then there are some enumerators. */
16056 {
16060 }
16061 else
16064 /* Consume the final '}'. */
16070 }
16071 else
16072 {
16073 /* If a ';' follows, then it is an opaque-enum-specifier
16074 and additional restrictions apply. */
16076 {
16083 }
16084 }
16086 /* Look for trailing attributes to apply to this enumeration, and
16087 apply them if appropriate. */
16089 {
16093 trailing_attr,
16095 }
16097 /* Finish up the enumeration. */
16099 {
16104 }
16107 {
16109 {
16112 }
16114 {
16116 }
16117 }
16118 out:
16121 }
16123 /* Parse an enumerator-list. The enumerators all have the indicated
16124 TYPE.
16126 enumerator-list:
16127 enumerator-definition
16128 enumerator-list , enumerator-definition */
16130 static void
16132 {
16134 {
16135 /* Parse an enumerator-definition. */
16138 /* If the next token is not a ',', we've reached the end of
16139 the list. */
16142 /* Otherwise, consume the `,' and keep going. */
16144 /* If the next token is a `}', there is a trailing comma. */
16146 {
16151 }
16152 }
16153 }
16155 /* Parse an enumerator-definition. The enumerator has the indicated
16156 TYPE.
16158 enumerator-definition:
16159 enumerator
16160 enumerator = constant-expression
16162 enumerator:
16163 identifier */
16165 static void
16167 {
16168 tree identifier;
16169 tree value;
16170 location_t loc;
16172 /* Save the input location because we are interested in the location
16173 of the identifier and not the location of the explicit value. */
16176 /* Look for the identifier. */
16181 /* If the next token is an '=', then there is an explicit value. */
16183 {
16184 /* Consume the `=' token. */
16186 /* Parse the value. */
16189 NULL);
16190 }
16191 else
16194 /* If we are processing a template, make sure the initializer of the
16195 enumerator doesn't contain any bare template parameter pack. */
16199 /* integral_constant_value will pull out this expression, so make sure
16200 it's folded as appropriate. */
16203 /* Create the enumerator. */
16205 }
16207 /* Parse a namespace-name.
16209 namespace-name:
16210 original-namespace-name
16211 namespace-alias
16213 Returns the NAMESPACE_DECL for the namespace. */
16215 static tree
16217 {
16218 tree identifier;
16219 tree namespace_decl;
16223 /* Get the name of the namespace. */
16228 /* Look up the identifier in the currently active scope. Look only
16229 for namespaces, due to:
16231 [basic.lookup.udir]
16233 When looking up a namespace-name in a using-directive or alias
16234 definition, only namespace names are considered.
16236 And:
16238 [basic.lookup.qual]
16240 During the lookup of a name preceding the :: scope resolution
16241 operator, object, function, and enumerator names are ignored.
16243 (Note that cp_parser_qualifying_entity only calls this
16244 function if the token after the name is the scope resolution
16245 operator.) */
16247 none_type,
16253 /* If it's not a namespace, issue an error. */
16256 {
16261 }
16264 }
16266 /* Parse a namespace-definition.
16268 namespace-definition:
16269 named-namespace-definition
16270 unnamed-namespace-definition
16272 named-namespace-definition:
16273 original-namespace-definition
16274 extension-namespace-definition
16276 original-namespace-definition:
16277 namespace identifier { namespace-body }
16279 extension-namespace-definition:
16280 namespace original-namespace-name { namespace-body }
16282 unnamed-namespace-definition:
16283 namespace { namespace-body } */
16285 static void
16287 {
16294 {
16298 }
16299 else
16302 /* Look for the `namespace' keyword. */
16305 /* Get the name of the namespace. We do not attempt to distinguish
16306 between an original-namespace-definition and an
16307 extension-namespace-definition at this point. The semantic
16308 analysis routines are responsible for that. */
16311 else
16314 /* Parse any specified attributes. */
16317 /* Look for the `{' to start the namespace. */
16319 /* Start the namespace. */
16322 /* "inline namespace" is equivalent to a stub namespace definition
16323 followed by a strong using directive. */
16325 {
16327 /* Set up namespace association. */
16331 /* Import the contents of the inline namespace. */
16335 }
16339 /* Parse the body of the namespace. */
16345 /* Finish the namespace. */
16347 /* Look for the final `}'. */
16349 }
16351 /* Parse a namespace-body.
16353 namespace-body:
16354 declaration-seq [opt] */
16356 static void
16358 {
16360 }
16362 /* Parse a namespace-alias-definition.
16364 namespace-alias-definition:
16365 namespace identifier = qualified-namespace-specifier ; */
16367 static void
16369 {
16370 tree identifier;
16371 tree namespace_specifier;
16375 /* Look for the `namespace' keyword. */
16377 /* Look for the identifier. */
16381 /* Look for the `=' token. */
16384 {
16386 /* Skip the definition. */
16391 }
16393 /* Look for the qualified-namespace-specifier. */
16394 namespace_specifier
16396 /* Look for the `;' token. */
16399 /* Register the alias in the symbol table. */
16401 }
16403 /* Parse a qualified-namespace-specifier.
16405 qualified-namespace-specifier:
16406 :: [opt] nested-name-specifier [opt] namespace-name
16408 Returns a NAMESPACE_DECL corresponding to the specified
16409 namespace. */
16411 static tree
16413 {
16414 /* Look for the optional `::'. */
16418 /* Look for the optional nested-name-specifier. */
16426 }
16428 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16429 access declaration.
16431 using-declaration:
16432 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16433 using :: unqualified-id ;
16435 access-declaration:
16436 qualified-id ;
16438 */
16440 static bool
16443 {
16447 tree decl;
16448 tree identifier;
16449 tree qscope;
16454 {
16457 }
16458 else
16459 {
16460 /* Look for the `using' keyword. */
16463 /* Peek at the next token. */
16465 /* See if it's `typename'. */
16467 {
16468 /* Remember that we've seen it. */
16470 /* Consume the `typename' token. */
16472 }
16473 }
16475 /* Look for the optional global scope qualification. */
16476 global_scope_p
16481 /* If we saw `typename', or didn't see `::', then there must be a
16482 nested-name-specifier present. */
16484 {
16490 {
16493 }
16494 }
16495 /* Otherwise, we could be in either of the two productions. In that
16496 case, treat the nested-name-specifier as optional. */
16497 else
16509 /* Something has already gone wrong; there's no need to parse
16510 further. Since an error has occurred, the return value of
16511 cp_parser_parse_definitely will be false, as required. */
16515 /* Parse the unqualified-id. */
16523 {
16528 }
16530 /* The function we call to handle a using-declaration is different
16531 depending on what scope we are in. */
16533 ;
16536 /* [namespace.udecl]
16538 A using declaration shall not name a template-id. */
16541 else
16542 {
16544 {
16545 /* Create the USING_DECL. */
16552 {
16555 }
16556 else
16557 /* Add it to the list of members in this class. */
16559 }
16560 else
16561 {
16563 identifier,
16570 {
16573 }
16576 else
16578 }
16579 }
16581 /* Look for the final `;'. */
16586 "access declarations are deprecated "
16587 "in favour of using-declarations; "
16591 }
16593 /* Parse an alias-declaration.
16595 alias-declaration:
16596 using identifier attribute-specifier-seq [opt] = type-id */
16598 static tree
16600 {
16602 location_t id_location;
16604 cp_decl_specifier_seq decl_specs;
16608 /* Look for the `using' keyword. */
16609 cp_token *using_token
16631 /* Now we are going to parse the type-id of the declaration. */
16633 /*
16634 [dcl.type]/3 says:
16636 "A type-specifier-seq shall not define a class or enumeration
16637 unless it appears in the type-id of an alias-declaration (7.1.3) that
16638 is not the declaration of a template-declaration."
16640 In other words, if we currently are in an alias template, the
16641 type-id should not define a type.
16643 So let's set parser->type_definition_forbidden_message in that
16644 case; cp_parser_check_type_definition (called by
16645 cp_parser_class_specifier) will then emit an error if a type is
16646 defined in the type-id. */
16648 {
16652 }
16656 /* Restore the error message if need be. */
16662 {
16665 }
16667 /* A typedef-name can also be introduced by an alias-declaration. The
16668 identifier following the using keyword becomes a typedef-name. It has
16669 the same semantics as if it were introduced by the typedef
16670 specifier. In particular, it does not define a new type and it shall
16671 not appear in the type-id. */
16676 {
16679 ds_attribute,
16680 attrs_token);
16681 }
16683 ds_typedef,
16684 using_token);
16686 ds_alias,
16687 using_token);
16696 else
16707 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16708 added into the symbol table; otherwise, return the TYPE_DECL. */
16712 {
16716 }
16719 }
16721 /* Parse a using-directive.
16723 using-directive:
16724 using namespace :: [opt] nested-name-specifier [opt]
16725 namespace-name ; */
16727 static void
16729 {
16730 tree namespace_decl;
16731 tree attribs;
16733 /* Look for the `using' keyword. */
16735 /* And the `namespace' keyword. */
16737 /* Look for the optional `::' operator. */
16739 /* And the optional nested-name-specifier. */
16745 /* Get the namespace being used. */
16747 /* And any specified attributes. */
16749 /* Update the symbol table. */
16751 /* Look for the final `;'. */
16753 }
16755 /* Parse an asm-definition.
16757 asm-definition:
16758 asm ( string-literal ) ;
16760 GNU Extension:
16762 asm-definition:
16763 asm volatile [opt] ( string-literal ) ;
16764 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16765 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16766 : asm-operand-list [opt] ) ;
16767 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16768 : asm-operand-list [opt]
16769 : asm-clobber-list [opt] ) ;
16770 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16771 : asm-clobber-list [opt]
16772 : asm-goto-list ) ; */
16774 static void
16776 {
16777 tree string;
16782 tree asm_stmt;
16790 /* Look for the `asm' keyword. */
16792 /* See if the next token is `volatile'. */
16795 {
16796 /* Remember that we saw the `volatile' keyword. */
16798 /* Consume the token. */
16800 }
16804 {
16805 /* Remember that we saw the `goto' keyword. */
16807 /* Consume the token. */
16809 }
16810 /* Look for the opening `('. */
16813 /* Look for the string. */
16816 {
16820 }
16822 /* If we're allowing GNU extensions, check for the extended assembly
16823 syntax. Unfortunately, the `:' tokens need not be separated by
16824 a space in C, and so, for compatibility, we tolerate that here
16825 too. Doing that means that we have to treat the `::' operator as
16826 two `:' tokens. */
16831 {
16836 /* The extended syntax was used. */
16839 /* Look for outputs. */
16841 {
16842 /* Consume the `:'. */
16844 /* Parse the output-operands. */
16846 CPP_COLON)
16848 CPP_SCOPE)
16850 CPP_CLOSE_PAREN)
16856 }
16857 /* If the next token is `::', there are no outputs, and the
16858 next token is the beginning of the inputs. */
16860 /* The inputs are coming next. */
16863 /* Look for inputs. */
16866 {
16867 /* Consume the `:' or `::'. */
16869 /* Parse the output-operands. */
16871 CPP_COLON)
16873 CPP_SCOPE)
16875 CPP_CLOSE_PAREN))
16880 }
16882 /* The clobbers are coming next. */
16885 /* Look for clobbers. */
16888 {
16890 /* Consume the `:' or `::'. */
16892 /* Parse the clobbers. */
16894 CPP_COLON)
16896 CPP_CLOSE_PAREN))
16898 }
16901 /* The labels are coming next. */
16904 /* Look for labels. */
16907 {
16909 /* Consume the `:' or `::'. */
16911 /* Parse the labels. */
16913 }
16917 }
16921 /* Look for the closing `)'. */
16929 {
16930 /* Create the ASM_EXPR. */
16932 {
16935 /* If the extended syntax was not used, mark the ASM_EXPR. */
16937 {
16943 }
16944 }
16945 else
16947 }
16948 }
16950 // An RAII guard that manages the current template reuqirememts. The
16951 // constructor takes a boolean value, SAVE that, when true, resets
16952 // the current template requirements on construction. Otherwise, no change
16953 // is made. When the destructor is invoked, the current template requirements
16954 // are reset (made null) preventing subsequent parsing routines from using
16955 // them.
16958 tree reqs;
16960 // Construct the guard. If SAVE is true, the current requirements
16961 // saved and reset. Otherwise, no action is taken.
16964 { }
16967 {
16969 }
16970 };
16972 // A DECLARATOR may have a trailing requires clause; it may also have
16973 // requirements introduced through the use of terse notation in the
16974 // declaration of function parameters. Returns the parsed and analyzed
16975 // template requirements.
16976 static tree
16978 {
16980 {
16981 // Get any constraints induced by the terse notaiton.
16986 // An optional requires clause can yield an additional constraint.
16989 // If requirements were specified in either the implicit
16990 // template parameter list or an explicit requires clause,
16991 // prepare to associate those with the declaration.
16994 }
16997 }
17000 /* Declarators [gram.dcl.decl] */
17002 /* Parse an init-declarator.
17004 init-declarator:
17005 declarator initializer [opt]
17007 GNU Extension:
17009 init-declarator:
17010 declarator asm-specification [opt] attributes [opt] initializer [opt]
17012 function-definition:
17013 decl-specifier-seq [opt] declarator ctor-initializer [opt]
17014 function-body
17015 decl-specifier-seq [opt] declarator function-try-block
17017 GNU Extension:
17019 function-definition:
17020 __extension__ function-definition
17022 TM Extension:
17024 function-definition:
17025 decl-specifier-seq [opt] declarator function-transaction-block
17027 The DECL_SPECIFIERS apply to this declarator. Returns a
17028 representation of the entity declared. If MEMBER_P is TRUE, then
17029 this declarator appears in a class scope. The new DECL created by
17030 this declarator is returned.
17032 The CHECKS are access checks that should be performed once we know
17033 what entity is being declared (and, therefore, what classes have
17034 befriended it).
17036 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
17037 for a function-definition here as well. If the declarator is a
17038 declarator for a function-definition, *FUNCTION_DEFINITION_P will
17039 be TRUE upon return. By that point, the function-definition will
17040 have been completely parsed.
17042 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
17043 is FALSE.
17045 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
17046 parsed declaration if it is an uninitialized single declarator not followed
17047 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
17048 if present, will not be consumed. If returned, this declarator will be
17049 created with SD_INITIALIZED but will not call cp_finish_decl. */
17051 static tree
17060 {
17064 tree prefix_attributes;
17066 tree asm_specification;
17067 tree initializer;
17069 tree scope;
17071 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
17072 initialized with "= ..", CPP_OPEN_PAREN if initialized with
17073 "(...)". */
17083 /* Gather the attributes that were provided with the
17084 decl-specifiers. */
17087 /* Assume that this is not the declarator for a function
17088 definition. */
17092 /* Default arguments are only permitted for function parameters. */
17096 /* Defer access checks while parsing the declarator; we cannot know
17097 what names are accessible until we know what is being
17098 declared. */
17101 /* Parse the declarator. */
17103 declarator
17108 /* Gather up the deferred checks. */
17113 /* If the DECLARATOR was erroneous, there's no need to go
17114 further. */
17118 /* Check that the number of template-parameter-lists is OK. */
17128 /* Figure out what scope the entity declared by the DECLARATOR is
17129 located in. `grokdeclarator' sometimes changes the scope, so
17130 we compute it now. */
17133 /* Perform any lookups in the declared type which were thought to be
17134 dependent, but are not in the scope of the declarator. */
17135 decl_specifiers->type
17138 /* If we're allowing GNU extensions, look for an
17139 asm-specification. */
17141 {
17142 /* Look for an asm-specification. */
17145 }
17146 else
17149 /* Look for attributes. */
17154 // If scope is non-null, then we're parsing a declarator with
17155 // a nested-name specifier. It's possible that some component of
17156 // that specifier is bringing template contsraints with it, which
17157 // we need to suppress for for the time being. For example:
17158 //
17159 // template<typename T>
17160 // requires C<T>()
17161 // void S<T>::f() requires D<T>() { ... }
17162 //
17163 // At the point we parse the 2nd requires clause, the previous the
17164 // current constraints will have been used to resolve the enclosing
17165 // class S<T>. The D<T>() requirement applies only to the definition
17166 // of f and do not include C<T>().
17167 //
17168 // Save requirements, resetting them if the scope was established.
17171 // TODO: Check that a declaration does not have 2 requires clauses.
17173 // Parse an optional trailing requires clause for the parsed declarator.
17177 /* Peek at the next token. */
17181 {
17182 /* Check to see if the token indicates the start of a
17183 function-definition. */
17185 {
17187 {
17188 /* If a function-definition should not appear here, issue an
17189 error message. */
17193 }
17195 location_t func_brace_location
17198 /* Neither attributes nor an asm-specification are allowed
17199 on a function-definition. */
17202 "an asm-specification is not allowed "
17206 "attributes are not allowed "
17208 /* This is a function-definition. */
17211 /* Parse the function definition. */
17214 decl_specifiers,
17215 declarator,
17216 prefix_attributes);
17217 else
17218 decl =
17219 (cp_parser_function_definition_from_specifiers_and_declarator
17223 {
17224 /* This is where the prologue starts... */
17227 }
17230 }
17231 }
17233 /* [dcl.dcl]
17235 Only in function declarations for constructors, destructors, and
17236 type conversions can the decl-specifier-seq be omitted.
17238 We explicitly postpone this check past the point where we handle
17239 function-definitions because we tolerate function-definitions
17240 that are missing their return types in some modes. */
17242 {
17246 }
17248 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17252 {
17260 {
17266 }
17267 }
17268 else
17269 {
17270 /* If the init-declarator isn't initialized and isn't followed by a
17271 `,' or `;', it's not a valid init-declarator. */
17274 {
17277 else
17278 {
17281 }
17282 }
17285 }
17287 /* Because start_decl has side-effects, we should only call it if we
17288 know we're going ahead. By this point, we know that we cannot
17289 possibly be looking at any other construct. */
17292 /* If the decl specifiers were bad, issue an error now that we're
17293 sure this was intended to be a declarator. Then continue
17294 declaring the variable(s), as int, to try to cut down on further
17295 errors. */
17298 {
17301 }
17303 /* Enter the newly declared entry in the symbol table. If we're
17304 processing a declaration in a class-specifier, we wait until
17305 after processing the initializer. */
17307 {
17314 /* Adjust location of decl if declarator->id_loc is more appropriate:
17315 set, and decl wasn't merged with another decl, in which case its
17316 location would be different from input_location, and more accurate. */
17321 }
17323 /* Enter the SCOPE. That way unqualified names appearing in the
17324 initializer will be looked up in SCOPE. */
17327 /* Perform deferred access control checks, now that we know in which
17328 SCOPE the declared entity resides. */
17330 {
17333 /* If the entity being declared is a function, pretend that we
17334 are in its scope. If it is a `friend', it may have access to
17335 things that would not otherwise be accessible. */
17337 {
17340 }
17342 /* Perform access checks for template parameters. */
17345 /* Perform the access control checks for the declarator and the
17346 decl-specifiers. */
17349 /* Restore the saved value. */
17352 }
17354 /* Parse the initializer. */
17359 {
17361 {
17365 else
17366 {
17367 /* If the declaration was erroneous, we don't really
17368 know what the user intended, so just silently
17369 consume the initializer. */
17377 }
17378 }
17379 else
17380 {
17381 /* We want to record the extra mangling scope for in-class
17382 initializers of class members and initializers of static data
17383 member templates. The former involves deferring
17384 parsing of the initializer until end of class as with default
17385 arguments. So right here we only handle the latter. */
17395 }
17396 }
17398 /* The old parser allows attributes to appear after a parenthesized
17399 initializer. Mark Mitchell proposed removing this functionality
17400 on the GCC mailing lists on 2002-08-13. This parser accepts the
17401 attributes -- but ignores them. */
17408 /* A non-template declaration involving a function parameter list containing
17409 an implicit template parameter will have been made into a template. If it
17410 turns out that the resulting declaration is not an actual function then
17411 finish the template declaration here. An error message will already have
17412 been issued. */
17415 {
17417 {
17420 }
17422 }
17424 /* For an in-class declaration, use `grokfield' to create the
17425 declaration. */
17427 {
17429 {
17432 }
17440 }
17442 /* Finish processing the declaration. But, skip member
17443 declarations. */
17445 {
17448 asm_specification,
17449 /* If the initializer is in parentheses, then this is
17450 a direct-initialization, which means that an
17451 `explicit' constructor is OK. Otherwise, an
17452 `explicit' constructor cannot be used. */
17455 }
17458 /* Core issue #226 (C++0x only): A default template-argument
17459 shall not be specified in a friend class template
17460 declaration. */
17469 {
17472 else
17474 }
17477 }
17479 /* Parse a declarator.
17481 declarator:
17482 direct-declarator
17483 ptr-operator declarator
17485 abstract-declarator:
17486 ptr-operator abstract-declarator [opt]
17487 direct-abstract-declarator
17489 GNU Extensions:
17491 declarator:
17492 attributes [opt] direct-declarator
17493 attributes [opt] ptr-operator declarator
17495 abstract-declarator:
17496 attributes [opt] ptr-operator abstract-declarator [opt]
17497 attributes [opt] direct-abstract-declarator
17499 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17500 detect constructor, destructor or conversion operators. It is set
17501 to -1 if the declarator is a name, and +1 if it is a
17502 function. Otherwise it is set to zero. Usually you just want to
17503 test for >0, but internally the negative value is used.
17505 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17506 a decl-specifier-seq unless it declares a constructor, destructor,
17507 or conversion. It might seem that we could check this condition in
17508 semantic analysis, rather than parsing, but that makes it difficult
17509 to handle something like `f()'. We want to notice that there are
17510 no decl-specifiers, and therefore realize that this is an
17511 expression, not a declaration.)
17513 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17514 the declarator is a direct-declarator of the form "(...)".
17516 MEMBER_P is true iff this declarator is a member-declarator.
17518 FRIEND_P is true iff this declarator is a friend. */
17522 cp_parser_declarator_kind dcl_kind,
17526 {
17529 cp_cv_quals cv_quals;
17530 tree class_type;
17533 /* Assume this is not a constructor, destructor, or type-conversion
17534 operator. */
17541 /* Check for the ptr-operator production. */
17543 /* Parse the ptr-operator. */
17549 /* If that worked, then we have a ptr-operator. */
17551 {
17552 /* If a ptr-operator was found, then this declarator was not
17553 parenthesized. */
17556 /* The dependent declarator is optional if we are parsing an
17557 abstract-declarator. */
17561 /* Parse the dependent declarator. */
17566 friend_p);
17568 /* If we are parsing an abstract-declarator, we must handle the
17569 case where the dependent declarator is absent. */
17574 declarator = cp_parser_make_indirect_declarator
17576 }
17577 /* Everything else is a direct-declarator. */
17578 else
17579 {
17582 CPP_OPEN_PAREN);
17584 ctor_dtor_or_conv_p,
17586 }
17592 }
17594 /* Parse a direct-declarator or direct-abstract-declarator.
17596 direct-declarator:
17597 declarator-id
17598 direct-declarator ( parameter-declaration-clause )
17599 cv-qualifier-seq [opt]
17600 ref-qualifier [opt]
17601 exception-specification [opt]
17602 direct-declarator [ constant-expression [opt] ]
17603 ( declarator )
17605 direct-abstract-declarator:
17606 direct-abstract-declarator [opt]
17607 ( parameter-declaration-clause )
17608 cv-qualifier-seq [opt]
17609 ref-qualifier [opt]
17610 exception-specification [opt]
17611 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17612 ( abstract-declarator )
17614 Returns a representation of the declarator. DCL_KIND is
17615 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17616 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17617 we are parsing a direct-declarator. It is
17618 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17619 of ambiguity we prefer an abstract declarator, as per
17620 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17621 as for cp_parser_declarator. */
17625 cp_parser_declarator_kind dcl_kind,
17628 {
17638 {
17639 /* Peek at the next token. */
17642 {
17643 /* This is either a parameter-declaration-clause, or a
17644 parenthesized declarator. When we know we are parsing a
17645 named declarator, it must be a parenthesized declarator
17646 if FIRST is true. For instance, `(int)' is a
17647 parameter-declaration-clause, with an omitted
17648 direct-abstract-declarator. But `((*))', is a
17649 parenthesized abstract declarator. Finally, when T is a
17650 template parameter `(T)' is a
17651 parameter-declaration-clause, and not a parenthesized
17652 named declarator.
17654 We first try and parse a parameter-declaration-clause,
17655 and then try a nested declarator (if FIRST is true).
17657 It is not an error for it not to be a
17658 parameter-declaration-clause, even when FIRST is
17659 false. Consider,
17661 int i (int);
17662 int i (3);
17664 The first is the declaration of a function while the
17665 second is the definition of a variable, including its
17666 initializer.
17668 Having seen only the parenthesis, we cannot know which of
17669 these two alternatives should be selected. Even more
17670 complex are examples like:
17672 int i (int (a));
17673 int i (int (3));
17675 The former is a function-declaration; the latter is a
17676 variable initialization.
17678 Thus again, we try a parameter-declaration-clause, and if
17679 that fails, we back out and return. */
17682 {
17683 tree params;
17686 /* In a member-declarator, the only valid interpretation
17687 of a parenthesis is the start of a
17688 parameter-declaration-clause. (It is invalid to
17689 initialize a static data member with a parenthesized
17690 initializer; only the "=" form of initialization is
17691 permitted.) */
17695 /* Consume the `('. */
17698 {
17699 /* If this is going to be an abstract declarator, we're
17700 in a declarator and we can't have default args. */
17703 }
17707 /* Parse the parameter-declaration-clause. */
17710 /* Consume the `)'. */
17713 /* If all went well, parse the cv-qualifier-seq,
17714 ref-qualifier and the exception-specification. */
17716 {
17717 cp_cv_quals cv_quals;
17718 cp_virt_specifiers virt_specifiers;
17719 cp_ref_qualifier ref_qual;
17720 tree exception_specification;
17721 tree late_return;
17722 tree attrs;
17732 /* Parse the cv-qualifier-seq. */
17734 /* Parse the ref-qualifier. */
17736 /* And the exception-specification. */
17737 exception_specification
17742 /* In here, we handle cases where attribute is used after
17743 the function declaration. For example:
17744 void func (int x) __attribute__((vector(..))); */
17747 {
17751 CPP_SEMICOLON)
17753 CPP_OPEN_BRACE))
17756 ;
17757 else
17759 }
17760 late_return = (cp_parser_late_return_type_opt
17765 /* Parse the virt-specifier-seq. */
17768 /* Create the function-declarator. */
17770 params,
17771 cv_quals,
17772 virt_specifiers,
17773 ref_qual,
17774 exception_specification,
17775 late_return);
17777 /* Any subsequent parameter lists are to do with
17778 return type, so are not those of the declared
17779 function. */
17781 }
17783 /* Remove the function parms from scope. */
17787 /* Repeat the main loop. */
17789 }
17791 /* If this is the first, we can try a parenthesized
17792 declarator. */
17794 {
17800 /* Consume the `('. */
17802 /* Parse the nested declarator. */
17805 declarator
17811 /* Expect a `)'. */
17818 }
17819 /* Otherwise, we must be done. */
17820 else
17822 }
17826 {
17827 /* Parse an array-declarator. */
17836 /* Consume the `['. */
17838 /* Peek at the next token. */
17840 /* If the next token is `]', then there is no
17841 constant-expression. */
17843 {
17845 bounds
17855 {
17856 /* Normally, the array bound must be an integral constant
17857 expression. However, as an extension, we allow VLAs
17858 in function scopes as long as they aren't part of a
17859 parameter declaration. */
17863 }
17866 {
17867 /* Remember this wasn't a constant-expression. */
17870 }
17871 }
17872 else
17874 /* Look for the closing `]'. */
17876 {
17879 }
17884 }
17886 {
17887 {
17888 tree qualifying_scope;
17889 tree unqualified_name;
17890 tree attrs;
17891 special_function_kind sfk;
17896 /* Parse a declarator-id */
17899 {
17902 /* If we see an ellipsis, we should be looking at a
17903 parameter pack. */
17905 {
17906 /* Consume the `...' */
17910 }
17911 }
17914 unqualified_name
17918 {
17922 {
17923 /* Check whether an error occurred. */
17926 /* We already consumed the ellipsis to mark a
17927 parameter pack, but we have no way to report it,
17928 so abort the tentative parse. We will be exiting
17929 immediately anyway. */
17931 }
17932 else
17938 && (qualifying_scope
17940 {
17943 }
17944 }
17949 {
17954 }
17960 {
17961 /* In the declaration of a member of a template class
17962 outside of the class itself, the SCOPE will sometimes
17963 be a TYPENAME_TYPE. For example, given:
17965 template <typename T>
17966 int S<T>::R::i = 3;
17968 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17969 this context, we must resolve S<T>::R to an ordinary
17970 type, rather than a typename type.
17972 The reason we normally avoid resolving TYPENAME_TYPEs
17973 is that a specialization of `S' might render
17974 `S<T>::R' not a type. However, if `S' is
17975 specialized, then this `i' will not be used, so there
17976 is no harm in resolving the types here. */
17977 tree type;
17979 /* Resolve the TYPENAME_TYPE. */
17982 /* If that failed, the declarator is invalid. */
17984 {
17987 "cannot define member of dependent typedef "
17989 else
17994 }
17996 }
18001 {
18002 tree class_type;
18007 else
18011 {
18014 {
18017 {
18021 "use %<%T::%D%> instead of %<%T::%D%> to "
18023 class_type,
18028 }
18029 else
18031 }
18032 else
18033 {
18034 /* We do not attempt to print the declarator
18035 here because we do not have enough
18036 information about its original syntactic
18037 form. */
18041 }
18042 }
18045 {
18051 for an anonymous type, even if the type
18052 got a name for linkage purposes. */
18054 /* Handle correctly (c++/19200):
18056 struct S {
18057 struct T{};
18058 friend void S(T);
18059 };
18061 and also:
18063 namespace N {
18064 void S();
18065 }
18067 struct S {
18068 friend void N::S();
18069 }; */
18070 && !(friend_p
18073 class_type))
18074 {
18077 }
18085 }
18086 }
18088 unqualified_name,
18089 sfk);
18096 }
18098 handle_declarator:;
18101 {
18102 /* Any names that appear after the declarator-id for a
18103 member are looked up in the containing scope. */
18105 {
18106 /* But declarations with qualified-ids can't appear in a
18107 function. */
18111 }
18113 }
18117 /* Default args are only allowed on function
18118 declarations. */
18120 else
18124 }
18125 /* We're done. */
18126 else
18128 }
18130 /* For an abstract declarator, we might wind up with nothing at this
18131 point. That's an error; the declarator is not optional. */
18135 /* If we entered a scope, we must exit it now. */
18143 }
18145 /* Parse a ptr-operator.
18147 ptr-operator:
18148 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18149 * cv-qualifier-seq [opt]
18150 &
18151 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18152 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18154 GNU Extension:
18156 ptr-operator:
18157 & cv-qualifier-seq [opt]
18159 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18160 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18161 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18162 filled in with the TYPE containing the member. *CV_QUALS is
18163 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18164 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18165 Note that the tree codes returned by this function have nothing
18166 to do with the types of trees that will be eventually be created
18167 to represent the pointer or reference type being parsed. They are
18168 just constants with suggestive names. */
18169 static enum tree_code
18174 {
18179 /* Assume that it's not a pointer-to-member. */
18181 /* And that there are no cv-qualifiers. */
18184 /* Peek at the next token. */
18187 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18197 {
18198 /* Consume the `*', `&' or `&&'. */
18201 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18202 `&', if we are allowing GNU extensions. (The only qualifier
18203 that can legally appear after `&' is `restrict', but that is
18204 enforced during semantic analysis. */
18212 }
18213 else
18214 {
18215 /* Try the pointer-to-member case. */
18217 /* Look for the optional `::' operator. */
18220 /* Look for the nested-name specifier. */
18227 /* If we found it, and the next token is a `*', then we are
18228 indeed looking at a pointer-to-member operator. */
18231 {
18232 /* Indicate that the `*' operator was used. */
18240 else
18241 {
18242 /* The type of which the member is a member is given by the
18243 current SCOPE. */
18245 /* The next name will not be qualified. */
18249 /* Look for optional c++11 attributes. */
18253 /* Look for the optional cv-qualifier-seq. */
18255 }
18256 }
18257 /* If that didn't work we don't have a ptr-operator. */
18260 }
18263 }
18265 /* Parse an (optional) cv-qualifier-seq.
18267 cv-qualifier-seq:
18268 cv-qualifier cv-qualifier-seq [opt]
18270 cv-qualifier:
18271 const
18272 volatile
18274 GNU Extension:
18276 cv-qualifier:
18277 __restrict__
18279 Returns a bitmask representing the cv-qualifiers. */
18281 static cp_cv_quals
18283 {
18287 {
18289 cp_cv_quals cv_qualifier;
18291 /* Peek at the next token. */
18293 /* See if it's a cv-qualifier. */
18295 {
18311 }
18317 {
18320 }
18321 else
18322 {
18325 }
18326 }
18329 }
18331 /* Parse an (optional) ref-qualifier
18333 ref-qualifier:
18334 &
18335 &&
18337 Returns cp_ref_qualifier representing ref-qualifier. */
18339 static cp_ref_qualifier
18341 {
18344 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18349 {
18354 {
18366 }
18371 {
18374 }
18375 else
18376 {
18379 }
18380 }
18383 }
18385 /* Parse an (optional) virt-specifier-seq.
18387 virt-specifier-seq:
18388 virt-specifier virt-specifier-seq [opt]
18390 virt-specifier:
18391 override
18392 final
18394 Returns a bitmask representing the virt-specifiers. */
18396 static cp_virt_specifiers
18398 {
18402 {
18404 cp_virt_specifiers virt_specifier;
18406 /* Peek at the next token. */
18408 /* See if it's a virt-specifier-qualifier. */
18412 {
18415 }
18417 {
18420 }
18422 {
18424 }
18425 else
18429 {
18432 }
18433 else
18434 {
18437 }
18438 }
18440 }
18442 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18443 is in scope even though it isn't real. */
18445 void
18447 {
18448 tree this_parm;
18451 {
18452 /* We don't clear this between NSDMIs. Is it already what we want? */
18457 }
18460 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18462 current_class_ref
18465 }
18467 /* Return true iff our current scope is a non-static data member
18468 initializer. */
18470 bool
18472 {
18473 /* We recognize NSDMI context by the context-less 'this' pointer set up
18474 by the function above. */
18478 }
18480 /* Parse a late-specified return type, if any. This is not a separate
18481 non-terminal, but part of a function declarator, which looks like
18483 -> trailing-type-specifier-seq abstract-declarator(opt)
18485 Returns the type indicated by the type-id.
18487 In addition to this this parses any queued up omp declare simd
18488 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18490 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18491 function. */
18493 static tree
18495 cp_cv_quals quals)
18496 {
18500 && declarator
18506 /* Peek at the next token. */
18508 /* A late-specified return type is indicated by an initial '->'. */
18515 {
18516 /* DR 1207: 'this' is in scope in the trailing return type. */
18518 }
18521 {
18522 /* Consume the ->. */
18525 }
18528 declarator->std_attributes
18532 declarator->std_attributes
18537 {
18540 }
18543 }
18545 /* Parse a declarator-id.
18547 declarator-id:
18548 id-expression
18549 :: [opt] nested-name-specifier [opt] type-name
18551 In the `id-expression' case, the value returned is as for
18552 cp_parser_id_expression if the id-expression was an unqualified-id.
18553 If the id-expression was a qualified-id, then a SCOPE_REF is
18554 returned. The first operand is the scope (either a NAMESPACE_DECL
18555 or TREE_TYPE), but the second is still just a representation of an
18556 unqualified-id. */
18558 static tree
18560 {
18561 tree id;
18562 /* The expression must be an id-expression. Assume that qualified
18563 names are the names of types so that:
18565 template <class T>
18566 int S<T>::R::i = 3;
18568 will work; we must treat `S<T>::R' as the name of a type.
18569 Similarly, assume that qualified names are templates, where
18570 required, so that:
18572 template <class T>
18573 int S<T>::R<T>::i = 3;
18575 will work, too. */
18581 optional_p);
18585 }
18587 /* Parse a type-id.
18589 type-id:
18590 type-specifier-seq abstract-declarator [opt]
18592 Returns the TYPE specified. */
18594 static tree
18597 {
18598 cp_decl_specifier_seq type_specifier_seq;
18601 /* Parse the type-specifier-seq. */
18603 is_trailing_return,
18608 /* There might or might not be an abstract declarator. */
18610 /* Look for the declarator. */
18611 abstract_declarator
18616 /* Check to see if there really was a declarator. */
18621 /* None of the valid uses of 'auto' in C++14 involve the type-id
18622 nonterminal, but it is valid in a trailing-return-type. */
18625 {
18626 /* A type-id with type 'auto' is only ok if the abstract declarator
18627 is a function declarator with a late-specified return type.
18629 A type-id with 'auto' is also valid in a trailing-return-type
18630 in a compound-requirment. */
18637 else
18638 {
18641 }
18642 }
18645 is_template_arg);
18646 }
18649 {
18651 }
18654 {
18655 tree r;
18657 parser->type_definition_forbidden_message
18662 {
18665 }
18667 }
18670 {
18672 }
18674 /* Parse a type-specifier-seq.
18676 type-specifier-seq:
18677 type-specifier type-specifier-seq [opt]
18679 GNU extension:
18681 type-specifier-seq:
18682 attributes type-specifier-seq [opt]
18684 If IS_DECLARATION is true, we are at the start of a "condition" or
18685 exception-declaration, so we might be followed by a declarator-id.
18687 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18688 i.e. we've just seen "->".
18690 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18692 static void
18697 {
18702 /* Clear the TYPE_SPECIFIER_SEQ. */
18705 /* In the context of a trailing return type, enum E { } is an
18706 elaborated-type-specifier followed by a function-body, not an
18707 enum-specifier. */
18711 /* Parse the type-specifiers and attributes. */
18713 {
18714 tree type_specifier;
18717 /* Check for attributes first. */
18719 {
18724 }
18726 /* record the token of the beginning of the type specifier seq,
18727 for error reporting purposes*/
18731 /* Look for the type-specifier. */
18733 flags,
18734 type_specifier_seq,
18736 NULL,
18739 {
18740 /* If the first type-specifier could not be found, this is not a
18741 type-specifier-seq at all. */
18743 {
18744 /* Set in_declarator_p to avoid skipping to the semicolon. */
18756 }
18757 /* If subsequent type-specifiers could not be found, the
18758 type-specifier-seq is complete. */
18760 }
18763 /* The standard says that a condition can be:
18765 type-specifier-seq declarator = assignment-expression
18767 However, given:
18769 struct S {};
18770 if (int S = ...)
18772 we should treat the "S" as a declarator, not as a
18773 type-specifier. The standard doesn't say that explicitly for
18774 type-specifier-seq, but it does say that for
18775 decl-specifier-seq in an ordinary declaration. Perhaps it
18776 would be clearer just to allow a decl-specifier-seq here, and
18777 then add a semantic restriction that if any decl-specifiers
18778 that are not type-specifiers appear, the program is invalid. */
18781 }
18782 }
18784 /* Return whether the function currently being declared has an associated
18785 template parameter list. */
18787 static bool
18789 {
18802 }
18804 /* Parse a parameter-declaration-clause.
18806 parameter-declaration-clause:
18807 parameter-declaration-list [opt] ... [opt]
18808 parameter-declaration-list , ...
18810 Returns a representation for the parameter declarations. A return
18811 value of NULL indicates a parameter-declaration-clause consisting
18812 only of an ellipsis. */
18814 static tree
18816 {
18817 tree parameters;
18826 parser->auto_is_implicit_function_template_parm_p
18828 }
18834 && !processing_template_parmlist
18840 /* Peek at the next token. */
18842 /* Check for trivial parameter-declaration-clauses. */
18844 {
18845 /* Consume the `...' token. */
18848 }
18850 /* There are no parameters. */
18851 {
18852 #ifndef NO_IMPLICIT_EXTERN_C
18857 else
18858 #endif
18860 }
18861 /* Check for `(void)', too, which is a special case. */
18865 {
18866 /* Consume the `void' token. */
18868 /* There are no parameters. */
18870 }
18872 /* Parse the parameter-declaration-list. */
18874 /* If a parse error occurred while parsing the
18875 parameter-declaration-list, then the entire
18876 parameter-declaration-clause is erroneous. */
18880 /* Peek at the next token. */
18882 /* If it's a `,', the clause should terminate with an ellipsis. */
18884 {
18885 /* Consume the `,'. */
18887 /* Expect an ellipsis. */
18888 ellipsis_p
18890 }
18891 /* It might also be `...' if the optional trailing `,' was
18892 omitted. */
18894 {
18895 /* Consume the `...' token. */
18897 /* And remember that we saw it. */
18899 }
18900 else
18903 /* Finish the parameter list. */
18908 }
18910 /* Parse a parameter-declaration-list.
18912 parameter-declaration-list:
18913 parameter-declaration
18914 parameter-declaration-list , parameter-declaration
18916 Returns a representation of the parameter-declaration-list, as for
18917 cp_parser_parameter_declaration_clause. However, the
18918 `void_list_node' is never appended to the list. Upon return,
18919 *IS_ERROR will be true iff an error occurred. */
18921 static tree
18923 {
18929 /* Assume all will go well. */
18931 /* The special considerations that apply to a function within an
18932 unbraced linkage specifications do not apply to the parameters
18933 to the function. */
18934 saved_in_unbraced_linkage_specification_p
18938 /* Look for more parameters. */
18940 {
18948 /* Parse the parameter. */
18949 parameter
18954 /* We don't know yet if the enclosing context is deprecated, so wait
18955 and warn in grokparms if appropriate. */
18959 {
18960 /* If a function parameter pack was specified and an implicit template
18961 parameter was introduced during cp_parser_parameter_declaration,
18962 change any implicit parameters introduced into packs. */
18966 {
18974 }
18978 PARM,
18981 }
18985 /* If a parse error occurred parsing the parameter declaration,
18986 then the entire parameter-declaration-list is erroneous. */
18988 {
18992 }
19002 {
19006 }
19008 /* Add the new parameter to the list. */
19012 /* Peek at the next token. */
19015 /* These are for Objective-C++ */
19018 /* The parameter-declaration-list is complete. */
19021 {
19024 /* Peek at the next token. */
19026 /* If it's an ellipsis, then the list is complete. */
19029 /* Otherwise, there must be more parameters. Consume the
19030 `,'. */
19032 /* When parsing something like:
19034 int i(float f, double d)
19036 we can tell after seeing the declaration for "f" that we
19037 are not looking at an initialization of a variable "i",
19038 but rather at the declaration of a function "i".
19040 Due to the fact that the parsing of template arguments
19041 (as specified to a template-id) requires backtracking we
19042 cannot use this technique when inside a template argument
19043 list. */
19047 /* However, a parameter-declaration of the form
19048 "float(f)" (which is a valid declaration of a
19049 parameter "f") can also be interpreted as an
19050 expression (the conversion of "f" to "float"). */
19053 }
19054 else
19055 {
19063 }
19064 }
19066 parser->in_unbraced_linkage_specification_p
19069 /* Reset implicit_template_scope if we are about to leave the function
19070 parameter list that introduced it. Note that for out-of-line member
19071 definitions, there will be one or more class scopes before we get to
19072 the template parameter scope. */
19076 {
19080 {
19083 }
19084 }
19087 }
19089 /* Parse a parameter declaration.
19091 parameter-declaration:
19092 decl-specifier-seq ... [opt] declarator
19093 decl-specifier-seq declarator = assignment-expression
19094 decl-specifier-seq ... [opt] abstract-declarator [opt]
19095 decl-specifier-seq abstract-declarator [opt] = assignment-expression
19097 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
19098 declares a template parameter. (In that case, a non-nested `>'
19099 token encountered during the parsing of the assignment-expression
19100 is not interpreted as a greater-than operator.)
19102 Returns a representation of the parameter, or NULL if an error
19103 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
19104 true iff the declarator is of the form "(p)". */
19110 {
19112 cp_decl_specifier_seq decl_specifiers;
19114 tree default_argument;
19118 /* In a template parameter, `>' is not an operator.
19120 [temp.param]
19122 When parsing a default template-argument for a non-type
19123 template-parameter, the first non-nested `>' is taken as the end
19124 of the template parameter-list rather than a greater-than
19125 operator. */
19127 /* Type definitions may not appear in parameter types. */
19129 parser->type_definition_forbidden_message
19132 /* Parse the declaration-specifiers. */
19134 CP_PARSER_FLAGS_NONE,
19138 /* Complain about missing 'typename' or other invalid type names. */
19143 /* If an error occurred, there's no reason to attempt to parse the
19144 rest of the declaration. */
19146 {
19149 }
19151 /* Peek at the next token. */
19154 /* If the next token is a `)', `,', `=', `>', or `...', then there
19155 is no declarator. However, when variadic templates are enabled,
19156 there may be a declarator following `...'. */
19161 {
19165 }
19166 /* Otherwise, there should be a declarator. */
19167 else
19168 {
19172 /* After seeing a decl-specifier-seq, if the next token is not a
19173 "(", there is no possibility that the code is a valid
19174 expression. Therefore, if parsing tentatively, we commit at
19175 this point. */
19177 /* In an expression context, having seen:
19179 (int((char ...
19181 we cannot be sure whether we are looking at a
19182 function-type (taking a "char" as a parameter) or a cast
19183 of some object of type "char" to "int". */
19189 /* Parse the declarator. */
19192 CP_PARSER_DECLARATOR_EITHER,
19194 parenthesized_p,
19198 /* After the declarator, allow more attributes. */
19199 decl_specifiers.attributes
19202 }
19204 /* If the next token is an ellipsis, and we have not seen a
19205 declarator name, and the type of the declarator contains parameter
19206 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19207 a parameter pack expansion expression. Otherwise, leave the
19208 ellipsis for a C-style variadic function. */
19211 {
19222 {
19223 /* Consume the `...'. */
19227 /* Build a pack expansion type */
19230 else
19232 }
19233 }
19235 /* The restriction on defining new types applies only to the type
19236 of the parameter, not to the default argument. */
19239 /* If the next token is `=', then process a default argument. */
19241 {
19243 /* If we are defining a class, then the tokens that make up the
19244 default argument must be saved and processed later. */
19249 /* Outside of a class definition, we can just parse the
19250 assignment-expression. */
19251 else
19252 default_argument
19256 {
19259 else
19260 {
19262 "default arguments are only "
19265 }
19266 }
19270 {
19271 /* Find the name of the parameter pack. */
19278 template_parm_p
19284 else
19286 template_parm_p
19293 }
19294 }
19295 else
19299 declarator,
19300 default_argument);
19301 }
19303 /* Parse a default argument and return it.
19305 TEMPLATE_PARM_P is true if this is a default argument for a
19306 non-type template parameter. */
19307 static tree
19309 {
19315 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19316 set correctly. */
19319 /* Local variable names (and the `this' keyword) may not
19320 appear in a default argument. */
19323 /* Parse the assignment-expression. */
19328 /* The "this" pointer is not valid in a default argument. */
19330 {
19335 }
19336 default_argument
19338 /* Restore the "this" pointer. */
19340 {
19343 }
19352 }
19354 /* Parse a function-body.
19356 function-body:
19357 compound_statement */
19359 static void
19361 {
19363 }
19365 /* Parse a ctor-initializer-opt followed by a function-body. Return
19366 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19367 is true we are parsing a function-try-block. */
19369 static bool
19372 {
19380 /* Begin the function body. */
19382 /* Parse the optional ctor-initializer. */
19385 /* If we're parsing a constexpr constructor definition, we need
19386 to check that the constructor body is indeed empty. However,
19387 before we get to cp_parser_function_body lot of junk has been
19388 generated, so we can't just check that we have an empty block.
19389 Rather we take a snapshot of the outermost block, and check whether
19390 cp_parser_function_body changed its state. */
19392 {
19396 }
19397 /* Parse the function-body. */
19401 /* Finish the function body. */
19405 }
19407 /* Parse an initializer.
19409 initializer:
19410 = initializer-clause
19411 ( expression-list )
19413 Returns an expression representing the initializer. If no
19414 initializer is present, NULL_TREE is returned.
19416 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19417 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19418 set to TRUE if there is no initializer present. If there is an
19419 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19420 is set to true; otherwise it is set to false. */
19422 static tree
19425 {
19427 tree init;
19429 /* Peek at the next token. */
19432 /* Let our caller know whether or not this initializer was
19433 parenthesized. */
19435 /* Assume that the initializer is constant. */
19439 {
19440 /* Consume the `='. */
19442 /* Parse the initializer-clause. */
19444 }
19446 {
19451 non_constant_p);
19456 }
19458 {
19463 }
19464 else
19465 {
19466 /* Anything else is an error. */
19469 }
19472 }
19474 /* Parse an initializer-clause.
19476 initializer-clause:
19477 assignment-expression
19478 braced-init-list
19480 Returns an expression representing the initializer.
19482 If the `assignment-expression' production is used the value
19483 returned is simply a representation for the expression.
19485 Otherwise, calls cp_parser_braced_list. */
19487 static tree
19489 {
19490 tree initializer;
19492 /* Assume the expression is constant. */
19495 /* If it is not a `{', then we are looking at an
19496 assignment-expression. */
19498 {
19499 initializer
19502 non_constant_p);
19503 }
19504 else
19508 }
19510 /* Parse a brace-enclosed initializer list.
19512 braced-init-list:
19513 { initializer-list , [opt] }
19514 { }
19516 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19517 the elements of the initializer-list (or NULL, if the last
19518 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19519 NULL_TREE. There is no way to detect whether or not the optional
19520 trailing `,' was provided. NON_CONSTANT_P is as for
19521 cp_parser_initializer. */
19523 static tree
19525 {
19526 tree initializer;
19528 /* Consume the `{' token. */
19530 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19532 /* If it's not a `}', then there is a non-trivial initializer. */
19534 {
19535 /* Parse the initializer list. */
19538 /* A trailing `,' token is allowed. */
19541 }
19542 else
19544 /* Now, there should be a trailing `}'. */
19548 }
19550 /* Parse an initializer-list.
19552 initializer-list:
19553 initializer-clause ... [opt]
19554 initializer-list , initializer-clause ... [opt]
19556 GNU Extension:
19558 initializer-list:
19559 designation initializer-clause ...[opt]
19560 initializer-list , designation initializer-clause ...[opt]
19562 designation:
19563 . identifier =
19564 identifier :
19565 [ constant-expression ] =
19567 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19568 for the initializer. If the INDEX of the elt is non-NULL, it is the
19569 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19570 as for cp_parser_initializer. */
19574 {
19577 /* Assume all of the expressions are constant. */
19580 /* Parse the rest of the list. */
19582 {
19584 tree designator;
19585 tree initializer;
19588 /* If the next token is an identifier and the following one is a
19589 colon, we are looking at the GNU designated-initializer
19590 syntax. */
19594 {
19595 /* Warn the user that they are using an extension. */
19598 /* Consume the identifier. */
19600 /* Consume the `:'. */
19602 }
19603 /* Also handle the C99 syntax, '. id ='. */
19608 {
19609 /* Warn the user that they are using an extension. */
19612 /* Consume the `.'. */
19614 /* Consume the identifier. */
19616 /* Consume the `='. */
19618 }
19619 /* Also handle C99 array designators, '[ const ] ='. */
19623 {
19624 /* In C++11, [ could start a lambda-introducer. */
19636 }
19637 else
19640 /* Parse the initializer. */
19643 /* If any clause is non-constant, so is the entire initializer. */
19647 /* If we have an ellipsis, this is an initializer pack
19648 expansion. */
19650 {
19651 /* Consume the `...'. */
19654 /* Turn the initializer into an initializer expansion. */
19656 }
19658 /* Add it to the vector. */
19661 /* If the next token is not a comma, we have reached the end of
19662 the list. */
19666 /* Peek at the next token. */
19668 /* If the next token is a `}', then we're still done. An
19669 initializer-clause can have a trailing `,' after the
19670 initializer-list and before the closing `}'. */
19674 /* Consume the `,' token. */
19676 }
19679 }
19681 /* Classes [gram.class] */
19683 /* Parse a class-name.
19685 class-name:
19686 identifier
19687 template-id
19689 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19690 to indicate that names looked up in dependent types should be
19691 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19692 keyword has been used to indicate that the name that appears next
19693 is a template. TAG_TYPE indicates the explicit tag given before
19694 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19695 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19696 is the class being defined in a class-head.
19698 Returns the TYPE_DECL representing the class. */
19700 static tree
19708 {
19709 tree decl;
19710 tree scope;
19715 /* All class-names start with an identifier. */
19718 {
19721 }
19723 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19724 to a template-id, so we save it here. */
19729 /* Any name names a type if we're following the `typename' keyword
19730 in a qualified name where the enclosing scope is type-dependent. */
19733 /* Handle the common case (an identifier, but not a template-id)
19734 efficiently. */
19737 {
19741 /* Look for the identifier. */
19745 /* If the next token isn't an identifier, we are certainly not
19746 looking at a class-name. */
19749 /* If we know this is a type-name, there's no need to look it
19750 up. */
19753 else
19754 {
19755 tree ambiguous_decls;
19756 /* If we already know that this lookup is ambiguous, then
19757 we've already issued an error message; there's no reason
19758 to check again. */
19760 {
19763 }
19764 /* If the next token is a `::', then the name must be a type
19765 name.
19767 [basic.lookup.qual]
19769 During the lookup for a name preceding the :: scope
19770 resolution operator, object, function, and enumerator
19771 names are ignored. */
19774 /* Look up the name. */
19776 tag_type,
19779 check_dependency_p,
19783 {
19787 }
19788 }
19789 }
19790 else
19791 {
19792 /* Try a template-id. */
19794 check_dependency_p,
19795 tag_type,
19796 is_declaration);
19799 }
19803 /* If this is a typename, create a TYPENAME_TYPE. */
19805 {
19810 }
19814 /* Check to see that it is really the name of a class. */
19818 /* Situations like this:
19820 template <typename T> struct A {
19821 typename T::template X<int>::I i;
19822 };
19824 are problematic. Is `T::template X<int>' a class-name? The
19825 standard does not seem to be definitive, but there is no other
19826 valid interpretation of the following `::'. Therefore, those
19827 names are considered class-names. */
19828 {
19832 }
19836 /* In Objective-C 2.0, a classname followed by '.' starts a
19837 dot-syntax expression, and it's not a type-name. */
19849 }
19851 /* Parse a class-specifier.
19853 class-specifier:
19854 class-head { member-specification [opt] }
19856 Returns the TREE_TYPE representing the class. */
19858 static tree
19860 {
19861 tree type;
19875 /* Parse the class-head. */
19878 /* If the class-head was a semantic disaster, skip the entire body
19879 of the class. */
19881 {
19885 }
19887 /* Look for the `{'. */
19889 {
19892 }
19896 /* Issue an error message if type-definitions are forbidden here. */
19898 /* Remember that we are defining one more class. */
19900 /* Inside the class, surrounding template-parameter-lists do not
19901 apply. */
19902 saved_num_template_parameter_lists
19905 /* We are not in a function body. */
19908 /* Or in a loop. */
19911 /* Or in a switch. */
19914 /* We are not immediately inside an extern "lang" block. */
19915 saved_in_unbraced_linkage_specification_p
19919 /* Start the class. */
19921 {
19924 }
19928 /* If the type is erroneous, skip the entire body of the class. */
19930 else
19931 /* Parse the member-specification. */
19934 /* Look for the trailing `}'. */
19936 /* Look for trailing attributes to apply to this class. */
19944 /* We've finished a type definition. Check for the common syntax
19945 error of forgetting a semicolon after the definition. We need to
19946 be careful, as we can't just check for not-a-semicolon and be done
19947 with it; the user might have typed:
19949 class X { } c = ...;
19950 class X { } *p = ...;
19952 and so forth. Instead, enumerate all the possible tokens that
19953 might follow this production; if we don't see one of them, then
19954 complain and silently insert the semicolon. */
19955 {
19960 /* Don't try to parse c++11 attributes here. As per the
19961 grammar, that should be a task for
19962 cp_parser_decl_specifier_seq. */
19966 {
19977 /* While it's legal for type qualifiers and storage class
19978 specifiers to follow type definitions in the grammar, only
19979 compiler testsuites contain code like that. Assume that if
19980 we see such code, then what we're really seeing is a case
19981 like:
19983 class X { }
19984 const <type> var = ...;
19986 or
19988 class Y { }
19989 static <type> func (...) ...
19991 i.e. the qualifier or specifier applies to the next
19992 declaration. To do so, however, we need to look ahead one
19993 more token to see if *that* token is a type specifier.
19995 This code could be improved to handle:
19997 class Z { }
19998 static const <type> var = ...; */
20001 {
20004 /* Handling user-defined types here would be nice, but very
20005 tricky. */
20006 want_semicolon
20009 }
20013 }
20015 /* If we don't have a type, then something is very wrong and we
20016 shouldn't try to do anything clever. Likewise for not seeing the
20017 closing brace. */
20019 {
20020 cp_token_position prev
20031 else
20034 /* Unget one token and smash it to look as though we encountered
20035 a semicolon in the input stream. */
20040 }
20041 }
20043 /* If this class is not itself within the scope of another class,
20044 then we need to parse the bodies of all of the queued function
20045 definitions. Note that the queued functions defined in a class
20046 are not always processed immediately following the
20047 class-specifier for that class. Consider:
20049 struct A {
20050 struct B { void f() { sizeof (A); } };
20051 };
20053 If `f' were processed before the processing of `A' were
20054 completed, there would be no way to compute the size of `A'.
20055 Note that the nesting we are interested in here is lexical --
20056 not the semantic nesting given by TYPE_CONTEXT. In particular,
20057 for:
20059 struct A { struct B; };
20060 struct A::B { void f() { } };
20062 there is no need to delay the parsing of `A::B::f'. */
20064 {
20065 tree decl;
20072 /* In a first pass, parse default arguments to the functions.
20073 Then, in a second pass, parse the bodies of the functions.
20074 This two-phased approach handles cases like:
20076 struct S {
20077 void f() { g(); }
20078 void g(int i = 3);
20079 };
20081 */
20083 {
20085 /* If there are default arguments that have not yet been processed,
20086 take care of them now. */
20088 {
20093 }
20094 /* Make sure that any template parameters are in scope. */
20096 /* Parse the default argument expressions. */
20098 /* Remove any template parameters from the symbol table. */
20100 }
20102 /* Now parse any NSDMIs. */
20106 {
20108 {
20113 }
20116 }
20123 /* Now do some post-NSDMI bookkeeping. */
20129 /* Now parse the body of the functions. */
20131 {
20132 /* OpenMP UDRs need to be parsed before all other functions. */
20139 }
20140 else
20144 }
20145 else
20148 /* Put back any saved access checks. */
20151 /* Restore saved state. */
20155 parser->num_template_parameter_lists
20157 parser->in_unbraced_linkage_specification_p
20161 }
20163 static tree
20165 {
20166 tree ret;
20171 }
20173 /* Parse a class-head.
20175 class-head:
20176 class-key identifier [opt] base-clause [opt]
20177 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20178 class-key nested-name-specifier [opt] template-id
20179 base-clause [opt]
20181 class-virt-specifier:
20182 final
20184 GNU Extensions:
20185 class-key attributes identifier [opt] base-clause [opt]
20186 class-key attributes nested-name-specifier identifier base-clause [opt]
20187 class-key attributes nested-name-specifier [opt] template-id
20188 base-clause [opt]
20190 Upon return BASES is initialized to the list of base classes (or
20191 NULL, if there are none) in the same form returned by
20192 cp_parser_base_clause.
20194 Returns the TYPE of the indicated class. Sets
20195 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20196 involving a nested-name-specifier was used, and FALSE otherwise.
20198 Returns error_mark_node if this is not a class-head.
20200 Returns NULL_TREE if the class-head is syntactically valid, but
20201 semantically invalid in a way that means we should skip the entire
20202 body of the class. */
20204 static tree
20207 {
20208 tree nested_name_specifier;
20212 tree attributes;
20213 tree bases;
20223 /* Assume no nested-name-specifier will be present. */
20225 /* Assume no template parameter lists will be used in defining the
20226 type. */
20230 /* Look for the class-key. */
20235 /* Parse the attributes. */
20238 /* If the next token is `::', that is invalid -- but sometimes
20239 people do try to write:
20241 struct ::S {};
20243 Handle this gracefully by accepting the extra qualifier, and then
20244 issuing an error about it later if this really is a
20245 class-head. If it turns out just to be an elaborated type
20246 specifier, remain silent. */
20252 /* Determine the name of the class. Begin by looking for an
20253 optional nested-name-specifier. */
20255 nested_name_specifier
20261 /* If there was a nested-name-specifier, then there *must* be an
20262 identifier. */
20264 {
20266 /* Although the grammar says `identifier', it really means
20267 `class-name' or `template-name'. You are only allowed to
20268 define a class that has already been declared with this
20269 syntax.
20271 The proposed resolution for Core Issue 180 says that wherever
20272 you see `class T::X' you should treat `X' as a type-name.
20274 It is OK to define an inaccessible class; for example:
20276 class A { class B; };
20277 class A::B {};
20279 We do not know if we will see a class-name, or a
20280 template-name. We look for a class-name first, in case the
20281 class-name is a template-id; if we looked for the
20282 template-name first we would stop after the template-name. */
20287 class_type,
20291 /* If that didn't work, ignore the nested-name-specifier. */
20293 {
20299 }
20300 /* If we could not find a corresponding TYPE, treat this
20301 declaration like an unqualified declaration. */
20304 /* Otherwise, count the number of templates used in TYPE and its
20305 containing scopes. */
20306 else
20307 {
20308 tree scope;
20320 }
20321 }
20322 /* Otherwise, the identifier is optional. */
20323 else
20324 {
20325 /* We don't know whether what comes next is a template-id,
20326 an identifier, or nothing at all. */
20328 /* Check for a template-id. */
20333 class_key,
20335 /* If that didn't work, it could still be an identifier. */
20337 {
20339 {
20342 }
20343 else
20345 }
20346 else
20347 {
20350 }
20351 }
20356 {
20358 class_key,
20360 }
20363 /* If it's not a `:' or a `{' then we can't really be looking at a
20364 class-head, since a class-head only appears as part of a
20365 class-specifier. We have to detect this situation before calling
20366 xref_tag, since that has irreversible side-effects. */
20368 {
20372 }
20374 /* At this point, we're going ahead with the class-specifier, even
20375 if some other problem occurs. */
20378 {
20383 }
20384 /* Issue the error about the overly-qualified name now. */
20386 {
20391 }
20393 {
20398 }
20400 {
20401 tree scope;
20403 /* Reject typedef-names in class heads. */
20405 {
20408 type);
20411 }
20413 /* Figure out in what scope the declaration is being placed. */
20415 /* If that scope does not contain the scope in which the
20416 class was originally declared, the program is invalid. */
20418 {
20421 "declaration of %qD in namespace %qD which does not "
20424 else
20430 }
20431 /* [dcl.meaning]
20433 A declarator-id shall not be qualified except for the
20434 definition of a ... nested class outside of its class
20435 ... [or] the definition or explicit instantiation of a
20436 class member of a namespace outside of its namespace. */
20438 {
20443 }
20444 }
20445 /* An explicit-specialization must be preceded by "template <>". If
20446 it is not, try to recover gracefully. */
20450 {
20454 /* Take the same action that would have been taken by
20455 cp_parser_explicit_specialization. */
20458 }
20459 /* There must be no "return" statements between this point and the
20460 end of this function; set "type "to the correct return value and
20461 use "goto done;" to return. */
20462 /* Make sure that the right number of template parameters were
20463 present. */
20467 {
20468 /* If something went wrong, there is no point in even trying to
20469 process the class-definition. */
20472 }
20474 /* Look up the type. */
20476 {
20480 {
20484 }
20485 else
20486 {
20489 }
20492 }
20494 {
20495 tree class_type;
20497 /* Given:
20499 template <typename T> struct S { struct T };
20500 template <typename T> struct S<T>::T { };
20502 we will get a TYPENAME_TYPE when processing the definition of
20503 `S::T'. We need to resolve it to the actual type before we
20504 try to define it. */
20506 {
20511 else
20512 {
20515 }
20516 }
20520 {
20523 }
20526 /* Enter the scope indicated by the nested-name-specifier. */
20528 /* Get the canonical version of this type. */
20530 /* Call push_template_decl if it seems like we should be defining a
20531 template either from the template headers or the type we're
20532 defining, so that we diagnose both extra and missing headers. */
20538 {
20541 {
20544 }
20545 }
20549 }
20551 {
20552 /* If the class was unnamed, create a dummy name. */
20557 }
20559 /* Indicate whether this class was declared as a `class' or as a
20560 `struct'. */
20565 /* If this type was already complete, and we see another definition,
20566 that's an error. */
20568 {
20570 type);
20572 type);
20575 }
20580 {
20581 /* Apply attributes now, before any use of the class as a template
20582 argument in its base list. */
20585 }
20587 /* We will have entered the scope containing the class; the names of
20588 base classes should be looked up in that context. For example:
20590 struct A { struct B {}; struct C; };
20591 struct A::C : B {};
20593 is valid. */
20595 /* Get the list of base-classes, if there is one. */
20597 {
20598 /* PR59482: enter the class scope so that base-specifiers are looked
20599 up correctly. */
20603 /* PR59482: get out of the previously pushed class scope so that the
20604 subsequent pops pop the right thing. */
20607 }
20608 else
20611 /* If we're really defining a class, process the base classes.
20612 If they're invalid, fail. */
20617 done:
20618 /* Leave the scope given by the nested-name-specifier. We will
20619 enter the class scope itself while processing the members. */
20624 {
20627 }
20633 out:
20636 }
20638 /* Parse a class-key.
20640 class-key:
20641 class
20642 struct
20643 union
20645 Returns the kind of class-key specified, or none_type to indicate
20646 error. */
20648 static enum tag_types
20650 {
20654 /* Look for the class-key. */
20659 /* Check to see if the TOKEN is a class-key. */
20664 }
20666 /* Parse an (optional) member-specification.
20668 member-specification:
20669 member-declaration member-specification [opt]
20670 access-specifier : member-specification [opt] */
20672 static void
20674 {
20676 {
20680 /* Peek at the next token. */
20682 /* If it's a `}', or EOF then we've seen all the members. */
20688 /* See if this token is a keyword. */
20691 {
20695 /* Consume the access-specifier. */
20697 /* Remember which access-specifier is active. */
20699 /* Look for the `:'. */
20704 /* Accept #pragmas at class scope. */
20706 {
20709 }
20711 /* Otherwise, the next construction must be a
20712 member-declaration. */
20714 }
20715 }
20716 }
20718 /* Parse a member-declaration.
20720 member-declaration:
20721 decl-specifier-seq [opt] member-declarator-list [opt] ;
20722 function-definition ; [opt]
20723 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20724 using-declaration
20725 template-declaration
20726 alias-declaration
20728 member-declarator-list:
20729 member-declarator
20730 member-declarator-list , member-declarator
20732 member-declarator:
20733 declarator pure-specifier [opt]
20734 declarator constant-initializer [opt]
20735 identifier [opt] : constant-expression
20737 GNU Extensions:
20739 member-declaration:
20740 __extension__ member-declaration
20742 member-declarator:
20743 declarator attributes [opt] pure-specifier [opt]
20744 declarator attributes [opt] constant-initializer [opt]
20745 identifier [opt] attributes [opt] : constant-expression
20747 C++0x Extensions:
20749 member-declaration:
20750 static_assert-declaration */
20752 static void
20754 {
20755 cp_decl_specifier_seq decl_specifiers;
20756 tree prefix_attributes;
20757 tree decl;
20766 /* Check for the `__extension__' keyword. */
20768 {
20769 /* Recurse. */
20771 /* Restore the old value of the PEDANTIC flag. */
20775 }
20777 /* Check for a template-declaration. */
20779 {
20780 /* An explicit specialization here is an error condition, and we
20781 expect the specialization handler to detect and report this. */
20785 else
20789 }
20791 /* Check for a using-declaration. */
20793 {
20795 {
20796 /* Parse the using-declaration. */
20800 }
20801 else
20802 {
20803 tree decl;
20807 /* Note that if we actually see the '=' token after the
20808 identifier, cp_parser_alias_declaration commits the
20809 tentative parse. In that case, we really expects an
20810 alias-declaration. Otherwise, we expect a using
20811 declaration. */
20812 alias_decl_expected =
20818 else
20822 }
20823 }
20825 /* Check for @defs. */
20827 {
20832 {
20837 }
20839 }
20841 /* If the next token is `static_assert' we have a static assertion. */
20843 {
20846 }
20853 /* Parse the decl-specifier-seq. */
20856 CP_PARSER_FLAGS_OPTIONAL,
20859 /* Check for an invalid type-name. */
20863 /* If there is no declarator, then the decl-specifier-seq should
20864 specify a type. */
20866 {
20867 /* If there was no decl-specifier-seq, and the next token is a
20868 `;', then we have something like:
20870 struct S { ; };
20872 [class.mem]
20874 Each member-declaration shall declare at least one member
20875 name of the class. */
20877 {
20881 }
20882 else
20883 {
20884 tree type;
20886 /* See if this declaration is a friend. */
20888 /* If there were decl-specifiers, check to see if there was
20889 a class-declaration. */
20892 /* Nested classes have already been added to the class, but
20893 a `friend' needs to be explicitly registered. */
20895 {
20896 /* If the `friend' keyword was present, the friend must
20897 be introduced with a class-key. */
20900 "in C++03 a class-key must be used "
20902 /* In this case:
20904 template <typename T> struct A {
20905 friend struct A<T>::B;
20906 };
20908 A<T>::B will be represented by a TYPENAME_TYPE, and
20909 therefore not recognized by check_tag_decl. */
20911 {
20915 }
20918 "friend declaration does not name a class or "
20920 else
20923 }
20924 /* If there is no TYPE, an error message will already have
20925 been issued. */
20927 ;
20928 /* An anonymous aggregate has to be handled specially; such
20929 a declaration really declares a data member (with a
20930 particular type), as opposed to a nested class. */
20932 {
20933 /* C++11 9.5/6. */
20936 "a storage class on an anonymous aggregate "
20939 /* Remove constructors and such from TYPE, now that we
20940 know it is an anonymous aggregate. */
20942 /* And make the corresponding data member. */
20945 /* Add it to the class. */
20947 }
20948 else
20949 cp_parser_check_access_in_redeclaration
20952 }
20953 }
20954 else
20955 {
20958 /* Clear attributes from the decl_specifiers but keep them
20959 around as prefix attributes that apply them to the entity
20960 being declared. */
20964 /* See if these declarations will be friends. */
20967 /* Keep going until we hit the `;' at the end of the
20968 declaration. */
20970 {
20972 tree first_attribute;
20974 /* Peek at the next token. */
20977 /* Check for a bitfield declaration. */
20982 {
20983 tree identifier;
20984 tree width;
20986 /* Get the name of the bitfield. Note that we cannot just
20987 check TOKEN here because it may have been invalidated by
20988 the call to cp_lexer_peek_nth_token above. */
20991 else
20994 /* Consume the `:' token. */
20996 /* Get the width of the bitfield. */
20997 width
21000 NULL);
21002 /* Look for attributes that apply to the bitfield. */
21004 /* Remember which attributes are prefix attributes and
21005 which are not. */
21007 /* Combine the attributes. */
21010 /* Create the bitfield declaration. */
21013 identifier,
21014 sfk_none)
21017 width,
21018 attributes);
21019 }
21020 else
21021 {
21023 tree initializer;
21024 tree asm_specification;
21027 /* Parse the declarator. */
21028 declarator
21033 friend_p);
21035 /* If something went wrong parsing the declarator, make sure
21036 that we at least consume some tokens. */
21038 {
21039 /* Skip to the end of the statement. */
21041 /* If the next token is not a semicolon, that is
21042 probably because we just skipped over the body of
21043 a function. So, we consume a semicolon if
21044 present, but do not issue an error message if it
21045 is not present. */
21047 CPP_SEMICOLON))
21050 }
21053 cp_parser_check_for_definition_in_return_type
21057 /* Look for an asm-specification. */
21059 /* Look for attributes that apply to the declaration. */
21061 /* Remember which attributes are prefix attributes and
21062 which are not. */
21064 /* Combine the attributes. */
21067 /* If it's an `=', then we have a constant-initializer or a
21068 pure-specifier. It is not correct to parse the
21069 initializer before registering the member declaration
21070 since the member declaration should be in scope while
21071 its initializer is processed. However, the rest of the
21072 front end does not yet provide an interface that allows
21073 us to handle this correctly. */
21075 {
21076 /* In [class.mem]:
21078 A pure-specifier shall be used only in the declaration of
21079 a virtual function.
21081 A member-declarator can contain a constant-initializer
21082 only if it declares a static member of integral or
21083 enumeration type.
21085 Therefore, if the DECLARATOR is for a function, we look
21086 for a pure-specifier; otherwise, we look for a
21087 constant-initializer. When we call `grokfield', it will
21088 perform more stringent semantics checks. */
21100 {
21102 /* Don't require a constant rvalue in C++11, since we
21103 might want a reference constant. We'll enforce
21104 constancy later. */
21106 /* Parse the initializer. */
21109 }
21110 else
21111 /* Parse the initializer. */
21113 }
21116 {
21120 else
21122 }
21123 /* Otherwise, there is no initializer. */
21124 else
21127 // Save and reset the current template requirements. Handle
21128 // the trailing requirements, if there are any.
21133 /* See if we are probably looking at a function
21134 definition. We are certainly not looking at a
21135 member-declarator. Calling `grokfield' has
21136 side-effects, so we must not do it unless we are sure
21137 that we are looking at a member-declarator. */
21140 {
21141 /* The grammar does not allow a pure-specifier to be
21142 used when a member function is defined. (It is
21143 possible that this fact is an oversight in the
21144 standard, since a pure function may be defined
21145 outside of the class-specifier. */
21151 declarator,
21152 attributes);
21155 /* If the member was not a friend, declare it here. */
21162 /* Peek at the next token. */
21164 /* If the next token is a semicolon, consume it. */
21169 }
21170 else
21173 /* Create the declaration. */
21178 {
21181 else
21183 }
21184 }
21188 /* Reset PREFIX_ATTRIBUTES. */
21194 /* If there is any qualification still in effect, clear it
21195 now; we will be starting fresh with the next declarator. */
21199 /* If it's a `,', then there are more declarators. */
21201 {
21204 {
21208 }
21209 }
21210 /* If the next token isn't a `;', then we have a parse error. */
21212 CPP_SEMICOLON))
21213 {
21214 /* The next token might be a ways away from where the
21215 actual semicolon is missing. Find the previous token
21216 and use that for our error position. */
21221 /* Assume that the user meant to provide a semicolon. If
21222 we were to cp_parser_skip_to_end_of_statement, we might
21223 skip to a semicolon inside a member function definition
21224 and issue nonsensical error messages. */
21226 }
21229 {
21230 /* Add DECL to the list of members. */
21239 /* Add DECL to the queue of NSDMI to be parsed later. */
21241 }
21245 }
21246 }
21249 out:
21251 }
21253 /* Parse a pure-specifier.
21255 pure-specifier:
21256 = 0
21258 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21259 Otherwise, ERROR_MARK_NODE is returned. */
21261 static tree
21263 {
21266 /* Look for the `=' token. */
21269 /* Look for the `0' token. */
21278 /* Accept = default or = delete in c++0x mode. */
21281 {
21284 }
21286 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21288 {
21293 }
21295 {
21298 }
21301 }
21303 /* Parse a constant-initializer.
21305 constant-initializer:
21306 = constant-expression
21308 Returns a representation of the constant-expression. */
21310 static tree
21312 {
21313 /* Look for the `=' token. */
21317 /* It is invalid to write:
21319 struct S { static const int i = { 7 }; };
21321 */
21323 {
21326 /* Consume the opening brace. */
21328 /* Skip the initializer. */
21330 /* Look for the trailing `}'. */
21334 }
21338 NULL);
21339 }
21341 /* Derived classes [gram.class.derived] */
21343 /* Parse a base-clause.
21345 base-clause:
21346 : base-specifier-list
21348 base-specifier-list:
21349 base-specifier ... [opt]
21350 base-specifier-list , base-specifier ... [opt]
21352 Returns a TREE_LIST representing the base-classes, in the order in
21353 which they were declared. The representation of each node is as
21354 described by cp_parser_base_specifier.
21356 In the case that no bases are specified, this function will return
21357 NULL_TREE, not ERROR_MARK_NODE. */
21359 static tree
21361 {
21364 /* Look for the `:' that begins the list. */
21367 /* Scan the base-specifier-list. */
21369 {
21371 tree base;
21374 /* Look for the base-specifier. */
21376 /* Look for the (optional) ellipsis. */
21378 {
21379 /* Consume the `...'. */
21383 }
21385 /* Add BASE to the front of the list. */
21387 {
21389 /* Make this a pack expansion type. */
21393 {
21396 }
21397 }
21398 /* Peek at the next token. */
21400 /* If it's not a comma, then the list is complete. */
21403 /* Consume the `,'. */
21405 }
21407 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21408 base class had a qualified name. However, the next name that
21409 appears is certainly not qualified. */
21415 }
21417 /* Parse a base-specifier.
21419 base-specifier:
21420 :: [opt] nested-name-specifier [opt] class-name
21421 virtual access-specifier [opt] :: [opt] nested-name-specifier
21422 [opt] class-name
21423 access-specifier virtual [opt] :: [opt] nested-name-specifier
21424 [opt] class-name
21426 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21427 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21428 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21429 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21431 static tree
21433 {
21441 tree type;
21443 /* Process the optional `virtual' and `access-specifier'. */
21445 {
21446 /* Peek at the next token. */
21448 /* Process `virtual'. */
21450 {
21452 /* If `virtual' appears more than once, issue an error. */
21454 {
21458 }
21462 /* Consume the `virtual' token. */
21470 /* If more than one access specifier appears, issue an
21471 error. */
21474 {
21478 }
21482 /* Consume the access-specifier. */
21490 }
21491 }
21492 /* It is not uncommon to see programs mechanically, erroneously, use
21493 the 'typename' keyword to denote (dependent) qualified types
21494 as base classes. */
21496 {
21501 else
21503 "keyword %<typename%> not allowed in this context "
21506 }
21508 /* Look for the optional `::' operator. */
21510 /* Look for the nested-name-specifier. The simplest way to
21511 implement:
21513 [temp.res]
21515 The keyword `typename' is not permitted in a base-specifier or
21516 mem-initializer; in these contexts a qualified name that
21517 depends on a template-parameter is implicitly assumed to be a
21518 type name.
21520 is to pretend that we have seen the `typename' keyword at this
21521 point. */
21525 typename_type,
21527 /* If the base class is given by a qualified name, assume that names
21528 we see are type names or templates, as appropriate. */
21534 /* DR 950 allows decltype as a base-specifier. */
21536 else
21537 {
21538 /* Otherwise, look for the class-name. */
21540 class_scope_p,
21541 template_p,
21542 typename_type,
21547 }
21553 }
21555 /* Exception handling [gram.exception] */
21557 /* Parse an (optional) noexcept-specification.
21559 noexcept-specification:
21560 noexcept ( constant-expression ) [opt]
21562 If no noexcept-specification is present, returns NULL_TREE.
21563 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21564 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21565 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21566 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21567 in which case a boolean condition is returned instead. */
21569 static tree
21574 {
21578 /* Peek at the next token. */
21581 /* Is it a noexcept-specification? */
21583 {
21584 tree expr;
21588 {
21592 {
21593 /* Types may not be defined in an exception-specification. */
21595 parser->type_definition_forbidden_message
21600 /* Restore the saved message. */
21602 }
21603 else
21604 {
21607 }
21610 }
21611 else
21612 {
21616 }
21618 /* We cannot build a noexcept-spec right away because this will check
21619 that expr is a constexpr. */
21622 else
21624 }
21625 else
21627 }
21629 /* Parse an (optional) exception-specification.
21631 exception-specification:
21632 throw ( type-id-list [opt] )
21634 Returns a TREE_LIST representing the exception-specification. The
21635 TREE_VALUE of each node is a type. */
21637 static tree
21639 {
21641 tree type_id_list;
21644 /* Peek at the next token. */
21647 /* Is it a noexcept-specification? */
21653 /* If it's not `throw', then there's no exception-specification. */
21657 #if 0
21658 /* Enable this once a lot of code has transitioned to noexcept? */
21662 #endif
21664 /* Consume the `throw'. */
21667 /* Look for the `('. */
21670 /* Peek at the next token. */
21672 /* If it's not a `)', then there is a type-id-list. */
21674 {
21675 /* Types may not be defined in an exception-specification. */
21677 parser->type_definition_forbidden_message
21679 /* Parse the type-id-list. */
21681 /* Restore the saved message. */
21683 }
21684 else
21687 /* Look for the `)'. */
21691 }
21693 /* Parse an (optional) type-id-list.
21695 type-id-list:
21696 type-id ... [opt]
21697 type-id-list , type-id ... [opt]
21699 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21700 in the order that the types were presented. */
21702 static tree
21704 {
21708 {
21710 tree type;
21712 /* Get the next type-id. */
21714 /* Parse the optional ellipsis. */
21716 {
21717 /* Consume the `...'. */
21720 /* Turn the type into a pack expansion expression. */
21722 }
21723 /* Add it to the list. */
21725 /* Peek at the next token. */
21727 /* If it is not a `,', we are done. */
21730 /* Consume the `,'. */
21732 }
21735 }
21737 /* Parse a try-block.
21739 try-block:
21740 try compound-statement handler-seq */
21742 static tree
21744 {
21745 tree try_block;
21755 }
21757 /* Parse a function-try-block.
21759 function-try-block:
21760 try ctor-initializer [opt] function-body handler-seq */
21762 static bool
21764 {
21765 tree compound_stmt;
21766 tree try_block;
21769 /* Look for the `try' keyword. */
21772 /* Let the rest of the front end know where we are. */
21774 /* Parse the function-body. */
21775 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21777 /* We're done with the `try' part. */
21779 /* Parse the handlers. */
21781 /* We're done with the handlers. */
21785 }
21787 /* Parse a handler-seq.
21789 handler-seq:
21790 handler handler-seq [opt] */
21792 static void
21794 {
21796 {
21799 /* Parse the handler. */
21801 /* Peek at the next token. */
21803 /* If it's not `catch' then there are no more handlers. */
21806 }
21807 }
21809 /* Parse a handler.
21811 handler:
21812 catch ( exception-declaration ) compound-statement */
21814 static void
21816 {
21817 tree handler;
21818 tree declaration;
21828 }
21830 /* Parse an exception-declaration.
21832 exception-declaration:
21833 type-specifier-seq declarator
21834 type-specifier-seq abstract-declarator
21835 type-specifier-seq
21836 ...
21838 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21839 ellipsis variant is used. */
21841 static tree
21843 {
21844 cp_decl_specifier_seq type_specifiers;
21848 /* If it's an ellipsis, it's easy to handle. */
21850 {
21851 /* Consume the `...' token. */
21854 }
21856 /* Types may not be defined in exception-declarations. */
21858 parser->type_definition_forbidden_message
21861 /* Parse the type-specifier-seq. */
21865 /* If it's a `)', then there is no declarator. */
21868 else
21875 /* Restore the saved message. */
21882 }
21884 /* Parse a throw-expression.
21886 throw-expression:
21887 throw assignment-expression [opt]
21889 Returns a THROW_EXPR representing the throw-expression. */
21891 static tree
21893 {
21894 tree expression;
21899 /* Figure out whether or not there is an assignment-expression
21900 following the "throw" keyword. */
21908 else
21913 }
21915 /* GNU Extensions */
21917 /* Parse an (optional) asm-specification.
21919 asm-specification:
21920 asm ( string-literal )
21922 If the asm-specification is present, returns a STRING_CST
21923 corresponding to the string-literal. Otherwise, returns
21924 NULL_TREE. */
21926 static tree
21928 {
21930 tree asm_specification;
21932 /* Peek at the next token. */
21934 /* If the next token isn't the `asm' keyword, then there's no
21935 asm-specification. */
21939 /* Consume the `asm' token. */
21941 /* Look for the `('. */
21944 /* Look for the string-literal. */
21947 /* Look for the `)'. */
21951 }
21953 /* Parse an asm-operand-list.
21955 asm-operand-list:
21956 asm-operand
21957 asm-operand-list , asm-operand
21959 asm-operand:
21960 string-literal ( expression )
21961 [ string-literal ] string-literal ( expression )
21963 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21964 each node is the expression. The TREE_PURPOSE is itself a
21965 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21966 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21967 is a STRING_CST for the string literal before the parenthesis. Returns
21968 ERROR_MARK_NODE if any of the operands are invalid. */
21970 static tree
21972 {
21977 {
21978 tree string_literal;
21979 tree expression;
21980 tree name;
21983 {
21984 /* Consume the `[' token. */
21986 /* Read the operand name. */
21991 /* Look for the closing `]'. */
21993 }
21994 else
21996 /* Look for the string-literal. */
21999 /* Look for the `('. */
22001 /* Parse the expression. */
22003 /* Look for the `)'. */
22011 /* Add this operand to the list. */
22013 expression,
22014 asm_operands);
22015 /* If the next token is not a `,', there are no more
22016 operands. */
22019 /* Consume the `,'. */
22021 }
22024 }
22026 /* Parse an asm-clobber-list.
22028 asm-clobber-list:
22029 string-literal
22030 asm-clobber-list , string-literal
22032 Returns a TREE_LIST, indicating the clobbers in the order that they
22033 appeared. The TREE_VALUE of each node is a STRING_CST. */
22035 static tree
22037 {
22041 {
22042 tree string_literal;
22044 /* Look for the string literal. */
22046 /* Add it to the list. */
22048 /* If the next token is not a `,', then the list is
22049 complete. */
22052 /* Consume the `,' token. */
22054 }
22057 }
22059 /* Parse an asm-label-list.
22061 asm-label-list:
22062 identifier
22063 asm-label-list , identifier
22065 Returns a TREE_LIST, indicating the labels in the order that they
22066 appeared. The TREE_VALUE of each node is a label. */
22068 static tree
22070 {
22074 {
22077 /* Look for the identifier. */
22080 {
22083 {
22089 }
22090 }
22091 /* If the next token is not a `,', then the list is
22092 complete. */
22095 /* Consume the `,' token. */
22097 }
22100 }
22102 /* Return TRUE iff the next tokens in the stream are possibly the
22103 beginning of a GNU extension attribute. */
22105 static bool
22107 {
22109 }
22111 /* Return TRUE iff the next tokens in the stream are possibly the
22112 beginning of a standard C++-11 attribute specifier. */
22114 static bool
22116 {
22118 }
22120 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22121 beginning of a standard C++-11 attribute specifier. */
22123 static bool
22125 {
22133 }
22135 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22136 beginning of a GNU extension attribute. */
22138 static bool
22140 {
22144 }
22146 /* Return true iff the next tokens can be the beginning of either a
22147 GNU attribute list, or a standard C++11 attribute sequence. */
22149 static bool
22151 {
22154 }
22156 /* Return true iff the next Nth tokens can be the beginning of either
22157 a GNU attribute list, or a standard C++11 attribute sequence. */
22159 static bool
22161 {
22164 }
22166 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22167 of GNU attributes, or return NULL. */
22169 static tree
22171 {
22175 }
22177 #define CILK_SIMD_FN_CLAUSE_MASK \
22178 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22179 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22180 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22181 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22182 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22184 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22185 vector [(<clauses>)] */
22187 static void
22189 {
22193 {
22198 }
22201 {
22204 paren_scope++;
22205 }
22207 {
22210 paren_scope++;
22212 paren_scope--;
22213 /* Do not push the last ')' */
22216 }
22225 }
22227 /* Parse an (optional) series of attributes.
22229 attributes:
22230 attributes attribute
22232 attribute:
22233 __attribute__ (( attribute-list [opt] ))
22235 The return value is as for cp_parser_gnu_attribute_list. */
22237 static tree
22239 {
22243 {
22245 tree attribute_list;
22248 /* Peek at the next token. */
22250 /* If it's not `__attribute__', then we're done. */
22254 /* Consume the `__attribute__' keyword. */
22256 /* Look for the two `(' tokens. */
22260 /* Peek at the next token. */
22263 /* Parse the attribute-list. */
22265 else
22266 /* If the next token is a `)', then there is no attribute
22267 list. */
22270 /* Look for the two `)' tokens. */
22278 /* Add these new attributes to the list. */
22280 }
22283 }
22285 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22286 "__vector" or "__vector__." */
22290 {
22294 }
22296 /* Parse a GNU attribute-list.
22298 attribute-list:
22299 attribute
22300 attribute-list , attribute
22302 attribute:
22303 identifier
22304 identifier ( identifier )
22305 identifier ( identifier , expression-list )
22306 identifier ( expression-list )
22308 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22309 to an attribute. The TREE_PURPOSE of each node is the identifier
22310 indicating which attribute is in use. The TREE_VALUE represents
22311 the arguments, if any. */
22313 static tree
22315 {
22321 {
22323 tree identifier;
22324 tree attribute;
22326 /* Look for the identifier. We also allow keywords here; for
22327 example `__attribute__ ((const))' is legal. */
22331 {
22334 /* Consume the token, but save it since we need it for the
22335 SIMD enabled function parsing. */
22338 /* Save away the identifier that indicates which attribute
22339 this is. */
22341 /* For keywords, use the canonical spelling, not the
22342 parsed identifier. */
22348 /* Peek at the next token. */
22350 /* If it's an `(', then parse the attribute arguments. */
22352 {
22357 {
22360 }
22361 else
22362 vec = cp_parser_parenthesized_expression_list
22368 else
22369 {
22372 }
22373 /* Save the arguments away. */
22375 }
22377 {
22380 }
22383 {
22384 /* Add this attribute to the list. */
22387 }
22390 }
22391 /* Now, look for more attributes. If the next token isn't a
22392 `,', we're done. */
22396 /* Consume the comma and keep going. */
22398 }
22401 /* We built up the list in reverse order. */
22403 }
22405 /* Parse a standard C++11 attribute.
22407 The returned representation is a TREE_LIST which TREE_PURPOSE is
22408 the scoped name of the attribute, and the TREE_VALUE is its
22409 arguments list.
22411 Note that the scoped name of the attribute is itself a TREE_LIST
22412 which TREE_PURPOSE is the namespace of the attribute, and
22413 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22414 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22415 and which TREE_PURPOSE is directly the attribute name.
22417 Clients of the attribute code should use get_attribute_namespace
22418 and get_attribute_name to get the actual namespace and name of
22419 attributes, regardless of their being GNU or C++11 attributes.
22421 attribute:
22422 attribute-token attribute-argument-clause [opt]
22424 attribute-token:
22425 identifier
22426 attribute-scoped-token
22428 attribute-scoped-token:
22429 attribute-namespace :: identifier
22431 attribute-namespace:
22432 identifier
22434 attribute-argument-clause:
22435 ( balanced-token-seq )
22437 balanced-token-seq:
22438 balanced-token [opt]
22439 balanced-token-seq balanced-token
22441 balanced-token:
22442 ( balanced-token-seq )
22443 [ balanced-token-seq ]
22444 { balanced-token-seq }. */
22446 static tree
22448 {
22452 /* First, parse name of the the attribute, a.k.a
22453 attribute-token. */
22470 {
22471 /* We are seeing a scoped attribute token. */
22481 else
22482 {
22486 }
22488 NULL_TREE);
22490 }
22491 else
22492 {
22494 NULL_TREE);
22495 /* C++11 noreturn attribute is equivalent to GNU's. */
22498 /* C++14 deprecated attribute is equivalent to GNU's. */
22501 }
22503 /* Now parse the optional argument clause of the attribute. */
22508 {
22514 /* A GNU attribute that takes an identifier in parameter. */
22517 vec = cp_parser_parenthesized_expression_list
22523 else
22524 {
22527 }
22531 else
22533 }
22536 }
22538 /* Parse a list of standard C++-11 attributes.
22540 attribute-list:
22541 attribute [opt]
22542 attribute-list , attribute[opt]
22543 attribute ...
22544 attribute-list , attribute ...
22545 */
22547 static tree
22549 {
22554 {
22559 {
22562 }
22567 }
22570 }
22572 /* Parse a standard C++-11 attribute specifier.
22574 attribute-specifier:
22575 [ [ attribute-list ] ]
22576 alignment-specifier
22578 alignment-specifier:
22579 alignas ( type-id ... [opt] )
22580 alignas ( alignment-expression ... [opt] ). */
22582 static tree
22584 {
22590 {
22599 else
22600 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22601 when we are sure that we have actually parsed them. */
22603 }
22604 else
22605 {
22606 tree alignas_expr;
22608 /* Look for an alignment-specifier. */
22620 {
22623 }
22629 {
22633 alignas_expr =
22641 }
22644 {
22647 }
22651 /* Build the C++-11 representation of an 'aligned'
22652 attribute. */
22653 attributes =
22657 }
22660 }
22662 /* Parse a standard C++-11 attribute-specifier-seq.
22664 attribute-specifier-seq:
22665 attribute-specifier-seq [opt] attribute-specifier
22666 */
22668 static tree
22670 {
22674 {
22683 }
22687 }
22689 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22690 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22691 current value of the PEDANTIC flag, regardless of whether or not
22692 the `__extension__' keyword is present. The caller is responsible
22693 for restoring the value of the PEDANTIC flag. */
22695 static bool
22697 {
22698 /* Save the old value of the PEDANTIC flag. */
22702 {
22703 /* Consume the `__extension__' token. */
22705 /* We're not being pedantic while the `__extension__' keyword is
22706 in effect. */
22710 }
22713 }
22715 /* Parse a label declaration.
22717 label-declaration:
22718 __label__ label-declarator-seq ;
22720 label-declarator-seq:
22721 identifier , label-declarator-seq
22722 identifier */
22724 static void
22726 {
22727 /* Look for the `__label__' keyword. */
22731 {
22732 tree identifier;
22734 /* Look for an identifier. */
22736 /* If we failed, stop. */
22739 /* Declare it as a label. */
22741 /* If the next token is a `;', stop. */
22744 /* Look for the `,' separating the label declarations. */
22746 }
22748 /* Look for the final `;'. */
22750 }
22752 // -------------------------------------------------------------------------- //
22753 // Requires Clause
22755 // Parse a requires clause.
22756 //
22757 // requires-clause:
22758 // 'requires' logical-or-expression
22759 //
22760 // The required logical-or-expression must be a constant expression.
22761 static tree
22763 {
22764 // Parse the requires clause so that it is not automatically folded.
22766 tree expr =
22772 }
22774 // Optionally parse a requires clause:
22775 //
22776 // requires-clause:
22777 // 'requires' logical-or-expression
22778 //
22779 // The required logical-or-expression must be a constant expression.
22780 static tree
22782 {
22787 }
22790 // -------------------------------------------------------------------------- //
22791 // Requires Expression
22794 // An RAII helper that provides scoped control for entering and exiting
22795 // the local scope defined by a requires expression. Name bindings introduced
22796 // within the scope are popped prior to exiting the scope.
22797 struct cp_parser_requires_expr_scope
22798 {
22799 // Enter a scope of kind K belonging to the decl D.
22801 {
22803 }
22806 {
22810 }
22811 };
22813 // Parse a requires expression
22814 //
22815 // requirement-expression:
22816 // 'requires' requirement-parameter-list requirement-body
22817 static tree
22819 {
22823 // TODO: Earlier versions of the concepts lite spec did not allow
22824 // requires expressions outside of template declarations. That
22825 // restriction was relaxed in Chicago, but it has not been implemented.
22827 {
22831 }
22834 // TODO: Check that requires expressions are only written inside of
22835 // template declarations. They don't need to be concepts, just templates.
22837 // Parse the optional parameter list. Any local parameter declarations
22838 // are added to a new scope and are visible within the nested
22839 // requirement list.
22840 cp_parser_requires_expr_scope guard;
22845 // Parse the requirement body.
22851 }
22853 // Parse a parameterized requirement.
22854 //
22855 // requirement-parameter-list:
22856 // '(' parameter-declaration-clause ')'
22857 static tree
22859 {
22863 // Parse the nested parameter declaration clause.
22872 }
22874 // Parse the body of a requirement.
22875 //
22876 // requirement-body:
22877 // '{' requirement-list '}'
22878 static tree
22880 {
22890 }
22892 // Parse a list of requirements.
22893 //
22894 // requirement-list:
22895 // requirement
22896 // requirement-list ';' requirement[opt]
22897 static tree
22899 {
22902 {
22909 // If we see a semi-colon, consume it.
22913 // If we've found the end of the list, stop processing
22914 // the list.
22917 }
22919 // Reverse the order of requirements so they are analyzed in
22920 // declaration order.
22922 }
22924 // Parse a syntactic requirement or type requirement.
22925 //
22926 // requirement:
22927 // simple-requirement
22928 // compound-requirement
22929 // type-requirement
22930 // nested-requirement
22931 static tree
22933 {
22940 // Try parsing a type requirement first.
22947 }
22949 // Parse a nested requirement. This is the same as a requires clause.
22950 //
22951 // nested-requirement:
22952 // requires-clause
22953 static tree
22955 {
22961 }
22963 // Parse a simple requirement.
22964 //
22965 // simple-requirement:
22966 // expression
22967 static tree
22969 {
22974 }
22976 // Parse a compound requirement
22977 //
22978 // compound-requirement:
22979 // '{' expression '}' trailing-constraint-specifiers
22980 //
22981 // trailing-constraint-specifiers:
22982 // constraint-specifiers-seq[opt] result-type-requirement[opt]
22983 //
22984 // result-type-requirement:
22985 // '->' type-id
22986 static tree
22988 {
22989 // Parse an expression enclosed in '{ }'s.
23000 // Parse trailing expression specifiers.
23003 // Parse the optional trailing type requirement.
23006 {
23014 }
23017 }
23019 // Parse a type requirement
23020 //
23021 // type-requirement
23022 // type-id
23023 static tree
23025 {
23026 // Try parsing the type-id
23031 // It can only be a type requirement if nothing comes after it.
23032 // For example, this:
23033 //
23034 // typename T::value_type x = a;
23035 //
23036 // Is not a type requirement even though it stars with a type-id.
23041 }
23043 // Parse an optional constexpr specifier in a constraint expression.
23044 static tree
23046 {
23049 }
23051 // Parse an optional noexcept specifier in a constraint expression.
23052 static tree
23054 {
23057 }
23059 static tree
23061 {
23067 }
23069 // Parse an optional expression specifier sequence.
23070 //
23071 // constraint-specifier-sequence:
23072 // constexpr [opt] noexcept [opt]
23073 static tree
23075 {
23078 {
23079 // If we can parse a constraint specifier, insert it into
23080 // the list of requirements.
23082 {
23085 }
23087 }
23089 }
23091 /* Support Functions */
23093 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
23094 NAME should have one of the representations used for an
23095 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
23096 is returned. If PARSER->SCOPE is a dependent type, then a
23097 SCOPE_REF is returned.
23099 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
23100 returned; the name was already resolved when the TEMPLATE_ID_EXPR
23101 was formed. Abstractly, such entities should not be passed to this
23102 function, because they do not need to be looked up, but it is
23103 simpler to check for this special case here, rather than at the
23104 call-sites.
23106 In cases not explicitly covered above, this function returns a
23107 DECL, OVERLOAD, or baselink representing the result of the lookup.
23108 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
23109 is returned.
23111 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
23112 (e.g., "struct") that was used. In that case bindings that do not
23113 refer to types are ignored.
23115 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
23116 ignored.
23118 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
23119 are ignored.
23121 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
23122 types.
23124 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
23125 TREE_LIST of candidates if name-lookup results in an ambiguity, and
23126 NULL_TREE otherwise. */
23128 static tree
23135 location_t name_location)
23136 {
23137 tree decl;
23140 /* Assume that the lookup will be unambiguous. */
23144 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
23145 no longer valid. Note that if we are parsing tentatively, and
23146 the parse fails, OBJECT_TYPE will be automatically restored. */
23152 /* A template-id has already been resolved; there is no lookup to
23153 do. */
23157 {
23161 }
23163 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
23164 it should already have been checked to make sure that the name
23165 used matches the type being destroyed. */
23167 {
23168 tree type;
23170 /* Figure out to which type this destructor applies. */
23175 else
23177 /* If that's not a class type, there is no destructor. */
23184 /* If it was a class type, return the destructor. */
23186 }
23188 /* By this point, the NAME should be an ordinary identifier. If
23189 the id-expression was a qualified name, the qualifying scope is
23190 stored in PARSER->SCOPE at this point. */
23193 /* Perform the lookup. */
23195 {
23201 /* If the SCOPE is dependent, the lookup must be deferred until
23202 the template is instantiated -- unless we are explicitly
23203 looking up names in uninstantiated templates. Even then, we
23204 cannot look up the name if the scope is not a class type; it
23205 might, for example, be a template type parameter. */
23210 /* Defer lookup. */
23212 else
23213 {
23216 /* If PARSER->SCOPE is a dependent type, then it must be a
23217 class type, and we must not be checking dependencies;
23218 otherwise, we would have processed this lookup above. So
23219 that PARSER->SCOPE is not considered a dependent base by
23220 lookup_member, we must enter the scope here. */
23224 /* If the PARSER->SCOPE is a template specialization, it
23225 may be instantiated during name lookup. In that case,
23226 errors may be issued. Even if we rollback the current
23227 tentative parse, those errors are valid. */
23232 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
23233 lookup result and the nested-name-specifier nominates a class C:
23234 * if the name specified after the nested-name-specifier, when
23235 looked up in C, is the injected-class-name of C (Clause 9), or
23236 * if the name specified after the nested-name-specifier is the
23237 same as the identifier or the simple-template-id's template-
23238 name in the last component of the nested-name-specifier,
23239 the name is instead considered to name the constructor of
23240 class C. [ Note: for example, the constructor is not an
23241 acceptable lookup result in an elaborated-type-specifier so
23242 the constructor would not be used in place of the
23243 injected-class-name. --end note ] Such a constructor name
23244 shall be used only in the declarator-id of a declaration that
23245 names a constructor or in a using-declaration. */
23253 /* If we have a single function from a using decl, pull it out. */
23260 }
23262 /* If the scope is a dependent type and either we deferred lookup or
23263 we did lookup but didn't find the name, rememeber the name. */
23266 {
23268 {
23269 tree type;
23271 /* The resolution to Core Issue 180 says that `struct
23272 A::B' should be considered a type-name, even if `A'
23273 is dependent. */
23278 }
23282 CPP_CLOSE_PAREN)))
23286 else
23289 is_template);
23290 }
23293 }
23295 {
23296 /* Look up the name in the scope of the OBJECT_TYPE, unless the
23297 OBJECT_TYPE is not a class. */
23299 /* If the OBJECT_TYPE is a template specialization, it may
23300 be instantiated during name lookup. In that case, errors
23301 may be issued. Even if we rollback the current tentative
23302 parse, those errors are valid. */
23304 name,
23307 tf_warning_or_error);
23308 else
23312 /* Look it up in the enclosing context. */
23318 }
23319 else
23320 {
23326 }
23328 /* If the lookup failed, let our caller know. */
23332 /* Pull out the template from an injected-class-name (or multiple). */
23336 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23338 {
23341 /* The error message we have to print is too complicated for
23342 cp_parser_error, so we incorporate its actions directly. */
23344 {
23346 name);
23348 }
23350 }
23358 /* If we have resolved the name of a member declaration, check to
23359 see if the declaration is accessible. When the name resolves to
23360 set of overloaded functions, accessibility is checked when
23361 overload resolution is done.
23363 During an explicit instantiation, access is not checked at all,
23364 as per [temp.explicit]. */
23371 }
23373 /* Like cp_parser_lookup_name, but for use in the typical case where
23374 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23375 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23377 static tree
23379 {
23381 none_type,
23386 location);
23387 }
23389 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23390 the current context, return the TYPE_DECL. If TAG_NAME_P is
23391 true, the DECL indicates the class being defined in a class-head,
23392 or declared in an elaborated-type-specifier.
23394 Otherwise, return DECL. */
23396 static tree
23398 {
23399 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23400 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23402 struct A {
23403 template <typename T> struct B;
23404 };
23406 template <typename T> struct A::B {};
23408 Similarly, in an elaborated-type-specifier:
23410 namespace N { struct X{}; }
23412 struct A {
23413 template <typename T> friend struct N::X;
23414 };
23416 However, if the DECL refers to a class type, and we are in
23417 the scope of the class, then the name lookup automatically
23418 finds the TYPE_DECL created by build_self_reference rather
23419 than a TEMPLATE_DECL. For example, in:
23421 template <class T> struct S {
23422 S s;
23423 };
23425 there is no need to handle such case. */
23431 }
23433 /* If too many, or too few, template-parameter lists apply to the
23434 declarator, issue an error message. Returns TRUE if all went well,
23435 and FALSE otherwise. */
23437 static bool
23440 location_t declarator_location)
23441 {
23443 {
23445 {
23453 /* If the DECLARATOR has the form `X<y>' then it uses one
23454 additional level of template parameters. */
23457 return cp_parser_check_template_parameters
23459 }
23474 }
23476 }
23478 /* NUM_TEMPLATES were used in the current declaration. If that is
23479 invalid, return FALSE and issue an error messages. Otherwise,
23480 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23481 declarator and we can print more accurate diagnostics. */
23483 static bool
23486 location_t location,
23488 {
23489 /* If there are the same number of template classes and parameter
23490 lists, that's OK. */
23493 /* If there are more, but only one more, then we are referring to a
23494 member template. That's OK too. */
23497 /* If there are more template classes than parameter lists, we have
23498 something like:
23500 template <class T> void S<T>::R<T>::f (); */
23502 {
23512 else
23515 }
23516 /* Otherwise, there are too many template parameter lists. We have
23517 something like:
23519 template <class T> template <class U> void S::f(); */
23522 }
23524 /* Parse an optional `::' token indicating that the following name is
23525 from the global namespace. If so, PARSER->SCOPE is set to the
23526 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23527 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23528 Returns the new value of PARSER->SCOPE, if the `::' token is
23529 present, and NULL_TREE otherwise. */
23531 static tree
23533 {
23536 /* Peek at the next token. */
23538 /* If we're looking at a `::' token then we're starting from the
23539 global namespace, not our current location. */
23541 {
23542 /* Consume the `::' token. */
23544 /* Set the SCOPE so that we know where to start the lookup. */
23550 }
23552 {
23556 }
23559 }
23561 /* Returns TRUE if the upcoming token sequence is the start of a
23562 constructor declarator. If FRIEND_P is true, the declarator is
23563 preceded by the `friend' specifier. */
23565 static bool
23567 {
23570 tree nested_name_specifier;
23573 /* The common case is that this is not a constructor declarator, so
23574 try to avoid doing lots of work if at all possible. It's not
23575 valid declare a constructor at function scope. */
23578 /* And only certain tokens can begin a constructor declarator. */
23586 /* Parse tentatively; we are going to roll back all of the tokens
23587 consumed here. */
23589 /* Assume that we are looking at a constructor declarator. */
23592 /* Look for the optional `::' operator. */
23595 /* Look for the nested-name-specifier. */
23596 nested_name_specifier
23607 /* Outside of a class-specifier, there must be a
23608 nested-name-specifier. */
23614 /* If we have a class scope, this is easy; DR 147 says that S::S always
23615 names the constructor, and no other qualified name could. */
23618 {
23628 }
23629 /* If we still think that this might be a constructor-declarator,
23630 look for a class-name. */
23632 {
23633 /* If we have:
23635 template <typename T> struct S {
23636 S();
23637 };
23639 we must recognize that the nested `S' names a class. */
23640 tree type_decl;
23644 none_type,
23648 /* If there was no class-name, then this is not a constructor.
23649 Otherwise, if we are in a class-specifier and we aren't
23650 handling a friend declaration, check that its type matches
23651 current_class_type (c++/38313). Note: error_mark_node
23652 is left alone for error recovery purposes. */
23654 && (outside_class_specifier_p
23659 /* If we're still considering a constructor, we have to see a `(',
23660 to begin the parameter-declaration-clause, followed by either a
23661 `)', an `...', or a decl-specifier. We need to check for a
23662 type-specifier to avoid being fooled into thinking that:
23664 S (f) (int);
23666 is a constructor. (It is actually a function named `f' that
23667 takes one parameter (of type `int') and returns a value of type
23668 `S'. */
23676 /* A parameter declaration begins with a decl-specifier,
23677 which is either the "attribute" keyword, a storage class
23678 specifier, or (usually) a type-specifier. */
23680 {
23681 tree type;
23685 /* Names appearing in the type-specifier should be looked up
23686 in the scope of the class. */
23689 else
23690 {
23693 {
23697 {
23700 }
23701 }
23703 }
23705 /* Inside the constructor parameter list, surrounding
23706 template-parameter-lists do not apply. */
23707 saved_num_template_parameter_lists
23711 /* Look for the type-specifier. */
23713 CP_PARSER_FLAGS_NONE,
23719 parser->num_template_parameter_lists
23722 /* Leave the scope of the class. */
23727 }
23728 }
23730 /* We did not really want to consume any tokens. */
23734 }
23736 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23737 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23738 they must be performed once we are in the scope of the function.
23740 Returns the function defined. */
23742 static tree
23743 cp_parser_function_definition_from_specifiers_and_declarator
23746 tree attributes,
23748 {
23749 tree fn;
23752 /* Begin the function-definition. */
23755 /* The things we're about to see are not directly qualified by any
23756 template headers we've seen thus far. */
23759 /* If there were names looked up in the decl-specifier-seq that we
23760 did not check, check them now. We must wait until we are in the
23761 scope of the function to perform the checks, since the function
23762 might be a friend. */
23766 {
23769 }
23772 {
23773 /* Skip the entire function. */
23776 }
23778 {
23779 /* Seen already, skip it. An error message has already been output. */
23783 /* If this is a function from a class, pop the nested class. */
23786 }
23787 else
23788 {
23789 timevar_id_t tv;
23792 else
23798 }
23801 }
23803 /* Parse the part of a function-definition that follows the
23804 declarator. INLINE_P is TRUE iff this function is an inline
23805 function defined within a class-specifier.
23807 Returns the function defined. */
23809 static tree
23812 {
23813 tree fn;
23819 bool fully_implicit_function_template_p
23822 tree implicit_template_parms
23825 cp_binding_level* implicit_template_scope
23831 /* If the next token is `return', then the code may be trying to
23832 make use of the "named return value" extension that G++ used to
23833 support. */
23836 {
23837 /* Consume the `return' keyword. */
23839 /* Look for the identifier that indicates what value is to be
23840 returned. */
23842 /* Issue an error message. */
23845 /* Skip tokens until we reach the start of the function body. */
23847 {
23854 }
23855 }
23856 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23857 anything declared inside `f'. */
23858 saved_in_unbraced_linkage_specification_p
23861 /* Inside the function, surrounding template-parameter-lists do not
23862 apply. */
23863 saved_num_template_parameter_lists
23869 /* If the next token is `try', `__transaction_atomic', or
23870 `__transaction_relaxed`, then we are looking at either function-try-block
23871 or function-transaction-block. Note that all of these include the
23872 function-body. */
23875 RID_TRANSACTION_ATOMIC);
23877 RID_TRANSACTION_RELAXED))
23879 RID_TRANSACTION_RELAXED);
23882 else
23883 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23888 /* Finish the function. */
23891 /* Generate code for it, if necessary. */
23893 /* Restore the saved values. */
23894 parser->in_unbraced_linkage_specification_p
23896 parser->num_template_parameter_lists
23900 parser->fully_implicit_function_template_p
23902 parser->implicit_template_parms
23904 parser->implicit_template_scope
23911 }
23913 /* Parse a template-declaration, assuming that the `export' (and
23914 `extern') keywords, if present, has already been scanned. MEMBER_P
23915 is as for cp_parser_template_declaration. */
23917 static void
23919 {
23922 tree parameter_list;
23927 /* Look for the `template' keyword. */
23932 /* And the `<'. */
23936 {
23937 /* 14.5.2.2 [temp.mem]
23939 A local class shall not have member templates. */
23944 }
23945 /* [temp]
23947 A template ... shall not have C linkage. */
23949 {
23951 /* Give it C++ linkage to avoid confusing other parts of the
23952 front end. */
23955 }
23956 else
23959 /* We cannot perform access checks on the template parameter
23960 declarations until we know what is being declared, just as we
23961 cannot check the decl-specifier list. */
23964 // Save the current template requirements.
23967 /* If the next token is `>', then we have an invalid
23968 specialization. Rather than complain about an invalid template
23969 parameter, issue an error message here. */
23971 {
23975 }
23976 else
23977 {
23978 /* Parse the template parameters. */
23980 }
23982 /* Get the deferred access checks from the parameter list. These
23983 will be checked once we know what is being declared, as for a
23984 member template the checks must be performed in the scope of the
23985 class containing the member. */
23988 /* Look for the `>'. */
23990 /* We just processed one more parameter list. */
23993 // Manage template requirements
23995 {
24001 // Attach the constraints to the template parameter list.
24004 }
24006 /* If the next token is `template', there are more template
24007 parameters. */
24009 RID_TEMPLATE))
24014 else
24015 {
24016 /* There are no access checks when parsing a template, as we do not
24017 know if a specialization will be a friend. */
24021 checks,
24022 member_p,
24027 /* If this is a member template declaration, let the front
24028 end know. */
24030 {
24035 }
24040 }
24041 /* We are done with the current parameter list. */
24046 /* Finish up. */
24049 // Restore the current template requirements.
24052 /* Check the template arguments for a literal operator template. */
24056 {
24060 else
24061 {
24064 {
24070 }
24072 {
24080 }
24081 else
24083 }
24086 " Expected non-type template argument pack <char...>"
24088 decl);
24089 }
24090 /* Register member declarations. */
24093 /* For the erroneous case of a template with C linkage, we pushed an
24094 implicit C++ linkage scope; exit that scope now. */
24097 /* If DECL is a function template, we must return to parse it later.
24098 (Even though there is no definition, there might be default
24099 arguments that need handling.) */
24103 }
24105 /* Perform the deferred access checks from a template-parameter-list.
24106 CHECKS is a TREE_LIST of access checks, as returned by
24107 get_deferred_access_checks. */
24109 static void
24110 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
24111 {
24115 }
24117 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
24118 `function-definition' sequence that follows a template header.
24119 If MEMBER_P is true, this declaration appears in a class scope.
24121 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
24122 *FRIEND_P is set to TRUE iff the declaration is a friend. */
24124 static tree
24130 {
24133 cp_decl_specifier_seq decl_specifiers;
24137 /* This function is only used when processing a template
24138 declaration. */
24142 /* Defer access checks until we know what is being declared. */
24145 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
24146 alternative. */
24149 CP_PARSER_FLAGS_OPTIONAL,
24155 /* There are no template typedefs. */
24157 {
24161 }
24163 /* Gather up the access checks that occurred the
24164 decl-specifier-seq. */
24167 /* Check for the declaration of a template class. */
24169 {
24171 {
24174 /* In this case:
24176 struct C {
24177 friend template <typename T> struct A<T>::B;
24178 };
24180 A<T>::B will be represented by a TYPENAME_TYPE, and
24181 therefore not recognized by shadow_tag. */
24183 && !decl
24190 else
24193 /* Perform access checks for template parameters. */
24195 }
24196 }
24198 /* Complain about missing 'typename' or other invalid type names. */
24201 {
24202 /* cp_parser_parse_and_diagnose_invalid_type_name calls
24203 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
24204 the rest of this declaration. */
24207 }
24209 /* If it's not a template class, try for a template function. If
24210 the next token is a `;', then this declaration does not declare
24211 anything. But, if there were errors in the decl-specifiers, then
24212 the error might well have come from an attempted class-specifier.
24213 In that case, there's no need to warn about a missing declarator. */
24217 {
24220 checks,
24222 member_p,
24223 declares_class_or_enum,
24225 NULL);
24227 /* 7.1.1-1 [dcl.stc]
24229 A storage-class-specifier shall not be specified in an explicit
24230 specialization... */
24232 && explicit_specialization_p
24234 {
24238 }
24242 }
24244 /* Look for a trailing `;' after the declaration. */
24250 out:
24253 /* Clear any current qualification; whatever comes next is the start
24254 of something new. */
24260 }
24262 /* Parse a cast-expression that is not the operand of a unary "&". */
24264 static tree
24266 {
24269 }
24271 /* Parse a functional cast to TYPE. Returns an expression
24272 representing the cast. */
24274 static tree
24276 {
24278 tree expression_list;
24279 tree cast;
24286 {
24294 tf_warning_or_error);
24295 }
24304 else
24305 {
24308 }
24311 tf_warning_or_error);
24312 /* [expr.const]/1: In an integral constant expression "only type
24313 conversions to integral or enumeration type can be used". */
24319 NIC_CONSTRUCTOR))
24322 }
24324 /* Save the tokens that make up the body of a member function defined
24325 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
24326 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
24327 specifiers applied to the declaration. Returns the FUNCTION_DECL
24328 for the member function. */
24330 static tree
24334 tree attributes)
24335 {
24338 tree fn;
24340 /* Create the FUNCTION_DECL. */
24343 /* If something went badly wrong, bail out now. */
24345 {
24346 /* If there's a function-body, skip it. */
24351 }
24353 /* Remember it, if there default args to post process. */
24356 /* Save away the tokens that make up the body of the
24357 function. */
24359 /* Handle function try blocks. */
24362 /* We can have braced-init-list mem-initializers before the fn body. */
24364 {
24367 {
24368 /* cache_group will stop after an un-nested { } pair, too. */
24372 /* variadic mem-inits have ... after the ')'. */
24375 }
24376 }
24378 /* Handle function try blocks. */
24383 /* Save away the inline definition; we will process it when the
24384 class is complete. */
24388 /* We need to know that this was defined in the class, so that
24389 friend templates are handled correctly. */
24392 /* Add FN to the queue of functions to be parsed later. */
24396 }
24398 /* Save the tokens that make up the in-class initializer for a non-static
24399 data member. Returns a DEFAULT_ARG. */
24401 static tree
24403 {
24405 }
24407 /* Parse a template-argument-list, as well as the trailing ">" (but
24408 not the opening "<"). See cp_parser_template_argument_list for the
24409 return value. */
24411 static tree
24413 {
24414 tree arguments;
24415 tree saved_scope;
24416 tree saved_qualifying_scope;
24417 tree saved_object_scope;
24422 /* [temp.names]
24424 When parsing a template-id, the first non-nested `>' is taken as
24425 the end of the template-argument-list rather than a greater-than
24426 operator. */
24427 saved_greater_than_is_operator_p
24430 /* Parsing the argument list may modify SCOPE, so we save it
24431 here. */
24435 /* We need to evaluate the template arguments, even though this
24436 template-id may be nested within a "sizeof". */
24441 /* Parse the template-argument-list itself. */
24445 else
24447 /* Look for the `>' that ends the template-argument-list. If we find
24448 a '>>' instead, it's probably just a typo. */
24450 {
24452 {
24453 /* In C++0x, a `>>' in a template argument list or cast
24454 expression is considered to be two separate `>'
24455 tokens. So, change the current token to a `>', but don't
24456 consume it: it will be consumed later when the outer
24457 template argument list (or cast expression) is parsed.
24458 Note that this replacement of `>' for `>>' is necessary
24459 even if we are parsing tentatively: in the tentative
24460 case, after calling
24461 cp_parser_enclosed_template_argument_list we will always
24462 throw away all of the template arguments and the first
24463 closing `>', either because the template argument list
24464 was erroneous or because we are replacing those tokens
24465 with a CPP_TEMPLATE_ID token. The second `>' (which will
24466 not have been thrown away) is needed either to close an
24467 outer template argument list or to complete a new-style
24468 cast. */
24471 }
24473 {
24474 /* If we're in a nested template argument list, the '>>' has
24475 to be a typo for '> >'. We emit the error message, but we
24476 continue parsing and we push a '>' as next token, so that
24477 the argument list will be parsed correctly. Note that the
24478 global source location is still on the token before the
24479 '>>', so we need to say explicitly where we want it. */
24485 }
24486 else
24487 {
24488 /* If this is not a nested template argument list, the '>>'
24489 is a typo for '>'. Emit an error message and continue.
24490 Same deal about the token location, but here we can get it
24491 right by consuming the '>>' before issuing the diagnostic. */
24494 "spurious %<>>%>, use %<>%> to terminate "
24496 }
24497 }
24498 else
24500 /* The `>' token might be a greater-than operator again now. */
24501 parser->greater_than_is_operator_p
24503 /* Restore the SAVED_SCOPE. */
24511 }
24513 /* MEMBER_FUNCTION is a member function, or a friend. If default
24514 arguments, or the body of the function have not yet been parsed,
24515 parse them now. */
24517 static void
24519 {
24521 /* If this member is a template, get the underlying
24522 FUNCTION_DECL. */
24526 /* There should not be any class definitions in progress at this
24527 point; the bodies of members are only parsed outside of all class
24528 definitions. */
24530 /* While we're parsing the member functions we might encounter more
24531 classes. We want to handle them right away, but we don't want
24532 them getting mixed up with functions that are currently in the
24533 queue. */
24536 /* Make sure that any template parameters are in scope. */
24539 // Restore the declaration's requirements for the parsing of
24540 // the definition.
24541 //
24545 /* If the body of the function has not yet been parsed, parse it
24546 now. */
24548 {
24549 tree function_scope;
24552 /* The function is no longer pending; we are processing it. */
24557 /* If this is a local class, enter the scope of the containing
24558 function. */
24563 /* Push the body of the function onto the lexer stack. */
24566 /* Let the front end know that we going to be defining this
24567 function. */
24571 /* Don't do access checking if it is a templated function. */
24575 /* #pragma omp declare reduction needs special parsing. */
24577 {
24582 }
24583 else
24584 /* Now, parse the body of the function. */
24591 /* Leave the scope of the containing function. */
24595 }
24597 /* Remove any template parameters from the symbol table. */
24600 // Restore the template requirements.
24603 /* Restore the queue. */
24606 }
24608 /* If DECL contains any default args, remember it on the unparsed
24609 functions queue. */
24611 static void
24613 {
24614 tree probe;
24617 probe;
24620 {
24624 }
24625 }
24627 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24628 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24629 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24630 from the parameter-type-list. */
24632 static tree
24635 {
24637 tree parsed_arg;
24643 /* Push the saved tokens for the default argument onto the parser's
24644 lexer stack. */
24650 /* Parse the default argument. */
24661 {
24662 /* In a non-template class, check conversions now. In a template,
24663 we'll wait and instantiate these as needed. */
24666 tf_warning_or_error);
24667 else
24669 }
24671 /* If the token stream has not been completely used up, then
24672 there was extra junk after the end of the default
24673 argument. */
24675 {
24678 else
24680 }
24682 /* Revert to the main lexer. */
24686 }
24688 /* FIELD is a non-static data member with an initializer which we saved for
24689 later; parse it now. */
24691 static void
24693 {
24694 tree def;
24701 NULL_TREE);
24707 }
24709 /* FN is a FUNCTION_DECL which may contains a parameter with an
24710 unparsed DEFAULT_ARG. Parse the default args now. This function
24711 assumes that the current scope is the scope in which the default
24712 argument should be processed. */
24714 static void
24716 {
24720 /* While we're parsing the default args, we might (due to the
24721 statement expression extension) encounter more classes. We want
24722 to handle them right away, but we don't want them getting mixed
24723 up with default args that are currently in the queue. */
24726 /* Local variable names (and the `this' keyword) may not appear
24727 in a default argument. */
24738 {
24740 tree parsed_arg;
24742 tree copy;
24749 /* This can happen for a friend declaration for a function
24750 already declared with default arguments. */
24753 parsed_arg
24755 default_arg,
24758 {
24760 }
24764 /* Update any instantiations we've already created. */
24768 }
24772 /* Make sure no default arg is missing. */
24775 /* Restore the state of local_variables_forbidden_p. */
24778 /* Restore the queue. */
24780 }
24782 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24784 sizeof ... ( identifier )
24786 where the 'sizeof' token has already been consumed. */
24788 static tree
24790 {
24791 /* Consume the `...'. */
24798 else
24806 /* The name is not qualified. */
24824 }
24826 /* Parse the operand of `sizeof' (or a similar operator). Returns
24827 either a TYPE or an expression, depending on the form of the
24828 input. The KEYWORD indicates which kind of expression we have
24829 encountered. */
24831 static tree
24833 {
24840 /* If it's a `...', then we are computing the length of a parameter
24841 pack. */
24846 /* Types cannot be defined in a `sizeof' expression. Save away the
24847 old message. */
24849 /* And create the new one. */
24855 /* The restrictions on constant-expressions do not apply inside
24856 sizeof expressions. */
24857 saved_integral_constant_expression_p
24859 saved_non_integral_constant_expression_p
24863 /* Do not actually evaluate the expression. */
24866 /* If it's a `(', then we might be looking at the type-id
24867 construction. */
24869 {
24872 /* We can't be sure yet whether we're looking at a type-id or an
24873 expression. */
24875 /* Note: as a GNU Extension, compound literals are considered
24876 postfix-expressions as they are in C99, so they are valid
24877 arguments to sizeof. See comment in cp_parser_cast_expression
24878 for details. */
24881 else
24882 {
24885 /* Look for the type-id. */
24887 /* Look for the closing `)'. */
24890 }
24892 /* If all went well, then we're done. */
24894 {
24895 cp_decl_specifier_seq decl_specs;
24897 /* Build a trivial decl-specifier-seq. */
24901 /* Call grokdeclarator to figure out what type this is. */
24904 TYPENAME,
24907 }
24908 }
24910 /* If the type-id production did not work out, then we must be
24911 looking at the unary-expression production. */
24916 /* Go back to evaluating expressions. */
24920 /* Free the message we created. */
24922 /* And restore the old one. */
24924 parser->integral_constant_expression_p
24926 parser->non_integral_constant_expression_p
24930 }
24932 /* If the current declaration has no declarator, return true. */
24934 static bool
24936 {
24937 /* If the next token is a `;' or a `,' then there is no
24938 declarator. */
24941 }
24943 /* Update the DECL_SPECS to reflect the storage class indicated by
24944 KEYWORD. */
24946 static void
24951 {
24952 cp_storage_class storage_class;
24955 {
24959 }
24961 {
24964 }
24969 {
24972 }
24975 {
24993 }
24997 /* A storage class specifier cannot be applied alongside a typedef
24998 specifier. If there is a typedef specifier present then set
24999 conflicting_specifiers_p which will trigger an error later
25000 on in grokdeclarator. */
25003 }
25005 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
25006 is true, the type is a class or enum definition. */
25008 static void
25010 tree type_spec,
25013 {
25016 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
25017 (with, for example, in "typedef int wchar_t;") we remember that
25018 this is what happened. In system headers, we ignore these
25019 declarations so that G++ can work with system headers that are not
25020 C++-safe. */
25022 && !type_definition_p
25032 {
25035 ds_redefined_builtin_type_spec,
25036 token);
25038 {
25042 }
25043 }
25046 else
25047 {
25052 }
25053 }
25055 /* True iff TOKEN is the GNU keyword __thread. */
25057 static bool
25059 {
25062 }
25064 /* Set the location for a declarator specifier and check if it is
25065 duplicated.
25067 DECL_SPECS is the sequence of declarator specifiers onto which to
25068 set the location.
25070 DS is the single declarator specifier to set which location is to
25071 be set onto the existing sequence of declarators.
25073 LOCATION is the location for the declarator specifier to
25074 consider. */
25076 static void
25079 {
25088 {
25092 }
25093 else
25094 {
25096 {
25100 else
25101 {
25104 OPT_Wlong_long,
25106 }
25107 }
25109 {
25114 else
25116 }
25117 else
25118 {
25134 "__complex"
25135 };
25138 }
25139 }
25140 }
25142 /* Return true iff the declarator specifier DS is present in the
25143 sequence of declarator specifiers DECL_SPECS. */
25145 bool
25147 cp_decl_spec ds)
25148 {
25155 }
25157 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
25158 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
25160 static bool
25162 {
25164 }
25166 /* Issue an error message indicating that TOKEN_DESC was expected.
25167 If KEYWORD is true, it indicated this function is called by
25168 cp_parser_require_keword and the required token can only be
25169 a indicated keyword. */
25171 static void
25173 required_token token_desc,
25175 {
25177 {
25246 }
25248 {
25250 {
25329 }
25330 }
25331 else
25333 }
25337 /* If the next token is of the indicated TYPE, consume it. Otherwise,
25338 issue an error message indicating that TOKEN_DESC was expected.
25340 Returns the token consumed, if the token had the appropriate type.
25341 Otherwise, returns NULL. */
25346 required_token token_desc)
25347 {
25350 else
25351 {
25352 /* Output the MESSAGE -- unless we're parsing tentatively. */
25356 }
25357 }
25359 /* An error message is produced if the next token is not '>'.
25360 All further tokens are skipped until the desired token is
25361 found or '{', '}', ';' or an unbalanced ')' or ']'. */
25363 static void
25365 {
25366 /* Current level of '< ... >'. */
25368 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
25371 /* Are we ready, yet? If not, issue error message. */
25375 /* Skip tokens until the desired token is found. */
25377 {
25378 /* Peek at the next token. */
25380 {
25388 /* C++0x views the `>>' operator as two `>' tokens, but
25389 C++98 does not. */
25392 {
25393 /* We've hit a `>>' where the first `>' closes the
25394 template argument list, and the second `>' is
25395 spurious. Just consume the `>>' and stop; we've
25396 already produced at least one error. */
25399 }
25400 /* Fall through for C++0x, so we handle the second `>' in
25401 the `>>'. */
25405 {
25406 /* We've reached the token we want, consume it and stop. */
25409 }
25428 /* The '>' was probably forgotten, don't look further. */
25433 }
25435 /* Consume this token. */
25437 }
25438 }
25440 /* If the next token is the indicated keyword, consume it. Otherwise,
25441 issue an error message indicating that TOKEN_DESC was expected.
25443 Returns the token consumed, if the token had the appropriate type.
25444 Otherwise, returns NULL. */
25449 required_token token_desc)
25450 {
25454 {
25457 }
25460 }
25462 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25463 function-definition. */
25465 static bool
25467 {
25470 /* A ctor-initializer begins with a `:'. */
25472 /* A function-try-block begins with `try'. */
25474 /* A function-transaction-block begins with `__transaction_atomic'
25475 or `__transaction_relaxed'. */
25478 /* The named return value extension begins with `return'. */
25480 }
25482 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25483 definition. */
25485 static bool
25487 {
25494 }
25496 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25497 C++0x) ending a template-argument. */
25499 static bool
25501 {
25509 }
25511 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25512 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25514 static bool
25517 {
25523 /* Check for the sequence `<::' in the original code. It would be lexed as
25524 `[:', where `[' is a digraph, and there is no whitespace before
25525 `:'. */
25527 {
25532 }
25534 }
25536 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25537 or none_type otherwise. */
25539 static enum tag_types
25541 {
25543 {
25553 }
25554 }
25556 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25558 static void
25560 {
25564 {
25568 type))
25571 }
25572 }
25574 /* Issue an error message if DECL is redeclared with different
25575 access than its original declaration [class.access.spec/3].
25576 This applies to nested classes and nested class templates.
25577 [class.mem/1]. */
25579 static void
25581 {
25590 }
25592 /* Look for the `template' keyword, as a syntactic disambiguator.
25593 Return TRUE iff it is present, in which case it will be
25594 consumed. */
25596 static bool
25598 {
25600 {
25601 /* In C++98 the `template' keyword can only be used within templates;
25602 outside templates the parser can always figure out what is a
25603 template and what is not. In C++11, per the resolution of DR 468,
25604 `template' is allowed in cases where it is not strictly necessary. */
25607 {
25610 "in C++98 %<template%> (as a disambiguator) is only "
25612 /* If this part of the token stream is rescanned, the same
25613 error message would be generated. So, we purge the token
25614 from the stream. */
25617 }
25618 else
25619 {
25620 /* Consume the `template' keyword. */
25623 }
25624 }
25626 }
25628 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25629 set PARSER->SCOPE, and perform other related actions. */
25631 static void
25633 {
25639 /* Get the stored value. */
25641 /* Perform any access checks that were deferred. */
25644 {
25649 }
25650 /* Set the scope from the stored value. */
25654 }
25656 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25657 encounter the end of a block before what we were looking for. */
25659 static bool
25663 {
25665 {
25668 /* Abort a parenthesized expression if we encounter a semicolon. */
25672 /* If we've reached the end of the file, stop. */
25678 /* We've hit the end of an enclosing block, so there's been some
25679 kind of syntax error. */
25682 /* Consume the token. */
25684 /* See if it starts a new group. */
25686 {
25688 /* In theory this should probably check end == '}', but
25689 cp_parser_save_member_function_body needs it to exit
25690 after either '}' or ')' when called with ')'. */
25693 }
25695 {
25699 }
25704 }
25705 }
25707 /* Like above, for caching a default argument or NSDMI. Both of these are
25708 terminated by a non-nested comma, but it can be unclear whether or not a
25709 comma is nested in a template argument list unless we do more parsing.
25710 In order to handle this ambiguity, when we encounter a ',' after a '<'
25711 we try to parse what follows as a parameter-declaration-list (in the
25712 case of a default argument) or a member-declarator (in the case of an
25713 NSDMI). If that succeeds, then we stop caching. */
25715 static tree
25717 {
25722 tree default_argument;
25724 /* Add tokens until we have processed the entire default
25725 argument. We add the range [first_token, token). */
25728 {
25729 /* For list-initialization, this is straightforward. */
25732 }
25734 {
25737 /* Peek at the next token. */
25739 /* What we do depends on what token we have. */
25741 {
25742 /* In valid code, a default argument must be
25743 immediately followed by a `,' `)', or `...'. */
25746 {
25747 /* If we've seen a '<', we might be in a
25748 template-argument-list. Until Core issue 325 is
25749 resolved, we don't know how this situation ought
25750 to be handled, so try to DTRT. We check whether
25751 what comes after the comma is a valid parameter
25752 declaration list. If it is, then the comma ends
25753 the default argument; otherwise the default
25754 argument continues. */
25757 /* Set ITALP so cp_parser_parameter_declaration_list
25758 doesn't decide to commit to this parse. */
25766 {
25773 }
25774 else
25775 {
25779 }
25786 }
25789 /* If we run into a non-nested `;', `}', or `]',
25790 then the code is invalid -- but the default
25791 argument is certainly over. */
25796 /* Handle correctly int n = sizeof ... ( p ); */
25799 /* Update DEPTH, if necessary. */
25814 /* This might be the comparison operator, or it might
25815 start a template argument list. */
25822 /* Fall through for C++0x, which treats the `>>'
25823 operator like two `>' tokens in certain
25824 cases. */
25828 {
25829 /* This might be an operator, or it might close a
25830 template argument list. But if a previous '<'
25831 started a template argument list, this will have
25832 closed it, so we can't be in one anymore. */
25836 }
25839 /* If we run out of tokens, issue an error message. */
25848 /* In these cases, we should look for template-ids.
25849 For example, if the default argument is
25850 `X<int, double>()', we need to do name lookup to
25851 figure out whether or not `X' is a template; if
25852 so, the `,' does not end the default argument.
25854 That is not yet done. */
25859 }
25861 /* If we've reached the end, stop. */
25865 /* Add the token to the token block. */
25867 }
25869 /* Create a DEFAULT_ARG to represent the unparsed default
25870 argument. */
25877 }
25879 /* Begin parsing tentatively. We always save tokens while parsing
25880 tentatively so that if the tentative parsing fails we can restore the
25881 tokens. */
25883 static void
25885 {
25886 /* Enter a new parsing context. */
25888 /* Begin saving tokens. */
25890 /* In order to avoid repetitive access control error messages,
25891 access checks are queued up until we are no longer parsing
25892 tentatively. */
25894 }
25896 /* Commit to the currently active tentative parse. */
25898 static void
25900 {
25904 /* Mark all of the levels as committed. */
25907 {
25914 }
25915 }
25917 /* Commit to the topmost currently active tentative parse.
25919 Note that this function shouldn't be called when there are
25920 irreversible side-effects while in a tentative state. For
25921 example, we shouldn't create a permanent entry in the symbol
25922 table, or issue an error message that might not apply if the
25923 tentative parse is aborted. */
25925 static void
25927 {
25932 {
25940 }
25941 }
25943 /* Abort the currently active tentative parse. All consumed tokens
25944 will be rolled back, and no diagnostics will be issued. */
25946 static void
25948 {
25952 /* Now, pretend that we want to see if the construct was
25953 successfully parsed. */
25955 }
25957 /* Stop parsing tentatively. If a parse error has occurred, restore the
25958 token stream. Otherwise, commit to the tokens we have consumed.
25959 Returns true if no error occurred; false otherwise. */
25961 static bool
25963 {
25967 /* Remember whether or not an error occurred, since we are about to
25968 destroy that information. */
25970 /* Remove the topmost context from the stack. */
25973 /* If no parse errors occurred, commit to the tentative parse. */
25975 {
25976 /* Commit to the tokens read tentatively, unless that was
25977 already done. */
25982 }
25983 /* Otherwise, if errors occurred, roll back our state so that things
25984 are just as they were before we began the tentative parse. */
25985 else
25986 {
25989 }
25990 /* Add the context to the front of the free list. */
25995 }
25997 /* Returns true if we are parsing tentatively and are not committed to
25998 this tentative parse. */
26000 static bool
26002 {
26005 }
26007 /* Returns nonzero iff an error has occurred during the most recent
26008 tentative parse. */
26010 static bool
26012 {
26015 }
26017 /* Returns nonzero if GNU extensions are allowed. */
26019 static bool
26021 {
26023 }
26024 \f
26025 /* Objective-C++ Productions */
26028 /* Parse an Objective-C expression, which feeds into a primary-expression
26029 above.
26031 objc-expression:
26032 objc-message-expression
26033 objc-string-literal
26034 objc-encode-expression
26035 objc-protocol-expression
26036 objc-selector-expression
26038 Returns a tree representation of the expression. */
26040 static tree
26042 {
26043 /* Try to figure out what kind of declaration is present. */
26047 {
26057 {
26069 }
26075 }
26078 }
26080 /* Parse an Objective-C message expression.
26082 objc-message-expression:
26083 [ objc-message-receiver objc-message-args ]
26085 Returns a representation of an Objective-C message. */
26087 static tree
26089 {
26098 }
26100 /* Parse an objc-message-receiver.
26102 objc-message-receiver:
26103 expression
26104 simple-type-specifier
26106 Returns a representation of the type or expression. */
26108 static tree
26110 {
26111 tree rcv;
26113 /* An Objective-C message receiver may be either (1) a type
26114 or (2) an expression. */
26123 CP_PARSER_FLAGS_NONE);
26126 }
26128 /* Parse the arguments and selectors comprising an Objective-C message.
26130 objc-message-args:
26131 objc-selector
26132 objc-selector-args
26133 objc-selector-args , objc-comma-args
26135 objc-selector-args:
26136 objc-selector [opt] : assignment-expression
26137 objc-selector-args objc-selector [opt] : assignment-expression
26139 objc-comma-args:
26140 assignment-expression
26141 objc-comma-args , assignment-expression
26143 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
26144 selector arguments and TREE_VALUE containing a list of comma
26145 arguments. */
26147 static tree
26149 {
26155 {
26161 /* Detect if we have a unary selector. */
26170 sel_args
26175 }
26177 /* Handle non-selector arguments, if any. */
26179 {
26180 tree arg;
26185 addl_args
26190 }
26193 {
26196 }
26199 }
26201 /* Parse an Objective-C encode expression.
26203 objc-encode-expression:
26204 @encode objc-typename
26206 Returns an encoded representation of the type argument. */
26208 static tree
26210 {
26211 tree type;
26221 {
26225 }
26227 /* This happens if we find @encode(T) (where T is a template
26228 typename or something dependent on a template typename) when
26229 parsing a template. In that case, we can't compile it
26230 immediately, but we rather create an AT_ENCODE_EXPR which will
26231 need to be instantiated when the template is used.
26232 */
26234 {
26238 }
26241 }
26243 /* Parse an Objective-C @defs expression. */
26245 static tree
26247 {
26248 tree name;
26256 }
26258 /* Parse an Objective-C protocol expression.
26260 objc-protocol-expression:
26261 @protocol ( identifier )
26263 Returns a representation of the protocol expression. */
26265 static tree
26267 {
26268 tree proto;
26276 }
26278 /* Parse an Objective-C selector expression.
26280 objc-selector-expression:
26281 @selector ( objc-method-signature )
26283 objc-method-signature:
26284 objc-selector
26285 objc-selector-seq
26287 objc-selector-seq:
26288 objc-selector :
26289 objc-selector-seq objc-selector :
26291 Returns a representation of the method selector. */
26293 static tree
26295 {
26307 {
26316 {
26317 /* Detect if we have a unary selector. */
26319 {
26322 }
26323 else
26324 {
26326 }
26327 }
26332 {
26333 sel_seq
26336 sel_seq
26339 }
26340 else
26341 sel_seq
26346 }
26348 finish_selector:
26352 }
26354 /* Parse a list of identifiers.
26356 objc-identifier-list:
26357 identifier
26358 objc-identifier-list , identifier
26360 Returns a TREE_LIST of identifier nodes. */
26362 static tree
26364 {
26365 tree identifier;
26366 tree list;
26377 {
26384 identifier));
26386 }
26389 }
26391 /* Parse an Objective-C alias declaration.
26393 objc-alias-declaration:
26394 @compatibility_alias identifier identifier ;
26396 This function registers the alias mapping with the Objective-C front end.
26397 It returns nothing. */
26399 static void
26401 {
26409 }
26411 /* Parse an Objective-C class forward-declaration.
26413 objc-class-declaration:
26414 @class objc-identifier-list ;
26416 The function registers the forward declarations with the Objective-C
26417 front end. It returns nothing. */
26419 static void
26421 {
26424 {
26425 tree id;
26435 else
26437 }
26439 }
26441 /* Parse a list of Objective-C protocol references.
26443 objc-protocol-refs-opt:
26444 objc-protocol-refs [opt]
26446 objc-protocol-refs:
26447 < objc-identifier-list >
26449 Returns a TREE_LIST of identifiers, if any. */
26451 static tree
26453 {
26457 {
26461 }
26464 }
26466 /* Parse a Objective-C visibility specification. */
26468 static void
26470 {
26474 {
26489 }
26491 /* Eat '@private'/'@protected'/'@public'. */
26493 }
26495 /* Parse an Objective-C method type. Return 'true' if it is a class
26496 (+) method, and 'false' if it is an instance (-) method. */
26500 {
26503 else
26505 }
26507 /* Parse an Objective-C protocol qualifier. */
26509 static tree
26511 {
26524 {
26529 }
26532 }
26534 /* Parse an Objective-C typename. */
26536 static tree
26538 {
26542 {
26548 /* An ObjC type name may consist of just protocol qualifiers, in which
26549 case the type shall default to 'id'. */
26551 {
26554 /* If the type could not be parsed, an error has already
26555 been produced. For error recovery, behave as if it had
26556 not been specified, which will use the default type
26557 'id'. */
26559 {
26561 /* We need to skip to the closing parenthesis as
26562 cp_parser_type_id() does not seem to do it for
26563 us. */
26568 }
26569 }
26573 }
26576 }
26578 /* Check to see if TYPE refers to an Objective-C selector name. */
26580 static bool
26582 {
26588 }
26590 /* Parse an Objective-C selector. */
26592 static tree
26594 {
26598 {
26601 }
26603 /* C++ operator names are allowed to appear in ObjC selectors. */
26605 {
26618 }
26619 }
26621 /* Parse an Objective-C params list. */
26623 static tree
26625 {
26631 {
26641 /* Detect if we have a unary selector. */
26644 {
26647 }
26651 {
26652 /* Something went quite wrong. There should be a colon
26653 here, but there is not. Stop parsing parameters. */
26655 }
26657 /* New ObjC allows attributes on parameters too. */
26662 params
26665 type_name,
26666 identifier,
26667 parm_attr));
26670 }
26673 {
26676 }
26678 /* We allow tail attributes for the method. */
26680 {
26688 }
26691 {
26694 }
26696 }
26698 /* Parse the non-keyword Objective-C params. */
26700 static tree
26703 {
26709 {
26711 tree parm;
26717 {
26722 }
26724 /* TODO: parse attributes for tail parameters. */
26733 }
26735 /* We allow tail attributes for the method. */
26737 {
26739 {
26744 }
26745 else
26746 /* We have an error, but parse the attributes, so that we can
26747 carry on. */
26753 }
26756 }
26758 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26760 static void
26762 {
26765 /* If the next token is `extern' and the following token is a string
26766 literal, then we have a linkage specification. */
26768 && cp_parser_is_pure_string_literal
26771 /* Handle #pragma, if any. */
26774 /* Allow stray semicolons. */
26777 /* Mark methods as optional or required, when building protocols. */
26779 {
26782 }
26784 {
26787 }
26790 /* Other stray characters must generate errors. */
26792 {
26796 }
26797 /* Finally, try to parse a block-declaration, or a function-definition. */
26798 else
26800 }
26802 /* Parse a method signature. */
26804 static tree
26806 {
26822 }
26824 static bool
26826 {
26827 tree tattr;
26832 /* If the attributes are followed by a method introducer, this is not allowed.
26833 Dump the attributes and flag the situation. */
26838 /* Otherwise, the attributes introduce some interstitial code, possibly so
26839 rewind to allow that check. */
26842 }
26844 /* Parse an Objective-C method prototype list. */
26846 static void
26848 {
26852 {
26854 {
26859 else
26863 {
26867 }
26870 }
26876 OPT_Wattributes,
26878 else
26879 /* Allow for interspersed non-ObjC++ code. */
26883 }
26887 else
26891 }
26893 /* Parse an Objective-C method definition list. */
26895 static void
26897 {
26901 {
26902 tree meth;
26905 {
26911 else
26916 {
26920 }
26922 NULL_TREE);
26924 /* For historical reasons, we accept an optional semicolon. */
26931 {
26938 }
26939 }
26940 /* The following case will be removed once @synthesize is
26941 completely implemented. */
26952 else
26953 /* Allow for interspersed non-ObjC++ code. */
26957 }
26961 else
26965 }
26967 /* Parse Objective-C ivars. */
26969 static void
26971 {
26982 {
26983 cp_decl_specifier_seq declspecs;
26985 tree prefix_attributes;
26993 CP_PARSER_FLAGS_OPTIONAL,
26997 /* auto, register, static, extern, mutable. */
26999 {
27002 }
27004 /* thread_local. */
27006 {
27009 }
27011 /* typedef. */
27013 {
27016 }
27021 /* Keep going until we hit the `;' at the end of the
27022 declaration. */
27024 {
27029 /* Check for a (possibly unnamed) bitfield declaration. */
27037 {
27038 /* Get the name of the bitfield. */
27041 sfk_none);
27043 eat_colon:
27045 /* Get the width of the bitfield. */
27046 width
27049 NULL);
27050 }
27051 else
27052 {
27053 /* Parse the declarator. */
27054 declarator
27060 }
27062 /* Look for attributes that apply to the ivar. */
27064 /* Remember which attributes are prefix attributes and
27065 which are not. */
27067 /* Combine the attributes. */
27071 /* Create the bitfield declaration. */
27073 width,
27074 attributes);
27075 else
27080 /* Add the instance variable. */
27084 /* Reset PREFIX_ATTRIBUTES. */
27093 {
27096 }
27098 }
27102 }
27107 /* Do not consume the RID_AT_END, so it will be read again as terminating
27108 the @interface of @implementation. */
27112 /* For historical reasons, we accept an optional semicolon. */
27115 }
27117 /* Parse an Objective-C protocol declaration. */
27119 static void
27121 {
27127 {
27132 }
27134 /* See if we have a forward declaration or a definition. */
27137 /* Try a forward declaration first. */
27139 {
27141 {
27142 tree id;
27152 else
27154 }
27156 }
27158 /* Ok, we got a full-fledged definition (or at least should). */
27159 else
27160 {
27165 }
27166 }
27168 /* Parse an Objective-C superclass or category. */
27170 static void
27175 {
27181 {
27184 }
27186 {
27189 /* If there is no category name, and this is an @interface, we
27190 have a class extension. */
27192 {
27195 }
27196 else
27200 }
27201 }
27203 /* Parse an Objective-C class interface. */
27205 static void
27207 {
27214 {
27215 /* It's hard to recover because even if valid @interface stuff
27216 is to follow, we can't compile it (or validate it) if we
27217 don't even know which class it refers to. Let's assume this
27218 was a stray '@interface' token in the stream and skip it.
27219 */
27221 }
27226 /* We have either a class or a category on our hands. */
27229 else
27230 {
27232 /* Handle instance variable declarations, if any. */
27235 }
27238 }
27240 /* Parse an Objective-C class implementation. */
27242 static void
27244 {
27251 {
27252 /* It's hard to recover because even if valid @implementation
27253 stuff is to follow, we can't compile it (or validate it) if
27254 we don't even know which class it refers to. Let's assume
27255 this was a stray '@implementation' token in the stream and
27256 skip it.
27257 */
27259 }
27263 /* We have either a class or a category on our hands. */
27266 else
27267 {
27269 /* Handle instance variable declarations, if any. */
27272 }
27275 }
27277 /* Consume the @end token and finish off the implementation. */
27279 static void
27281 {
27284 }
27286 /* Parse an Objective-C declaration. */
27288 static void
27290 {
27291 /* Try to figure out what kind of declaration is present. */
27296 {
27312 }
27315 {
27338 }
27339 }
27341 /* Parse an Objective-C try-catch-finally statement.
27343 objc-try-catch-finally-stmt:
27344 @try compound-statement objc-catch-clause-seq [opt]
27345 objc-finally-clause [opt]
27347 objc-catch-clause-seq:
27348 objc-catch-clause objc-catch-clause-seq [opt]
27350 objc-catch-clause:
27351 @catch ( objc-exception-declaration ) compound-statement
27353 objc-finally-clause:
27354 @finally compound-statement
27356 objc-exception-declaration:
27357 parameter-declaration
27358 '...'
27360 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27362 Returns NULL_TREE.
27364 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27365 for C. Keep them in sync. */
27367 static tree
27369 {
27370 location_t location;
27371 tree stmt;
27376 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27377 node, lest it get absorbed into the surrounding block. */
27383 {
27392 {
27393 /* We have "@catch (...)" (where the '...' are literally
27394 what is in the code). Skip the '...'.
27395 parameter_declaration is set to NULL_TREE, and
27396 objc_being_catch_clauses() knows that that means
27397 '...'. */
27400 }
27401 else
27402 {
27403 /* We have "@catch (NSException *exception)" or something
27404 like that. Parse the parameter declaration. */
27408 else
27413 }
27416 else
27417 {
27418 /* If there was no open parenthesis, we are recovering from
27419 an error, and we are trying to figure out what mistake
27420 the user has made. */
27422 /* If there is an immediate closing parenthesis, the user
27423 probably forgot the opening one (ie, they typed "@catch
27424 NSException *e)". Parse the closing parenthesis and keep
27425 going. */
27429 /* If these is no immediate closing parenthesis, the user
27430 probably doesn't know that parenthesis are required at
27431 all (ie, they typed "@catch NSException *e"). So, just
27432 forget about the closing parenthesis and keep going. */
27433 }
27437 }
27439 {
27442 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27443 node, lest it get absorbed into the surrounding block. */
27447 }
27450 }
27452 /* Parse an Objective-C synchronized statement.
27454 objc-synchronized-stmt:
27455 @synchronized ( expression ) compound-statement
27457 Returns NULL_TREE. */
27459 static tree
27461 {
27462 location_t location;
27473 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27474 node, lest it get absorbed into the surrounding block. */
27479 }
27481 /* Parse an Objective-C throw statement.
27483 objc-throw-stmt:
27484 @throw assignment-expression [opt] ;
27486 Returns a constructed '@throw' statement. */
27488 static tree
27490 {
27502 }
27504 /* Parse an Objective-C statement. */
27506 static tree
27508 {
27509 /* Try to figure out what kind of declaration is present. */
27513 {
27524 }
27527 }
27529 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27530 look ahead to see if an objc keyword follows the attributes. This
27531 is to detect the use of prefix attributes on ObjC @interface and
27532 @protocol. */
27534 static bool
27536 {
27541 {
27544 }
27547 }
27549 /* This routine is a minimal replacement for
27550 c_parser_struct_declaration () used when parsing the list of
27551 types/names or ObjC++ properties. For example, when parsing the
27552 code
27554 @property (readonly) int a, b, c;
27556 this function is responsible for parsing "int a, int b, int c" and
27557 returning the declarations as CHAIN of DECLs.
27559 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27560 similar parsing. */
27561 static tree
27563 {
27565 cp_decl_specifier_seq declspecs;
27567 tree prefix_attributes;
27570 CP_PARSER_FLAGS_NONE,
27577 /* auto, register, static, extern, mutable. */
27579 {
27582 }
27584 /* thread_local. */
27586 {
27589 }
27591 /* typedef. */
27593 {
27596 }
27601 /* Keep going until we hit the `;' at the end of the declaration. */
27603 {
27608 /* Parse the declarator. */
27612 /* Look for attributes that apply to the ivar. */
27614 /* Remember which attributes are prefix attributes and
27615 which are not. */
27617 /* Combine the attributes. */
27627 /* Reset PREFIX_ATTRIBUTES. */
27638 {
27641 }
27642 else
27644 }
27646 }
27648 /* Parse an Objective-C @property declaration. The syntax is:
27650 objc-property-declaration:
27651 '@property' objc-property-attributes[opt] struct-declaration ;
27653 objc-property-attributes:
27654 '(' objc-property-attribute-list ')'
27656 objc-property-attribute-list:
27657 objc-property-attribute
27658 objc-property-attribute-list, objc-property-attribute
27660 objc-property-attribute
27661 'getter' = identifier
27662 'setter' = identifier
27663 'readonly'
27664 'readwrite'
27665 'assign'
27666 'retain'
27667 'copy'
27668 'nonatomic'
27670 For example:
27671 @property NSString *name;
27672 @property (readonly) id object;
27673 @property (retain, nonatomic, getter=getTheName) id name;
27674 @property int a, b, c;
27676 PS: This function is identical to
27677 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27678 static void
27680 {
27681 /* The following variables hold the attributes of the properties as
27682 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27683 seen. When we see an attribute, we set them to 'true' (if they
27684 are boolean properties) or to the identifier (if they have an
27685 argument, ie, for getter and setter). Note that here we only
27686 parse the list of attributes, check the syntax and accumulate the
27687 attributes that we find. objc_add_property_declaration() will
27688 then process the information. */
27698 /* 'properties' is the list of properties that we read. Usually a
27699 single one, but maybe more (eg, in "@property int a, b, c;" there
27700 are three). */
27701 tree properties;
27702 location_t loc;
27708 /* Parse the optional attribute list... */
27710 {
27711 /* Eat the '('. */
27715 {
27721 {
27724 }
27728 {
27739 {
27743 else
27748 }
27751 {
27755 }
27757 {
27759 {
27762 }
27763 else
27767 else
27769 }
27770 else
27771 {
27773 {
27776 }
27777 else
27779 }
27785 }
27792 else
27794 }
27796 /* FIXME: "@property (setter, assign);" will generate a spurious
27797 "error: expected ‘)’ before ‘,’ token". This is because
27798 cp_parser_require, unlike the C counterpart, will produce an
27799 error even if we are in error recovery. */
27801 {
27806 }
27807 }
27809 /* ... and the property declaration(s). */
27813 {
27815 /* If the next token is now a `;', consume it. */
27819 }
27823 else
27824 {
27825 /* Comma-separated properties are chained together in
27826 reverse order; add them one by one. */
27835 }
27838 }
27840 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27842 objc-synthesize-declaration:
27843 @synthesize objc-synthesize-identifier-list ;
27845 objc-synthesize-identifier-list:
27846 objc-synthesize-identifier
27847 objc-synthesize-identifier-list, objc-synthesize-identifier
27849 objc-synthesize-identifier
27850 identifier
27851 identifier = identifier
27853 For example:
27854 @synthesize MyProperty;
27855 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27857 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27858 for C. Keep them in sync.
27859 */
27860 static void
27862 {
27864 location_t loc;
27869 {
27873 {
27876 }
27878 {
27882 {
27885 }
27886 }
27887 else
27892 else
27894 }
27897 }
27899 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27901 objc-dynamic-declaration:
27902 @dynamic identifier-list ;
27904 For example:
27905 @dynamic MyProperty;
27906 @dynamic MyProperty, AnotherProperty;
27908 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27909 for C. Keep them in sync.
27910 */
27911 static void
27913 {
27915 location_t loc;
27920 {
27921 tree property;
27924 {
27927 }
27931 else
27933 }
27936 }
27938 \f
27939 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27941 /* Returns name of the next clause.
27942 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27943 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27944 returned and the token is consumed. */
27946 static pragma_omp_clause
27948 {
27960 {
27965 {
28068 }
28069 }
28075 }
28077 /* Validate that a clause of the given type does not already exist. */
28079 static void
28082 {
28083 tree c;
28087 {
28090 }
28091 }
28093 /* OpenMP 2.5:
28094 variable-list:
28095 identifier
28096 variable-list , identifier
28098 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
28099 colon). An opening parenthesis will have been consumed by the caller.
28101 If KIND is nonzero, create the appropriate node and install the decl
28102 in OMP_CLAUSE_DECL and add the node to the head of the list.
28104 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
28105 return the list created.
28107 COLON can be NULL if only closing parenthesis should end the list,
28108 or pointer to bool which will receive false if the list is terminated
28109 by closing parenthesis or true if the list is terminated by colon. */
28111 static tree
28114 {
28118 {
28121 }
28123 {
28140 {
28142 {
28148 {
28155 NULL);
28157 parser->colon_corrects_to_scope_p
28161 else
28162 {
28163 /* Look for `:'. */
28167 CPP_CLOSE_SQUARE))
28170 NULL);
28171 }
28172 /* Look for the closing `]'. */
28174 RT_CLOSE_SQUARE))
28177 }
28181 }
28187 }
28188 else
28191 get_comma:
28195 }
28201 {
28205 }
28208 {
28211 /* Try to resync to an unnested comma. Copied from
28212 cp_parser_parenthesized_expression_list. */
28213 skip_comma:
28222 }
28225 }
28227 /* Similarly, but expect leading and trailing parenthesis. This is a very
28228 common case for omp clauses. */
28230 static tree
28232 {
28236 }
28238 /* OpenMP 3.0:
28239 collapse ( constant-expression ) */
28241 static tree
28243 {
28245 location_t loc;
28246 HOST_WIDE_INT n;
28266 {
28269 }
28277 }
28279 /* OpenMP 2.5:
28280 default ( shared | none ) */
28282 static tree
28284 {
28286 tree c;
28291 {
28296 {
28311 }
28314 }
28315 else
28316 {
28317 invalid_kind:
28319 }
28335 }
28337 /* OpenMP 3.1:
28338 final ( expression ) */
28340 static tree
28342 {
28363 }
28365 /* OpenMP 2.5:
28366 if ( expression ) */
28368 static tree
28370 {
28391 }
28393 /* OpenMP 3.1:
28394 mergeable */
28396 static tree
28399 {
28400 tree c;
28403 location);
28408 }
28410 /* OpenMP 2.5:
28411 nowait */
28413 static tree
28416 {
28417 tree c;
28424 }
28426 /* OpenMP 2.5:
28427 num_threads ( expression ) */
28429 static tree
28431 location_t location)
28432 {
28454 }
28456 /* OpenMP 2.5:
28457 ordered */
28459 static tree
28462 {
28463 tree c;
28471 }
28473 /* OpenMP 2.5:
28474 reduction ( reduction-operator : variable-list )
28476 reduction-operator:
28477 One of: + * - & ^ | && ||
28479 OpenMP 3.1:
28481 reduction-operator:
28482 One of: + * - & ^ | && || min max
28484 OpenMP 4.0:
28486 reduction-operator:
28487 One of: + * - & ^ | && ||
28488 id-expression */
28490 static tree
28492 {
28500 {
28510 }
28514 else
28515 {
28526 {
28556 }
28557 else
28558 {
28560 resync_fail:
28565 }
28566 }
28572 NULL);
28574 {
28577 }
28580 }
28582 /* OpenMP 2.5:
28583 schedule ( schedule-kind )
28584 schedule ( schedule-kind , expression )
28586 schedule-kind:
28587 static | dynamic | guided | runtime | auto */
28589 static tree
28591 {
28600 {
28605 {
28626 }
28627 }
28632 else
28637 {
28652 else
28657 }
28665 invalid_kind:
28667 resync_fail:
28672 }
28674 /* OpenMP 3.0:
28675 untied */
28677 static tree
28680 {
28681 tree c;
28688 }
28690 /* OpenMP 4.0:
28691 inbranch
28692 notinbranch */
28694 static tree
28697 {
28702 }
28704 /* OpenMP 4.0:
28705 parallel
28706 for
28707 sections
28708 taskgroup */
28710 static tree
28714 {
28718 }
28720 /* OpenMP 4.0:
28721 num_teams ( expression ) */
28723 static tree
28725 location_t location)
28726 {
28748 }
28750 /* OpenMP 4.0:
28751 thread_limit ( expression ) */
28753 static tree
28755 location_t location)
28756 {
28778 }
28780 /* OpenMP 4.0:
28781 aligned ( variable-list )
28782 aligned ( variable-list : constant-expression ) */
28784 static tree
28786 {
28797 {
28807 }
28813 }
28815 /* OpenMP 4.0:
28816 linear ( variable-list )
28817 linear ( variable-list : expression ) */
28819 static tree
28822 {
28833 {
28837 {
28840 }
28848 }
28854 }
28856 /* OpenMP 4.0:
28857 safelen ( constant-expression ) */
28859 static tree
28861 location_t location)
28862 {
28883 }
28885 /* OpenMP 4.0:
28886 simdlen ( constant-expression ) */
28888 static tree
28890 location_t location)
28891 {
28912 }
28914 /* OpenMP 4.0:
28915 depend ( depend-kind : variable-list )
28917 depend-kind:
28918 in | out | inout */
28920 static tree
28922 {
28930 {
28940 else
28942 }
28943 else
28951 NULL);
28958 invalid_kind:
28960 resync_fail:
28965 }
28967 /* OpenMP 4.0:
28968 map ( map-kind : variable-list )
28969 map ( variable-list )
28971 map-kind:
28972 alloc | to | from | tofrom */
28974 static tree
28976 {
28985 {
28997 else
28998 {
29004 }
29007 }
29010 NULL);
29016 }
29018 /* OpenMP 4.0:
29019 device ( expression ) */
29021 static tree
29023 location_t location)
29024 {
29046 }
29048 /* OpenMP 4.0:
29049 dist_schedule ( static )
29050 dist_schedule ( static , expression ) */
29052 static tree
29054 location_t location)
29055 {
29068 {
29079 }
29084 location);
29088 invalid_kind:
29090 resync_fail:
29095 }
29097 /* OpenMP 4.0:
29098 proc_bind ( proc-bind-kind )
29100 proc-bind-kind:
29101 master | close | spread */
29103 static tree
29105 location_t location)
29106 {
29107 tree c;
29114 {
29124 else
29126 }
29127 else
29136 location);
29141 invalid_kind:
29143 resync_fail:
29148 }
29150 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29151 is a bitmask in MASK. Return the list of clauses found; the result
29152 of clause default goes in *pdefault. */
29154 static tree
29158 {
29165 {
29166 pragma_omp_clause c_kind;
29177 {
29189 clauses);
29203 clauses);
29212 clauses);
29236 clauses);
29250 clauses);
29267 OMP_CLAUSE_NOTINBRANCH,
29276 {
29277 clause_not_first:
29281 }
29306 clauses);
29311 clauses);
29316 clauses);
29379 }
29384 {
29385 /* Remove the invalid clause(s) from the list to avoid
29386 confusing the rest of the compiler. */
29389 }
29390 }
29391 saw_error:
29392 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29393 no reason to skip to the end. */
29399 }
29401 /* OpenMP 2.5:
29402 structured-block:
29403 statement
29405 In practice, we're also interested in adding the statement to an
29406 outer node. So it is convenient if we work around the fact that
29407 cp_parser_statement calls add_stmt. */
29409 static unsigned
29411 {
29414 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29415 This preserves the "not within loop or switch" style error messages
29416 for nonsense cases like
29417 void foo() {
29418 #pragma omp single
29419 break;
29420 }
29421 */
29426 }
29428 static void
29430 {
29432 }
29434 static tree
29436 {
29444 }
29446 /* OpenMP 2.5:
29447 # pragma omp atomic new-line
29448 expression-stmt
29450 expression-stmt:
29451 x binop= expr | x++ | ++x | x-- | --x
29452 binop:
29453 +, *, -, /, &, ^, |, <<, >>
29455 where x is an lvalue expression with scalar type.
29457 OpenMP 3.1:
29458 # pragma omp atomic new-line
29459 update-stmt
29461 # pragma omp atomic read new-line
29462 read-stmt
29464 # pragma omp atomic write new-line
29465 write-stmt
29467 # pragma omp atomic update new-line
29468 update-stmt
29470 # pragma omp atomic capture new-line
29471 capture-stmt
29473 # pragma omp atomic capture new-line
29474 capture-block
29476 read-stmt:
29477 v = x
29478 write-stmt:
29479 x = expr
29480 update-stmt:
29481 expression-stmt | x = x binop expr
29482 capture-stmt:
29483 v = expression-stmt
29484 capture-block:
29485 { v = x; update-stmt; } | { update-stmt; v = x; }
29487 OpenMP 4.0:
29488 update-stmt:
29489 expression-stmt | x = x binop expr | x = expr binop x
29490 capture-stmt:
29491 v = update-stmt
29492 capture-block:
29493 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29495 where x and v are lvalue expressions with scalar type. */
29497 static void
29499 {
29507 {
29512 {
29518 }
29519 }
29521 {
29533 else
29537 }
29539 {
29545 {
29550 {
29553 }
29554 }
29555 }
29559 {
29570 else
29576 {
29577 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29578 opcode. */
29583 }
29587 {
29590 }
29591 else
29592 {
29599 }
29602 }
29604 restart:
29609 {
29616 /* FALLTHROUGH */
29626 /* FALLTHROUGH */
29641 /* Undo effects of boolean_increment for post {in,de}crement. */
29643 /* FALLTHRU */
29647 {
29648 /* Undo effects of boolean_increment. */
29650 {
29651 /* This is pre or post increment. */
29656 && !structured_block
29660 }
29661 }
29662 /* FALLTHRU */
29665 {
29700 {
29704 }
29707 {
29713 {
29718 }
29720 {
29731 {
29733 {
29738 }
29739 else
29741 }
29745 }
29748 {
29755 }
29759 }
29763 {
29766 {
29774 }
29776 {
29781 }
29816 }
29827 /* FALLTHROUGH */
29832 }
29839 }
29840 stmt_done:
29842 {
29855 }
29857 {
29860 }
29861 done:
29867 saw_error:
29870 {
29874 {
29878 }
29879 }
29880 }
29883 /* OpenMP 2.5:
29884 # pragma omp barrier new-line */
29886 static void
29888 {
29891 }
29893 /* OpenMP 2.5:
29894 # pragma omp critical [(name)] new-line
29895 structured-block */
29897 static tree
29899 {
29903 {
29915 }
29920 }
29922 /* OpenMP 2.5:
29923 # pragma omp flush flush-vars[opt] new-line
29925 flush-vars:
29926 ( variable-list ) */
29928 static void
29930 {
29936 }
29938 /* Helper function, to parse omp for increment expression. */
29940 static tree
29942 {
29947 {
29950 }
29953 {
29962 /* Fall through: OpenMP disallows NE_EXPR. */
29965 }
29967 /* If decl is an iterator, preserve LHS and RHS of the relational
29968 expr until finish_omp_for. */
29978 }
29980 /* Helper function, to parse omp for increment expression. */
29982 static tree
29984 {
29988 cp_id_kind idk;
29992 {
30000 }
30008 {
30013 }
30020 {
30024 }
30036 do
30037 {
30044 {
30046 {
30049 else
30051 tf_warning_or_error);
30052 }
30053 else
30056 }
30057 }
30061 {
30065 }
30066 else
30070 }
30072 /* Parse the initialization statement of either an OpenMP for loop or
30073 a Cilk Plus for loop.
30075 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
30076 Plus.
30078 Return true if the resulting construct should have an
30079 OMP_CLAUSE_PRIVATE added to it. */
30081 static bool
30089 {
30095 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30097 init-expr:
30098 var = lb
30099 integer-type var = lb
30100 random-access-iterator-type var = lb
30101 pointer-type var = lb
30102 */
30103 cp_decl_specifier_seq type_specifiers;
30105 /* First, try to parse as an initialized declaration. See
30106 cp_parser_condition, from whence the bulk of this is copied. */
30113 {
30114 /* If parsing a type specifier seq succeeded, then this
30115 MUST be a initialized declaration. */
30120 CP_PARSER_DECLARATOR_NAMED,
30131 else
30132 {
30142 {
30144 CPP_OPEN_PAREN))
30145 {
30149 else
30152 }
30153 else
30154 /* Trigger an error. */
30159 }
30163 {
30171 {
30174 auto_node);
30179 }
30182 asm_specification,
30183 LOOKUP_ONLYCONVERTING);
30185 {
30188 }
30189 else
30192 }
30193 else
30194 {
30195 /* Consume '='. */
30199 non_class:
30202 else
30205 asm_specification,
30206 LOOKUP_ONLYCONVERTING);
30207 }
30211 }
30212 }
30213 else
30214 {
30215 cp_id_kind idk;
30216 /* If parsing a type specifier sequence failed, then
30217 this MUST be a simple expression. */
30222 && decl
30225 {
30226 tree rhs;
30233 rhs,
30234 tf_warning_or_error));
30236 }
30237 else
30238 {
30243 {
30247 }
30248 }
30249 }
30251 }
30253 /* Parse the restricted form of the for statement allowed by OpenMP. */
30255 static tree
30258 {
30262 location_t loc_first;
30281 {
30284 location_t loc;
30287 {
30290 }
30299 add_private_clause
30307 {
30310 {
30316 }
30317 else
30319 }
30326 {
30331 {
30335 }
30338 {
30339 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30340 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30345 {
30348 }
30349 else
30350 {
30353 }
30357 }
30358 else
30359 {
30364 }
30365 }
30368 {
30369 tree c;
30371 {
30380 decl);
30384 decl);
30385 }
30387 {
30392 {
30395 }
30396 }
30397 }
30406 {
30407 /* If decl is an iterator, preserve the operator on decl
30408 until finish_omp_for. */
30410 && ((processing_template_decl
30414 else
30418 }
30433 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30434 in between the collapsed for loops to be still considered perfectly
30435 nested. Hopefully the final version clarifies this.
30436 For now handle (multiple) {'s and empty statements. */
30438 do
30439 {
30443 {
30445 bracecount++;
30446 }
30450 else
30451 {
30458 }
30459 }
30463 {
30466 }
30467 }
30469 /* Note that we saved the original contents of this flag when we entered
30470 the structured block, and so we don't need to re-save it here. */
30473 else
30476 /* Note that the grammar doesn't call for a structured block here,
30477 though the loop as a whole is a structured block. */
30484 else
30489 {
30491 {
30493 nbraces--;
30494 }
30497 else
30498 {
30500 {
30503 }
30508 }
30509 }
30516 }
30518 /* Helper function for OpenMP parsing, split clauses and call
30519 finish_omp_clauses on each of the set of clauses afterwards. */
30521 static void
30524 {
30530 }
30532 /* OpenMP 4.0:
30533 #pragma omp simd simd-clause[optseq] new-line
30534 for-loop */
30536 #define OMP_SIMD_CLAUSE_MASK \
30537 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30545 static tree
30548 {
30560 {
30563 }
30574 }
30576 /* OpenMP 2.5:
30577 #pragma omp for for-clause[optseq] new-line
30578 for-loop
30580 OpenMP 4.0:
30581 #pragma omp for simd for-simd-clause[optseq] new-line
30582 for-loop */
30584 #define OMP_FOR_CLAUSE_MASK \
30585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30594 static tree
30597 {
30608 {
30613 {
30621 cclauses);
30625 cclauses);
30637 }
30638 }
30640 {
30643 }
30648 {
30651 }
30662 }
30664 /* OpenMP 2.5:
30665 # pragma omp master new-line
30666 structured-block */
30668 static tree
30670 {
30674 }
30676 /* OpenMP 2.5:
30677 # pragma omp ordered new-line
30678 structured-block */
30680 static tree
30682 {
30686 }
30688 /* OpenMP 2.5:
30690 section-scope:
30691 { section-sequence }
30693 section-sequence:
30694 section-directive[opt] structured-block
30695 section-sequence section-directive structured-block */
30697 static tree
30699 {
30710 {
30714 }
30717 {
30725 {
30729 }
30731 {
30734 }
30739 }
30750 }
30752 /* OpenMP 2.5:
30753 # pragma omp sections sections-clause[optseq] newline
30754 sections-scope */
30756 #define OMP_SECTIONS_CLAUSE_MASK \
30757 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30763 static tree
30766 {
30778 {
30781 }
30788 }
30790 /* OpenMP 2.5:
30791 # pragma omp parallel parallel-clause[optseq] new-line
30792 structured-block
30793 # pragma omp parallel for parallel-for-clause[optseq] new-line
30794 structured-block
30795 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30796 structured-block
30798 OpenMP 4.0:
30799 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30800 structured-block */
30802 #define OMP_PARALLEL_CLAUSE_MASK \
30803 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30813 static tree
30816 {
30825 {
30838 block);
30843 }
30845 {
30849 }
30851 {
30854 }
30856 {
30860 {
30870 block);
30873 }
30874 }
30884 }
30886 /* OpenMP 2.5:
30887 # pragma omp single single-clause[optseq] new-line
30888 structured-block */
30890 #define OMP_SINGLE_CLAUSE_MASK \
30891 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30896 static tree
30898 {
30908 }
30910 /* OpenMP 3.0:
30911 # pragma omp task task-clause[optseq] new-line
30912 structured-block */
30914 #define OMP_TASK_CLAUSE_MASK \
30915 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30925 static tree
30927 {
30938 }
30940 /* OpenMP 3.0:
30941 # pragma omp taskwait new-line */
30943 static void
30945 {
30948 }
30950 /* OpenMP 3.1:
30951 # pragma omp taskyield new-line */
30953 static void
30955 {
30958 }
30960 /* OpenMP 4.0:
30961 # pragma omp taskgroup new-line
30962 structured-block */
30964 static tree
30966 {
30970 }
30973 /* OpenMP 2.5:
30974 # pragma omp threadprivate (variable-list) */
30976 static void
30978 {
30979 tree vars;
30985 }
30987 /* OpenMP 4.0:
30988 # pragma omp cancel cancel-clause[optseq] new-line */
30990 #define OMP_CANCEL_CLAUSE_MASK \
30991 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30997 static void
30999 {
31003 }
31005 /* OpenMP 4.0:
31006 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31008 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31009 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31014 static void
31016 {
31017 tree clauses;
31021 {
31026 {
31029 }
31030 }
31032 {
31036 }
31039 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31041 pragma_tok);
31043 }
31045 /* OpenMP 4.0:
31046 #pragma omp distribute distribute-clause[optseq] new-line
31047 for-loop */
31049 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31050 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31055 static tree
31058 {
31067 {
31075 else
31078 {
31084 {
31087 cclauses);
31088 else
31090 cclauses);
31091 }
31096 cclauses);
31097 else
31099 cclauses);
31111 }
31112 }
31114 {
31117 }
31122 {
31125 }
31136 }
31138 /* OpenMP 4.0:
31139 # pragma omp teams teams-clause[optseq] new-line
31140 structured-block */
31142 #define OMP_TEAMS_CLAUSE_MASK \
31143 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31151 static tree
31154 {
31163 {
31167 {
31175 cclauses);
31179 cclauses);
31190 }
31191 }
31193 {
31196 }
31201 {
31204 }
31212 }
31214 /* OpenMP 4.0:
31215 # pragma omp target data target-data-clause[optseq] new-line
31216 structured-block */
31218 #define OMP_TARGET_DATA_CLAUSE_MASK \
31219 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31223 static tree
31225 {
31237 }
31239 /* OpenMP 4.0:
31240 # pragma omp target update target-update-clause[optseq] new-line */
31242 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31243 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31248 static bool
31251 {
31253 {
31255 "%<#pragma omp target update%> may only be "
31259 }
31261 tree clauses
31266 {
31268 "%<#pragma omp target update must contain at least one "
31271 }
31279 }
31281 /* OpenMP 4.0:
31282 # pragma omp target target-clause[optseq] new-line
31283 structured-block */
31285 #define OMP_TARGET_CLAUSE_MASK \
31286 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31290 static bool
31293 {
31295 {
31299 }
31302 {
31307 {
31315 {
31317 OMP_TARGET_CLAUSE_MASK,
31318 cclauses);
31320 }
31336 }
31338 {
31341 }
31343 {
31347 }
31349 {
31352 }
31353 }
31367 }
31369 /* OpenMP 4.0:
31370 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31372 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31373 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31380 static void
31383 {
31385 cp_omp_declare_simd_data data;
31387 {
31392 }
31403 {
31407 {
31420 }
31425 "%<#pragma omp declare simd%> not immediately followed by "
31429 }
31430 }
31432 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31433 This function is modelled similar to the late parsing of omp declare
31434 simd. */
31436 static tree
31438 {
31444 {
31450 }
31452 {
31456 }
31461 {
31468 NULL);
31482 }
31487 }
31489 /* Finalize #pragma omp declare simd clauses after direct declarator has
31490 been parsed, and put that into "omp declare simd" attribute. */
31492 static tree
31494 {
31500 {
31505 }
31510 {
31528 }
31532 }
31535 /* OpenMP 4.0:
31536 # pragma omp declare target new-line
31537 declarations and definitions
31538 # pragma omp end declare target new-line */
31540 static void
31542 {
31545 }
31547 static void
31549 {
31552 {
31555 }
31557 {
31561 {
31564 }
31567 else
31568 {
31572 }
31573 }
31574 else
31575 {
31579 }
31583 "%<#pragma omp end declare target%> without corresponding "
31585 else
31587 }
31589 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31590 expression and optional initializer clause of
31591 #pragma omp declare reduction. We store the expression(s) as
31592 either 3, 6 or 7 special statements inside of the artificial function's
31593 body. The first two statements are DECL_EXPRs for the artificial
31594 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31595 expression that uses those variables.
31596 If there was any INITIALIZER clause, this is followed by further statements,
31597 the fourth and fifth statements are DECL_EXPRs for the artificial
31598 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31599 constructor variant (first token after open paren is not omp_priv),
31600 then the sixth statement is a statement with the function call expression
31601 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31602 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31603 to initialize the OMP_PRIV artificial variable and there is seventh
31604 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31606 static bool
31608 {
31620 tree combiner;
31635 {
31638 }
31641 {
31648 {
31651 }
31667 {
31671 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31675 == CPP_CLOSE_PAREN
31678 {
31682 }
31687 }
31688 else
31689 {
31705 {
31710 }
31712 tree arg;
31725 }
31736 }
31742 }
31744 /* OpenMP 4.0
31745 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31746 initializer-clause[opt] new-line
31748 initializer-clause:
31749 initializer (omp_priv initializer)
31750 initializer (function-name (argument-list)) */
31752 static void
31755 {
31765 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31772 {
31804 }
31816 /* Types may not be defined in declare reduction type list. */
31819 parser->type_definition_forbidden_message
31825 saved_colon_doesnt_start_class_def_p
31830 {
31834 ;
31855 else
31860 else
31862 }
31864 /* Restore the saved message. */
31867 parser->colon_doesnt_start_class_def_p
31872 {
31873 fail:
31876 }
31882 {
31883 tree fntype
31886 NULL_TREE);
31905 {
31910 }
31912 {
31914 {
31923 }
31930 }
31931 else
31932 {
31935 }
31938 else
31941 {
31944 }
31946 {
31949 else
31954 }
31959 else
31960 {
31969 }
31976 }
31980 done:
31981 /* Free any declarators allocated. */
31983 }
31985 /* OpenMP 4.0
31986 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31987 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31988 initializer-clause[opt] new-line
31989 #pragma omp declare target new-line */
31991 static void
31994 {
31996 {
32001 {
32004 context);
32006 }
32009 {
32012 context);
32014 }
32016 {
32019 }
32021 {
32025 }
32026 }
32030 }
32032 /* Main entry point to OpenMP statement pragmas. */
32034 static void
32036 {
32037 tree stmt;
32042 {
32090 }
32094 }
32095 \f
32096 /* Transactional Memory parsing routines. */
32098 /* Parse a transaction attribute.
32100 txn-attribute:
32101 attribute
32102 [ [ identifier ] ]
32104 ??? Simplify this when C++0x bracket attributes are
32105 implemented properly. */
32107 static tree
32109 {
32124 {
32128 /* For keywords, use the canonical spelling,
32129 not the parsed identifier. */
32133 }
32134 else
32138 error1:
32141 }
32143 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32145 transaction-statement:
32146 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32147 compound-statement
32148 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32149 */
32151 static tree
32153 {
32168 else
32169 {
32173 }
32175 /* Parse a noexcept specification. */
32178 /* Keep track if we're in the lexical scope of an outer transaction. */
32190 }
32192 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32194 transaction-expression:
32195 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32196 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32197 */
32199 static tree
32201 {
32226 /* Set this early. This might mean that we allow transaction_cancel in
32227 an expression that we find out later actually has to be a constexpr.
32228 However, we expect that cxx_constant_value will be able to deal with
32229 this; also, if the noexcept has no constexpr, then what we parse next
32230 really is a transaction's body. */
32233 /* Parse a noexcept specification. */
32239 {
32246 }
32247 else
32248 {
32249 /* The only expression that is available got parsed for the noexcept
32250 already. noexcept is true then. */
32253 }
32262 }
32264 /* Parse a function-transaction-block.
32266 function-transaction-block:
32267 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32268 function-body
32269 __transaction_atomic txn-attribute[opt] function-try-block
32270 __transaction_relaxed ctor-initializer[opt] function-body
32271 __transaction_relaxed function-try-block
32272 */
32274 static bool
32276 {
32292 else
32293 {
32297 }
32305 else
32306 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32314 }
32316 /* Parse a __transaction_cancel statement.
32318 cancel-statement:
32319 __transaction_cancel txn-attribute[opt] ;
32320 __transaction_cancel txn-attribute[opt] throw-expression ;
32322 ??? Cancel and throw is not yet implemented. */
32324 static tree
32326 {
32332 RT_TRANSACTION_CANCEL);
32339 /* ??? Parse cancel-and-throw here. */
32344 {
32348 }
32350 {
32354 }
32356 {
32359 {
32365 }
32366 }
32368 {
32372 }
32378 }
32379 \f
32380 /* The parser. */
32384 \f
32385 /* Special handling for the first token or line in the file. The first
32386 thing in the file might be #pragma GCC pch_preprocess, which loads a
32387 PCH file, which is a GC collection point. So we need to handle this
32388 first pragma without benefit of an existing lexer structure.
32390 Always returns one token to the caller in *FIRST_TOKEN. This is
32391 either the true first token of the file, or the first token after
32392 the initial pragma. */
32394 static void
32396 {
32405 {
32412 }
32413 else
32416 /* Skip to the end of the pragma. */
32420 /* Now actually load the PCH file. */
32424 /* Read one more token to return to our caller. We have to do this
32425 after reading the PCH file in, since its pointers have to be
32426 live. */
32428 }
32430 /* Normal parsing of a pragma token. Here we can (and must) use the
32431 regular lexer. */
32433 static bool
32435 {
32447 {
32455 {
32465 }
32470 {
32480 }
32485 {
32491 "%<#pragma omp taskwait%> may only be "
32496 }
32501 {
32507 "%<#pragma omp taskyield%> may only be "
32512 }
32517 {
32523 "%<#pragma omp cancel%> may only be "
32528 }
32533 {
32539 "%<#pragma omp cancellation point%> may only be "
32544 }
32582 "%<#pragma omp section%> may only be used in "
32587 {
32594 {
32597 }
32600 }
32604 {
32608 }
32617 bad_stmt:
32620 }
32624 }
32626 /* The interface the pragma parsers have to the lexer. */
32628 enum cpp_ttype
32630 {
32643 else
32644 {
32648 }
32651 }
32653 \f
32654 /* External interface. */
32656 /* Parse one entire translation unit. */
32658 void
32660 {
32664 {
32667 }
32675 }
32677 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32678 vectorlength clause:
32679 Syntax:
32680 vectorlength ( constant-expression ) */
32682 static tree
32685 {
32687 tree expr;
32688 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32689 safelen clause. Thus, vectorlength is represented as OMP 4.0
32690 safelen. For SIMD-enabled function it is represented by OMP 4.0
32691 simdlen. */
32694 loc);
32695 else
32697 loc);
32705 /* If expr == error_mark_node, then don't emit any errors nor
32706 create a clause. if any of the above functions returns
32707 error mark node then they would have emitted an error message. */
32709 ;
32717 else
32718 {
32719 tree c;
32721 {
32726 }
32727 else
32728 {
32733 }
32734 }
32739 }
32741 /* Handles the Cilk Plus #pragma simd linear clause.
32742 Syntax:
32743 linear ( simd-linear-variable-list )
32745 simd-linear-variable-list:
32746 simd-linear-variable
32747 simd-linear-variable-list , simd-linear-variable
32749 simd-linear-variable:
32750 id-expression
32751 id-expression : simd-linear-step
32753 simd-linear-step:
32754 conditional-expression */
32756 static tree
32758 {
32764 {
32768 }
32773 {
32776 {
32780 }
32787 {
32791 }
32792 else
32793 {
32797 /* If present, parse the linear step. Otherwise, assume the default
32798 value of 1. */
32800 {
32807 {
32808 /* If an error has occurred, then the whole pragma is
32809 considered ill-formed. Thus, no reason to keep
32810 parsing. */
32813 }
32821 else
32823 "step size must be an integer constant "
32825 }
32827 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32833 }
32838 else
32839 {
32844 }
32845 }
32849 }
32851 /* Returns the name of the next clause. If the clause is not
32852 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32853 token is not consumed. Otherwise, the appropriate enum from the
32854 pragma_simd_clause is returned and the token is consumed. */
32856 static pragma_omp_clause
32858 {
32859 pragma_omp_clause clause_type;
32876 else
32881 }
32883 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32885 static tree
32887 {
32892 {
32893 pragma_omp_clause c_kind;
32900 /* Use the OpenMP 4.0 equivalent function. */
32903 /* Use the OpenMP 4.0 equivalent function. */
32905 clauses);
32907 /* Use the OMP 4.0 equivalent function. */
32909 clauses);
32911 /* Use the OMP 4.0 equivalent function. */
32913 else
32914 {
32918 }
32919 }
32925 else
32927 }
32929 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32931 static void
32933 {
32940 {
32944 }
32954 }
32956 /* Create an identifier for a generic parameter type (a synthesized
32957 template parameter implied by `auto' or a concept identifier). */
32960 static tree
32962 {
32966 }
32968 /* Predicate that behaves as is_auto_or_concept but matches the parent
32969 node of the generic type rather than the generic type itself. This
32970 allows for type transformation in add_implicit_template_parms. */
32974 {
32976 }
32978 // Return the template decl being called or evaluated as part of the
32979 // constraint check.
32980 //
32981 // TODO: This is a bit of a hack. When we finish the template parameter
32982 // the constraint is just a call expression, but we don't have the full
32983 // context that we used to build that call expression. Since we're going
32984 // to be comparing declarations, it would helpful to have that. This
32985 // means we'll have to make the TREE_TYPE of the parameter node a pair
32986 // containing the context (the TYPE_DECL) and the constraint.
32987 static tree
32989 {
32995 }
32997 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32998 (creating a new template parameter list if necessary). Returns the newly
32999 created template type parm. */
33001 tree
33003 {
33006 // Before committing to modifying any scope, if we're in an implicit
33007 // template scope, and we're trying to synthesize a constrained
33008 // parameter, try to find a previous parameter with the same name.
33010 {
33013 {
33018 }
33019 }
33022 /* We are either continuing a function template that already contains implicit
33023 template parameters, creating a new fully-implicit function template, or
33024 extending an existing explicit function template with implicit template
33025 parameters. */
33033 {
33037 }
33038 else
33039 {
33040 /* Roll back to the existing template parameter scope (in the case of
33041 extending an explicit function template) or introduce a new template
33042 parameter scope ahead of the function parameter scope (or class scope
33043 in the case of out-of-line member definitions). The function scope is
33044 added back after template parameter synthesis below. */
33049 {
33052 }
33054 {
33055 /* If not defining a class, then any class scope is a scope level in
33056 an out-of-line member definition. In this case simply wind back
33057 beyond the first such scope to inject the template parameter list.
33058 Otherwise wind back to the class being defined. The latter can
33059 occur in class member friend declarations such as:
33061 class A {
33062 void foo (auto);
33063 };
33064 class B {
33065 friend void A::foo (auto);
33066 };
33068 The template parameter list synthesized for the friend declaration
33069 must be injected in the scope of 'B'. This can also occur in
33070 erroneous cases such as:
33072 struct A {
33073 struct B {
33074 void foo (auto);
33075 };
33076 void B::foo (auto) {}
33077 };
33079 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33080 but, nevertheless, the template parameter list synthesized for the
33081 declarator should be injected into the scope of 'A' as if the
33082 ill-formed template was specified explicitly. */
33085 {
33088 }
33089 }
33095 {
33096 /* Introduce a new template parameter list for implicit template
33097 parameters. */
33101 parser->implicit_template_scope
33108 }
33109 else
33110 {
33111 /* Synthesize implicit template parameters at the end of the explicit
33112 template parameter list. */
33119 parser->implicit_template_parms
33121 }
33122 }
33124 /* Synthesize a new template parameter and track the current template
33125 parameter chain with implicit_template_parms. */
33129 synth_id);
33131 // Attach the constraint to the parm before processing.
33135 tree new_parm
33137 input_location,
33138 node,
33144 parser->implicit_template_parms
33146 else
33151 /* If creating a fully implicit function template, start the new implicit
33152 template parameter list with this synthesized type, otherwise grow the
33153 current template parameter list. */
33156 {
33163 }
33164 else
33165 {
33170 }
33175 }
33177 /* Finish the declaration of a fully implicit function template. Such a
33178 template has no explicit template parameter list so has not been through the
33179 normal template head and tail processing. synthesize_implicit_template_parm
33180 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33181 provided if the declaration is a class member such that its template
33182 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33183 form is returned. Otherwise NULL_TREE is returned. */
33185 tree
33187 {
33192 {
33196 }
33206 }