| blob | 33ad886524e76e27e84b5a03fe15a094a5bce746 |
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
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
186 /* Prototypes. */
192 static void cp_lexer_destroy
194 static int cp_lexer_saving_tokens
198 static void cp_lexer_get_preprocessor_token
206 static bool cp_lexer_next_token_is_not
208 static bool cp_lexer_next_token_is_keyword
212 static void cp_lexer_purge_token
214 static void cp_lexer_purge_tokens_after
216 static void cp_lexer_save_tokens
218 static void cp_lexer_commit_tokens
220 static void cp_lexer_rollback_tokens
222 static void cp_lexer_print_token
226 static void cp_lexer_start_debugging
228 static void cp_lexer_stop_debugging
234 static void cp_parser_initial_pragma
237 static tree cp_literal_operator_id
240 static void cp_parser_cilk_simd
242 static tree cp_parser_cilk_for
244 static bool cp_parser_omp_declare_reduction_exprs
246 static tree cp_parser_cilk_simd_vectorlength
249 /* Manifest constants. */
250 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
251 #define CP_SAVED_TOKEN_STACK 5
253 /* Variables. */
255 /* The stream to which debugging output should be written. */
258 /* Nonzero if we are parsing an unevaluated operand: an operand to
259 sizeof, typeof, or alignof. */
262 /* Dump up to NUM tokens in BUFFER to FILE starting with token
263 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
264 first token in BUFFER. If NUM is 0, dump all the tokens. If
265 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
266 highlighted by surrounding it in [[ ]]. */
268 static void
272 {
289 {
292 }
297 {
304 nprinted++;
314 {
324 }
325 }
328 {
331 }
334 }
337 /* Dump all tokens in BUFFER to stderr. */
339 void
341 {
343 }
345 DEBUG_FUNCTION void
347 {
349 }
351 DEBUG_FUNCTION void
353 {
356 else
358 }
361 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
362 description for T. */
364 static void
366 {
368 {
371 }
372 }
375 /* Dump parser context C to FILE. */
377 static void
379 {
384 }
387 /* Print the stack of parsing contexts to FILE starting with FIRST. */
389 static void
391 {
397 {
400 }
401 }
404 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
406 static void
408 {
411 }
414 /* Print an unparsed function entry UF to FILE. */
416 static void
418 {
421 tree fn;
426 i++)
427 {
433 }
438 {
441 }
447 {
450 }
452 }
455 /* Print the stack of unparsed member functions S to FILE. */
457 static void
460 {
466 {
469 }
470 }
473 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
474 the given PARSER. If FILE is NULL, the output is printed on stderr. */
476 static void
478 {
490 next_token);
491 }
494 /* Dump debugging information for the given PARSER. If FILE is NULL,
495 the output is printed on stderr. */
497 void
499 {
502 expanded_location eloc;
580 }
582 DEBUG_FUNCTION void
584 {
586 }
588 DEBUG_FUNCTION void
590 {
593 else
595 }
597 /* Allocate memory for a new lexer object and return it. */
601 {
606 /* Allocate the memory. */
609 /* Initially we are not debugging. */
614 /* Create the buffer. */
618 }
621 /* Create a new main C++ lexer, the lexer that gets tokens from the
622 preprocessor. */
626 {
628 cp_token token;
630 /* It's possible that parsing the first pragma will load a PCH file,
631 which is a GC collection point. So we have to do that before
632 allocating any memory. */
637 /* Put the first token in the buffer. */
640 /* Get the remaining tokens from the preprocessor. */
642 {
645 }
654 /* Subsequent preprocessor diagnostics should use compiler
655 diagnostic functions to get the compiler source location. */
660 }
662 /* Create a new lexer whose token stream is primed with the tokens in
663 CACHE. When these tokens are exhausted, no new tokens will be read. */
667 {
672 /* We do not own the buffer. */
679 /* Initially we are not debugging. */
684 }
686 /* Frees all resources associated with LEXER. */
688 static void
690 {
694 }
696 /* Returns nonzero if debugging information should be output. */
700 {
702 }
707 {
711 }
715 {
717 }
721 {
723 }
727 {
730 else
732 }
736 {
740 }
742 /* nonzero if we are presently saving tokens. */
746 {
748 }
750 /* Store the next token from the preprocessor in *TOKEN. Return true
751 if we reach EOF. If LEXER is NULL, assume we are handling an
752 initial #pragma pch_preprocess, and thus want the lexer to return
753 processed strings. */
755 static void
757 {
760 /* Get a new token from the preprocessor. */
761 token->type
769 /* On some systems, some header files are surrounded by an
770 implicit extern "C" block. Set a flag in the token if it
771 comes from such a header. */
776 /* Check to see if this token is a keyword. */
778 {
780 {
781 /* Mark this token as a keyword. */
783 /* Record which keyword. */
785 }
786 else
787 {
791 {
792 /* Warn about the C++0x keyword (but still treat it as
793 an identifier). */
798 /* Clear out the C_RID_CODE so we don't warn about this
799 particular identifier-turned-keyword again. */
801 }
804 }
805 }
807 {
808 /* This only happens in Objective-C++; it must be a keyword. */
811 {
812 /* Replace 'class' with '@class', 'private' with '@private',
813 etc. This prevents confusion with the C++ keyword
814 'class', and makes the tokens consistent with other
815 Objective-C 'AT' keywords. For example '@class' is
816 reported as RID_AT_CLASS which is consistent with
817 '@synchronized', which is reported as
818 RID_AT_SYNCHRONIZED.
819 */
828 }
829 }
831 {
832 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
836 }
837 }
839 /* Update the globals input_location and the input file stack from TOKEN. */
842 {
844 {
846 }
847 }
849 /* Update the globals input_location and the input file stack from LEXER. */
852 {
855 }
857 /* Return a pointer to the next token in the token stream, but do not
858 consume it. */
862 {
864 {
868 }
870 }
872 /* Return true if the next token has the indicated TYPE. */
876 {
878 }
880 /* Return true if the next token does not have the indicated TYPE. */
884 {
886 }
888 /* Return true if the next token is the indicated KEYWORD. */
892 {
894 }
898 {
900 }
904 {
906 }
908 /* Return true if the next token is not the indicated KEYWORD. */
912 {
914 }
916 /* Return true if the next token is a keyword for a decl-specifier. */
918 static bool
920 {
925 {
926 /* auto specifier: storage-class-specifier in C++,
927 simple-type-specifier in C++0x. */
929 /* Storage classes. */
935 /* Elaborated type specifiers. */
941 /* Simple type specifiers. */
956 /* GNU extensions. */
959 /* C++0x extensions. */
966 }
967 }
969 /* Returns TRUE iff the token T begins a decltype type. */
971 static bool
973 {
976 }
978 /* Returns TRUE iff the next token begins a decltype type. */
980 static bool
982 {
985 }
987 /* Return a pointer to the Nth token in the token stream. If N is 1,
988 then this is precisely equivalent to cp_lexer_peek_token (except
989 that it is not inline). One would like to disallow that case, but
990 there is one case (cp_parser_nth_token_starts_template_id) where
991 the caller passes a variable for N and it might be 1. */
995 {
998 /* N is 1-based, not zero-based. */
1009 {
1012 {
1015 }
1019 }
1022 {
1025 }
1028 }
1030 /* Return the next token, and advance the lexer's next_token pointer
1031 to point to the next non-purged token. */
1035 {
1041 do
1042 {
1045 {
1048 }
1050 }
1055 /* Provide debugging output. */
1057 {
1061 }
1064 }
1066 /* Permanently remove the next token from the token stream, and
1067 advance the next_token pointer to refer to the next non-purged
1068 token. */
1070 static void
1072 {
1081 do
1082 {
1083 tok++;
1085 {
1088 }
1089 }
1092 }
1094 /* Permanently remove all tokens after TOK, up to, but not
1095 including, the token that will be returned next by
1096 cp_lexer_peek_token. */
1098 static void
1100 {
1109 {
1114 }
1115 }
1117 /* Begin saving tokens. All tokens consumed after this point will be
1118 preserved. */
1120 static void
1122 {
1123 /* Provide debugging output. */
1128 }
1130 /* Commit to the portion of the token stream most recently saved. */
1132 static void
1134 {
1135 /* Provide debugging output. */
1140 }
1142 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1143 to the token stream. Stop saving tokens. */
1145 static void
1147 {
1148 /* Provide debugging output. */
1153 }
1155 /* Print a representation of the TOKEN on the STREAM. */
1157 static void
1159 {
1160 /* We don't use cpp_type2name here because the parser defines
1161 a few tokens of its own. */
1163 /* cpplib-defined token types */
1164 #define OP(e, s) #e,
1165 #define TK(e, s) #e,
1166 TTYPE_TABLE
1167 #undef OP
1168 #undef TK
1169 /* C++ parser token types - see "Manifest constants", above. */
1173 };
1175 /* For some tokens, print the associated data. */
1177 {
1179 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1180 For example, `struct' is mapped to an INTEGER_CST. */
1183 /* else fall through */
1201 /* If we have a name for the token, print it out. Otherwise, we
1202 simply give the numeric code. */
1205 else
1208 }
1209 }
1211 DEBUG_FUNCTION void
1213 {
1216 }
1218 DEBUG_FUNCTION void
1220 {
1223 else
1225 }
1228 /* Start emitting debugging information. */
1230 static void
1232 {
1235 }
1237 /* Stop emitting debugging information. */
1239 static void
1241 {
1244 }
1246 /* Create a new cp_token_cache, representing a range of tokens. */
1250 {
1255 }
1257 /* Diagnose if #pragma omp declare simd isn't followed immediately
1258 by function declaration or definition. */
1262 {
1264 {
1268 }
1269 }
1271 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1272 and put that into "omp declare simd" attribute. */
1276 {
1278 {
1280 {
1283 }
1285 {
1288 }
1289 }
1290 }
1291 \f
1292 /* Decl-specifiers. */
1294 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1296 static void
1298 {
1300 }
1302 /* Declarators. */
1304 /* Nothing other than the parser should be creating declarators;
1305 declarators are a semi-syntactic representation of C++ entities.
1306 Other parts of the front end that need to create entities (like
1307 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1322 /* An erroneous declarator. */
1325 /* The obstack on which declarators and related data structures are
1326 allocated. */
1329 /* Alloc BYTES from the declarator memory pool. */
1333 {
1335 }
1337 /* Allocate a declarator of the indicated KIND. Clear fields that are
1338 common to all declarators. */
1342 {
1354 }
1356 /* Make a declarator for a generalized identifier. If
1357 QUALIFYING_SCOPE is non-NULL, the identifier is
1358 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1359 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1360 is, if any. */
1364 special_function_kind sfk)
1365 {
1368 /* It is valid to write:
1370 class C { void f(); };
1371 typedef C D;
1372 void D::f();
1374 The standard is not clear about whether `typedef const C D' is
1375 legal; as of 2002-09-15 the committee is considering that
1376 question. EDG 3.0 allows that syntax. Therefore, we do as
1377 well. */
1391 }
1393 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1394 of modifiers such as const or volatile to apply to the pointer
1395 type, represented as identifiers. ATTRIBUTES represent the attributes that
1396 appertain to the pointer or reference. */
1398 cp_declarator *
1400 tree attributes)
1401 {
1409 {
1413 }
1414 else
1420 }
1422 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1423 represent the attributes that appertain to the pointer or
1424 reference. */
1426 cp_declarator *
1429 {
1437 {
1441 }
1442 else
1448 }
1450 /* Like make_pointer_declarator -- but for a pointer to a non-static
1451 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1452 appertain to the pointer or reference. */
1454 cp_declarator *
1457 tree attributes)
1458 {
1467 {
1470 }
1471 else
1477 }
1479 /* Make a declarator for the function given by TARGET, with the
1480 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1481 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1482 indicates what exceptions can be thrown. */
1484 cp_declarator *
1486 tree parms,
1487 cp_cv_quals cv_qualifiers,
1488 cp_virt_specifiers virt_specifiers,
1489 cp_ref_qualifier ref_qualifier,
1490 tree exception_specification,
1491 tree late_return_type)
1492 {
1504 {
1508 }
1509 else
1513 }
1515 /* Make a declarator for an array of BOUNDS elements, each of which is
1516 defined by ELEMENT. */
1518 cp_declarator *
1520 {
1527 {
1531 }
1532 else
1536 }
1538 /* Determine whether the declarator we've seen so far can be a
1539 parameter pack, when followed by an ellipsis. */
1540 static bool
1542 {
1543 /* Search for a declarator name, or any other declarator that goes
1544 after the point where the ellipsis could appear in a parameter
1545 pack. If we find any of these, then this declarator can not be
1546 made into a parameter pack. */
1549 {
1551 {
1563 }
1564 }
1567 }
1571 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1572 DECLARATOR and DEFAULT_ARGUMENT. */
1574 cp_parameter_declarator *
1577 tree default_argument)
1578 {
1586 else
1593 }
1595 /* Returns true iff DECLARATOR is a declaration for a function. */
1597 static bool
1599 {
1601 {
1609 }
1611 }
1613 /* The parser. */
1615 /* Overview
1616 --------
1618 A cp_parser parses the token stream as specified by the C++
1619 grammar. Its job is purely parsing, not semantic analysis. For
1620 example, the parser breaks the token stream into declarators,
1621 expressions, statements, and other similar syntactic constructs.
1622 It does not check that the types of the expressions on either side
1623 of an assignment-statement are compatible, or that a function is
1624 not declared with a parameter of type `void'.
1626 The parser invokes routines elsewhere in the compiler to perform
1627 semantic analysis and to build up the abstract syntax tree for the
1628 code processed.
1630 The parser (and the template instantiation code, which is, in a
1631 way, a close relative of parsing) are the only parts of the
1632 compiler that should be calling push_scope and pop_scope, or
1633 related functions. The parser (and template instantiation code)
1634 keeps track of what scope is presently active; everything else
1635 should simply honor that. (The code that generates static
1636 initializers may also need to set the scope, in order to check
1637 access control correctly when emitting the initializers.)
1639 Methodology
1640 -----------
1642 The parser is of the standard recursive-descent variety. Upcoming
1643 tokens in the token stream are examined in order to determine which
1644 production to use when parsing a non-terminal. Some C++ constructs
1645 require arbitrary look ahead to disambiguate. For example, it is
1646 impossible, in the general case, to tell whether a statement is an
1647 expression or declaration without scanning the entire statement.
1648 Therefore, the parser is capable of "parsing tentatively." When the
1649 parser is not sure what construct comes next, it enters this mode.
1650 Then, while we attempt to parse the construct, the parser queues up
1651 error messages, rather than issuing them immediately, and saves the
1652 tokens it consumes. If the construct is parsed successfully, the
1653 parser "commits", i.e., it issues any queued error messages and
1654 the tokens that were being preserved are permanently discarded.
1655 If, however, the construct is not parsed successfully, the parser
1656 rolls back its state completely so that it can resume parsing using
1657 a different alternative.
1659 Future Improvements
1660 -------------------
1662 The performance of the parser could probably be improved substantially.
1663 We could often eliminate the need to parse tentatively by looking ahead
1664 a little bit. In some places, this approach might not entirely eliminate
1665 the need to parse tentatively, but it might still speed up the average
1666 case. */
1668 /* Flags that are passed to some parsing functions. These values can
1669 be bitwise-ored together. */
1671 enum
1672 {
1673 /* No flags. */
1675 /* The construct is optional. If it is not present, then no error
1676 should be issued. */
1678 /* When parsing a type-specifier, treat user-defined type-names
1679 as non-type identifiers. */
1681 /* When parsing a type-specifier, do not try to parse a class-specifier
1682 or enum-specifier. */
1684 /* When parsing a decl-specifier-seq, only allow type-specifier or
1685 constexpr. */
1687 };
1689 /* This type is used for parameters and variables which hold
1690 combinations of the above flags. */
1693 /* The different kinds of declarators we want to parse. */
1696 {
1697 /* We want an abstract declarator. */
1698 CP_PARSER_DECLARATOR_ABSTRACT,
1699 /* We want a named declarator. */
1700 CP_PARSER_DECLARATOR_NAMED,
1701 /* We don't mind, but the name must be an unqualified-id. */
1702 CP_PARSER_DECLARATOR_EITHER
1705 /* The precedence values used to parse binary expressions. The minimum value
1706 of PREC must be 1, because zero is reserved to quickly discriminate
1707 binary operators from other tokens. */
1709 enum cp_parser_prec
1710 {
1711 PREC_NOT_OPERATOR,
1712 PREC_LOGICAL_OR_EXPRESSION,
1713 PREC_LOGICAL_AND_EXPRESSION,
1714 PREC_INCLUSIVE_OR_EXPRESSION,
1715 PREC_EXCLUSIVE_OR_EXPRESSION,
1716 PREC_AND_EXPRESSION,
1717 PREC_EQUALITY_EXPRESSION,
1718 PREC_RELATIONAL_EXPRESSION,
1719 PREC_SHIFT_EXPRESSION,
1720 PREC_ADDITIVE_EXPRESSION,
1721 PREC_MULTIPLICATIVE_EXPRESSION,
1722 PREC_PM_EXPRESSION,
1723 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1724 };
1726 /* A mapping from a token type to a corresponding tree node type, with a
1727 precedence value. */
1730 {
1731 /* The token type. */
1733 /* The corresponding tree code. */
1735 /* The precedence of this operator. */
1740 {
1741 /* Left hand side of the binary operation we are currently
1742 parsing. */
1743 tree lhs;
1744 /* Original tree code for left hand side, if it was a binary
1745 expression itself (used for -Wparentheses). */
1747 /* Tree code for the binary operation we are parsing. */
1749 /* Precedence of the binary operation we are parsing. */
1751 /* Location of the binary operation we are parsing. */
1752 location_t loc;
1755 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1756 entries because precedence levels on the stack are monotonically
1757 increasing. */
1761 /* Prototypes. */
1763 /* Constructors and destructors. */
1768 /* Class variables. */
1772 /* The operator-precedence table used by cp_parser_binary_expression.
1773 Transformed into an associative array (binops_by_token) by
1774 cp_parser_new. */
1807 };
1809 /* The same as binops, but initialized by cp_parser_new so that
1810 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1811 for speed. */
1814 /* Constructors and destructors. */
1816 /* Construct a new context. The context below this one on the stack
1817 is given by NEXT. */
1821 {
1824 /* Allocate the storage. */
1826 {
1827 /* Pull the first entry from the free list. */
1831 }
1832 else
1835 /* No errors have occurred yet in this context. */
1837 /* If this is not the bottommost context, copy information that we
1838 need from the previous context. */
1840 {
1841 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1842 expression, then we are parsing one in this context, too. */
1844 /* Thread the stack. */
1846 }
1849 }
1851 /* Managing the unparsed function queues. */
1853 #define unparsed_funs_with_default_args \
1854 parser->unparsed_queues->last ().funs_with_default_args
1855 #define unparsed_funs_with_definitions \
1856 parser->unparsed_queues->last ().funs_with_definitions
1857 #define unparsed_nsdmis \
1858 parser->unparsed_queues->last ().nsdmis
1859 #define unparsed_classes \
1860 parser->unparsed_queues->last ().classes
1862 static void
1864 {
1867 }
1869 static void
1871 {
1874 }
1876 /* Prototypes. */
1878 /* Constructors and destructors. */
1883 /* Routines to parse various constructs.
1885 Those that return `tree' will return the error_mark_node (rather
1886 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1887 Sometimes, they will return an ordinary node if error-recovery was
1888 attempted, even though a parse error occurred. So, to check
1889 whether or not a parse error occurred, you should always use
1890 cp_parser_error_occurred. If the construct is optional (indicated
1891 either by an `_opt' in the name of the function that does the
1892 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1893 the construct is not present. */
1895 /* Lexical conventions [gram.lex] */
1897 static tree cp_parser_identifier
1899 static tree cp_parser_string_literal
1901 static tree cp_parser_userdef_char_literal
1903 static tree cp_parser_userdef_string_literal
1905 static tree cp_parser_userdef_numeric_literal
1908 /* Basic concepts [gram.basic] */
1910 static bool cp_parser_translation_unit
1913 /* Expressions [gram.expr] */
1915 static tree cp_parser_primary_expression
1917 static tree cp_parser_id_expression
1919 static tree cp_parser_unqualified_id
1921 static tree cp_parser_nested_name_specifier_opt
1923 static tree cp_parser_nested_name_specifier
1925 static tree cp_parser_qualifying_entity
1927 static tree cp_parser_postfix_expression
1929 static tree cp_parser_postfix_open_square_expression
1931 static tree cp_parser_postfix_dot_deref_expression
1935 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1937 static void cp_parser_pseudo_destructor_name
1939 static tree cp_parser_unary_expression
1941 static enum tree_code cp_parser_unary_operator
1943 static tree cp_parser_new_expression
1947 static tree cp_parser_new_type_id
1955 static tree cp_parser_delete_expression
1957 static tree cp_parser_cast_expression
1959 static tree cp_parser_binary_expression
1961 static tree cp_parser_question_colon_clause
1963 static tree cp_parser_assignment_expression
1965 static enum tree_code cp_parser_assignment_operator_opt
1967 static tree cp_parser_expression
1969 static tree cp_parser_constant_expression
1971 static tree cp_parser_builtin_offsetof
1973 static tree cp_parser_lambda_expression
1975 static void cp_parser_lambda_introducer
1977 static bool cp_parser_lambda_declarator_opt
1979 static void cp_parser_lambda_body
1982 /* Statements [gram.stmt.stmt] */
1984 static void cp_parser_statement
1986 static void cp_parser_label_for_labeled_statement
1988 static tree cp_parser_expression_statement
1990 static tree cp_parser_compound_statement
1992 static void cp_parser_statement_seq_opt
1994 static tree cp_parser_selection_statement
1996 static tree cp_parser_condition
1998 static tree cp_parser_iteration_statement
2000 static bool cp_parser_for_init_statement
2002 static tree cp_parser_for
2004 static tree cp_parser_c_for
2006 static tree cp_parser_range_for
2008 static void do_range_for_auto_deduction
2010 static tree cp_parser_perform_range_for_lookup
2012 static tree cp_parser_range_for_member_function
2014 static tree cp_parser_jump_statement
2016 static void cp_parser_declaration_statement
2019 static tree cp_parser_implicitly_scoped_statement
2021 static void cp_parser_already_scoped_statement
2024 /* Declarations [gram.dcl.dcl] */
2026 static void cp_parser_declaration_seq_opt
2028 static void cp_parser_declaration
2030 static void cp_parser_block_declaration
2032 static void cp_parser_simple_declaration
2034 static void cp_parser_decl_specifier_seq
2036 static tree cp_parser_storage_class_specifier_opt
2038 static tree cp_parser_function_specifier_opt
2040 static tree cp_parser_type_specifier
2043 static tree cp_parser_simple_type_specifier
2045 static tree cp_parser_type_name
2047 static tree cp_parser_nonclass_name
2049 static tree cp_parser_elaborated_type_specifier
2051 static tree cp_parser_enum_specifier
2053 static void cp_parser_enumerator_list
2055 static void cp_parser_enumerator_definition
2057 static tree cp_parser_namespace_name
2059 static void cp_parser_namespace_definition
2061 static void cp_parser_namespace_body
2063 static tree cp_parser_qualified_namespace_specifier
2065 static void cp_parser_namespace_alias_definition
2067 static bool cp_parser_using_declaration
2069 static void cp_parser_using_directive
2071 static tree cp_parser_alias_declaration
2073 static void cp_parser_asm_definition
2075 static void cp_parser_linkage_specification
2077 static void cp_parser_static_assert
2079 static tree cp_parser_decltype
2082 /* Declarators [gram.dcl.decl] */
2084 static tree cp_parser_init_declarator
2085 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2090 static enum tree_code cp_parser_ptr_operator
2092 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2094 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2096 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2098 static tree cp_parser_late_return_type_opt
2100 static tree cp_parser_declarator_id
2102 static tree cp_parser_type_id
2104 static tree cp_parser_template_type_arg
2107 static tree cp_parser_type_id_1
2109 static void cp_parser_type_specifier_seq
2111 static tree cp_parser_parameter_declaration_clause
2113 static tree cp_parser_parameter_declaration_list
2117 static tree cp_parser_default_argument
2119 static void cp_parser_function_body
2121 static tree cp_parser_initializer
2123 static tree cp_parser_initializer_clause
2125 static tree cp_parser_braced_list
2130 static bool cp_parser_ctor_initializer_opt_and_function_body
2133 static tree cp_parser_late_parsing_omp_declare_simd
2136 static tree cp_parser_late_parsing_cilk_simd_fn_info
2139 static tree synthesize_implicit_template_parm
2141 static tree finish_fully_implicit_template
2144 /* Classes [gram.class] */
2146 static tree cp_parser_class_name
2148 static tree cp_parser_class_specifier
2150 static tree cp_parser_class_head
2152 static enum tag_types cp_parser_class_key
2154 static void cp_parser_type_parameter_key
2156 static void cp_parser_member_specification_opt
2158 static void cp_parser_member_declaration
2160 static tree cp_parser_pure_specifier
2162 static tree cp_parser_constant_initializer
2165 /* Derived classes [gram.class.derived] */
2167 static tree cp_parser_base_clause
2169 static tree cp_parser_base_specifier
2172 /* Special member functions [gram.special] */
2174 static tree cp_parser_conversion_function_id
2176 static tree cp_parser_conversion_type_id
2180 static bool cp_parser_ctor_initializer_opt
2182 static void cp_parser_mem_initializer_list
2184 static tree cp_parser_mem_initializer
2186 static tree cp_parser_mem_initializer_id
2189 /* Overloading [gram.over] */
2191 static tree cp_parser_operator_function_id
2193 static tree cp_parser_operator
2196 /* Templates [gram.temp] */
2198 static void cp_parser_template_declaration
2200 static tree cp_parser_template_parameter_list
2202 static tree cp_parser_template_parameter
2204 static tree cp_parser_type_parameter
2206 static tree cp_parser_template_id
2208 static tree cp_parser_template_name
2210 static tree cp_parser_template_argument_list
2212 static tree cp_parser_template_argument
2214 static void cp_parser_explicit_instantiation
2216 static void cp_parser_explicit_specialization
2219 /* Exception handling [gram.exception] */
2221 static tree cp_parser_try_block
2223 static bool cp_parser_function_try_block
2225 static void cp_parser_handler_seq
2227 static void cp_parser_handler
2229 static tree cp_parser_exception_declaration
2231 static tree cp_parser_throw_expression
2233 static tree cp_parser_exception_specification_opt
2235 static tree cp_parser_type_id_list
2238 /* GNU Extensions */
2240 static tree cp_parser_asm_specification_opt
2242 static tree cp_parser_asm_operand_list
2244 static tree cp_parser_asm_clobber_list
2246 static tree cp_parser_asm_label_list
2248 static bool cp_next_tokens_can_be_attribute_p
2250 static bool cp_next_tokens_can_be_gnu_attribute_p
2252 static bool cp_next_tokens_can_be_std_attribute_p
2254 static bool cp_nth_tokens_can_be_std_attribute_p
2256 static bool cp_nth_tokens_can_be_gnu_attribute_p
2258 static bool cp_nth_tokens_can_be_attribute_p
2260 static tree cp_parser_attributes_opt
2262 static tree cp_parser_gnu_attributes_opt
2264 static tree cp_parser_gnu_attribute_list
2266 static tree cp_parser_std_attribute
2268 static tree cp_parser_std_attribute_spec
2270 static tree cp_parser_std_attribute_spec_seq
2272 static bool cp_parser_extension_opt
2274 static void cp_parser_label_declaration
2277 /* Transactional Memory Extensions */
2279 static tree cp_parser_transaction
2281 static tree cp_parser_transaction_expression
2283 static bool cp_parser_function_transaction
2285 static tree cp_parser_transaction_cancel
2289 pragma_external,
2290 pragma_member,
2291 pragma_objc_icode,
2292 pragma_stmt,
2293 pragma_compound
2294 };
2295 static bool cp_parser_pragma
2298 /* Objective-C++ Productions */
2300 static tree cp_parser_objc_message_receiver
2302 static tree cp_parser_objc_message_args
2304 static tree cp_parser_objc_message_expression
2306 static tree cp_parser_objc_encode_expression
2308 static tree cp_parser_objc_defs_expression
2310 static tree cp_parser_objc_protocol_expression
2312 static tree cp_parser_objc_selector_expression
2314 static tree cp_parser_objc_expression
2316 static bool cp_parser_objc_selector_p
2318 static tree cp_parser_objc_selector
2320 static tree cp_parser_objc_protocol_refs_opt
2322 static void cp_parser_objc_declaration
2324 static tree cp_parser_objc_statement
2326 static bool cp_parser_objc_valid_prefix_attributes
2328 static void cp_parser_objc_at_property_declaration
2330 static void cp_parser_objc_at_synthesize_declaration
2332 static void cp_parser_objc_at_dynamic_declaration
2334 static tree cp_parser_objc_struct_declaration
2337 /* Utility Routines */
2339 static tree cp_parser_lookup_name
2341 static tree cp_parser_lookup_name_simple
2343 static tree cp_parser_maybe_treat_template_as_class
2345 static bool cp_parser_check_declarator_template_parameters
2347 static bool cp_parser_check_template_parameters
2349 static tree cp_parser_simple_cast_expression
2351 static tree cp_parser_global_scope_opt
2353 static bool cp_parser_constructor_declarator_p
2355 static tree cp_parser_function_definition_from_specifiers_and_declarator
2357 static tree cp_parser_function_definition_after_declarator
2359 static void cp_parser_template_declaration_after_export
2361 static void cp_parser_perform_template_parameter_access_checks
2363 static tree cp_parser_single_declaration
2365 static tree cp_parser_functional_cast
2367 static tree cp_parser_save_member_function_body
2369 static tree cp_parser_save_nsdmi
2371 static tree cp_parser_enclosed_template_argument_list
2373 static void cp_parser_save_default_args
2375 static void cp_parser_late_parsing_for_member
2377 static tree cp_parser_late_parse_one_default_arg
2379 static void cp_parser_late_parsing_nsdmi
2381 static void cp_parser_late_parsing_default_args
2383 static tree cp_parser_sizeof_operand
2385 static tree cp_parser_trait_expr
2387 static bool cp_parser_declares_only_class_p
2389 static void cp_parser_set_storage_class
2391 static void cp_parser_set_decl_spec_type
2393 static void set_and_check_decl_spec_loc
2396 static bool cp_parser_friend_p
2398 static void cp_parser_required_error
2404 static bool cp_parser_token_starts_function_definition_p
2406 static bool cp_parser_next_token_starts_class_definition_p
2408 static bool cp_parser_next_token_ends_template_argument_p
2410 static bool cp_parser_nth_token_starts_template_argument_list_p
2412 static enum tag_types cp_parser_token_is_class_key
2414 static enum tag_types cp_parser_token_is_type_parameter_key
2416 static void cp_parser_check_class_key
2418 static void cp_parser_check_access_in_redeclaration
2420 static bool cp_parser_optional_template_keyword
2422 static void cp_parser_pre_parsed_nested_name_specifier
2424 static bool cp_parser_cache_group
2426 static tree cp_parser_cache_defarg
2428 static void cp_parser_parse_tentatively
2430 static void cp_parser_commit_to_tentative_parse
2432 static void cp_parser_commit_to_topmost_tentative_parse
2434 static void cp_parser_abort_tentative_parse
2436 static bool cp_parser_parse_definitely
2440 static bool cp_parser_uncommitted_to_tentative_parse_p
2442 static void cp_parser_error
2444 static void cp_parser_name_lookup_error
2446 static bool cp_parser_simulate_error
2448 static bool cp_parser_check_type_definition
2450 static void cp_parser_check_for_definition_in_return_type
2452 static void cp_parser_check_for_invalid_template_id
2454 static bool cp_parser_non_integral_constant_expression
2456 static void cp_parser_diagnose_invalid_type_name
2458 static bool cp_parser_parse_and_diagnose_invalid_type_name
2460 static int cp_parser_skip_to_closing_parenthesis
2462 static void cp_parser_skip_to_end_of_statement
2464 static void cp_parser_consume_semicolon_at_end_of_statement
2466 static void cp_parser_skip_to_end_of_block_or_statement
2468 static bool cp_parser_skip_to_closing_brace
2470 static void cp_parser_skip_to_end_of_template_parameter_list
2472 static void cp_parser_skip_to_pragma_eol
2474 static bool cp_parser_error_occurred
2476 static bool cp_parser_allow_gnu_extensions_p
2478 static bool cp_parser_is_pure_string_literal
2480 static bool cp_parser_is_string_literal
2482 static bool cp_parser_is_keyword
2484 static tree cp_parser_make_typename_type
2488 static bool cp_parser_compound_literal_p
2490 static bool cp_parser_array_designator_p
2492 static bool cp_parser_skip_to_closing_square_bracket
2495 /* Returns nonzero if we are parsing tentatively. */
2499 {
2501 }
2503 /* Returns nonzero if TOKEN is a string literal. */
2505 static bool
2507 {
2513 }
2515 /* Returns nonzero if TOKEN is a string literal
2516 of a user-defined string literal. */
2518 static bool
2520 {
2527 }
2529 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2531 static bool
2533 {
2535 }
2537 /* If not parsing tentatively, issue a diagnostic of the form
2538 FILE:LINE: MESSAGE before TOKEN
2539 where TOKEN is the next token in the input stream. MESSAGE
2540 (specified by the caller) is usually of the form "expected
2541 OTHER-TOKEN". */
2543 static void
2545 {
2547 {
2549 /* This diagnostic makes more sense if it is tagged to the line
2550 of the token we just peeked at. */
2554 {
2559 }
2562 /* Because c_parser_error does not understand
2563 CPP_KEYWORD, keywords are treated like
2564 identifiers. */
2567 }
2568 }
2570 /* Issue an error about name-lookup failing. NAME is the
2571 IDENTIFIER_NODE DECL is the result of
2572 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2573 the thing that we hoped to find. */
2575 static void
2577 tree name,
2578 tree decl,
2579 name_lookup_error desired,
2580 location_t location)
2581 {
2582 /* If name lookup completely failed, tell the user that NAME was not
2583 declared. */
2585 {
2598 else
2600 }
2602 {
2604 {
2621 }
2622 }
2624 {
2626 {
2636 name);
2640 }
2641 }
2642 else
2643 {
2645 {
2658 }
2659 }
2660 }
2662 /* If we are parsing tentatively, remember that an error has occurred
2663 during this tentative parse. Returns true if the error was
2664 simulated; false if a message should be issued by the caller. */
2666 static bool
2668 {
2670 {
2673 }
2675 }
2677 /* This function is called when a type is defined. If type
2678 definitions are forbidden at this point, an error message is
2679 issued. */
2681 static bool
2683 {
2684 /* If types are forbidden here, issue a message. */
2686 {
2687 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2688 in the message need to be interpreted. */
2691 }
2693 }
2695 /* This function is called when the DECLARATOR is processed. The TYPE
2696 was a type defined in the decl-specifiers. If it is invalid to
2697 define a type in the decl-specifiers for DECLARATOR, an error is
2698 issued. TYPE_LOCATION is the location of TYPE and is used
2699 for error reporting. */
2701 static void
2704 {
2705 /* [dcl.fct] forbids type definitions in return types.
2706 Unfortunately, it's not easy to know whether or not we are
2707 processing a return type until after the fact. */
2715 {
2720 type);
2721 }
2722 }
2724 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2725 "<" in any valid C++ program. If the next token is indeed "<",
2726 issue a message warning the user about what appears to be an
2727 invalid attempt to form a template-id. LOCATION is the location
2728 of the type-specifier (TYPE) */
2730 static void
2732 tree type,
2734 location_t location)
2735 {
2739 {
2743 {
2746 else
2748 }
2749 else
2751 /* Remember the location of the invalid "<". */
2754 /* Consume the "<". */
2756 /* Parse the template arguments. */
2758 /* Permanently remove the invalid template arguments so that
2759 this error message is not issued again. */
2762 }
2763 }
2765 /* If parsing an integral constant-expression, issue an error message
2766 about the fact that THING appeared and return true. Otherwise,
2767 return false. In either case, set
2768 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2770 static bool
2772 non_integral_constant thing)
2773 {
2776 {
2778 {
2781 {
2788 "enumeration type cannot appear in a "
2879 }
2883 }
2884 }
2886 }
2888 /* Emit a diagnostic for an invalid type name. This function commits
2889 to the current active tentative parse, if any. (Otherwise, the
2890 problematic construct might be encountered again later, resulting
2891 in duplicate error messages.) LOCATION is the location of ID. */
2893 static void
2895 location_t location)
2896 {
2899 /* Try to lookup the identifier. */
2906 /* If the lookup was ambiguous, an error will already have
2907 been issued. */
2909 /* If the lookup found a template-name, it means that the user forgot
2910 to specify an argument list. Emit a useful error message. */
2914 decl);
2918 /* Something like 'unsigned A a;' */
2921 {
2922 /* Issue an error message. */
2924 /* If we're in a template class, it's possible that the user was
2925 referring to a type from a base class. For example:
2927 template <typename T> struct A { typedef T X; };
2928 template <typename T> struct B : public A<T> { X x; };
2930 The user should have said "typename A<T>::X". */
2943 {
2944 tree b;
2947 b;
2949 {
2953 {
2954 tree field;
2955 /* Go from a particular instantiation of the
2956 template (which will have an empty TYPE_FIELDs),
2957 to the main version. */
2960 field;
2964 {
2969 }
2972 }
2973 }
2974 }
2975 }
2976 /* Here we diagnose qualified-ids where the scope is actually correct,
2977 but the identifier does not resolve to a valid type name. */
2979 {
2981 {
2986 else
2990 }
2993 {
2994 /* A<T>::A<T>() */
3000 }
3007 {
3012 else
3016 }
3017 else
3019 }
3020 }
3022 /* Check for a common situation where a type-name should be present,
3023 but is not, and issue a sensible error message. Returns true if an
3024 invalid type-name was detected.
3026 The situation handled by this function are variable declarations of the
3027 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3028 Usually, `ID' should name a type, but if we got here it means that it
3029 does not. We try to emit the best possible error message depending on
3030 how exactly the id-expression looks like. */
3032 static bool
3034 {
3035 tree id;
3038 /* Avoid duplicate error about ambiguous lookup. */
3040 {
3044 }
3053 /* If the next token is a (, this is a function with no explicit return
3054 type, i.e. constructor, destructor or conversion op. */
3057 {
3060 }
3064 /* Emit a diagnostic for the invalid type. */
3066 out:
3067 /* If we aren't in the middle of a declarator (i.e. in a
3068 parameter-declaration-clause), skip to the end of the declaration;
3069 there's no point in trying to process it. */
3073 }
3075 /* Consume tokens up to, and including, the next non-nested closing `)'.
3076 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3077 are doing error recovery. Returns -1 if OR_COMMA is true and we
3078 found an unnested comma. */
3080 static int
3085 {
3095 {
3099 {
3102 /* If we've run out of tokens, then there is no closing `)'. */
3105 /* This is good for lambda expression capture-lists. */
3115 /* This matches the processing in skip_to_end_of_statement. */
3141 {
3145 }
3150 }
3152 /* Consume the token. */
3154 }
3155 }
3157 /* Consume tokens until we reach the end of the current statement.
3158 Normally, that will be just before consuming a `;'. However, if a
3159 non-nested `}' comes first, then we stop before consuming that. */
3161 static void
3163 {
3166 /* Unwind generic function template scope if necessary. */
3171 {
3175 {
3178 /* If we've run out of tokens, stop. */
3182 /* If the next token is a `;', we have reached the end of the
3183 statement. */
3189 /* If this is a non-nested '}', stop before consuming it.
3190 That way, when confronted with something like:
3192 { 3 + }
3194 we stop before consuming the closing '}', even though we
3195 have not yet reached a `;'. */
3199 /* If it is the closing '}' for a block that we have
3200 scanned, stop -- but only after consuming the token.
3201 That way given:
3203 void f g () { ... }
3204 typedef int I;
3206 we will stop after the body of the erroneously declared
3207 function, but before consuming the following `typedef'
3208 declaration. */
3210 {
3213 }
3221 }
3223 /* Consume the token. */
3225 }
3226 }
3228 /* This function is called at the end of a statement or declaration.
3229 If the next token is a semicolon, it is consumed; otherwise, error
3230 recovery is attempted. */
3232 static void
3234 {
3235 /* Look for the trailing `;'. */
3237 {
3238 /* If there is additional (erroneous) input, skip to the end of
3239 the statement. */
3241 /* If the next token is now a `;', consume it. */
3244 }
3245 }
3247 /* Skip tokens until we have consumed an entire block, or until we
3248 have consumed a non-nested `;'. */
3250 static void
3252 {
3255 /* Unwind generic function template scope if necessary. */
3260 {
3264 {
3267 /* If we've run out of tokens, stop. */
3271 /* Stop if this is an unnested ';'. */
3277 /* Stop if this is an unnested '}', or closes the outermost
3278 nesting level. */
3279 nesting_depth--;
3287 /* Nest. */
3288 nesting_depth++;
3293 }
3295 /* Consume the token. */
3297 }
3298 }
3300 /* Skip tokens until a non-nested closing curly brace is the next
3301 token, or there are no more tokens. Return true in the first case,
3302 false otherwise. */
3304 static bool
3306 {
3310 {
3314 {
3317 /* If we've run out of tokens, stop. */
3321 /* If the next token is a non-nested `}', then we have reached
3322 the end of the current block. */
3328 /* If it the next token is a `{', then we are entering a new
3329 block. Consume the entire block. */
3335 }
3337 /* Consume the token. */
3339 }
3340 }
3342 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3343 parameter is the PRAGMA token, allowing us to purge the entire pragma
3344 sequence. */
3346 static void
3348 {
3353 do
3357 /* Ensure that the pragma is not parsed again. */
3359 }
3361 /* Require pragma end of line, resyncing with it as necessary. The
3362 arguments are as for cp_parser_skip_to_pragma_eol. */
3364 static void
3366 {
3370 }
3372 /* This is a simple wrapper around make_typename_type. When the id is
3373 an unresolved identifier node, we can provide a superior diagnostic
3374 using cp_parser_diagnose_invalid_type_name. */
3376 static tree
3378 location_t id_location)
3379 {
3380 tree result;
3382 {
3388 }
3390 }
3392 /* This is a wrapper around the
3393 make_{pointer,ptrmem,reference}_declarator functions that decides
3394 which one to call based on the CODE and CLASS_TYPE arguments. The
3395 CODE argument should be one of the values returned by
3396 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3397 appertain to the pointer or reference. */
3401 cp_cv_quals cv_qualifiers,
3403 tree attributes)
3404 {
3411 else
3421 }
3423 /* Create a new C++ parser. */
3427 {
3432 /* cp_lexer_new_main is called before doing GC allocation because
3433 cp_lexer_new_main might load a PCH file. */
3436 /* Initialize the binops_by_token so that we can get the tree
3437 directly from the token. */
3445 /* For now, we always accept GNU extensions. */
3448 /* The `>' token is a greater-than operator, not the end of a
3449 template-id. */
3454 /* We are not parsing a constant-expression. */
3459 /* Local variable names are not forbidden. */
3462 /* We are not processing an `extern "C"' declaration. */
3465 /* We are not processing a declarator. */
3468 /* We are not processing a template-argument-list. */
3471 /* We are not in an iteration statement. */
3474 /* We are not in a switch statement. */
3477 /* We are not parsing a type-id inside an expression. */
3480 /* Declarations aren't implicitly extern "C". */
3483 /* String literals should be translated to the execution character set. */
3486 /* We are not parsing a function body. */
3489 /* We can correct until told otherwise. */
3492 /* The unparsed function queue is empty. */
3495 /* There are no classes being defined. */
3498 /* No template parameters apply. */
3501 /* Not declaring an implicit function template. */
3508 }
3510 /* Create a cp_lexer structure which will emit the tokens in CACHE
3511 and push it onto the parser's lexer stack. This is used for delayed
3512 parsing of in-class method bodies and default arguments, and should
3513 not be confused with tentative parsing. */
3514 static void
3516 {
3521 /* Move the current source position to that of the first token in the
3522 new lexer. */
3524 }
3526 /* Pop the top lexer off the parser stack. This is never used for the
3527 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3528 static void
3530 {
3535 /* Put the current source position back where it was before this
3536 lexer was pushed. */
3538 }
3540 /* Lexical conventions [gram.lex] */
3542 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3543 identifier. */
3545 static tree
3547 {
3550 /* Look for the identifier. */
3552 /* Return the value. */
3554 }
3556 /* Parse a sequence of adjacent string constants. Returns a
3557 TREE_STRING representing the combined, nul-terminated string
3558 constant. If TRANSLATE is true, translate the string to the
3559 execution character set. If WIDE_OK is true, a wide string is
3560 invalid here.
3562 C++98 [lex.string] says that if a narrow string literal token is
3563 adjacent to a wide string literal token, the behavior is undefined.
3564 However, C99 6.4.5p4 says that this results in a wide string literal.
3565 We follow C99 here, for consistency with the C front end.
3567 This code is largely lifted from lex_string() in c-lex.c.
3569 FUTURE: ObjC++ will need to handle @-strings here. */
3570 static tree
3573 {
3574 tree value;
3581 tree string_tree;
3587 {
3590 }
3593 {
3597 }
3598 else
3599 {
3602 }
3605 /* Try to avoid the overhead of creating and destroying an obstack
3606 for the common case of just one string. */
3609 {
3617 {
3621 }
3622 else
3626 }
3627 else
3628 {
3632 do
3633 {
3635 count++;
3640 {
3643 {
3646 }
3649 {
3654 }
3656 }
3657 else
3661 {
3666 "unsupported non-standard concatenation "
3668 }
3674 {
3678 }
3679 else
3680 {
3684 }
3685 }
3689 }
3692 {
3695 }
3699 {
3704 {
3719 }
3724 {
3729 else
3731 }
3732 }
3733 else
3734 /* cpp_interpret_string has issued an error. */
3741 }
3743 /* Look up a literal operator with the name and the exact arguments. */
3745 static tree
3747 {
3754 {
3760 {
3763 {
3773 }
3776 /* May be this should be sufficient_parms_p instead,
3777 depending on how exactly should user-defined literals
3778 work in presence of default arguments on the literal
3779 operator parameters. */
3782 }
3783 }
3786 }
3788 /* Parse a user-defined char constant. Returns a call to a user-defined
3789 literal operator taking the character as an argument. */
3791 static tree
3793 {
3801 /* Build up a call to the user-defined operator */
3802 /* Lookup the name we got back from the id-expression. */
3807 {
3812 }
3821 }
3823 /* A subroutine of cp_parser_userdef_numeric_literal to
3824 create a char... template parameter pack from a string node. */
3826 static tree
3828 {
3829 tree charvec;
3835 /* Fill in CHARVEC with all of the parameters. */
3840 /* Build the argument packs. */
3847 }
3849 /* A subroutine of cp_parser_userdef_numeric_literal to
3850 create a char... template parameter pack from a string node. */
3852 static tree
3854 {
3855 tree charvec;
3866 /* First template parm is character type. */
3869 /* Fill in CHARVEC with all of the parameters. */
3876 /* Build the argument packs. */
3883 }
3885 /* Parse a user-defined numeric constant. returns a call to a user-defined
3886 literal operator. */
3888 static tree
3890 {
3901 /* Look for a literal operator taking the exact type of numeric argument
3902 as the literal value. */
3907 {
3910 {
3914 long_long_unsigned_type_node);
3915 else
3916 {
3920 long_double_type_node);
3924 }
3927 }
3928 }
3931 /* If the numeric argument didn't work, look for a raw literal
3932 operator taking a const char* argument consisting of the number
3933 in string format. */
3938 {
3941 {
3944 }
3945 }
3948 /* If the raw literal didn't work, look for a non-type template
3949 function with parameter pack char.... Call the function with
3950 template parameter characters representing the number. */
3954 {
3959 {
3962 }
3963 }
3971 }
3973 /* Parse a user-defined string constant. Returns a call to a user-defined
3974 literal operator taking a character pointer and the length of the string
3975 as arguments. */
3977 static tree
3979 {
3988 /* Look for a template function with typename parameter CharT
3989 and parameter pack CharT... Call the function with
3990 template parameter characters representing the string. */
3994 {
3999 {
4002 }
4003 }
4006 /* Build up a call to the user-defined operator */
4007 /* Lookup the name we got back from the id-expression. */
4013 {
4017 }
4026 }
4029 /* Basic concepts [gram.basic] */
4031 /* Parse a translation-unit.
4033 translation-unit:
4034 declaration-seq [opt]
4036 Returns TRUE if all went well. */
4038 static bool
4040 {
4041 /* The address of the first non-permanent object on the declarator
4042 obstack. */
4047 /* Create the declarator obstack, if necessary. */
4049 {
4051 /* Create the error declarator. */
4053 /* Create the empty parameter list. */
4055 /* Remember where the base of the declarator obstack lies. */
4057 }
4061 /* If there are no tokens left then all went well. */
4063 {
4064 /* Get rid of the token array; we don't need it any more. */
4068 /* This file might have been a context that's implicitly extern
4069 "C". If so, pop the lang context. (Only relevant for PCH.) */
4071 {
4074 }
4076 /* Finish up. */
4080 }
4081 else
4082 {
4085 }
4087 /* Make sure the declarator obstack was fully cleaned up. */
4091 /* All went well. */
4093 }
4095 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4096 decltype context. */
4100 {
4105 }
4107 /* Expressions [gram.expr] */
4109 /* Parse a primary-expression.
4111 primary-expression:
4112 literal
4113 this
4114 ( expression )
4115 id-expression
4116 lambda-expression (C++11)
4118 GNU Extensions:
4120 primary-expression:
4121 ( compound-statement )
4122 __builtin_va_arg ( assignment-expression , type-id )
4123 __builtin_offsetof ( type-id , offsetof-expression )
4125 C++ Extensions:
4126 __has_nothrow_assign ( type-id )
4127 __has_nothrow_constructor ( type-id )
4128 __has_nothrow_copy ( type-id )
4129 __has_trivial_assign ( type-id )
4130 __has_trivial_constructor ( type-id )
4131 __has_trivial_copy ( type-id )
4132 __has_trivial_destructor ( type-id )
4133 __has_virtual_destructor ( type-id )
4134 __is_abstract ( type-id )
4135 __is_base_of ( type-id , type-id )
4136 __is_class ( type-id )
4137 __is_convertible_to ( type-id , type-id )
4138 __is_empty ( type-id )
4139 __is_enum ( type-id )
4140 __is_final ( type-id )
4141 __is_literal_type ( type-id )
4142 __is_pod ( type-id )
4143 __is_polymorphic ( type-id )
4144 __is_std_layout ( type-id )
4145 __is_trivial ( type-id )
4146 __is_union ( type-id )
4148 Objective-C++ Extension:
4150 primary-expression:
4151 objc-expression
4153 literal:
4154 __null
4156 ADDRESS_P is true iff this expression was immediately preceded by
4157 "&" and therefore might denote a pointer-to-member. CAST_P is true
4158 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4159 true iff this expression is a template argument.
4161 Returns a representation of the expression. Upon return, *IDK
4162 indicates what kind of id-expression (if any) was present. */
4164 static tree
4171 {
4174 /* Assume the primary expression is not an id-expression. */
4177 /* Peek at the next token. */
4180 {
4181 /* literal:
4182 integer-literal
4183 character-literal
4184 floating-literal
4185 string-literal
4186 boolean-literal
4187 pointer-literal
4188 user-defined-literal */
4198 {
4202 }
4203 /* Floating-point literals are only allowed in an integral
4204 constant expression if they are cast to an integral or
4205 enumeration type. */
4209 {
4210 /* CAST_P will be set even in invalid code like "int(2.7 +
4211 ...)". Therefore, we have to check that the next token
4212 is sure to end the cast. */
4214 {
4219 enumerator-definition. */
4221 /* The curly brace at the end of an enum-specifier. */
4223 /* The end of a statement. */
4225 /* The end of the cast-expression. */
4227 /* The end of an array bound. */
4229 /* The closing ">" in a template-argument-list. */
4232 /* C++0x only: A ">>" treated like two ">" tokens,
4233 in a template-argument-list. */
4238 }
4240 /* If we are within a cast, then the constraint that the
4241 cast is to an integral or enumeration type will be
4242 checked at that point. If we are not within a cast, then
4243 this code is invalid. */
4246 }
4265 /* ??? Should wide strings be allowed when parser->translate_strings_p
4266 is false (i.e. in attributes)? If not, we can kill the third
4267 argument to cp_parser_string_literal. */
4273 {
4274 tree expr;
4277 /* Consume the `('. */
4279 /* Within a parenthesized expression, a `>' token is always
4280 the greater-than operator. */
4281 saved_greater_than_is_operator_p
4284 /* If we see `( { ' then we are looking at the beginning of
4285 a GNU statement-expression. */
4288 {
4289 /* Statement-expressions are not allowed by the standard. */
4293 /* And they're not allowed outside of a function-body; you
4294 cannot, for example, write:
4296 int i = ({ int j = 3; j + 1; });
4298 at class or namespace scope. */
4301 {
4303 "statement-expressions are not allowed outside "
4307 }
4308 else
4309 {
4310 /* Start the statement-expression. */
4312 /* Parse the compound-statement. */
4314 /* Finish up. */
4316 }
4317 }
4318 else
4319 {
4320 /* Parse the parenthesized expression. */
4322 /* Let the front end know that this expression was
4323 enclosed in parentheses. This matters in case, for
4324 example, the expression is of the form `A::B', since
4325 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4326 not. */
4328 /* DR 705: Wrapping an unqualified name in parentheses
4329 suppresses arg-dependent lookup. We want to pass back
4330 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4331 (c++/37862), but none of the others. */
4334 }
4335 /* The `>' token might be the end of a template-id or
4336 template-parameter-list now. */
4337 parser->greater_than_is_operator_p
4339 /* Consume the `)'. */
4344 }
4348 /* We have an Objective-C++ message. */
4350 {
4352 /* Don't warn about a failed tentative parse. */
4357 }
4361 /* We have an Objective-C++ string literal. */
4368 {
4369 /* These two are the boolean literals. */
4377 /* The `__null' literal. */
4382 /* The `nullptr' literal. */
4387 /* Recognize the `this' keyword. */
4391 {
4395 }
4396 /* Pointers cannot appear in constant-expressions. */
4401 /* The `operator' keyword can be the beginning of an
4402 id-expression. */
4409 {
4410 non_integral_constant name;
4412 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4413 __func__ are the names of variables -- but they are
4414 treated specially. Therefore, they are handled here,
4415 rather than relying on the generic id-expression logic
4416 below. Grammatically, these names are id-expressions.
4418 Consume the token. */
4422 {
4434 }
4439 /* Look up the name. */
4441 }
4444 {
4445 tree expression;
4446 tree type;
4447 source_location type_location;
4449 /* The `__builtin_va_arg' construct is used to handle
4450 `va_arg'. Consume the `__builtin_va_arg' token. */
4452 /* Look for the opening `('. */
4454 /* Now, parse the assignment-expression. */
4457 /* Look for the `,'. */
4460 /* Parse the type-id. */
4462 /* Look for the closing `)'. */
4464 /* Using `va_arg' in a constant-expression is not
4465 allowed. */
4467 NIC_VA_ARG))
4470 }
4498 /* Objective-C++ expressions. */
4508 {
4513 }
4517 }
4519 /* An id-expression can start with either an identifier, a
4520 `::' as the beginning of a qualified-id, or the "operator"
4521 keyword. */
4526 {
4527 tree id_expression;
4528 tree decl;
4534 id_expression:
4535 /* Parse the id-expression. */
4536 id_expression
4553 /* If we have a template-id, then no further lookup is
4554 required. If the template-id was for a template-class, we
4555 will sometimes have a TYPE_DECL at this point. */
4559 /* Look up the name. */
4560 else
4561 {
4562 tree ambiguous_decls;
4564 /* If we already know that this lookup is ambiguous, then
4565 we've already issued an error message; there's no reason
4566 to check again. */
4569 {
4572 }
4575 none_type,
4576 template_p,
4581 /* If the lookup was ambiguous, an error will already have
4582 been issued. */
4586 /* In Objective-C++, we may have an Objective-C 2.0
4587 dot-syntax for classes here. */
4592 {
4593 tree component;
4600 }
4602 /* In Objective-C++, an instance variable (ivar) may be preferred
4603 to whatever cp_parser_lookup_name() found. */
4606 /* If name lookup gives us a SCOPE_REF, then the
4607 qualifying scope was dependent. */
4609 {
4610 /* At this point, we do not know if DECL is a valid
4611 integral constant expression. We assume that it is
4612 in fact such an expression, so that code like:
4614 template <int N> struct A {
4615 int a[B<N>::i];
4616 };
4618 is accepted. At template-instantiation time, we
4619 will check that B<N>::i is actually a constant. */
4621 }
4622 /* Check to see if DECL is a local variable in a context
4623 where that is forbidden. */
4626 {
4627 /* It might be that we only found DECL because we are
4628 trying to be generous with pre-ISO scoping rules.
4629 For example, consider:
4631 int i;
4632 void g() {
4633 for (int i = 0; i < 10; ++i) {}
4634 extern void f(int j = i);
4635 }
4637 Here, name look up will originally find the out
4638 of scope `i'. We need to issue a warning message,
4639 but then use the global `i'. */
4642 {
4645 decl);
4647 }
4648 }
4649 }
4651 decl = (finish_id_expression
4653 idk,
4658 template_arg_p,
4664 }
4666 /* Anything else is an error. */
4670 }
4671 }
4679 {
4682 }
4684 /* Parse an id-expression.
4686 id-expression:
4687 unqualified-id
4688 qualified-id
4690 qualified-id:
4691 :: [opt] nested-name-specifier template [opt] unqualified-id
4692 :: identifier
4693 :: operator-function-id
4694 :: template-id
4696 Return a representation of the unqualified portion of the
4697 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4698 a `::' or nested-name-specifier.
4700 Often, if the id-expression was a qualified-id, the caller will
4701 want to make a SCOPE_REF to represent the qualified-id. This
4702 function does not do this in order to avoid wastefully creating
4703 SCOPE_REFs when they are not required.
4705 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4706 `template' keyword.
4708 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4709 uninstantiated templates.
4711 If *TEMPLATE_P is non-NULL, it is set to true iff the
4712 `template' keyword is used to explicitly indicate that the entity
4713 named is a template.
4715 If DECLARATOR_P is true, the id-expression is appearing as part of
4716 a declarator, rather than as part of an expression. */
4718 static tree
4725 {
4729 /* Assume the `template' keyword was not used. */
4733 /* Look for the optional `::' operator. */
4734 global_scope_p
4737 /* Look for the optional nested-name-specifier. */
4738 nested_name_specifier_p
4741 check_dependency_p,
4743 declarator_p)
4745 /* If there is a nested-name-specifier, then we are looking at
4746 the first qualified-id production. */
4748 {
4749 tree saved_scope;
4750 tree saved_object_scope;
4751 tree saved_qualifying_scope;
4752 tree unqualified_id;
4755 /* See if the next token is the `template' keyword. */
4759 /* Name lookup we do during the processing of the
4760 unqualified-id might obliterate SCOPE. */
4764 /* Process the final unqualified-id. */
4766 check_dependency_p,
4767 declarator_p,
4769 /* Restore the SAVED_SCOPE for our caller. */
4775 }
4776 /* Otherwise, if we are in global scope, then we are looking at one
4777 of the other qualified-id productions. */
4779 {
4781 tree id;
4783 /* Peek at the next token. */
4786 /* If it's an identifier, and the next token is not a "<", then
4787 we can avoid the template-id case. This is an optimization
4788 for this common case. */
4790 && !cp_parser_nth_token_starts_template_argument_list_p
4795 /* Try a template-id. */
4799 none_type,
4800 declarator_p);
4801 /* If that worked, we're done. */
4805 /* Peek at the next token. (Changes in the token buffer may
4806 have invalidated the pointer obtained above.) */
4810 {
4817 /* Fall through. */
4822 }
4823 }
4824 else
4827 declarator_p,
4828 optional_p);
4829 }
4831 /* Parse an unqualified-id.
4833 unqualified-id:
4834 identifier
4835 operator-function-id
4836 conversion-function-id
4837 ~ class-name
4838 template-id
4840 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4841 keyword, in a construct like `A::template ...'.
4843 Returns a representation of unqualified-id. For the `identifier'
4844 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4845 production a BIT_NOT_EXPR is returned; the operand of the
4846 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4847 other productions, see the documentation accompanying the
4848 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4849 names are looked up in uninstantiated templates. If DECLARATOR_P
4850 is true, the unqualified-id is appearing as part of a declarator,
4851 rather than as part of an expression. */
4853 static tree
4859 {
4862 /* Peek at the next token. */
4866 {
4868 {
4869 tree id;
4871 /* We don't know yet whether or not this will be a
4872 template-id. */
4874 /* Try a template-id. */
4876 check_dependency_p,
4877 none_type,
4878 declarator_p);
4879 /* If it worked, we're done. */
4882 /* Otherwise, it's an ordinary identifier. */
4884 }
4888 check_dependency_p,
4889 none_type,
4890 declarator_p);
4893 {
4894 tree type_decl;
4895 tree qualifying_scope;
4896 tree object_scope;
4897 tree scope;
4900 /* Consume the `~' token. */
4902 /* Parse the class-name. The standard, as written, seems to
4903 say that:
4905 template <typename T> struct S { ~S (); };
4906 template <typename T> S<T>::~S() {}
4908 is invalid, since `~' must be followed by a class-name, but
4909 `S<T>' is dependent, and so not known to be a class.
4910 That's not right; we need to look in uninstantiated
4911 templates. A further complication arises from:
4913 template <typename T> void f(T t) {
4914 t.T::~T();
4915 }
4917 Here, it is not possible to look up `T' in the scope of `T'
4918 itself. We must look in both the current scope, and the
4919 scope of the containing complete expression.
4921 Yet another issue is:
4923 struct S {
4924 int S;
4925 ~S();
4926 };
4928 S::~S() {}
4930 The standard does not seem to say that the `S' in `~S'
4931 should refer to the type `S' and not the data member
4932 `S::S'. */
4934 /* DR 244 says that we look up the name after the "~" in the
4935 same scope as we looked up the qualifying name. That idea
4936 isn't fully worked out; it's more complicated than that. */
4941 /* Check for invalid scopes. */
4943 {
4947 }
4949 {
4953 scope);
4958 }
4961 /* If the name is of the form "X::~X" it's OK even if X is a
4962 typedef. */
4971 {
4974 }
4976 /* ~auto means the destructor of whatever the object is. */
4978 {
4981 "%<~auto%> only available with "
4985 }
4987 /* If there was an explicit qualification (S::~T), first look
4988 in the scope given by the qualification (i.e., S).
4990 Note: in the calls to cp_parser_class_name below we pass
4991 typename_type so that lookup finds the injected-class-name
4992 rather than the constructor. */
4996 {
5001 typename_type,
5004 declarator_p);
5007 }
5008 /* In "N::S::~S", look in "N" as well. */
5010 {
5015 type_decl
5019 typename_type,
5022 declarator_p);
5025 }
5026 /* In "p->S::~T", look in the scope given by "*p" as well. */
5028 {
5033 type_decl
5037 typename_type,
5040 declarator_p);
5043 }
5044 /* Look in the surrounding context. */
5046 {
5052 type_decl
5056 typename_type,
5059 declarator_p);
5062 {
5063 /* We couldn't find a type with this name, so just accept
5064 it and check for a match at instantiation time. */
5069 }
5070 }
5071 /* If an error occurred, assume that the name of the
5072 destructor is the same as the name of the qualifying
5073 class. That allows us to keep parsing after running
5074 into ill-formed destructor names. */
5080 /* Check that destructor name and scope match. */
5082 {
5089 }
5091 /* [class.dtor]
5093 A typedef-name that names a class shall not be used as the
5094 identifier in the declarator for a destructor declaration. */
5101 type_decl);
5104 }
5108 {
5109 tree id;
5111 /* This could be a template-id, so we try that first. */
5113 /* Try a template-id. */
5116 none_type,
5117 declarator_p);
5118 /* If that worked, we're done. */
5121 /* We still don't know whether we're looking at an
5122 operator-function-id or a conversion-function-id. */
5124 /* Try an operator-function-id. */
5126 /* If that didn't work, try a conversion-function-id. */
5130 {
5131 /* 17.6.3.3.5 */
5137 }
5140 }
5141 /* Fall through. */
5148 }
5149 }
5151 /* Parse an (optional) nested-name-specifier.
5153 nested-name-specifier: [C++98]
5154 class-or-namespace-name :: nested-name-specifier [opt]
5155 class-or-namespace-name :: template nested-name-specifier [opt]
5157 nested-name-specifier: [C++0x]
5158 type-name ::
5159 namespace-name ::
5160 nested-name-specifier identifier ::
5161 nested-name-specifier template [opt] simple-template-id ::
5163 PARSER->SCOPE should be set appropriately before this function is
5164 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5165 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5166 in name lookups.
5168 Sets PARSER->SCOPE to the class (TYPE) or namespace
5169 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5170 it unchanged if there is no nested-name-specifier. Returns the new
5171 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5173 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5174 part of a declaration and/or decl-specifier. */
5176 static tree
5182 {
5187 /* Remember where the nested-name-specifier starts. */
5189 {
5192 }
5195 {
5196 tree new_scope;
5197 tree old_scope;
5198 tree saved_qualifying_scope;
5201 /* Spot cases that cannot be the beginning of a
5202 nested-name-specifier. */
5205 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5206 the already parsed nested-name-specifier. */
5208 {
5209 /* Grab the nested-name-specifier and continue the loop. */
5211 /* If we originally encountered this nested-name-specifier
5212 with IS_DECLARATION set to false, we will not have
5213 resolved TYPENAME_TYPEs, so we must do so here. */
5216 {
5221 }
5224 }
5226 /* Spot cases that cannot be the beginning of a
5227 nested-name-specifier. On the second and subsequent times
5228 through the loop, we look for the `template' keyword. */
5230 ;
5231 /* A template-id can start a nested-name-specifier. */
5233 ;
5234 /* DR 743: decltype can be used in a nested-name-specifier. */
5236 ;
5237 else
5238 {
5239 /* If the next token is not an identifier, then it is
5240 definitely not a type-name or namespace-name. */
5243 /* If the following token is neither a `<' (to begin a
5244 template-id), nor a `::', then we are not looking at a
5245 nested-name-specifier. */
5251 {
5255 }
5258 && !cp_parser_nth_token_starts_template_argument_list_p
5261 }
5263 /* The nested-name-specifier is optional, so we parse
5264 tentatively. */
5267 /* Look for the optional `template' keyword, if this isn't the
5268 first time through the loop. */
5271 else
5274 /* Save the old scope since the name lookup we are about to do
5275 might destroy it. */
5278 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5279 look up names in "X<T>::I" in order to determine that "Y" is
5280 a template. So, if we have a typename at this point, we make
5281 an effort to look through it. */
5283 && !typename_keyword_p
5288 /* Parse the qualifying entity. */
5289 new_scope
5291 typename_keyword_p,
5292 template_keyword_p,
5293 check_dependency_p,
5294 type_p,
5295 is_declaration);
5296 /* Look for the `::' token. */
5299 /* If we found what we wanted, we keep going; otherwise, we're
5300 done. */
5302 {
5305 /* Restore the OLD_SCOPE since it was valid before the
5306 failed attempt at finding the last
5307 class-or-namespace-name. */
5311 /* If the next token is a decltype, and the one after that is a
5312 `::', then the decltype has failed to resolve to a class or
5313 enumeration type. Give this error even when parsing
5314 tentatively since it can't possibly be valid--and we're going
5315 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5316 won't get another chance.*/
5320 {
5327 /* As below. */
5330 }
5334 /* If the next token is an identifier, and the one after
5335 that is a `::', then any valid interpretation would have
5336 found a class-or-namespace-name. */
5342 {
5345 {
5347 {
5348 tree decl;
5349 tree ambiguous_decls;
5352 none_type,
5361 decl);
5363 {
5364 // cp_parser_lookup_name has the same diagnostic,
5365 // thus make sure to emit it at most once.
5368 {
5373 }
5375 }
5376 else
5377 {
5379 cp_parser_name_lookup_error
5382 else
5383 cp_parser_name_lookup_error
5386 }
5387 }
5390 /* Treat this as a successful nested-name-specifier
5391 due to:
5393 [basic.lookup.qual]
5395 If the name found is not a class-name (clause
5396 _class_) or namespace-name (_namespace.def_), the
5397 program is ill-formed. */
5399 }
5401 }
5403 }
5404 /* We've found one valid nested-name-specifier. */
5406 /* Name lookup always gives us a DECL. */
5409 /* Uses of "template" must be followed by actual templates. */
5421 new_scope);
5422 /* If it is a class scope, try to complete it; we are about to
5423 be looking up names inside the class. */
5425 /* Since checking types for dependency can be expensive,
5426 avoid doing it if the type is already complete. */
5428 /* Do not try to complete dependent types. */
5430 {
5432 /* If it is a typedef to current class, use the current
5433 class instead, as the typedef won't have any names inside
5434 it yet. */
5438 }
5439 /* Make sure we look in the right scope the next time through
5440 the loop. */
5442 }
5444 /* If parsing tentatively, replace the sequence of tokens that makes
5445 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5446 token. That way, should we re-parse the token stream, we will
5447 not have to repeat the effort required to do the parse, nor will
5448 we issue duplicate error messages. */
5450 {
5454 /* Reset the contents of the START token. */
5456 /* Retrieve any deferred checks. Do not pop this access checks yet
5457 so the memory will not be reclaimed during token replacing below. */
5465 /* Purge all subsequent tokens. */
5467 }
5473 }
5475 /* Parse a nested-name-specifier. See
5476 cp_parser_nested_name_specifier_opt for details. This function
5477 behaves identically, except that it will an issue an error if no
5478 nested-name-specifier is present. */
5480 static tree
5486 {
5487 tree scope;
5489 /* Look for the nested-name-specifier. */
5491 typename_keyword_p,
5492 check_dependency_p,
5493 type_p,
5494 is_declaration);
5495 /* If it was not present, issue an error message. */
5497 {
5500 }
5503 }
5505 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5506 this is either a class-name or a namespace-name (which corresponds
5507 to the class-or-namespace-name production in the grammar). For
5508 C++0x, it can also be a type-name that refers to an enumeration
5509 type or a simple-template-id.
5511 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5512 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5513 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5514 TYPE_P is TRUE iff the next name should be taken as a class-name,
5515 even the same name is declared to be another entity in the same
5516 scope.
5518 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5519 specified by the class-or-namespace-name. If neither is found the
5520 ERROR_MARK_NODE is returned. */
5522 static tree
5529 {
5530 tree saved_scope;
5531 tree saved_qualifying_scope;
5532 tree saved_object_scope;
5533 tree scope;
5537 /* DR 743: decltype can appear in a nested-name-specifier. */
5539 {
5543 {
5546 }
5550 }
5552 /* Before we try to parse the class-name, we must save away the
5553 current PARSER->SCOPE since cp_parser_class_name will destroy
5554 it. */
5558 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5559 there is no need to look for a namespace-name. */
5560 only_class_p = template_keyword_p
5565 typename_keyword_p,
5566 template_keyword_p,
5568 check_dependency_p,
5570 is_declaration);
5572 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5576 {
5577 /* Restore the saved scope. */
5582 /* Parse tentatively. */
5585 /* Parse a type-name */
5588 /* "If the name found does not designate a namespace or a class,
5589 enumeration, or dependent type, the program is ill-formed."
5591 We cover classes and dependent types above and namespaces below,
5592 so this code is only looking for enums. */
5598 }
5599 /* If that didn't work, try for a namespace-name. */
5601 {
5602 /* Restore the saved scope. */
5606 /* If we are not looking at an identifier followed by the scope
5607 resolution operator, then this is not part of a
5608 nested-name-specifier. (Note that this function is only used
5609 to parse the components of a nested-name-specifier.) */
5614 }
5617 }
5619 /* Return true if we are looking at a compound-literal, false otherwise. */
5621 static bool
5623 {
5624 /* Consume the `('. */
5629 /* Skip tokens until the next token is a closing parenthesis.
5630 If we find the closing `)', and the next token is a `{', then
5631 we are looking at a compound-literal. */
5632 bool compound_literal_p
5637 /* Roll back the tokens we skipped. */
5641 }
5643 /* Parse a postfix-expression.
5645 postfix-expression:
5646 primary-expression
5647 postfix-expression [ expression ]
5648 postfix-expression ( expression-list [opt] )
5649 simple-type-specifier ( expression-list [opt] )
5650 typename :: [opt] nested-name-specifier identifier
5651 ( expression-list [opt] )
5652 typename :: [opt] nested-name-specifier template [opt] template-id
5653 ( expression-list [opt] )
5654 postfix-expression . template [opt] id-expression
5655 postfix-expression -> template [opt] id-expression
5656 postfix-expression . pseudo-destructor-name
5657 postfix-expression -> pseudo-destructor-name
5658 postfix-expression ++
5659 postfix-expression --
5660 dynamic_cast < type-id > ( expression )
5661 static_cast < type-id > ( expression )
5662 reinterpret_cast < type-id > ( expression )
5663 const_cast < type-id > ( expression )
5664 typeid ( expression )
5665 typeid ( type-id )
5667 GNU Extension:
5669 postfix-expression:
5670 ( type-id ) { initializer-list , [opt] }
5672 This extension is a GNU version of the C99 compound-literal
5673 construct. (The C99 grammar uses `type-name' instead of `type-id',
5674 but they are essentially the same concept.)
5676 If ADDRESS_P is true, the postfix expression is the operand of the
5677 `&' operator. CAST_P is true if this expression is the target of a
5678 cast.
5680 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5681 class member access expressions [expr.ref].
5683 Returns a representation of the expression. */
5685 static tree
5689 {
5691 location_t loc;
5698 /* Peek at the next token. */
5701 /* Some of the productions are determined by keywords. */
5704 {
5709 {
5710 tree type;
5711 tree expression;
5715 /* All of these can be handled in the same way from the point
5716 of view of parsing. Begin by consuming the token
5717 identifying the cast. */
5720 /* New types cannot be defined in the cast. */
5722 parser->type_definition_forbidden_message
5725 /* Look for the opening `<'. */
5727 /* Parse the type to which we are casting. */
5732 /* Look for the closing `>'. */
5734 /* Restore the old message. */
5737 bool saved_greater_than_is_operator_p
5741 /* And the expression which is being cast. */
5746 parser->greater_than_is_operator_p
5749 /* Only type conversions to integral or enumeration types
5750 can be used in constant-expressions. */
5756 {
5758 postfix_expression
5762 postfix_expression
5766 postfix_expression
5768 tf_warning_or_error);
5771 postfix_expression
5776 }
5777 }
5781 {
5782 tree type;
5786 /* Consume the `typeid' token. */
5788 /* Look for the `(' token. */
5790 /* Types cannot be defined in a `typeid' expression. */
5792 parser->type_definition_forbidden_message
5794 /* We can't be sure yet whether we're looking at a type-id or an
5795 expression. */
5797 /* Try a type-id first. */
5802 /* Look for the `)' token. Otherwise, we can't be sure that
5803 we're not looking at an expression: consider `typeid (int
5804 (3))', for example. */
5806 /* If all went well, simply lookup the type-id. */
5809 /* Otherwise, fall back to the expression variant. */
5810 else
5811 {
5812 tree expression;
5814 /* Look for an expression. */
5816 /* Compute its typeid. */
5818 /* Look for the `)' token. */
5820 }
5821 /* Restore the saved message. */
5823 /* `typeid' may not appear in an integral constant expression. */
5826 }
5830 {
5831 tree type;
5832 /* The syntax permitted here is the same permitted for an
5833 elaborated-type-specifier. */
5838 }
5842 {
5846 {
5851 }
5853 {
5858 }
5859 else
5860 {
5861 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5864 }
5866 postfix_expression =
5870 {
5874 }
5876 {
5881 }
5882 else
5883 {
5885 postfix_expression);
5889 }
5891 }
5894 {
5897 tree p;
5911 tf_warning_or_error);
5914 tf_warning_or_error);
5915 else
5916 {
5920 }
5922 }
5925 {
5926 tree type;
5928 /* If the next thing is a simple-type-specifier, we may be
5929 looking at a functional cast. We could also be looking at
5930 an id-expression. So, we try the functional cast, and if
5931 that doesn't work we fall back to the primary-expression. */
5933 /* Look for the simple-type-specifier. */
5936 CP_PARSER_FLAGS_NONE);
5937 /* Parse the cast itself. */
5939 postfix_expression
5941 /* If that worked, we're done. */
5945 /* If the functional-cast didn't work out, try a
5946 compound-literal. */
5949 {
5954 /* Avoid calling cp_parser_type_id pointlessly, see comment
5955 in cp_parser_cast_expression about c++/29234. */
5958 else
5959 {
5960 /* Parse the type. */
5965 /* Look for the `)'. */
5967 }
5969 /* If things aren't going well, there's no need to
5970 keep going. */
5972 {
5974 /* Parse the brace-enclosed initializer list. */
5977 }
5978 /* If that worked, we're definitely looking at a
5979 compound-literal expression. */
5981 {
5982 /* Warn the user that a compound literal is not
5983 allowed in standard C++. */
5986 /* For simplicity, we disallow compound literals in
5987 constant-expressions. We could
5988 allow compound literals of integer type, whose
5989 initializer was a constant, in constant
5990 expressions. Permitting that usage, as a further
5991 extension, would not change the meaning of any
5992 currently accepted programs. (Of course, as
5993 compound literals are not part of ISO C++, the
5994 standard has nothing to say.) */
5996 NIC_NCC))
5997 {
6000 }
6001 /* Form the representation of the compound-literal. */
6002 postfix_expression
6004 tf_warning_or_error);
6006 }
6007 }
6009 /* It must be a primary-expression. */
6010 postfix_expression
6013 decltype_p,
6015 }
6017 }
6019 /* Note that we don't need to worry about calling build_cplus_new on a
6020 class-valued CALL_EXPR in decltype when it isn't the end of the
6021 postfix-expression; unary_complex_lvalue will take care of that for
6022 all these cases. */
6024 /* Keep looping until the postfix-expression is complete. */
6026 {
6030 /* It is not a Koenig lookup function call. */
6031 postfix_expression
6034 /* Peek at the next token. */
6038 {
6041 {
6043 "two consecutive %<[%> shall "
6046 }
6047 postfix_expression
6049 postfix_expression,
6051 decltype_p);
6057 /* postfix-expression ( expression-list [opt] ) */
6058 {
6068 is_builtin_constant_p
6071 {
6072 /* The whole point of __builtin_constant_p is to allow
6073 non-constant expressions to appear as arguments. */
6074 saved_integral_constant_expression_p
6076 saved_non_integral_constant_expression_p
6079 }
6080 args = (cp_parser_parenthesized_expression_list
6086 {
6087 parser->integral_constant_expression_p
6089 parser->non_integral_constant_expression_p
6091 }
6094 {
6097 }
6099 /* Function calls are not permitted in
6100 constant-expressions. */
6103 NIC_FUNC_CALL))
6104 {
6108 }
6113 {
6115 {
6117 {
6120 postfix_expression
6122 complain);
6123 }
6124 else
6125 postfix_expression
6127 }
6128 /* We do not perform argument-dependent lookup if
6129 normal lookup finds a non-function, in accordance
6130 with the expected resolution of DR 218. */
6133 {
6137 /* Do not do argument dependent lookup if regular
6138 lookup finds a member function or a block-scope
6139 function declaration. [basic.lookup.argdep]/3 */
6142 {
6145 postfix_expression
6147 complain);
6148 }
6149 }
6150 }
6153 {
6163 "%<memset%> used with constant zero length "
6164 "parameter; this could be due to transposed "
6167 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6168 to avoid leaking those into folder and middle-end. */
6170 tree arg;
6174 }
6177 {
6187 {
6188 postfix_expression
6192 }
6195 {
6196 postfix_expression
6197 = (build_new_method_call
6203 complain));
6204 }
6205 else
6206 postfix_expression
6210 complain);
6211 }
6215 postfix_expression = (build_offset_ref_call_from_tree
6217 complain));
6219 /* A call to a static class member, or a namespace-scope
6220 function. */
6221 postfix_expression
6224 koenig_p,
6225 complain);
6226 else
6227 /* All other function calls. */
6228 postfix_expression
6231 koenig_p,
6232 complain);
6236 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6240 }
6245 /* postfix-expression . template [opt] id-expression
6246 postfix-expression . pseudo-destructor-name
6247 postfix-expression -> template [opt] id-expression
6248 postfix-expression -> pseudo-destructor-name */
6250 /* Consume the `.' or `->' operator. */
6253 postfix_expression
6255 postfix_expression,
6262 /* postfix-expression ++ */
6263 /* Consume the `++' token. */
6265 /* Generate a representation for the complete expression. */
6266 postfix_expression
6268 POSTINCREMENT_EXPR);
6269 /* Increments may not appear in constant-expressions. */
6277 /* postfix-expression -- */
6278 /* Consume the `--' token. */
6280 /* Generate a representation for the complete expression. */
6281 postfix_expression
6283 POSTDECREMENT_EXPR);
6284 /* Decrements may not appear in constant-expressions. */
6296 else
6298 }
6299 }
6301 /* We should never get here. */
6304 }
6306 /* This function parses Cilk Plus array notations. If a normal array expr. is
6307 parsed then the array index is passed back to the caller through *INIT_INDEX
6308 and the function returns a NULL_TREE. If array notation expr. is parsed,
6309 then *INIT_INDEX is ignored by the caller and the function returns
6310 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6311 error_mark_node. */
6313 static tree
6315 tree array_value)
6316 {
6320 {
6323 }
6332 {
6335 }
6337 {
6338 /* Consume the ':'. */
6341 /* If we are here, then we have a case like this A[:]. */
6343 {
6347 }
6351 }
6352 else
6353 {
6354 /* If we are here, then there are three valid possibilities:
6355 1. ARRAY [ EXP ]
6356 2. ARRAY [ EXP : EXP ]
6357 3. ARRAY [ EXP : EXP : EXP ] */
6361 {
6362 /* This indicates that we have a normal array expression. */
6365 }
6367 /* Consume the ':'. */
6371 {
6374 }
6375 }
6380 {
6384 }
6390 }
6392 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6393 by cp_parser_builtin_offsetof. We're looking for
6395 postfix-expression [ expression ]
6396 postfix-expression [ braced-init-list ] (C++11)
6398 FOR_OFFSETOF is set if we're being called in that context, which
6399 changes how we deal with integer constant expressions. */
6401 static tree
6403 tree postfix_expression,
6406 {
6411 /* Consume the `[' token. */
6417 /* Parse the index expression. */
6418 /* ??? For offsetof, there is a question of what to allow here. If
6419 offsetof is not being used in an integral constant expression context,
6420 then we *could* get the right answer by computing the value at runtime.
6421 If we are in an integral constant expression context, then we might
6422 could accept any constant expression; hard to say without analysis.
6423 Rather than open the barn door too wide right away, allow only integer
6424 constant expressions here. */
6427 else
6428 {
6430 {
6437 {
6439 "braced list index is not allowed with array "
6443 }
6444 }
6446 {
6447 /* Here are have these two options:
6448 ARRAY[EXP : EXP] - Array notation expr with default
6449 stride of 1.
6450 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6451 stride. */
6453 postfix_expression);
6456 }
6457 else
6459 }
6463 /* Look for the closing `]'. */
6466 /* Build the ARRAY_REF. */
6470 /* When not doing offsetof, array references are not permitted in
6471 constant-expressions. */
6477 }
6479 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6480 by cp_parser_builtin_offsetof. We're looking for
6482 postfix-expression . template [opt] id-expression
6483 postfix-expression . pseudo-destructor-name
6484 postfix-expression -> template [opt] id-expression
6485 postfix-expression -> pseudo-destructor-name
6487 FOR_OFFSETOF is set if we're being called in that context. That sorta
6488 limits what of the above we'll actually accept, but nevermind.
6489 TOKEN_TYPE is the "." or "->" token, which will already have been
6490 removed from the stream. */
6492 static tree
6495 tree postfix_expression,
6497 location_t location)
6498 {
6499 tree name;
6504 /* If this is a `->' operator, dereference the pointer. */
6507 tf_warning_or_error);
6508 /* Check to see whether or not the expression is type-dependent. */
6510 /* The identifier following the `->' or `.' is not qualified. */
6516 /* Enter the scope corresponding to the type of the object
6517 given by the POSTFIX_EXPRESSION. */
6519 {
6521 /* According to the standard, no expression should ever have
6522 reference type. Unfortunately, we do not currently match
6523 the standard in this respect in that our internal representation
6524 of an expression may have reference type even when the standard
6525 says it does not. Therefore, we have to manually obtain the
6526 underlying type here. */
6528 /* The type of the POSTFIX_EXPRESSION must be complete. */
6530 {
6532 postfix_expression);
6534 }
6535 /* Unlike the object expression in other contexts, *this is not
6536 required to be of complete type for purposes of class member
6537 access (5.2.5) outside the member function body. */
6541 /* Let the name lookup machinery know that we are processing a
6542 class member access expression. */
6544 /* If something went wrong, we want to be able to discern that case,
6545 as opposed to the case where there was no SCOPE due to the type
6546 of expression being dependent. */
6549 /* If the SCOPE was erroneous, make the various semantic analysis
6550 functions exit quickly -- and without issuing additional error
6551 messages. */
6554 }
6556 /* Assume this expression is not a pseudo-destructor access. */
6559 /* If the SCOPE is a scalar type, then, if this is a valid program,
6560 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6561 is type dependent, it can be pseudo-destructor-name or something else.
6562 Try to parse it as pseudo-destructor-name first. */
6564 {
6565 tree s;
6566 tree type;
6569 /* Parse the pseudo-destructor-name. */
6578 {
6580 postfix_expression
6583 }
6584 }
6587 {
6588 /* If the SCOPE is not a scalar type, we are looking at an
6589 ordinary class member access expression, rather than a
6590 pseudo-destructor-name. */
6593 /* Parse the id-expression. */
6594 name = (cp_parser_id_expression
6601 /* In general, build a SCOPE_REF if the member name is qualified.
6602 However, if the name was not dependent and has already been
6603 resolved; there is no need to build the SCOPE_REF. For example;
6605 struct X { void f(); };
6606 template <typename T> void f(T* t) { t->X::f(); }
6608 Even though "t" is dependent, "X::f" is not and has been resolved
6609 to a BASELINK; there is no need to include scope information. */
6611 /* But we do need to remember that there was an explicit scope for
6612 virtual function calls. */
6616 /* If the name is a template-id that names a type, we will get a
6617 TYPE_DECL here. That is invalid code. */
6619 {
6622 }
6623 else
6624 {
6626 {
6628 {
6632 }
6633 else
6636 name,
6637 template_p);
6641 }
6643 adjust_result_of_qualified_name_lookup
6645 postfix_expression
6647 template_p,
6648 tf_warning_or_error);
6649 }
6650 }
6652 /* We no longer need to look up names in the scope of the object on
6653 the left-hand side of the `.' or `->' operator. */
6656 /* Outside of offsetof, these operators may not appear in
6657 constant-expressions. */
6659 && (cp_parser_non_integral_constant_expression
6664 }
6666 /* Cache of LITERAL_ZERO_P constants. */
6670 /* Parse a parenthesized expression-list.
6672 expression-list:
6673 assignment-expression
6674 expression-list, assignment-expression
6676 attribute-list:
6677 expression-list
6678 identifier
6679 identifier, expression-list
6681 CAST_P is true if this expression is the target of a cast.
6683 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6684 argument pack.
6686 Returns a vector of trees. Each element is a representation of an
6687 assignment-expression. NULL is returned if the ( and or ) are
6688 missing. An empty, but allocated, vector is returned on no
6689 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6690 if we are parsing an attribute list for an attribute that wants a
6691 plain identifier argument, normal_attr for an attribute that wants
6692 an expression, or non_attr if we aren't parsing an attribute list. If
6693 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6694 not all of the expressions in the list were constant.
6695 WANT_LITERAL_ZERO_P is true if the caller is interested in
6696 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6697 immediately, this can be removed. */
6706 {
6712 /* Assume all the expressions will be constant. */
6721 /* Within a parenthesized expression, a `>' token is always
6722 the greater-than operator. */
6723 saved_greater_than_is_operator_p
6727 /* Consume expressions until there are no more. */
6730 {
6731 tree expr;
6733 /* At the beginning of attribute lists, check to see if the
6734 next token is an identifier. */
6737 {
6740 /* Consume the identifier. */
6742 /* Save the identifier. */
6744 }
6745 else
6746 {
6749 /* Parse the next assignment-expression. */
6751 {
6752 /* A braced-init-list. */
6758 }
6760 {
6761 expr = (cp_parser_constant_expression
6766 }
6767 else
6768 {
6772 {
6778 /* If a parameter is literal zero alone, remember it
6779 for -Wmemset-transposed-args warning. */
6782 && want_literal_zero_p
6784 == CPP_COMMA
6787 {
6794 else
6795 {
6800 }
6801 /* Consume the 0 token (or '\0', 0LL etc.). */
6803 }
6807 }
6810 NULL);
6811 }
6816 /* If we have an ellipsis, then this is an expression
6817 expansion. */
6820 {
6821 /* Consume the `...'. */
6824 /* Build the argument pack. */
6826 }
6828 /* Add it to the list. We add error_mark_node
6829 expressions to the list, so that we can still tell if
6830 the correct form for a parenthesized expression-list
6831 is found. That gives better errors. */
6836 }
6838 /* After the first item, attribute lists look the same as
6839 expression lists. */
6842 get_comma:;
6843 /* If the next token isn't a `,', then we are done. */
6847 /* Otherwise, consume the `,' and keep going. */
6849 }
6852 {
6855 skip_comma:;
6856 /* We try and resync to an unnested comma, as that will give the
6857 user better diagnostics. */
6865 {
6866 parser->greater_than_is_operator_p
6869 }
6870 }
6872 parser->greater_than_is_operator_p
6879 }
6881 /* Parse a pseudo-destructor-name.
6883 pseudo-destructor-name:
6884 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6885 :: [opt] nested-name-specifier template template-id :: ~ type-name
6886 :: [opt] nested-name-specifier [opt] ~ type-name
6888 If either of the first two productions is used, sets *SCOPE to the
6889 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6890 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6891 or ERROR_MARK_NODE if the parse fails. */
6893 static void
6895 tree object,
6898 {
6901 /* Handle ~auto. */
6905 {
6908 "%<~auto%> only available with "
6915 }
6917 /* Assume that things will not work out. */
6920 /* Look for the optional `::' operator. */
6922 /* Look for the optional nested-name-specifier. */
6923 nested_name_specifier_p
6930 /* Now, if we saw a nested-name-specifier, we might be doing the
6931 second production. */
6934 {
6935 /* Consume the `template' keyword. */
6937 /* Parse the template-id. */
6941 class_type,
6943 /* Look for the `::' token. */
6945 }
6946 /* If the next token is not a `~', then there might be some
6947 additional qualification. */
6949 {
6950 /* At this point, we're looking for "type-name :: ~". The type-name
6951 must not be a class-name, since this is a pseudo-destructor. So,
6952 it must be either an enum-name, or a typedef-name -- both of which
6953 are just identifiers. So, we peek ahead to check that the "::"
6954 and "~" tokens are present; if they are not, then we can avoid
6955 calling type_name. */
6959 {
6962 }
6964 /* Look for the type-name. */
6969 /* Look for the `::' token. */
6971 }
6972 else
6975 /* Look for the `~'. */
6978 /* Once we see the ~, this has to be a pseudo-destructor. */
6982 /* Look for the type-name again. We are not responsible for
6983 checking that it matches the first type-name. */
6985 }
6987 /* Parse a unary-expression.
6989 unary-expression:
6990 postfix-expression
6991 ++ cast-expression
6992 -- cast-expression
6993 unary-operator cast-expression
6994 sizeof unary-expression
6995 sizeof ( type-id )
6996 alignof ( type-id ) [C++0x]
6997 new-expression
6998 delete-expression
7000 GNU Extensions:
7002 unary-expression:
7003 __extension__ cast-expression
7004 __alignof__ unary-expression
7005 __alignof__ ( type-id )
7006 alignof unary-expression [C++0x]
7007 __real__ cast-expression
7008 __imag__ cast-expression
7009 && identifier
7010 sizeof ( type-id ) { initializer-list , [opt] }
7011 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7012 __alignof__ ( type-id ) { initializer-list , [opt] }
7014 ADDRESS_P is true iff the unary-expression is appearing as the
7015 operand of the `&' operator. CAST_P is true if this expression is
7016 the target of a cast.
7018 Returns a representation of the expression. */
7020 static tree
7023 {
7027 /* Peek at the next token. */
7029 /* Some keywords give away the kind of expression. */
7031 {
7035 {
7038 {
7041 location_t first_loc;
7044 /* Consume the token. */
7047 /* Parse the operand. */
7052 else
7053 {
7054 /* ISO C++ defines alignof only with types, not with
7055 expressions. So pedwarn if alignof is used with a non-
7056 type expression. However, __alignof__ is ok. */
7059 "ISO C++ does not allow %<alignof%> "
7063 }
7064 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7065 SIZEOF_EXPR with the original operand. */
7067 {
7069 {
7071 {
7074 error_mark_node));
7076 }
7077 else
7081 }
7083 }
7085 }
7094 {
7095 /* The saved value of the PEDANTIC flag. */
7097 tree expr;
7099 /* Save away the PEDANTIC flag. */
7101 /* Parse the cast-expression. */
7103 /* Restore the PEDANTIC flag. */
7107 }
7111 {
7112 tree expression;
7114 /* Consume the `__real__' or `__imag__' token. */
7116 /* Parse the cast-expression. */
7118 /* Create the complete representation. */
7122 expression,
7123 tf_warning_or_error);
7124 }
7132 {
7133 tree expr;
7143 parser->type_definition_forbidden_message
7146 saved_integral_constant_expression_p
7148 saved_non_integral_constant_expression_p
7152 saved_greater_than_is_operator_p
7162 parser->greater_than_is_operator_p
7165 parser->integral_constant_expression_p
7167 parser->non_integral_constant_expression_p
7174 }
7178 }
7179 }
7181 /* Look for the `:: new' and `:: delete', which also signal the
7182 beginning of a new-expression, or delete-expression,
7183 respectively. If the next token is `::', then it might be one of
7184 these. */
7186 {
7189 /* See if the token after the `::' is one of the keywords in
7190 which we're interested. */
7192 /* If it's `new', we have a new-expression. */
7195 /* Similarly, for `delete'. */
7198 }
7200 /* Look for a unary operator. */
7202 /* The `++' and `--' operators can be handled similarly, even though
7203 they are not technically unary-operators in the grammar. */
7205 {
7210 /* Handle the GNU address-of-label extension. */
7213 {
7214 tree identifier;
7215 tree expression;
7218 /* Consume the '&&' token. */
7220 /* Look for the identifier. */
7222 /* Create an expression representing the address. */
7225 NIC_ADDR_LABEL))
7228 }
7229 }
7231 {
7232 tree cast_expression;
7238 /* Consume the operator token. */
7240 /* Parse the cast-expression. */
7241 cast_expression
7246 pidk);
7247 /* Now, build an appropriate representation. */
7249 {
7253 RO_UNARY_STAR,
7254 complain);
7259 /* Fall through. */
7262 cast_expression,
7263 complain);
7270 /* Fall through. */
7280 }
7284 non_constant_p))
7288 }
7292 decltype_p,
7293 pidk);
7294 }
7299 {
7302 }
7304 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7305 unary-operator, the corresponding tree code is returned. */
7307 static enum tree_code
7309 {
7311 {
7332 }
7333 }
7335 /* Parse a new-expression.
7337 new-expression:
7338 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7339 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7341 Returns a representation of the expression. */
7343 static tree
7345 {
7348 tree type;
7351 tree ret;
7353 /* Look for the optional `::' operator. */
7354 global_scope_p
7358 /* Look for the `new' operator. */
7360 /* There's no easy way to tell a new-placement from the
7361 `( type-id )' construct. */
7363 /* Look for a new-placement. */
7365 /* If that didn't work out, there's no new-placement. */
7367 {
7371 }
7373 /* If the next token is a `(', then we have a parenthesized
7374 type-id. */
7376 {
7380 /* Consume the `('. */
7383 /* Parse the type-id. */
7384 parser->type_definition_forbidden_message
7389 /* Look for the closing `)'. */
7392 /* There should not be a direct-new-declarator in this production,
7393 but GCC used to allowed this, so we check and emit a sensible error
7394 message for this case. */
7396 {
7402 }
7403 }
7404 /* Otherwise, there must be a new-type-id. */
7405 else
7408 /* If the next token is a `(' or '{', then we have a new-initializer. */
7412 else
7415 /* A new-expression may not appear in an integral constant
7416 expression. */
7419 else
7420 {
7421 /* Create a representation of the new-expression. */
7423 tf_warning_or_error);
7424 }
7432 }
7434 /* Parse a new-placement.
7436 new-placement:
7437 ( expression-list )
7439 Returns the same representation as for an expression-list. */
7443 {
7446 /* Parse the expression-list. */
7447 expression_list = (cp_parser_parenthesized_expression_list
7453 }
7455 /* Parse a new-type-id.
7457 new-type-id:
7458 type-specifier-seq new-declarator [opt]
7460 Returns the TYPE allocated. If the new-type-id indicates an array
7461 type, *NELTS is set to the number of elements in the last array
7462 bound; the TYPE will not include the last array bound. */
7464 static tree
7466 {
7467 cp_decl_specifier_seq type_specifier_seq;
7473 /* The type-specifier sequence must not contain type definitions.
7474 (It cannot contain declarations of new types either, but if they
7475 are not definitions we will catch that because they are not
7476 complete.) */
7478 parser->type_definition_forbidden_message
7480 /* Parse the type-specifier-seq. */
7484 /* Restore the old message. */
7490 /* Parse the new-declarator. */
7493 /* Determine the number of elements in the last array dimension, if
7494 any. */
7496 /* Skip down to the last array dimension. */
7501 {
7504 }
7509 {
7512 }
7515 {
7522 else
7524 }
7527 }
7529 /* Parse an (optional) new-declarator.
7531 new-declarator:
7532 ptr-operator new-declarator [opt]
7533 direct-new-declarator
7535 Returns the declarator. */
7539 {
7542 cp_cv_quals cv_quals;
7544 /* We don't know if there's a ptr-operator next, or not. */
7546 /* Look for a ptr-operator. */
7548 /* If that worked, look for more new-declarators. */
7550 {
7553 /* Parse another optional declarator. */
7556 declarator = cp_parser_make_indirect_declarator
7560 }
7562 /* If the next token is a `[', there is a direct-new-declarator. */
7567 }
7569 /* Parse a direct-new-declarator.
7571 direct-new-declarator:
7572 [ expression ]
7573 direct-new-declarator [constant-expression]
7575 */
7579 {
7583 {
7584 tree expression;
7587 /* Look for the opening `['. */
7592 /* The standard requires that the expression have integral
7593 type. DR 74 adds enumeration types. We believe that the
7594 real intent is that these expressions be handled like the
7595 expression in a `switch' condition, which also allows
7596 classes with a single conversion to integral or
7597 enumeration type. */
7599 {
7600 expression
7602 expression,
7605 {
7607 "expression in new-declarator must have integral "
7610 }
7611 }
7613 /* Look for the closing `]'. */
7616 /* Add this bound to the declarator. */
7619 /* If the next token is not a `[', then there are no more
7620 bounds. */
7623 }
7626 }
7628 /* Parse a new-initializer.
7630 new-initializer:
7631 ( expression-list [opt] )
7632 braced-init-list
7634 Returns a representation of the expression-list. */
7638 {
7642 {
7643 tree t;
7650 }
7651 else
7652 expression_list = (cp_parser_parenthesized_expression_list
7658 }
7660 /* Parse a delete-expression.
7662 delete-expression:
7663 :: [opt] delete cast-expression
7664 :: [opt] delete [ ] cast-expression
7666 Returns a representation of the expression. */
7668 static tree
7670 {
7673 tree expression;
7675 /* Look for the optional `::' operator. */
7676 global_scope_p
7680 /* Look for the `delete' keyword. */
7682 /* See if the array syntax is in use. */
7684 {
7685 /* Consume the `[' token. */
7687 /* Look for the `]' token. */
7689 /* Remember that this is the `[]' construct. */
7691 }
7692 else
7695 /* Parse the cast-expression. */
7698 /* A delete-expression may not appear in an integral constant
7699 expression. */
7704 tf_warning_or_error);
7705 }
7707 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7708 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7709 0 otherwise. */
7711 static int
7713 {
7716 {
7758 /* In ((type ()) () the last () isn't a valid cast-expression,
7759 so the whole must be parsed as postfix-expression. */
7764 /* '[' may start a primary-expression in obj-c++ and in C++11,
7765 as a lambda-expression, eg, '(void)[]{}'. */
7772 /* '++' and '--' may or may not start a cast-expression:
7774 struct T { void operator++(int); };
7775 void f() { (T())++; }
7777 vs
7779 int a;
7780 (int)++a; */
7785 }
7786 }
7788 /* Parse a cast-expression.
7790 cast-expression:
7791 unary-expression
7792 ( type-id ) cast-expression
7794 ADDRESS_P is true iff the unary-expression is appearing as the
7795 operand of the `&' operator. CAST_P is true if this expression is
7796 the target of a cast.
7798 Returns a representation of the expression. */
7800 static tree
7803 {
7804 /* If it's a `(', then we might be looking at a cast. */
7806 {
7812 /* There's no way to know yet whether or not this is a cast.
7813 For example, `(int (3))' is a unary-expression, while `(int)
7814 3' is a cast. So, we resort to parsing tentatively. */
7816 /* Types may not be defined in a cast. */
7818 parser->type_definition_forbidden_message
7820 /* Consume the `('. */
7822 /* A very tricky bit is that `(struct S) { 3 }' is a
7823 compound-literal (which we permit in C++ as an extension).
7824 But, that construct is not a cast-expression -- it is a
7825 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7826 is legal; if the compound-literal were a cast-expression,
7827 you'd need an extra set of parentheses.) But, if we parse
7828 the type-id, and it happens to be a class-specifier, then we
7829 will commit to the parse at that point, because we cannot
7830 undo the action that is done when creating a new class. So,
7831 then we cannot back up and do a postfix-expression.
7833 Another tricky case is the following (c++/29234):
7835 struct S { void operator () (); };
7837 void foo ()
7838 {
7839 ( S()() );
7840 }
7842 As a type-id we parse the parenthesized S()() as a function
7843 returning a function, groktypename complains and we cannot
7844 back up in this case either.
7846 Therefore, we scan ahead to the closing `)', and check to see
7847 if the tokens after the `)' can start a cast-expression. Otherwise
7848 we are dealing with an unary-expression, a postfix-expression
7849 or something else.
7851 Yet another tricky case, in C++11, is the following (c++/54891):
7853 (void)[]{};
7855 The issue is that usually, besides the case of lambda-expressions,
7856 the parenthesized type-id cannot be followed by '[', and, eg, we
7857 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7858 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7859 we don't commit, we try a cast-expression, then an unary-expression.
7861 Save tokens so that we can put them back. */
7864 /* We may be looking at a cast-expression. */
7867 cast_expression
7870 /* Roll back the tokens we skipped. */
7872 /* If we aren't looking at a cast-expression, simulate an error so
7873 that the call to cp_parser_error_occurred below returns true. */
7876 else
7877 {
7880 /* Look for the type-id. */
7882 /* Look for the closing `)'. */
7885 }
7887 /* Restore the saved message. */
7890 /* At this point this can only be either a cast or a
7891 parenthesized ctor such as `(T ())' that looks like a cast to
7892 function returning T. */
7894 {
7895 /* Only commit if the cast-expression doesn't start with
7896 '++', '--', or '[' in C++11. */
7904 pidk);
7907 {
7908 /* Warn about old-style casts, if so requested. */
7915 /* Only type conversions to integral or enumeration types
7916 can be used in constant-expressions. */
7919 NIC_CAST))
7922 /* Perform the cast. */
7925 }
7926 }
7927 else
7929 }
7931 /* If we get here, then it's not a cast, so it must be a
7932 unary-expression. */
7935 }
7937 /* Parse a binary expression of the general form:
7939 pm-expression:
7940 cast-expression
7941 pm-expression .* cast-expression
7942 pm-expression ->* cast-expression
7944 multiplicative-expression:
7945 pm-expression
7946 multiplicative-expression * pm-expression
7947 multiplicative-expression / pm-expression
7948 multiplicative-expression % pm-expression
7950 additive-expression:
7951 multiplicative-expression
7952 additive-expression + multiplicative-expression
7953 additive-expression - multiplicative-expression
7955 shift-expression:
7956 additive-expression
7957 shift-expression << additive-expression
7958 shift-expression >> additive-expression
7960 relational-expression:
7961 shift-expression
7962 relational-expression < shift-expression
7963 relational-expression > shift-expression
7964 relational-expression <= shift-expression
7965 relational-expression >= shift-expression
7967 GNU Extension:
7969 relational-expression:
7970 relational-expression <? shift-expression
7971 relational-expression >? shift-expression
7973 equality-expression:
7974 relational-expression
7975 equality-expression == relational-expression
7976 equality-expression != relational-expression
7978 and-expression:
7979 equality-expression
7980 and-expression & equality-expression
7982 exclusive-or-expression:
7983 and-expression
7984 exclusive-or-expression ^ and-expression
7986 inclusive-or-expression:
7987 exclusive-or-expression
7988 inclusive-or-expression | exclusive-or-expression
7990 logical-and-expression:
7991 inclusive-or-expression
7992 logical-and-expression && inclusive-or-expression
7994 logical-or-expression:
7995 logical-and-expression
7996 logical-or-expression || logical-and-expression
7998 All these are implemented with a single function like:
8000 binary-expression:
8001 simple-cast-expression
8002 binary-expression <token> binary-expression
8004 CAST_P is true if this expression is the target of a cast.
8006 The binops_by_token map is used to get the tree codes for each <token> type.
8007 binary-expressions are associated according to a precedence table. */
8009 #define TOKEN_PRECEDENCE(token) \
8010 (((token->type == CPP_GREATER \
8011 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8012 && !parser->greater_than_is_operator_p) \
8013 ? PREC_NOT_OPERATOR \
8014 : binops_by_token[token->type].prec)
8016 static tree
8022 {
8023 cp_parser_expression_stack stack;
8025 cp_parser_expression_stack_entry current;
8026 tree rhs;
8030 tree overload;
8032 /* Parse the first expression. */
8043 {
8044 /* Get an operator token. */
8050 {
8052 "%<>>%> operator is treated"
8056 }
8060 /* Popping an entry off the stack means we completed a subexpression:
8061 - either we found a token which is not an operator (`>' where it is not
8062 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8063 will happen repeatedly;
8064 - or, we found an operator which has lower priority. This is the case
8065 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8066 parsing `3 * 4'. */
8068 {
8071 else
8073 }
8075 get_rhs:
8079 /* We used the operator token. */
8082 /* For "false && x" or "true || x", x will never be executed;
8083 disable warnings while evaluating it. */
8089 /* Extract another operand. It may be the RHS of this expression
8090 or the LHS of a new, higher priority expression. */
8095 /* Get another operator token. Look up its precedence to avoid
8096 building a useless (immediately popped) stack entry for common
8097 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8101 {
8102 /* ... and prepare to parse the RHS of the new, higher priority
8103 expression. Since precedence levels on the stack are
8104 monotonically increasing, we do not have to care about
8105 stack overflows. */
8114 pop:
8116 /* If the stack is not empty, we have parsed into LHS the right side
8117 (`4' in the example above) of an expression we had suspended.
8118 We can use the information on the stack to recover the LHS (`3')
8119 from the stack together with the tree code (`MULT_EXPR'), and
8120 the precedence of the higher level subexpression
8121 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8122 which will be used to actually build the additive expression. */
8127 }
8129 /* Undo the disabling of warnings done above. */
8140 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8141 ERROR_MARK for everything that is not a binary expression.
8142 This makes warn_about_parentheses miss some warnings that
8143 involve unary operators. For unary expressions we should
8144 pass the correct tree_code unless the unary expression was
8145 surrounded by parentheses.
8146 */
8152 == tcc_comparison
8155 else
8164 /* If the binary operator required the use of an overloaded operator,
8165 then this expression cannot be an integral constant-expression.
8166 An overloaded operator can be used even if both operands are
8167 otherwise permissible in an integral constant-expression if at
8168 least one of the operands is of enumeration type. */
8172 NIC_OVERLOADED))
8174 }
8177 }
8179 static tree
8184 {
8187 }
8189 /* Parse the `? expression : assignment-expression' part of a
8190 conditional-expression. The LOGICAL_OR_EXPR is the
8191 logical-or-expression that started the conditional-expression.
8192 Returns a representation of the entire conditional-expression.
8194 This routine is used by cp_parser_assignment_expression.
8196 ? expression : assignment-expression
8198 GNU Extensions:
8200 ? : assignment-expression */
8202 static tree
8204 {
8205 tree expr;
8206 tree assignment_expr;
8210 /* Consume the `?' token. */
8215 {
8218 /* Implicit true clause. */
8222 }
8223 else
8224 {
8227 /* Parse the expression. */
8230 c_inhibit_evaluation_warnings +=
8234 }
8236 /* The next token should be a `:'. */
8238 /* Parse the assignment-expression. */
8242 /* Build the conditional-expression. */
8244 expr,
8245 assignment_expr,
8246 tf_warning_or_error);
8247 }
8249 /* Parse an assignment-expression.
8251 assignment-expression:
8252 conditional-expression
8253 logical-or-expression assignment-operator assignment_expression
8254 throw-expression
8256 CAST_P is true if this expression is the target of a cast.
8257 DECLTYPE_P is true if this expression is the operand of decltype.
8259 Returns a representation for the expression. */
8261 static tree
8264 {
8265 tree expr;
8267 /* If the next token is the `throw' keyword, then we're looking at
8268 a throw-expression. */
8271 /* Otherwise, it must be that we are looking at a
8272 logical-or-expression. */
8273 else
8274 {
8275 /* Parse the binary expressions (logical-or-expression). */
8277 decltype_p,
8279 /* If the next token is a `?' then we're actually looking at a
8280 conditional-expression. */
8283 else
8284 {
8287 /* If it's an assignment-operator, we're using the second
8288 production. */
8289 enum tree_code assignment_operator
8292 {
8294 location_t saved_input_location;
8296 /* Parse the right-hand side of the assignment. */
8302 /* An assignment may not appear in a
8303 constant-expression. */
8305 NIC_ASSIGNMENT))
8307 /* Build the assignment expression. Its default
8308 location is the location of the '=' token. */
8312 assignment_operator,
8313 rhs,
8316 }
8317 }
8318 }
8321 }
8323 static tree
8326 {
8329 }
8331 /* Parse an (optional) assignment-operator.
8333 assignment-operator: one of
8334 = *= /= %= += -= >>= <<= &= ^= |=
8336 GNU Extension:
8338 assignment-operator: one of
8339 <?= >?=
8341 If the next token is an assignment operator, the corresponding tree
8342 code is returned, and the token is consumed. For example, for
8343 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8344 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8345 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8346 operator, ERROR_MARK is returned. */
8348 static enum tree_code
8350 {
8354 /* Peek at the next token. */
8358 {
8404 /* Nothing else is an assignment operator. */
8406 }
8408 /* If it was an assignment operator, consume it. */
8413 }
8415 /* Parse an expression.
8417 expression:
8418 assignment-expression
8419 expression , assignment-expression
8421 CAST_P is true if this expression is the target of a cast.
8422 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8423 except possibly parenthesized or on the RHS of a comma (N3276).
8425 Returns a representation of the expression. */
8427 static tree
8430 {
8435 {
8436 tree assignment_expression;
8438 /* Parse the next assignment-expression. */
8439 assignment_expression
8442 /* We don't create a temporary for a call that is the immediate operand
8443 of decltype or on the RHS of a comma. But when we see a comma, we
8444 need to create a temporary for a call on the LHS. */
8449 assignment_expression
8453 /* If this is the first assignment-expression, we can just
8454 save it away. */
8457 else
8459 assignment_expression,
8461 /* If the next token is not a comma, then we are done with the
8462 expression. */
8465 /* Consume the `,'. */
8468 /* A comma operator cannot appear in a constant-expression. */
8471 }
8474 }
8476 /* Parse a constant-expression.
8478 constant-expression:
8479 conditional-expression
8481 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8482 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8483 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8484 is false, NON_CONSTANT_P should be NULL. */
8486 static tree
8490 {
8494 tree expression;
8496 /* It might seem that we could simply parse the
8497 conditional-expression, and then check to see if it were
8498 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8499 one that the compiler can figure out is constant, possibly after
8500 doing some simplifications or optimizations. The standard has a
8501 precise definition of constant-expression, and we must honor
8502 that, even though it is somewhat more restrictive.
8504 For example:
8506 int i[(2, 3)];
8508 is not a legal declaration, because `(2, 3)' is not a
8509 constant-expression. The `,' operator is forbidden in a
8510 constant-expression. However, GCC's constant-folding machinery
8511 will fold this operation to an INTEGER_CST for `3'. */
8513 /* Save the old settings. */
8515 saved_allow_non_integral_constant_expression_p
8518 /* We are now parsing a constant-expression. */
8520 parser->allow_non_integral_constant_expression_p
8523 /* Although the grammar says "conditional-expression", we parse an
8524 "assignment-expression", which also permits "throw-expression"
8525 and the use of assignment operators. In the case that
8526 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8527 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8528 actually essential that we look for an assignment-expression.
8529 For example, cp_parser_initializer_clauses uses this function to
8530 determine whether a particular assignment-expression is in fact
8531 constant. */
8533 /* Restore the old settings. */
8534 parser->integral_constant_expression_p
8536 parser->allow_non_integral_constant_expression_p
8539 {
8540 /* Require an rvalue constant expression here; that's what our
8541 callers expect. Reference constant expressions are handled
8542 separately in e.g. cp_parser_template_argument. */
8547 }
8550 parser->non_integral_constant_expression_p
8554 }
8556 /* Parse __builtin_offsetof.
8558 offsetof-expression:
8559 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8561 offsetof-member-designator:
8562 id-expression
8563 | offsetof-member-designator "." id-expression
8564 | offsetof-member-designator "[" expression "]"
8565 | offsetof-member-designator "->" id-expression */
8567 static tree
8569 {
8572 cp_id_kind dummy;
8575 /* We're about to accept non-integral-constant things, but will
8576 definitely yield an integral constant expression. Save and
8577 restore these values around our local parsing. */
8581 /* Consume the "__builtin_offsetof" token. */
8583 /* Consume the opening `('. */
8585 /* Parse the type-id. */
8588 /* Look for the `,'. */
8592 /* Build the (type *)null that begins the traditional offsetof macro. */
8594 tf_warning_or_error);
8596 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8600 {
8603 {
8605 /* offsetof-member-designator "[" expression "]" */
8611 /* offsetof-member-designator "->" identifier */
8614 /* FALLTHRU */
8617 /* offsetof-member-designator "." identifier */
8625 /* Consume the ")" token. */
8630 /* Error. We know the following require will fail, but
8631 that gives the proper error message. */
8636 }
8637 }
8639 success:
8640 /* If we're processing a template, we can't finish the semantics yet.
8641 Otherwise we can fold the entire expression now. */
8643 {
8646 }
8647 else
8650 failure:
8655 }
8657 /* Parse a trait expression.
8659 Returns a representation of the expression, the underlying type
8660 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8662 static tree
8664 {
8665 cp_trait_kind kind;
8668 cp_decl_specifier_seq decl_specs;
8671 {
8748 }
8750 /* Consume the token. */
8760 /* Build a trivial decl-specifier-seq. */
8764 /* Call grokdeclarator to figure out what type this is. */
8769 {
8777 /* Build a trivial decl-specifier-seq. */
8781 /* Call grokdeclarator to figure out what type this is. */
8784 }
8788 /* Complete the trait expression, which may mean either processing
8789 the trait expr now or saving it for template instantiation. */
8791 {
8800 }
8801 }
8803 /* Lambdas that appear in variable initializer or default argument scope
8804 get that in their mangling, so we need to record it. We might as well
8805 use the count for function and namespace scopes as well. */
8809 {
8810 tree t;
8815 static void
8817 {
8818 tree_int ti;
8820 /* Once we're inside a function, we ignore other scopes and just push
8821 the function again so that popping works properly. */
8828 {
8829 /* Don't reset the count if we're still in the same function. */
8832 }
8833 }
8835 static void
8837 {
8840 }
8842 static void
8844 {
8847 {
8850 }
8852 }
8854 /* Parse a lambda expression.
8856 lambda-expression:
8857 lambda-introducer lambda-declarator [opt] compound-statement
8859 Returns a representation of the expression. */
8861 static tree
8863 {
8865 tree type;
8872 {
8874 {
8878 }
8880 }
8882 /* We may be in the middle of deferred access check. Disable
8883 it now. */
8894 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8897 /* Now that we've started the type, add the capture fields for any
8898 explicit captures. */
8901 {
8902 /* Inside the class, surrounding template-parameter-lists do not apply. */
8903 unsigned int saved_num_template_parameter_lists
8907 bool fully_implicit_function_template_p
8911 bool auto_is_implicit_function_template_parm_p
8922 /* By virtue of defining a local class, a lambda expression has access to
8923 the private variables of enclosing classes. */
8930 {
8933 }
8935 /* The capture list was built up in reverse order; fix that now. */
8947 parser->fully_implicit_function_template_p
8951 parser->auto_is_implicit_function_template_parm_p
8953 }
8957 /* This field is only used during parsing of the lambda. */
8960 /* This lambda shouldn't have any proxies left at this point. */
8962 /* And now that we're done, push proxies for an enclosing lambda. */
8967 else
8969 }
8971 /* Parse the beginning of a lambda expression.
8973 lambda-introducer:
8974 [ lambda-capture [opt] ]
8976 LAMBDA_EXPR is the current representation of the lambda expression. */
8978 static void
8980 {
8981 /* Need commas after the first capture. */
8984 /* Eat the leading `['. */
8987 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8995 {
8998 }
9001 {
9003 tree capture_id;
9004 tree capture_init_expr;
9008 enum capture_kind_type
9009 {
9010 BY_COPY,
9011 BY_REFERENCE
9012 };
9016 {
9019 }
9023 else
9026 /* Possibly capture `this'. */
9028 {
9038 explicit_init_p);
9040 }
9042 /* Remember whether we want to capture as a reference or not. */
9044 {
9047 }
9049 /* Get the identifier. */
9054 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9055 delimiters, but I modified this to stop on unnested ']' as well. It
9056 was already changed to stop on unnested '}', so the
9057 "closing_parenthesis" name is no more misleading with my change. */
9058 {
9064 }
9066 /* Find the initializer for this capture. */
9070 {
9072 /* An explicit initializer exists. */
9075 "lambda capture initializers "
9081 {
9084 }
9085 }
9086 else
9087 {
9090 /* Turn the identifier into an id-expression. */
9091 capture_init_expr
9096 {
9099 }
9103 {
9106 capture_init_expr);
9109 }
9112 {
9115 capture_init_expr))
9118 }
9120 capture_init_expr
9121 = finish_id_expression
9123 capture_init_expr,
9137 {
9140 }
9141 else
9143 }
9147 {
9152 capture_id);
9156 "capture of %qD redundant with by-reference capture "
9158 }
9161 capture_id,
9162 capture_init_expr,
9164 explicit_init_p);
9165 }
9168 }
9170 /* Parse the (optional) middle of a lambda expression.
9172 lambda-declarator:
9173 < template-parameter-list [opt] >
9174 ( parameter-declaration-clause [opt] )
9175 attribute-specifier [opt]
9176 mutable [opt]
9177 exception-specification [opt]
9178 lambda-return-type-clause [opt]
9180 LAMBDA_EXPR is the current representation of the lambda expression. */
9182 static bool
9184 {
9185 /* 5.1.1.4 of the standard says:
9186 If a lambda-expression does not include a lambda-declarator, it is as if
9187 the lambda-declarator were ().
9188 This means an empty parameter list, no attributes, and no exception
9189 specification. */
9195 /* The template-parameter-list is optional, but must begin with
9196 an opening angle if present. */
9198 {
9201 "lambda templates are only available with "
9210 /* We just processed one more parameter list. */
9212 }
9214 /* The parameter-declaration-clause is optional (unless
9215 template-parameter-list was given), but must begin with an
9216 opening parenthesis if present. */
9218 {
9223 /* Parse parameters. */
9226 /* Default arguments shall not be specified in the
9227 parameter-declaration-clause of a lambda-declarator. */
9237 /* Parse optional `mutable' keyword. */
9239 {
9242 }
9244 /* Parse optional exception specification. */
9247 /* Parse optional trailing return type. */
9249 {
9253 }
9255 /* The function parameters must be in scope all the way until after the
9256 trailing-return-type in case of decltype. */
9258 }
9262 /* Create the function call operator.
9264 Messing with declarators like this is no uglier than building up the
9265 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9266 other code. */
9267 {
9268 cp_decl_specifier_seq return_type_specs;
9270 tree fco;
9277 else
9278 /* Maybe we will deduce the return type later. */
9284 sfk_none);
9289 VIRT_SPEC_UNSPECIFIED,
9290 REF_QUAL_NONE,
9291 exception_spec,
9296 declarator,
9297 attributes);
9299 {
9302 /* Give the object parameter a different name. */
9306 }
9308 {
9312 }
9321 }
9322 }
9324 /* Parse the body of a lambda expression, which is simply
9326 compound-statement
9328 but which requires special handling.
9329 LAMBDA_EXPR is the current representation of the lambda expression. */
9331 static void
9333 {
9338 else
9339 /* Still increment function_depth so that we don't GC in the
9340 middle of an expression. */
9342 /* Clear this in case we're in the middle of a default argument. */
9345 /* Finish the function call operator
9346 - class_specifier
9347 + late_parsing_for_member
9348 + function_definition_after_declarator
9349 + ctor_initializer_opt_and_function_body */
9350 {
9352 tree body;
9354 tree compound_stmt;
9355 tree cap;
9357 /* Let the front end know that we are going to be defining this
9358 function. */
9360 NULL_TREE,
9369 /* Push the proxies for any explicit captures. */
9376 /* 5.1.1.4 of the standard says:
9377 If a lambda-expression does not include a trailing-return-type, it
9378 is as if the trailing-return-type denotes the following type:
9379 * if the compound-statement is of the form
9380 { return attribute-specifier [opt] expression ; }
9381 the type of the returned expression after lvalue-to-rvalue
9382 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9383 (_conv.array_ 4.2), and function-to-pointer conversion
9384 (_conv.func_ 4.3);
9385 * otherwise, void. */
9387 /* In a lambda that has neither a lambda-return-type-clause
9388 nor a deducible form, errors should be reported for return statements
9389 in the body. Since we used void as the placeholder return type, parsing
9390 the body as usual will give such desired behavior. */
9394 {
9398 /* Parse tentatively in case there's more after the initial return
9399 statement. */
9410 {
9414 /* Will get error here if type not deduced yet. */
9418 }
9419 }
9422 {
9427 }
9431 out:
9435 /* Finish the function and generate code for it if necessary. */
9438 /* Only expand if the call op is not a template. */
9441 }
9446 else
9448 }
9450 /* Statements [gram.stmt.stmt] */
9452 /* Parse a statement.
9454 statement:
9455 labeled-statement
9456 expression-statement
9457 compound-statement
9458 selection-statement
9459 iteration-statement
9460 jump-statement
9461 declaration-statement
9462 try-block
9464 C++11:
9466 statement:
9467 labeled-statement
9468 attribute-specifier-seq (opt) expression-statement
9469 attribute-specifier-seq (opt) compound-statement
9470 attribute-specifier-seq (opt) selection-statement
9471 attribute-specifier-seq (opt) iteration-statement
9472 attribute-specifier-seq (opt) jump-statement
9473 declaration-statement
9474 attribute-specifier-seq (opt) try-block
9476 TM Extension:
9478 statement:
9479 atomic-statement
9481 IN_COMPOUND is true when the statement is nested inside a
9482 cp_parser_compound_statement; this matters for certain pragmas.
9484 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9485 is a (possibly labeled) if statement which is not enclosed in braces
9486 and has an else clause. This is used to implement -Wparentheses. */
9488 static void
9491 {
9496 restart:
9499 /* There is no statement yet. */
9505 /* In obj-c++, seeing '[[' might be the either the beginning of
9506 c++11 attributes, or a nested objc-message-expression. So
9507 let's parse the c++11 attributes tentatively. */
9511 {
9514 }
9516 /* Peek at the next token. */
9518 /* Remember the location of the first token in the statement. */
9520 /* If this is a keyword, then that will often determine what kind of
9521 statement we have. */
9523 {
9527 {
9530 /* Looks like a labeled-statement with a case label.
9531 Parse the label, and then use tail recursion to parse
9532 the statement. */
9549 {
9554 }
9555 else
9569 {
9574 }
9575 else
9576 {
9580 }
9584 /* Objective-C++ exception-handling constructs. */
9598 /* This must be a namespace alias definition. */
9611 /* It might be a keyword like `int' that can start a
9612 declaration-statement. */
9614 }
9615 }
9617 {
9618 /* If the next token is a `:', then we are looking at a
9619 labeled-statement. */
9622 {
9623 /* Looks like a labeled-statement with an ordinary label.
9624 Parse the label, and then use tail recursion to parse
9625 the statement. */
9629 }
9630 }
9631 /* Anything that starts with a `{' must be a compound-statement. */
9634 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9635 a statement all its own. */
9637 {
9638 /* Only certain OpenMP pragmas are attached to statements, and thus
9639 are considered statements themselves. All others are not. In
9640 the context of a compound, accept the pragma as a "statement" and
9641 return so that we can check for a close brace. Otherwise we
9642 require a real statement and must go back and read one. */
9648 }
9650 {
9653 }
9655 /* Everything else must be a declaration-statement or an
9656 expression-statement. Try for the declaration-statement
9657 first, unless we are looking at a `;', in which case we know that
9658 we have an expression-statement. */
9660 {
9662 {
9664 {
9665 /* Attributes should be parsed as part of the the
9666 declaration, so let's un-parse them. */
9669 }
9672 /* Try to parse the declaration-statement. */
9674 /* If that worked, we're done. */
9677 }
9678 /* Look for an expression-statement instead. */
9680 }
9682 /* Set the line number for the statement. */
9686 /* Note that for now, we don't do anything with c++11 statements
9687 parsed at this level. */
9690 OPT_Wattributes,
9692 }
9694 /* Parse the label for a labeled-statement, i.e.
9696 identifier :
9697 case constant-expression :
9698 default :
9700 GNU Extension:
9701 case constant-expression ... constant-expression : statement
9703 When a label is parsed without errors, the label is added to the
9704 parse tree by the finish_* functions, so this function doesn't
9705 have to return the label. */
9707 static void
9709 {
9714 /* The next token should be an identifier. */
9718 {
9721 }
9725 {
9727 {
9731 /* Consume the `case' token. */
9733 /* Parse the constant-expression. */
9736 NULL);
9740 {
9741 /* Consume the `...' token. */
9743 expr_hi =
9746 NULL);
9747 /* We don't need to emit warnings here, as the common code
9748 will do this for us. */
9749 }
9750 else
9755 else
9758 expr);
9759 }
9763 /* Consume the `default' token. */
9768 else
9773 /* Anything else must be an ordinary label. */
9776 }
9778 /* Require the `:' token. */
9781 /* An ordinary label may optionally be followed by attributes.
9782 However, this is only permitted if the attributes are then
9783 followed by a semicolon. This is because, for backward
9784 compatibility, when parsing
9785 lab: __attribute__ ((unused)) int i;
9786 we want the attribute to attach to "i", not "lab". */
9789 {
9790 tree attrs;
9797 ;
9798 else
9800 }
9806 }
9808 /* Parse an expression-statement.
9810 expression-statement:
9811 expression [opt] ;
9813 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9814 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9815 indicates whether this expression-statement is part of an
9816 expression statement. */
9818 static tree
9820 {
9824 /* If the next token is a ';', then there is no expression
9825 statement. */
9827 {
9831 {
9834 }
9835 }
9837 /* Give a helpful message for "A<T>::type t;" and the like. */
9840 {
9847 {
9848 /* A::A a; */
9853 }
9854 }
9856 /* Consume the final `;'. */
9861 /* This is the final expression statement of a statement
9862 expression. */
9868 }
9870 /* Parse a compound-statement.
9872 compound-statement:
9873 { statement-seq [opt] }
9875 GNU extension:
9877 compound-statement:
9878 { label-declaration-seq [opt] statement-seq [opt] }
9880 label-declaration-seq:
9881 label-declaration
9882 label-declaration-seq label-declaration
9884 Returns a tree representing the statement. */
9886 static tree
9889 {
9890 tree compound_stmt;
9892 /* Consume the `{'. */
9899 /* Begin the compound-statement. */
9901 /* If the next keyword is `__label__' we have a label declaration. */
9904 /* Parse an (optional) statement-seq. */
9906 /* Finish the compound-statement. */
9908 /* Consume the `}'. */
9912 }
9914 /* Parse an (optional) statement-seq.
9916 statement-seq:
9917 statement
9918 statement-seq [opt] statement */
9920 static void
9922 {
9923 /* Scan statements until there aren't any more. */
9925 {
9928 /* If we are looking at a `}', then we have run out of
9929 statements; the same is true if we have reached the end
9930 of file, or have stumbled upon a stray '@end'. */
9937 /* If we are in a compound statement and find 'else' then
9938 something went wrong. */
9940 {
9943 else
9944 {
9947 }
9948 }
9950 /* Parse the statement. */
9952 }
9953 }
9955 /* Parse a selection-statement.
9957 selection-statement:
9958 if ( condition ) statement
9959 if ( condition ) statement else statement
9960 switch ( condition ) statement
9962 Returns the new IF_STMT or SWITCH_STMT.
9964 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9965 is a (possibly labeled) if statement which is not enclosed in
9966 braces and has an else clause. This is used to implement
9967 -Wparentheses. */
9969 static tree
9971 {
9978 /* Peek at the next token. */
9981 /* See what kind of keyword it is. */
9984 {
9987 {
9988 tree statement;
9989 tree condition;
9991 /* Look for the `('. */
9993 {
9996 }
9998 /* Begin the selection-statement. */
10001 else
10004 /* Parse the condition. */
10006 /* Look for the `)'. */
10012 {
10016 /* Add the condition. */
10019 /* Parse the then-clause. */
10023 {
10031 }
10032 else
10038 /* If the next token is `else', parse the else-clause. */
10040 RID_ELSE))
10041 {
10042 /* Consume the `else' keyword. */
10045 /* Parse the else-clause. */
10047 {
10048 location_t loc;
10055 }
10056 else
10061 /* If we are currently parsing a then-clause, then
10062 IF_P will not be NULL. We set it to true to
10063 indicate that this if statement has an else clause.
10064 This may trigger the Wparentheses warning below
10065 when we get back up to the parent if statement. */
10068 }
10069 else
10070 {
10071 /* This if statement does not have an else clause. If
10072 NESTED_IF is true, then the then-clause is an if
10073 statement which does have an else clause. We warn
10074 about the potential ambiguity. */
10077 "suggest explicit braces to avoid ambiguous"
10079 }
10081 /* Now we're all done with the if-statement. */
10083 }
10084 else
10085 {
10089 /* Add the condition. */
10092 /* Parse the body of the switch-statement. */
10101 /* Now we're all done with the switch-statement. */
10103 }
10106 }
10112 }
10113 }
10115 /* Parse a condition.
10117 condition:
10118 expression
10119 type-specifier-seq declarator = initializer-clause
10120 type-specifier-seq declarator braced-init-list
10122 GNU Extension:
10124 condition:
10125 type-specifier-seq declarator asm-specification [opt]
10126 attributes [opt] = assignment-expression
10128 Returns the expression that should be tested. */
10130 static tree
10132 {
10133 cp_decl_specifier_seq type_specifiers;
10137 /* Try the declaration first. */
10139 /* New types are not allowed in the type-specifier-seq for a
10140 condition. */
10142 parser->type_definition_forbidden_message
10144 /* Parse the type-specifier-seq. */
10146 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10149 /* Restore the saved message. */
10151 /* If all is well, we might be looking at a declaration. */
10153 {
10154 tree decl;
10155 tree asm_specification;
10156 tree attributes;
10160 /* Parse the declarator. */
10166 /* Parse the attributes. */
10168 /* Parse the asm-specification. */
10170 /* If the next token is not an `=' or '{', then we might still be
10171 looking at an expression. For example:
10173 if (A(a).x)
10175 looks like a decl-specifier-seq and a declarator -- but then
10176 there is no `=', so this is an expression. */
10181 /* If we did see an `=' or '{', then we are looking at a declaration
10182 for sure. */
10184 {
10185 tree pushed_scope;
10189 /* Create the declaration. */
10195 /* Parse the initializer. */
10197 {
10201 }
10202 else
10203 {
10204 /* Consume the `='. */
10207 }
10211 /* Process the initializer. */
10214 asm_specification,
10215 flags);
10221 }
10222 }
10223 /* If we didn't even get past the declarator successfully, we are
10224 definitely not looking at a declaration. */
10225 else
10228 /* Otherwise, we are looking at an expression. */
10230 }
10232 /* Parses a for-statement or range-for-statement until the closing ')',
10233 not included. */
10235 static tree
10237 {
10241 /* Begin the for-statement. */
10244 /* Parse the initialization. */
10249 else
10251 }
10253 static tree
10255 {
10256 /* Normal for loop */
10259 tree stmt;
10262 /* The for-init-statement has already been parsed in
10263 cp_parser_for_init_statement, so no work is needed here. */
10266 /* If there's a condition, process it. */
10270 {
10274 }
10276 /* Look for the `;'. */
10279 /* If there's an expression, process it. */
10285 }
10287 /* Tries to parse a range-based for-statement:
10289 range-based-for:
10290 decl-specifier-seq declarator : expression
10292 The decl-specifier-seq declarator and the `:' are already parsed by
10293 cp_parser_for_init_statement. If processing_template_decl it returns a
10294 newly created RANGE_FOR_STMT; if not, it is converted to a
10295 regular FOR_STMT. */
10297 static tree
10300 {
10304 {
10307 }
10308 else
10311 /* If in template, STMT is converted to a normal for-statement
10312 at instantiation. If not, it is done just ahead. */
10314 {
10322 /* do_auto_deduction doesn't mess with template init-lists. */
10325 }
10326 else
10327 {
10330 }
10332 }
10334 /* Subroutine of cp_convert_range_for: given the initializer expression,
10335 builds up the range temporary. */
10337 static tree
10339 {
10342 /* Find out the type deduced by the declaration
10343 `auto &&__range = range_expr'. */
10348 /* Create the __range variable. */
10355 }
10357 /* Used by cp_parser_range_for in template context: we aren't going to
10358 do a full conversion yet, but we still need to resolve auto in the
10359 type of the for-range-declaration if present. This is basically
10360 a shortcut version of cp_convert_range_for. */
10362 static void
10364 {
10367 {
10370 iter_type = (cp_parser_perform_range_for_lookup
10373 {
10375 iter_type);
10377 tf_warning_or_error);
10380 }
10381 }
10382 }
10384 /* Converts a range-based for-statement into a normal
10385 for-statement, as per the definition.
10387 for (RANGE_DECL : RANGE_EXPR)
10388 BLOCK
10390 should be equivalent to:
10392 {
10393 auto &&__range = RANGE_EXPR;
10394 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10395 __begin != __end;
10396 ++__begin)
10397 {
10398 RANGE_DECL = *__begin;
10399 BLOCK
10400 }
10401 }
10403 If RANGE_EXPR is an array:
10404 BEGIN_EXPR = __range
10405 END_EXPR = __range + ARRAY_SIZE(__range)
10406 Else if RANGE_EXPR has a member 'begin' or 'end':
10407 BEGIN_EXPR = __range.begin()
10408 END_EXPR = __range.end()
10409 Else:
10410 BEGIN_EXPR = begin(__range)
10411 END_EXPR = end(__range);
10413 If __range has a member 'begin' but not 'end', or vice versa, we must
10414 still use the second alternative (it will surely fail, however).
10415 When calling begin()/end() in the third alternative we must use
10416 argument dependent lookup, but always considering 'std' as an associated
10417 namespace. */
10419 tree
10422 {
10428 /* If an error happened previously do nothing or else a lot of
10429 unhelpful errors would be issued. */
10431 else
10432 {
10433 tree range_temp;
10437 /* Can't bind a reference to an array of runtime bound. */
10439 else
10440 {
10445 LOOKUP_ONLYCONVERTING);
10447 }
10450 }
10452 /* The new for initialization statement. */
10460 LOOKUP_ONLYCONVERTING);
10469 LOOKUP_ONLYCONVERTING);
10473 /* The new for condition. */
10480 /* The new increment expression. */
10483 tf_warning_or_error);
10486 /* The declaration is initialized with *__begin inside the loop body. */
10489 tf_warning_or_error),
10491 LOOKUP_ONLYCONVERTING);
10494 }
10496 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10497 We need to solve both at the same time because the method used
10498 depends on the existence of members begin or end.
10499 Returns the type deduced for the iterator expression. */
10501 static tree
10503 {
10505 {
10508 }
10511 {
10516 }
10518 {
10519 /* If RANGE is an array, we will use pointer arithmetic. */
10522 range,
10526 }
10527 else
10528 {
10529 /* If it is not an array, we must do a bit of magic. */
10539 tf_warning_or_error);
10542 tf_warning_or_error);
10545 {
10546 /* Use the member functions. */
10549 else
10555 else
10558 }
10559 else
10560 {
10561 /* Use global functions with ADL. */
10568 tf_warning_or_error);
10570 tf_warning_or_error);
10572 tf_warning_or_error);
10574 tf_warning_or_error);
10577 }
10579 /* Last common checks. */
10581 {
10582 /* If one of the expressions is an error do no more checks. */
10585 }
10588 /* Can happen, when, eg, in a template context, Koenig lookup
10589 can't resolve begin/end (c++/58503). */
10591 else
10592 {
10594 /* The unqualified type of the __begin and __end temporaries should
10595 be the same, as required by the multiple auto declaration. */
10601 }
10602 }
10603 }
10605 /* Helper function for cp_parser_perform_range_for_lookup.
10606 Builds a tree for RANGE.IDENTIFIER(). */
10608 static tree
10610 {
10623 tf_warning_or_error);
10626 }
10628 /* Parse an iteration-statement.
10630 iteration-statement:
10631 while ( condition ) statement
10632 do statement while ( expression ) ;
10633 for ( for-init-statement condition [opt] ; expression [opt] )
10634 statement
10636 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10638 static tree
10640 {
10643 tree statement;
10646 /* Peek at the next token. */
10651 /* Remember whether or not we are already within an iteration
10652 statement. */
10655 /* See what kind of keyword it is. */
10658 {
10660 {
10661 tree condition;
10663 /* Begin the while-statement. */
10665 /* Look for the `('. */
10667 /* Parse the condition. */
10670 /* Look for the `)'. */
10672 /* Parse the dependent statement. */
10676 /* We're done with the while-statement. */
10678 }
10682 {
10683 tree expression;
10685 /* Begin the do-statement. */
10687 /* Parse the body of the do-statement. */
10692 /* Look for the `while' keyword. */
10694 /* Look for the `('. */
10696 /* Parse the expression. */
10698 /* We're done with the do-statement. */
10700 /* Look for the `)'. */
10702 /* Look for the `;'. */
10704 }
10708 {
10709 /* Look for the `('. */
10714 /* Look for the `)'. */
10717 /* Parse the body of the for-statement. */
10722 /* We're done with the for-statement. */
10724 }
10731 }
10734 }
10736 /* Parse a for-init-statement or the declarator of a range-based-for.
10737 Returns true if a range-based-for declaration is seen.
10739 for-init-statement:
10740 expression-statement
10741 simple-declaration */
10743 static bool
10745 {
10746 /* If the next token is a `;', then we have an empty
10747 expression-statement. Grammatically, this is also a
10748 simple-declaration, but an invalid one, because it does not
10749 declare anything. Therefore, if we did not handle this case
10750 specially, we would issue an error message about an invalid
10751 declaration. */
10753 {
10759 {
10760 /* N3994 -- for (id : init) ... */
10763 "type-specifier only available with "
10771 }
10773 /* A colon is used in range-based for. */
10776 /* We're going to speculatively look for a declaration, falling back
10777 to an expression, if necessary. */
10779 /* Parse the declaration. */
10782 decl);
10785 {
10786 /* It is a range-for, consume the ':' */
10790 {
10792 "range-based %<for%> loops only available with "
10795 }
10796 }
10797 else
10798 /* The ';' is not consumed yet because we told
10799 cp_parser_simple_declaration not to. */
10804 /* If the tentative parse failed, then we shall need to look for an
10805 expression-statement. */
10806 }
10807 /* If we are here, it is an expression-statement. */
10810 }
10812 /* Parse a jump-statement.
10814 jump-statement:
10815 break ;
10816 continue ;
10817 return expression [opt] ;
10818 return braced-init-list ;
10819 goto identifier ;
10821 GNU extension:
10823 jump-statement:
10824 goto * expression ;
10826 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10828 static tree
10830 {
10836 /* Peek at the next token. */
10841 /* See what kind of keyword it is. */
10844 {
10848 {
10868 }
10874 {
10881 /* Fall through. */
10891 }
10896 {
10897 tree expr;
10901 {
10905 }
10908 else
10909 /* If the next token is a `;', then there is no
10910 expression. */
10912 /* Build the return-statement. */
10914 /* Look for the final `;'. */
10916 }
10920 /* Create the goto-statement. */
10922 {
10923 /* Issue a warning about this use of a GNU extension. */
10925 /* Consume the '*' token. */
10927 /* Parse the dependent expression. */
10929 }
10930 else
10932 /* Look for the final `;'. */
10939 }
10942 }
10944 /* Parse a declaration-statement.
10946 declaration-statement:
10947 block-declaration */
10949 static void
10951 {
10954 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10957 /* Parse the block-declaration. */
10960 /* Free any declarators allocated. */
10962 }
10964 /* Some dependent statements (like `if (cond) statement'), are
10965 implicitly in their own scope. In other words, if the statement is
10966 a single statement (as opposed to a compound-statement), it is
10967 none-the-less treated as if it were enclosed in braces. Any
10968 declarations appearing in the dependent statement are out of scope
10969 after control passes that point. This function parses a statement,
10970 but ensures that is in its own scope, even if it is not a
10971 compound-statement.
10973 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10974 is a (possibly labeled) if statement which is not enclosed in
10975 braces and has an else clause. This is used to implement
10976 -Wparentheses.
10978 Returns the new statement. */
10980 static tree
10982 {
10983 tree statement;
10988 /* Mark if () ; with a special NOP_EXPR. */
10990 {
10994 }
10995 /* if a compound is opened, we simply parse the statement directly. */
10998 /* If the token is not a `{', then we must take special action. */
10999 else
11000 {
11001 /* Create a compound-statement. */
11003 /* Parse the dependent-statement. */
11005 /* Finish the dummy compound-statement. */
11007 }
11009 /* Return the statement. */
11011 }
11013 /* For some dependent statements (like `while (cond) statement'), we
11014 have already created a scope. Therefore, even if the dependent
11015 statement is a compound-statement, we do not want to create another
11016 scope. */
11018 static void
11020 {
11021 /* If the token is a `{', then we must take special action. */
11024 else
11025 {
11026 /* Avoid calling cp_parser_compound_statement, so that we
11027 don't create a new scope. Do everything else by hand. */
11029 /* If the next keyword is `__label__' we have a label declaration. */
11032 /* Parse an (optional) statement-seq. */
11035 }
11036 }
11038 /* Declarations [gram.dcl.dcl] */
11040 /* Parse an optional declaration-sequence.
11042 declaration-seq:
11043 declaration
11044 declaration-seq declaration */
11046 static void
11048 {
11050 {
11061 {
11062 /* A declaration consisting of a single semicolon is
11063 invalid. Allow it unless we're being pedantic. */
11068 }
11070 /* If we're entering or exiting a region that's implicitly
11071 extern "C", modify the lang context appropriately. */
11073 {
11076 }
11078 {
11081 }
11084 {
11085 /* A top-level declaration can consist solely of a #pragma.
11086 A nested declaration cannot, so this is done here and not
11087 in cp_parser_declaration. (A #pragma at block scope is
11088 handled in cp_parser_statement.) */
11091 }
11093 /* Parse the declaration itself. */
11095 }
11096 }
11098 /* Parse a declaration.
11100 declaration:
11101 block-declaration
11102 function-definition
11103 template-declaration
11104 explicit-instantiation
11105 explicit-specialization
11106 linkage-specification
11107 namespace-definition
11109 GNU extension:
11111 declaration:
11112 __extension__ declaration */
11114 static void
11116 {
11117 cp_token token1;
11118 cp_token token2;
11123 /* Check for the `__extension__' keyword. */
11125 {
11126 /* Parse the qualified declaration. */
11128 /* Restore the PEDANTIC flag. */
11132 }
11134 /* Try to figure out what kind of declaration is present. */
11139 else
11140 {
11143 }
11145 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11148 /* If the next token is `extern' and the following token is a string
11149 literal, then we have a linkage specification. */
11153 /* If the next token is `template', then we have either a template
11154 declaration, an explicit instantiation, or an explicit
11155 specialization. */
11157 {
11158 /* `template <>' indicates a template specialization. */
11162 /* `template <' indicates a template declaration. */
11165 /* Anything else must be an explicit instantiation. */
11166 else
11168 }
11169 /* If the next token is `export', then we have a template
11170 declaration. */
11173 /* If the next token is `extern', 'static' or 'inline' and the one
11174 after that is `template', we have a GNU extended explicit
11175 instantiation directive. */
11182 /* If the next token is `namespace', check for a named or unnamed
11183 namespace definition. */
11189 /* An unnamed namespace definition. */
11193 /* An inline (associated) namespace definition. */
11197 /* Objective-C++ declaration/definition. */
11204 /* We must have either a block declaration or a function
11205 definition. */
11206 else
11207 /* Try to parse a block-declaration, or a function-definition. */
11210 /* Free any declarators allocated. */
11212 }
11214 /* Parse a block-declaration.
11216 block-declaration:
11217 simple-declaration
11218 asm-definition
11219 namespace-alias-definition
11220 using-declaration
11221 using-directive
11223 GNU Extension:
11225 block-declaration:
11226 __extension__ block-declaration
11228 C++0x Extension:
11230 block-declaration:
11231 static_assert-declaration
11233 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11234 part of a declaration-statement. */
11236 static void
11239 {
11243 /* Check for the `__extension__' keyword. */
11245 {
11246 /* Parse the qualified declaration. */
11248 /* Restore the PEDANTIC flag. */
11252 }
11254 /* Peek at the next token to figure out which kind of declaration is
11255 present. */
11258 /* If the next keyword is `asm', we have an asm-definition. */
11260 {
11264 }
11265 /* If the next keyword is `namespace', we have a
11266 namespace-alias-definition. */
11269 /* If the next keyword is `using', we have a
11270 using-declaration, a using-directive, or an alias-declaration. */
11272 {
11277 /* If the token after `using' is `namespace', then we have a
11278 using-directive. */
11282 /* If the second token after 'using' is '=', then we have an
11283 alias-declaration. */
11289 /* Otherwise, it's a using-declaration. */
11290 else
11293 }
11294 /* If the next keyword is `__label__' we have a misplaced label
11295 declaration. */
11297 {
11301 /* If the next token is now a `;', consume it. */
11304 }
11305 /* If the next token is `static_assert' we have a static assertion. */
11308 /* Anything else must be a simple-declaration. */
11309 else
11312 }
11314 /* Parse a simple-declaration.
11316 simple-declaration:
11317 decl-specifier-seq [opt] init-declarator-list [opt] ;
11319 init-declarator-list:
11320 init-declarator
11321 init-declarator-list , init-declarator
11323 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11324 function-definition as a simple-declaration.
11326 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11327 parsed declaration if it is an uninitialized single declarator not followed
11328 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11329 if present, will not be consumed. */
11331 static void
11335 {
11336 cp_decl_specifier_seq decl_specifiers;
11343 /* Defer access checks until we know what is being declared; the
11344 checks for names appearing in the decl-specifier-seq should be
11345 done as if we were in the scope of the thing being declared. */
11348 /* Parse the decl-specifier-seq. We have to keep track of whether
11349 or not the decl-specifier-seq declares a named class or
11350 enumeration type, since that is the only case in which the
11351 init-declarator-list is allowed to be empty.
11353 [dcl.dcl]
11355 In a simple-declaration, the optional init-declarator-list can be
11356 omitted only when declaring a class or enumeration, that is when
11357 the decl-specifier-seq contains either a class-specifier, an
11358 elaborated-type-specifier, or an enum-specifier. */
11360 CP_PARSER_FLAGS_OPTIONAL,
11363 /* We no longer need to defer access checks. */
11366 /* In a block scope, a valid declaration must always have a
11367 decl-specifier-seq. By not trying to parse declarators, we can
11368 resolve the declaration/expression ambiguity more quickly. */
11371 {
11374 }
11376 /* If the next two tokens are both identifiers, the code is
11377 erroneous. The usual cause of this situation is code like:
11379 T t;
11381 where "T" should name a type -- but does not. */
11384 {
11385 /* If parsing tentatively, we should commit; we really are
11386 looking at a declaration. */
11388 /* Give up. */
11390 }
11392 /* If we have seen at least one decl-specifier, and the next token
11393 is not a parenthesis, then we must be looking at a declaration.
11394 (After "int (" we might be looking at a functional cast.) */
11401 /* Keep going until we hit the `;' at the end of the simple
11402 declaration. */
11405 CPP_SEMICOLON))
11406 {
11409 tree decl;
11412 {
11413 /* If we are processing next declarator, coma is expected */
11419 }
11420 else
11423 /* Parse the init-declarator. */
11426 function_definition_allowed_p,
11428 declares_class_or_enum,
11430 maybe_range_for_decl);
11431 /* If an error occurred while parsing tentatively, exit quickly.
11432 (That usually happens when in the body of a function; each
11433 statement is treated as a declaration-statement until proven
11434 otherwise.) */
11437 /* Handle function definitions specially. */
11439 {
11440 /* If the next token is a `,', then we are probably
11441 processing something like:
11443 void f() {}, *p;
11445 which is erroneous. */
11447 {
11450 "mixing"
11452 }
11453 /* Otherwise, we're done with the list of declarators. */
11454 else
11455 {
11458 }
11459 }
11462 /* The next token should be either a `,' or a `;'. */
11464 /* If it's a `,', there are more declarators to come. */
11467 /* If it's a `;', we are done. */
11470 /* Anything else is an error. */
11471 else
11472 {
11473 /* If we have already issued an error message we don't need
11474 to issue another one. */
11478 /* Skip tokens until we reach the end of the statement. */
11480 /* If the next token is now a `;', consume it. */
11484 }
11485 /* After the first time around, a function-definition is not
11486 allowed -- even if it was OK at first. For example:
11488 int i, f() {}
11490 is not valid. */
11492 }
11494 /* Issue an error message if no declarators are present, and the
11495 decl-specifier-seq does not itself declare a class or
11496 enumeration: [dcl.dcl]/3. */
11498 {
11500 {
11504 /* Ensure an error is issued anyway when finish_decltype_type,
11505 called via cp_parser_decl_specifier_seq, returns a class or
11506 an enumeration (c++/51786). */
11509 }
11510 /* Perform any deferred access checks. */
11512 }
11514 /* Consume the `;'. */
11518 done:
11520 }
11522 /* Parse a decl-specifier-seq.
11524 decl-specifier-seq:
11525 decl-specifier-seq [opt] decl-specifier
11526 decl-specifier attribute-specifier-seq [opt] (C++11)
11528 decl-specifier:
11529 storage-class-specifier
11530 type-specifier
11531 function-specifier
11532 friend
11533 typedef
11535 GNU Extension:
11537 decl-specifier:
11538 attributes
11540 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11542 The parser flags FLAGS is used to control type-specifier parsing.
11544 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11545 flags:
11547 1: one of the decl-specifiers is an elaborated-type-specifier
11548 (i.e., a type declaration)
11549 2: one of the decl-specifiers is an enum-specifier or a
11550 class-specifier (i.e., a type definition)
11552 */
11554 static void
11556 cp_parser_flags flags,
11559 {
11563 cp_decl_spec ds;
11565 /* Clear DECL_SPECS. */
11568 /* Assume no class or enumeration type is declared. */
11571 /* Keep reading specifiers until there are no more to read. */
11573 {
11578 /* Peek at the next token. */
11581 /* Save the first token of the decl spec list for error
11582 reporting. */
11585 /* Handle attributes. */
11587 {
11588 /* Parse the attributes. */
11591 /* In a sequence of declaration specifiers, c++11 attributes
11592 appertain to the type that precede them. In that case
11593 [dcl.spec]/1 says:
11595 The attribute-specifier-seq affects the type only for
11596 the declaration it appears in, not other declarations
11597 involving the same type.
11599 But for now let's force the user to position the
11600 attribute either at the beginning of the declaration or
11601 after the declarator-id, which would clearly mean that it
11602 applies to the declarator. */
11604 {
11606 /* The c++11 attribute is at the beginning of the
11607 declaration. It appertains to the entity being
11609 else
11610 {
11612 {
11613 /* This is an attribute following a
11614 class-specifier. */
11619 }
11620 else
11621 {
11622 decl_specs->std_attributes
11624 attrs);
11627 }
11629 }
11630 }
11632 decl_specs->attributes
11634 attrs);
11638 }
11639 /* Assume we will find a decl-specifier keyword. */
11641 /* If the next token is an appropriate keyword, we can simply
11642 add it to the list. */
11644 {
11645 /* decl-specifier:
11646 friend
11647 constexpr */
11650 {
11653 }
11654 else
11655 {
11657 /* Consume the token. */
11659 }
11667 /* function-specifier:
11668 inline
11669 virtual
11670 explicit */
11677 /* decl-specifier:
11678 typedef */
11681 /* Consume the token. */
11683 /* A constructor declarator cannot appear in a typedef. */
11685 /* The "typedef" keyword can only occur in a declaration; we
11686 may as well commit at this point. */
11693 /* storage-class-specifier:
11694 auto
11695 register
11696 static
11697 extern
11698 mutable
11700 GNU Extension:
11701 thread */
11704 {
11705 /* Consume the token. */
11708 /* Complain about `auto' as a storage specifier, if
11709 we're complaining about C++0x compatibility. */
11713 /* Set the storage class anyway. */
11715 token);
11716 }
11717 else
11718 /* C++0x auto type-specifier. */
11726 /* Consume the token. */
11729 token);
11732 /* Consume the token. */
11738 /* We did not yet find a decl-specifier yet. */
11741 }
11751 /* Constructors are a special case. The `S' in `S()' is not a
11752 decl-specifier; it is the beginning of the declarator. */
11753 constructor_p
11754 = (!found_decl_spec
11755 && constructor_possible_p
11756 && (cp_parser_constructor_declarator_p
11759 /* If we don't have a DECL_SPEC yet, then we must be looking at
11760 a type-specifier. */
11762 {
11765 tree type_spec;
11767 type_spec
11769 decl_specs,
11775 /* If this type-specifier referenced a user-defined type
11776 (a typedef, class-name, etc.), then we can't allow any
11777 more such type-specifiers henceforth.
11779 [dcl.spec]
11781 The longest sequence of decl-specifiers that could
11782 possibly be a type name is taken as the
11783 decl-specifier-seq of a declaration. The sequence shall
11784 be self-consistent as described below.
11786 [dcl.type]
11788 As a general rule, at most one type-specifier is allowed
11789 in the complete decl-specifier-seq of a declaration. The
11790 only exceptions are the following:
11792 -- const or volatile can be combined with any other
11793 type-specifier.
11795 -- signed or unsigned can be combined with char, long,
11796 short, or int.
11798 -- ..
11800 Example:
11802 typedef char* Pc;
11803 void g (const int Pc);
11805 Here, Pc is *not* part of the decl-specifier seq; it's
11806 the declarator. Therefore, once we see a type-specifier
11807 (other than a cv-qualifier), we forbid any additional
11808 user-defined types. We *do* still allow things like `int
11809 int' to be considered a decl-specifier-seq, and issue the
11810 error message later. */
11813 /* A constructor declarator cannot follow a type-specifier. */
11815 {
11820 }
11821 }
11823 /* If we still do not have a DECL_SPEC, then there are no more
11824 decl-specifiers. */
11829 /* After we see one decl-specifier, further decl-specifiers are
11830 always optional. */
11832 }
11834 /* Don't allow a friend specifier with a class definition. */
11839 }
11841 /* Parse an (optional) storage-class-specifier.
11843 storage-class-specifier:
11844 auto
11845 register
11846 static
11847 extern
11848 mutable
11850 GNU Extension:
11852 storage-class-specifier:
11853 thread
11855 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11857 static tree
11859 {
11861 {
11865 /* Fall through for C++98. */
11872 /* Consume the token. */
11877 }
11878 }
11880 /* Parse an (optional) function-specifier.
11882 function-specifier:
11883 inline
11884 virtual
11885 explicit
11887 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11888 Updates DECL_SPECS, if it is non-NULL. */
11890 static tree
11893 {
11896 {
11902 /* 14.5.2.3 [temp.mem]
11904 A member function template shall not be virtual. */
11907 else
11917 }
11919 /* Consume the token. */
11921 }
11923 /* Parse a linkage-specification.
11925 linkage-specification:
11926 extern string-literal { declaration-seq [opt] }
11927 extern string-literal declaration */
11929 static void
11931 {
11932 tree linkage;
11934 /* Look for the `extern' keyword. */
11937 /* Look for the string-literal. */
11940 /* Transform the literal into an identifier. If the literal is a
11941 wide-character string, or contains embedded NULs, then we can't
11942 handle it as the user wants. */
11945 {
11947 /* Assume C++ linkage. */
11949 }
11950 else
11953 /* We're now using the new linkage. */
11956 /* If the next token is a `{', then we're using the first
11957 production. */
11959 {
11962 /* Consume the `{' token. */
11964 /* Parse the declarations. */
11966 /* Look for the closing `}'. */
11968 }
11969 /* Otherwise, there's just one declaration. */
11970 else
11971 {
11974 saved_in_unbraced_linkage_specification_p
11978 parser->in_unbraced_linkage_specification_p
11980 }
11982 /* We're done with the linkage-specification. */
11984 }
11986 /* Parse a static_assert-declaration.
11988 static_assert-declaration:
11989 static_assert ( constant-expression , string-literal ) ;
11991 If MEMBER_P, this static_assert is a class member. */
11993 static void
11995 {
11996 tree condition;
11997 tree message;
11999 location_t saved_loc;
12002 /* Peek at the `static_assert' token so we can keep track of exactly
12003 where the static assertion started. */
12007 /* Look for the `static_assert' keyword. */
12009 RT_STATIC_ASSERT))
12012 /* We know we are in a static assertion; commit to any tentative
12013 parse. */
12017 /* Parse the `(' starting the static assertion condition. */
12020 /* Parse the constant-expression. Allow a non-constant expression
12021 here in order to give better diagnostics in finish_static_assert. */
12022 condition =
12027 /* Parse the separating `,'. */
12030 /* Parse the string-literal message. */
12035 /* A `)' completes the static assertion. */
12042 /* A semicolon terminates the declaration. */
12045 /* Complete the static assertion, which may mean either processing
12046 the static assert now or saving it for template instantiation. */
12048 }
12050 /* Parse the expression in decltype ( expression ). */
12052 static tree
12055 {
12057 tree expr;
12059 /* First, try parsing an id-expression. */
12070 {
12073 cp_id_kind idk;
12077 /* Lookup the name we got back from the id-expression. */
12088 {
12089 /* Complete lookup of the id-expression. */
12090 expr = (finish_id_expression
12103 /* We found an id-expression, but it was something that we
12104 should not have found. This is an error, not something
12105 we can recover from, so note that we found an
12106 id-expression and we'll recover as gracefully as
12107 possible. */
12109 }
12114 /* We have an id-expression. */
12116 }
12119 {
12120 /* Abort the id-expression parse. */
12123 /* Parsing tentatively, again. */
12126 /* Parse a class member access. */
12134 /* We have an id-expression. */
12136 }
12139 /* We have parsed the complete id-expression or member access. */
12141 else
12142 {
12143 /* Abort our attempt to parse an id-expression or member access
12144 expression. */
12147 /* Parse a full expression. */
12150 }
12153 }
12155 /* Parse a `decltype' type. Returns the type.
12157 simple-type-specifier:
12158 decltype ( expression )
12159 C++14 proposal:
12160 decltype ( auto ) */
12162 static tree
12164 {
12165 tree expr;
12174 {
12175 /* Already parsed. */
12178 }
12180 /* Look for the `decltype' token. */
12184 /* Parse the opening `('. */
12188 /* decltype (auto) */
12191 {
12198 }
12200 /* Types cannot be defined in a `decltype' expression. Save away the
12201 old message. */
12204 /* And create the new one. */
12205 parser->type_definition_forbidden_message
12208 /* The restrictions on constant-expressions do not apply inside
12209 decltype expressions. */
12210 saved_integral_constant_expression_p
12212 saved_non_integral_constant_expression_p
12216 /* Within a parenthesized expression, a `>' token is always
12217 the greater-than operator. */
12218 saved_greater_than_is_operator_p
12222 /* Do not actually evaluate the expression. */
12225 /* Do not warn about problems with the expression. */
12230 /* Go back to evaluating expressions. */
12234 /* The `>' token might be the end of a template-id or
12235 template-parameter-list now. */
12236 parser->greater_than_is_operator_p
12239 /* Restore the old message and the integral constant expression
12240 flags. */
12242 parser->integral_constant_expression_p
12244 parser->non_integral_constant_expression_p
12247 /* Parse to the closing `)'. */
12249 {
12253 }
12256 tf_warning_or_error);
12258 rewrite:
12259 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12260 it again. */
12267 }
12269 /* Special member functions [gram.special] */
12271 /* Parse a conversion-function-id.
12273 conversion-function-id:
12274 operator conversion-type-id
12276 Returns an IDENTIFIER_NODE representing the operator. */
12278 static tree
12280 {
12281 tree type;
12282 tree saved_scope;
12283 tree saved_qualifying_scope;
12284 tree saved_object_scope;
12287 /* Look for the `operator' token. */
12290 /* When we parse the conversion-type-id, the current scope will be
12291 reset. However, we need that information in able to look up the
12292 conversion function later, so we save it here. */
12296 /* We must enter the scope of the class so that the names of
12297 entities declared within the class are available in the
12298 conversion-type-id. For example, consider:
12300 struct S {
12301 typedef int I;
12302 operator I();
12303 };
12305 S::operator I() { ... }
12307 In order to see that `I' is a type-name in the definition, we
12308 must be in the scope of `S'. */
12311 /* Parse the conversion-type-id. */
12313 /* Leave the scope of the class, if any. */
12316 /* Restore the saved scope. */
12320 /* If the TYPE is invalid, indicate failure. */
12324 }
12326 /* Parse a conversion-type-id:
12328 conversion-type-id:
12329 type-specifier-seq conversion-declarator [opt]
12331 Returns the TYPE specified. */
12333 static tree
12335 {
12336 tree attributes;
12337 cp_decl_specifier_seq type_specifiers;
12339 tree type_specified;
12342 /* Parse the attributes. */
12346 parser->type_definition_forbidden_message
12349 /* Parse the type-specifiers. */
12356 /* If that didn't work, stop. */
12359 /* Parse the conversion-declarator. */
12367 /* Don't give this error when parsing tentatively. This happens to
12368 work because we always parse this definitively once. */
12371 {
12373 {
12376 }
12380 }
12383 }
12385 /* Parse an (optional) conversion-declarator.
12387 conversion-declarator:
12388 ptr-operator conversion-declarator [opt]
12390 */
12394 {
12397 cp_cv_quals cv_quals;
12399 /* We don't know if there's a ptr-operator next, or not. */
12401 /* Try the ptr-operator. */
12404 /* If it worked, look for more conversion-declarators. */
12406 {
12409 /* Parse another optional declarator. */
12412 declarator = cp_parser_make_indirect_declarator
12416 }
12419 }
12421 /* Parse an (optional) ctor-initializer.
12423 ctor-initializer:
12424 : mem-initializer-list
12426 Returns TRUE iff the ctor-initializer was actually present. */
12428 static bool
12430 {
12431 /* If the next token is not a `:', then there is no
12432 ctor-initializer. */
12434 {
12435 /* Do default initialization of any bases and members. */
12440 }
12442 /* Consume the `:' token. */
12444 /* And the mem-initializer-list. */
12448 }
12450 /* Parse a mem-initializer-list.
12452 mem-initializer-list:
12453 mem-initializer ... [opt]
12454 mem-initializer ... [opt] , mem-initializer-list */
12456 static void
12458 {
12463 /* Let the semantic analysis code know that we are starting the
12464 mem-initializer-list. */
12469 /* Loop through the list. */
12471 {
12472 tree mem_initializer;
12475 /* Parse the mem-initializer. */
12477 /* If the next token is a `...', we're expanding member initializers. */
12479 {
12480 /* Consume the `...'. */
12483 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12484 can be expanded but members cannot. */
12487 {
12492 }
12494 /* Construct the pack expansion type. */
12497 }
12500 {
12504 }
12505 /* Look for a target constructor. */
12509 {
12512 {
12516 }
12518 }
12519 /* Add it to the list, unless it was erroneous. */
12521 {
12524 }
12525 /* If the next token is not a `,', we're done. */
12528 /* Consume the `,' token. */
12530 }
12532 /* Perform semantic analysis. */
12535 }
12537 /* Parse a mem-initializer.
12539 mem-initializer:
12540 mem-initializer-id ( expression-list [opt] )
12541 mem-initializer-id braced-init-list
12543 GNU extension:
12545 mem-initializer:
12546 ( expression-list [opt] )
12548 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12549 class) or FIELD_DECL (for a non-static data member) to initialize;
12550 the TREE_VALUE is the expression-list. An empty initialization
12551 list is represented by void_list_node. */
12553 static tree
12555 {
12556 tree mem_initializer_id;
12557 tree expression_list;
12558 tree member;
12561 /* Find out what is being initialized. */
12563 {
12567 }
12568 else
12569 {
12573 }
12579 {
12586 }
12587 else
12588 {
12598 }
12608 }
12610 /* Parse a mem-initializer-id.
12612 mem-initializer-id:
12613 :: [opt] nested-name-specifier [opt] class-name
12614 identifier
12616 Returns a TYPE indicating the class to be initializer for the first
12617 production. Returns an IDENTIFIER_NODE indicating the data member
12618 to be initialized for the second production. */
12620 static tree
12622 {
12626 tree id;
12630 /* `typename' is not allowed in this context ([temp.res]). */
12632 {
12634 "keyword %<typename%> not allowed in this context (a qualified "
12637 }
12638 /* Look for the optional `::' operator. */
12639 global_scope_p
12643 /* Look for the optional nested-name-specifier. The simplest way to
12644 implement:
12646 [temp.res]
12648 The keyword `typename' is not permitted in a base-specifier or
12649 mem-initializer; in these contexts a qualified name that
12650 depends on a template-parameter is implicitly assumed to be a
12651 type name.
12653 is to assume that we have seen the `typename' keyword at this
12654 point. */
12655 nested_name_specifier_p
12664 /* If there is a `::' operator or a nested-name-specifier, then we
12665 are definitely looking for a class-name. */
12670 typename_type,
12674 /* Otherwise, we could also be looking for an ordinary identifier. */
12676 /* Try a class-name. */
12680 none_type,
12684 /* If we found one, we're done. */
12687 /* Otherwise, look for an ordinary identifier. */
12689 }
12691 /* Overloading [gram.over] */
12693 /* Parse an operator-function-id.
12695 operator-function-id:
12696 operator operator
12698 Returns an IDENTIFIER_NODE for the operator which is a
12699 human-readable spelling of the identifier, e.g., `operator +'. */
12701 static tree
12703 {
12704 /* Look for the `operator' keyword. */
12707 /* And then the name of the operator itself. */
12709 }
12711 /* Return an identifier node for a user-defined literal operator.
12712 The suffix identifier is chained to the operator name identifier. */
12714 static tree
12716 {
12717 tree identifier;
12724 }
12726 /* Parse an operator.
12728 operator:
12729 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12730 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12731 || ++ -- , ->* -> () []
12733 GNU Extensions:
12735 operator:
12736 <? >? <?= >?=
12738 Returns an IDENTIFIER_NODE for the operator which is a
12739 human-readable spelling of the identifier, e.g., `operator +'. */
12741 static tree
12743 {
12748 /* Peek at the next token. */
12750 /* Figure out which operator we have. */
12752 {
12754 {
12757 /* The keyword should be either `new' or `delete'. */
12762 else
12765 /* Consume the `new' or `delete' token. */
12768 /* Peek at the next token. */
12770 /* If it's a `[' token then this is the array variant of the
12771 operator. */
12773 {
12774 /* Consume the `[' token. */
12776 /* Look for the `]' token. */
12780 }
12781 /* Otherwise, we have the non-array variant. */
12782 else
12786 }
12933 /* Consume the `('. */
12935 /* Look for the matching `)'. */
12940 /* Consume the `['. */
12942 /* Look for the matching `]'. */
12957 {
12964 /* Consume the string. */
12970 {
12973 }
12974 else
12975 {
12977 /* Look for the suffix identifier. */
12982 {
12986 }
12987 else
12988 {
12991 }
12992 }
12997 {
13000 }
13003 {
13006 }
13008 {
13011 }
13013 }
13016 /* Anything else is an error. */
13018 }
13020 /* If we have selected an identifier, we need to consume the
13021 operator token. */
13024 /* Otherwise, no valid operator name was present. */
13025 else
13026 {
13029 }
13032 }
13034 /* Parse a template-declaration.
13036 template-declaration:
13037 export [opt] template < template-parameter-list > declaration
13039 If MEMBER_P is TRUE, this template-declaration occurs within a
13040 class-specifier.
13042 The grammar rule given by the standard isn't correct. What
13043 is really meant is:
13045 template-declaration:
13046 export [opt] template-parameter-list-seq
13047 decl-specifier-seq [opt] init-declarator [opt] ;
13048 export [opt] template-parameter-list-seq
13049 function-definition
13051 template-parameter-list-seq:
13052 template-parameter-list-seq [opt]
13053 template < template-parameter-list > */
13055 static void
13057 {
13058 /* Check for `export'. */
13060 {
13061 /* Consume the `export' token. */
13063 /* Warn that we do not support `export'. */
13065 }
13068 }
13070 /* Parse a template-parameter-list.
13072 template-parameter-list:
13073 template-parameter
13074 template-parameter-list , template-parameter
13076 Returns a TREE_LIST. Each node represents a template parameter.
13077 The nodes are connected via their TREE_CHAINs. */
13079 static tree
13081 {
13086 /* The loop below parses the template parms. We first need to know
13087 the total number of template parms to be able to compute proper
13088 canonical types of each dependent type. So after the loop, when
13089 we know the total number of template parms,
13090 end_template_parm_list computes the proper canonical types and
13091 fixes up the dependent types accordingly. */
13093 {
13094 tree parameter;
13097 location_t parm_loc;
13099 /* Parse the template-parameter. */
13104 /* Add it to the list. */
13107 parm_loc,
13108 parameter,
13109 is_non_type,
13110 is_parameter_pack);
13111 else
13112 {
13115 }
13117 /* If the next token is not a `,', we're done. */
13120 /* Otherwise, consume the `,' token. */
13122 }
13125 }
13127 /* Parse a template-parameter.
13129 template-parameter:
13130 type-parameter
13131 parameter-declaration
13133 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13134 the parameter. The TREE_PURPOSE is the default value, if any.
13135 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13136 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13137 set to true iff this parameter is a parameter pack. */
13139 static tree
13142 {
13146 tree parm;
13148 /* Assume it is a type parameter or a template parameter. */
13150 /* Assume it not a parameter pack. */
13152 /* Peek at the next token. */
13154 /* If it is `class' or `template', we have a type-parameter. */
13157 /* If it is `class' or `typename' we do not know yet whether it is a
13158 type parameter or a non-type parameter. Consider:
13160 template <typename T, typename T::X X> ...
13162 or:
13164 template <class C, class D*> ...
13166 Here, the first parameter is a type parameter, and the second is
13167 a non-type parameter. We can tell by looking at the token after
13168 the identifier -- if it is a `,', `=', or `>' then we have a type
13169 parameter. */
13171 {
13172 /* Peek at the token after `class' or `typename'. */
13174 /* If it's an ellipsis, we have a template type parameter
13175 pack. */
13178 /* If it's an identifier, skip it. */
13181 /* Now, see if the token looks like the end of a template
13182 parameter. */
13187 }
13189 /* Otherwise, it is a non-type parameter.
13191 [temp.param]
13193 When parsing a default template-argument for a non-type
13194 template-parameter, the first non-nested `>' is taken as the end
13195 of the template parameter-list rather than a greater-than
13196 operator. */
13198 parameter_declarator
13205 /* If the parameter declaration is marked as a parameter pack, set
13206 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13207 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13208 grokdeclarator. */
13211 {
13214 }
13217 {
13218 /* Can happen in some cases of erroneous input (c++/34892). */
13220 /* Consume the `...' for better error recovery. */
13222 }
13223 /* If the next token is an ellipsis, and we don't already have it
13224 marked as a parameter pack, then we have a parameter pack (that
13225 has no declarator). */
13228 && (declarator_can_be_parameter_pack
13230 {
13231 /* Consume the `...'. */
13236 }
13237 /* We might end up with a pack expansion as the type of the non-type
13238 template parameter, in which case this is a non-type template
13239 parameter pack. */
13242 {
13246 }
13249 {
13250 /* Parameter packs cannot have default arguments. However, a
13251 user may try to do so, so we'll parse them and give an
13252 appropriate diagnostic here. */
13256 /* Find the name of the parameter pack. */
13265 else
13269 /* Parse the default argument, but throw away the result. */
13271 }
13281 }
13283 /* Parse a type-parameter.
13285 type-parameter:
13286 class identifier [opt]
13287 class identifier [opt] = type-id
13288 typename identifier [opt]
13289 typename identifier [opt] = type-id
13290 template < template-parameter-list > class identifier [opt]
13291 template < template-parameter-list > class identifier [opt]
13292 = id-expression
13294 GNU Extension (variadic templates):
13296 type-parameter:
13297 class ... identifier [opt]
13298 typename ... identifier [opt]
13300 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13301 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13302 the declaration of the parameter.
13304 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13306 static tree
13308 {
13310 tree parameter;
13312 /* Look for a keyword to tell us what kind of parameter this is. */
13318 {
13321 {
13322 tree identifier;
13323 tree default_argument;
13325 /* If the next token is an ellipsis, we have a template
13326 argument pack. */
13328 {
13329 /* Consume the `...' token. */
13334 }
13336 /* If the next token is an identifier, then it names the
13337 parameter. */
13340 else
13343 /* Create the parameter. */
13346 /* If the next token is an `=', we have a default argument. */
13348 {
13349 /* Consume the `=' token. */
13351 /* Parse the default-argument. */
13355 /* Template parameter packs cannot have default
13356 arguments. */
13358 {
13361 "template parameter pack %qD cannot have a "
13363 else
13365 "template parameter packs cannot have "
13368 }
13370 }
13371 else
13374 /* Create the combined representation of the parameter and the
13375 default argument. */
13377 }
13381 {
13382 tree identifier;
13383 tree default_argument;
13385 /* Look for the `<'. */
13387 /* Parse the template-parameter-list. */
13389 /* Look for the `>'. */
13391 /* Look for the `class' or 'typename' keywords. */
13393 /* If the next token is an ellipsis, we have a template
13394 argument pack. */
13396 {
13397 /* Consume the `...' token. */
13402 }
13403 /* If the next token is an `=', then there is a
13404 default-argument. If the next token is a `>', we are at
13405 the end of the parameter-list. If the next token is a `,',
13406 then we are at the end of this parameter. */
13410 {
13412 /* Treat invalid names as if the parameter were nameless. */
13415 }
13416 else
13419 /* Create the template parameter. */
13421 identifier);
13423 /* If the next token is an `=', then there is a
13424 default-argument. */
13426 {
13429 /* Consume the `='. */
13431 /* Parse the id-expression. */
13433 /* save token before parsing the id-expression, for error
13434 reporting */
13436 default_argument
13444 /* If the id-expression was a template-id that refers to
13445 a template-class, we already have the declaration here,
13446 so no further lookup is needed. */
13447 ;
13448 else
13449 /* Look up the name. */
13450 default_argument
13452 none_type,
13458 /* See if the default argument is valid. */
13459 default_argument
13462 /* Template parameter packs cannot have default
13463 arguments. */
13465 {
13468 "template parameter pack %qD cannot "
13470 identifier);
13471 else
13475 }
13477 }
13478 else
13481 /* Create the combined representation of the parameter and the
13482 default argument. */
13484 }
13490 }
13493 }
13495 /* Parse a template-id.
13497 template-id:
13498 template-name < template-argument-list [opt] >
13500 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13501 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13502 returned. Otherwise, if the template-name names a function, or set
13503 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13504 names a class, returns a TYPE_DECL for the specialization.
13506 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13507 uninstantiated templates. */
13509 static tree
13515 {
13517 tree templ;
13518 tree arguments;
13519 tree template_id;
13526 /* If the next token corresponds to a template-id, there is no need
13527 to reparse it. */
13530 {
13533 /* Get the stored value. */
13535 /* Perform any access checks that were deferred. */
13538 {
13543 tf_warning_or_error);
13544 }
13545 /* Return the stored value. */
13547 }
13549 /* Avoid performing name lookup if there is no possibility of
13550 finding a template-id. */
13553 && !cp_parser_nth_token_starts_template_argument_list_p
13555 {
13558 }
13560 /* Remember where the template-id starts. */
13566 /* Parse the template-name. */
13569 check_dependency_p,
13570 is_declaration,
13571 tag_type,
13574 {
13577 }
13579 /* If we find the sequence `[:' after a template-name, it's probably
13580 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13581 parse correctly the argument list. */
13588 {
13590 /* Change `:' into `::'. */
13592 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13593 CPP_LESS. */
13596 /* Parse the arguments. */
13599 {
13600 /* If we couldn't parse an argument list, then we revert our changes
13601 and return simply an error. Maybe this is not a template-id
13602 after all. */
13607 }
13608 /* Otherwise, emit an error about the invalid digraph, but continue
13609 parsing because we got our argument list. */
13612 {
13615 "%<<:%> is an alternate spelling for %<[%>."
13618 {
13620 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13623 }
13624 }
13625 }
13626 else
13627 {
13628 /* Look for the `<' that starts the template-argument-list. */
13630 {
13633 }
13634 /* Parse the arguments. */
13636 }
13638 /* Build a representation of the specialization. */
13641 TEMPLATE_ID_EXPR,
13645 {
13647 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13648 template (rather than some instantiation thereof) only if
13649 is not nested within some other construct. For example, in
13650 "template <typename T> void f(T) { A<T>::", A<T> is just an
13651 instantiation of A. */
13654 CPP_SCOPE));
13655 template_id
13657 }
13659 {
13661 }
13662 else
13663 {
13664 /* If it's not a class-template or a template-template, it should be
13665 a function-template. */
13671 }
13673 /* If parsing tentatively, replace the sequence of tokens that makes
13674 up the template-id with a CPP_TEMPLATE_ID token. That way,
13675 should we re-parse the token stream, we will not have to repeat
13676 the effort required to do the parse, nor will we issue duplicate
13677 error messages about problems during instantiation of the
13678 template. */
13680 /* Don't do this if we had a parse error in a declarator; re-parsing
13681 might succeed if a name changes meaning (60361). */
13685 {
13688 /* Reset the contents of the START_OF_ID token. */
13690 /* Retrieve any deferred checks. Do not pop this access checks yet
13691 so the memory will not be reclaimed during token replacing below. */
13697 /* Purge all subsequent tokens. */
13700 /* ??? Can we actually assume that, if template_id ==
13701 error_mark_node, we will have issued a diagnostic to the
13702 user, as opposed to simply marking the tentative parse as
13703 failed? */
13706 }
13710 }
13712 /* Parse a template-name.
13714 template-name:
13715 identifier
13717 The standard should actually say:
13719 template-name:
13720 identifier
13721 operator-function-id
13723 A defect report has been filed about this issue.
13725 A conversion-function-id cannot be a template name because they cannot
13726 be part of a template-id. In fact, looking at this code:
13728 a.operator K<int>()
13730 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13731 It is impossible to call a templated conversion-function-id with an
13732 explicit argument list, since the only allowed template parameter is
13733 the type to which it is converting.
13735 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13736 `template' keyword, in a construction like:
13738 T::template f<3>()
13740 In that case `f' is taken to be a template-name, even though there
13741 is no way of knowing for sure.
13743 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13744 name refers to a set of overloaded functions, at least one of which
13745 is a template, or an IDENTIFIER_NODE with the name of the template,
13746 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13747 names are looked up inside uninstantiated templates. */
13749 static tree
13756 {
13757 tree identifier;
13758 tree decl;
13759 tree fns;
13762 /* If the next token is `operator', then we have either an
13763 operator-function-id or a conversion-function-id. */
13765 {
13766 /* We don't know whether we're looking at an
13767 operator-function-id or a conversion-function-id. */
13769 /* Try an operator-function-id. */
13771 /* If that didn't work, try a conversion-function-id. */
13773 {
13776 }
13777 }
13778 /* Look for the identifier. */
13779 else
13782 /* If we didn't find an identifier, we don't have a template-id. */
13786 /* If the name immediately followed the `template' keyword, then it
13787 is a template-name. However, if the next token is not `<', then
13788 we do not treat it as a template-name, since it is not being used
13789 as part of a template-id. This enables us to handle constructs
13790 like:
13792 template <typename T> struct S { S(); };
13793 template <typename T> S<T>::S();
13795 correctly. We would treat `S' as a template -- if it were `S<T>'
13796 -- but we do not if there is no `<'. */
13800 {
13801 /* In a declaration, in a dependent context, we pretend that the
13802 "template" keyword was present in order to improve error
13803 recovery. For example, given:
13805 template <typename T> void f(T::X<int>);
13807 we want to treat "X<int>" as a template-id. */
13809 && !template_keyword_p
13811 && check_dependency_p
13813 /* Do not do this for dtors (or ctors), since they never
13814 need the template keyword before their name. */
13816 {
13819 /* Explain what went wrong. */
13821 identifier);
13824 /* If parsing tentatively, find the location of the "<" token. */
13827 /* Parse the template arguments so that we can issue error
13828 messages about them. */
13831 /* Skip tokens until we find a good place from which to
13832 continue parsing. */
13837 /* If parsing tentatively, permanently remove the
13838 template argument list. That will prevent duplicate
13839 error messages from being issued about the missing
13840 "template" keyword. */
13846 }
13848 /* If the "template" keyword is present, then there is generally
13849 no point in doing name-lookup, so we just return IDENTIFIER.
13850 But, if the qualifying scope is non-dependent then we can
13851 (and must) do name-lookup normally. */
13857 }
13859 /* Look up the name. */
13861 tag_type,
13864 check_dependency_p,
13868 /* If DECL is a template, then the name was a template-name. */
13870 ;
13871 else
13872 {
13875 /* The standard does not explicitly indicate whether a name that
13876 names a set of overloaded declarations, some of which are
13877 templates, is a template-name. However, such a name should
13878 be a template-name; otherwise, there is no way to form a
13879 template-id for the overloaded templates. */
13887 {
13888 /* The name does not name a template. */
13891 }
13892 }
13894 /* If DECL is dependent, and refers to a function, then just return
13895 its name; we will look it up again during template instantiation. */
13897 {
13901 }
13904 }
13906 /* Parse a template-argument-list.
13908 template-argument-list:
13909 template-argument ... [opt]
13910 template-argument-list , template-argument ... [opt]
13912 Returns a TREE_VEC containing the arguments. */
13914 static tree
13916 {
13921 tree vec;
13928 /* Even if the template-id appears in an integral
13929 constant-expression, the contents of the argument list do
13930 not. */
13936 /* Parse the arguments. */
13937 do
13938 {
13939 tree argument;
13942 /* Consume the comma. */
13945 /* Parse the template-argument. */
13948 /* If the next token is an ellipsis, we're expanding a template
13949 argument pack. */
13951 {
13953 {
13957 }
13958 /* Consume the `...' token. */
13961 /* Make the argument into a TYPE_PACK_EXPANSION or
13962 EXPR_PACK_EXPANSION. */
13964 }
13967 {
13971 {
13974 }
13975 else
13977 }
13979 }
13992 #ifdef ENABLE_CHECKING
13994 #endif
13996 }
13998 /* Parse a template-argument.
14000 template-argument:
14001 assignment-expression
14002 type-id
14003 id-expression
14005 The representation is that of an assignment-expression, type-id, or
14006 id-expression -- except that the qualified id-expression is
14007 evaluated, so that the value returned is either a DECL or an
14008 OVERLOAD.
14010 Although the standard says "assignment-expression", it forbids
14011 throw-expressions or assignments in the template argument.
14012 Therefore, we use "conditional-expression" instead. */
14014 static tree
14016 {
14017 tree argument;
14023 cp_id_kind idk;
14025 /* There's really no way to know what we're looking at, so we just
14026 try each alternative in order.
14028 [temp.arg]
14030 In a template-argument, an ambiguity between a type-id and an
14031 expression is resolved to a type-id, regardless of the form of
14032 the corresponding template-parameter.
14034 Therefore, we try a type-id first. */
14037 /* If there was no error parsing the type-id but the next token is a
14038 '>>', our behavior depends on which dialect of C++ we're
14039 parsing. In C++98, we probably found a typo for '> >'. But there
14040 are type-id which are also valid expressions. For instance:
14042 struct X { int operator >> (int); };
14043 template <int V> struct Foo {};
14044 Foo<X () >> 5> r;
14046 Here 'X()' is a valid type-id of a function type, but the user just
14047 wanted to write the expression "X() >> 5". Thus, we remember that we
14048 found a valid type-id, but we still try to parse the argument as an
14049 expression to see what happens.
14051 In C++0x, the '>>' will be considered two separate '>'
14052 tokens. */
14056 {
14059 }
14060 else
14061 {
14062 /* If the next token isn't a `,' or a `>', then this argument wasn't
14063 really finished. This means that the argument is not a valid
14064 type-id. */
14067 /* If that worked, we're done. */
14070 }
14071 /* We're still not sure what the argument will be. */
14073 /* Try a template. */
14081 /* If the next token isn't a `,' or a `>', then this argument wasn't
14082 really finished. */
14086 {
14087 /* Figure out what is being referred to. If the id-expression
14088 was for a class template specialization, then we will have a
14089 TYPE_DECL at this point. There is no need to do name lookup
14090 at this point in that case. */
14093 none_type,
14102 }
14105 /* It must be a non-type argument. There permitted cases are given
14106 in [temp.arg.nontype]:
14108 -- an integral constant-expression of integral or enumeration
14109 type; or
14111 -- the name of a non-type template-parameter; or
14113 -- the name of an object or function with external linkage...
14115 -- the address of an object or function with external linkage...
14117 -- a pointer to member... */
14118 /* Look for a non-type template parameter. */
14120 {
14132 }
14134 /* If the next token is "&", the argument must be the address of an
14135 object or function with external linkage. */
14138 {
14141 }
14142 /* See if we might have an id-expression. */
14149 {
14152 address_p,
14159 else
14160 {
14161 tree probe;
14164 {
14165 /* Strip the dereference temporarily. */
14168 }
14170 /* If we're in a template, we represent a qualified-id referring
14171 to a static data member as a SCOPE_REF even if the scope isn't
14172 dependent so that we can check access control later. */
14177 {
14178 /* A variable without external linkage might still be a
14179 valid constant-expression, so no error is issued here
14180 if the external-linkage check fails. */
14183 }
14185 /* All overloaded functions are allowed; if the external
14186 linkage test does not pass, an error will be issued
14187 later. */
14188 ;
14192 /* A pointer-to-member. */
14193 ;
14195 ;
14196 else
14200 {
14203 tf_warning_or_error);
14204 else
14207 }
14208 }
14209 }
14210 /* If the argument started with "&", there are no other valid
14211 alternatives at this point. */
14213 {
14216 }
14218 /* If the argument wasn't successfully parsed as a type-id followed
14219 by '>>', the argument can only be a constant expression now.
14220 Otherwise, we try parsing the constant-expression tentatively,
14221 because the argument could really be a type-id. */
14233 /* We did our best to parse the argument as a non type-id, but that
14234 was the only alternative that matched (albeit with a '>' after
14235 it). We can assume it's just a typo from the user, and a
14236 diagnostic will then be issued. */
14238 }
14240 /* Parse an explicit-instantiation.
14242 explicit-instantiation:
14243 template declaration
14245 Although the standard says `declaration', what it really means is:
14247 explicit-instantiation:
14248 template decl-specifier-seq [opt] declarator [opt] ;
14250 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14251 supposed to be allowed. A defect report has been filed about this
14252 issue.
14254 GNU Extension:
14256 explicit-instantiation:
14257 storage-class-specifier template
14258 decl-specifier-seq [opt] declarator [opt] ;
14259 function-specifier template
14260 decl-specifier-seq [opt] declarator [opt] ; */
14262 static void
14264 {
14266 cp_decl_specifier_seq decl_specifiers;
14271 /* Look for an (optional) storage-class-specifier or
14272 function-specifier. */
14274 {
14275 extension_specifier
14278 extension_specifier
14281 }
14283 /* Look for the `template' keyword. */
14285 /* Let the front end know that we are processing an explicit
14286 instantiation. */
14288 /* [temp.explicit] says that we are supposed to ignore access
14289 control while processing explicit instantiation directives. */
14291 /* Parse a decl-specifier-seq. */
14293 CP_PARSER_FLAGS_OPTIONAL,
14296 /* If there was exactly one decl-specifier, and it declared a class,
14297 and there's no declarator, then we have an explicit type
14298 instantiation. */
14300 {
14301 tree type;
14305 /* Turn access control back on for names used during
14306 template instantiation. */
14311 }
14312 else
14313 {
14315 tree decl;
14317 /* Parse the declarator. */
14318 declarator
14329 {
14332 "explicit instantiation shall not use"
14336 "explicit instantiation shall not use"
14341 /* Turn access control back on for names used during
14342 template instantiation. */
14344 /* Do the explicit instantiation. */
14346 }
14347 else
14348 {
14350 /* Skip the body of the explicit instantiation. */
14352 }
14353 }
14354 /* We're done with the instantiation. */
14360 }
14362 /* Parse an explicit-specialization.
14364 explicit-specialization:
14365 template < > declaration
14367 Although the standard says `declaration', what it really means is:
14369 explicit-specialization:
14370 template <> decl-specifier [opt] init-declarator [opt] ;
14371 template <> function-definition
14372 template <> explicit-specialization
14373 template <> template-declaration */
14375 static void
14377 {
14381 /* Look for the `template' keyword. */
14383 /* Look for the `<'. */
14385 /* Look for the `>'. */
14387 /* We have processed another parameter list. */
14389 /* [temp]
14391 A template ... explicit specialization ... shall not have C
14392 linkage. */
14394 {
14396 /* Give it C++ linkage to avoid confusing other parts of the
14397 front end. */
14400 }
14401 else
14403 /* Let the front end know that we are beginning a specialization. */
14405 {
14408 }
14410 /* If the next keyword is `template', we need to figure out whether
14411 or not we're looking a template-declaration. */
14413 {
14418 else
14420 }
14421 else
14422 /* Parse the dependent declaration. */
14428 /* We're done with the specialization. */
14430 /* For the erroneous case of a template with C linkage, we pushed an
14431 implicit C++ linkage scope; exit that scope now. */
14434 /* We're done with this parameter list. */
14436 }
14438 /* Parse a type-specifier.
14440 type-specifier:
14441 simple-type-specifier
14442 class-specifier
14443 enum-specifier
14444 elaborated-type-specifier
14445 cv-qualifier
14447 GNU Extension:
14449 type-specifier:
14450 __complex__
14452 Returns a representation of the type-specifier. For a
14453 class-specifier, enum-specifier, or elaborated-type-specifier, a
14454 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14456 The parser flags FLAGS is used to control type-specifier parsing.
14458 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14459 in a decl-specifier-seq.
14461 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14462 class-specifier, enum-specifier, or elaborated-type-specifier, then
14463 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14464 if a type is declared; 2 if it is defined. Otherwise, it is set to
14465 zero.
14467 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14468 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14469 is set to FALSE. */
14471 static tree
14473 cp_parser_flags flags,
14478 {
14484 /* Assume this type-specifier does not declare a new type. */
14487 /* And that it does not specify a cv-qualifier. */
14490 /* Peek at the next token. */
14493 /* If we're looking at a keyword, we can use that to guide the
14494 production we choose. */
14497 {
14502 /* Look for the enum-specifier. */
14504 /* If that worked, we're done. */
14506 {
14511 type_spec,
14512 token,
14515 }
14516 else
14519 /* Any of these indicate either a class-specifier, or an
14520 elaborated-type-specifier. */
14527 /* Parse tentatively so that we can back up if we don't find a
14528 class-specifier. */
14530 /* Look for the class-specifier. */
14533 /* If that worked, we're done. */
14535 {
14540 type_spec,
14541 token,
14544 }
14546 /* Fall through. */
14547 elaborated_type_specifier:
14548 /* We're declaring (not defining) a class or enum. */
14552 /* Fall through. */
14554 /* Look for an elaborated-type-specifier. */
14555 type_spec
14556 = (cp_parser_elaborated_type_specifier
14559 is_declaration));
14562 type_spec,
14563 token,
14586 /* The `__complex__' keyword is a GNU extension. */
14592 }
14594 /* Handle simple keywords. */
14596 {
14598 {
14601 }
14603 }
14605 /* If we do not already have a type-specifier, assume we are looking
14606 at a simple-type-specifier. */
14608 decl_specs,
14609 flags);
14611 /* If we didn't find a type-specifier, and a type-specifier was not
14612 optional in this context, issue an error message. */
14614 {
14617 }
14620 }
14622 /* Parse a simple-type-specifier.
14624 simple-type-specifier:
14625 :: [opt] nested-name-specifier [opt] type-name
14626 :: [opt] nested-name-specifier template template-id
14627 char
14628 wchar_t
14629 bool
14630 short
14631 int
14632 long
14633 signed
14634 unsigned
14635 float
14636 double
14637 void
14639 C++0x Extension:
14641 simple-type-specifier:
14642 auto
14643 decltype ( expression )
14644 char16_t
14645 char32_t
14646 __underlying_type ( type-id )
14648 GNU Extension:
14650 simple-type-specifier:
14651 __int128
14652 __typeof__ unary-expression
14653 __typeof__ ( type-id )
14654 __typeof__ ( type-id ) { initializer-list , [opt] }
14656 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14657 appropriately updated. */
14659 static tree
14662 cp_parser_flags flags)
14663 {
14667 /* Peek at the next token. */
14670 /* If we're looking at a keyword, things are easy. */
14672 {
14732 {
14736 {
14739 "use of %<auto%> in lambda parameter declaration "
14740 "only available with "
14742 }
14745 "use of %<auto%> in parameter declaration "
14746 "only available with "
14748 else
14750 "ISO C++ forbids use of %<auto%> in parameter "
14752 }
14753 else
14758 /* Since DR 743, decltype can either be a simple-type-specifier by
14759 itself or begin a nested-name-specifier. Parsing it will replace
14760 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14761 handling below decide what to do. */
14767 /* Consume the `typeof' token. */
14769 /* Parse the operand to `typeof'. */
14771 /* If it is not already a TYPE, take its type. */
14777 token,
14786 token,
14796 token,
14801 }
14803 /* If token is an already-parsed decltype not followed by ::,
14804 it's a simple-type-specifier. */
14807 {
14811 token,
14815 }
14817 /* If the type-specifier was for a built-in type, we're done. */
14819 {
14820 /* Record the type. */
14827 type,
14828 token,
14833 /* Consume the token. */
14836 /* There is no valid C++ program where a non-template type is
14837 followed by a "<". That usually indicates that the user thought
14838 that the type was a template. */
14843 }
14845 /* The type-specifier must be a user-defined type. */
14847 {
14851 /* Don't gobble tokens or issue error messages if this is an
14852 optional type-specifier. */
14856 /* Look for the optional `::' operator. */
14857 global_p
14861 /* Look for the nested-name specifier. */
14862 qualified_p
14870 /* If we have seen a nested-name-specifier, and the next token
14871 is `template', then we are using the template-id production. */
14874 {
14875 /* Look for the template-id. */
14879 none_type,
14881 /* If the template-id did not name a type, we are out of
14882 luck. */
14884 {
14887 }
14888 }
14889 /* Otherwise, look for a type-name. */
14890 else
14892 /* Keep track of all name-lookups performed in class scopes. */
14894 && !global_p
14895 && !qualified_p
14899 /* If it didn't work out, we don't have a TYPE. */
14905 token,
14907 }
14909 /* If we didn't get a type-name, issue an error message. */
14911 {
14914 }
14917 {
14918 /* See if TYPE is an Objective-C type, and if so, parse and
14919 accept any protocol references following it. Do this before
14920 the cp_parser_check_for_invalid_template_id() call, because
14921 Objective-C types can be followed by '<...>' which would
14922 enclose protocol names rather than template arguments, and so
14923 everything is fine. */
14926 {
14930 /* Clobber the "unqualified" type previously entered into
14931 DECL_SPECS with the new, improved protocol-qualified version. */
14936 }
14938 /* There is no valid C++ program where a non-template type is
14939 followed by a "<". That usually indicates that the user
14940 thought that the type was a template. */
14942 none_type,
14944 }
14947 }
14949 /* Parse a type-name.
14951 type-name:
14952 class-name
14953 enum-name
14954 typedef-name
14955 simple-template-id [in c++0x]
14957 enum-name:
14958 identifier
14960 typedef-name:
14961 identifier
14963 Returns a TYPE_DECL for the type. */
14965 static tree
14967 {
14968 tree type_decl;
14970 /* We can't know yet whether it is a class-name or not. */
14972 /* Try a class-name. */
14976 none_type,
14980 /* If it's not a class-name, keep looking. */
14982 {
14984 /* It must be a typedef-name or an enum-name. */
14988 /* It is either a simple-template-id representing an
14989 instantiation of an alias template... */
14993 none_type,
14995 /* Note that this must be an instantiation of an alias template
14996 because [temp.names]/6 says:
14998 A template-id that names an alias template specialization
14999 is a type-name.
15001 Whereas [temp.names]/7 says:
15003 A simple-template-id that names a class template
15004 specialization is a class-name. */
15009 else
15013 /* ... Or a typedef-name or an enum-name. */
15015 }
15018 }
15020 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15022 enum-name:
15023 identifier
15025 typedef-name:
15026 identifier
15028 Returns a TYPE_DECL for the type. */
15030 static tree
15032 {
15033 tree type_decl;
15034 tree identifier;
15041 /* Look up the type-name. */
15048 {
15049 /* See if this is an Objective-C type. */
15054 }
15056 /* Issue an error if we did not find a type-name. */
15058 /* In Objective-C, we have the complication that class names are
15059 normally type names and start declarations (eg, the
15060 "NSObject" in "NSObject *object;"), but can be used in an
15061 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15062 is an expression. So, a classname followed by a dot is not a
15063 valid type-name. */
15066 {
15071 }
15072 /* Remember that the name was used in the definition of the
15073 current class so that we can check later to see if the
15074 meaning would have been different after the class was
15075 entirely defined. */
15081 }
15083 /* Parse an elaborated-type-specifier. Note that the grammar given
15084 here incorporates the resolution to DR68.
15086 elaborated-type-specifier:
15087 class-key :: [opt] nested-name-specifier [opt] identifier
15088 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15089 enum-key :: [opt] nested-name-specifier [opt] identifier
15090 typename :: [opt] nested-name-specifier identifier
15091 typename :: [opt] nested-name-specifier template [opt]
15092 template-id
15094 GNU extension:
15096 elaborated-type-specifier:
15097 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15098 class-key attributes :: [opt] nested-name-specifier [opt]
15099 template [opt] template-id
15100 enum attributes :: [opt] nested-name-specifier [opt] identifier
15102 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15103 declared `friend'. If IS_DECLARATION is TRUE, then this
15104 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15105 something is being declared.
15107 Returns the TYPE specified. */
15109 static tree
15113 {
15115 tree identifier;
15118 tree globalscope;
15121 /* See if we're looking at the `enum' keyword. */
15123 {
15124 /* Consume the `enum' token. */
15126 /* Remember that it's an enumeration type. */
15128 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15129 enums) is used here. */
15132 {
15136 /* Consume the `struct' or `class' and parse it anyway. */
15138 }
15139 /* Parse the attributes. */
15141 }
15142 /* Or, it might be `typename'. */
15144 RID_TYPENAME))
15145 {
15146 /* Consume the `typename' token. */
15148 /* Remember that it's a `typename' type. */
15150 }
15151 /* Otherwise it must be a class-key. */
15152 else
15153 {
15157 /* Parse the attributes. */
15159 }
15161 /* Look for the `::' operator. */
15164 /* Look for the nested-name-specifier. */
15166 {
15171 is_declaration))
15173 }
15174 else
15175 /* Even though `typename' is not present, the proposed resolution
15176 to Core Issue 180 says that in `class A<T>::B', `B' should be
15177 considered a type-name, even if `A<T>' is dependent. */
15182 is_declaration);
15183 /* For everything but enumeration types, consider a template-id.
15184 For an enumeration type, consider only a plain identifier. */
15186 {
15188 tree decl;
15190 /* Allow the `template' keyword. */
15192 /* If we didn't see `template', we don't know if there's a
15193 template-id or not. */
15196 /* Parse the template-id. */
15200 tag_type,
15201 is_declaration);
15202 /* If we didn't find a template-id, look for an ordinary
15203 identifier. */
15205 ;
15206 /* We can get here when cp_parser_template_id, called by
15207 cp_parser_class_name with tag_type == none_type, succeeds
15208 and caches a BASELINK. Then, when called again here,
15209 instead of failing and returning an error_mark_node
15210 returns it (see template/typename17.C in C++11).
15211 ??? Could we diagnose this earlier? */
15213 {
15216 }
15217 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15218 in effect, then we must assume that, upon instantiation, the
15219 template will correspond to a class. */
15223 typename_type,
15225 /* If the `typename' keyword is in effect and DECL is not a type
15226 decl, then type is non existent. */
15228 ;
15234 }
15237 {
15242 {
15245 }
15247 /* For a `typename', we needn't call xref_tag. */
15253 /* Template parameter lists apply only if we are not within a
15254 function parameter list. */
15255 bool template_parm_lists_apply
15264 /* Look up a qualified name in the usual way. */
15266 {
15267 tree decl;
15268 tree ambiguous_decls;
15271 tag_type,
15278 /* If the lookup was ambiguous, an error will already have been
15279 issued. */
15283 /* If we are parsing friend declaration, DECL may be a
15284 TEMPLATE_DECL tree node here. However, we need to check
15285 whether this TEMPLATE_DECL results in valid code. Consider
15286 the following example:
15288 namespace N {
15289 template <class T> class C {};
15290 }
15291 class X {
15292 template <class T> friend class N::C; // #1, valid code
15293 };
15294 template <class T> class Y {
15295 friend class N::C; // #2, invalid code
15296 };
15298 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15299 name lookup of `N::C'. We see that friend declaration must
15300 be template for the code to be valid. Note that
15301 processing_template_decl does not work here since it is
15302 always 1 for the above two cases. */
15304 decl = (cp_parser_maybe_treat_template_as_class
15309 {
15311 identifier,
15314 }
15317 {
15321 allow_template);
15325 }
15327 /* Forward declarations of nested types, such as
15329 class C1::C2;
15330 class C1::C2::C3;
15332 are invalid unless all components preceding the final '::'
15333 are complete. If all enclosing types are complete, these
15334 declarations become merely pointless.
15336 Invalid forward declarations of nested types are errors
15337 caught elsewhere in parsing. Those that are pointless arrive
15338 here. */
15345 }
15346 else
15347 {
15348 /* An elaborated-type-specifier sometimes introduces a new type and
15349 sometimes names an existing type. Normally, the rule is that it
15350 introduces a new type only if there is not an existing type of
15351 the same name already in scope. For example, given:
15353 struct S {};
15354 void f() { struct S s; }
15356 the `struct S' in the body of `f' is the same `struct S' as in
15357 the global scope; the existing definition is used. However, if
15358 there were no global declaration, this would introduce a new
15359 local class named `S'.
15361 An exception to this rule applies to the following code:
15363 namespace N { struct S; }
15365 Here, the elaborated-type-specifier names a new type
15366 unconditionally; even if there is already an `S' in the
15367 containing scope this declaration names a new type.
15368 This exception only applies if the elaborated-type-specifier
15369 forms the complete declaration:
15371 [class.name]
15373 A declaration consisting solely of `class-key identifier ;' is
15374 either a redeclaration of the name in the current scope or a
15375 forward declaration of the identifier as a class name. It
15376 introduces the name into the current scope.
15378 We are in this situation precisely when the next token is a `;'.
15380 An exception to the exception is that a `friend' declaration does
15381 *not* name a new type; i.e., given:
15383 struct S { friend struct T; };
15385 `T' is not a new type in the scope of `S'.
15387 Also, `new struct S' or `sizeof (struct S)' never results in the
15388 definition of a new type; a new type can only be declared in a
15389 declaration context. */
15391 tag_scope ts;
15395 /* Friends have special name lookup rules. */
15399 CPP_SEMICOLON))
15400 /* This is a `class-key identifier ;' */
15402 else
15405 template_p =
15406 (template_parm_lists_apply
15409 /* An unqualified name was used to reference this type, so
15410 there were no qualifying templates. */
15418 }
15419 }
15424 /* Allow attributes on forward declarations of classes. */
15426 {
15436 else
15439 }
15442 {
15443 /* Indicate whether this class was declared as a `class' or as a
15444 `struct'. */
15448 }
15450 /* A "<" cannot follow an elaborated type specifier. If that
15451 happens, the user was probably trying to form a template-id. */
15456 }
15458 /* Parse an enum-specifier.
15460 enum-specifier:
15461 enum-head { enumerator-list [opt] }
15462 enum-head { enumerator-list , } [C++0x]
15464 enum-head:
15465 enum-key identifier [opt] enum-base [opt]
15466 enum-key nested-name-specifier identifier enum-base [opt]
15468 enum-key:
15469 enum
15470 enum class [C++0x]
15471 enum struct [C++0x]
15473 enum-base: [C++0x]
15474 : type-specifier-seq
15476 opaque-enum-specifier:
15477 enum-key identifier enum-base [opt] ;
15479 GNU Extensions:
15480 enum-key attributes[opt] identifier [opt] enum-base [opt]
15481 { enumerator-list [opt] }attributes[opt]
15482 enum-key attributes[opt] identifier [opt] enum-base [opt]
15483 { enumerator-list, }attributes[opt] [C++0x]
15485 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15486 if the token stream isn't an enum-specifier after all. */
15488 static tree
15490 {
15491 tree identifier;
15493 tree prev_scope;
15495 tree attributes;
15508 /* Parse tentatively so that we can back up if we don't find a
15509 enum-specifier. */
15512 /* Caller guarantees that the current token is 'enum', an identifier
15513 possibly follows, and the token after that is an opening brace.
15514 If we don't have an identifier, fabricate an anonymous name for
15515 the enumeration being defined. */
15518 /* Parse the "class" or "struct", which indicates a scoped
15519 enumeration type in C++0x. */
15522 {
15526 /* Consume the `struct' or `class' token. */
15530 }
15534 /* Clear the qualification. */
15539 /* Figure out in what scope the declaration is being placed. */
15545 nested_name_specifier
15553 {
15554 tree name;
15558 enum_type,
15563 input_location);
15565 {
15568 {
15569 /* Are template enums allowed in ISO? */
15573 /* ignore a typename reference, for it will be solved by name
15574 in start_enum. */
15576 }
15577 }
15580 else
15583 }
15584 else
15585 {
15588 else
15589 {
15595 }
15596 }
15599 /* Check for the `:' that denotes a specified underlying type in C++0x.
15600 Note that a ':' could also indicate a bitfield width, however. */
15602 {
15603 cp_decl_specifier_seq type_specifiers;
15605 /* Consume the `:'. */
15608 /* Parse the type-specifier-seq. */
15613 /* At this point this is surely not elaborated type specifier. */
15622 /* If that didn't work, stop. */
15624 {
15630 }
15631 }
15633 /* Look for the `{' but don't consume it yet. */
15635 {
15637 {
15640 {
15643 }
15644 }
15645 /* An opaque-enum-specifier must have a ';' here. */
15648 {
15651 {
15654 }
15655 }
15656 }
15662 {
15664 {
15668 }
15670 {
15672 }
15673 }
15675 /* Issue an error message if type-definitions are forbidden here. */
15678 else
15679 /* Create the new type. We do this before consuming the opening
15680 brace so the enum will be recorded as being on the line of its
15681 tag (or the 'enum' keyword, if there is no tag). */
15685 /* If the next token is not '{' it is an opaque-enum-specifier or an
15686 elaborated-type-specifier. */
15688 {
15692 {
15693 /* The following catches invalid code such as:
15694 enum class S<int>::E { A, B, C }; */
15702 {
15706 nested_name_specifier);
15708 }
15709 /* If that scope does not contain the scope in which the
15710 class was originally declared, the program is invalid. */
15712 nested_name_specifier))
15713 {
15716 "declaration of %qD in namespace %qD which does not "
15719 else
15721 "declaration of %qD in %qD which does not "
15725 }
15726 }
15731 /* Consume the opening brace. */
15738 {
15742 }
15743 else
15744 {
15750 }
15754 /* If the next token is not '}', then there are some enumerators. */
15756 {
15760 }
15761 else
15764 /* Consume the final '}'. */
15770 }
15771 else
15772 {
15773 /* If a ';' follows, then it is an opaque-enum-specifier
15774 and additional restrictions apply. */
15776 {
15783 }
15784 }
15786 /* Look for trailing attributes to apply to this enumeration, and
15787 apply them if appropriate. */
15789 {
15793 trailing_attr,
15795 }
15797 /* Finish up the enumeration. */
15799 {
15804 }
15807 {
15809 {
15812 }
15814 {
15816 }
15817 }
15818 out:
15821 }
15823 /* Parse an enumerator-list. The enumerators all have the indicated
15824 TYPE.
15826 enumerator-list:
15827 enumerator-definition
15828 enumerator-list , enumerator-definition */
15830 static void
15832 {
15834 {
15835 /* Parse an enumerator-definition. */
15838 /* If the next token is not a ',', we've reached the end of
15839 the list. */
15842 /* Otherwise, consume the `,' and keep going. */
15844 /* If the next token is a `}', there is a trailing comma. */
15846 {
15851 }
15852 }
15853 }
15855 /* Parse an enumerator-definition. The enumerator has the indicated
15856 TYPE.
15858 enumerator-definition:
15859 enumerator
15860 enumerator = constant-expression
15862 enumerator:
15863 identifier */
15865 static void
15867 {
15868 tree identifier;
15869 tree value;
15870 location_t loc;
15872 /* Save the input location because we are interested in the location
15873 of the identifier and not the location of the explicit value. */
15876 /* Look for the identifier. */
15881 /* If the next token is an '=', then there is an explicit value. */
15883 {
15884 /* Consume the `=' token. */
15886 /* Parse the value. */
15889 NULL);
15890 }
15891 else
15894 /* If we are processing a template, make sure the initializer of the
15895 enumerator doesn't contain any bare template parameter pack. */
15899 /* integral_constant_value will pull out this expression, so make sure
15900 it's folded as appropriate. */
15903 /* Create the enumerator. */
15905 }
15907 /* Parse a namespace-name.
15909 namespace-name:
15910 original-namespace-name
15911 namespace-alias
15913 Returns the NAMESPACE_DECL for the namespace. */
15915 static tree
15917 {
15918 tree identifier;
15919 tree namespace_decl;
15923 /* Get the name of the namespace. */
15928 /* Look up the identifier in the currently active scope. Look only
15929 for namespaces, due to:
15931 [basic.lookup.udir]
15933 When looking up a namespace-name in a using-directive or alias
15934 definition, only namespace names are considered.
15936 And:
15938 [basic.lookup.qual]
15940 During the lookup of a name preceding the :: scope resolution
15941 operator, object, function, and enumerator names are ignored.
15943 (Note that cp_parser_qualifying_entity only calls this
15944 function if the token after the name is the scope resolution
15945 operator.) */
15947 none_type,
15953 /* If it's not a namespace, issue an error. */
15956 {
15961 }
15964 }
15966 /* Parse a namespace-definition.
15968 namespace-definition:
15969 named-namespace-definition
15970 unnamed-namespace-definition
15972 named-namespace-definition:
15973 original-namespace-definition
15974 extension-namespace-definition
15976 original-namespace-definition:
15977 namespace identifier { namespace-body }
15979 extension-namespace-definition:
15980 namespace original-namespace-name { namespace-body }
15982 unnamed-namespace-definition:
15983 namespace { namespace-body } */
15985 static void
15987 {
15994 {
15998 }
15999 else
16002 /* Look for the `namespace' keyword. */
16005 /* Get the name of the namespace. We do not attempt to distinguish
16006 between an original-namespace-definition and an
16007 extension-namespace-definition at this point. The semantic
16008 analysis routines are responsible for that. */
16011 else
16014 /* Parse any specified attributes. */
16017 /* Look for the `{' to start the namespace. */
16019 /* Start the namespace. */
16022 /* "inline namespace" is equivalent to a stub namespace definition
16023 followed by a strong using directive. */
16025 {
16027 /* Set up namespace association. */
16031 /* Import the contents of the inline namespace. */
16035 }
16039 /* Parse the body of the namespace. */
16045 /* Finish the namespace. */
16047 /* Look for the final `}'. */
16049 }
16051 /* Parse a namespace-body.
16053 namespace-body:
16054 declaration-seq [opt] */
16056 static void
16058 {
16060 }
16062 /* Parse a namespace-alias-definition.
16064 namespace-alias-definition:
16065 namespace identifier = qualified-namespace-specifier ; */
16067 static void
16069 {
16070 tree identifier;
16071 tree namespace_specifier;
16075 /* Look for the `namespace' keyword. */
16077 /* Look for the identifier. */
16081 /* Look for the `=' token. */
16084 {
16086 /* Skip the definition. */
16091 }
16093 /* Look for the qualified-namespace-specifier. */
16094 namespace_specifier
16096 /* Look for the `;' token. */
16099 /* Register the alias in the symbol table. */
16101 }
16103 /* Parse a qualified-namespace-specifier.
16105 qualified-namespace-specifier:
16106 :: [opt] nested-name-specifier [opt] namespace-name
16108 Returns a NAMESPACE_DECL corresponding to the specified
16109 namespace. */
16111 static tree
16113 {
16114 /* Look for the optional `::'. */
16118 /* Look for the optional nested-name-specifier. */
16126 }
16128 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16129 access declaration.
16131 using-declaration:
16132 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16133 using :: unqualified-id ;
16135 access-declaration:
16136 qualified-id ;
16138 */
16140 static bool
16143 {
16147 tree decl;
16148 tree identifier;
16149 tree qscope;
16154 {
16157 }
16158 else
16159 {
16160 /* Look for the `using' keyword. */
16163 /* Peek at the next token. */
16165 /* See if it's `typename'. */
16167 {
16168 /* Remember that we've seen it. */
16170 /* Consume the `typename' token. */
16172 }
16173 }
16175 /* Look for the optional global scope qualification. */
16176 global_scope_p
16181 /* If we saw `typename', or didn't see `::', then there must be a
16182 nested-name-specifier present. */
16184 {
16190 {
16193 }
16194 }
16195 /* Otherwise, we could be in either of the two productions. In that
16196 case, treat the nested-name-specifier as optional. */
16197 else
16209 /* Something has already gone wrong; there's no need to parse
16210 further. Since an error has occurred, the return value of
16211 cp_parser_parse_definitely will be false, as required. */
16215 /* Parse the unqualified-id. */
16223 {
16228 }
16230 /* The function we call to handle a using-declaration is different
16231 depending on what scope we are in. */
16233 ;
16236 /* [namespace.udecl]
16238 A using declaration shall not name a template-id. */
16241 else
16242 {
16244 {
16245 /* Create the USING_DECL. */
16252 {
16255 }
16256 else
16257 /* Add it to the list of members in this class. */
16259 }
16260 else
16261 {
16263 identifier,
16270 {
16273 }
16276 else
16278 }
16279 }
16281 /* Look for the final `;'. */
16286 "access declarations are deprecated "
16287 "in favour of using-declarations; "
16291 }
16293 /* Parse an alias-declaration.
16295 alias-declaration:
16296 using identifier attribute-specifier-seq [opt] = type-id */
16298 static tree
16300 {
16302 location_t id_location;
16304 cp_decl_specifier_seq decl_specs;
16308 /* Look for the `using' keyword. */
16309 cp_token *using_token
16331 /* Now we are going to parse the type-id of the declaration. */
16333 /*
16334 [dcl.type]/3 says:
16336 "A type-specifier-seq shall not define a class or enumeration
16337 unless it appears in the type-id of an alias-declaration (7.1.3) that
16338 is not the declaration of a template-declaration."
16340 In other words, if we currently are in an alias template, the
16341 type-id should not define a type.
16343 So let's set parser->type_definition_forbidden_message in that
16344 case; cp_parser_check_type_definition (called by
16345 cp_parser_class_specifier) will then emit an error if a type is
16346 defined in the type-id. */
16348 {
16352 }
16356 /* Restore the error message if need be. */
16362 {
16365 }
16367 /* A typedef-name can also be introduced by an alias-declaration. The
16368 identifier following the using keyword becomes a typedef-name. It has
16369 the same semantics as if it were introduced by the typedef
16370 specifier. In particular, it does not define a new type and it shall
16371 not appear in the type-id. */
16376 {
16379 ds_attribute,
16380 attrs_token);
16381 }
16383 ds_typedef,
16384 using_token);
16386 ds_alias,
16387 using_token);
16396 else
16407 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16408 added into the symbol table; otherwise, return the TYPE_DECL. */
16412 {
16416 }
16419 }
16421 /* Parse a using-directive.
16423 using-directive:
16424 using namespace :: [opt] nested-name-specifier [opt]
16425 namespace-name ; */
16427 static void
16429 {
16430 tree namespace_decl;
16431 tree attribs;
16433 /* Look for the `using' keyword. */
16435 /* And the `namespace' keyword. */
16437 /* Look for the optional `::' operator. */
16439 /* And the optional nested-name-specifier. */
16445 /* Get the namespace being used. */
16447 /* And any specified attributes. */
16449 /* Update the symbol table. */
16451 /* Look for the final `;'. */
16453 }
16455 /* Parse an asm-definition.
16457 asm-definition:
16458 asm ( string-literal ) ;
16460 GNU Extension:
16462 asm-definition:
16463 asm volatile [opt] ( string-literal ) ;
16464 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16465 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16466 : asm-operand-list [opt] ) ;
16467 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16468 : asm-operand-list [opt]
16469 : asm-clobber-list [opt] ) ;
16470 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16471 : asm-clobber-list [opt]
16472 : asm-goto-list ) ; */
16474 static void
16476 {
16477 tree string;
16482 tree asm_stmt;
16490 /* Look for the `asm' keyword. */
16492 /* See if the next token is `volatile'. */
16495 {
16496 /* Remember that we saw the `volatile' keyword. */
16498 /* Consume the token. */
16500 }
16504 {
16505 /* Remember that we saw the `goto' keyword. */
16507 /* Consume the token. */
16509 }
16510 /* Look for the opening `('. */
16513 /* Look for the string. */
16516 {
16520 }
16522 /* If we're allowing GNU extensions, check for the extended assembly
16523 syntax. Unfortunately, the `:' tokens need not be separated by
16524 a space in C, and so, for compatibility, we tolerate that here
16525 too. Doing that means that we have to treat the `::' operator as
16526 two `:' tokens. */
16531 {
16536 /* The extended syntax was used. */
16539 /* Look for outputs. */
16541 {
16542 /* Consume the `:'. */
16544 /* Parse the output-operands. */
16546 CPP_COLON)
16548 CPP_SCOPE)
16550 CPP_CLOSE_PAREN)
16556 }
16557 /* If the next token is `::', there are no outputs, and the
16558 next token is the beginning of the inputs. */
16560 /* The inputs are coming next. */
16563 /* Look for inputs. */
16566 {
16567 /* Consume the `:' or `::'. */
16569 /* Parse the output-operands. */
16571 CPP_COLON)
16573 CPP_SCOPE)
16575 CPP_CLOSE_PAREN))
16580 }
16582 /* The clobbers are coming next. */
16585 /* Look for clobbers. */
16588 {
16590 /* Consume the `:' or `::'. */
16592 /* Parse the clobbers. */
16594 CPP_COLON)
16596 CPP_CLOSE_PAREN))
16598 }
16601 /* The labels are coming next. */
16604 /* Look for labels. */
16607 {
16609 /* Consume the `:' or `::'. */
16611 /* Parse the labels. */
16613 }
16617 }
16621 /* Look for the closing `)'. */
16629 {
16630 /* Create the ASM_EXPR. */
16632 {
16635 /* If the extended syntax was not used, mark the ASM_EXPR. */
16637 {
16643 }
16644 }
16645 else
16647 }
16648 }
16650 /* Declarators [gram.dcl.decl] */
16652 /* Parse an init-declarator.
16654 init-declarator:
16655 declarator initializer [opt]
16657 GNU Extension:
16659 init-declarator:
16660 declarator asm-specification [opt] attributes [opt] initializer [opt]
16662 function-definition:
16663 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16664 function-body
16665 decl-specifier-seq [opt] declarator function-try-block
16667 GNU Extension:
16669 function-definition:
16670 __extension__ function-definition
16672 TM Extension:
16674 function-definition:
16675 decl-specifier-seq [opt] declarator function-transaction-block
16677 The DECL_SPECIFIERS apply to this declarator. Returns a
16678 representation of the entity declared. If MEMBER_P is TRUE, then
16679 this declarator appears in a class scope. The new DECL created by
16680 this declarator is returned.
16682 The CHECKS are access checks that should be performed once we know
16683 what entity is being declared (and, therefore, what classes have
16684 befriended it).
16686 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16687 for a function-definition here as well. If the declarator is a
16688 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16689 be TRUE upon return. By that point, the function-definition will
16690 have been completely parsed.
16692 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16693 is FALSE.
16695 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16696 parsed declaration if it is an uninitialized single declarator not followed
16697 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16698 if present, will not be consumed. If returned, this declarator will be
16699 created with SD_INITIALIZED but will not call cp_finish_decl. */
16701 static tree
16710 {
16714 tree prefix_attributes;
16716 tree asm_specification;
16717 tree initializer;
16719 tree scope;
16721 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16722 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16723 "(...)". */
16733 /* Gather the attributes that were provided with the
16734 decl-specifiers. */
16737 /* Assume that this is not the declarator for a function
16738 definition. */
16742 /* Default arguments are only permitted for function parameters. */
16746 /* Defer access checks while parsing the declarator; we cannot know
16747 what names are accessible until we know what is being
16748 declared. */
16751 /* Parse the declarator. */
16753 declarator
16758 /* Gather up the deferred checks. */
16763 /* If the DECLARATOR was erroneous, there's no need to go
16764 further. */
16768 /* Check that the number of template-parameter-lists is OK. */
16778 /* Figure out what scope the entity declared by the DECLARATOR is
16779 located in. `grokdeclarator' sometimes changes the scope, so
16780 we compute it now. */
16783 /* Perform any lookups in the declared type which were thought to be
16784 dependent, but are not in the scope of the declarator. */
16785 decl_specifiers->type
16788 /* If we're allowing GNU extensions, look for an
16789 asm-specification. */
16791 {
16792 /* Look for an asm-specification. */
16795 }
16796 else
16799 /* Look for attributes. */
16803 /* Peek at the next token. */
16809 {
16810 /* Check to see if the token indicates the start of a
16811 function-definition. */
16813 {
16815 {
16816 /* If a function-definition should not appear here, issue an
16817 error message. */
16821 }
16823 location_t func_brace_location
16826 /* Neither attributes nor an asm-specification are allowed
16827 on a function-definition. */
16830 "an asm-specification is not allowed "
16834 "attributes are not allowed "
16836 /* This is a function-definition. */
16839 /* Parse the function definition. */
16842 decl_specifiers,
16843 declarator,
16844 prefix_attributes);
16845 else
16846 decl =
16847 (cp_parser_function_definition_from_specifiers_and_declarator
16851 {
16852 /* This is where the prologue starts... */
16855 }
16858 }
16859 }
16861 {
16862 /* A non-template declaration involving a function parameter list
16863 containing an implicit template parameter will be made into a
16864 template. If the resulting declaration is not going to be an
16865 actual function then finish the template scope here to prevent it.
16866 An error message will be issued once we have a decl to talk about.
16868 FIXME probably we should do type deduction rather than create an
16869 implicit template, but the standard currently doesn't allow it. */
16872 }
16874 /* [dcl.dcl]
16876 Only in function declarations for constructors, destructors, and
16877 type conversions can the decl-specifier-seq be omitted.
16879 We explicitly postpone this check past the point where we handle
16880 function-definitions because we tolerate function-definitions
16881 that are missing their return types in some modes. */
16883 {
16887 }
16889 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16893 {
16901 {
16907 }
16908 }
16909 else
16910 {
16911 /* If the init-declarator isn't initialized and isn't followed by a
16912 `,' or `;', it's not a valid init-declarator. */
16915 {
16918 else
16919 {
16922 }
16923 }
16926 }
16928 /* Because start_decl has side-effects, we should only call it if we
16929 know we're going ahead. By this point, we know that we cannot
16930 possibly be looking at any other construct. */
16933 /* Enter the newly declared entry in the symbol table. If we're
16934 processing a declaration in a class-specifier, we wait until
16935 after processing the initializer. */
16937 {
16944 /* Adjust location of decl if declarator->id_loc is more appropriate:
16945 set, and decl wasn't merged with another decl, in which case its
16946 location would be different from input_location, and more accurate. */
16951 }
16953 /* Enter the SCOPE. That way unqualified names appearing in the
16954 initializer will be looked up in SCOPE. */
16957 /* Perform deferred access control checks, now that we know in which
16958 SCOPE the declared entity resides. */
16960 {
16963 /* If the entity being declared is a function, pretend that we
16964 are in its scope. If it is a `friend', it may have access to
16965 things that would not otherwise be accessible. */
16967 {
16970 }
16972 /* Perform access checks for template parameters. */
16975 /* Perform the access control checks for the declarator and the
16976 decl-specifiers. */
16979 /* Restore the saved value. */
16982 }
16984 /* Parse the initializer. */
16989 {
16991 {
16995 else
16996 {
16997 /* If the declaration was erroneous, we don't really
16998 know what the user intended, so just silently
16999 consume the initializer. */
17007 }
17008 }
17009 else
17010 {
17011 /* We want to record the extra mangling scope for in-class
17012 initializers of class members and initializers of static data
17013 member templates. The former involves deferring
17014 parsing of the initializer until end of class as with default
17015 arguments. So right here we only handle the latter. */
17025 }
17026 }
17028 /* The old parser allows attributes to appear after a parenthesized
17029 initializer. Mark Mitchell proposed removing this functionality
17030 on the GCC mailing lists on 2002-08-13. This parser accepts the
17031 attributes -- but ignores them. */
17038 /* And now complain about a non-function implicit template. */
17043 /* For an in-class declaration, use `grokfield' to create the
17044 declaration. */
17046 {
17048 {
17051 }
17059 }
17061 /* Finish processing the declaration. But, skip member
17062 declarations. */
17064 {
17067 asm_specification,
17068 /* If the initializer is in parentheses, then this is
17069 a direct-initialization, which means that an
17070 `explicit' constructor is OK. Otherwise, an
17071 `explicit' constructor cannot be used. */
17074 }
17077 /* Core issue #226 (C++0x only): A default template-argument
17078 shall not be specified in a friend class template
17079 declaration. */
17088 {
17091 else
17093 }
17096 }
17098 /* Parse a declarator.
17100 declarator:
17101 direct-declarator
17102 ptr-operator declarator
17104 abstract-declarator:
17105 ptr-operator abstract-declarator [opt]
17106 direct-abstract-declarator
17108 GNU Extensions:
17110 declarator:
17111 attributes [opt] direct-declarator
17112 attributes [opt] ptr-operator declarator
17114 abstract-declarator:
17115 attributes [opt] ptr-operator abstract-declarator [opt]
17116 attributes [opt] direct-abstract-declarator
17118 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17119 detect constructor, destructor or conversion operators. It is set
17120 to -1 if the declarator is a name, and +1 if it is a
17121 function. Otherwise it is set to zero. Usually you just want to
17122 test for >0, but internally the negative value is used.
17124 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17125 a decl-specifier-seq unless it declares a constructor, destructor,
17126 or conversion. It might seem that we could check this condition in
17127 semantic analysis, rather than parsing, but that makes it difficult
17128 to handle something like `f()'. We want to notice that there are
17129 no decl-specifiers, and therefore realize that this is an
17130 expression, not a declaration.)
17132 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17133 the declarator is a direct-declarator of the form "(...)".
17135 MEMBER_P is true iff this declarator is a member-declarator.
17137 FRIEND_P is true iff this declarator is a friend. */
17141 cp_parser_declarator_kind dcl_kind,
17145 {
17148 cp_cv_quals cv_quals;
17149 tree class_type;
17152 /* Assume this is not a constructor, destructor, or type-conversion
17153 operator. */
17160 /* Check for the ptr-operator production. */
17162 /* Parse the ptr-operator. */
17168 /* If that worked, then we have a ptr-operator. */
17170 {
17171 /* If a ptr-operator was found, then this declarator was not
17172 parenthesized. */
17175 /* The dependent declarator is optional if we are parsing an
17176 abstract-declarator. */
17180 /* Parse the dependent declarator. */
17185 friend_p);
17187 /* If we are parsing an abstract-declarator, we must handle the
17188 case where the dependent declarator is absent. */
17193 declarator = cp_parser_make_indirect_declarator
17195 }
17196 /* Everything else is a direct-declarator. */
17197 else
17198 {
17201 CPP_OPEN_PAREN);
17203 ctor_dtor_or_conv_p,
17205 }
17210 }
17212 /* Parse a direct-declarator or direct-abstract-declarator.
17214 direct-declarator:
17215 declarator-id
17216 direct-declarator ( parameter-declaration-clause )
17217 cv-qualifier-seq [opt]
17218 ref-qualifier [opt]
17219 exception-specification [opt]
17220 direct-declarator [ constant-expression [opt] ]
17221 ( declarator )
17223 direct-abstract-declarator:
17224 direct-abstract-declarator [opt]
17225 ( parameter-declaration-clause )
17226 cv-qualifier-seq [opt]
17227 ref-qualifier [opt]
17228 exception-specification [opt]
17229 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17230 ( abstract-declarator )
17232 Returns a representation of the declarator. DCL_KIND is
17233 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17234 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17235 we are parsing a direct-declarator. It is
17236 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17237 of ambiguity we prefer an abstract declarator, as per
17238 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17239 as for cp_parser_declarator. */
17243 cp_parser_declarator_kind dcl_kind,
17246 {
17256 {
17257 /* Peek at the next token. */
17260 {
17261 /* This is either a parameter-declaration-clause, or a
17262 parenthesized declarator. When we know we are parsing a
17263 named declarator, it must be a parenthesized declarator
17264 if FIRST is true. For instance, `(int)' is a
17265 parameter-declaration-clause, with an omitted
17266 direct-abstract-declarator. But `((*))', is a
17267 parenthesized abstract declarator. Finally, when T is a
17268 template parameter `(T)' is a
17269 parameter-declaration-clause, and not a parenthesized
17270 named declarator.
17272 We first try and parse a parameter-declaration-clause,
17273 and then try a nested declarator (if FIRST is true).
17275 It is not an error for it not to be a
17276 parameter-declaration-clause, even when FIRST is
17277 false. Consider,
17279 int i (int);
17280 int i (3);
17282 The first is the declaration of a function while the
17283 second is the definition of a variable, including its
17284 initializer.
17286 Having seen only the parenthesis, we cannot know which of
17287 these two alternatives should be selected. Even more
17288 complex are examples like:
17290 int i (int (a));
17291 int i (int (3));
17293 The former is a function-declaration; the latter is a
17294 variable initialization.
17296 Thus again, we try a parameter-declaration-clause, and if
17297 that fails, we back out and return. */
17300 {
17301 tree params;
17304 /* In a member-declarator, the only valid interpretation
17305 of a parenthesis is the start of a
17306 parameter-declaration-clause. (It is invalid to
17307 initialize a static data member with a parenthesized
17308 initializer; only the "=" form of initialization is
17309 permitted.) */
17313 /* Consume the `('. */
17316 {
17317 /* If this is going to be an abstract declarator, we're
17318 in a declarator and we can't have default args. */
17321 }
17325 /* Parse the parameter-declaration-clause. */
17328 /* Consume the `)'. */
17331 /* If all went well, parse the cv-qualifier-seq,
17332 ref-qualifier and the exception-specification. */
17334 {
17335 cp_cv_quals cv_quals;
17336 cp_virt_specifiers virt_specifiers;
17337 cp_ref_qualifier ref_qual;
17338 tree exception_specification;
17339 tree late_return;
17340 tree attrs;
17350 /* Parse the cv-qualifier-seq. */
17352 /* Parse the ref-qualifier. */
17354 /* And the exception-specification. */
17355 exception_specification
17360 /* In here, we handle cases where attribute is used after
17361 the function declaration. For example:
17362 void func (int x) __attribute__((vector(..))); */
17365 {
17369 CPP_SEMICOLON)
17371 CPP_OPEN_BRACE))
17374 ;
17375 else
17377 }
17378 late_return = (cp_parser_late_return_type_opt
17383 /* Parse the virt-specifier-seq. */
17386 /* Create the function-declarator. */
17388 params,
17389 cv_quals,
17390 virt_specifiers,
17391 ref_qual,
17392 exception_specification,
17393 late_return);
17395 /* Any subsequent parameter lists are to do with
17396 return type, so are not those of the declared
17397 function. */
17399 }
17401 /* Remove the function parms from scope. */
17405 /* Repeat the main loop. */
17407 }
17409 /* If this is the first, we can try a parenthesized
17410 declarator. */
17412 {
17418 /* Consume the `('. */
17420 /* Parse the nested declarator. */
17423 declarator
17429 /* Expect a `)'. */
17436 }
17437 /* Otherwise, we must be done. */
17438 else
17440 }
17444 {
17445 /* Parse an array-declarator. */
17454 /* Consume the `['. */
17456 /* Peek at the next token. */
17458 /* If the next token is `]', then there is no
17459 constant-expression. */
17461 {
17463 bounds
17473 {
17474 /* Normally, the array bound must be an integral constant
17475 expression. However, as an extension, we allow VLAs
17476 in function scopes as long as they aren't part of a
17477 parameter declaration. */
17481 }
17484 {
17485 /* Remember this wasn't a constant-expression. */
17488 }
17489 }
17490 else
17492 /* Look for the closing `]'. */
17494 {
17497 }
17502 }
17504 {
17505 {
17506 tree qualifying_scope;
17507 tree unqualified_name;
17508 tree attrs;
17509 special_function_kind sfk;
17514 /* Parse a declarator-id */
17517 {
17520 /* If we see an ellipsis, we should be looking at a
17521 parameter pack. */
17523 {
17524 /* Consume the `...' */
17528 }
17529 }
17532 unqualified_name
17536 {
17540 {
17541 /* Check whether an error occurred. */
17544 /* We already consumed the ellipsis to mark a
17545 parameter pack, but we have no way to report it,
17546 so abort the tentative parse. We will be exiting
17547 immediately anyway. */
17549 }
17550 else
17556 && (qualifying_scope
17558 {
17561 }
17562 }
17567 {
17572 }
17578 {
17579 /* In the declaration of a member of a template class
17580 outside of the class itself, the SCOPE will sometimes
17581 be a TYPENAME_TYPE. For example, given:
17583 template <typename T>
17584 int S<T>::R::i = 3;
17586 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17587 this context, we must resolve S<T>::R to an ordinary
17588 type, rather than a typename type.
17590 The reason we normally avoid resolving TYPENAME_TYPEs
17591 is that a specialization of `S' might render
17592 `S<T>::R' not a type. However, if `S' is
17593 specialized, then this `i' will not be used, so there
17594 is no harm in resolving the types here. */
17595 tree type;
17597 /* Resolve the TYPENAME_TYPE. */
17600 /* If that failed, the declarator is invalid. */
17602 {
17605 "cannot define member of dependent typedef "
17607 else
17612 }
17614 }
17619 {
17620 tree class_type;
17625 else
17629 {
17632 {
17635 {
17639 "use %<%T::%D%> instead of %<%T::%D%> to "
17641 class_type,
17646 }
17647 else
17649 }
17650 else
17651 {
17652 /* We do not attempt to print the declarator
17653 here because we do not have enough
17654 information about its original syntactic
17655 form. */
17659 }
17660 }
17663 {
17669 for an anonymous type, even if the type
17670 got a name for linkage purposes. */
17672 /* Handle correctly (c++/19200):
17674 struct S {
17675 struct T{};
17676 friend void S(T);
17677 };
17679 and also:
17681 namespace N {
17682 void S();
17683 }
17685 struct S {
17686 friend void N::S();
17687 }; */
17688 && !(friend_p
17691 class_type))
17692 {
17695 }
17703 }
17704 }
17706 unqualified_name,
17707 sfk);
17714 }
17716 handle_declarator:;
17719 {
17720 /* Any names that appear after the declarator-id for a
17721 member are looked up in the containing scope. */
17723 {
17724 /* But declarations with qualified-ids can't appear in a
17725 function. */
17729 }
17731 }
17735 /* Default args are only allowed on function
17736 declarations. */
17738 else
17742 }
17743 /* We're done. */
17744 else
17746 }
17748 /* For an abstract declarator, we might wind up with nothing at this
17749 point. That's an error; the declarator is not optional. */
17753 /* If we entered a scope, we must exit it now. */
17761 }
17763 /* Parse a ptr-operator.
17765 ptr-operator:
17766 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17767 * cv-qualifier-seq [opt]
17768 &
17769 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17770 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17772 GNU Extension:
17774 ptr-operator:
17775 & cv-qualifier-seq [opt]
17777 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17778 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17779 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17780 filled in with the TYPE containing the member. *CV_QUALS is
17781 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17782 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17783 Note that the tree codes returned by this function have nothing
17784 to do with the types of trees that will be eventually be created
17785 to represent the pointer or reference type being parsed. They are
17786 just constants with suggestive names. */
17787 static enum tree_code
17792 {
17797 /* Assume that it's not a pointer-to-member. */
17799 /* And that there are no cv-qualifiers. */
17802 /* Peek at the next token. */
17805 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17815 {
17816 /* Consume the `*', `&' or `&&'. */
17819 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17820 `&', if we are allowing GNU extensions. (The only qualifier
17821 that can legally appear after `&' is `restrict', but that is
17822 enforced during semantic analysis. */
17830 }
17831 else
17832 {
17833 /* Try the pointer-to-member case. */
17835 /* Look for the optional `::' operator. */
17838 /* Look for the nested-name specifier. */
17845 /* If we found it, and the next token is a `*', then we are
17846 indeed looking at a pointer-to-member operator. */
17849 {
17850 /* Indicate that the `*' operator was used. */
17858 else
17859 {
17860 /* The type of which the member is a member is given by the
17861 current SCOPE. */
17863 /* The next name will not be qualified. */
17867 /* Look for optional c++11 attributes. */
17871 /* Look for the optional cv-qualifier-seq. */
17873 }
17874 }
17875 /* If that didn't work we don't have a ptr-operator. */
17878 }
17881 }
17883 /* Parse an (optional) cv-qualifier-seq.
17885 cv-qualifier-seq:
17886 cv-qualifier cv-qualifier-seq [opt]
17888 cv-qualifier:
17889 const
17890 volatile
17892 GNU Extension:
17894 cv-qualifier:
17895 __restrict__
17897 Returns a bitmask representing the cv-qualifiers. */
17899 static cp_cv_quals
17901 {
17905 {
17907 cp_cv_quals cv_qualifier;
17909 /* Peek at the next token. */
17911 /* See if it's a cv-qualifier. */
17913 {
17929 }
17935 {
17938 }
17939 else
17940 {
17943 }
17944 }
17947 }
17949 /* Parse an (optional) ref-qualifier
17951 ref-qualifier:
17952 &
17953 &&
17955 Returns cp_ref_qualifier representing ref-qualifier. */
17957 static cp_ref_qualifier
17959 {
17962 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17967 {
17972 {
17984 }
17989 {
17992 }
17993 else
17994 {
17997 }
17998 }
18001 }
18003 /* Parse an (optional) virt-specifier-seq.
18005 virt-specifier-seq:
18006 virt-specifier virt-specifier-seq [opt]
18008 virt-specifier:
18009 override
18010 final
18012 Returns a bitmask representing the virt-specifiers. */
18014 static cp_virt_specifiers
18016 {
18020 {
18022 cp_virt_specifiers virt_specifier;
18024 /* Peek at the next token. */
18026 /* See if it's a virt-specifier-qualifier. */
18030 {
18033 }
18035 {
18038 }
18040 {
18042 }
18043 else
18047 {
18050 }
18051 else
18052 {
18055 }
18056 }
18058 }
18060 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18061 is in scope even though it isn't real. */
18063 void
18065 {
18066 tree this_parm;
18069 {
18070 /* We don't clear this between NSDMIs. Is it already what we want? */
18075 }
18078 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18080 current_class_ref
18083 }
18085 /* Return true iff our current scope is a non-static data member
18086 initializer. */
18088 bool
18090 {
18091 /* We recognize NSDMI context by the context-less 'this' pointer set up
18092 by the function above. */
18096 }
18098 /* Parse a late-specified return type, if any. This is not a separate
18099 non-terminal, but part of a function declarator, which looks like
18101 -> trailing-type-specifier-seq abstract-declarator(opt)
18103 Returns the type indicated by the type-id.
18105 In addition to this this parses any queued up omp declare simd
18106 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18108 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18109 function. */
18111 static tree
18113 cp_cv_quals quals)
18114 {
18118 && declarator
18124 /* Peek at the next token. */
18126 /* A late-specified return type is indicated by an initial '->'. */
18133 {
18134 /* DR 1207: 'this' is in scope in the trailing return type. */
18136 }
18139 {
18140 /* Consume the ->. */
18144 }
18147 declarator->std_attributes
18151 declarator->std_attributes
18156 {
18159 }
18162 }
18164 /* Parse a declarator-id.
18166 declarator-id:
18167 id-expression
18168 :: [opt] nested-name-specifier [opt] type-name
18170 In the `id-expression' case, the value returned is as for
18171 cp_parser_id_expression if the id-expression was an unqualified-id.
18172 If the id-expression was a qualified-id, then a SCOPE_REF is
18173 returned. The first operand is the scope (either a NAMESPACE_DECL
18174 or TREE_TYPE), but the second is still just a representation of an
18175 unqualified-id. */
18177 static tree
18179 {
18180 tree id;
18181 /* The expression must be an id-expression. Assume that qualified
18182 names are the names of types so that:
18184 template <class T>
18185 int S<T>::R::i = 3;
18187 will work; we must treat `S<T>::R' as the name of a type.
18188 Similarly, assume that qualified names are templates, where
18189 required, so that:
18191 template <class T>
18192 int S<T>::R<T>::i = 3;
18194 will work, too. */
18200 optional_p);
18204 }
18206 /* Parse a type-id.
18208 type-id:
18209 type-specifier-seq abstract-declarator [opt]
18211 Returns the TYPE specified. */
18213 static tree
18216 {
18217 cp_decl_specifier_seq type_specifier_seq;
18220 /* Parse the type-specifier-seq. */
18222 is_trailing_return,
18227 /* There might or might not be an abstract declarator. */
18229 /* Look for the declarator. */
18230 abstract_declarator
18235 /* Check to see if there really was a declarator. */
18240 /* None of the valid uses of 'auto' in C++14 involve the type-id
18241 nonterminal, but it is valid in a trailing-return-type. */
18244 {
18245 /* A type-id with type 'auto' is only ok if the abstract declarator
18246 is a function declarator with a late-specified return type. */
18251 else
18252 {
18255 }
18256 }
18259 is_template_arg);
18260 }
18263 {
18265 }
18268 {
18269 tree r;
18271 parser->type_definition_forbidden_message
18276 {
18279 }
18281 }
18284 {
18286 }
18288 /* Parse a type-specifier-seq.
18290 type-specifier-seq:
18291 type-specifier type-specifier-seq [opt]
18293 GNU extension:
18295 type-specifier-seq:
18296 attributes type-specifier-seq [opt]
18298 If IS_DECLARATION is true, we are at the start of a "condition" or
18299 exception-declaration, so we might be followed by a declarator-id.
18301 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18302 i.e. we've just seen "->".
18304 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18306 static void
18311 {
18316 /* Clear the TYPE_SPECIFIER_SEQ. */
18319 /* In the context of a trailing return type, enum E { } is an
18320 elaborated-type-specifier followed by a function-body, not an
18321 enum-specifier. */
18325 /* Parse the type-specifiers and attributes. */
18327 {
18328 tree type_specifier;
18331 /* Check for attributes first. */
18333 {
18338 }
18340 /* record the token of the beginning of the type specifier seq,
18341 for error reporting purposes*/
18345 /* Look for the type-specifier. */
18347 flags,
18348 type_specifier_seq,
18350 NULL,
18353 {
18354 /* If the first type-specifier could not be found, this is not a
18355 type-specifier-seq at all. */
18357 {
18358 /* Set in_declarator_p to avoid skipping to the semicolon. */
18370 }
18371 /* If subsequent type-specifiers could not be found, the
18372 type-specifier-seq is complete. */
18374 }
18377 /* The standard says that a condition can be:
18379 type-specifier-seq declarator = assignment-expression
18381 However, given:
18383 struct S {};
18384 if (int S = ...)
18386 we should treat the "S" as a declarator, not as a
18387 type-specifier. The standard doesn't say that explicitly for
18388 type-specifier-seq, but it does say that for
18389 decl-specifier-seq in an ordinary declaration. Perhaps it
18390 would be clearer just to allow a decl-specifier-seq here, and
18391 then add a semantic restriction that if any decl-specifiers
18392 that are not type-specifiers appear, the program is invalid. */
18395 }
18396 }
18398 /* Return whether the function currently being declared has an associated
18399 template parameter list. */
18401 static bool
18403 {
18416 }
18418 /* Parse a parameter-declaration-clause.
18420 parameter-declaration-clause:
18421 parameter-declaration-list [opt] ... [opt]
18422 parameter-declaration-list , ...
18424 Returns a representation for the parameter declarations. A return
18425 value of NULL indicates a parameter-declaration-clause consisting
18426 only of an ellipsis. */
18428 static tree
18430 {
18431 tree parameters;
18440 parser->auto_is_implicit_function_template_parm_p
18442 }
18448 && !processing_template_parmlist
18454 /* Peek at the next token. */
18456 /* Check for trivial parameter-declaration-clauses. */
18458 {
18459 /* Consume the `...' token. */
18462 }
18464 /* There are no parameters. */
18465 {
18466 #ifndef NO_IMPLICIT_EXTERN_C
18471 else
18472 #endif
18474 }
18475 /* Check for `(void)', too, which is a special case. */
18479 {
18480 /* Consume the `void' token. */
18482 /* There are no parameters. */
18484 }
18486 /* Parse the parameter-declaration-list. */
18488 /* If a parse error occurred while parsing the
18489 parameter-declaration-list, then the entire
18490 parameter-declaration-clause is erroneous. */
18494 /* Peek at the next token. */
18496 /* If it's a `,', the clause should terminate with an ellipsis. */
18498 {
18499 /* Consume the `,'. */
18501 /* Expect an ellipsis. */
18502 ellipsis_p
18504 }
18505 /* It might also be `...' if the optional trailing `,' was
18506 omitted. */
18508 {
18509 /* Consume the `...' token. */
18511 /* And remember that we saw it. */
18513 }
18514 else
18517 /* Finish the parameter list. */
18522 }
18524 /* Parse a parameter-declaration-list.
18526 parameter-declaration-list:
18527 parameter-declaration
18528 parameter-declaration-list , parameter-declaration
18530 Returns a representation of the parameter-declaration-list, as for
18531 cp_parser_parameter_declaration_clause. However, the
18532 `void_list_node' is never appended to the list. Upon return,
18533 *IS_ERROR will be true iff an error occurred. */
18535 static tree
18537 {
18543 /* Assume all will go well. */
18545 /* The special considerations that apply to a function within an
18546 unbraced linkage specifications do not apply to the parameters
18547 to the function. */
18548 saved_in_unbraced_linkage_specification_p
18552 /* Look for more parameters. */
18554 {
18562 /* Parse the parameter. */
18563 parameter
18568 /* We don't know yet if the enclosing context is deprecated, so wait
18569 and warn in grokparms if appropriate. */
18573 {
18574 /* If a function parameter pack was specified and an implicit template
18575 parameter was introduced during cp_parser_parameter_declaration,
18576 change any implicit parameters introduced into packs. */
18580 {
18588 }
18592 PARM,
18595 }
18599 /* If a parse error occurred parsing the parameter declaration,
18600 then the entire parameter-declaration-list is erroneous. */
18602 {
18606 }
18616 {
18620 }
18622 /* Add the new parameter to the list. */
18626 /* Peek at the next token. */
18629 /* These are for Objective-C++ */
18632 /* The parameter-declaration-list is complete. */
18635 {
18638 /* Peek at the next token. */
18640 /* If it's an ellipsis, then the list is complete. */
18643 /* Otherwise, there must be more parameters. Consume the
18644 `,'. */
18646 /* When parsing something like:
18648 int i(float f, double d)
18650 we can tell after seeing the declaration for "f" that we
18651 are not looking at an initialization of a variable "i",
18652 but rather at the declaration of a function "i".
18654 Due to the fact that the parsing of template arguments
18655 (as specified to a template-id) requires backtracking we
18656 cannot use this technique when inside a template argument
18657 list. */
18661 /* However, a parameter-declaration of the form
18662 "float(f)" (which is a valid declaration of a
18663 parameter "f") can also be interpreted as an
18664 expression (the conversion of "f" to "float"). */
18667 }
18668 else
18669 {
18677 }
18678 }
18680 parser->in_unbraced_linkage_specification_p
18683 /* Reset implicit_template_scope if we are about to leave the function
18684 parameter list that introduced it. Note that for out-of-line member
18685 definitions, there will be one or more class scopes before we get to
18686 the template parameter scope. */
18690 {
18694 {
18697 }
18698 }
18701 }
18703 /* Parse a parameter declaration.
18705 parameter-declaration:
18706 decl-specifier-seq ... [opt] declarator
18707 decl-specifier-seq declarator = assignment-expression
18708 decl-specifier-seq ... [opt] abstract-declarator [opt]
18709 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18711 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18712 declares a template parameter. (In that case, a non-nested `>'
18713 token encountered during the parsing of the assignment-expression
18714 is not interpreted as a greater-than operator.)
18716 Returns a representation of the parameter, or NULL if an error
18717 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18718 true iff the declarator is of the form "(p)". */
18724 {
18726 cp_decl_specifier_seq decl_specifiers;
18728 tree default_argument;
18732 /* In a template parameter, `>' is not an operator.
18734 [temp.param]
18736 When parsing a default template-argument for a non-type
18737 template-parameter, the first non-nested `>' is taken as the end
18738 of the template parameter-list rather than a greater-than
18739 operator. */
18741 /* Type definitions may not appear in parameter types. */
18743 parser->type_definition_forbidden_message
18746 /* Parse the declaration-specifiers. */
18748 CP_PARSER_FLAGS_NONE,
18752 /* Complain about missing 'typename' or other invalid type names. */
18757 /* If an error occurred, there's no reason to attempt to parse the
18758 rest of the declaration. */
18760 {
18763 }
18765 /* Peek at the next token. */
18768 /* If the next token is a `)', `,', `=', `>', or `...', then there
18769 is no declarator. However, when variadic templates are enabled,
18770 there may be a declarator following `...'. */
18775 {
18779 }
18780 /* Otherwise, there should be a declarator. */
18781 else
18782 {
18786 /* After seeing a decl-specifier-seq, if the next token is not a
18787 "(", there is no possibility that the code is a valid
18788 expression. Therefore, if parsing tentatively, we commit at
18789 this point. */
18791 /* In an expression context, having seen:
18793 (int((char ...
18795 we cannot be sure whether we are looking at a
18796 function-type (taking a "char" as a parameter) or a cast
18797 of some object of type "char" to "int". */
18803 /* Parse the declarator. */
18806 CP_PARSER_DECLARATOR_EITHER,
18808 parenthesized_p,
18812 /* After the declarator, allow more attributes. */
18813 decl_specifiers.attributes
18816 }
18818 /* If the next token is an ellipsis, and we have not seen a
18819 declarator name, and the type of the declarator contains parameter
18820 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18821 a parameter pack expansion expression. Otherwise, leave the
18822 ellipsis for a C-style variadic function. */
18825 {
18836 {
18837 /* Consume the `...'. */
18841 /* Build a pack expansion type */
18844 else
18846 }
18847 }
18849 /* The restriction on defining new types applies only to the type
18850 of the parameter, not to the default argument. */
18853 /* If the next token is `=', then process a default argument. */
18855 {
18857 /* If we are defining a class, then the tokens that make up the
18858 default argument must be saved and processed later. */
18863 /* Outside of a class definition, we can just parse the
18864 assignment-expression. */
18865 else
18866 default_argument
18870 {
18873 else
18874 {
18876 "default arguments are only "
18879 }
18880 }
18884 {
18885 /* Find the name of the parameter pack. */
18892 template_parm_p
18898 else
18900 template_parm_p
18907 }
18908 }
18909 else
18913 declarator,
18914 default_argument);
18915 }
18917 /* Parse a default argument and return it.
18919 TEMPLATE_PARM_P is true if this is a default argument for a
18920 non-type template parameter. */
18921 static tree
18923 {
18929 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18930 set correctly. */
18933 /* Local variable names (and the `this' keyword) may not
18934 appear in a default argument. */
18937 /* Parse the assignment-expression. */
18942 /* The "this" pointer is not valid in a default argument. */
18944 {
18949 }
18950 default_argument
18952 /* Restore the "this" pointer. */
18954 {
18957 }
18966 }
18968 /* Parse a function-body.
18970 function-body:
18971 compound_statement */
18973 static void
18975 {
18977 }
18979 /* Parse a ctor-initializer-opt followed by a function-body. Return
18980 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18981 is true we are parsing a function-try-block. */
18983 static bool
18986 {
18994 /* Begin the function body. */
18996 /* Parse the optional ctor-initializer. */
18999 /* If we're parsing a constexpr constructor definition, we need
19000 to check that the constructor body is indeed empty. However,
19001 before we get to cp_parser_function_body lot of junk has been
19002 generated, so we can't just check that we have an empty block.
19003 Rather we take a snapshot of the outermost block, and check whether
19004 cp_parser_function_body changed its state. */
19006 {
19010 }
19011 /* Parse the function-body. */
19015 /* Finish the function body. */
19019 }
19021 /* Parse an initializer.
19023 initializer:
19024 = initializer-clause
19025 ( expression-list )
19027 Returns an expression representing the initializer. If no
19028 initializer is present, NULL_TREE is returned.
19030 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19031 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19032 set to TRUE if there is no initializer present. If there is an
19033 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19034 is set to true; otherwise it is set to false. */
19036 static tree
19039 {
19041 tree init;
19043 /* Peek at the next token. */
19046 /* Let our caller know whether or not this initializer was
19047 parenthesized. */
19049 /* Assume that the initializer is constant. */
19053 {
19054 /* Consume the `='. */
19056 /* Parse the initializer-clause. */
19058 }
19060 {
19065 non_constant_p);
19070 }
19072 {
19077 }
19078 else
19079 {
19080 /* Anything else is an error. */
19083 }
19086 }
19088 /* Parse an initializer-clause.
19090 initializer-clause:
19091 assignment-expression
19092 braced-init-list
19094 Returns an expression representing the initializer.
19096 If the `assignment-expression' production is used the value
19097 returned is simply a representation for the expression.
19099 Otherwise, calls cp_parser_braced_list. */
19101 static tree
19103 {
19104 tree initializer;
19106 /* Assume the expression is constant. */
19109 /* If it is not a `{', then we are looking at an
19110 assignment-expression. */
19112 {
19113 initializer
19116 non_constant_p);
19117 }
19118 else
19122 }
19124 /* Parse a brace-enclosed initializer list.
19126 braced-init-list:
19127 { initializer-list , [opt] }
19128 { }
19130 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19131 the elements of the initializer-list (or NULL, if the last
19132 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19133 NULL_TREE. There is no way to detect whether or not the optional
19134 trailing `,' was provided. NON_CONSTANT_P is as for
19135 cp_parser_initializer. */
19137 static tree
19139 {
19140 tree initializer;
19142 /* Consume the `{' token. */
19144 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19146 /* If it's not a `}', then there is a non-trivial initializer. */
19148 {
19149 /* Parse the initializer list. */
19152 /* A trailing `,' token is allowed. */
19155 }
19156 else
19158 /* Now, there should be a trailing `}'. */
19162 }
19164 /* Consume tokens up to, and including, the next non-nested closing `]'.
19165 Returns true iff we found a closing `]'. */
19167 static bool
19169 {
19173 {
19177 {
19180 /* If we've run out of tokens, then there is no closing `]'. */
19189 {
19192 }
19197 }
19199 /* Consume the token. */
19201 }
19202 }
19204 /* Return true if we are looking at an array-designator, false otherwise. */
19206 static bool
19208 {
19209 /* Consume the `['. */
19214 /* Skip tokens until the next token is a closing square bracket.
19215 If we find the closing `]', and the next token is a `=', then
19216 we are looking at an array designator. */
19217 bool array_designator_p
19221 /* Roll back the tokens we skipped. */
19225 }
19227 /* Parse an initializer-list.
19229 initializer-list:
19230 initializer-clause ... [opt]
19231 initializer-list , initializer-clause ... [opt]
19233 GNU Extension:
19235 initializer-list:
19236 designation initializer-clause ...[opt]
19237 initializer-list , designation initializer-clause ...[opt]
19239 designation:
19240 . identifier =
19241 identifier :
19242 [ constant-expression ] =
19244 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19245 for the initializer. If the INDEX of the elt is non-NULL, it is the
19246 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19247 as for cp_parser_initializer. */
19251 {
19254 /* Assume all of the expressions are constant. */
19257 /* Parse the rest of the list. */
19259 {
19261 tree designator;
19262 tree initializer;
19265 /* If the next token is an identifier and the following one is a
19266 colon, we are looking at the GNU designated-initializer
19267 syntax. */
19271 {
19272 /* Warn the user that they are using an extension. */
19275 /* Consume the identifier. */
19277 /* Consume the `:'. */
19279 }
19280 /* Also handle the C99 syntax, '. id ='. */
19285 {
19286 /* Warn the user that they are using an extension. */
19289 /* Consume the `.'. */
19291 /* Consume the identifier. */
19293 /* Consume the `='. */
19295 }
19296 /* Also handle C99 array designators, '[ const ] ='. */
19300 {
19301 /* In C++11, [ could start a lambda-introducer. */
19307 {
19310 }
19311 else
19312 {
19317 }
19323 }
19324 else
19327 /* Parse the initializer. */
19330 /* If any clause is non-constant, so is the entire initializer. */
19334 /* If we have an ellipsis, this is an initializer pack
19335 expansion. */
19337 {
19338 /* Consume the `...'. */
19341 /* Turn the initializer into an initializer expansion. */
19343 }
19345 /* Add it to the vector. */
19348 /* If the next token is not a comma, we have reached the end of
19349 the list. */
19353 /* Peek at the next token. */
19355 /* If the next token is a `}', then we're still done. An
19356 initializer-clause can have a trailing `,' after the
19357 initializer-list and before the closing `}'. */
19361 /* Consume the `,' token. */
19363 }
19366 }
19368 /* Classes [gram.class] */
19370 /* Parse a class-name.
19372 class-name:
19373 identifier
19374 template-id
19376 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19377 to indicate that names looked up in dependent types should be
19378 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19379 keyword has been used to indicate that the name that appears next
19380 is a template. TAG_TYPE indicates the explicit tag given before
19381 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19382 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19383 is the class being defined in a class-head.
19385 Returns the TYPE_DECL representing the class. */
19387 static tree
19395 {
19396 tree decl;
19397 tree scope;
19402 /* All class-names start with an identifier. */
19405 {
19408 }
19410 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19411 to a template-id, so we save it here. */
19416 /* Any name names a type if we're following the `typename' keyword
19417 in a qualified name where the enclosing scope is type-dependent. */
19420 /* Handle the common case (an identifier, but not a template-id)
19421 efficiently. */
19424 {
19428 /* Look for the identifier. */
19432 /* If the next token isn't an identifier, we are certainly not
19433 looking at a class-name. */
19436 /* If we know this is a type-name, there's no need to look it
19437 up. */
19440 else
19441 {
19442 tree ambiguous_decls;
19443 /* If we already know that this lookup is ambiguous, then
19444 we've already issued an error message; there's no reason
19445 to check again. */
19447 {
19450 }
19451 /* If the next token is a `::', then the name must be a type
19452 name.
19454 [basic.lookup.qual]
19456 During the lookup for a name preceding the :: scope
19457 resolution operator, object, function, and enumerator
19458 names are ignored. */
19461 /* Look up the name. */
19463 tag_type,
19466 check_dependency_p,
19470 {
19474 }
19475 }
19476 }
19477 else
19478 {
19479 /* Try a template-id. */
19481 check_dependency_p,
19482 tag_type,
19483 is_declaration);
19486 }
19490 /* If this is a typename, create a TYPENAME_TYPE. */
19492 {
19497 }
19501 /* Check to see that it is really the name of a class. */
19505 /* Situations like this:
19507 template <typename T> struct A {
19508 typename T::template X<int>::I i;
19509 };
19511 are problematic. Is `T::template X<int>' a class-name? The
19512 standard does not seem to be definitive, but there is no other
19513 valid interpretation of the following `::'. Therefore, those
19514 names are considered class-names. */
19515 {
19519 }
19523 /* In Objective-C 2.0, a classname followed by '.' starts a
19524 dot-syntax expression, and it's not a type-name. */
19536 }
19538 /* Parse a class-specifier.
19540 class-specifier:
19541 class-head { member-specification [opt] }
19543 Returns the TREE_TYPE representing the class. */
19545 static tree
19547 {
19548 tree type;
19562 /* Parse the class-head. */
19565 /* If the class-head was a semantic disaster, skip the entire body
19566 of the class. */
19568 {
19572 }
19574 /* Look for the `{'. */
19576 {
19579 }
19583 /* Issue an error message if type-definitions are forbidden here. */
19585 /* Remember that we are defining one more class. */
19587 /* Inside the class, surrounding template-parameter-lists do not
19588 apply. */
19589 saved_num_template_parameter_lists
19592 /* We are not in a function body. */
19595 /* Or in a loop. */
19598 /* Or in a switch. */
19601 /* We are not immediately inside an extern "lang" block. */
19602 saved_in_unbraced_linkage_specification_p
19606 /* Start the class. */
19608 {
19611 }
19615 /* If the type is erroneous, skip the entire body of the class. */
19617 else
19618 /* Parse the member-specification. */
19621 /* Look for the trailing `}'. */
19623 /* Look for trailing attributes to apply to this class. */
19631 /* We've finished a type definition. Check for the common syntax
19632 error of forgetting a semicolon after the definition. We need to
19633 be careful, as we can't just check for not-a-semicolon and be done
19634 with it; the user might have typed:
19636 class X { } c = ...;
19637 class X { } *p = ...;
19639 and so forth. Instead, enumerate all the possible tokens that
19640 might follow this production; if we don't see one of them, then
19641 complain and silently insert the semicolon. */
19642 {
19647 /* Don't try to parse c++11 attributes here. As per the
19648 grammar, that should be a task for
19649 cp_parser_decl_specifier_seq. */
19653 {
19664 /* While it's legal for type qualifiers and storage class
19665 specifiers to follow type definitions in the grammar, only
19666 compiler testsuites contain code like that. Assume that if
19667 we see such code, then what we're really seeing is a case
19668 like:
19670 class X { }
19671 const <type> var = ...;
19673 or
19675 class Y { }
19676 static <type> func (...) ...
19678 i.e. the qualifier or specifier applies to the next
19679 declaration. To do so, however, we need to look ahead one
19680 more token to see if *that* token is a type specifier.
19682 This code could be improved to handle:
19684 class Z { }
19685 static const <type> var = ...; */
19688 {
19691 /* Handling user-defined types here would be nice, but very
19692 tricky. */
19693 want_semicolon
19696 }
19700 }
19702 /* If we don't have a type, then something is very wrong and we
19703 shouldn't try to do anything clever. Likewise for not seeing the
19704 closing brace. */
19706 {
19707 cp_token_position prev
19718 else
19721 /* Unget one token and smash it to look as though we encountered
19722 a semicolon in the input stream. */
19727 }
19728 }
19730 /* If this class is not itself within the scope of another class,
19731 then we need to parse the bodies of all of the queued function
19732 definitions. Note that the queued functions defined in a class
19733 are not always processed immediately following the
19734 class-specifier for that class. Consider:
19736 struct A {
19737 struct B { void f() { sizeof (A); } };
19738 };
19740 If `f' were processed before the processing of `A' were
19741 completed, there would be no way to compute the size of `A'.
19742 Note that the nesting we are interested in here is lexical --
19743 not the semantic nesting given by TYPE_CONTEXT. In particular,
19744 for:
19746 struct A { struct B; };
19747 struct A::B { void f() { } };
19749 there is no need to delay the parsing of `A::B::f'. */
19751 {
19752 tree decl;
19759 /* In a first pass, parse default arguments to the functions.
19760 Then, in a second pass, parse the bodies of the functions.
19761 This two-phased approach handles cases like:
19763 struct S {
19764 void f() { g(); }
19765 void g(int i = 3);
19766 };
19768 */
19770 {
19772 /* If there are default arguments that have not yet been processed,
19773 take care of them now. */
19775 {
19780 }
19781 /* Make sure that any template parameters are in scope. */
19783 /* Parse the default argument expressions. */
19785 /* Remove any template parameters from the symbol table. */
19787 }
19789 /* Now parse any NSDMIs. */
19793 {
19795 {
19800 }
19803 }
19810 /* Now do some post-NSDMI bookkeeping. */
19816 /* Now parse the body of the functions. */
19818 {
19819 /* OpenMP UDRs need to be parsed before all other functions. */
19826 }
19827 else
19831 }
19832 else
19835 /* Put back any saved access checks. */
19838 /* Restore saved state. */
19842 parser->num_template_parameter_lists
19844 parser->in_unbraced_linkage_specification_p
19848 }
19850 static tree
19852 {
19853 tree ret;
19858 }
19860 /* Parse a class-head.
19862 class-head:
19863 class-key identifier [opt] base-clause [opt]
19864 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19865 class-key nested-name-specifier [opt] template-id
19866 base-clause [opt]
19868 class-virt-specifier:
19869 final
19871 GNU Extensions:
19872 class-key attributes identifier [opt] base-clause [opt]
19873 class-key attributes nested-name-specifier identifier base-clause [opt]
19874 class-key attributes nested-name-specifier [opt] template-id
19875 base-clause [opt]
19877 Upon return BASES is initialized to the list of base classes (or
19878 NULL, if there are none) in the same form returned by
19879 cp_parser_base_clause.
19881 Returns the TYPE of the indicated class. Sets
19882 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19883 involving a nested-name-specifier was used, and FALSE otherwise.
19885 Returns error_mark_node if this is not a class-head.
19887 Returns NULL_TREE if the class-head is syntactically valid, but
19888 semantically invalid in a way that means we should skip the entire
19889 body of the class. */
19891 static tree
19894 {
19895 tree nested_name_specifier;
19899 tree attributes;
19900 tree bases;
19910 /* Assume no nested-name-specifier will be present. */
19912 /* Assume no template parameter lists will be used in defining the
19913 type. */
19917 /* Look for the class-key. */
19922 /* Parse the attributes. */
19925 /* If the next token is `::', that is invalid -- but sometimes
19926 people do try to write:
19928 struct ::S {};
19930 Handle this gracefully by accepting the extra qualifier, and then
19931 issuing an error about it later if this really is a
19932 class-head. If it turns out just to be an elaborated type
19933 specifier, remain silent. */
19939 /* Determine the name of the class. Begin by looking for an
19940 optional nested-name-specifier. */
19942 nested_name_specifier
19948 /* If there was a nested-name-specifier, then there *must* be an
19949 identifier. */
19951 {
19953 /* Although the grammar says `identifier', it really means
19954 `class-name' or `template-name'. You are only allowed to
19955 define a class that has already been declared with this
19956 syntax.
19958 The proposed resolution for Core Issue 180 says that wherever
19959 you see `class T::X' you should treat `X' as a type-name.
19961 It is OK to define an inaccessible class; for example:
19963 class A { class B; };
19964 class A::B {};
19966 We do not know if we will see a class-name, or a
19967 template-name. We look for a class-name first, in case the
19968 class-name is a template-id; if we looked for the
19969 template-name first we would stop after the template-name. */
19974 class_type,
19978 /* If that didn't work, ignore the nested-name-specifier. */
19980 {
19986 }
19987 /* If we could not find a corresponding TYPE, treat this
19988 declaration like an unqualified declaration. */
19991 /* Otherwise, count the number of templates used in TYPE and its
19992 containing scopes. */
19993 else
19994 {
19995 tree scope;
20007 }
20008 }
20009 /* Otherwise, the identifier is optional. */
20010 else
20011 {
20012 /* We don't know whether what comes next is a template-id,
20013 an identifier, or nothing at all. */
20015 /* Check for a template-id. */
20020 class_key,
20022 /* If that didn't work, it could still be an identifier. */
20024 {
20026 {
20029 }
20030 else
20032 }
20033 else
20034 {
20037 }
20038 }
20043 {
20045 class_key,
20047 }
20050 /* If it's not a `:' or a `{' then we can't really be looking at a
20051 class-head, since a class-head only appears as part of a
20052 class-specifier. We have to detect this situation before calling
20053 xref_tag, since that has irreversible side-effects. */
20055 {
20059 }
20061 /* At this point, we're going ahead with the class-specifier, even
20062 if some other problem occurs. */
20065 {
20070 }
20071 /* Issue the error about the overly-qualified name now. */
20073 {
20078 }
20080 {
20085 }
20087 {
20088 tree scope;
20090 /* Reject typedef-names in class heads. */
20092 {
20095 type);
20098 }
20100 /* Figure out in what scope the declaration is being placed. */
20102 /* If that scope does not contain the scope in which the
20103 class was originally declared, the program is invalid. */
20105 {
20108 "declaration of %qD in namespace %qD which does not "
20111 else
20117 }
20118 /* [dcl.meaning]
20120 A declarator-id shall not be qualified except for the
20121 definition of a ... nested class outside of its class
20122 ... [or] the definition or explicit instantiation of a
20123 class member of a namespace outside of its namespace. */
20125 {
20130 }
20131 }
20132 /* An explicit-specialization must be preceded by "template <>". If
20133 it is not, try to recover gracefully. */
20137 {
20141 /* Take the same action that would have been taken by
20142 cp_parser_explicit_specialization. */
20145 }
20146 /* There must be no "return" statements between this point and the
20147 end of this function; set "type "to the correct return value and
20148 use "goto done;" to return. */
20149 /* Make sure that the right number of template parameters were
20150 present. */
20154 {
20155 /* If something went wrong, there is no point in even trying to
20156 process the class-definition. */
20159 }
20161 /* Look up the type. */
20163 {
20167 {
20171 }
20172 else
20173 {
20176 }
20179 }
20181 {
20182 tree class_type;
20184 /* Given:
20186 template <typename T> struct S { struct T };
20187 template <typename T> struct S<T>::T { };
20189 we will get a TYPENAME_TYPE when processing the definition of
20190 `S::T'. We need to resolve it to the actual type before we
20191 try to define it. */
20193 {
20198 else
20199 {
20202 }
20203 }
20207 {
20210 }
20213 /* Enter the scope indicated by the nested-name-specifier. */
20215 /* Get the canonical version of this type. */
20217 /* Call push_template_decl if it seems like we should be defining a
20218 template either from the template headers or the type we're
20219 defining, so that we diagnose both extra and missing headers. */
20225 {
20228 {
20231 }
20232 }
20236 }
20238 {
20239 /* If the class was unnamed, create a dummy name. */
20244 }
20246 /* Indicate whether this class was declared as a `class' or as a
20247 `struct'. */
20252 /* If this type was already complete, and we see another definition,
20253 that's an error. */
20255 {
20257 type);
20259 type);
20262 }
20267 {
20268 /* Apply attributes now, before any use of the class as a template
20269 argument in its base list. */
20272 }
20274 /* We will have entered the scope containing the class; the names of
20275 base classes should be looked up in that context. For example:
20277 struct A { struct B {}; struct C; };
20278 struct A::C : B {};
20280 is valid. */
20282 /* Get the list of base-classes, if there is one. */
20284 {
20285 /* PR59482: enter the class scope so that base-specifiers are looked
20286 up correctly. */
20290 /* PR59482: get out of the previously pushed class scope so that the
20291 subsequent pops pop the right thing. */
20294 }
20295 else
20298 /* If we're really defining a class, process the base classes.
20299 If they're invalid, fail. */
20304 done:
20305 /* Leave the scope given by the nested-name-specifier. We will
20306 enter the class scope itself while processing the members. */
20311 {
20314 }
20320 out:
20323 }
20325 /* Parse a class-key.
20327 class-key:
20328 class
20329 struct
20330 union
20332 Returns the kind of class-key specified, or none_type to indicate
20333 error. */
20335 static enum tag_types
20337 {
20341 /* Look for the class-key. */
20346 /* Check to see if the TOKEN is a class-key. */
20351 }
20353 /* Parse a type-parameter-key.
20355 type-parameter-key:
20356 class
20357 typename
20358 */
20360 static void
20362 {
20363 /* Look for the type-parameter-key. */
20367 {
20370 /* typename is not allowed in a template template parameter
20371 by the standard until C++1Z. */
20373 "ISO C++ forbids typename key in template template parameter;"
20375 }
20376 else
20380 }
20382 /* Parse an (optional) member-specification.
20384 member-specification:
20385 member-declaration member-specification [opt]
20386 access-specifier : member-specification [opt] */
20388 static void
20390 {
20392 {
20396 /* Peek at the next token. */
20398 /* If it's a `}', or EOF then we've seen all the members. */
20404 /* See if this token is a keyword. */
20407 {
20411 /* Consume the access-specifier. */
20413 /* Remember which access-specifier is active. */
20415 /* Look for the `:'. */
20420 /* Accept #pragmas at class scope. */
20422 {
20425 }
20427 /* Otherwise, the next construction must be a
20428 member-declaration. */
20430 }
20431 }
20432 }
20434 /* Parse a member-declaration.
20436 member-declaration:
20437 decl-specifier-seq [opt] member-declarator-list [opt] ;
20438 function-definition ; [opt]
20439 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20440 using-declaration
20441 template-declaration
20442 alias-declaration
20444 member-declarator-list:
20445 member-declarator
20446 member-declarator-list , member-declarator
20448 member-declarator:
20449 declarator pure-specifier [opt]
20450 declarator constant-initializer [opt]
20451 identifier [opt] : constant-expression
20453 GNU Extensions:
20455 member-declaration:
20456 __extension__ member-declaration
20458 member-declarator:
20459 declarator attributes [opt] pure-specifier [opt]
20460 declarator attributes [opt] constant-initializer [opt]
20461 identifier [opt] attributes [opt] : constant-expression
20463 C++0x Extensions:
20465 member-declaration:
20466 static_assert-declaration */
20468 static void
20470 {
20471 cp_decl_specifier_seq decl_specifiers;
20472 tree prefix_attributes;
20473 tree decl;
20482 /* Check for the `__extension__' keyword. */
20484 {
20485 /* Recurse. */
20487 /* Restore the old value of the PEDANTIC flag. */
20491 }
20493 /* Check for a template-declaration. */
20495 {
20496 /* An explicit specialization here is an error condition, and we
20497 expect the specialization handler to detect and report this. */
20501 else
20505 }
20507 /* Check for a using-declaration. */
20509 {
20511 {
20512 /* Parse the using-declaration. */
20516 }
20517 else
20518 {
20519 tree decl;
20523 /* Note that if we actually see the '=' token after the
20524 identifier, cp_parser_alias_declaration commits the
20525 tentative parse. In that case, we really expects an
20526 alias-declaration. Otherwise, we expect a using
20527 declaration. */
20528 alias_decl_expected =
20534 else
20538 }
20539 }
20541 /* Check for @defs. */
20543 {
20548 {
20553 }
20555 }
20557 /* If the next token is `static_assert' we have a static assertion. */
20559 {
20562 }
20569 /* Parse the decl-specifier-seq. */
20572 CP_PARSER_FLAGS_OPTIONAL,
20575 /* Check for an invalid type-name. */
20579 /* If there is no declarator, then the decl-specifier-seq should
20580 specify a type. */
20582 {
20583 /* If there was no decl-specifier-seq, and the next token is a
20584 `;', then we have something like:
20586 struct S { ; };
20588 [class.mem]
20590 Each member-declaration shall declare at least one member
20591 name of the class. */
20593 {
20597 }
20598 else
20599 {
20600 tree type;
20602 /* See if this declaration is a friend. */
20604 /* If there were decl-specifiers, check to see if there was
20605 a class-declaration. */
20608 /* Nested classes have already been added to the class, but
20609 a `friend' needs to be explicitly registered. */
20611 {
20612 /* If the `friend' keyword was present, the friend must
20613 be introduced with a class-key. */
20616 "in C++03 a class-key must be used "
20618 /* In this case:
20620 template <typename T> struct A {
20621 friend struct A<T>::B;
20622 };
20624 A<T>::B will be represented by a TYPENAME_TYPE, and
20625 therefore not recognized by check_tag_decl. */
20627 {
20631 }
20634 "friend declaration does not name a class or "
20636 else
20639 }
20640 /* If there is no TYPE, an error message will already have
20641 been issued. */
20643 ;
20644 /* An anonymous aggregate has to be handled specially; such
20645 a declaration really declares a data member (with a
20646 particular type), as opposed to a nested class. */
20648 {
20649 /* C++11 9.5/6. */
20652 "a storage class on an anonymous aggregate "
20655 /* Remove constructors and such from TYPE, now that we
20656 know it is an anonymous aggregate. */
20658 /* And make the corresponding data member. */
20661 /* Add it to the class. */
20663 }
20664 else
20665 cp_parser_check_access_in_redeclaration
20668 }
20669 }
20670 else
20671 {
20674 /* Clear attributes from the decl_specifiers but keep them
20675 around as prefix attributes that apply them to the entity
20676 being declared. */
20680 /* See if these declarations will be friends. */
20683 /* Keep going until we hit the `;' at the end of the
20684 declaration. */
20686 {
20688 tree first_attribute;
20690 /* Peek at the next token. */
20693 /* Check for a bitfield declaration. */
20698 {
20699 tree identifier;
20700 tree width;
20702 /* Get the name of the bitfield. Note that we cannot just
20703 check TOKEN here because it may have been invalidated by
20704 the call to cp_lexer_peek_nth_token above. */
20707 else
20710 /* Consume the `:' token. */
20712 /* Get the width of the bitfield. */
20713 width
20716 NULL);
20718 /* Look for attributes that apply to the bitfield. */
20720 /* Remember which attributes are prefix attributes and
20721 which are not. */
20723 /* Combine the attributes. */
20726 /* Create the bitfield declaration. */
20729 identifier,
20730 sfk_none)
20733 width,
20734 attributes);
20735 }
20736 else
20737 {
20739 tree initializer;
20740 tree asm_specification;
20743 /* Parse the declarator. */
20744 declarator
20749 friend_p);
20751 /* If something went wrong parsing the declarator, make sure
20752 that we at least consume some tokens. */
20754 {
20755 /* Skip to the end of the statement. */
20757 /* If the next token is not a semicolon, that is
20758 probably because we just skipped over the body of
20759 a function. So, we consume a semicolon if
20760 present, but do not issue an error message if it
20761 is not present. */
20763 CPP_SEMICOLON))
20766 }
20769 cp_parser_check_for_definition_in_return_type
20773 /* Look for an asm-specification. */
20775 /* Look for attributes that apply to the declaration. */
20777 /* Remember which attributes are prefix attributes and
20778 which are not. */
20780 /* Combine the attributes. */
20783 /* If it's an `=', then we have a constant-initializer or a
20784 pure-specifier. It is not correct to parse the
20785 initializer before registering the member declaration
20786 since the member declaration should be in scope while
20787 its initializer is processed. However, the rest of the
20788 front end does not yet provide an interface that allows
20789 us to handle this correctly. */
20791 {
20792 /* In [class.mem]:
20794 A pure-specifier shall be used only in the declaration of
20795 a virtual function.
20797 A member-declarator can contain a constant-initializer
20798 only if it declares a static member of integral or
20799 enumeration type.
20801 Therefore, if the DECLARATOR is for a function, we look
20802 for a pure-specifier; otherwise, we look for a
20803 constant-initializer. When we call `grokfield', it will
20804 perform more stringent semantics checks. */
20816 {
20818 /* Don't require a constant rvalue in C++11, since we
20819 might want a reference constant. We'll enforce
20820 constancy later. */
20822 /* Parse the initializer. */
20825 }
20826 else
20827 /* Parse the initializer. */
20829 }
20832 {
20836 else
20838 }
20839 /* Otherwise, there is no initializer. */
20840 else
20843 /* See if we are probably looking at a function
20844 definition. We are certainly not looking at a
20845 member-declarator. Calling `grokfield' has
20846 side-effects, so we must not do it unless we are sure
20847 that we are looking at a member-declarator. */
20850 {
20851 /* The grammar does not allow a pure-specifier to be
20852 used when a member function is defined. (It is
20853 possible that this fact is an oversight in the
20854 standard, since a pure function may be defined
20855 outside of the class-specifier. */
20861 declarator,
20862 attributes);
20865 /* If the member was not a friend, declare it here. */
20868 /* Peek at the next token. */
20870 /* If the next token is a semicolon, consume it. */
20874 }
20875 else
20878 /* Create the declaration. */
20883 {
20886 else
20888 }
20889 }
20893 /* Reset PREFIX_ATTRIBUTES. */
20899 /* If there is any qualification still in effect, clear it
20900 now; we will be starting fresh with the next declarator. */
20904 /* If it's a `,', then there are more declarators. */
20906 {
20909 {
20913 }
20914 }
20915 /* If the next token isn't a `;', then we have a parse error. */
20917 CPP_SEMICOLON))
20918 {
20919 /* The next token might be a ways away from where the
20920 actual semicolon is missing. Find the previous token
20921 and use that for our error position. */
20926 /* Assume that the user meant to provide a semicolon. If
20927 we were to cp_parser_skip_to_end_of_statement, we might
20928 skip to a semicolon inside a member function definition
20929 and issue nonsensical error messages. */
20931 }
20934 {
20935 /* Add DECL to the list of members. */
20944 /* Add DECL to the queue of NSDMI to be parsed later. */
20946 }
20950 }
20951 }
20954 out:
20956 }
20958 /* Parse a pure-specifier.
20960 pure-specifier:
20961 = 0
20963 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20964 Otherwise, ERROR_MARK_NODE is returned. */
20966 static tree
20968 {
20971 /* Look for the `=' token. */
20974 /* Look for the `0' token. */
20983 /* Accept = default or = delete in c++0x mode. */
20986 {
20989 }
20991 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20993 {
20998 }
21000 {
21003 }
21006 }
21008 /* Parse a constant-initializer.
21010 constant-initializer:
21011 = constant-expression
21013 Returns a representation of the constant-expression. */
21015 static tree
21017 {
21018 /* Look for the `=' token. */
21022 /* It is invalid to write:
21024 struct S { static const int i = { 7 }; };
21026 */
21028 {
21031 /* Consume the opening brace. */
21033 /* Skip the initializer. */
21035 /* Look for the trailing `}'. */
21039 }
21043 NULL);
21044 }
21046 /* Derived classes [gram.class.derived] */
21048 /* Parse a base-clause.
21050 base-clause:
21051 : base-specifier-list
21053 base-specifier-list:
21054 base-specifier ... [opt]
21055 base-specifier-list , base-specifier ... [opt]
21057 Returns a TREE_LIST representing the base-classes, in the order in
21058 which they were declared. The representation of each node is as
21059 described by cp_parser_base_specifier.
21061 In the case that no bases are specified, this function will return
21062 NULL_TREE, not ERROR_MARK_NODE. */
21064 static tree
21066 {
21069 /* Look for the `:' that begins the list. */
21072 /* Scan the base-specifier-list. */
21074 {
21076 tree base;
21079 /* Look for the base-specifier. */
21081 /* Look for the (optional) ellipsis. */
21083 {
21084 /* Consume the `...'. */
21088 }
21090 /* Add BASE to the front of the list. */
21092 {
21094 /* Make this a pack expansion type. */
21098 {
21101 }
21102 }
21103 /* Peek at the next token. */
21105 /* If it's not a comma, then the list is complete. */
21108 /* Consume the `,'. */
21110 }
21112 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21113 base class had a qualified name. However, the next name that
21114 appears is certainly not qualified. */
21120 }
21122 /* Parse a base-specifier.
21124 base-specifier:
21125 :: [opt] nested-name-specifier [opt] class-name
21126 virtual access-specifier [opt] :: [opt] nested-name-specifier
21127 [opt] class-name
21128 access-specifier virtual [opt] :: [opt] nested-name-specifier
21129 [opt] class-name
21131 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21132 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21133 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21134 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21136 static tree
21138 {
21146 tree type;
21148 /* Process the optional `virtual' and `access-specifier'. */
21150 {
21151 /* Peek at the next token. */
21153 /* Process `virtual'. */
21155 {
21157 /* If `virtual' appears more than once, issue an error. */
21159 {
21163 }
21167 /* Consume the `virtual' token. */
21175 /* If more than one access specifier appears, issue an
21176 error. */
21179 {
21183 }
21187 /* Consume the access-specifier. */
21195 }
21196 }
21197 /* It is not uncommon to see programs mechanically, erroneously, use
21198 the 'typename' keyword to denote (dependent) qualified types
21199 as base classes. */
21201 {
21206 else
21208 "keyword %<typename%> not allowed in this context "
21211 }
21213 /* Look for the optional `::' operator. */
21215 /* Look for the nested-name-specifier. The simplest way to
21216 implement:
21218 [temp.res]
21220 The keyword `typename' is not permitted in a base-specifier or
21221 mem-initializer; in these contexts a qualified name that
21222 depends on a template-parameter is implicitly assumed to be a
21223 type name.
21225 is to pretend that we have seen the `typename' keyword at this
21226 point. */
21230 typename_type,
21232 /* If the base class is given by a qualified name, assume that names
21233 we see are type names or templates, as appropriate. */
21239 /* DR 950 allows decltype as a base-specifier. */
21241 else
21242 {
21243 /* Otherwise, look for the class-name. */
21245 class_scope_p,
21246 template_p,
21247 typename_type,
21252 }
21258 }
21260 /* Exception handling [gram.exception] */
21262 /* Parse an (optional) noexcept-specification.
21264 noexcept-specification:
21265 noexcept ( constant-expression ) [opt]
21267 If no noexcept-specification is present, returns NULL_TREE.
21268 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21269 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21270 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21271 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21272 in which case a boolean condition is returned instead. */
21274 static tree
21279 {
21283 /* Peek at the next token. */
21286 /* Is it a noexcept-specification? */
21288 {
21289 tree expr;
21293 {
21297 {
21298 /* Types may not be defined in an exception-specification. */
21300 parser->type_definition_forbidden_message
21305 /* Restore the saved message. */
21307 }
21308 else
21309 {
21312 }
21315 }
21316 else
21317 {
21321 }
21323 /* We cannot build a noexcept-spec right away because this will check
21324 that expr is a constexpr. */
21327 else
21329 }
21330 else
21332 }
21334 /* Parse an (optional) exception-specification.
21336 exception-specification:
21337 throw ( type-id-list [opt] )
21339 Returns a TREE_LIST representing the exception-specification. The
21340 TREE_VALUE of each node is a type. */
21342 static tree
21344 {
21346 tree type_id_list;
21349 /* Peek at the next token. */
21352 /* Is it a noexcept-specification? */
21358 /* If it's not `throw', then there's no exception-specification. */
21362 #if 0
21363 /* Enable this once a lot of code has transitioned to noexcept? */
21367 #endif
21369 /* Consume the `throw'. */
21372 /* Look for the `('. */
21375 /* Peek at the next token. */
21377 /* If it's not a `)', then there is a type-id-list. */
21379 {
21380 /* Types may not be defined in an exception-specification. */
21382 parser->type_definition_forbidden_message
21384 /* Parse the type-id-list. */
21386 /* Restore the saved message. */
21388 }
21389 else
21392 /* Look for the `)'. */
21396 }
21398 /* Parse an (optional) type-id-list.
21400 type-id-list:
21401 type-id ... [opt]
21402 type-id-list , type-id ... [opt]
21404 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21405 in the order that the types were presented. */
21407 static tree
21409 {
21413 {
21415 tree type;
21417 /* Get the next type-id. */
21419 /* Parse the optional ellipsis. */
21421 {
21422 /* Consume the `...'. */
21425 /* Turn the type into a pack expansion expression. */
21427 }
21428 /* Add it to the list. */
21430 /* Peek at the next token. */
21432 /* If it is not a `,', we are done. */
21435 /* Consume the `,'. */
21437 }
21440 }
21442 /* Parse a try-block.
21444 try-block:
21445 try compound-statement handler-seq */
21447 static tree
21449 {
21450 tree try_block;
21460 }
21462 /* Parse a function-try-block.
21464 function-try-block:
21465 try ctor-initializer [opt] function-body handler-seq */
21467 static bool
21469 {
21470 tree compound_stmt;
21471 tree try_block;
21474 /* Look for the `try' keyword. */
21477 /* Let the rest of the front end know where we are. */
21479 /* Parse the function-body. */
21480 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21482 /* We're done with the `try' part. */
21484 /* Parse the handlers. */
21486 /* We're done with the handlers. */
21490 }
21492 /* Parse a handler-seq.
21494 handler-seq:
21495 handler handler-seq [opt] */
21497 static void
21499 {
21501 {
21504 /* Parse the handler. */
21506 /* Peek at the next token. */
21508 /* If it's not `catch' then there are no more handlers. */
21511 }
21512 }
21514 /* Parse a handler.
21516 handler:
21517 catch ( exception-declaration ) compound-statement */
21519 static void
21521 {
21522 tree handler;
21523 tree declaration;
21533 }
21535 /* Parse an exception-declaration.
21537 exception-declaration:
21538 type-specifier-seq declarator
21539 type-specifier-seq abstract-declarator
21540 type-specifier-seq
21541 ...
21543 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21544 ellipsis variant is used. */
21546 static tree
21548 {
21549 cp_decl_specifier_seq type_specifiers;
21553 /* If it's an ellipsis, it's easy to handle. */
21555 {
21556 /* Consume the `...' token. */
21559 }
21561 /* Types may not be defined in exception-declarations. */
21563 parser->type_definition_forbidden_message
21566 /* Parse the type-specifier-seq. */
21570 /* If it's a `)', then there is no declarator. */
21573 else
21580 /* Restore the saved message. */
21587 }
21589 /* Parse a throw-expression.
21591 throw-expression:
21592 throw assignment-expression [opt]
21594 Returns a THROW_EXPR representing the throw-expression. */
21596 static tree
21598 {
21599 tree expression;
21604 /* Figure out whether or not there is an assignment-expression
21605 following the "throw" keyword. */
21613 else
21618 }
21620 /* GNU Extensions */
21622 /* Parse an (optional) asm-specification.
21624 asm-specification:
21625 asm ( string-literal )
21627 If the asm-specification is present, returns a STRING_CST
21628 corresponding to the string-literal. Otherwise, returns
21629 NULL_TREE. */
21631 static tree
21633 {
21635 tree asm_specification;
21637 /* Peek at the next token. */
21639 /* If the next token isn't the `asm' keyword, then there's no
21640 asm-specification. */
21644 /* Consume the `asm' token. */
21646 /* Look for the `('. */
21649 /* Look for the string-literal. */
21652 /* Look for the `)'. */
21656 }
21658 /* Parse an asm-operand-list.
21660 asm-operand-list:
21661 asm-operand
21662 asm-operand-list , asm-operand
21664 asm-operand:
21665 string-literal ( expression )
21666 [ string-literal ] string-literal ( expression )
21668 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21669 each node is the expression. The TREE_PURPOSE is itself a
21670 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21671 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21672 is a STRING_CST for the string literal before the parenthesis. Returns
21673 ERROR_MARK_NODE if any of the operands are invalid. */
21675 static tree
21677 {
21682 {
21683 tree string_literal;
21684 tree expression;
21685 tree name;
21688 {
21689 /* Consume the `[' token. */
21691 /* Read the operand name. */
21696 /* Look for the closing `]'. */
21698 }
21699 else
21701 /* Look for the string-literal. */
21704 /* Look for the `('. */
21706 /* Parse the expression. */
21708 /* Look for the `)'. */
21716 /* Add this operand to the list. */
21718 expression,
21719 asm_operands);
21720 /* If the next token is not a `,', there are no more
21721 operands. */
21724 /* Consume the `,'. */
21726 }
21729 }
21731 /* Parse an asm-clobber-list.
21733 asm-clobber-list:
21734 string-literal
21735 asm-clobber-list , string-literal
21737 Returns a TREE_LIST, indicating the clobbers in the order that they
21738 appeared. The TREE_VALUE of each node is a STRING_CST. */
21740 static tree
21742 {
21746 {
21747 tree string_literal;
21749 /* Look for the string literal. */
21751 /* Add it to the list. */
21753 /* If the next token is not a `,', then the list is
21754 complete. */
21757 /* Consume the `,' token. */
21759 }
21762 }
21764 /* Parse an asm-label-list.
21766 asm-label-list:
21767 identifier
21768 asm-label-list , identifier
21770 Returns a TREE_LIST, indicating the labels in the order that they
21771 appeared. The TREE_VALUE of each node is a label. */
21773 static tree
21775 {
21779 {
21782 /* Look for the identifier. */
21785 {
21788 {
21794 }
21795 }
21796 /* If the next token is not a `,', then the list is
21797 complete. */
21800 /* Consume the `,' token. */
21802 }
21805 }
21807 /* Return TRUE iff the next tokens in the stream are possibly the
21808 beginning of a GNU extension attribute. */
21810 static bool
21812 {
21814 }
21816 /* Return TRUE iff the next tokens in the stream are possibly the
21817 beginning of a standard C++-11 attribute specifier. */
21819 static bool
21821 {
21823 }
21825 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21826 beginning of a standard C++-11 attribute specifier. */
21828 static bool
21830 {
21838 }
21840 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21841 beginning of a GNU extension attribute. */
21843 static bool
21845 {
21849 }
21851 /* Return true iff the next tokens can be the beginning of either a
21852 GNU attribute list, or a standard C++11 attribute sequence. */
21854 static bool
21856 {
21859 }
21861 /* Return true iff the next Nth tokens can be the beginning of either
21862 a GNU attribute list, or a standard C++11 attribute sequence. */
21864 static bool
21866 {
21869 }
21871 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21872 of GNU attributes, or return NULL. */
21874 static tree
21876 {
21880 }
21882 #define CILK_SIMD_FN_CLAUSE_MASK \
21883 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21884 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21885 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21886 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21887 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21889 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21890 vector [(<clauses>)] */
21892 static void
21894 {
21898 {
21903 }
21906 {
21909 paren_scope++;
21910 }
21912 {
21915 paren_scope++;
21917 paren_scope--;
21918 /* Do not push the last ')' */
21921 }
21930 }
21932 /* Parse an (optional) series of attributes.
21934 attributes:
21935 attributes attribute
21937 attribute:
21938 __attribute__ (( attribute-list [opt] ))
21940 The return value is as for cp_parser_gnu_attribute_list. */
21942 static tree
21944 {
21948 {
21950 tree attribute_list;
21953 /* Peek at the next token. */
21955 /* If it's not `__attribute__', then we're done. */
21959 /* Consume the `__attribute__' keyword. */
21961 /* Look for the two `(' tokens. */
21965 /* Peek at the next token. */
21968 /* Parse the attribute-list. */
21970 else
21971 /* If the next token is a `)', then there is no attribute
21972 list. */
21975 /* Look for the two `)' tokens. */
21983 /* Add these new attributes to the list. */
21985 }
21988 }
21990 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21991 "__vector" or "__vector__." */
21995 {
21999 }
22001 /* Parse a GNU attribute-list.
22003 attribute-list:
22004 attribute
22005 attribute-list , attribute
22007 attribute:
22008 identifier
22009 identifier ( identifier )
22010 identifier ( identifier , expression-list )
22011 identifier ( expression-list )
22013 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22014 to an attribute. The TREE_PURPOSE of each node is the identifier
22015 indicating which attribute is in use. The TREE_VALUE represents
22016 the arguments, if any. */
22018 static tree
22020 {
22026 {
22028 tree identifier;
22029 tree attribute;
22031 /* Look for the identifier. We also allow keywords here; for
22032 example `__attribute__ ((const))' is legal. */
22036 {
22039 /* Consume the token, but save it since we need it for the
22040 SIMD enabled function parsing. */
22043 /* Save away the identifier that indicates which attribute
22044 this is. */
22046 /* For keywords, use the canonical spelling, not the
22047 parsed identifier. */
22053 /* Peek at the next token. */
22055 /* If it's an `(', then parse the attribute arguments. */
22057 {
22062 {
22065 }
22066 else
22067 vec = cp_parser_parenthesized_expression_list
22073 else
22074 {
22077 }
22078 /* Save the arguments away. */
22080 }
22082 {
22085 }
22088 {
22089 /* Add this attribute to the list. */
22092 }
22095 }
22096 /* Now, look for more attributes. If the next token isn't a
22097 `,', we're done. */
22101 /* Consume the comma and keep going. */
22103 }
22106 /* We built up the list in reverse order. */
22108 }
22110 /* Parse a standard C++11 attribute.
22112 The returned representation is a TREE_LIST which TREE_PURPOSE is
22113 the scoped name of the attribute, and the TREE_VALUE is its
22114 arguments list.
22116 Note that the scoped name of the attribute is itself a TREE_LIST
22117 which TREE_PURPOSE is the namespace of the attribute, and
22118 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22119 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22120 and which TREE_PURPOSE is directly the attribute name.
22122 Clients of the attribute code should use get_attribute_namespace
22123 and get_attribute_name to get the actual namespace and name of
22124 attributes, regardless of their being GNU or C++11 attributes.
22126 attribute:
22127 attribute-token attribute-argument-clause [opt]
22129 attribute-token:
22130 identifier
22131 attribute-scoped-token
22133 attribute-scoped-token:
22134 attribute-namespace :: identifier
22136 attribute-namespace:
22137 identifier
22139 attribute-argument-clause:
22140 ( balanced-token-seq )
22142 balanced-token-seq:
22143 balanced-token [opt]
22144 balanced-token-seq balanced-token
22146 balanced-token:
22147 ( balanced-token-seq )
22148 [ balanced-token-seq ]
22149 { balanced-token-seq }. */
22151 static tree
22153 {
22157 /* First, parse name of the the attribute, a.k.a
22158 attribute-token. */
22175 {
22176 /* We are seeing a scoped attribute token. */
22186 else
22187 {
22191 }
22193 NULL_TREE);
22195 }
22196 else
22197 {
22199 NULL_TREE);
22200 /* C++11 noreturn attribute is equivalent to GNU's. */
22203 /* C++14 deprecated attribute is equivalent to GNU's. */
22206 }
22208 /* Now parse the optional argument clause of the attribute. */
22213 {
22219 /* A GNU attribute that takes an identifier in parameter. */
22222 vec = cp_parser_parenthesized_expression_list
22228 else
22229 {
22232 }
22236 else
22238 }
22241 }
22243 /* Parse a list of standard C++-11 attributes.
22245 attribute-list:
22246 attribute [opt]
22247 attribute-list , attribute[opt]
22248 attribute ...
22249 attribute-list , attribute ...
22250 */
22252 static tree
22254 {
22259 {
22264 {
22267 }
22272 }
22275 }
22277 /* Parse a standard C++-11 attribute specifier.
22279 attribute-specifier:
22280 [ [ attribute-list ] ]
22281 alignment-specifier
22283 alignment-specifier:
22284 alignas ( type-id ... [opt] )
22285 alignas ( alignment-expression ... [opt] ). */
22287 static tree
22289 {
22295 {
22304 else
22305 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22306 when we are sure that we have actually parsed them. */
22308 }
22309 else
22310 {
22311 tree alignas_expr;
22313 /* Look for an alignment-specifier. */
22325 {
22328 }
22334 {
22338 alignas_expr =
22346 }
22349 {
22352 }
22356 /* Build the C++-11 representation of an 'aligned'
22357 attribute. */
22358 attributes =
22362 }
22365 }
22367 /* Parse a standard C++-11 attribute-specifier-seq.
22369 attribute-specifier-seq:
22370 attribute-specifier-seq [opt] attribute-specifier
22371 */
22373 static tree
22375 {
22379 {
22388 }
22392 }
22394 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22395 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22396 current value of the PEDANTIC flag, regardless of whether or not
22397 the `__extension__' keyword is present. The caller is responsible
22398 for restoring the value of the PEDANTIC flag. */
22400 static bool
22402 {
22403 /* Save the old value of the PEDANTIC flag. */
22407 {
22408 /* Consume the `__extension__' token. */
22410 /* We're not being pedantic while the `__extension__' keyword is
22411 in effect. */
22415 }
22418 }
22420 /* Parse a label declaration.
22422 label-declaration:
22423 __label__ label-declarator-seq ;
22425 label-declarator-seq:
22426 identifier , label-declarator-seq
22427 identifier */
22429 static void
22431 {
22432 /* Look for the `__label__' keyword. */
22436 {
22437 tree identifier;
22439 /* Look for an identifier. */
22441 /* If we failed, stop. */
22444 /* Declare it as a label. */
22446 /* If the next token is a `;', stop. */
22449 /* Look for the `,' separating the label declarations. */
22451 }
22453 /* Look for the final `;'. */
22455 }
22457 /* Support Functions */
22459 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22460 NAME should have one of the representations used for an
22461 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22462 is returned. If PARSER->SCOPE is a dependent type, then a
22463 SCOPE_REF is returned.
22465 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22466 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22467 was formed. Abstractly, such entities should not be passed to this
22468 function, because they do not need to be looked up, but it is
22469 simpler to check for this special case here, rather than at the
22470 call-sites.
22472 In cases not explicitly covered above, this function returns a
22473 DECL, OVERLOAD, or baselink representing the result of the lookup.
22474 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22475 is returned.
22477 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22478 (e.g., "struct") that was used. In that case bindings that do not
22479 refer to types are ignored.
22481 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22482 ignored.
22484 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22485 are ignored.
22487 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22488 types.
22490 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22491 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22492 NULL_TREE otherwise. */
22494 static tree
22501 location_t name_location)
22502 {
22503 tree decl;
22506 /* Assume that the lookup will be unambiguous. */
22510 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22511 no longer valid. Note that if we are parsing tentatively, and
22512 the parse fails, OBJECT_TYPE will be automatically restored. */
22518 /* A template-id has already been resolved; there is no lookup to
22519 do. */
22523 {
22527 }
22529 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22530 it should already have been checked to make sure that the name
22531 used matches the type being destroyed. */
22533 {
22534 tree type;
22536 /* Figure out to which type this destructor applies. */
22541 else
22543 /* If that's not a class type, there is no destructor. */
22550 /* If it was a class type, return the destructor. */
22552 }
22554 /* By this point, the NAME should be an ordinary identifier. If
22555 the id-expression was a qualified name, the qualifying scope is
22556 stored in PARSER->SCOPE at this point. */
22559 /* Perform the lookup. */
22561 {
22567 /* If the SCOPE is dependent, the lookup must be deferred until
22568 the template is instantiated -- unless we are explicitly
22569 looking up names in uninstantiated templates. Even then, we
22570 cannot look up the name if the scope is not a class type; it
22571 might, for example, be a template type parameter. */
22576 /* Defer lookup. */
22578 else
22579 {
22582 /* If PARSER->SCOPE is a dependent type, then it must be a
22583 class type, and we must not be checking dependencies;
22584 otherwise, we would have processed this lookup above. So
22585 that PARSER->SCOPE is not considered a dependent base by
22586 lookup_member, we must enter the scope here. */
22590 /* If the PARSER->SCOPE is a template specialization, it
22591 may be instantiated during name lookup. In that case,
22592 errors may be issued. Even if we rollback the current
22593 tentative parse, those errors are valid. */
22598 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22599 lookup result and the nested-name-specifier nominates a class C:
22600 * if the name specified after the nested-name-specifier, when
22601 looked up in C, is the injected-class-name of C (Clause 9), or
22602 * if the name specified after the nested-name-specifier is the
22603 same as the identifier or the simple-template-id's template-
22604 name in the last component of the nested-name-specifier,
22605 the name is instead considered to name the constructor of
22606 class C. [ Note: for example, the constructor is not an
22607 acceptable lookup result in an elaborated-type-specifier so
22608 the constructor would not be used in place of the
22609 injected-class-name. --end note ] Such a constructor name
22610 shall be used only in the declarator-id of a declaration that
22611 names a constructor or in a using-declaration. */
22619 /* If we have a single function from a using decl, pull it out. */
22626 }
22628 /* If the scope is a dependent type and either we deferred lookup or
22629 we did lookup but didn't find the name, rememeber the name. */
22632 {
22634 {
22635 tree type;
22637 /* The resolution to Core Issue 180 says that `struct
22638 A::B' should be considered a type-name, even if `A'
22639 is dependent. */
22644 }
22648 CPP_CLOSE_PAREN)))
22652 else
22655 is_template);
22656 }
22659 }
22661 {
22662 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22663 OBJECT_TYPE is not a class. */
22665 /* If the OBJECT_TYPE is a template specialization, it may
22666 be instantiated during name lookup. In that case, errors
22667 may be issued. Even if we rollback the current tentative
22668 parse, those errors are valid. */
22670 name,
22673 tf_warning_or_error);
22674 else
22678 /* Look it up in the enclosing context. */
22684 }
22685 else
22686 {
22692 }
22694 /* If the lookup failed, let our caller know. */
22698 /* Pull out the template from an injected-class-name (or multiple). */
22702 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22704 {
22707 /* The error message we have to print is too complicated for
22708 cp_parser_error, so we incorporate its actions directly. */
22710 {
22712 name);
22714 }
22716 }
22724 /* If we have resolved the name of a member declaration, check to
22725 see if the declaration is accessible. When the name resolves to
22726 set of overloaded functions, accessibility is checked when
22727 overload resolution is done.
22729 During an explicit instantiation, access is not checked at all,
22730 as per [temp.explicit]. */
22737 }
22739 /* Like cp_parser_lookup_name, but for use in the typical case where
22740 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22741 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22743 static tree
22745 {
22747 none_type,
22752 location);
22753 }
22755 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22756 the current context, return the TYPE_DECL. If TAG_NAME_P is
22757 true, the DECL indicates the class being defined in a class-head,
22758 or declared in an elaborated-type-specifier.
22760 Otherwise, return DECL. */
22762 static tree
22764 {
22765 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22766 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22768 struct A {
22769 template <typename T> struct B;
22770 };
22772 template <typename T> struct A::B {};
22774 Similarly, in an elaborated-type-specifier:
22776 namespace N { struct X{}; }
22778 struct A {
22779 template <typename T> friend struct N::X;
22780 };
22782 However, if the DECL refers to a class type, and we are in
22783 the scope of the class, then the name lookup automatically
22784 finds the TYPE_DECL created by build_self_reference rather
22785 than a TEMPLATE_DECL. For example, in:
22787 template <class T> struct S {
22788 S s;
22789 };
22791 there is no need to handle such case. */
22797 }
22799 /* If too many, or too few, template-parameter lists apply to the
22800 declarator, issue an error message. Returns TRUE if all went well,
22801 and FALSE otherwise. */
22803 static bool
22806 location_t declarator_location)
22807 {
22809 {
22811 {
22819 /* If the DECLARATOR has the form `X<y>' then it uses one
22820 additional level of template parameters. */
22823 return cp_parser_check_template_parameters
22825 }
22840 }
22842 }
22844 /* NUM_TEMPLATES were used in the current declaration. If that is
22845 invalid, return FALSE and issue an error messages. Otherwise,
22846 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22847 declarator and we can print more accurate diagnostics. */
22849 static bool
22852 location_t location,
22854 {
22855 /* If there are the same number of template classes and parameter
22856 lists, that's OK. */
22859 /* If there are more, but only one more, then we are referring to a
22860 member template. That's OK too. */
22863 /* If there are more template classes than parameter lists, we have
22864 something like:
22866 template <class T> void S<T>::R<T>::f (); */
22868 {
22878 else
22881 }
22882 /* Otherwise, there are too many template parameter lists. We have
22883 something like:
22885 template <class T> template <class U> void S::f(); */
22888 }
22890 /* Parse an optional `::' token indicating that the following name is
22891 from the global namespace. If so, PARSER->SCOPE is set to the
22892 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22893 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22894 Returns the new value of PARSER->SCOPE, if the `::' token is
22895 present, and NULL_TREE otherwise. */
22897 static tree
22899 {
22902 /* Peek at the next token. */
22904 /* If we're looking at a `::' token then we're starting from the
22905 global namespace, not our current location. */
22907 {
22908 /* Consume the `::' token. */
22910 /* Set the SCOPE so that we know where to start the lookup. */
22916 }
22918 {
22922 }
22925 }
22927 /* Returns TRUE if the upcoming token sequence is the start of a
22928 constructor declarator. If FRIEND_P is true, the declarator is
22929 preceded by the `friend' specifier. */
22931 static bool
22933 {
22936 tree nested_name_specifier;
22939 /* The common case is that this is not a constructor declarator, so
22940 try to avoid doing lots of work if at all possible. It's not
22941 valid declare a constructor at function scope. */
22944 /* And only certain tokens can begin a constructor declarator. */
22952 /* Parse tentatively; we are going to roll back all of the tokens
22953 consumed here. */
22955 /* Assume that we are looking at a constructor declarator. */
22958 /* Look for the optional `::' operator. */
22961 /* Look for the nested-name-specifier. */
22962 nested_name_specifier
22973 /* Outside of a class-specifier, there must be a
22974 nested-name-specifier. */
22980 /* If we have a class scope, this is easy; DR 147 says that S::S always
22981 names the constructor, and no other qualified name could. */
22984 {
22994 }
22995 /* If we still think that this might be a constructor-declarator,
22996 look for a class-name. */
22998 {
22999 /* If we have:
23001 template <typename T> struct S {
23002 S();
23003 };
23005 we must recognize that the nested `S' names a class. */
23006 tree type_decl;
23010 none_type,
23014 /* If there was no class-name, then this is not a constructor.
23015 Otherwise, if we are in a class-specifier and we aren't
23016 handling a friend declaration, check that its type matches
23017 current_class_type (c++/38313). Note: error_mark_node
23018 is left alone for error recovery purposes. */
23020 && (outside_class_specifier_p
23025 /* If we're still considering a constructor, we have to see a `(',
23026 to begin the parameter-declaration-clause, followed by either a
23027 `)', an `...', or a decl-specifier. We need to check for a
23028 type-specifier to avoid being fooled into thinking that:
23030 S (f) (int);
23032 is a constructor. (It is actually a function named `f' that
23033 takes one parameter (of type `int') and returns a value of type
23034 `S'. */
23042 /* A parameter declaration begins with a decl-specifier,
23043 which is either the "attribute" keyword, a storage class
23044 specifier, or (usually) a type-specifier. */
23046 {
23047 tree type;
23051 /* Names appearing in the type-specifier should be looked up
23052 in the scope of the class. */
23055 else
23056 {
23059 {
23063 {
23066 }
23067 }
23069 }
23071 /* Inside the constructor parameter list, surrounding
23072 template-parameter-lists do not apply. */
23073 saved_num_template_parameter_lists
23077 /* Look for the type-specifier. */
23079 CP_PARSER_FLAGS_NONE,
23085 parser->num_template_parameter_lists
23088 /* Leave the scope of the class. */
23093 }
23094 }
23096 /* We did not really want to consume any tokens. */
23100 }
23102 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23103 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23104 they must be performed once we are in the scope of the function.
23106 Returns the function defined. */
23108 static tree
23109 cp_parser_function_definition_from_specifiers_and_declarator
23112 tree attributes,
23114 {
23115 tree fn;
23118 /* Begin the function-definition. */
23121 /* The things we're about to see are not directly qualified by any
23122 template headers we've seen thus far. */
23125 /* If there were names looked up in the decl-specifier-seq that we
23126 did not check, check them now. We must wait until we are in the
23127 scope of the function to perform the checks, since the function
23128 might be a friend. */
23132 {
23135 }
23138 {
23139 /* Skip the entire function. */
23142 }
23144 {
23145 /* Seen already, skip it. An error message has already been output. */
23149 /* If this is a function from a class, pop the nested class. */
23152 }
23153 else
23154 {
23155 timevar_id_t tv;
23158 else
23164 }
23167 }
23169 /* Parse the part of a function-definition that follows the
23170 declarator. INLINE_P is TRUE iff this function is an inline
23171 function defined within a class-specifier.
23173 Returns the function defined. */
23175 static tree
23178 {
23179 tree fn;
23185 bool fully_implicit_function_template_p
23188 tree implicit_template_parms
23191 cp_binding_level* implicit_template_scope
23197 /* If the next token is `return', then the code may be trying to
23198 make use of the "named return value" extension that G++ used to
23199 support. */
23202 {
23203 /* Consume the `return' keyword. */
23205 /* Look for the identifier that indicates what value is to be
23206 returned. */
23208 /* Issue an error message. */
23211 /* Skip tokens until we reach the start of the function body. */
23213 {
23220 }
23221 }
23222 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23223 anything declared inside `f'. */
23224 saved_in_unbraced_linkage_specification_p
23227 /* Inside the function, surrounding template-parameter-lists do not
23228 apply. */
23229 saved_num_template_parameter_lists
23235 /* If the next token is `try', `__transaction_atomic', or
23236 `__transaction_relaxed`, then we are looking at either function-try-block
23237 or function-transaction-block. Note that all of these include the
23238 function-body. */
23241 RID_TRANSACTION_ATOMIC);
23243 RID_TRANSACTION_RELAXED))
23245 RID_TRANSACTION_RELAXED);
23248 else
23249 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23254 /* Finish the function. */
23257 /* Generate code for it, if necessary. */
23259 /* Restore the saved values. */
23260 parser->in_unbraced_linkage_specification_p
23262 parser->num_template_parameter_lists
23266 parser->fully_implicit_function_template_p
23268 parser->implicit_template_parms
23270 parser->implicit_template_scope
23277 }
23279 /* Parse a template-declaration, assuming that the `export' (and
23280 `extern') keywords, if present, has already been scanned. MEMBER_P
23281 is as for cp_parser_template_declaration. */
23283 static void
23285 {
23288 tree parameter_list;
23293 /* Look for the `template' keyword. */
23298 /* And the `<'. */
23302 {
23303 /* 14.5.2.2 [temp.mem]
23305 A local class shall not have member templates. */
23310 }
23311 /* [temp]
23313 A template ... shall not have C linkage. */
23315 {
23317 /* Give it C++ linkage to avoid confusing other parts of the
23318 front end. */
23321 }
23322 else
23325 /* We cannot perform access checks on the template parameter
23326 declarations until we know what is being declared, just as we
23327 cannot check the decl-specifier list. */
23330 /* If the next token is `>', then we have an invalid
23331 specialization. Rather than complain about an invalid template
23332 parameter, issue an error message here. */
23334 {
23338 }
23339 else
23340 {
23341 /* Parse the template parameters. */
23343 }
23345 /* Get the deferred access checks from the parameter list. These
23346 will be checked once we know what is being declared, as for a
23347 member template the checks must be performed in the scope of the
23348 class containing the member. */
23351 /* Look for the `>'. */
23353 /* We just processed one more parameter list. */
23355 /* If the next token is `template', there are more template
23356 parameters. */
23358 RID_TEMPLATE))
23363 else
23364 {
23365 /* There are no access checks when parsing a template, as we do not
23366 know if a specialization will be a friend. */
23370 checks,
23371 member_p,
23376 /* If this is a member template declaration, let the front
23377 end know. */
23379 {
23384 }
23389 }
23390 /* We are done with the current parameter list. */
23395 /* Finish up. */
23398 /* Check the template arguments for a literal operator template. */
23402 {
23406 else
23407 {
23410 {
23416 }
23418 {
23426 }
23427 else
23429 }
23431 {
23434 " Expected non-type template argument pack <char...>"
23436 decl);
23437 else
23440 decl);
23441 }
23442 }
23443 /* Register member declarations. */
23446 /* For the erroneous case of a template with C linkage, we pushed an
23447 implicit C++ linkage scope; exit that scope now. */
23450 /* If DECL is a function template, we must return to parse it later.
23451 (Even though there is no definition, there might be default
23452 arguments that need handling.) */
23456 }
23458 /* Perform the deferred access checks from a template-parameter-list.
23459 CHECKS is a TREE_LIST of access checks, as returned by
23460 get_deferred_access_checks. */
23462 static void
23463 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23464 {
23468 }
23470 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23471 `function-definition' sequence that follows a template header.
23472 If MEMBER_P is true, this declaration appears in a class scope.
23474 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23475 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23477 static tree
23483 {
23486 cp_decl_specifier_seq decl_specifiers;
23490 /* This function is only used when processing a template
23491 declaration. */
23495 /* Defer access checks until we know what is being declared. */
23498 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23499 alternative. */
23502 CP_PARSER_FLAGS_OPTIONAL,
23508 /* There are no template typedefs. */
23510 {
23514 }
23516 /* Gather up the access checks that occurred the
23517 decl-specifier-seq. */
23520 /* Check for the declaration of a template class. */
23522 {
23524 {
23527 /* In this case:
23529 struct C {
23530 friend template <typename T> struct A<T>::B;
23531 };
23533 A<T>::B will be represented by a TYPENAME_TYPE, and
23534 therefore not recognized by shadow_tag. */
23536 && !decl
23543 else
23546 /* Perform access checks for template parameters. */
23548 }
23549 }
23551 /* Complain about missing 'typename' or other invalid type names. */
23554 {
23555 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23556 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23557 the rest of this declaration. */
23560 }
23562 /* If it's not a template class, try for a template function. If
23563 the next token is a `;', then this declaration does not declare
23564 anything. But, if there were errors in the decl-specifiers, then
23565 the error might well have come from an attempted class-specifier.
23566 In that case, there's no need to warn about a missing declarator. */
23570 {
23573 checks,
23575 member_p,
23576 declares_class_or_enum,
23578 NULL);
23580 /* 7.1.1-1 [dcl.stc]
23582 A storage-class-specifier shall not be specified in an explicit
23583 specialization... */
23585 && explicit_specialization_p
23587 {
23591 }
23595 }
23597 /* Look for a trailing `;' after the declaration. */
23603 out:
23606 /* Clear any current qualification; whatever comes next is the start
23607 of something new. */
23613 }
23615 /* Parse a cast-expression that is not the operand of a unary "&". */
23617 static tree
23619 {
23622 }
23624 /* Parse a functional cast to TYPE. Returns an expression
23625 representing the cast. */
23627 static tree
23629 {
23631 tree expression_list;
23632 tree cast;
23639 {
23647 tf_warning_or_error);
23648 }
23657 else
23658 {
23661 }
23664 tf_warning_or_error);
23665 /* [expr.const]/1: In an integral constant expression "only type
23666 conversions to integral or enumeration type can be used". */
23672 NIC_CONSTRUCTOR))
23675 }
23677 /* Save the tokens that make up the body of a member function defined
23678 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23679 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23680 specifiers applied to the declaration. Returns the FUNCTION_DECL
23681 for the member function. */
23683 static tree
23687 tree attributes)
23688 {
23691 tree fn;
23693 /* Create the FUNCTION_DECL. */
23696 /* If something went badly wrong, bail out now. */
23698 {
23699 /* If there's a function-body, skip it. */
23704 }
23706 /* Remember it, if there default args to post process. */
23709 /* Save away the tokens that make up the body of the
23710 function. */
23712 /* Handle function try blocks. */
23715 /* We can have braced-init-list mem-initializers before the fn body. */
23717 {
23720 {
23721 /* cache_group will stop after an un-nested { } pair, too. */
23725 /* variadic mem-inits have ... after the ')'. */
23728 }
23729 }
23731 /* Handle function try blocks. */
23736 /* Save away the inline definition; we will process it when the
23737 class is complete. */
23741 /* We need to know that this was defined in the class, so that
23742 friend templates are handled correctly. */
23745 /* Add FN to the queue of functions to be parsed later. */
23749 }
23751 /* Save the tokens that make up the in-class initializer for a non-static
23752 data member. Returns a DEFAULT_ARG. */
23754 static tree
23756 {
23758 }
23760 /* Parse a template-argument-list, as well as the trailing ">" (but
23761 not the opening "<"). See cp_parser_template_argument_list for the
23762 return value. */
23764 static tree
23766 {
23767 tree arguments;
23768 tree saved_scope;
23769 tree saved_qualifying_scope;
23770 tree saved_object_scope;
23775 /* [temp.names]
23777 When parsing a template-id, the first non-nested `>' is taken as
23778 the end of the template-argument-list rather than a greater-than
23779 operator. */
23780 saved_greater_than_is_operator_p
23783 /* Parsing the argument list may modify SCOPE, so we save it
23784 here. */
23788 /* We need to evaluate the template arguments, even though this
23789 template-id may be nested within a "sizeof". */
23794 /* Parse the template-argument-list itself. */
23798 else
23800 /* Look for the `>' that ends the template-argument-list. If we find
23801 a '>>' instead, it's probably just a typo. */
23803 {
23805 {
23806 /* In C++0x, a `>>' in a template argument list or cast
23807 expression is considered to be two separate `>'
23808 tokens. So, change the current token to a `>', but don't
23809 consume it: it will be consumed later when the outer
23810 template argument list (or cast expression) is parsed.
23811 Note that this replacement of `>' for `>>' is necessary
23812 even if we are parsing tentatively: in the tentative
23813 case, after calling
23814 cp_parser_enclosed_template_argument_list we will always
23815 throw away all of the template arguments and the first
23816 closing `>', either because the template argument list
23817 was erroneous or because we are replacing those tokens
23818 with a CPP_TEMPLATE_ID token. The second `>' (which will
23819 not have been thrown away) is needed either to close an
23820 outer template argument list or to complete a new-style
23821 cast. */
23824 }
23826 {
23827 /* If we're in a nested template argument list, the '>>' has
23828 to be a typo for '> >'. We emit the error message, but we
23829 continue parsing and we push a '>' as next token, so that
23830 the argument list will be parsed correctly. Note that the
23831 global source location is still on the token before the
23832 '>>', so we need to say explicitly where we want it. */
23838 }
23839 else
23840 {
23841 /* If this is not a nested template argument list, the '>>'
23842 is a typo for '>'. Emit an error message and continue.
23843 Same deal about the token location, but here we can get it
23844 right by consuming the '>>' before issuing the diagnostic. */
23847 "spurious %<>>%>, use %<>%> to terminate "
23849 }
23850 }
23851 else
23853 /* The `>' token might be a greater-than operator again now. */
23854 parser->greater_than_is_operator_p
23856 /* Restore the SAVED_SCOPE. */
23864 }
23866 /* MEMBER_FUNCTION is a member function, or a friend. If default
23867 arguments, or the body of the function have not yet been parsed,
23868 parse them now. */
23870 static void
23872 {
23874 /* If this member is a template, get the underlying
23875 FUNCTION_DECL. */
23879 /* There should not be any class definitions in progress at this
23880 point; the bodies of members are only parsed outside of all class
23881 definitions. */
23883 /* While we're parsing the member functions we might encounter more
23884 classes. We want to handle them right away, but we don't want
23885 them getting mixed up with functions that are currently in the
23886 queue. */
23889 /* Make sure that any template parameters are in scope. */
23892 /* If the body of the function has not yet been parsed, parse it
23893 now. */
23895 {
23896 tree function_scope;
23899 /* The function is no longer pending; we are processing it. */
23904 /* If this is a local class, enter the scope of the containing
23905 function. */
23910 /* Push the body of the function onto the lexer stack. */
23913 /* Let the front end know that we going to be defining this
23914 function. */
23918 /* Don't do access checking if it is a templated function. */
23922 /* #pragma omp declare reduction needs special parsing. */
23924 {
23929 }
23930 else
23931 /* Now, parse the body of the function. */
23938 /* Leave the scope of the containing function. */
23942 }
23944 /* Remove any template parameters from the symbol table. */
23947 /* Restore the queue. */
23950 }
23952 /* If DECL contains any default args, remember it on the unparsed
23953 functions queue. */
23955 static void
23957 {
23958 tree probe;
23961 probe;
23964 {
23968 }
23969 }
23971 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23972 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23973 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23974 from the parameter-type-list. */
23976 static tree
23979 {
23981 tree parsed_arg;
23987 /* Push the saved tokens for the default argument onto the parser's
23988 lexer stack. */
23994 /* Parse the default argument. */
24005 {
24006 /* In a non-template class, check conversions now. In a template,
24007 we'll wait and instantiate these as needed. */
24010 tf_warning_or_error);
24011 else
24013 }
24015 /* If the token stream has not been completely used up, then
24016 there was extra junk after the end of the default
24017 argument. */
24019 {
24022 else
24024 }
24026 /* Revert to the main lexer. */
24030 }
24032 /* FIELD is a non-static data member with an initializer which we saved for
24033 later; parse it now. */
24035 static void
24037 {
24038 tree def;
24045 NULL_TREE);
24051 }
24053 /* FN is a FUNCTION_DECL which may contains a parameter with an
24054 unparsed DEFAULT_ARG. Parse the default args now. This function
24055 assumes that the current scope is the scope in which the default
24056 argument should be processed. */
24058 static void
24060 {
24064 /* While we're parsing the default args, we might (due to the
24065 statement expression extension) encounter more classes. We want
24066 to handle them right away, but we don't want them getting mixed
24067 up with default args that are currently in the queue. */
24070 /* Local variable names (and the `this' keyword) may not appear
24071 in a default argument. */
24082 {
24084 tree parsed_arg;
24086 tree copy;
24093 /* This can happen for a friend declaration for a function
24094 already declared with default arguments. */
24097 parsed_arg
24099 default_arg,
24102 {
24104 }
24108 /* Update any instantiations we've already created. */
24112 }
24116 /* Make sure no default arg is missing. */
24119 /* Restore the state of local_variables_forbidden_p. */
24122 /* Restore the queue. */
24124 }
24126 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24128 sizeof ... ( identifier )
24130 where the 'sizeof' token has already been consumed. */
24132 static tree
24134 {
24135 /* Consume the `...'. */
24142 else
24150 /* The name is not qualified. */
24168 }
24170 /* Parse the operand of `sizeof' (or a similar operator). Returns
24171 either a TYPE or an expression, depending on the form of the
24172 input. The KEYWORD indicates which kind of expression we have
24173 encountered. */
24175 static tree
24177 {
24184 /* If it's a `...', then we are computing the length of a parameter
24185 pack. */
24190 /* Types cannot be defined in a `sizeof' expression. Save away the
24191 old message. */
24193 /* And create the new one. */
24199 /* The restrictions on constant-expressions do not apply inside
24200 sizeof expressions. */
24201 saved_integral_constant_expression_p
24203 saved_non_integral_constant_expression_p
24207 /* Do not actually evaluate the expression. */
24210 /* If it's a `(', then we might be looking at the type-id
24211 construction. */
24213 {
24216 /* We can't be sure yet whether we're looking at a type-id or an
24217 expression. */
24219 /* Note: as a GNU Extension, compound literals are considered
24220 postfix-expressions as they are in C99, so they are valid
24221 arguments to sizeof. See comment in cp_parser_cast_expression
24222 for details. */
24225 else
24226 {
24229 /* Look for the type-id. */
24231 /* Look for the closing `)'. */
24234 }
24236 /* If all went well, then we're done. */
24238 {
24239 cp_decl_specifier_seq decl_specs;
24241 /* Build a trivial decl-specifier-seq. */
24245 /* Call grokdeclarator to figure out what type this is. */
24248 TYPENAME,
24251 }
24252 }
24254 /* If the type-id production did not work out, then we must be
24255 looking at the unary-expression production. */
24260 /* Go back to evaluating expressions. */
24264 /* Free the message we created. */
24266 /* And restore the old one. */
24268 parser->integral_constant_expression_p
24270 parser->non_integral_constant_expression_p
24274 }
24276 /* If the current declaration has no declarator, return true. */
24278 static bool
24280 {
24281 /* If the next token is a `;' or a `,' then there is no
24282 declarator. */
24285 }
24287 /* Update the DECL_SPECS to reflect the storage class indicated by
24288 KEYWORD. */
24290 static void
24295 {
24296 cp_storage_class storage_class;
24299 {
24303 }
24305 {
24308 }
24313 {
24316 }
24319 {
24337 }
24341 /* A storage class specifier cannot be applied alongside a typedef
24342 specifier. If there is a typedef specifier present then set
24343 conflicting_specifiers_p which will trigger an error later
24344 on in grokdeclarator. */
24347 }
24349 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24350 is true, the type is a class or enum definition. */
24352 static void
24354 tree type_spec,
24357 {
24360 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24361 (with, for example, in "typedef int wchar_t;") we remember that
24362 this is what happened. In system headers, we ignore these
24363 declarations so that G++ can work with system headers that are not
24364 C++-safe. */
24366 && !type_definition_p
24376 {
24379 ds_redefined_builtin_type_spec,
24380 token);
24382 {
24386 }
24387 }
24390 else
24391 {
24396 }
24397 }
24399 /* True iff TOKEN is the GNU keyword __thread. */
24401 static bool
24403 {
24406 }
24408 /* Set the location for a declarator specifier and check if it is
24409 duplicated.
24411 DECL_SPECS is the sequence of declarator specifiers onto which to
24412 set the location.
24414 DS is the single declarator specifier to set which location is to
24415 be set onto the existing sequence of declarators.
24417 LOCATION is the location for the declarator specifier to
24418 consider. */
24420 static void
24423 {
24432 {
24436 }
24437 else
24438 {
24440 {
24444 else
24445 {
24448 OPT_Wlong_long,
24450 }
24451 }
24453 {
24458 else
24460 }
24461 else
24462 {
24478 "__complex"
24479 };
24482 }
24483 }
24484 }
24486 /* Return true iff the declarator specifier DS is present in the
24487 sequence of declarator specifiers DECL_SPECS. */
24489 bool
24491 cp_decl_spec ds)
24492 {
24499 }
24501 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24502 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24504 static bool
24506 {
24508 }
24510 /* Issue an error message indicating that TOKEN_DESC was expected.
24511 If KEYWORD is true, it indicated this function is called by
24512 cp_parser_require_keword and the required token can only be
24513 a indicated keyword. */
24515 static void
24517 required_token token_desc,
24519 {
24521 {
24590 }
24592 {
24594 {
24673 }
24674 }
24675 else
24677 }
24681 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24682 issue an error message indicating that TOKEN_DESC was expected.
24684 Returns the token consumed, if the token had the appropriate type.
24685 Otherwise, returns NULL. */
24690 required_token token_desc)
24691 {
24694 else
24695 {
24696 /* Output the MESSAGE -- unless we're parsing tentatively. */
24700 }
24701 }
24703 /* An error message is produced if the next token is not '>'.
24704 All further tokens are skipped until the desired token is
24705 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24707 static void
24709 {
24710 /* Current level of '< ... >'. */
24712 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24715 /* Are we ready, yet? If not, issue error message. */
24719 /* Skip tokens until the desired token is found. */
24721 {
24722 /* Peek at the next token. */
24724 {
24732 /* C++0x views the `>>' operator as two `>' tokens, but
24733 C++98 does not. */
24736 {
24737 /* We've hit a `>>' where the first `>' closes the
24738 template argument list, and the second `>' is
24739 spurious. Just consume the `>>' and stop; we've
24740 already produced at least one error. */
24743 }
24744 /* Fall through for C++0x, so we handle the second `>' in
24745 the `>>'. */
24749 {
24750 /* We've reached the token we want, consume it and stop. */
24753 }
24772 /* The '>' was probably forgotten, don't look further. */
24777 }
24779 /* Consume this token. */
24781 }
24782 }
24784 /* If the next token is the indicated keyword, consume it. Otherwise,
24785 issue an error message indicating that TOKEN_DESC was expected.
24787 Returns the token consumed, if the token had the appropriate type.
24788 Otherwise, returns NULL. */
24793 required_token token_desc)
24794 {
24798 {
24801 }
24804 }
24806 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24807 function-definition. */
24809 static bool
24811 {
24814 /* A ctor-initializer begins with a `:'. */
24816 /* A function-try-block begins with `try'. */
24818 /* A function-transaction-block begins with `__transaction_atomic'
24819 or `__transaction_relaxed'. */
24822 /* The named return value extension begins with `return'. */
24824 }
24826 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24827 definition. */
24829 static bool
24831 {
24838 }
24840 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24841 C++0x) ending a template-argument. */
24843 static bool
24845 {
24853 }
24855 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24856 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24858 static bool
24861 {
24867 /* Check for the sequence `<::' in the original code. It would be lexed as
24868 `[:', where `[' is a digraph, and there is no whitespace before
24869 `:'. */
24871 {
24876 }
24878 }
24880 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24881 or none_type otherwise. */
24883 static enum tag_types
24885 {
24887 {
24897 }
24898 }
24900 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
24901 or none_type otherwise or if the token is null. */
24903 static enum tag_types
24905 {
24910 {
24918 }
24919 }
24921 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24923 static void
24925 {
24929 {
24933 type))
24936 }
24937 }
24939 /* Issue an error message if DECL is redeclared with different
24940 access than its original declaration [class.access.spec/3].
24941 This applies to nested classes and nested class templates.
24942 [class.mem/1]. */
24944 static void
24946 {
24955 }
24957 /* Look for the `template' keyword, as a syntactic disambiguator.
24958 Return TRUE iff it is present, in which case it will be
24959 consumed. */
24961 static bool
24963 {
24965 {
24966 /* In C++98 the `template' keyword can only be used within templates;
24967 outside templates the parser can always figure out what is a
24968 template and what is not. In C++11, per the resolution of DR 468,
24969 `template' is allowed in cases where it is not strictly necessary. */
24972 {
24975 "in C++98 %<template%> (as a disambiguator) is only "
24977 /* If this part of the token stream is rescanned, the same
24978 error message would be generated. So, we purge the token
24979 from the stream. */
24982 }
24983 else
24984 {
24985 /* Consume the `template' keyword. */
24988 }
24989 }
24991 }
24993 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24994 set PARSER->SCOPE, and perform other related actions. */
24996 static void
24998 {
25004 /* Get the stored value. */
25006 /* Perform any access checks that were deferred. */
25009 {
25014 }
25015 /* Set the scope from the stored value. */
25019 }
25021 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25022 encounter the end of a block before what we were looking for. */
25024 static bool
25028 {
25030 {
25033 /* Abort a parenthesized expression if we encounter a semicolon. */
25037 /* If we've reached the end of the file, stop. */
25043 /* We've hit the end of an enclosing block, so there's been some
25044 kind of syntax error. */
25047 /* Consume the token. */
25049 /* See if it starts a new group. */
25051 {
25053 /* In theory this should probably check end == '}', but
25054 cp_parser_save_member_function_body needs it to exit
25055 after either '}' or ')' when called with ')'. */
25058 }
25060 {
25064 }
25069 }
25070 }
25072 /* Like above, for caching a default argument or NSDMI. Both of these are
25073 terminated by a non-nested comma, but it can be unclear whether or not a
25074 comma is nested in a template argument list unless we do more parsing.
25075 In order to handle this ambiguity, when we encounter a ',' after a '<'
25076 we try to parse what follows as a parameter-declaration-list (in the
25077 case of a default argument) or a member-declarator (in the case of an
25078 NSDMI). If that succeeds, then we stop caching. */
25080 static tree
25082 {
25087 tree default_argument;
25089 /* Add tokens until we have processed the entire default
25090 argument. We add the range [first_token, token). */
25093 {
25094 /* For list-initialization, this is straightforward. */
25097 }
25099 {
25102 /* Peek at the next token. */
25104 /* What we do depends on what token we have. */
25106 {
25107 /* In valid code, a default argument must be
25108 immediately followed by a `,' `)', or `...'. */
25111 {
25112 /* If we've seen a '<', we might be in a
25113 template-argument-list. Until Core issue 325 is
25114 resolved, we don't know how this situation ought
25115 to be handled, so try to DTRT. We check whether
25116 what comes after the comma is a valid parameter
25117 declaration list. If it is, then the comma ends
25118 the default argument; otherwise the default
25119 argument continues. */
25122 /* Set ITALP so cp_parser_parameter_declaration_list
25123 doesn't decide to commit to this parse. */
25131 {
25138 }
25139 else
25140 {
25144 }
25151 }
25154 /* If we run into a non-nested `;', `}', or `]',
25155 then the code is invalid -- but the default
25156 argument is certainly over. */
25161 /* Handle correctly int n = sizeof ... ( p ); */
25164 /* Update DEPTH, if necessary. */
25179 /* This might be the comparison operator, or it might
25180 start a template argument list. */
25187 /* Fall through for C++0x, which treats the `>>'
25188 operator like two `>' tokens in certain
25189 cases. */
25193 {
25194 /* This might be an operator, or it might close a
25195 template argument list. But if a previous '<'
25196 started a template argument list, this will have
25197 closed it, so we can't be in one anymore. */
25201 }
25204 /* If we run out of tokens, issue an error message. */
25213 /* In these cases, we should look for template-ids.
25214 For example, if the default argument is
25215 `X<int, double>()', we need to do name lookup to
25216 figure out whether or not `X' is a template; if
25217 so, the `,' does not end the default argument.
25219 That is not yet done. */
25224 }
25226 /* If we've reached the end, stop. */
25230 /* Add the token to the token block. */
25232 }
25234 /* Create a DEFAULT_ARG to represent the unparsed default
25235 argument. */
25242 }
25244 /* Begin parsing tentatively. We always save tokens while parsing
25245 tentatively so that if the tentative parsing fails we can restore the
25246 tokens. */
25248 static void
25250 {
25251 /* Enter a new parsing context. */
25253 /* Begin saving tokens. */
25255 /* In order to avoid repetitive access control error messages,
25256 access checks are queued up until we are no longer parsing
25257 tentatively. */
25259 }
25261 /* Commit to the currently active tentative parse. */
25263 static void
25265 {
25269 /* Mark all of the levels as committed. */
25272 {
25279 }
25280 }
25282 /* Commit to the topmost currently active tentative parse.
25284 Note that this function shouldn't be called when there are
25285 irreversible side-effects while in a tentative state. For
25286 example, we shouldn't create a permanent entry in the symbol
25287 table, or issue an error message that might not apply if the
25288 tentative parse is aborted. */
25290 static void
25292 {
25297 {
25305 }
25306 }
25308 /* Abort the currently active tentative parse. All consumed tokens
25309 will be rolled back, and no diagnostics will be issued. */
25311 static void
25313 {
25317 /* Now, pretend that we want to see if the construct was
25318 successfully parsed. */
25320 }
25322 /* Stop parsing tentatively. If a parse error has occurred, restore the
25323 token stream. Otherwise, commit to the tokens we have consumed.
25324 Returns true if no error occurred; false otherwise. */
25326 static bool
25328 {
25332 /* Remember whether or not an error occurred, since we are about to
25333 destroy that information. */
25335 /* Remove the topmost context from the stack. */
25338 /* If no parse errors occurred, commit to the tentative parse. */
25340 {
25341 /* Commit to the tokens read tentatively, unless that was
25342 already done. */
25347 }
25348 /* Otherwise, if errors occurred, roll back our state so that things
25349 are just as they were before we began the tentative parse. */
25350 else
25351 {
25354 }
25355 /* Add the context to the front of the free list. */
25360 }
25362 /* Returns true if we are parsing tentatively and are not committed to
25363 this tentative parse. */
25365 static bool
25367 {
25370 }
25372 /* Returns nonzero iff an error has occurred during the most recent
25373 tentative parse. */
25375 static bool
25377 {
25380 }
25382 /* Returns nonzero if GNU extensions are allowed. */
25384 static bool
25386 {
25388 }
25389 \f
25390 /* Objective-C++ Productions */
25393 /* Parse an Objective-C expression, which feeds into a primary-expression
25394 above.
25396 objc-expression:
25397 objc-message-expression
25398 objc-string-literal
25399 objc-encode-expression
25400 objc-protocol-expression
25401 objc-selector-expression
25403 Returns a tree representation of the expression. */
25405 static tree
25407 {
25408 /* Try to figure out what kind of declaration is present. */
25412 {
25422 {
25434 }
25440 }
25443 }
25445 /* Parse an Objective-C message expression.
25447 objc-message-expression:
25448 [ objc-message-receiver objc-message-args ]
25450 Returns a representation of an Objective-C message. */
25452 static tree
25454 {
25463 }
25465 /* Parse an objc-message-receiver.
25467 objc-message-receiver:
25468 expression
25469 simple-type-specifier
25471 Returns a representation of the type or expression. */
25473 static tree
25475 {
25476 tree rcv;
25478 /* An Objective-C message receiver may be either (1) a type
25479 or (2) an expression. */
25488 CP_PARSER_FLAGS_NONE);
25491 }
25493 /* Parse the arguments and selectors comprising an Objective-C message.
25495 objc-message-args:
25496 objc-selector
25497 objc-selector-args
25498 objc-selector-args , objc-comma-args
25500 objc-selector-args:
25501 objc-selector [opt] : assignment-expression
25502 objc-selector-args objc-selector [opt] : assignment-expression
25504 objc-comma-args:
25505 assignment-expression
25506 objc-comma-args , assignment-expression
25508 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25509 selector arguments and TREE_VALUE containing a list of comma
25510 arguments. */
25512 static tree
25514 {
25520 {
25526 /* Detect if we have a unary selector. */
25535 sel_args
25540 }
25542 /* Handle non-selector arguments, if any. */
25544 {
25545 tree arg;
25550 addl_args
25555 }
25558 {
25561 }
25564 }
25566 /* Parse an Objective-C encode expression.
25568 objc-encode-expression:
25569 @encode objc-typename
25571 Returns an encoded representation of the type argument. */
25573 static tree
25575 {
25576 tree type;
25586 {
25590 }
25592 /* This happens if we find @encode(T) (where T is a template
25593 typename or something dependent on a template typename) when
25594 parsing a template. In that case, we can't compile it
25595 immediately, but we rather create an AT_ENCODE_EXPR which will
25596 need to be instantiated when the template is used.
25597 */
25599 {
25603 }
25606 }
25608 /* Parse an Objective-C @defs expression. */
25610 static tree
25612 {
25613 tree name;
25621 }
25623 /* Parse an Objective-C protocol expression.
25625 objc-protocol-expression:
25626 @protocol ( identifier )
25628 Returns a representation of the protocol expression. */
25630 static tree
25632 {
25633 tree proto;
25641 }
25643 /* Parse an Objective-C selector expression.
25645 objc-selector-expression:
25646 @selector ( objc-method-signature )
25648 objc-method-signature:
25649 objc-selector
25650 objc-selector-seq
25652 objc-selector-seq:
25653 objc-selector :
25654 objc-selector-seq objc-selector :
25656 Returns a representation of the method selector. */
25658 static tree
25660 {
25672 {
25681 {
25682 /* Detect if we have a unary selector. */
25684 {
25687 }
25688 else
25689 {
25691 }
25692 }
25697 {
25698 sel_seq
25701 sel_seq
25704 }
25705 else
25706 sel_seq
25711 }
25713 finish_selector:
25717 }
25719 /* Parse a list of identifiers.
25721 objc-identifier-list:
25722 identifier
25723 objc-identifier-list , identifier
25725 Returns a TREE_LIST of identifier nodes. */
25727 static tree
25729 {
25730 tree identifier;
25731 tree list;
25742 {
25749 identifier));
25751 }
25754 }
25756 /* Parse an Objective-C alias declaration.
25758 objc-alias-declaration:
25759 @compatibility_alias identifier identifier ;
25761 This function registers the alias mapping with the Objective-C front end.
25762 It returns nothing. */
25764 static void
25766 {
25774 }
25776 /* Parse an Objective-C class forward-declaration.
25778 objc-class-declaration:
25779 @class objc-identifier-list ;
25781 The function registers the forward declarations with the Objective-C
25782 front end. It returns nothing. */
25784 static void
25786 {
25789 {
25790 tree id;
25800 else
25802 }
25804 }
25806 /* Parse a list of Objective-C protocol references.
25808 objc-protocol-refs-opt:
25809 objc-protocol-refs [opt]
25811 objc-protocol-refs:
25812 < objc-identifier-list >
25814 Returns a TREE_LIST of identifiers, if any. */
25816 static tree
25818 {
25822 {
25826 }
25829 }
25831 /* Parse a Objective-C visibility specification. */
25833 static void
25835 {
25839 {
25854 }
25856 /* Eat '@private'/'@protected'/'@public'. */
25858 }
25860 /* Parse an Objective-C method type. Return 'true' if it is a class
25861 (+) method, and 'false' if it is an instance (-) method. */
25865 {
25868 else
25870 }
25872 /* Parse an Objective-C protocol qualifier. */
25874 static tree
25876 {
25889 {
25894 }
25897 }
25899 /* Parse an Objective-C typename. */
25901 static tree
25903 {
25907 {
25913 /* An ObjC type name may consist of just protocol qualifiers, in which
25914 case the type shall default to 'id'. */
25916 {
25919 /* If the type could not be parsed, an error has already
25920 been produced. For error recovery, behave as if it had
25921 not been specified, which will use the default type
25922 'id'. */
25924 {
25926 /* We need to skip to the closing parenthesis as
25927 cp_parser_type_id() does not seem to do it for
25928 us. */
25933 }
25934 }
25938 }
25941 }
25943 /* Check to see if TYPE refers to an Objective-C selector name. */
25945 static bool
25947 {
25953 }
25955 /* Parse an Objective-C selector. */
25957 static tree
25959 {
25963 {
25966 }
25968 /* C++ operator names are allowed to appear in ObjC selectors. */
25970 {
25983 }
25984 }
25986 /* Parse an Objective-C params list. */
25988 static tree
25990 {
25996 {
26006 /* Detect if we have a unary selector. */
26009 {
26012 }
26016 {
26017 /* Something went quite wrong. There should be a colon
26018 here, but there is not. Stop parsing parameters. */
26020 }
26022 /* New ObjC allows attributes on parameters too. */
26027 params
26030 type_name,
26031 identifier,
26032 parm_attr));
26035 }
26038 {
26041 }
26043 /* We allow tail attributes for the method. */
26045 {
26053 }
26056 {
26059 }
26061 }
26063 /* Parse the non-keyword Objective-C params. */
26065 static tree
26068 {
26074 {
26076 tree parm;
26082 {
26087 }
26089 /* TODO: parse attributes for tail parameters. */
26098 }
26100 /* We allow tail attributes for the method. */
26102 {
26104 {
26109 }
26110 else
26111 /* We have an error, but parse the attributes, so that we can
26112 carry on. */
26118 }
26121 }
26123 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26125 static void
26127 {
26130 /* If the next token is `extern' and the following token is a string
26131 literal, then we have a linkage specification. */
26133 && cp_parser_is_pure_string_literal
26136 /* Handle #pragma, if any. */
26139 /* Allow stray semicolons. */
26142 /* Mark methods as optional or required, when building protocols. */
26144 {
26147 }
26149 {
26152 }
26155 /* Other stray characters must generate errors. */
26157 {
26161 }
26162 /* Finally, try to parse a block-declaration, or a function-definition. */
26163 else
26165 }
26167 /* Parse a method signature. */
26169 static tree
26171 {
26187 }
26189 static bool
26191 {
26192 tree tattr;
26197 /* If the attributes are followed by a method introducer, this is not allowed.
26198 Dump the attributes and flag the situation. */
26203 /* Otherwise, the attributes introduce some interstitial code, possibly so
26204 rewind to allow that check. */
26207 }
26209 /* Parse an Objective-C method prototype list. */
26211 static void
26213 {
26217 {
26219 {
26224 else
26228 {
26232 }
26235 }
26241 OPT_Wattributes,
26243 else
26244 /* Allow for interspersed non-ObjC++ code. */
26248 }
26252 else
26256 }
26258 /* Parse an Objective-C method definition list. */
26260 static void
26262 {
26266 {
26267 tree meth;
26270 {
26276 else
26281 {
26285 }
26287 NULL_TREE);
26289 /* For historical reasons, we accept an optional semicolon. */
26296 {
26303 }
26304 }
26305 /* The following case will be removed once @synthesize is
26306 completely implemented. */
26317 else
26318 /* Allow for interspersed non-ObjC++ code. */
26322 }
26326 else
26330 }
26332 /* Parse Objective-C ivars. */
26334 static void
26336 {
26347 {
26348 cp_decl_specifier_seq declspecs;
26350 tree prefix_attributes;
26358 CP_PARSER_FLAGS_OPTIONAL,
26362 /* auto, register, static, extern, mutable. */
26364 {
26367 }
26369 /* thread_local. */
26371 {
26374 }
26376 /* typedef. */
26378 {
26381 }
26386 /* Keep going until we hit the `;' at the end of the
26387 declaration. */
26389 {
26394 /* Check for a (possibly unnamed) bitfield declaration. */
26402 {
26403 /* Get the name of the bitfield. */
26406 sfk_none);
26408 eat_colon:
26410 /* Get the width of the bitfield. */
26411 width
26414 NULL);
26415 }
26416 else
26417 {
26418 /* Parse the declarator. */
26419 declarator
26425 }
26427 /* Look for attributes that apply to the ivar. */
26429 /* Remember which attributes are prefix attributes and
26430 which are not. */
26432 /* Combine the attributes. */
26436 /* Create the bitfield declaration. */
26438 width,
26439 attributes);
26440 else
26445 /* Add the instance variable. */
26449 /* Reset PREFIX_ATTRIBUTES. */
26458 {
26461 }
26463 }
26467 }
26472 /* Do not consume the RID_AT_END, so it will be read again as terminating
26473 the @interface of @implementation. */
26477 /* For historical reasons, we accept an optional semicolon. */
26480 }
26482 /* Parse an Objective-C protocol declaration. */
26484 static void
26486 {
26492 {
26497 }
26499 /* See if we have a forward declaration or a definition. */
26502 /* Try a forward declaration first. */
26504 {
26506 {
26507 tree id;
26517 else
26519 }
26521 }
26523 /* Ok, we got a full-fledged definition (or at least should). */
26524 else
26525 {
26530 }
26531 }
26533 /* Parse an Objective-C superclass or category. */
26535 static void
26540 {
26546 {
26549 }
26551 {
26554 /* If there is no category name, and this is an @interface, we
26555 have a class extension. */
26557 {
26560 }
26561 else
26565 }
26566 }
26568 /* Parse an Objective-C class interface. */
26570 static void
26572 {
26579 {
26580 /* It's hard to recover because even if valid @interface stuff
26581 is to follow, we can't compile it (or validate it) if we
26582 don't even know which class it refers to. Let's assume this
26583 was a stray '@interface' token in the stream and skip it.
26584 */
26586 }
26591 /* We have either a class or a category on our hands. */
26594 else
26595 {
26597 /* Handle instance variable declarations, if any. */
26600 }
26603 }
26605 /* Parse an Objective-C class implementation. */
26607 static void
26609 {
26616 {
26617 /* It's hard to recover because even if valid @implementation
26618 stuff is to follow, we can't compile it (or validate it) if
26619 we don't even know which class it refers to. Let's assume
26620 this was a stray '@implementation' token in the stream and
26621 skip it.
26622 */
26624 }
26628 /* We have either a class or a category on our hands. */
26631 else
26632 {
26634 /* Handle instance variable declarations, if any. */
26637 }
26640 }
26642 /* Consume the @end token and finish off the implementation. */
26644 static void
26646 {
26649 }
26651 /* Parse an Objective-C declaration. */
26653 static void
26655 {
26656 /* Try to figure out what kind of declaration is present. */
26661 {
26677 }
26680 {
26703 }
26704 }
26706 /* Parse an Objective-C try-catch-finally statement.
26708 objc-try-catch-finally-stmt:
26709 @try compound-statement objc-catch-clause-seq [opt]
26710 objc-finally-clause [opt]
26712 objc-catch-clause-seq:
26713 objc-catch-clause objc-catch-clause-seq [opt]
26715 objc-catch-clause:
26716 @catch ( objc-exception-declaration ) compound-statement
26718 objc-finally-clause:
26719 @finally compound-statement
26721 objc-exception-declaration:
26722 parameter-declaration
26723 '...'
26725 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26727 Returns NULL_TREE.
26729 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26730 for C. Keep them in sync. */
26732 static tree
26734 {
26735 location_t location;
26736 tree stmt;
26741 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26742 node, lest it get absorbed into the surrounding block. */
26748 {
26757 {
26758 /* We have "@catch (...)" (where the '...' are literally
26759 what is in the code). Skip the '...'.
26760 parameter_declaration is set to NULL_TREE, and
26761 objc_being_catch_clauses() knows that that means
26762 '...'. */
26765 }
26766 else
26767 {
26768 /* We have "@catch (NSException *exception)" or something
26769 like that. Parse the parameter declaration. */
26773 else
26778 }
26781 else
26782 {
26783 /* If there was no open parenthesis, we are recovering from
26784 an error, and we are trying to figure out what mistake
26785 the user has made. */
26787 /* If there is an immediate closing parenthesis, the user
26788 probably forgot the opening one (ie, they typed "@catch
26789 NSException *e)". Parse the closing parenthesis and keep
26790 going. */
26794 /* If these is no immediate closing parenthesis, the user
26795 probably doesn't know that parenthesis are required at
26796 all (ie, they typed "@catch NSException *e"). So, just
26797 forget about the closing parenthesis and keep going. */
26798 }
26802 }
26804 {
26807 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26808 node, lest it get absorbed into the surrounding block. */
26812 }
26815 }
26817 /* Parse an Objective-C synchronized statement.
26819 objc-synchronized-stmt:
26820 @synchronized ( expression ) compound-statement
26822 Returns NULL_TREE. */
26824 static tree
26826 {
26827 location_t location;
26838 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26839 node, lest it get absorbed into the surrounding block. */
26844 }
26846 /* Parse an Objective-C throw statement.
26848 objc-throw-stmt:
26849 @throw assignment-expression [opt] ;
26851 Returns a constructed '@throw' statement. */
26853 static tree
26855 {
26867 }
26869 /* Parse an Objective-C statement. */
26871 static tree
26873 {
26874 /* Try to figure out what kind of declaration is present. */
26878 {
26889 }
26892 }
26894 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26895 look ahead to see if an objc keyword follows the attributes. This
26896 is to detect the use of prefix attributes on ObjC @interface and
26897 @protocol. */
26899 static bool
26901 {
26906 {
26909 }
26912 }
26914 /* This routine is a minimal replacement for
26915 c_parser_struct_declaration () used when parsing the list of
26916 types/names or ObjC++ properties. For example, when parsing the
26917 code
26919 @property (readonly) int a, b, c;
26921 this function is responsible for parsing "int a, int b, int c" and
26922 returning the declarations as CHAIN of DECLs.
26924 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26925 similar parsing. */
26926 static tree
26928 {
26930 cp_decl_specifier_seq declspecs;
26932 tree prefix_attributes;
26935 CP_PARSER_FLAGS_NONE,
26942 /* auto, register, static, extern, mutable. */
26944 {
26947 }
26949 /* thread_local. */
26951 {
26954 }
26956 /* typedef. */
26958 {
26961 }
26966 /* Keep going until we hit the `;' at the end of the declaration. */
26968 {
26973 /* Parse the declarator. */
26977 /* Look for attributes that apply to the ivar. */
26979 /* Remember which attributes are prefix attributes and
26980 which are not. */
26982 /* Combine the attributes. */
26992 /* Reset PREFIX_ATTRIBUTES. */
27003 {
27006 }
27007 else
27009 }
27011 }
27013 /* Parse an Objective-C @property declaration. The syntax is:
27015 objc-property-declaration:
27016 '@property' objc-property-attributes[opt] struct-declaration ;
27018 objc-property-attributes:
27019 '(' objc-property-attribute-list ')'
27021 objc-property-attribute-list:
27022 objc-property-attribute
27023 objc-property-attribute-list, objc-property-attribute
27025 objc-property-attribute
27026 'getter' = identifier
27027 'setter' = identifier
27028 'readonly'
27029 'readwrite'
27030 'assign'
27031 'retain'
27032 'copy'
27033 'nonatomic'
27035 For example:
27036 @property NSString *name;
27037 @property (readonly) id object;
27038 @property (retain, nonatomic, getter=getTheName) id name;
27039 @property int a, b, c;
27041 PS: This function is identical to
27042 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27043 static void
27045 {
27046 /* The following variables hold the attributes of the properties as
27047 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27048 seen. When we see an attribute, we set them to 'true' (if they
27049 are boolean properties) or to the identifier (if they have an
27050 argument, ie, for getter and setter). Note that here we only
27051 parse the list of attributes, check the syntax and accumulate the
27052 attributes that we find. objc_add_property_declaration() will
27053 then process the information. */
27063 /* 'properties' is the list of properties that we read. Usually a
27064 single one, but maybe more (eg, in "@property int a, b, c;" there
27065 are three). */
27066 tree properties;
27067 location_t loc;
27073 /* Parse the optional attribute list... */
27075 {
27076 /* Eat the '('. */
27080 {
27086 {
27089 }
27093 {
27104 {
27108 else
27113 }
27116 {
27120 }
27122 {
27124 {
27127 }
27128 else
27132 else
27134 }
27135 else
27136 {
27138 {
27141 }
27142 else
27144 }
27150 }
27157 else
27159 }
27161 /* FIXME: "@property (setter, assign);" will generate a spurious
27162 "error: expected ‘)’ before ‘,’ token". This is because
27163 cp_parser_require, unlike the C counterpart, will produce an
27164 error even if we are in error recovery. */
27166 {
27171 }
27172 }
27174 /* ... and the property declaration(s). */
27178 {
27180 /* If the next token is now a `;', consume it. */
27184 }
27188 else
27189 {
27190 /* Comma-separated properties are chained together in
27191 reverse order; add them one by one. */
27200 }
27203 }
27205 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27207 objc-synthesize-declaration:
27208 @synthesize objc-synthesize-identifier-list ;
27210 objc-synthesize-identifier-list:
27211 objc-synthesize-identifier
27212 objc-synthesize-identifier-list, objc-synthesize-identifier
27214 objc-synthesize-identifier
27215 identifier
27216 identifier = identifier
27218 For example:
27219 @synthesize MyProperty;
27220 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27222 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27223 for C. Keep them in sync.
27224 */
27225 static void
27227 {
27229 location_t loc;
27234 {
27238 {
27241 }
27243 {
27247 {
27250 }
27251 }
27252 else
27257 else
27259 }
27262 }
27264 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27266 objc-dynamic-declaration:
27267 @dynamic identifier-list ;
27269 For example:
27270 @dynamic MyProperty;
27271 @dynamic MyProperty, AnotherProperty;
27273 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27274 for C. Keep them in sync.
27275 */
27276 static void
27278 {
27280 location_t loc;
27285 {
27286 tree property;
27289 {
27292 }
27296 else
27298 }
27301 }
27303 \f
27304 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27306 /* Returns name of the next clause.
27307 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27308 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27309 returned and the token is consumed. */
27311 static pragma_omp_clause
27313 {
27325 {
27330 {
27433 }
27434 }
27440 }
27442 /* Validate that a clause of the given type does not already exist. */
27444 static void
27447 {
27448 tree c;
27452 {
27455 }
27456 }
27458 /* OpenMP 2.5:
27459 variable-list:
27460 identifier
27461 variable-list , identifier
27463 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27464 colon). An opening parenthesis will have been consumed by the caller.
27466 If KIND is nonzero, create the appropriate node and install the decl
27467 in OMP_CLAUSE_DECL and add the node to the head of the list.
27469 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27470 return the list created.
27472 COLON can be NULL if only closing parenthesis should end the list,
27473 or pointer to bool which will receive false if the list is terminated
27474 by closing parenthesis or true if the list is terminated by colon. */
27476 static tree
27479 {
27483 {
27486 }
27488 {
27505 {
27507 {
27513 {
27521 parser->colon_corrects_to_scope_p
27525 else
27526 {
27527 /* Look for `:'. */
27531 CPP_CLOSE_SQUARE))
27533 }
27534 /* Look for the closing `]'. */
27536 RT_CLOSE_SQUARE))
27539 }
27543 }
27549 }
27550 else
27553 get_comma:
27557 }
27563 {
27567 }
27570 {
27573 /* Try to resync to an unnested comma. Copied from
27574 cp_parser_parenthesized_expression_list. */
27575 skip_comma:
27584 }
27587 }
27589 /* Similarly, but expect leading and trailing parenthesis. This is a very
27590 common case for omp clauses. */
27592 static tree
27594 {
27598 }
27600 /* OpenMP 3.0:
27601 collapse ( constant-expression ) */
27603 static tree
27605 {
27607 location_t loc;
27608 HOST_WIDE_INT n;
27628 {
27631 }
27639 }
27641 /* OpenMP 2.5:
27642 default ( shared | none ) */
27644 static tree
27646 {
27648 tree c;
27653 {
27658 {
27673 }
27676 }
27677 else
27678 {
27679 invalid_kind:
27681 }
27697 }
27699 /* OpenMP 3.1:
27700 final ( expression ) */
27702 static tree
27704 {
27725 }
27727 /* OpenMP 2.5:
27728 if ( expression ) */
27730 static tree
27732 {
27753 }
27755 /* OpenMP 3.1:
27756 mergeable */
27758 static tree
27761 {
27762 tree c;
27765 location);
27770 }
27772 /* OpenMP 2.5:
27773 nowait */
27775 static tree
27778 {
27779 tree c;
27786 }
27788 /* OpenMP 2.5:
27789 num_threads ( expression ) */
27791 static tree
27793 location_t location)
27794 {
27816 }
27818 /* OpenMP 2.5:
27819 ordered */
27821 static tree
27824 {
27825 tree c;
27833 }
27835 /* OpenMP 2.5:
27836 reduction ( reduction-operator : variable-list )
27838 reduction-operator:
27839 One of: + * - & ^ | && ||
27841 OpenMP 3.1:
27843 reduction-operator:
27844 One of: + * - & ^ | && || min max
27846 OpenMP 4.0:
27848 reduction-operator:
27849 One of: + * - & ^ | && ||
27850 id-expression */
27852 static tree
27854 {
27862 {
27872 }
27876 else
27877 {
27888 {
27918 }
27919 else
27920 {
27922 resync_fail:
27927 }
27928 }
27934 NULL);
27936 {
27939 }
27942 }
27944 /* OpenMP 2.5:
27945 schedule ( schedule-kind )
27946 schedule ( schedule-kind , expression )
27948 schedule-kind:
27949 static | dynamic | guided | runtime | auto */
27951 static tree
27953 {
27962 {
27967 {
27988 }
27989 }
27994 else
27999 {
28014 else
28019 }
28027 invalid_kind:
28029 resync_fail:
28034 }
28036 /* OpenMP 3.0:
28037 untied */
28039 static tree
28042 {
28043 tree c;
28050 }
28052 /* OpenMP 4.0:
28053 inbranch
28054 notinbranch */
28056 static tree
28059 {
28064 }
28066 /* OpenMP 4.0:
28067 parallel
28068 for
28069 sections
28070 taskgroup */
28072 static tree
28076 {
28080 }
28082 /* OpenMP 4.0:
28083 num_teams ( expression ) */
28085 static tree
28087 location_t location)
28088 {
28110 }
28112 /* OpenMP 4.0:
28113 thread_limit ( expression ) */
28115 static tree
28117 location_t location)
28118 {
28140 }
28142 /* OpenMP 4.0:
28143 aligned ( variable-list )
28144 aligned ( variable-list : constant-expression ) */
28146 static tree
28148 {
28159 {
28169 }
28175 }
28177 /* OpenMP 4.0:
28178 linear ( variable-list )
28179 linear ( variable-list : expression ) */
28181 static tree
28184 {
28195 {
28199 {
28202 }
28210 }
28216 }
28218 /* OpenMP 4.0:
28219 safelen ( constant-expression ) */
28221 static tree
28223 location_t location)
28224 {
28245 }
28247 /* OpenMP 4.0:
28248 simdlen ( constant-expression ) */
28250 static tree
28252 location_t location)
28253 {
28274 }
28276 /* OpenMP 4.0:
28277 depend ( depend-kind : variable-list )
28279 depend-kind:
28280 in | out | inout */
28282 static tree
28284 {
28292 {
28302 else
28304 }
28305 else
28313 NULL);
28320 invalid_kind:
28322 resync_fail:
28327 }
28329 /* OpenMP 4.0:
28330 map ( map-kind : variable-list )
28331 map ( variable-list )
28333 map-kind:
28334 alloc | to | from | tofrom */
28336 static tree
28338 {
28347 {
28359 else
28360 {
28366 }
28369 }
28372 NULL);
28378 }
28380 /* OpenMP 4.0:
28381 device ( expression ) */
28383 static tree
28385 location_t location)
28386 {
28408 }
28410 /* OpenMP 4.0:
28411 dist_schedule ( static )
28412 dist_schedule ( static , expression ) */
28414 static tree
28416 location_t location)
28417 {
28430 {
28441 }
28446 location);
28450 invalid_kind:
28452 resync_fail:
28457 }
28459 /* OpenMP 4.0:
28460 proc_bind ( proc-bind-kind )
28462 proc-bind-kind:
28463 master | close | spread */
28465 static tree
28467 location_t location)
28468 {
28469 tree c;
28476 {
28486 else
28488 }
28489 else
28498 location);
28503 invalid_kind:
28505 resync_fail:
28510 }
28512 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28513 is a bitmask in MASK. Return the list of clauses found; the result
28514 of clause default goes in *pdefault. */
28516 static tree
28520 {
28527 {
28528 pragma_omp_clause c_kind;
28539 {
28551 clauses);
28565 clauses);
28574 clauses);
28598 clauses);
28612 clauses);
28629 OMP_CLAUSE_NOTINBRANCH,
28638 {
28639 clause_not_first:
28643 }
28668 clauses);
28673 clauses);
28678 clauses);
28741 }
28746 {
28747 /* Remove the invalid clause(s) from the list to avoid
28748 confusing the rest of the compiler. */
28751 }
28752 }
28753 saw_error:
28754 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28755 no reason to skip to the end. */
28761 }
28763 /* OpenMP 2.5:
28764 structured-block:
28765 statement
28767 In practice, we're also interested in adding the statement to an
28768 outer node. So it is convenient if we work around the fact that
28769 cp_parser_statement calls add_stmt. */
28771 static unsigned
28773 {
28776 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28777 This preserves the "not within loop or switch" style error messages
28778 for nonsense cases like
28779 void foo() {
28780 #pragma omp single
28781 break;
28782 }
28783 */
28788 }
28790 static void
28792 {
28794 }
28796 static tree
28798 {
28806 }
28808 /* OpenMP 2.5:
28809 # pragma omp atomic new-line
28810 expression-stmt
28812 expression-stmt:
28813 x binop= expr | x++ | ++x | x-- | --x
28814 binop:
28815 +, *, -, /, &, ^, |, <<, >>
28817 where x is an lvalue expression with scalar type.
28819 OpenMP 3.1:
28820 # pragma omp atomic new-line
28821 update-stmt
28823 # pragma omp atomic read new-line
28824 read-stmt
28826 # pragma omp atomic write new-line
28827 write-stmt
28829 # pragma omp atomic update new-line
28830 update-stmt
28832 # pragma omp atomic capture new-line
28833 capture-stmt
28835 # pragma omp atomic capture new-line
28836 capture-block
28838 read-stmt:
28839 v = x
28840 write-stmt:
28841 x = expr
28842 update-stmt:
28843 expression-stmt | x = x binop expr
28844 capture-stmt:
28845 v = expression-stmt
28846 capture-block:
28847 { v = x; update-stmt; } | { update-stmt; v = x; }
28849 OpenMP 4.0:
28850 update-stmt:
28851 expression-stmt | x = x binop expr | x = expr binop x
28852 capture-stmt:
28853 v = update-stmt
28854 capture-block:
28855 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28857 where x and v are lvalue expressions with scalar type. */
28859 static void
28861 {
28869 {
28874 {
28880 }
28881 }
28883 {
28895 else
28899 }
28901 {
28907 {
28912 {
28915 }
28916 }
28917 }
28921 {
28932 else
28938 {
28939 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28940 opcode. */
28945 }
28949 {
28952 }
28953 else
28954 {
28961 }
28964 }
28966 restart:
28971 {
28978 /* FALLTHROUGH */
28988 /* FALLTHROUGH */
29003 /* Undo effects of boolean_increment for post {in,de}crement. */
29005 /* FALLTHRU */
29009 {
29010 /* Undo effects of boolean_increment. */
29012 {
29013 /* This is pre or post increment. */
29018 && !structured_block
29022 }
29023 }
29024 /* FALLTHRU */
29027 {
29062 {
29066 }
29069 {
29075 {
29080 }
29082 {
29093 {
29095 {
29100 }
29101 else
29103 }
29107 }
29110 {
29117 }
29121 }
29125 {
29128 {
29136 }
29138 {
29143 }
29178 }
29189 /* FALLTHROUGH */
29194 }
29201 }
29202 stmt_done:
29204 {
29217 }
29219 {
29222 }
29223 done:
29229 saw_error:
29232 {
29236 {
29240 }
29241 }
29242 }
29245 /* OpenMP 2.5:
29246 # pragma omp barrier new-line */
29248 static void
29250 {
29253 }
29255 /* OpenMP 2.5:
29256 # pragma omp critical [(name)] new-line
29257 structured-block */
29259 static tree
29261 {
29265 {
29277 }
29282 }
29284 /* OpenMP 2.5:
29285 # pragma omp flush flush-vars[opt] new-line
29287 flush-vars:
29288 ( variable-list ) */
29290 static void
29292 {
29298 }
29300 /* Helper function, to parse omp for increment expression. */
29302 static tree
29304 {
29309 {
29312 }
29315 {
29324 /* Fall through: OpenMP disallows NE_EXPR. */
29327 }
29329 /* If decl is an iterator, preserve LHS and RHS of the relational
29330 expr until finish_omp_for. */
29340 }
29342 /* Helper function, to parse omp for increment expression. */
29344 static tree
29346 {
29350 cp_id_kind idk;
29354 {
29362 }
29370 {
29375 }
29382 {
29386 }
29398 do
29399 {
29406 {
29408 {
29411 else
29413 tf_warning_or_error);
29414 }
29415 else
29418 }
29419 }
29423 {
29427 }
29428 else
29432 }
29434 /* Parse the initialization statement of either an OpenMP for loop or
29435 a Cilk Plus for loop.
29437 Return true if the resulting construct should have an
29438 OMP_CLAUSE_PRIVATE added to it. */
29440 static bool
29448 {
29454 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29456 init-expr:
29457 var = lb
29458 integer-type var = lb
29459 random-access-iterator-type var = lb
29460 pointer-type var = lb
29461 */
29462 cp_decl_specifier_seq type_specifiers;
29464 /* First, try to parse as an initialized declaration. See
29465 cp_parser_condition, from whence the bulk of this is copied. */
29472 {
29473 /* If parsing a type specifier seq succeeded, then this
29474 MUST be a initialized declaration. */
29479 CP_PARSER_DECLARATOR_NAMED,
29490 else
29491 {
29501 {
29503 CPP_OPEN_PAREN))
29504 {
29508 else
29511 }
29512 else
29513 /* Trigger an error. */
29518 }
29522 {
29530 {
29533 auto_node);
29538 }
29541 asm_specification,
29542 LOOKUP_ONLYCONVERTING);
29544 {
29547 }
29548 else
29551 }
29552 else
29553 {
29554 /* Consume '='. */
29558 non_class:
29561 else
29564 asm_specification,
29565 LOOKUP_ONLYCONVERTING);
29566 }
29570 }
29571 }
29572 else
29573 {
29574 cp_id_kind idk;
29575 /* If parsing a type specifier sequence failed, then
29576 this MUST be a simple expression. */
29584 && decl
29587 {
29588 tree rhs;
29595 rhs,
29596 tf_warning_or_error));
29598 }
29599 else
29600 {
29605 {
29609 }
29610 }
29611 }
29613 }
29615 /* Parse the restricted form of the for statement allowed by OpenMP. */
29617 static tree
29620 {
29624 location_t loc_first;
29643 {
29646 location_t loc;
29650 {
29653 }
29656 {
29659 }
29668 add_private_clause
29675 {
29678 {
29684 }
29685 else
29687 }
29694 {
29699 {
29703 }
29706 {
29707 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29708 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29713 {
29716 }
29717 else
29718 {
29721 }
29725 }
29726 else
29727 {
29732 }
29733 }
29736 {
29737 tree c;
29739 {
29748 decl);
29752 decl);
29753 }
29755 {
29760 {
29763 }
29764 }
29765 }
29774 {
29775 /* If decl is an iterator, preserve the operator on decl
29776 until finish_omp_for. */
29778 && ((processing_template_decl
29782 else
29786 }
29801 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29802 in between the collapsed for loops to be still considered perfectly
29803 nested. Hopefully the final version clarifies this.
29804 For now handle (multiple) {'s and empty statements. */
29806 do
29807 {
29811 {
29813 bracecount++;
29814 }
29818 else
29819 {
29826 }
29827 }
29831 {
29834 }
29835 }
29837 /* Note that we saved the original contents of this flag when we entered
29838 the structured block, and so we don't need to re-save it here. */
29841 else
29844 /* Note that the grammar doesn't call for a structured block here,
29845 though the loop as a whole is a structured block. */
29852 else
29857 {
29859 {
29861 nbraces--;
29862 }
29865 else
29866 {
29868 {
29871 }
29876 }
29877 }
29884 }
29886 /* Helper function for OpenMP parsing, split clauses and call
29887 finish_omp_clauses on each of the set of clauses afterwards. */
29889 static void
29892 {
29898 }
29900 /* OpenMP 4.0:
29901 #pragma omp simd simd-clause[optseq] new-line
29902 for-loop */
29904 #define OMP_SIMD_CLAUSE_MASK \
29905 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29913 static tree
29916 {
29928 {
29931 }
29942 }
29944 /* OpenMP 2.5:
29945 #pragma omp for for-clause[optseq] new-line
29946 for-loop
29948 OpenMP 4.0:
29949 #pragma omp for simd for-simd-clause[optseq] new-line
29950 for-loop */
29952 #define OMP_FOR_CLAUSE_MASK \
29953 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29962 static tree
29965 {
29976 {
29981 {
29989 cclauses);
29993 cclauses);
30005 }
30006 }
30008 {
30011 }
30016 {
30019 }
30030 }
30032 /* OpenMP 2.5:
30033 # pragma omp master new-line
30034 structured-block */
30036 static tree
30038 {
30042 }
30044 /* OpenMP 2.5:
30045 # pragma omp ordered new-line
30046 structured-block */
30048 static tree
30050 {
30054 }
30056 /* OpenMP 2.5:
30058 section-scope:
30059 { section-sequence }
30061 section-sequence:
30062 section-directive[opt] structured-block
30063 section-sequence section-directive structured-block */
30065 static tree
30067 {
30078 {
30082 }
30085 {
30093 {
30097 }
30099 {
30102 }
30107 }
30118 }
30120 /* OpenMP 2.5:
30121 # pragma omp sections sections-clause[optseq] newline
30122 sections-scope */
30124 #define OMP_SECTIONS_CLAUSE_MASK \
30125 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30131 static tree
30134 {
30146 {
30149 }
30156 }
30158 /* OpenMP 2.5:
30159 # pragma omp parallel parallel-clause[optseq] new-line
30160 structured-block
30161 # pragma omp parallel for parallel-for-clause[optseq] new-line
30162 structured-block
30163 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30164 structured-block
30166 OpenMP 4.0:
30167 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30168 structured-block */
30170 #define OMP_PARALLEL_CLAUSE_MASK \
30171 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30181 static tree
30184 {
30193 {
30206 block);
30211 }
30213 {
30217 }
30219 {
30222 }
30224 {
30228 {
30238 block);
30241 }
30242 }
30252 }
30254 /* OpenMP 2.5:
30255 # pragma omp single single-clause[optseq] new-line
30256 structured-block */
30258 #define OMP_SINGLE_CLAUSE_MASK \
30259 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30264 static tree
30266 {
30276 }
30278 /* OpenMP 3.0:
30279 # pragma omp task task-clause[optseq] new-line
30280 structured-block */
30282 #define OMP_TASK_CLAUSE_MASK \
30283 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30293 static tree
30295 {
30306 }
30308 /* OpenMP 3.0:
30309 # pragma omp taskwait new-line */
30311 static void
30313 {
30316 }
30318 /* OpenMP 3.1:
30319 # pragma omp taskyield new-line */
30321 static void
30323 {
30326 }
30328 /* OpenMP 4.0:
30329 # pragma omp taskgroup new-line
30330 structured-block */
30332 static tree
30334 {
30338 }
30341 /* OpenMP 2.5:
30342 # pragma omp threadprivate (variable-list) */
30344 static void
30346 {
30347 tree vars;
30353 }
30355 /* OpenMP 4.0:
30356 # pragma omp cancel cancel-clause[optseq] new-line */
30358 #define OMP_CANCEL_CLAUSE_MASK \
30359 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30365 static void
30367 {
30371 }
30373 /* OpenMP 4.0:
30374 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30376 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30377 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30382 static void
30384 {
30385 tree clauses;
30389 {
30394 {
30397 }
30398 }
30400 {
30404 }
30407 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30409 pragma_tok);
30411 }
30413 /* OpenMP 4.0:
30414 #pragma omp distribute distribute-clause[optseq] new-line
30415 for-loop */
30417 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30418 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30423 static tree
30426 {
30435 {
30443 else
30446 {
30452 {
30455 cclauses);
30456 else
30458 cclauses);
30459 }
30464 cclauses);
30465 else
30467 cclauses);
30479 }
30480 }
30482 {
30485 }
30490 {
30493 }
30504 }
30506 /* OpenMP 4.0:
30507 # pragma omp teams teams-clause[optseq] new-line
30508 structured-block */
30510 #define OMP_TEAMS_CLAUSE_MASK \
30511 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30519 static tree
30522 {
30531 {
30535 {
30543 cclauses);
30547 cclauses);
30558 }
30559 }
30561 {
30564 }
30569 {
30572 }
30580 }
30582 /* OpenMP 4.0:
30583 # pragma omp target data target-data-clause[optseq] new-line
30584 structured-block */
30586 #define OMP_TARGET_DATA_CLAUSE_MASK \
30587 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30591 static tree
30593 {
30605 }
30607 /* OpenMP 4.0:
30608 # pragma omp target update target-update-clause[optseq] new-line */
30610 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30611 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30612 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30613 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30614 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30616 static bool
30619 {
30621 {
30623 "%<#pragma omp target update%> may only be "
30627 }
30629 tree clauses
30634 {
30636 "%<#pragma omp target update must contain at least one "
30639 }
30647 }
30649 /* OpenMP 4.0:
30650 # pragma omp target target-clause[optseq] new-line
30651 structured-block */
30653 #define OMP_TARGET_CLAUSE_MASK \
30654 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30658 static bool
30661 {
30663 {
30667 }
30670 {
30675 {
30683 {
30685 OMP_TARGET_CLAUSE_MASK,
30686 cclauses);
30688 }
30704 }
30706 {
30709 }
30711 {
30715 }
30717 {
30720 }
30721 }
30735 }
30737 /* OpenMP 4.0:
30738 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30740 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30741 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30748 static void
30751 {
30753 cp_omp_declare_simd_data data;
30755 {
30760 }
30771 {
30775 {
30788 }
30793 "%<#pragma omp declare simd%> not immediately followed by "
30797 }
30798 }
30800 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30801 This function is modelled similar to the late parsing of omp declare
30802 simd. */
30804 static tree
30806 {
30812 {
30818 }
30820 {
30824 }
30829 {
30836 NULL);
30850 }
30855 }
30857 /* Finalize #pragma omp declare simd clauses after direct declarator has
30858 been parsed, and put that into "omp declare simd" attribute. */
30860 static tree
30862 {
30868 {
30873 }
30878 {
30896 }
30900 }
30903 /* OpenMP 4.0:
30904 # pragma omp declare target new-line
30905 declarations and definitions
30906 # pragma omp end declare target new-line */
30908 static void
30910 {
30913 }
30915 static void
30917 {
30920 {
30923 }
30925 {
30929 {
30932 }
30935 else
30936 {
30940 }
30941 }
30942 else
30943 {
30947 }
30951 "%<#pragma omp end declare target%> without corresponding "
30953 else
30955 }
30957 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30958 expression and optional initializer clause of
30959 #pragma omp declare reduction. We store the expression(s) as
30960 either 3, 6 or 7 special statements inside of the artificial function's
30961 body. The first two statements are DECL_EXPRs for the artificial
30962 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30963 expression that uses those variables.
30964 If there was any INITIALIZER clause, this is followed by further statements,
30965 the fourth and fifth statements are DECL_EXPRs for the artificial
30966 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30967 constructor variant (first token after open paren is not omp_priv),
30968 then the sixth statement is a statement with the function call expression
30969 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30970 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30971 to initialize the OMP_PRIV artificial variable and there is seventh
30972 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30974 static bool
30976 {
30988 tree combiner;
31003 {
31006 }
31009 {
31016 {
31019 }
31035 {
31039 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31043 == CPP_CLOSE_PAREN
31046 {
31050 }
31055 }
31056 else
31057 {
31073 {
31078 }
31080 tree arg;
31093 }
31104 }
31110 }
31112 /* OpenMP 4.0
31113 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31114 initializer-clause[opt] new-line
31116 initializer-clause:
31117 initializer (omp_priv initializer)
31118 initializer (function-name (argument-list)) */
31120 static void
31123 {
31133 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31140 {
31172 }
31184 /* Types may not be defined in declare reduction type list. */
31187 parser->type_definition_forbidden_message
31193 saved_colon_doesnt_start_class_def_p
31198 {
31202 ;
31223 else
31228 else
31230 }
31232 /* Restore the saved message. */
31235 parser->colon_doesnt_start_class_def_p
31240 {
31241 fail:
31244 }
31250 {
31251 tree fntype
31254 NULL_TREE);
31273 {
31278 }
31280 {
31282 {
31291 }
31298 }
31299 else
31300 {
31303 }
31306 else
31309 {
31312 }
31314 {
31317 else
31322 }
31327 else
31328 {
31337 }
31344 }
31348 done:
31349 /* Free any declarators allocated. */
31351 }
31353 /* OpenMP 4.0
31354 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31355 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31356 initializer-clause[opt] new-line
31357 #pragma omp declare target new-line */
31359 static void
31362 {
31364 {
31369 {
31372 context);
31374 }
31377 {
31380 context);
31382 }
31384 {
31387 }
31389 {
31393 }
31394 }
31398 }
31400 /* Main entry point to OpenMP statement pragmas. */
31402 static void
31404 {
31405 tree stmt;
31410 {
31458 }
31462 }
31463 \f
31464 /* Transactional Memory parsing routines. */
31466 /* Parse a transaction attribute.
31468 txn-attribute:
31469 attribute
31470 [ [ identifier ] ]
31472 ??? Simplify this when C++0x bracket attributes are
31473 implemented properly. */
31475 static tree
31477 {
31492 {
31496 /* For keywords, use the canonical spelling,
31497 not the parsed identifier. */
31501 }
31502 else
31506 error1:
31509 }
31511 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31513 transaction-statement:
31514 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31515 compound-statement
31516 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31517 */
31519 static tree
31521 {
31536 else
31537 {
31541 }
31543 /* Parse a noexcept specification. */
31546 /* Keep track if we're in the lexical scope of an outer transaction. */
31558 }
31560 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31562 transaction-expression:
31563 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31564 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31565 */
31567 static tree
31569 {
31594 /* Set this early. This might mean that we allow transaction_cancel in
31595 an expression that we find out later actually has to be a constexpr.
31596 However, we expect that cxx_constant_value will be able to deal with
31597 this; also, if the noexcept has no constexpr, then what we parse next
31598 really is a transaction's body. */
31601 /* Parse a noexcept specification. */
31607 {
31614 }
31615 else
31616 {
31617 /* The only expression that is available got parsed for the noexcept
31618 already. noexcept is true then. */
31621 }
31630 }
31632 /* Parse a function-transaction-block.
31634 function-transaction-block:
31635 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31636 function-body
31637 __transaction_atomic txn-attribute[opt] function-try-block
31638 __transaction_relaxed ctor-initializer[opt] function-body
31639 __transaction_relaxed function-try-block
31640 */
31642 static bool
31644 {
31660 else
31661 {
31665 }
31673 else
31674 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31682 }
31684 /* Parse a __transaction_cancel statement.
31686 cancel-statement:
31687 __transaction_cancel txn-attribute[opt] ;
31688 __transaction_cancel txn-attribute[opt] throw-expression ;
31690 ??? Cancel and throw is not yet implemented. */
31692 static tree
31694 {
31700 RT_TRANSACTION_CANCEL);
31707 /* ??? Parse cancel-and-throw here. */
31712 {
31716 }
31718 {
31722 }
31724 {
31727 {
31733 }
31734 }
31736 {
31740 }
31746 }
31747 \f
31748 /* The parser. */
31752 \f
31753 /* Special handling for the first token or line in the file. The first
31754 thing in the file might be #pragma GCC pch_preprocess, which loads a
31755 PCH file, which is a GC collection point. So we need to handle this
31756 first pragma without benefit of an existing lexer structure.
31758 Always returns one token to the caller in *FIRST_TOKEN. This is
31759 either the true first token of the file, or the first token after
31760 the initial pragma. */
31762 static void
31764 {
31773 {
31780 }
31781 else
31784 /* Skip to the end of the pragma. */
31788 /* Now actually load the PCH file. */
31792 /* Read one more token to return to our caller. We have to do this
31793 after reading the PCH file in, since its pointers have to be
31794 live. */
31796 }
31798 /* Parses the grainsize pragma for the _Cilk_for statement.
31799 Syntax:
31800 #pragma cilk grainsize = <VALUE>. */
31802 static void
31804 {
31806 {
31811 {
31814 }
31816 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31819 else
31821 "%<#pragma cilk grainsize%> is not followed by "
31824 }
31826 }
31828 /* Normal parsing of a pragma token. Here we can (and must) use the
31829 regular lexer. */
31831 static bool
31833 {
31845 {
31853 {
31863 }
31868 {
31878 }
31883 {
31889 "%<#pragma omp taskwait%> may only be "
31894 }
31899 {
31905 "%<#pragma omp taskyield%> may only be "
31910 }
31915 {
31921 "%<#pragma omp cancel%> may only be "
31926 }
31931 {
31937 "%<#pragma omp cancellation point%> may only be "
31942 }
31980 "%<#pragma omp section%> may only be used in "
31985 {
31992 {
31995 }
31998 }
32002 {
32006 }
32012 {
32016 }
32018 /* Ignore the pragma if Cilk Plus is not enabled. */
32020 {
32023 }
32024 else
32025 {
32029 }
32036 bad_stmt:
32039 }
32043 }
32045 /* The interface the pragma parsers have to the lexer. */
32047 enum cpp_ttype
32049 {
32062 else
32063 {
32067 }
32070 }
32072 \f
32073 /* External interface. */
32075 /* Parse one entire translation unit. */
32077 void
32079 {
32091 }
32093 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32094 vectorlength clause:
32095 Syntax:
32096 vectorlength ( constant-expression ) */
32098 static tree
32101 {
32103 tree expr;
32104 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32105 safelen clause. Thus, vectorlength is represented as OMP 4.0
32106 safelen. For SIMD-enabled function it is represented by OMP 4.0
32107 simdlen. */
32110 loc);
32111 else
32113 loc);
32121 /* If expr == error_mark_node, then don't emit any errors nor
32122 create a clause. if any of the above functions returns
32123 error mark node then they would have emitted an error message. */
32125 ;
32133 else
32134 {
32135 tree c;
32137 {
32142 }
32143 else
32144 {
32149 }
32150 }
32155 }
32157 /* Handles the Cilk Plus #pragma simd linear clause.
32158 Syntax:
32159 linear ( simd-linear-variable-list )
32161 simd-linear-variable-list:
32162 simd-linear-variable
32163 simd-linear-variable-list , simd-linear-variable
32165 simd-linear-variable:
32166 id-expression
32167 id-expression : simd-linear-step
32169 simd-linear-step:
32170 conditional-expression */
32172 static tree
32174 {
32180 {
32184 }
32189 {
32192 {
32196 }
32203 {
32207 }
32208 else
32209 {
32213 /* If present, parse the linear step. Otherwise, assume the default
32214 value of 1. */
32216 {
32223 {
32224 /* If an error has occurred, then the whole pragma is
32225 considered ill-formed. Thus, no reason to keep
32226 parsing. */
32229 }
32237 else
32239 "step size must be an integer constant "
32241 }
32243 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32249 }
32254 else
32255 {
32260 }
32261 }
32265 }
32267 /* Returns the name of the next clause. If the clause is not
32268 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32269 token is not consumed. Otherwise, the appropriate enum from the
32270 pragma_simd_clause is returned and the token is consumed. */
32272 static pragma_omp_clause
32274 {
32275 pragma_omp_clause clause_type;
32292 else
32297 }
32299 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32301 static tree
32303 {
32308 {
32309 pragma_omp_clause c_kind;
32316 /* Use the OpenMP 4.0 equivalent function. */
32319 /* Use the OpenMP 4.0 equivalent function. */
32321 clauses);
32323 /* Use the OMP 4.0 equivalent function. */
32325 clauses);
32327 /* Use the OMP 4.0 equivalent function. */
32329 else
32330 {
32334 }
32335 }
32341 else
32343 }
32345 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32347 static void
32349 {
32356 {
32360 }
32369 }
32371 /* Main entry-point for parsing Cilk Plus _Cilk_for
32372 loops. The return value is error_mark_node
32373 when errors happen and CILK_FOR tree on success. */
32375 static tree
32377 {
32392 else
32398 }
32400 /* Create an identifier for a generic parameter type (a synthesized
32401 template parameter implied by `auto' or a concept identifier). */
32404 static tree
32406 {
32410 }
32412 /* Predicate that behaves as is_auto_or_concept but matches the parent
32413 node of the generic type rather than the generic type itself. This
32414 allows for type transformation in add_implicit_template_parms. */
32418 {
32420 }
32422 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32423 (creating a new template parameter list if necessary). Returns the newly
32424 created template type parm. */
32426 tree
32428 {
32431 /* We are either continuing a function template that already contains implicit
32432 template parameters, creating a new fully-implicit function template, or
32433 extending an existing explicit function template with implicit template
32434 parameters. */
32442 {
32446 }
32447 else
32448 {
32449 /* Roll back to the existing template parameter scope (in the case of
32450 extending an explicit function template) or introduce a new template
32451 parameter scope ahead of the function parameter scope (or class scope
32452 in the case of out-of-line member definitions). The function scope is
32453 added back after template parameter synthesis below. */
32458 {
32461 }
32463 {
32464 /* If not defining a class, then any class scope is a scope level in
32465 an out-of-line member definition. In this case simply wind back
32466 beyond the first such scope to inject the template parameter list.
32467 Otherwise wind back to the class being defined. The latter can
32468 occur in class member friend declarations such as:
32470 class A {
32471 void foo (auto);
32472 };
32473 class B {
32474 friend void A::foo (auto);
32475 };
32477 The template parameter list synthesized for the friend declaration
32478 must be injected in the scope of 'B'. This can also occur in
32479 erroneous cases such as:
32481 struct A {
32482 struct B {
32483 void foo (auto);
32484 };
32485 void B::foo (auto) {}
32486 };
32488 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32489 but, nevertheless, the template parameter list synthesized for the
32490 declarator should be injected into the scope of 'A' as if the
32491 ill-formed template was specified explicitly. */
32494 {
32497 }
32498 }
32504 {
32505 /* Introduce a new template parameter list for implicit template
32506 parameters. */
32510 parser->implicit_template_scope
32517 }
32518 else
32519 {
32520 /* Synthesize implicit template parameters at the end of the explicit
32521 template parameter list. */
32528 parser->implicit_template_parms
32530 }
32531 }
32533 /* Synthesize a new template parameter and track the current template
32534 parameter chain with implicit_template_parms. */
32538 synth_id);
32539 tree new_parm
32541 input_location,
32548 parser->implicit_template_parms
32550 else
32555 /* If creating a fully implicit function template, start the new implicit
32556 template parameter list with this synthesized type, otherwise grow the
32557 current template parameter list. */
32560 {
32567 }
32568 else
32569 {
32574 }
32579 }
32581 /* Finish the declaration of a fully implicit function template. Such a
32582 template has no explicit template parameter list so has not been through the
32583 normal template head and tail processing. synthesize_implicit_template_parm
32584 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32585 provided if the declaration is a class member such that its template
32586 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32587 form is returned. Otherwise NULL_TREE is returned. */
32589 tree
32591 {
32596 {
32600 }
32610 }