| blob | c6218af21e9406a163dbbffd3273b6ca91484032 |
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_empty ( type-id )
4138 __is_enum ( type-id )
4139 __is_final ( type-id )
4140 __is_literal_type ( type-id )
4141 __is_pod ( type-id )
4142 __is_polymorphic ( type-id )
4143 __is_std_layout ( type-id )
4144 __is_trivial ( type-id )
4145 __is_union ( type-id )
4147 Objective-C++ Extension:
4149 primary-expression:
4150 objc-expression
4152 literal:
4153 __null
4155 ADDRESS_P is true iff this expression was immediately preceded by
4156 "&" and therefore might denote a pointer-to-member. CAST_P is true
4157 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4158 true iff this expression is a template argument.
4160 Returns a representation of the expression. Upon return, *IDK
4161 indicates what kind of id-expression (if any) was present. */
4163 static tree
4170 {
4173 /* Assume the primary expression is not an id-expression. */
4176 /* Peek at the next token. */
4179 {
4180 /* literal:
4181 integer-literal
4182 character-literal
4183 floating-literal
4184 string-literal
4185 boolean-literal
4186 pointer-literal
4187 user-defined-literal */
4197 {
4201 }
4202 /* Floating-point literals are only allowed in an integral
4203 constant expression if they are cast to an integral or
4204 enumeration type. */
4208 {
4209 /* CAST_P will be set even in invalid code like "int(2.7 +
4210 ...)". Therefore, we have to check that the next token
4211 is sure to end the cast. */
4213 {
4218 enumerator-definition. */
4220 /* The curly brace at the end of an enum-specifier. */
4222 /* The end of a statement. */
4224 /* The end of the cast-expression. */
4226 /* The end of an array bound. */
4228 /* The closing ">" in a template-argument-list. */
4231 /* C++0x only: A ">>" treated like two ">" tokens,
4232 in a template-argument-list. */
4237 }
4239 /* If we are within a cast, then the constraint that the
4240 cast is to an integral or enumeration type will be
4241 checked at that point. If we are not within a cast, then
4242 this code is invalid. */
4245 }
4264 /* ??? Should wide strings be allowed when parser->translate_strings_p
4265 is false (i.e. in attributes)? If not, we can kill the third
4266 argument to cp_parser_string_literal. */
4272 {
4273 tree expr;
4276 /* Consume the `('. */
4278 /* Within a parenthesized expression, a `>' token is always
4279 the greater-than operator. */
4280 saved_greater_than_is_operator_p
4283 /* If we see `( { ' then we are looking at the beginning of
4284 a GNU statement-expression. */
4287 {
4288 /* Statement-expressions are not allowed by the standard. */
4292 /* And they're not allowed outside of a function-body; you
4293 cannot, for example, write:
4295 int i = ({ int j = 3; j + 1; });
4297 at class or namespace scope. */
4300 {
4302 "statement-expressions are not allowed outside "
4306 }
4307 else
4308 {
4309 /* Start the statement-expression. */
4311 /* Parse the compound-statement. */
4313 /* Finish up. */
4315 }
4316 }
4317 else
4318 {
4319 /* Parse the parenthesized expression. */
4321 /* Let the front end know that this expression was
4322 enclosed in parentheses. This matters in case, for
4323 example, the expression is of the form `A::B', since
4324 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4325 not. */
4327 /* DR 705: Wrapping an unqualified name in parentheses
4328 suppresses arg-dependent lookup. We want to pass back
4329 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4330 (c++/37862), but none of the others. */
4333 }
4334 /* The `>' token might be the end of a template-id or
4335 template-parameter-list now. */
4336 parser->greater_than_is_operator_p
4338 /* Consume the `)'. */
4343 }
4347 /* We have an Objective-C++ message. */
4349 {
4351 /* Don't warn about a failed tentative parse. */
4356 }
4360 /* We have an Objective-C++ string literal. */
4367 {
4368 /* These two are the boolean literals. */
4376 /* The `__null' literal. */
4381 /* The `nullptr' literal. */
4386 /* Recognize the `this' keyword. */
4390 {
4394 }
4395 /* Pointers cannot appear in constant-expressions. */
4400 /* The `operator' keyword can be the beginning of an
4401 id-expression. */
4408 {
4409 non_integral_constant name;
4411 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4412 __func__ are the names of variables -- but they are
4413 treated specially. Therefore, they are handled here,
4414 rather than relying on the generic id-expression logic
4415 below. Grammatically, these names are id-expressions.
4417 Consume the token. */
4421 {
4433 }
4438 /* Look up the name. */
4440 }
4443 {
4444 tree expression;
4445 tree type;
4446 source_location type_location;
4448 /* The `__builtin_va_arg' construct is used to handle
4449 `va_arg'. Consume the `__builtin_va_arg' token. */
4451 /* Look for the opening `('. */
4453 /* Now, parse the assignment-expression. */
4455 /* Look for the `,'. */
4458 /* Parse the type-id. */
4460 /* Look for the closing `)'. */
4462 /* Using `va_arg' in a constant-expression is not
4463 allowed. */
4465 NIC_VA_ARG))
4468 }
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 cast_p);
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
7164 parser->greater_than_is_operator_p
7167 parser->integral_constant_expression_p
7169 parser->non_integral_constant_expression_p
7176 }
7180 }
7181 }
7183 /* Look for the `:: new' and `:: delete', which also signal the
7184 beginning of a new-expression, or delete-expression,
7185 respectively. If the next token is `::', then it might be one of
7186 these. */
7188 {
7191 /* See if the token after the `::' is one of the keywords in
7192 which we're interested. */
7194 /* If it's `new', we have a new-expression. */
7197 /* Similarly, for `delete'. */
7200 }
7202 /* Look for a unary operator. */
7204 /* The `++' and `--' operators can be handled similarly, even though
7205 they are not technically unary-operators in the grammar. */
7207 {
7212 /* Handle the GNU address-of-label extension. */
7215 {
7216 tree identifier;
7217 tree expression;
7220 /* Consume the '&&' token. */
7222 /* Look for the identifier. */
7224 /* Create an expression representing the address. */
7227 NIC_ADDR_LABEL))
7230 }
7231 }
7233 {
7234 tree cast_expression;
7240 /* Consume the operator token. */
7242 /* Parse the cast-expression. */
7243 cast_expression
7248 pidk);
7249 /* Now, build an appropriate representation. */
7251 {
7255 RO_UNARY_STAR,
7256 complain);
7261 /* Fall through. */
7264 cast_expression,
7265 complain);
7272 /* Fall through. */
7282 }
7286 non_constant_p))
7290 }
7294 decltype_p,
7295 pidk);
7296 }
7301 {
7304 }
7306 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7307 unary-operator, the corresponding tree code is returned. */
7309 static enum tree_code
7311 {
7313 {
7334 }
7335 }
7337 /* Parse a new-expression.
7339 new-expression:
7340 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7341 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7343 Returns a representation of the expression. */
7345 static tree
7347 {
7350 tree type;
7353 tree ret;
7355 /* Look for the optional `::' operator. */
7356 global_scope_p
7360 /* Look for the `new' operator. */
7362 /* There's no easy way to tell a new-placement from the
7363 `( type-id )' construct. */
7365 /* Look for a new-placement. */
7367 /* If that didn't work out, there's no new-placement. */
7369 {
7373 }
7375 /* If the next token is a `(', then we have a parenthesized
7376 type-id. */
7378 {
7382 /* Consume the `('. */
7385 /* Parse the type-id. */
7386 parser->type_definition_forbidden_message
7391 /* Look for the closing `)'. */
7394 /* There should not be a direct-new-declarator in this production,
7395 but GCC used to allowed this, so we check and emit a sensible error
7396 message for this case. */
7398 {
7404 }
7405 }
7406 /* Otherwise, there must be a new-type-id. */
7407 else
7410 /* If the next token is a `(' or '{', then we have a new-initializer. */
7414 else
7417 /* A new-expression may not appear in an integral constant
7418 expression. */
7421 else
7422 {
7423 /* Create a representation of the new-expression. */
7425 tf_warning_or_error);
7426 }
7434 }
7436 /* Parse a new-placement.
7438 new-placement:
7439 ( expression-list )
7441 Returns the same representation as for an expression-list. */
7445 {
7448 /* Parse the expression-list. */
7449 expression_list = (cp_parser_parenthesized_expression_list
7455 }
7457 /* Parse a new-type-id.
7459 new-type-id:
7460 type-specifier-seq new-declarator [opt]
7462 Returns the TYPE allocated. If the new-type-id indicates an array
7463 type, *NELTS is set to the number of elements in the last array
7464 bound; the TYPE will not include the last array bound. */
7466 static tree
7468 {
7469 cp_decl_specifier_seq type_specifier_seq;
7475 /* The type-specifier sequence must not contain type definitions.
7476 (It cannot contain declarations of new types either, but if they
7477 are not definitions we will catch that because they are not
7478 complete.) */
7480 parser->type_definition_forbidden_message
7482 /* Parse the type-specifier-seq. */
7486 /* Restore the old message. */
7492 /* Parse the new-declarator. */
7495 /* Determine the number of elements in the last array dimension, if
7496 any. */
7498 /* Skip down to the last array dimension. */
7503 {
7506 }
7511 {
7514 }
7517 {
7524 else
7526 }
7529 }
7531 /* Parse an (optional) new-declarator.
7533 new-declarator:
7534 ptr-operator new-declarator [opt]
7535 direct-new-declarator
7537 Returns the declarator. */
7541 {
7544 cp_cv_quals cv_quals;
7546 /* We don't know if there's a ptr-operator next, or not. */
7548 /* Look for a ptr-operator. */
7550 /* If that worked, look for more new-declarators. */
7552 {
7555 /* Parse another optional declarator. */
7558 declarator = cp_parser_make_indirect_declarator
7562 }
7564 /* If the next token is a `[', there is a direct-new-declarator. */
7569 }
7571 /* Parse a direct-new-declarator.
7573 direct-new-declarator:
7574 [ expression ]
7575 direct-new-declarator [constant-expression]
7577 */
7581 {
7585 {
7586 tree expression;
7589 /* Look for the opening `['. */
7594 /* The standard requires that the expression have integral
7595 type. DR 74 adds enumeration types. We believe that the
7596 real intent is that these expressions be handled like the
7597 expression in a `switch' condition, which also allows
7598 classes with a single conversion to integral or
7599 enumeration type. */
7601 {
7602 expression
7604 expression,
7607 {
7609 "expression in new-declarator must have integral "
7612 }
7613 }
7615 /* Look for the closing `]'. */
7618 /* Add this bound to the declarator. */
7621 /* If the next token is not a `[', then there are no more
7622 bounds. */
7625 }
7628 }
7630 /* Parse a new-initializer.
7632 new-initializer:
7633 ( expression-list [opt] )
7634 braced-init-list
7636 Returns a representation of the expression-list. */
7640 {
7644 {
7645 tree t;
7652 }
7653 else
7654 expression_list = (cp_parser_parenthesized_expression_list
7660 }
7662 /* Parse a delete-expression.
7664 delete-expression:
7665 :: [opt] delete cast-expression
7666 :: [opt] delete [ ] cast-expression
7668 Returns a representation of the expression. */
7670 static tree
7672 {
7675 tree expression;
7677 /* Look for the optional `::' operator. */
7678 global_scope_p
7682 /* Look for the `delete' keyword. */
7684 /* See if the array syntax is in use. */
7686 {
7687 /* Consume the `[' token. */
7689 /* Look for the `]' token. */
7691 /* Remember that this is the `[]' construct. */
7693 }
7694 else
7697 /* Parse the cast-expression. */
7700 /* A delete-expression may not appear in an integral constant
7701 expression. */
7706 tf_warning_or_error);
7707 }
7709 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7710 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7711 0 otherwise. */
7713 static int
7715 {
7718 {
7760 /* In ((type ()) () the last () isn't a valid cast-expression,
7761 so the whole must be parsed as postfix-expression. */
7766 /* '[' may start a primary-expression in obj-c++ and in C++11,
7767 as a lambda-expression, eg, '(void)[]{}'. */
7774 /* '++' and '--' may or may not start a cast-expression:
7776 struct T { void operator++(int); };
7777 void f() { (T())++; }
7779 vs
7781 int a;
7782 (int)++a; */
7787 }
7788 }
7790 /* Parse a cast-expression.
7792 cast-expression:
7793 unary-expression
7794 ( type-id ) cast-expression
7796 ADDRESS_P is true iff the unary-expression is appearing as the
7797 operand of the `&' operator. CAST_P is true if this expression is
7798 the target of a cast.
7800 Returns a representation of the expression. */
7802 static tree
7805 {
7806 /* If it's a `(', then we might be looking at a cast. */
7808 {
7814 /* There's no way to know yet whether or not this is a cast.
7815 For example, `(int (3))' is a unary-expression, while `(int)
7816 3' is a cast. So, we resort to parsing tentatively. */
7818 /* Types may not be defined in a cast. */
7820 parser->type_definition_forbidden_message
7822 /* Consume the `('. */
7824 /* A very tricky bit is that `(struct S) { 3 }' is a
7825 compound-literal (which we permit in C++ as an extension).
7826 But, that construct is not a cast-expression -- it is a
7827 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7828 is legal; if the compound-literal were a cast-expression,
7829 you'd need an extra set of parentheses.) But, if we parse
7830 the type-id, and it happens to be a class-specifier, then we
7831 will commit to the parse at that point, because we cannot
7832 undo the action that is done when creating a new class. So,
7833 then we cannot back up and do a postfix-expression.
7835 Another tricky case is the following (c++/29234):
7837 struct S { void operator () (); };
7839 void foo ()
7840 {
7841 ( S()() );
7842 }
7844 As a type-id we parse the parenthesized S()() as a function
7845 returning a function, groktypename complains and we cannot
7846 back up in this case either.
7848 Therefore, we scan ahead to the closing `)', and check to see
7849 if the tokens after the `)' can start a cast-expression. Otherwise
7850 we are dealing with an unary-expression, a postfix-expression
7851 or something else.
7853 Yet another tricky case, in C++11, is the following (c++/54891):
7855 (void)[]{};
7857 The issue is that usually, besides the case of lambda-expressions,
7858 the parenthesized type-id cannot be followed by '[', and, eg, we
7859 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7860 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7861 we don't commit, we try a cast-expression, then an unary-expression.
7863 Save tokens so that we can put them back. */
7866 /* We may be looking at a cast-expression. */
7869 cast_expression
7872 /* Roll back the tokens we skipped. */
7874 /* If we aren't looking at a cast-expression, simulate an error so
7875 that the call to cp_parser_error_occurred below returns true. */
7878 else
7879 {
7882 /* Look for the type-id. */
7884 /* Look for the closing `)'. */
7887 }
7889 /* Restore the saved message. */
7892 /* At this point this can only be either a cast or a
7893 parenthesized ctor such as `(T ())' that looks like a cast to
7894 function returning T. */
7896 {
7897 /* Only commit if the cast-expression doesn't start with
7898 '++', '--', or '[' in C++11. */
7906 pidk);
7909 {
7910 /* Warn about old-style casts, if so requested. */
7917 /* Only type conversions to integral or enumeration types
7918 can be used in constant-expressions. */
7921 NIC_CAST))
7924 /* Perform the cast. */
7927 }
7928 }
7929 else
7931 }
7933 /* If we get here, then it's not a cast, so it must be a
7934 unary-expression. */
7937 }
7939 /* Parse a binary expression of the general form:
7941 pm-expression:
7942 cast-expression
7943 pm-expression .* cast-expression
7944 pm-expression ->* cast-expression
7946 multiplicative-expression:
7947 pm-expression
7948 multiplicative-expression * pm-expression
7949 multiplicative-expression / pm-expression
7950 multiplicative-expression % pm-expression
7952 additive-expression:
7953 multiplicative-expression
7954 additive-expression + multiplicative-expression
7955 additive-expression - multiplicative-expression
7957 shift-expression:
7958 additive-expression
7959 shift-expression << additive-expression
7960 shift-expression >> additive-expression
7962 relational-expression:
7963 shift-expression
7964 relational-expression < shift-expression
7965 relational-expression > shift-expression
7966 relational-expression <= shift-expression
7967 relational-expression >= shift-expression
7969 GNU Extension:
7971 relational-expression:
7972 relational-expression <? shift-expression
7973 relational-expression >? shift-expression
7975 equality-expression:
7976 relational-expression
7977 equality-expression == relational-expression
7978 equality-expression != relational-expression
7980 and-expression:
7981 equality-expression
7982 and-expression & equality-expression
7984 exclusive-or-expression:
7985 and-expression
7986 exclusive-or-expression ^ and-expression
7988 inclusive-or-expression:
7989 exclusive-or-expression
7990 inclusive-or-expression | exclusive-or-expression
7992 logical-and-expression:
7993 inclusive-or-expression
7994 logical-and-expression && inclusive-or-expression
7996 logical-or-expression:
7997 logical-and-expression
7998 logical-or-expression || logical-and-expression
8000 All these are implemented with a single function like:
8002 binary-expression:
8003 simple-cast-expression
8004 binary-expression <token> binary-expression
8006 CAST_P is true if this expression is the target of a cast.
8008 The binops_by_token map is used to get the tree codes for each <token> type.
8009 binary-expressions are associated according to a precedence table. */
8011 #define TOKEN_PRECEDENCE(token) \
8012 (((token->type == CPP_GREATER \
8013 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8014 && !parser->greater_than_is_operator_p) \
8015 ? PREC_NOT_OPERATOR \
8016 : binops_by_token[token->type].prec)
8018 static tree
8024 {
8025 cp_parser_expression_stack stack;
8027 cp_parser_expression_stack_entry current;
8028 tree rhs;
8032 tree overload;
8034 /* Parse the first expression. */
8045 {
8046 /* Get an operator token. */
8052 {
8054 "%<>>%> operator is treated"
8058 }
8062 /* Popping an entry off the stack means we completed a subexpression:
8063 - either we found a token which is not an operator (`>' where it is not
8064 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8065 will happen repeatedly;
8066 - or, we found an operator which has lower priority. This is the case
8067 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8068 parsing `3 * 4'. */
8070 {
8073 else
8075 }
8077 get_rhs:
8081 /* We used the operator token. */
8084 /* For "false && x" or "true || x", x will never be executed;
8085 disable warnings while evaluating it. */
8091 /* Extract another operand. It may be the RHS of this expression
8092 or the LHS of a new, higher priority expression. */
8097 /* Get another operator token. Look up its precedence to avoid
8098 building a useless (immediately popped) stack entry for common
8099 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8103 {
8104 /* ... and prepare to parse the RHS of the new, higher priority
8105 expression. Since precedence levels on the stack are
8106 monotonically increasing, we do not have to care about
8107 stack overflows. */
8116 pop:
8118 /* If the stack is not empty, we have parsed into LHS the right side
8119 (`4' in the example above) of an expression we had suspended.
8120 We can use the information on the stack to recover the LHS (`3')
8121 from the stack together with the tree code (`MULT_EXPR'), and
8122 the precedence of the higher level subexpression
8123 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8124 which will be used to actually build the additive expression. */
8129 }
8131 /* Undo the disabling of warnings done above. */
8142 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8143 ERROR_MARK for everything that is not a binary expression.
8144 This makes warn_about_parentheses miss some warnings that
8145 involve unary operators. For unary expressions we should
8146 pass the correct tree_code unless the unary expression was
8147 surrounded by parentheses.
8148 */
8154 == tcc_comparison
8157 else
8166 /* If the binary operator required the use of an overloaded operator,
8167 then this expression cannot be an integral constant-expression.
8168 An overloaded operator can be used even if both operands are
8169 otherwise permissible in an integral constant-expression if at
8170 least one of the operands is of enumeration type. */
8174 NIC_OVERLOADED))
8176 }
8179 }
8181 static tree
8186 {
8189 }
8191 /* Parse the `? expression : assignment-expression' part of a
8192 conditional-expression. The LOGICAL_OR_EXPR is the
8193 logical-or-expression that started the conditional-expression.
8194 Returns a representation of the entire conditional-expression.
8196 This routine is used by cp_parser_assignment_expression.
8198 ? expression : assignment-expression
8200 GNU Extensions:
8202 ? : assignment-expression */
8204 static tree
8206 {
8207 tree expr;
8208 tree assignment_expr;
8212 /* Consume the `?' token. */
8217 {
8220 /* Implicit true clause. */
8224 }
8225 else
8226 {
8229 /* Parse the expression. */
8232 c_inhibit_evaluation_warnings +=
8236 }
8238 /* The next token should be a `:'. */
8240 /* Parse the assignment-expression. */
8244 /* Build the conditional-expression. */
8246 expr,
8247 assignment_expr,
8248 tf_warning_or_error);
8249 }
8251 /* Parse an assignment-expression.
8253 assignment-expression:
8254 conditional-expression
8255 logical-or-expression assignment-operator assignment_expression
8256 throw-expression
8258 CAST_P is true if this expression is the target of a cast.
8259 DECLTYPE_P is true if this expression is the operand of decltype.
8261 Returns a representation for the expression. */
8263 static tree
8266 {
8267 tree expr;
8269 /* If the next token is the `throw' keyword, then we're looking at
8270 a throw-expression. */
8273 /* Otherwise, it must be that we are looking at a
8274 logical-or-expression. */
8275 else
8276 {
8277 /* Parse the binary expressions (logical-or-expression). */
8279 decltype_p,
8281 /* If the next token is a `?' then we're actually looking at a
8282 conditional-expression. */
8285 else
8286 {
8289 /* If it's an assignment-operator, we're using the second
8290 production. */
8291 enum tree_code assignment_operator
8294 {
8296 location_t saved_input_location;
8298 /* Parse the right-hand side of the assignment. */
8304 /* An assignment may not appear in a
8305 constant-expression. */
8307 NIC_ASSIGNMENT))
8309 /* Build the assignment expression. Its default
8310 location is the location of the '=' token. */
8314 assignment_operator,
8315 rhs,
8318 }
8319 }
8320 }
8323 }
8325 /* Parse an (optional) assignment-operator.
8327 assignment-operator: one of
8328 = *= /= %= += -= >>= <<= &= ^= |=
8330 GNU Extension:
8332 assignment-operator: one of
8333 <?= >?=
8335 If the next token is an assignment operator, the corresponding tree
8336 code is returned, and the token is consumed. For example, for
8337 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8338 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8339 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8340 operator, ERROR_MARK is returned. */
8342 static enum tree_code
8344 {
8348 /* Peek at the next token. */
8352 {
8398 /* Nothing else is an assignment operator. */
8400 }
8402 /* If it was an assignment operator, consume it. */
8407 }
8409 /* Parse an expression.
8411 expression:
8412 assignment-expression
8413 expression , assignment-expression
8415 CAST_P is true if this expression is the target of a cast.
8416 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8417 except possibly parenthesized or on the RHS of a comma (N3276).
8419 Returns a representation of the expression. */
8421 static tree
8424 {
8429 {
8430 tree assignment_expression;
8432 /* Parse the next assignment-expression. */
8433 assignment_expression
8436 /* We don't create a temporary for a call that is the immediate operand
8437 of decltype or on the RHS of a comma. But when we see a comma, we
8438 need to create a temporary for a call on the LHS. */
8443 assignment_expression
8447 /* If this is the first assignment-expression, we can just
8448 save it away. */
8451 else
8453 assignment_expression,
8455 /* If the next token is not a comma, then we are done with the
8456 expression. */
8459 /* Consume the `,'. */
8462 /* A comma operator cannot appear in a constant-expression. */
8465 }
8468 }
8470 /* Parse a constant-expression.
8472 constant-expression:
8473 conditional-expression
8475 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8476 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8477 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8478 is false, NON_CONSTANT_P should be NULL. */
8480 static tree
8484 {
8488 tree expression;
8490 /* It might seem that we could simply parse the
8491 conditional-expression, and then check to see if it were
8492 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8493 one that the compiler can figure out is constant, possibly after
8494 doing some simplifications or optimizations. The standard has a
8495 precise definition of constant-expression, and we must honor
8496 that, even though it is somewhat more restrictive.
8498 For example:
8500 int i[(2, 3)];
8502 is not a legal declaration, because `(2, 3)' is not a
8503 constant-expression. The `,' operator is forbidden in a
8504 constant-expression. However, GCC's constant-folding machinery
8505 will fold this operation to an INTEGER_CST for `3'. */
8507 /* Save the old settings. */
8509 saved_allow_non_integral_constant_expression_p
8512 /* We are now parsing a constant-expression. */
8514 parser->allow_non_integral_constant_expression_p
8517 /* Although the grammar says "conditional-expression", we parse an
8518 "assignment-expression", which also permits "throw-expression"
8519 and the use of assignment operators. In the case that
8520 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8521 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8522 actually essential that we look for an assignment-expression.
8523 For example, cp_parser_initializer_clauses uses this function to
8524 determine whether a particular assignment-expression is in fact
8525 constant. */
8527 /* Restore the old settings. */
8528 parser->integral_constant_expression_p
8530 parser->allow_non_integral_constant_expression_p
8533 {
8534 /* Require an rvalue constant expression here; that's what our
8535 callers expect. Reference constant expressions are handled
8536 separately in e.g. cp_parser_template_argument. */
8541 }
8544 parser->non_integral_constant_expression_p
8548 }
8550 /* Parse __builtin_offsetof.
8552 offsetof-expression:
8553 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8555 offsetof-member-designator:
8556 id-expression
8557 | offsetof-member-designator "." id-expression
8558 | offsetof-member-designator "[" expression "]"
8559 | offsetof-member-designator "->" id-expression */
8561 static tree
8563 {
8566 cp_id_kind dummy;
8569 /* We're about to accept non-integral-constant things, but will
8570 definitely yield an integral constant expression. Save and
8571 restore these values around our local parsing. */
8575 /* Consume the "__builtin_offsetof" token. */
8577 /* Consume the opening `('. */
8579 /* Parse the type-id. */
8582 /* Look for the `,'. */
8586 /* Build the (type *)null that begins the traditional offsetof macro. */
8588 tf_warning_or_error);
8590 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8594 {
8597 {
8599 /* offsetof-member-designator "[" expression "]" */
8605 /* offsetof-member-designator "->" identifier */
8608 /* FALLTHRU */
8611 /* offsetof-member-designator "." identifier */
8619 /* Consume the ")" token. */
8624 /* Error. We know the following require will fail, but
8625 that gives the proper error message. */
8630 }
8631 }
8633 success:
8634 /* If we're processing a template, we can't finish the semantics yet.
8635 Otherwise we can fold the entire expression now. */
8637 {
8640 }
8641 else
8644 failure:
8649 }
8651 /* Parse a trait expression.
8653 Returns a representation of the expression, the underlying type
8654 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8656 static tree
8658 {
8659 cp_trait_kind kind;
8665 {
8749 }
8751 /* Consume the token. */
8762 {
8769 }
8771 {
8773 {
8777 {
8780 }
8784 }
8785 }
8789 /* Complete the trait expression, which may mean either processing
8790 the trait expr now or saving it for template instantiation. */
8792 {
8801 }
8802 }
8804 /* Lambdas that appear in variable initializer or default argument scope
8805 get that in their mangling, so we need to record it. We might as well
8806 use the count for function and namespace scopes as well. */
8810 {
8811 tree t;
8816 static void
8818 {
8819 tree_int ti;
8821 /* Once we're inside a function, we ignore other scopes and just push
8822 the function again so that popping works properly. */
8829 {
8830 /* Don't reset the count if we're still in the same function. */
8833 }
8834 }
8836 static void
8838 {
8841 }
8843 static void
8845 {
8848 {
8851 }
8853 }
8855 /* Parse a lambda expression.
8857 lambda-expression:
8858 lambda-introducer lambda-declarator [opt] compound-statement
8860 Returns a representation of the expression. */
8862 static tree
8864 {
8866 tree type;
8873 {
8875 {
8879 }
8881 }
8883 /* We may be in the middle of deferred access check. Disable
8884 it now. */
8895 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8898 /* Now that we've started the type, add the capture fields for any
8899 explicit captures. */
8902 {
8903 /* Inside the class, surrounding template-parameter-lists do not apply. */
8904 unsigned int saved_num_template_parameter_lists
8908 bool fully_implicit_function_template_p
8912 bool auto_is_implicit_function_template_parm_p
8923 /* By virtue of defining a local class, a lambda expression has access to
8924 the private variables of enclosing classes. */
8931 {
8934 }
8936 /* The capture list was built up in reverse order; fix that now. */
8948 parser->fully_implicit_function_template_p
8952 parser->auto_is_implicit_function_template_parm_p
8954 }
8958 /* This field is only used during parsing of the lambda. */
8961 /* This lambda shouldn't have any proxies left at this point. */
8963 /* And now that we're done, push proxies for an enclosing lambda. */
8968 else
8970 }
8972 /* Parse the beginning of a lambda expression.
8974 lambda-introducer:
8975 [ lambda-capture [opt] ]
8977 LAMBDA_EXPR is the current representation of the lambda expression. */
8979 static void
8981 {
8982 /* Need commas after the first capture. */
8985 /* Eat the leading `['. */
8988 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8996 {
8999 }
9002 {
9004 tree capture_id;
9005 tree capture_init_expr;
9009 enum capture_kind_type
9010 {
9011 BY_COPY,
9012 BY_REFERENCE
9013 };
9017 {
9020 }
9024 else
9027 /* Possibly capture `this'. */
9029 {
9039 explicit_init_p);
9041 }
9043 /* Remember whether we want to capture as a reference or not. */
9045 {
9048 }
9050 /* Get the identifier. */
9055 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9056 delimiters, but I modified this to stop on unnested ']' as well. It
9057 was already changed to stop on unnested '}', so the
9058 "closing_parenthesis" name is no more misleading with my change. */
9059 {
9065 }
9067 /* Find the initializer for this capture. */
9071 {
9073 /* An explicit initializer exists. */
9076 "lambda capture initializers "
9082 {
9085 }
9086 }
9087 else
9088 {
9091 /* Turn the identifier into an id-expression. */
9092 capture_init_expr
9097 {
9100 }
9104 {
9107 capture_init_expr);
9110 }
9113 {
9116 capture_init_expr))
9119 }
9121 capture_init_expr
9122 = finish_id_expression
9124 capture_init_expr,
9138 {
9141 }
9142 else
9144 }
9148 {
9153 capture_id);
9157 "capture of %qD redundant with by-reference capture "
9159 }
9162 capture_id,
9163 capture_init_expr,
9165 explicit_init_p);
9166 }
9169 }
9171 /* Parse the (optional) middle of a lambda expression.
9173 lambda-declarator:
9174 < template-parameter-list [opt] >
9175 ( parameter-declaration-clause [opt] )
9176 attribute-specifier [opt]
9177 mutable [opt]
9178 exception-specification [opt]
9179 lambda-return-type-clause [opt]
9181 LAMBDA_EXPR is the current representation of the lambda expression. */
9183 static bool
9185 {
9186 /* 5.1.1.4 of the standard says:
9187 If a lambda-expression does not include a lambda-declarator, it is as if
9188 the lambda-declarator were ().
9189 This means an empty parameter list, no attributes, and no exception
9190 specification. */
9196 /* The template-parameter-list is optional, but must begin with
9197 an opening angle if present. */
9199 {
9202 "lambda templates are only available with "
9211 /* We just processed one more parameter list. */
9213 }
9215 /* The parameter-declaration-clause is optional (unless
9216 template-parameter-list was given), but must begin with an
9217 opening parenthesis if present. */
9219 {
9224 /* Parse parameters. */
9227 /* Default arguments shall not be specified in the
9228 parameter-declaration-clause of a lambda-declarator. */
9238 /* Parse optional `mutable' keyword. */
9240 {
9243 }
9245 /* Parse optional exception specification. */
9248 /* Parse optional trailing return type. */
9250 {
9254 }
9256 /* The function parameters must be in scope all the way until after the
9257 trailing-return-type in case of decltype. */
9259 }
9263 /* Create the function call operator.
9265 Messing with declarators like this is no uglier than building up the
9266 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9267 other code. */
9268 {
9269 cp_decl_specifier_seq return_type_specs;
9271 tree fco;
9278 else
9279 /* Maybe we will deduce the return type later. */
9285 sfk_none);
9290 VIRT_SPEC_UNSPECIFIED,
9291 REF_QUAL_NONE,
9292 exception_spec,
9297 declarator,
9298 attributes);
9300 {
9303 /* Give the object parameter a different name. */
9307 }
9309 {
9313 }
9322 }
9323 }
9325 /* Parse the body of a lambda expression, which is simply
9327 compound-statement
9329 but which requires special handling.
9330 LAMBDA_EXPR is the current representation of the lambda expression. */
9332 static void
9334 {
9339 else
9340 /* Still increment function_depth so that we don't GC in the
9341 middle of an expression. */
9343 /* Clear this in case we're in the middle of a default argument. */
9346 /* Finish the function call operator
9347 - class_specifier
9348 + late_parsing_for_member
9349 + function_definition_after_declarator
9350 + ctor_initializer_opt_and_function_body */
9351 {
9353 tree body;
9355 tree compound_stmt;
9356 tree cap;
9358 /* Let the front end know that we are going to be defining this
9359 function. */
9361 NULL_TREE,
9370 /* Push the proxies for any explicit captures. */
9377 /* 5.1.1.4 of the standard says:
9378 If a lambda-expression does not include a trailing-return-type, it
9379 is as if the trailing-return-type denotes the following type:
9380 * if the compound-statement is of the form
9381 { return attribute-specifier [opt] expression ; }
9382 the type of the returned expression after lvalue-to-rvalue
9383 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9384 (_conv.array_ 4.2), and function-to-pointer conversion
9385 (_conv.func_ 4.3);
9386 * otherwise, void. */
9388 /* In a lambda that has neither a lambda-return-type-clause
9389 nor a deducible form, errors should be reported for return statements
9390 in the body. Since we used void as the placeholder return type, parsing
9391 the body as usual will give such desired behavior. */
9395 {
9399 /* Parse tentatively in case there's more after the initial return
9400 statement. */
9411 {
9415 /* Will get error here if type not deduced yet. */
9419 }
9420 }
9423 {
9428 }
9432 out:
9436 /* Finish the function and generate code for it if necessary. */
9439 /* Only expand if the call op is not a template. */
9442 }
9447 else
9449 }
9451 /* Statements [gram.stmt.stmt] */
9453 /* Parse a statement.
9455 statement:
9456 labeled-statement
9457 expression-statement
9458 compound-statement
9459 selection-statement
9460 iteration-statement
9461 jump-statement
9462 declaration-statement
9463 try-block
9465 C++11:
9467 statement:
9468 labeled-statement
9469 attribute-specifier-seq (opt) expression-statement
9470 attribute-specifier-seq (opt) compound-statement
9471 attribute-specifier-seq (opt) selection-statement
9472 attribute-specifier-seq (opt) iteration-statement
9473 attribute-specifier-seq (opt) jump-statement
9474 declaration-statement
9475 attribute-specifier-seq (opt) try-block
9477 TM Extension:
9479 statement:
9480 atomic-statement
9482 IN_COMPOUND is true when the statement is nested inside a
9483 cp_parser_compound_statement; this matters for certain pragmas.
9485 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9486 is a (possibly labeled) if statement which is not enclosed in braces
9487 and has an else clause. This is used to implement -Wparentheses. */
9489 static void
9492 {
9497 restart:
9500 /* There is no statement yet. */
9506 /* In obj-c++, seeing '[[' might be the either the beginning of
9507 c++11 attributes, or a nested objc-message-expression. So
9508 let's parse the c++11 attributes tentatively. */
9512 {
9515 }
9517 /* Peek at the next token. */
9519 /* Remember the location of the first token in the statement. */
9521 /* If this is a keyword, then that will often determine what kind of
9522 statement we have. */
9524 {
9528 {
9531 /* Looks like a labeled-statement with a case label.
9532 Parse the label, and then use tail recursion to parse
9533 the statement. */
9550 {
9555 }
9556 else
9570 {
9575 }
9576 else
9577 {
9581 }
9585 /* Objective-C++ exception-handling constructs. */
9599 /* This must be a namespace alias definition. */
9612 /* It might be a keyword like `int' that can start a
9613 declaration-statement. */
9615 }
9616 }
9618 {
9619 /* If the next token is a `:', then we are looking at a
9620 labeled-statement. */
9623 {
9624 /* Looks like a labeled-statement with an ordinary label.
9625 Parse the label, and then use tail recursion to parse
9626 the statement. */
9630 }
9631 }
9632 /* Anything that starts with a `{' must be a compound-statement. */
9635 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9636 a statement all its own. */
9638 {
9639 /* Only certain OpenMP pragmas are attached to statements, and thus
9640 are considered statements themselves. All others are not. In
9641 the context of a compound, accept the pragma as a "statement" and
9642 return so that we can check for a close brace. Otherwise we
9643 require a real statement and must go back and read one. */
9649 }
9651 {
9654 }
9656 /* Everything else must be a declaration-statement or an
9657 expression-statement. Try for the declaration-statement
9658 first, unless we are looking at a `;', in which case we know that
9659 we have an expression-statement. */
9661 {
9663 {
9665 {
9666 /* Attributes should be parsed as part of the the
9667 declaration, so let's un-parse them. */
9670 }
9673 /* Try to parse the declaration-statement. */
9675 /* If that worked, we're done. */
9678 }
9679 /* Look for an expression-statement instead. */
9681 }
9683 /* Set the line number for the statement. */
9687 /* Note that for now, we don't do anything with c++11 statements
9688 parsed at this level. */
9691 OPT_Wattributes,
9693 }
9695 /* Parse the label for a labeled-statement, i.e.
9697 identifier :
9698 case constant-expression :
9699 default :
9701 GNU Extension:
9702 case constant-expression ... constant-expression : statement
9704 When a label is parsed without errors, the label is added to the
9705 parse tree by the finish_* functions, so this function doesn't
9706 have to return the label. */
9708 static void
9710 {
9715 /* The next token should be an identifier. */
9719 {
9722 }
9726 {
9728 {
9732 /* Consume the `case' token. */
9734 /* Parse the constant-expression. */
9739 {
9740 /* Consume the `...' token. */
9742 expr_hi =
9745 /* We don't need to emit warnings here, as the common code
9746 will do this for us. */
9747 }
9748 else
9753 else
9756 expr);
9757 }
9761 /* Consume the `default' token. */
9766 else
9771 /* Anything else must be an ordinary label. */
9774 }
9776 /* Require the `:' token. */
9779 /* An ordinary label may optionally be followed by attributes.
9780 However, this is only permitted if the attributes are then
9781 followed by a semicolon. This is because, for backward
9782 compatibility, when parsing
9783 lab: __attribute__ ((unused)) int i;
9784 we want the attribute to attach to "i", not "lab". */
9787 {
9788 tree attrs;
9795 ;
9796 else
9798 }
9804 }
9806 /* Parse an expression-statement.
9808 expression-statement:
9809 expression [opt] ;
9811 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9812 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9813 indicates whether this expression-statement is part of an
9814 expression statement. */
9816 static tree
9818 {
9822 /* If the next token is a ';', then there is no expression
9823 statement. */
9825 {
9829 {
9832 }
9833 }
9835 /* Give a helpful message for "A<T>::type t;" and the like. */
9838 {
9845 {
9846 /* A::A a; */
9851 }
9852 }
9854 /* Consume the final `;'. */
9859 /* This is the final expression statement of a statement
9860 expression. */
9866 }
9868 /* Parse a compound-statement.
9870 compound-statement:
9871 { statement-seq [opt] }
9873 GNU extension:
9875 compound-statement:
9876 { label-declaration-seq [opt] statement-seq [opt] }
9878 label-declaration-seq:
9879 label-declaration
9880 label-declaration-seq label-declaration
9882 Returns a tree representing the statement. */
9884 static tree
9887 {
9888 tree compound_stmt;
9890 /* Consume the `{'. */
9897 /* Begin the compound-statement. */
9899 /* If the next keyword is `__label__' we have a label declaration. */
9902 /* Parse an (optional) statement-seq. */
9904 /* Finish the compound-statement. */
9906 /* Consume the `}'. */
9910 }
9912 /* Parse an (optional) statement-seq.
9914 statement-seq:
9915 statement
9916 statement-seq [opt] statement */
9918 static void
9920 {
9921 /* Scan statements until there aren't any more. */
9923 {
9926 /* If we are looking at a `}', then we have run out of
9927 statements; the same is true if we have reached the end
9928 of file, or have stumbled upon a stray '@end'. */
9935 /* If we are in a compound statement and find 'else' then
9936 something went wrong. */
9938 {
9941 else
9942 {
9945 }
9946 }
9948 /* Parse the statement. */
9950 }
9951 }
9953 /* Parse a selection-statement.
9955 selection-statement:
9956 if ( condition ) statement
9957 if ( condition ) statement else statement
9958 switch ( condition ) statement
9960 Returns the new IF_STMT or SWITCH_STMT.
9962 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9963 is a (possibly labeled) if statement which is not enclosed in
9964 braces and has an else clause. This is used to implement
9965 -Wparentheses. */
9967 static tree
9969 {
9976 /* Peek at the next token. */
9979 /* See what kind of keyword it is. */
9982 {
9985 {
9986 tree statement;
9987 tree condition;
9989 /* Look for the `('. */
9991 {
9994 }
9996 /* Begin the selection-statement. */
9999 else
10002 /* Parse the condition. */
10004 /* Look for the `)'. */
10010 {
10014 /* Add the condition. */
10017 /* Parse the then-clause. */
10021 {
10029 }
10030 else
10036 /* If the next token is `else', parse the else-clause. */
10038 RID_ELSE))
10039 {
10040 /* Consume the `else' keyword. */
10043 /* Parse the else-clause. */
10045 {
10046 location_t loc;
10053 }
10054 else
10059 /* If we are currently parsing a then-clause, then
10060 IF_P will not be NULL. We set it to true to
10061 indicate that this if statement has an else clause.
10062 This may trigger the Wparentheses warning below
10063 when we get back up to the parent if statement. */
10066 }
10067 else
10068 {
10069 /* This if statement does not have an else clause. If
10070 NESTED_IF is true, then the then-clause is an if
10071 statement which does have an else clause. We warn
10072 about the potential ambiguity. */
10075 "suggest explicit braces to avoid ambiguous"
10077 }
10079 /* Now we're all done with the if-statement. */
10081 }
10082 else
10083 {
10087 /* Add the condition. */
10090 /* Parse the body of the switch-statement. */
10099 /* Now we're all done with the switch-statement. */
10101 }
10104 }
10110 }
10111 }
10113 /* Parse a condition.
10115 condition:
10116 expression
10117 type-specifier-seq declarator = initializer-clause
10118 type-specifier-seq declarator braced-init-list
10120 GNU Extension:
10122 condition:
10123 type-specifier-seq declarator asm-specification [opt]
10124 attributes [opt] = assignment-expression
10126 Returns the expression that should be tested. */
10128 static tree
10130 {
10131 cp_decl_specifier_seq type_specifiers;
10135 /* Try the declaration first. */
10137 /* New types are not allowed in the type-specifier-seq for a
10138 condition. */
10140 parser->type_definition_forbidden_message
10142 /* Parse the type-specifier-seq. */
10144 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10147 /* Restore the saved message. */
10149 /* If all is well, we might be looking at a declaration. */
10151 {
10152 tree decl;
10153 tree asm_specification;
10154 tree attributes;
10158 /* Parse the declarator. */
10164 /* Parse the attributes. */
10166 /* Parse the asm-specification. */
10168 /* If the next token is not an `=' or '{', then we might still be
10169 looking at an expression. For example:
10171 if (A(a).x)
10173 looks like a decl-specifier-seq and a declarator -- but then
10174 there is no `=', so this is an expression. */
10179 /* If we did see an `=' or '{', then we are looking at a declaration
10180 for sure. */
10182 {
10183 tree pushed_scope;
10187 /* Create the declaration. */
10193 /* Parse the initializer. */
10195 {
10199 }
10200 else
10201 {
10202 /* Consume the `='. */
10205 }
10209 /* Process the initializer. */
10212 asm_specification,
10213 flags);
10219 }
10220 }
10221 /* If we didn't even get past the declarator successfully, we are
10222 definitely not looking at a declaration. */
10223 else
10226 /* Otherwise, we are looking at an expression. */
10228 }
10230 /* Parses a for-statement or range-for-statement until the closing ')',
10231 not included. */
10233 static tree
10235 {
10239 /* Begin the for-statement. */
10242 /* Parse the initialization. */
10247 else
10249 }
10251 static tree
10253 {
10254 /* Normal for loop */
10257 tree stmt;
10260 /* The for-init-statement has already been parsed in
10261 cp_parser_for_init_statement, so no work is needed here. */
10264 /* If there's a condition, process it. */
10268 {
10272 }
10274 /* Look for the `;'. */
10277 /* If there's an expression, process it. */
10283 }
10285 /* Tries to parse a range-based for-statement:
10287 range-based-for:
10288 decl-specifier-seq declarator : expression
10290 The decl-specifier-seq declarator and the `:' are already parsed by
10291 cp_parser_for_init_statement. If processing_template_decl it returns a
10292 newly created RANGE_FOR_STMT; if not, it is converted to a
10293 regular FOR_STMT. */
10295 static tree
10298 {
10302 {
10305 }
10306 else
10309 /* If in template, STMT is converted to a normal for-statement
10310 at instantiation. If not, it is done just ahead. */
10312 {
10320 /* do_auto_deduction doesn't mess with template init-lists. */
10323 }
10324 else
10325 {
10328 }
10330 }
10332 /* Subroutine of cp_convert_range_for: given the initializer expression,
10333 builds up the range temporary. */
10335 static tree
10337 {
10340 /* Find out the type deduced by the declaration
10341 `auto &&__range = range_expr'. */
10346 /* Create the __range variable. */
10353 }
10355 /* Used by cp_parser_range_for in template context: we aren't going to
10356 do a full conversion yet, but we still need to resolve auto in the
10357 type of the for-range-declaration if present. This is basically
10358 a shortcut version of cp_convert_range_for. */
10360 static void
10362 {
10365 {
10368 iter_type = (cp_parser_perform_range_for_lookup
10371 {
10373 iter_type);
10375 tf_warning_or_error);
10378 }
10379 }
10380 }
10382 /* Converts a range-based for-statement into a normal
10383 for-statement, as per the definition.
10385 for (RANGE_DECL : RANGE_EXPR)
10386 BLOCK
10388 should be equivalent to:
10390 {
10391 auto &&__range = RANGE_EXPR;
10392 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10393 __begin != __end;
10394 ++__begin)
10395 {
10396 RANGE_DECL = *__begin;
10397 BLOCK
10398 }
10399 }
10401 If RANGE_EXPR is an array:
10402 BEGIN_EXPR = __range
10403 END_EXPR = __range + ARRAY_SIZE(__range)
10404 Else if RANGE_EXPR has a member 'begin' or 'end':
10405 BEGIN_EXPR = __range.begin()
10406 END_EXPR = __range.end()
10407 Else:
10408 BEGIN_EXPR = begin(__range)
10409 END_EXPR = end(__range);
10411 If __range has a member 'begin' but not 'end', or vice versa, we must
10412 still use the second alternative (it will surely fail, however).
10413 When calling begin()/end() in the third alternative we must use
10414 argument dependent lookup, but always considering 'std' as an associated
10415 namespace. */
10417 tree
10420 {
10426 /* If an error happened previously do nothing or else a lot of
10427 unhelpful errors would be issued. */
10429 else
10430 {
10431 tree range_temp;
10435 /* Can't bind a reference to an array of runtime bound. */
10437 else
10438 {
10443 LOOKUP_ONLYCONVERTING);
10445 }
10448 }
10450 /* The new for initialization statement. */
10458 LOOKUP_ONLYCONVERTING);
10467 LOOKUP_ONLYCONVERTING);
10471 /* The new for condition. */
10478 /* The new increment expression. */
10481 tf_warning_or_error);
10484 /* The declaration is initialized with *__begin inside the loop body. */
10487 tf_warning_or_error),
10489 LOOKUP_ONLYCONVERTING);
10492 }
10494 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10495 We need to solve both at the same time because the method used
10496 depends on the existence of members begin or end.
10497 Returns the type deduced for the iterator expression. */
10499 static tree
10501 {
10503 {
10506 }
10509 {
10514 }
10516 {
10517 /* If RANGE is an array, we will use pointer arithmetic. */
10520 range,
10524 }
10525 else
10526 {
10527 /* If it is not an array, we must do a bit of magic. */
10537 tf_warning_or_error);
10540 tf_warning_or_error);
10543 {
10544 /* Use the member functions. */
10547 else
10553 else
10556 }
10557 else
10558 {
10559 /* Use global functions with ADL. */
10566 tf_warning_or_error);
10568 tf_warning_or_error);
10570 tf_warning_or_error);
10572 tf_warning_or_error);
10575 }
10577 /* Last common checks. */
10579 {
10580 /* If one of the expressions is an error do no more checks. */
10583 }
10586 /* Can happen, when, eg, in a template context, Koenig lookup
10587 can't resolve begin/end (c++/58503). */
10589 else
10590 {
10592 /* The unqualified type of the __begin and __end temporaries should
10593 be the same, as required by the multiple auto declaration. */
10599 }
10600 }
10601 }
10603 /* Helper function for cp_parser_perform_range_for_lookup.
10604 Builds a tree for RANGE.IDENTIFIER(). */
10606 static tree
10608 {
10621 tf_warning_or_error);
10624 }
10626 /* Parse an iteration-statement.
10628 iteration-statement:
10629 while ( condition ) statement
10630 do statement while ( expression ) ;
10631 for ( for-init-statement condition [opt] ; expression [opt] )
10632 statement
10634 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10636 static tree
10638 {
10641 tree statement;
10644 /* Peek at the next token. */
10649 /* Remember whether or not we are already within an iteration
10650 statement. */
10653 /* See what kind of keyword it is. */
10656 {
10658 {
10659 tree condition;
10661 /* Begin the while-statement. */
10663 /* Look for the `('. */
10665 /* Parse the condition. */
10668 /* Look for the `)'. */
10670 /* Parse the dependent statement. */
10674 /* We're done with the while-statement. */
10676 }
10680 {
10681 tree expression;
10683 /* Begin the do-statement. */
10685 /* Parse the body of the do-statement. */
10690 /* Look for the `while' keyword. */
10692 /* Look for the `('. */
10694 /* Parse the expression. */
10696 /* We're done with the do-statement. */
10698 /* Look for the `)'. */
10700 /* Look for the `;'. */
10702 }
10706 {
10707 /* Look for the `('. */
10712 /* Look for the `)'. */
10715 /* Parse the body of the for-statement. */
10720 /* We're done with the for-statement. */
10722 }
10729 }
10732 }
10734 /* Parse a for-init-statement or the declarator of a range-based-for.
10735 Returns true if a range-based-for declaration is seen.
10737 for-init-statement:
10738 expression-statement
10739 simple-declaration */
10741 static bool
10743 {
10744 /* If the next token is a `;', then we have an empty
10745 expression-statement. Grammatically, this is also a
10746 simple-declaration, but an invalid one, because it does not
10747 declare anything. Therefore, if we did not handle this case
10748 specially, we would issue an error message about an invalid
10749 declaration. */
10751 {
10757 {
10758 /* N3994 -- for (id : init) ... */
10761 "type-specifier only available with "
10769 }
10771 /* A colon is used in range-based for. */
10774 /* We're going to speculatively look for a declaration, falling back
10775 to an expression, if necessary. */
10777 /* Parse the declaration. */
10780 decl);
10783 {
10784 /* It is a range-for, consume the ':' */
10788 {
10790 "range-based %<for%> loops only available with "
10793 }
10794 }
10795 else
10796 /* The ';' is not consumed yet because we told
10797 cp_parser_simple_declaration not to. */
10802 /* If the tentative parse failed, then we shall need to look for an
10803 expression-statement. */
10804 }
10805 /* If we are here, it is an expression-statement. */
10808 }
10810 /* Parse a jump-statement.
10812 jump-statement:
10813 break ;
10814 continue ;
10815 return expression [opt] ;
10816 return braced-init-list ;
10817 goto identifier ;
10819 GNU extension:
10821 jump-statement:
10822 goto * expression ;
10824 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10826 static tree
10828 {
10834 /* Peek at the next token. */
10839 /* See what kind of keyword it is. */
10842 {
10846 {
10866 }
10872 {
10879 /* Fall through. */
10889 }
10894 {
10895 tree expr;
10899 {
10903 }
10906 else
10907 /* If the next token is a `;', then there is no
10908 expression. */
10910 /* Build the return-statement. */
10912 /* Look for the final `;'. */
10914 }
10922 /* Create the goto-statement. */
10924 {
10925 /* Issue a warning about this use of a GNU extension. */
10927 /* Consume the '*' token. */
10929 /* Parse the dependent expression. */
10931 }
10932 else
10934 /* Look for the final `;'. */
10941 }
10944 }
10946 /* Parse a declaration-statement.
10948 declaration-statement:
10949 block-declaration */
10951 static void
10953 {
10956 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10959 /* Parse the block-declaration. */
10962 /* Free any declarators allocated. */
10964 }
10966 /* Some dependent statements (like `if (cond) statement'), are
10967 implicitly in their own scope. In other words, if the statement is
10968 a single statement (as opposed to a compound-statement), it is
10969 none-the-less treated as if it were enclosed in braces. Any
10970 declarations appearing in the dependent statement are out of scope
10971 after control passes that point. This function parses a statement,
10972 but ensures that is in its own scope, even if it is not a
10973 compound-statement.
10975 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10976 is a (possibly labeled) if statement which is not enclosed in
10977 braces and has an else clause. This is used to implement
10978 -Wparentheses.
10980 Returns the new statement. */
10982 static tree
10984 {
10985 tree statement;
10990 /* Mark if () ; with a special NOP_EXPR. */
10992 {
10996 }
10997 /* if a compound is opened, we simply parse the statement directly. */
11000 /* If the token is not a `{', then we must take special action. */
11001 else
11002 {
11003 /* Create a compound-statement. */
11005 /* Parse the dependent-statement. */
11007 /* Finish the dummy compound-statement. */
11009 }
11011 /* Return the statement. */
11013 }
11015 /* For some dependent statements (like `while (cond) statement'), we
11016 have already created a scope. Therefore, even if the dependent
11017 statement is a compound-statement, we do not want to create another
11018 scope. */
11020 static void
11022 {
11023 /* If the token is a `{', then we must take special action. */
11026 else
11027 {
11028 /* Avoid calling cp_parser_compound_statement, so that we
11029 don't create a new scope. Do everything else by hand. */
11031 /* If the next keyword is `__label__' we have a label declaration. */
11034 /* Parse an (optional) statement-seq. */
11037 }
11038 }
11040 /* Declarations [gram.dcl.dcl] */
11042 /* Parse an optional declaration-sequence.
11044 declaration-seq:
11045 declaration
11046 declaration-seq declaration */
11048 static void
11050 {
11052 {
11063 {
11064 /* A declaration consisting of a single semicolon is
11065 invalid. Allow it unless we're being pedantic. */
11070 }
11072 /* If we're entering or exiting a region that's implicitly
11073 extern "C", modify the lang context appropriately. */
11075 {
11078 }
11080 {
11083 }
11086 {
11087 /* A top-level declaration can consist solely of a #pragma.
11088 A nested declaration cannot, so this is done here and not
11089 in cp_parser_declaration. (A #pragma at block scope is
11090 handled in cp_parser_statement.) */
11093 }
11095 /* Parse the declaration itself. */
11097 }
11098 }
11100 /* Parse a declaration.
11102 declaration:
11103 block-declaration
11104 function-definition
11105 template-declaration
11106 explicit-instantiation
11107 explicit-specialization
11108 linkage-specification
11109 namespace-definition
11111 GNU extension:
11113 declaration:
11114 __extension__ declaration */
11116 static void
11118 {
11119 cp_token token1;
11120 cp_token token2;
11125 /* Check for the `__extension__' keyword. */
11127 {
11128 /* Parse the qualified declaration. */
11130 /* Restore the PEDANTIC flag. */
11134 }
11136 /* Try to figure out what kind of declaration is present. */
11141 else
11142 {
11145 }
11147 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11150 /* If the next token is `extern' and the following token is a string
11151 literal, then we have a linkage specification. */
11155 /* If the next token is `template', then we have either a template
11156 declaration, an explicit instantiation, or an explicit
11157 specialization. */
11159 {
11160 /* `template <>' indicates a template specialization. */
11164 /* `template <' indicates a template declaration. */
11167 /* Anything else must be an explicit instantiation. */
11168 else
11170 }
11171 /* If the next token is `export', then we have a template
11172 declaration. */
11175 /* If the next token is `extern', 'static' or 'inline' and the one
11176 after that is `template', we have a GNU extended explicit
11177 instantiation directive. */
11184 /* If the next token is `namespace', check for a named or unnamed
11185 namespace definition. */
11191 /* An unnamed namespace definition. */
11195 /* An inline (associated) namespace definition. */
11199 /* Objective-C++ declaration/definition. */
11206 /* We must have either a block declaration or a function
11207 definition. */
11208 else
11209 /* Try to parse a block-declaration, or a function-definition. */
11212 /* Free any declarators allocated. */
11214 }
11216 /* Parse a block-declaration.
11218 block-declaration:
11219 simple-declaration
11220 asm-definition
11221 namespace-alias-definition
11222 using-declaration
11223 using-directive
11225 GNU Extension:
11227 block-declaration:
11228 __extension__ block-declaration
11230 C++0x Extension:
11232 block-declaration:
11233 static_assert-declaration
11235 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11236 part of a declaration-statement. */
11238 static void
11241 {
11245 /* Check for the `__extension__' keyword. */
11247 {
11248 /* Parse the qualified declaration. */
11250 /* Restore the PEDANTIC flag. */
11254 }
11256 /* Peek at the next token to figure out which kind of declaration is
11257 present. */
11260 /* If the next keyword is `asm', we have an asm-definition. */
11262 {
11266 }
11267 /* If the next keyword is `namespace', we have a
11268 namespace-alias-definition. */
11271 /* If the next keyword is `using', we have a
11272 using-declaration, a using-directive, or an alias-declaration. */
11274 {
11279 /* If the token after `using' is `namespace', then we have a
11280 using-directive. */
11284 /* If the second token after 'using' is '=', then we have an
11285 alias-declaration. */
11291 /* Otherwise, it's a using-declaration. */
11292 else
11295 }
11296 /* If the next keyword is `__label__' we have a misplaced label
11297 declaration. */
11299 {
11303 /* If the next token is now a `;', consume it. */
11306 }
11307 /* If the next token is `static_assert' we have a static assertion. */
11310 /* Anything else must be a simple-declaration. */
11311 else
11314 }
11316 /* Parse a simple-declaration.
11318 simple-declaration:
11319 decl-specifier-seq [opt] init-declarator-list [opt] ;
11321 init-declarator-list:
11322 init-declarator
11323 init-declarator-list , init-declarator
11325 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11326 function-definition as a simple-declaration.
11328 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11329 parsed declaration if it is an uninitialized single declarator not followed
11330 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11331 if present, will not be consumed. */
11333 static void
11337 {
11338 cp_decl_specifier_seq decl_specifiers;
11345 /* Defer access checks until we know what is being declared; the
11346 checks for names appearing in the decl-specifier-seq should be
11347 done as if we were in the scope of the thing being declared. */
11350 /* Parse the decl-specifier-seq. We have to keep track of whether
11351 or not the decl-specifier-seq declares a named class or
11352 enumeration type, since that is the only case in which the
11353 init-declarator-list is allowed to be empty.
11355 [dcl.dcl]
11357 In a simple-declaration, the optional init-declarator-list can be
11358 omitted only when declaring a class or enumeration, that is when
11359 the decl-specifier-seq contains either a class-specifier, an
11360 elaborated-type-specifier, or an enum-specifier. */
11362 CP_PARSER_FLAGS_OPTIONAL,
11365 /* We no longer need to defer access checks. */
11368 /* In a block scope, a valid declaration must always have a
11369 decl-specifier-seq. By not trying to parse declarators, we can
11370 resolve the declaration/expression ambiguity more quickly. */
11373 {
11376 }
11378 /* If the next two tokens are both identifiers, the code is
11379 erroneous. The usual cause of this situation is code like:
11381 T t;
11383 where "T" should name a type -- but does not. */
11386 {
11387 /* If parsing tentatively, we should commit; we really are
11388 looking at a declaration. */
11390 /* Give up. */
11392 }
11394 /* If we have seen at least one decl-specifier, and the next token
11395 is not a parenthesis, then we must be looking at a declaration.
11396 (After "int (" we might be looking at a functional cast.) */
11403 /* Keep going until we hit the `;' at the end of the simple
11404 declaration. */
11407 CPP_SEMICOLON))
11408 {
11411 tree decl;
11414 {
11415 /* If we are processing next declarator, coma is expected */
11421 }
11422 else
11425 /* Parse the init-declarator. */
11428 function_definition_allowed_p,
11430 declares_class_or_enum,
11432 maybe_range_for_decl);
11433 /* If an error occurred while parsing tentatively, exit quickly.
11434 (That usually happens when in the body of a function; each
11435 statement is treated as a declaration-statement until proven
11436 otherwise.) */
11439 /* Handle function definitions specially. */
11441 {
11442 /* If the next token is a `,', then we are probably
11443 processing something like:
11445 void f() {}, *p;
11447 which is erroneous. */
11449 {
11452 "mixing"
11454 }
11455 /* Otherwise, we're done with the list of declarators. */
11456 else
11457 {
11460 }
11461 }
11464 /* The next token should be either a `,' or a `;'. */
11466 /* If it's a `,', there are more declarators to come. */
11469 /* If it's a `;', we are done. */
11472 /* Anything else is an error. */
11473 else
11474 {
11475 /* If we have already issued an error message we don't need
11476 to issue another one. */
11480 /* Skip tokens until we reach the end of the statement. */
11482 /* If the next token is now a `;', consume it. */
11486 }
11487 /* After the first time around, a function-definition is not
11488 allowed -- even if it was OK at first. For example:
11490 int i, f() {}
11492 is not valid. */
11494 }
11496 /* Issue an error message if no declarators are present, and the
11497 decl-specifier-seq does not itself declare a class or
11498 enumeration: [dcl.dcl]/3. */
11500 {
11502 {
11506 /* Ensure an error is issued anyway when finish_decltype_type,
11507 called via cp_parser_decl_specifier_seq, returns a class or
11508 an enumeration (c++/51786). */
11511 }
11512 /* Perform any deferred access checks. */
11514 }
11516 /* Consume the `;'. */
11520 done:
11522 }
11524 /* Parse a decl-specifier-seq.
11526 decl-specifier-seq:
11527 decl-specifier-seq [opt] decl-specifier
11528 decl-specifier attribute-specifier-seq [opt] (C++11)
11530 decl-specifier:
11531 storage-class-specifier
11532 type-specifier
11533 function-specifier
11534 friend
11535 typedef
11537 GNU Extension:
11539 decl-specifier:
11540 attributes
11542 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11544 The parser flags FLAGS is used to control type-specifier parsing.
11546 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11547 flags:
11549 1: one of the decl-specifiers is an elaborated-type-specifier
11550 (i.e., a type declaration)
11551 2: one of the decl-specifiers is an enum-specifier or a
11552 class-specifier (i.e., a type definition)
11554 */
11556 static void
11558 cp_parser_flags flags,
11561 {
11565 cp_decl_spec ds;
11567 /* Clear DECL_SPECS. */
11570 /* Assume no class or enumeration type is declared. */
11573 /* Keep reading specifiers until there are no more to read. */
11575 {
11580 /* Peek at the next token. */
11583 /* Save the first token of the decl spec list for error
11584 reporting. */
11587 /* Handle attributes. */
11589 {
11590 /* Parse the attributes. */
11593 /* In a sequence of declaration specifiers, c++11 attributes
11594 appertain to the type that precede them. In that case
11595 [dcl.spec]/1 says:
11597 The attribute-specifier-seq affects the type only for
11598 the declaration it appears in, not other declarations
11599 involving the same type.
11601 But for now let's force the user to position the
11602 attribute either at the beginning of the declaration or
11603 after the declarator-id, which would clearly mean that it
11604 applies to the declarator. */
11606 {
11608 /* The c++11 attribute is at the beginning of the
11609 declaration. It appertains to the entity being
11611 else
11612 {
11614 {
11615 /* This is an attribute following a
11616 class-specifier. */
11621 }
11622 else
11623 {
11624 decl_specs->std_attributes
11626 attrs);
11629 }
11631 }
11632 }
11634 decl_specs->attributes
11636 attrs);
11640 }
11641 /* Assume we will find a decl-specifier keyword. */
11643 /* If the next token is an appropriate keyword, we can simply
11644 add it to the list. */
11646 {
11647 /* decl-specifier:
11648 friend
11649 constexpr */
11652 {
11655 }
11656 else
11657 {
11659 /* Consume the token. */
11661 }
11669 /* function-specifier:
11670 inline
11671 virtual
11672 explicit */
11679 /* decl-specifier:
11680 typedef */
11683 /* Consume the token. */
11685 /* A constructor declarator cannot appear in a typedef. */
11687 /* The "typedef" keyword can only occur in a declaration; we
11688 may as well commit at this point. */
11695 /* storage-class-specifier:
11696 auto
11697 register
11698 static
11699 extern
11700 mutable
11702 GNU Extension:
11703 thread */
11706 {
11707 /* Consume the token. */
11710 /* Complain about `auto' as a storage specifier, if
11711 we're complaining about C++0x compatibility. */
11715 /* Set the storage class anyway. */
11717 token);
11718 }
11719 else
11720 /* C++0x auto type-specifier. */
11728 /* Consume the token. */
11731 token);
11734 /* Consume the token. */
11740 /* We did not yet find a decl-specifier yet. */
11743 }
11753 /* Constructors are a special case. The `S' in `S()' is not a
11754 decl-specifier; it is the beginning of the declarator. */
11755 constructor_p
11756 = (!found_decl_spec
11757 && constructor_possible_p
11758 && (cp_parser_constructor_declarator_p
11761 /* If we don't have a DECL_SPEC yet, then we must be looking at
11762 a type-specifier. */
11764 {
11767 tree type_spec;
11769 type_spec
11771 decl_specs,
11777 /* If this type-specifier referenced a user-defined type
11778 (a typedef, class-name, etc.), then we can't allow any
11779 more such type-specifiers henceforth.
11781 [dcl.spec]
11783 The longest sequence of decl-specifiers that could
11784 possibly be a type name is taken as the
11785 decl-specifier-seq of a declaration. The sequence shall
11786 be self-consistent as described below.
11788 [dcl.type]
11790 As a general rule, at most one type-specifier is allowed
11791 in the complete decl-specifier-seq of a declaration. The
11792 only exceptions are the following:
11794 -- const or volatile can be combined with any other
11795 type-specifier.
11797 -- signed or unsigned can be combined with char, long,
11798 short, or int.
11800 -- ..
11802 Example:
11804 typedef char* Pc;
11805 void g (const int Pc);
11807 Here, Pc is *not* part of the decl-specifier seq; it's
11808 the declarator. Therefore, once we see a type-specifier
11809 (other than a cv-qualifier), we forbid any additional
11810 user-defined types. We *do* still allow things like `int
11811 int' to be considered a decl-specifier-seq, and issue the
11812 error message later. */
11815 /* A constructor declarator cannot follow a type-specifier. */
11817 {
11822 }
11823 }
11825 /* If we still do not have a DECL_SPEC, then there are no more
11826 decl-specifiers. */
11831 /* After we see one decl-specifier, further decl-specifiers are
11832 always optional. */
11834 }
11836 /* Don't allow a friend specifier with a class definition. */
11841 }
11843 /* Parse an (optional) storage-class-specifier.
11845 storage-class-specifier:
11846 auto
11847 register
11848 static
11849 extern
11850 mutable
11852 GNU Extension:
11854 storage-class-specifier:
11855 thread
11857 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11859 static tree
11861 {
11863 {
11867 /* Fall through for C++98. */
11874 /* Consume the token. */
11879 }
11880 }
11882 /* Parse an (optional) function-specifier.
11884 function-specifier:
11885 inline
11886 virtual
11887 explicit
11889 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11890 Updates DECL_SPECS, if it is non-NULL. */
11892 static tree
11895 {
11898 {
11904 /* 14.5.2.3 [temp.mem]
11906 A member function template shall not be virtual. */
11909 else
11919 }
11921 /* Consume the token. */
11923 }
11925 /* Parse a linkage-specification.
11927 linkage-specification:
11928 extern string-literal { declaration-seq [opt] }
11929 extern string-literal declaration */
11931 static void
11933 {
11934 tree linkage;
11936 /* Look for the `extern' keyword. */
11939 /* Look for the string-literal. */
11942 /* Transform the literal into an identifier. If the literal is a
11943 wide-character string, or contains embedded NULs, then we can't
11944 handle it as the user wants. */
11947 {
11949 /* Assume C++ linkage. */
11951 }
11952 else
11955 /* We're now using the new linkage. */
11958 /* If the next token is a `{', then we're using the first
11959 production. */
11961 {
11964 /* Consume the `{' token. */
11966 /* Parse the declarations. */
11968 /* Look for the closing `}'. */
11970 }
11971 /* Otherwise, there's just one declaration. */
11972 else
11973 {
11976 saved_in_unbraced_linkage_specification_p
11980 parser->in_unbraced_linkage_specification_p
11982 }
11984 /* We're done with the linkage-specification. */
11986 }
11988 /* Parse a static_assert-declaration.
11990 static_assert-declaration:
11991 static_assert ( constant-expression , string-literal ) ;
11993 If MEMBER_P, this static_assert is a class member. */
11995 static void
11997 {
11998 tree condition;
11999 tree message;
12001 location_t saved_loc;
12004 /* Peek at the `static_assert' token so we can keep track of exactly
12005 where the static assertion started. */
12009 /* Look for the `static_assert' keyword. */
12011 RT_STATIC_ASSERT))
12014 /* We know we are in a static assertion; commit to any tentative
12015 parse. */
12019 /* Parse the `(' starting the static assertion condition. */
12022 /* Parse the constant-expression. Allow a non-constant expression
12023 here in order to give better diagnostics in finish_static_assert. */
12024 condition =
12029 /* Parse the separating `,'. */
12032 /* Parse the string-literal message. */
12037 /* A `)' completes the static assertion. */
12044 /* A semicolon terminates the declaration. */
12047 /* Complete the static assertion, which may mean either processing
12048 the static assert now or saving it for template instantiation. */
12050 }
12052 /* Parse the expression in decltype ( expression ). */
12054 static tree
12057 {
12059 tree expr;
12061 /* First, try parsing an id-expression. */
12072 {
12075 cp_id_kind idk;
12079 /* Lookup the name we got back from the id-expression. */
12090 {
12091 /* Complete lookup of the id-expression. */
12092 expr = (finish_id_expression
12105 /* We found an id-expression, but it was something that we
12106 should not have found. This is an error, not something
12107 we can recover from, so note that we found an
12108 id-expression and we'll recover as gracefully as
12109 possible. */
12111 }
12116 /* We have an id-expression. */
12118 }
12121 {
12122 /* Abort the id-expression parse. */
12125 /* Parsing tentatively, again. */
12128 /* Parse a class member access. */
12136 /* We have an id-expression. */
12138 }
12141 /* We have parsed the complete id-expression or member access. */
12143 else
12144 {
12145 /* Abort our attempt to parse an id-expression or member access
12146 expression. */
12149 /* Parse a full expression. */
12152 }
12155 }
12157 /* Parse a `decltype' type. Returns the type.
12159 simple-type-specifier:
12160 decltype ( expression )
12161 C++14 proposal:
12162 decltype ( auto ) */
12164 static tree
12166 {
12167 tree expr;
12176 {
12177 /* Already parsed. */
12180 }
12182 /* Look for the `decltype' token. */
12186 /* Parse the opening `('. */
12190 /* decltype (auto) */
12193 {
12200 }
12202 /* Types cannot be defined in a `decltype' expression. Save away the
12203 old message. */
12206 /* And create the new one. */
12207 parser->type_definition_forbidden_message
12210 /* The restrictions on constant-expressions do not apply inside
12211 decltype expressions. */
12212 saved_integral_constant_expression_p
12214 saved_non_integral_constant_expression_p
12218 /* Within a parenthesized expression, a `>' token is always
12219 the greater-than operator. */
12220 saved_greater_than_is_operator_p
12224 /* Do not actually evaluate the expression. */
12227 /* Do not warn about problems with the expression. */
12232 /* Go back to evaluating expressions. */
12236 /* The `>' token might be the end of a template-id or
12237 template-parameter-list now. */
12238 parser->greater_than_is_operator_p
12241 /* Restore the old message and the integral constant expression
12242 flags. */
12244 parser->integral_constant_expression_p
12246 parser->non_integral_constant_expression_p
12249 /* Parse to the closing `)'. */
12251 {
12255 }
12258 tf_warning_or_error);
12260 rewrite:
12261 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12262 it again. */
12269 }
12271 /* Special member functions [gram.special] */
12273 /* Parse a conversion-function-id.
12275 conversion-function-id:
12276 operator conversion-type-id
12278 Returns an IDENTIFIER_NODE representing the operator. */
12280 static tree
12282 {
12283 tree type;
12284 tree saved_scope;
12285 tree saved_qualifying_scope;
12286 tree saved_object_scope;
12289 /* Look for the `operator' token. */
12292 /* When we parse the conversion-type-id, the current scope will be
12293 reset. However, we need that information in able to look up the
12294 conversion function later, so we save it here. */
12298 /* We must enter the scope of the class so that the names of
12299 entities declared within the class are available in the
12300 conversion-type-id. For example, consider:
12302 struct S {
12303 typedef int I;
12304 operator I();
12305 };
12307 S::operator I() { ... }
12309 In order to see that `I' is a type-name in the definition, we
12310 must be in the scope of `S'. */
12313 /* Parse the conversion-type-id. */
12315 /* Leave the scope of the class, if any. */
12318 /* Restore the saved scope. */
12322 /* If the TYPE is invalid, indicate failure. */
12326 }
12328 /* Parse a conversion-type-id:
12330 conversion-type-id:
12331 type-specifier-seq conversion-declarator [opt]
12333 Returns the TYPE specified. */
12335 static tree
12337 {
12338 tree attributes;
12339 cp_decl_specifier_seq type_specifiers;
12341 tree type_specified;
12344 /* Parse the attributes. */
12348 parser->type_definition_forbidden_message
12351 /* Parse the type-specifiers. */
12358 /* If that didn't work, stop. */
12361 /* Parse the conversion-declarator. */
12369 /* Don't give this error when parsing tentatively. This happens to
12370 work because we always parse this definitively once. */
12373 {
12375 {
12378 }
12382 }
12385 }
12387 /* Parse an (optional) conversion-declarator.
12389 conversion-declarator:
12390 ptr-operator conversion-declarator [opt]
12392 */
12396 {
12399 cp_cv_quals cv_quals;
12401 /* We don't know if there's a ptr-operator next, or not. */
12403 /* Try the ptr-operator. */
12406 /* If it worked, look for more conversion-declarators. */
12408 {
12411 /* Parse another optional declarator. */
12414 declarator = cp_parser_make_indirect_declarator
12418 }
12421 }
12423 /* Parse an (optional) ctor-initializer.
12425 ctor-initializer:
12426 : mem-initializer-list
12428 Returns TRUE iff the ctor-initializer was actually present. */
12430 static bool
12432 {
12433 /* If the next token is not a `:', then there is no
12434 ctor-initializer. */
12436 {
12437 /* Do default initialization of any bases and members. */
12442 }
12444 /* Consume the `:' token. */
12446 /* And the mem-initializer-list. */
12450 }
12452 /* Parse a mem-initializer-list.
12454 mem-initializer-list:
12455 mem-initializer ... [opt]
12456 mem-initializer ... [opt] , mem-initializer-list */
12458 static void
12460 {
12465 /* Let the semantic analysis code know that we are starting the
12466 mem-initializer-list. */
12471 /* Loop through the list. */
12473 {
12474 tree mem_initializer;
12477 /* Parse the mem-initializer. */
12479 /* If the next token is a `...', we're expanding member initializers. */
12481 {
12482 /* Consume the `...'. */
12485 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12486 can be expanded but members cannot. */
12489 {
12494 }
12496 /* Construct the pack expansion type. */
12499 }
12502 {
12506 }
12507 /* Look for a target constructor. */
12511 {
12514 {
12518 }
12520 }
12521 /* Add it to the list, unless it was erroneous. */
12523 {
12526 }
12527 /* If the next token is not a `,', we're done. */
12530 /* Consume the `,' token. */
12532 }
12534 /* Perform semantic analysis. */
12537 }
12539 /* Parse a mem-initializer.
12541 mem-initializer:
12542 mem-initializer-id ( expression-list [opt] )
12543 mem-initializer-id braced-init-list
12545 GNU extension:
12547 mem-initializer:
12548 ( expression-list [opt] )
12550 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12551 class) or FIELD_DECL (for a non-static data member) to initialize;
12552 the TREE_VALUE is the expression-list. An empty initialization
12553 list is represented by void_list_node. */
12555 static tree
12557 {
12558 tree mem_initializer_id;
12559 tree expression_list;
12560 tree member;
12563 /* Find out what is being initialized. */
12565 {
12569 }
12570 else
12571 {
12575 }
12581 {
12588 }
12589 else
12590 {
12600 }
12610 }
12612 /* Parse a mem-initializer-id.
12614 mem-initializer-id:
12615 :: [opt] nested-name-specifier [opt] class-name
12616 identifier
12618 Returns a TYPE indicating the class to be initializer for the first
12619 production. Returns an IDENTIFIER_NODE indicating the data member
12620 to be initialized for the second production. */
12622 static tree
12624 {
12628 tree id;
12632 /* `typename' is not allowed in this context ([temp.res]). */
12634 {
12636 "keyword %<typename%> not allowed in this context (a qualified "
12639 }
12640 /* Look for the optional `::' operator. */
12641 global_scope_p
12645 /* Look for the optional nested-name-specifier. The simplest way to
12646 implement:
12648 [temp.res]
12650 The keyword `typename' is not permitted in a base-specifier or
12651 mem-initializer; in these contexts a qualified name that
12652 depends on a template-parameter is implicitly assumed to be a
12653 type name.
12655 is to assume that we have seen the `typename' keyword at this
12656 point. */
12657 nested_name_specifier_p
12666 /* If there is a `::' operator or a nested-name-specifier, then we
12667 are definitely looking for a class-name. */
12672 typename_type,
12676 /* Otherwise, we could also be looking for an ordinary identifier. */
12678 /* Try a class-name. */
12682 none_type,
12686 /* If we found one, we're done. */
12689 /* Otherwise, look for an ordinary identifier. */
12691 }
12693 /* Overloading [gram.over] */
12695 /* Parse an operator-function-id.
12697 operator-function-id:
12698 operator operator
12700 Returns an IDENTIFIER_NODE for the operator which is a
12701 human-readable spelling of the identifier, e.g., `operator +'. */
12703 static tree
12705 {
12706 /* Look for the `operator' keyword. */
12709 /* And then the name of the operator itself. */
12711 }
12713 /* Return an identifier node for a user-defined literal operator.
12714 The suffix identifier is chained to the operator name identifier. */
12716 static tree
12718 {
12719 tree identifier;
12726 }
12728 /* Parse an operator.
12730 operator:
12731 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12732 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12733 || ++ -- , ->* -> () []
12735 GNU Extensions:
12737 operator:
12738 <? >? <?= >?=
12740 Returns an IDENTIFIER_NODE for the operator which is a
12741 human-readable spelling of the identifier, e.g., `operator +'. */
12743 static tree
12745 {
12750 /* Peek at the next token. */
12752 /* Figure out which operator we have. */
12754 {
12756 {
12759 /* The keyword should be either `new' or `delete'. */
12764 else
12767 /* Consume the `new' or `delete' token. */
12770 /* Peek at the next token. */
12772 /* If it's a `[' token then this is the array variant of the
12773 operator. */
12775 {
12776 /* Consume the `[' token. */
12778 /* Look for the `]' token. */
12782 }
12783 /* Otherwise, we have the non-array variant. */
12784 else
12788 }
12935 /* Consume the `('. */
12937 /* Look for the matching `)'. */
12942 /* Consume the `['. */
12944 /* Look for the matching `]'. */
12959 {
12966 /* Consume the string. */
12972 {
12975 }
12976 else
12977 {
12979 /* Look for the suffix identifier. */
12984 {
12988 }
12989 else
12990 {
12993 }
12994 }
12999 {
13002 }
13005 {
13008 }
13010 {
13013 }
13015 }
13018 /* Anything else is an error. */
13020 }
13022 /* If we have selected an identifier, we need to consume the
13023 operator token. */
13026 /* Otherwise, no valid operator name was present. */
13027 else
13028 {
13031 }
13034 }
13036 /* Parse a template-declaration.
13038 template-declaration:
13039 export [opt] template < template-parameter-list > declaration
13041 If MEMBER_P is TRUE, this template-declaration occurs within a
13042 class-specifier.
13044 The grammar rule given by the standard isn't correct. What
13045 is really meant is:
13047 template-declaration:
13048 export [opt] template-parameter-list-seq
13049 decl-specifier-seq [opt] init-declarator [opt] ;
13050 export [opt] template-parameter-list-seq
13051 function-definition
13053 template-parameter-list-seq:
13054 template-parameter-list-seq [opt]
13055 template < template-parameter-list > */
13057 static void
13059 {
13060 /* Check for `export'. */
13062 {
13063 /* Consume the `export' token. */
13065 /* Warn that we do not support `export'. */
13067 }
13070 }
13072 /* Parse a template-parameter-list.
13074 template-parameter-list:
13075 template-parameter
13076 template-parameter-list , template-parameter
13078 Returns a TREE_LIST. Each node represents a template parameter.
13079 The nodes are connected via their TREE_CHAINs. */
13081 static tree
13083 {
13088 /* The loop below parses the template parms. We first need to know
13089 the total number of template parms to be able to compute proper
13090 canonical types of each dependent type. So after the loop, when
13091 we know the total number of template parms,
13092 end_template_parm_list computes the proper canonical types and
13093 fixes up the dependent types accordingly. */
13095 {
13096 tree parameter;
13099 location_t parm_loc;
13101 /* Parse the template-parameter. */
13106 /* Add it to the list. */
13109 parm_loc,
13110 parameter,
13111 is_non_type,
13112 is_parameter_pack);
13113 else
13114 {
13117 }
13119 /* If the next token is not a `,', we're done. */
13122 /* Otherwise, consume the `,' token. */
13124 }
13127 }
13129 /* Parse a template-parameter.
13131 template-parameter:
13132 type-parameter
13133 parameter-declaration
13135 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13136 the parameter. The TREE_PURPOSE is the default value, if any.
13137 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13138 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13139 set to true iff this parameter is a parameter pack. */
13141 static tree
13144 {
13148 tree parm;
13150 /* Assume it is a type parameter or a template parameter. */
13152 /* Assume it not a parameter pack. */
13154 /* Peek at the next token. */
13156 /* If it is `class' or `template', we have a type-parameter. */
13159 /* If it is `class' or `typename' we do not know yet whether it is a
13160 type parameter or a non-type parameter. Consider:
13162 template <typename T, typename T::X X> ...
13164 or:
13166 template <class C, class D*> ...
13168 Here, the first parameter is a type parameter, and the second is
13169 a non-type parameter. We can tell by looking at the token after
13170 the identifier -- if it is a `,', `=', or `>' then we have a type
13171 parameter. */
13173 {
13174 /* Peek at the token after `class' or `typename'. */
13176 /* If it's an ellipsis, we have a template type parameter
13177 pack. */
13180 /* If it's an identifier, skip it. */
13183 /* Now, see if the token looks like the end of a template
13184 parameter. */
13189 }
13191 /* Otherwise, it is a non-type parameter.
13193 [temp.param]
13195 When parsing a default template-argument for a non-type
13196 template-parameter, the first non-nested `>' is taken as the end
13197 of the template parameter-list rather than a greater-than
13198 operator. */
13200 parameter_declarator
13207 /* If the parameter declaration is marked as a parameter pack, set
13208 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13209 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13210 grokdeclarator. */
13213 {
13216 }
13219 {
13220 /* Can happen in some cases of erroneous input (c++/34892). */
13222 /* Consume the `...' for better error recovery. */
13224 }
13225 /* If the next token is an ellipsis, and we don't already have it
13226 marked as a parameter pack, then we have a parameter pack (that
13227 has no declarator). */
13230 && (declarator_can_be_parameter_pack
13232 {
13233 /* Consume the `...'. */
13238 }
13239 /* We might end up with a pack expansion as the type of the non-type
13240 template parameter, in which case this is a non-type template
13241 parameter pack. */
13244 {
13248 }
13251 {
13252 /* Parameter packs cannot have default arguments. However, a
13253 user may try to do so, so we'll parse them and give an
13254 appropriate diagnostic here. */
13258 /* Find the name of the parameter pack. */
13267 else
13271 /* Parse the default argument, but throw away the result. */
13273 }
13283 }
13285 /* Parse a type-parameter.
13287 type-parameter:
13288 class identifier [opt]
13289 class identifier [opt] = type-id
13290 typename identifier [opt]
13291 typename identifier [opt] = type-id
13292 template < template-parameter-list > class identifier [opt]
13293 template < template-parameter-list > class identifier [opt]
13294 = id-expression
13296 GNU Extension (variadic templates):
13298 type-parameter:
13299 class ... identifier [opt]
13300 typename ... identifier [opt]
13302 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13303 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13304 the declaration of the parameter.
13306 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13308 static tree
13310 {
13312 tree parameter;
13314 /* Look for a keyword to tell us what kind of parameter this is. */
13320 {
13323 {
13324 tree identifier;
13325 tree default_argument;
13327 /* If the next token is an ellipsis, we have a template
13328 argument pack. */
13330 {
13331 /* Consume the `...' token. */
13336 }
13338 /* If the next token is an identifier, then it names the
13339 parameter. */
13342 else
13345 /* Create the parameter. */
13348 /* If the next token is an `=', we have a default argument. */
13350 {
13351 /* Consume the `=' token. */
13353 /* Parse the default-argument. */
13357 /* Template parameter packs cannot have default
13358 arguments. */
13360 {
13363 "template parameter pack %qD cannot have a "
13365 else
13367 "template parameter packs cannot have "
13370 }
13372 }
13373 else
13376 /* Create the combined representation of the parameter and the
13377 default argument. */
13379 }
13383 {
13384 tree identifier;
13385 tree default_argument;
13387 /* Look for the `<'. */
13389 /* Parse the template-parameter-list. */
13391 /* Look for the `>'. */
13393 /* Look for the `class' or 'typename' keywords. */
13395 /* If the next token is an ellipsis, we have a template
13396 argument pack. */
13398 {
13399 /* Consume the `...' token. */
13404 }
13405 /* If the next token is an `=', then there is a
13406 default-argument. If the next token is a `>', we are at
13407 the end of the parameter-list. If the next token is a `,',
13408 then we are at the end of this parameter. */
13412 {
13414 /* Treat invalid names as if the parameter were nameless. */
13417 }
13418 else
13421 /* Create the template parameter. */
13423 identifier);
13425 /* If the next token is an `=', then there is a
13426 default-argument. */
13428 {
13431 /* Consume the `='. */
13433 /* Parse the id-expression. */
13435 /* save token before parsing the id-expression, for error
13436 reporting */
13438 default_argument
13446 /* If the id-expression was a template-id that refers to
13447 a template-class, we already have the declaration here,
13448 so no further lookup is needed. */
13449 ;
13450 else
13451 /* Look up the name. */
13452 default_argument
13454 none_type,
13460 /* See if the default argument is valid. */
13461 default_argument
13464 /* Template parameter packs cannot have default
13465 arguments. */
13467 {
13470 "template parameter pack %qD cannot "
13472 identifier);
13473 else
13477 }
13479 }
13480 else
13483 /* Create the combined representation of the parameter and the
13484 default argument. */
13486 }
13492 }
13495 }
13497 /* Parse a template-id.
13499 template-id:
13500 template-name < template-argument-list [opt] >
13502 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13503 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13504 returned. Otherwise, if the template-name names a function, or set
13505 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13506 names a class, returns a TYPE_DECL for the specialization.
13508 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13509 uninstantiated templates. */
13511 static tree
13517 {
13519 tree templ;
13520 tree arguments;
13521 tree template_id;
13528 /* If the next token corresponds to a template-id, there is no need
13529 to reparse it. */
13532 {
13535 /* Get the stored value. */
13537 /* Perform any access checks that were deferred. */
13540 {
13545 tf_warning_or_error);
13546 }
13547 /* Return the stored value. */
13549 }
13551 /* Avoid performing name lookup if there is no possibility of
13552 finding a template-id. */
13555 && !cp_parser_nth_token_starts_template_argument_list_p
13557 {
13560 }
13562 /* Remember where the template-id starts. */
13568 /* Parse the template-name. */
13571 check_dependency_p,
13572 is_declaration,
13573 tag_type,
13576 {
13579 }
13581 /* If we find the sequence `[:' after a template-name, it's probably
13582 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13583 parse correctly the argument list. */
13590 {
13592 /* Change `:' into `::'. */
13594 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13595 CPP_LESS. */
13598 /* Parse the arguments. */
13601 {
13602 /* If we couldn't parse an argument list, then we revert our changes
13603 and return simply an error. Maybe this is not a template-id
13604 after all. */
13609 }
13610 /* Otherwise, emit an error about the invalid digraph, but continue
13611 parsing because we got our argument list. */
13614 {
13617 "%<<:%> is an alternate spelling for %<[%>."
13620 {
13622 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13625 }
13626 }
13627 }
13628 else
13629 {
13630 /* Look for the `<' that starts the template-argument-list. */
13632 {
13635 }
13636 /* Parse the arguments. */
13638 }
13640 /* Build a representation of the specialization. */
13643 TEMPLATE_ID_EXPR,
13647 {
13649 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13650 template (rather than some instantiation thereof) only if
13651 is not nested within some other construct. For example, in
13652 "template <typename T> void f(T) { A<T>::", A<T> is just an
13653 instantiation of A. */
13656 CPP_SCOPE));
13657 template_id
13659 }
13661 {
13663 }
13664 else
13665 {
13666 /* If it's not a class-template or a template-template, it should be
13667 a function-template. */
13673 }
13675 /* If parsing tentatively, replace the sequence of tokens that makes
13676 up the template-id with a CPP_TEMPLATE_ID token. That way,
13677 should we re-parse the token stream, we will not have to repeat
13678 the effort required to do the parse, nor will we issue duplicate
13679 error messages about problems during instantiation of the
13680 template. */
13682 /* Don't do this if we had a parse error in a declarator; re-parsing
13683 might succeed if a name changes meaning (60361). */
13687 {
13690 /* Reset the contents of the START_OF_ID token. */
13692 /* Retrieve any deferred checks. Do not pop this access checks yet
13693 so the memory will not be reclaimed during token replacing below. */
13699 /* Purge all subsequent tokens. */
13702 /* ??? Can we actually assume that, if template_id ==
13703 error_mark_node, we will have issued a diagnostic to the
13704 user, as opposed to simply marking the tentative parse as
13705 failed? */
13708 }
13712 }
13714 /* Parse a template-name.
13716 template-name:
13717 identifier
13719 The standard should actually say:
13721 template-name:
13722 identifier
13723 operator-function-id
13725 A defect report has been filed about this issue.
13727 A conversion-function-id cannot be a template name because they cannot
13728 be part of a template-id. In fact, looking at this code:
13730 a.operator K<int>()
13732 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13733 It is impossible to call a templated conversion-function-id with an
13734 explicit argument list, since the only allowed template parameter is
13735 the type to which it is converting.
13737 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13738 `template' keyword, in a construction like:
13740 T::template f<3>()
13742 In that case `f' is taken to be a template-name, even though there
13743 is no way of knowing for sure.
13745 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13746 name refers to a set of overloaded functions, at least one of which
13747 is a template, or an IDENTIFIER_NODE with the name of the template,
13748 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13749 names are looked up inside uninstantiated templates. */
13751 static tree
13758 {
13759 tree identifier;
13760 tree decl;
13761 tree fns;
13764 /* If the next token is `operator', then we have either an
13765 operator-function-id or a conversion-function-id. */
13767 {
13768 /* We don't know whether we're looking at an
13769 operator-function-id or a conversion-function-id. */
13771 /* Try an operator-function-id. */
13773 /* If that didn't work, try a conversion-function-id. */
13775 {
13778 }
13779 }
13780 /* Look for the identifier. */
13781 else
13784 /* If we didn't find an identifier, we don't have a template-id. */
13788 /* If the name immediately followed the `template' keyword, then it
13789 is a template-name. However, if the next token is not `<', then
13790 we do not treat it as a template-name, since it is not being used
13791 as part of a template-id. This enables us to handle constructs
13792 like:
13794 template <typename T> struct S { S(); };
13795 template <typename T> S<T>::S();
13797 correctly. We would treat `S' as a template -- if it were `S<T>'
13798 -- but we do not if there is no `<'. */
13802 {
13803 /* In a declaration, in a dependent context, we pretend that the
13804 "template" keyword was present in order to improve error
13805 recovery. For example, given:
13807 template <typename T> void f(T::X<int>);
13809 we want to treat "X<int>" as a template-id. */
13811 && !template_keyword_p
13813 && check_dependency_p
13815 /* Do not do this for dtors (or ctors), since they never
13816 need the template keyword before their name. */
13818 {
13821 /* Explain what went wrong. */
13823 identifier);
13826 /* If parsing tentatively, find the location of the "<" token. */
13829 /* Parse the template arguments so that we can issue error
13830 messages about them. */
13833 /* Skip tokens until we find a good place from which to
13834 continue parsing. */
13839 /* If parsing tentatively, permanently remove the
13840 template argument list. That will prevent duplicate
13841 error messages from being issued about the missing
13842 "template" keyword. */
13848 }
13850 /* If the "template" keyword is present, then there is generally
13851 no point in doing name-lookup, so we just return IDENTIFIER.
13852 But, if the qualifying scope is non-dependent then we can
13853 (and must) do name-lookup normally. */
13859 }
13861 /* Look up the name. */
13863 tag_type,
13866 check_dependency_p,
13870 /* If DECL is a template, then the name was a template-name. */
13872 ;
13873 else
13874 {
13877 /* The standard does not explicitly indicate whether a name that
13878 names a set of overloaded declarations, some of which are
13879 templates, is a template-name. However, such a name should
13880 be a template-name; otherwise, there is no way to form a
13881 template-id for the overloaded templates. */
13889 {
13890 /* The name does not name a template. */
13893 }
13894 }
13896 /* If DECL is dependent, and refers to a function, then just return
13897 its name; we will look it up again during template instantiation. */
13899 {
13903 }
13906 }
13908 /* Parse a template-argument-list.
13910 template-argument-list:
13911 template-argument ... [opt]
13912 template-argument-list , template-argument ... [opt]
13914 Returns a TREE_VEC containing the arguments. */
13916 static tree
13918 {
13923 tree vec;
13930 /* Even if the template-id appears in an integral
13931 constant-expression, the contents of the argument list do
13932 not. */
13938 /* Parse the arguments. */
13939 do
13940 {
13941 tree argument;
13944 /* Consume the comma. */
13947 /* Parse the template-argument. */
13950 /* If the next token is an ellipsis, we're expanding a template
13951 argument pack. */
13953 {
13955 {
13959 }
13960 /* Consume the `...' token. */
13963 /* Make the argument into a TYPE_PACK_EXPANSION or
13964 EXPR_PACK_EXPANSION. */
13966 }
13969 {
13973 {
13976 }
13977 else
13979 }
13981 }
13994 #ifdef ENABLE_CHECKING
13996 #endif
13998 }
14000 /* Parse a template-argument.
14002 template-argument:
14003 assignment-expression
14004 type-id
14005 id-expression
14007 The representation is that of an assignment-expression, type-id, or
14008 id-expression -- except that the qualified id-expression is
14009 evaluated, so that the value returned is either a DECL or an
14010 OVERLOAD.
14012 Although the standard says "assignment-expression", it forbids
14013 throw-expressions or assignments in the template argument.
14014 Therefore, we use "conditional-expression" instead. */
14016 static tree
14018 {
14019 tree argument;
14025 cp_id_kind idk;
14027 /* There's really no way to know what we're looking at, so we just
14028 try each alternative in order.
14030 [temp.arg]
14032 In a template-argument, an ambiguity between a type-id and an
14033 expression is resolved to a type-id, regardless of the form of
14034 the corresponding template-parameter.
14036 Therefore, we try a type-id first. */
14039 /* If there was no error parsing the type-id but the next token is a
14040 '>>', our behavior depends on which dialect of C++ we're
14041 parsing. In C++98, we probably found a typo for '> >'. But there
14042 are type-id which are also valid expressions. For instance:
14044 struct X { int operator >> (int); };
14045 template <int V> struct Foo {};
14046 Foo<X () >> 5> r;
14048 Here 'X()' is a valid type-id of a function type, but the user just
14049 wanted to write the expression "X() >> 5". Thus, we remember that we
14050 found a valid type-id, but we still try to parse the argument as an
14051 expression to see what happens.
14053 In C++0x, the '>>' will be considered two separate '>'
14054 tokens. */
14058 {
14061 }
14062 else
14063 {
14064 /* If the next token isn't a `,' or a `>', then this argument wasn't
14065 really finished. This means that the argument is not a valid
14066 type-id. */
14069 /* If that worked, we're done. */
14072 }
14073 /* We're still not sure what the argument will be. */
14075 /* Try a template. */
14083 /* If the next token isn't a `,' or a `>', then this argument wasn't
14084 really finished. */
14088 {
14089 /* Figure out what is being referred to. If the id-expression
14090 was for a class template specialization, then we will have a
14091 TYPE_DECL at this point. There is no need to do name lookup
14092 at this point in that case. */
14095 none_type,
14104 }
14107 /* It must be a non-type argument. There permitted cases are given
14108 in [temp.arg.nontype]:
14110 -- an integral constant-expression of integral or enumeration
14111 type; or
14113 -- the name of a non-type template-parameter; or
14115 -- the name of an object or function with external linkage...
14117 -- the address of an object or function with external linkage...
14119 -- a pointer to member... */
14120 /* Look for a non-type template parameter. */
14122 {
14134 }
14136 /* If the next token is "&", the argument must be the address of an
14137 object or function with external linkage. */
14140 {
14143 }
14144 /* See if we might have an id-expression. */
14151 {
14154 address_p,
14161 else
14162 {
14163 tree probe;
14166 {
14167 /* Strip the dereference temporarily. */
14170 }
14172 /* If we're in a template, we represent a qualified-id referring
14173 to a static data member as a SCOPE_REF even if the scope isn't
14174 dependent so that we can check access control later. */
14179 {
14180 /* A variable without external linkage might still be a
14181 valid constant-expression, so no error is issued here
14182 if the external-linkage check fails. */
14185 }
14187 /* All overloaded functions are allowed; if the external
14188 linkage test does not pass, an error will be issued
14189 later. */
14190 ;
14194 /* A pointer-to-member. */
14195 ;
14197 ;
14198 else
14202 {
14205 tf_warning_or_error);
14206 else
14209 }
14210 }
14211 }
14212 /* If the argument started with "&", there are no other valid
14213 alternatives at this point. */
14215 {
14218 }
14220 /* If the argument wasn't successfully parsed as a type-id followed
14221 by '>>', the argument can only be a constant expression now.
14222 Otherwise, we try parsing the constant-expression tentatively,
14223 because the argument could really be a type-id. */
14234 /* We did our best to parse the argument as a non type-id, but that
14235 was the only alternative that matched (albeit with a '>' after
14236 it). We can assume it's just a typo from the user, and a
14237 diagnostic will then be issued. */
14239 }
14241 /* Parse an explicit-instantiation.
14243 explicit-instantiation:
14244 template declaration
14246 Although the standard says `declaration', what it really means is:
14248 explicit-instantiation:
14249 template decl-specifier-seq [opt] declarator [opt] ;
14251 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14252 supposed to be allowed. A defect report has been filed about this
14253 issue.
14255 GNU Extension:
14257 explicit-instantiation:
14258 storage-class-specifier template
14259 decl-specifier-seq [opt] declarator [opt] ;
14260 function-specifier template
14261 decl-specifier-seq [opt] declarator [opt] ; */
14263 static void
14265 {
14267 cp_decl_specifier_seq decl_specifiers;
14272 /* Look for an (optional) storage-class-specifier or
14273 function-specifier. */
14275 {
14276 extension_specifier
14279 extension_specifier
14282 }
14284 /* Look for the `template' keyword. */
14286 /* Let the front end know that we are processing an explicit
14287 instantiation. */
14289 /* [temp.explicit] says that we are supposed to ignore access
14290 control while processing explicit instantiation directives. */
14292 /* Parse a decl-specifier-seq. */
14294 CP_PARSER_FLAGS_OPTIONAL,
14297 /* If there was exactly one decl-specifier, and it declared a class,
14298 and there's no declarator, then we have an explicit type
14299 instantiation. */
14301 {
14302 tree type;
14306 /* Turn access control back on for names used during
14307 template instantiation. */
14312 }
14313 else
14314 {
14316 tree decl;
14318 /* Parse the declarator. */
14319 declarator
14330 {
14333 "explicit instantiation shall not use"
14337 "explicit instantiation shall not use"
14342 /* Turn access control back on for names used during
14343 template instantiation. */
14345 /* Do the explicit instantiation. */
14347 }
14348 else
14349 {
14351 /* Skip the body of the explicit instantiation. */
14353 }
14354 }
14355 /* We're done with the instantiation. */
14361 }
14363 /* Parse an explicit-specialization.
14365 explicit-specialization:
14366 template < > declaration
14368 Although the standard says `declaration', what it really means is:
14370 explicit-specialization:
14371 template <> decl-specifier [opt] init-declarator [opt] ;
14372 template <> function-definition
14373 template <> explicit-specialization
14374 template <> template-declaration */
14376 static void
14378 {
14382 /* Look for the `template' keyword. */
14384 /* Look for the `<'. */
14386 /* Look for the `>'. */
14388 /* We have processed another parameter list. */
14390 /* [temp]
14392 A template ... explicit specialization ... shall not have C
14393 linkage. */
14395 {
14397 /* Give it C++ linkage to avoid confusing other parts of the
14398 front end. */
14401 }
14402 else
14404 /* Let the front end know that we are beginning a specialization. */
14406 {
14409 }
14411 /* If the next keyword is `template', we need to figure out whether
14412 or not we're looking a template-declaration. */
14414 {
14419 else
14421 }
14422 else
14423 /* Parse the dependent declaration. */
14429 /* We're done with the specialization. */
14431 /* For the erroneous case of a template with C linkage, we pushed an
14432 implicit C++ linkage scope; exit that scope now. */
14435 /* We're done with this parameter list. */
14437 }
14439 /* Parse a type-specifier.
14441 type-specifier:
14442 simple-type-specifier
14443 class-specifier
14444 enum-specifier
14445 elaborated-type-specifier
14446 cv-qualifier
14448 GNU Extension:
14450 type-specifier:
14451 __complex__
14453 Returns a representation of the type-specifier. For a
14454 class-specifier, enum-specifier, or elaborated-type-specifier, a
14455 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14457 The parser flags FLAGS is used to control type-specifier parsing.
14459 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14460 in a decl-specifier-seq.
14462 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14463 class-specifier, enum-specifier, or elaborated-type-specifier, then
14464 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14465 if a type is declared; 2 if it is defined. Otherwise, it is set to
14466 zero.
14468 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14469 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14470 is set to FALSE. */
14472 static tree
14474 cp_parser_flags flags,
14479 {
14485 /* Assume this type-specifier does not declare a new type. */
14488 /* And that it does not specify a cv-qualifier. */
14491 /* Peek at the next token. */
14494 /* If we're looking at a keyword, we can use that to guide the
14495 production we choose. */
14498 {
14503 /* Look for the enum-specifier. */
14505 /* If that worked, we're done. */
14507 {
14512 type_spec,
14513 token,
14516 }
14517 else
14520 /* Any of these indicate either a class-specifier, or an
14521 elaborated-type-specifier. */
14528 /* Parse tentatively so that we can back up if we don't find a
14529 class-specifier. */
14531 /* Look for the class-specifier. */
14534 /* If that worked, we're done. */
14536 {
14541 type_spec,
14542 token,
14545 }
14547 /* Fall through. */
14548 elaborated_type_specifier:
14549 /* We're declaring (not defining) a class or enum. */
14553 /* Fall through. */
14555 /* Look for an elaborated-type-specifier. */
14556 type_spec
14557 = (cp_parser_elaborated_type_specifier
14560 is_declaration));
14563 type_spec,
14564 token,
14587 /* The `__complex__' keyword is a GNU extension. */
14593 }
14595 /* Handle simple keywords. */
14597 {
14599 {
14602 }
14604 }
14606 /* If we do not already have a type-specifier, assume we are looking
14607 at a simple-type-specifier. */
14609 decl_specs,
14610 flags);
14612 /* If we didn't find a type-specifier, and a type-specifier was not
14613 optional in this context, issue an error message. */
14615 {
14618 }
14621 }
14623 /* Parse a simple-type-specifier.
14625 simple-type-specifier:
14626 :: [opt] nested-name-specifier [opt] type-name
14627 :: [opt] nested-name-specifier template template-id
14628 char
14629 wchar_t
14630 bool
14631 short
14632 int
14633 long
14634 signed
14635 unsigned
14636 float
14637 double
14638 void
14640 C++0x Extension:
14642 simple-type-specifier:
14643 auto
14644 decltype ( expression )
14645 char16_t
14646 char32_t
14647 __underlying_type ( type-id )
14649 GNU Extension:
14651 simple-type-specifier:
14652 __int128
14653 __typeof__ unary-expression
14654 __typeof__ ( type-id )
14655 __typeof__ ( type-id ) { initializer-list , [opt] }
14657 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14658 appropriately updated. */
14660 static tree
14663 cp_parser_flags flags)
14664 {
14668 /* Peek at the next token. */
14671 /* If we're looking at a keyword, things are easy. */
14673 {
14733 {
14737 {
14740 "use of %<auto%> in lambda parameter declaration "
14741 "only available with "
14743 }
14746 "use of %<auto%> in parameter declaration "
14747 "only available with "
14749 else
14751 "ISO C++ forbids use of %<auto%> in parameter "
14753 }
14754 else
14759 /* Since DR 743, decltype can either be a simple-type-specifier by
14760 itself or begin a nested-name-specifier. Parsing it will replace
14761 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14762 handling below decide what to do. */
14768 /* Consume the `typeof' token. */
14770 /* Parse the operand to `typeof'. */
14772 /* If it is not already a TYPE, take its type. */
14778 token,
14787 token,
14797 token,
14802 }
14804 /* If token is an already-parsed decltype not followed by ::,
14805 it's a simple-type-specifier. */
14808 {
14812 token,
14816 }
14818 /* If the type-specifier was for a built-in type, we're done. */
14820 {
14821 /* Record the type. */
14828 type,
14829 token,
14834 /* Consume the token. */
14837 /* There is no valid C++ program where a non-template type is
14838 followed by a "<". That usually indicates that the user thought
14839 that the type was a template. */
14844 }
14846 /* The type-specifier must be a user-defined type. */
14848 {
14852 /* Don't gobble tokens or issue error messages if this is an
14853 optional type-specifier. */
14857 /* Look for the optional `::' operator. */
14858 global_p
14862 /* Look for the nested-name specifier. */
14863 qualified_p
14871 /* If we have seen a nested-name-specifier, and the next token
14872 is `template', then we are using the template-id production. */
14875 {
14876 /* Look for the template-id. */
14880 none_type,
14882 /* If the template-id did not name a type, we are out of
14883 luck. */
14885 {
14888 }
14889 }
14890 /* Otherwise, look for a type-name. */
14891 else
14893 /* Keep track of all name-lookups performed in class scopes. */
14895 && !global_p
14896 && !qualified_p
14900 /* If it didn't work out, we don't have a TYPE. */
14906 token,
14908 }
14910 /* If we didn't get a type-name, issue an error message. */
14912 {
14915 }
14918 {
14919 /* See if TYPE is an Objective-C type, and if so, parse and
14920 accept any protocol references following it. Do this before
14921 the cp_parser_check_for_invalid_template_id() call, because
14922 Objective-C types can be followed by '<...>' which would
14923 enclose protocol names rather than template arguments, and so
14924 everything is fine. */
14927 {
14931 /* Clobber the "unqualified" type previously entered into
14932 DECL_SPECS with the new, improved protocol-qualified version. */
14937 }
14939 /* There is no valid C++ program where a non-template type is
14940 followed by a "<". That usually indicates that the user
14941 thought that the type was a template. */
14943 none_type,
14945 }
14948 }
14950 /* Parse a type-name.
14952 type-name:
14953 class-name
14954 enum-name
14955 typedef-name
14956 simple-template-id [in c++0x]
14958 enum-name:
14959 identifier
14961 typedef-name:
14962 identifier
14964 Returns a TYPE_DECL for the type. */
14966 static tree
14968 {
14969 tree type_decl;
14971 /* We can't know yet whether it is a class-name or not. */
14973 /* Try a class-name. */
14977 none_type,
14981 /* If it's not a class-name, keep looking. */
14983 {
14985 /* It must be a typedef-name or an enum-name. */
14989 /* It is either a simple-template-id representing an
14990 instantiation of an alias template... */
14994 none_type,
14996 /* Note that this must be an instantiation of an alias template
14997 because [temp.names]/6 says:
14999 A template-id that names an alias template specialization
15000 is a type-name.
15002 Whereas [temp.names]/7 says:
15004 A simple-template-id that names a class template
15005 specialization is a class-name. */
15010 else
15014 /* ... Or a typedef-name or an enum-name. */
15016 }
15019 }
15021 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15023 enum-name:
15024 identifier
15026 typedef-name:
15027 identifier
15029 Returns a TYPE_DECL for the type. */
15031 static tree
15033 {
15034 tree type_decl;
15035 tree identifier;
15042 /* Look up the type-name. */
15049 {
15050 /* See if this is an Objective-C type. */
15055 }
15057 /* Issue an error if we did not find a type-name. */
15059 /* In Objective-C, we have the complication that class names are
15060 normally type names and start declarations (eg, the
15061 "NSObject" in "NSObject *object;"), but can be used in an
15062 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15063 is an expression. So, a classname followed by a dot is not a
15064 valid type-name. */
15067 {
15072 }
15073 /* Remember that the name was used in the definition of the
15074 current class so that we can check later to see if the
15075 meaning would have been different after the class was
15076 entirely defined. */
15082 }
15084 /* Parse an elaborated-type-specifier. Note that the grammar given
15085 here incorporates the resolution to DR68.
15087 elaborated-type-specifier:
15088 class-key :: [opt] nested-name-specifier [opt] identifier
15089 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15090 enum-key :: [opt] nested-name-specifier [opt] identifier
15091 typename :: [opt] nested-name-specifier identifier
15092 typename :: [opt] nested-name-specifier template [opt]
15093 template-id
15095 GNU extension:
15097 elaborated-type-specifier:
15098 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15099 class-key attributes :: [opt] nested-name-specifier [opt]
15100 template [opt] template-id
15101 enum attributes :: [opt] nested-name-specifier [opt] identifier
15103 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15104 declared `friend'. If IS_DECLARATION is TRUE, then this
15105 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15106 something is being declared.
15108 Returns the TYPE specified. */
15110 static tree
15114 {
15116 tree identifier;
15119 tree globalscope;
15122 /* See if we're looking at the `enum' keyword. */
15124 {
15125 /* Consume the `enum' token. */
15127 /* Remember that it's an enumeration type. */
15129 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15130 enums) is used here. */
15133 {
15137 /* Consume the `struct' or `class' and parse it anyway. */
15139 }
15140 /* Parse the attributes. */
15142 }
15143 /* Or, it might be `typename'. */
15145 RID_TYPENAME))
15146 {
15147 /* Consume the `typename' token. */
15149 /* Remember that it's a `typename' type. */
15151 }
15152 /* Otherwise it must be a class-key. */
15153 else
15154 {
15158 /* Parse the attributes. */
15160 }
15162 /* Look for the `::' operator. */
15165 /* Look for the nested-name-specifier. */
15167 {
15172 is_declaration))
15174 }
15175 else
15176 /* Even though `typename' is not present, the proposed resolution
15177 to Core Issue 180 says that in `class A<T>::B', `B' should be
15178 considered a type-name, even if `A<T>' is dependent. */
15183 is_declaration);
15184 /* For everything but enumeration types, consider a template-id.
15185 For an enumeration type, consider only a plain identifier. */
15187 {
15189 tree decl;
15191 /* Allow the `template' keyword. */
15193 /* If we didn't see `template', we don't know if there's a
15194 template-id or not. */
15197 /* Parse the template-id. */
15201 tag_type,
15202 is_declaration);
15203 /* If we didn't find a template-id, look for an ordinary
15204 identifier. */
15206 ;
15207 /* We can get here when cp_parser_template_id, called by
15208 cp_parser_class_name with tag_type == none_type, succeeds
15209 and caches a BASELINK. Then, when called again here,
15210 instead of failing and returning an error_mark_node
15211 returns it (see template/typename17.C in C++11).
15212 ??? Could we diagnose this earlier? */
15214 {
15217 }
15218 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15219 in effect, then we must assume that, upon instantiation, the
15220 template will correspond to a class. */
15224 typename_type,
15226 /* If the `typename' keyword is in effect and DECL is not a type
15227 decl, then type is non existent. */
15229 ;
15235 }
15238 {
15243 {
15246 }
15248 /* For a `typename', we needn't call xref_tag. */
15254 /* Template parameter lists apply only if we are not within a
15255 function parameter list. */
15256 bool template_parm_lists_apply
15265 /* Look up a qualified name in the usual way. */
15267 {
15268 tree decl;
15269 tree ambiguous_decls;
15272 tag_type,
15279 /* If the lookup was ambiguous, an error will already have been
15280 issued. */
15284 /* If we are parsing friend declaration, DECL may be a
15285 TEMPLATE_DECL tree node here. However, we need to check
15286 whether this TEMPLATE_DECL results in valid code. Consider
15287 the following example:
15289 namespace N {
15290 template <class T> class C {};
15291 }
15292 class X {
15293 template <class T> friend class N::C; // #1, valid code
15294 };
15295 template <class T> class Y {
15296 friend class N::C; // #2, invalid code
15297 };
15299 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15300 name lookup of `N::C'. We see that friend declaration must
15301 be template for the code to be valid. Note that
15302 processing_template_decl does not work here since it is
15303 always 1 for the above two cases. */
15305 decl = (cp_parser_maybe_treat_template_as_class
15310 {
15312 identifier,
15315 }
15318 {
15322 allow_template);
15326 }
15328 /* Forward declarations of nested types, such as
15330 class C1::C2;
15331 class C1::C2::C3;
15333 are invalid unless all components preceding the final '::'
15334 are complete. If all enclosing types are complete, these
15335 declarations become merely pointless.
15337 Invalid forward declarations of nested types are errors
15338 caught elsewhere in parsing. Those that are pointless arrive
15339 here. */
15346 }
15347 else
15348 {
15349 /* An elaborated-type-specifier sometimes introduces a new type and
15350 sometimes names an existing type. Normally, the rule is that it
15351 introduces a new type only if there is not an existing type of
15352 the same name already in scope. For example, given:
15354 struct S {};
15355 void f() { struct S s; }
15357 the `struct S' in the body of `f' is the same `struct S' as in
15358 the global scope; the existing definition is used. However, if
15359 there were no global declaration, this would introduce a new
15360 local class named `S'.
15362 An exception to this rule applies to the following code:
15364 namespace N { struct S; }
15366 Here, the elaborated-type-specifier names a new type
15367 unconditionally; even if there is already an `S' in the
15368 containing scope this declaration names a new type.
15369 This exception only applies if the elaborated-type-specifier
15370 forms the complete declaration:
15372 [class.name]
15374 A declaration consisting solely of `class-key identifier ;' is
15375 either a redeclaration of the name in the current scope or a
15376 forward declaration of the identifier as a class name. It
15377 introduces the name into the current scope.
15379 We are in this situation precisely when the next token is a `;'.
15381 An exception to the exception is that a `friend' declaration does
15382 *not* name a new type; i.e., given:
15384 struct S { friend struct T; };
15386 `T' is not a new type in the scope of `S'.
15388 Also, `new struct S' or `sizeof (struct S)' never results in the
15389 definition of a new type; a new type can only be declared in a
15390 declaration context. */
15392 tag_scope ts;
15396 /* Friends have special name lookup rules. */
15400 CPP_SEMICOLON))
15401 /* This is a `class-key identifier ;' */
15403 else
15406 template_p =
15407 (template_parm_lists_apply
15410 /* An unqualified name was used to reference this type, so
15411 there were no qualifying templates. */
15419 }
15420 }
15425 /* Allow attributes on forward declarations of classes. */
15427 {
15437 else
15440 }
15443 {
15444 /* Indicate whether this class was declared as a `class' or as a
15445 `struct'. */
15449 }
15451 /* A "<" cannot follow an elaborated type specifier. If that
15452 happens, the user was probably trying to form a template-id. */
15457 }
15459 /* Parse an enum-specifier.
15461 enum-specifier:
15462 enum-head { enumerator-list [opt] }
15463 enum-head { enumerator-list , } [C++0x]
15465 enum-head:
15466 enum-key identifier [opt] enum-base [opt]
15467 enum-key nested-name-specifier identifier enum-base [opt]
15469 enum-key:
15470 enum
15471 enum class [C++0x]
15472 enum struct [C++0x]
15474 enum-base: [C++0x]
15475 : type-specifier-seq
15477 opaque-enum-specifier:
15478 enum-key identifier enum-base [opt] ;
15480 GNU Extensions:
15481 enum-key attributes[opt] identifier [opt] enum-base [opt]
15482 { enumerator-list [opt] }attributes[opt]
15483 enum-key attributes[opt] identifier [opt] enum-base [opt]
15484 { enumerator-list, }attributes[opt] [C++0x]
15486 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15487 if the token stream isn't an enum-specifier after all. */
15489 static tree
15491 {
15492 tree identifier;
15494 tree prev_scope;
15496 tree attributes;
15509 /* Parse tentatively so that we can back up if we don't find a
15510 enum-specifier. */
15513 /* Caller guarantees that the current token is 'enum', an identifier
15514 possibly follows, and the token after that is an opening brace.
15515 If we don't have an identifier, fabricate an anonymous name for
15516 the enumeration being defined. */
15519 /* Parse the "class" or "struct", which indicates a scoped
15520 enumeration type in C++0x. */
15523 {
15527 /* Consume the `struct' or `class' token. */
15531 }
15535 /* Clear the qualification. */
15540 /* Figure out in what scope the declaration is being placed. */
15546 nested_name_specifier
15554 {
15555 tree name;
15559 enum_type,
15564 input_location);
15566 {
15569 {
15570 /* Are template enums allowed in ISO? */
15574 /* ignore a typename reference, for it will be solved by name
15575 in start_enum. */
15577 }
15578 }
15581 else
15584 }
15585 else
15586 {
15589 else
15590 {
15596 }
15597 }
15600 /* Check for the `:' that denotes a specified underlying type in C++0x.
15601 Note that a ':' could also indicate a bitfield width, however. */
15603 {
15604 cp_decl_specifier_seq type_specifiers;
15606 /* Consume the `:'. */
15609 /* Parse the type-specifier-seq. */
15614 /* At this point this is surely not elaborated type specifier. */
15623 /* If that didn't work, stop. */
15625 {
15631 }
15632 }
15634 /* Look for the `{' but don't consume it yet. */
15636 {
15638 {
15641 {
15644 }
15645 }
15646 /* An opaque-enum-specifier must have a ';' here. */
15649 {
15652 {
15655 }
15656 }
15657 }
15663 {
15665 {
15669 }
15671 {
15673 }
15674 }
15676 /* Issue an error message if type-definitions are forbidden here. */
15679 else
15680 /* Create the new type. We do this before consuming the opening
15681 brace so the enum will be recorded as being on the line of its
15682 tag (or the 'enum' keyword, if there is no tag). */
15686 /* If the next token is not '{' it is an opaque-enum-specifier or an
15687 elaborated-type-specifier. */
15689 {
15693 {
15694 /* The following catches invalid code such as:
15695 enum class S<int>::E { A, B, C }; */
15703 {
15707 nested_name_specifier);
15709 }
15710 /* If that scope does not contain the scope in which the
15711 class was originally declared, the program is invalid. */
15713 nested_name_specifier))
15714 {
15717 "declaration of %qD in namespace %qD which does not "
15720 else
15722 "declaration of %qD in %qD which does not "
15726 }
15727 }
15732 /* Consume the opening brace. */
15739 {
15743 }
15744 else
15745 {
15751 }
15755 /* If the next token is not '}', then there are some enumerators. */
15757 {
15761 }
15762 else
15765 /* Consume the final '}'. */
15771 }
15772 else
15773 {
15774 /* If a ';' follows, then it is an opaque-enum-specifier
15775 and additional restrictions apply. */
15777 {
15784 }
15785 }
15787 /* Look for trailing attributes to apply to this enumeration, and
15788 apply them if appropriate. */
15790 {
15794 trailing_attr,
15796 }
15798 /* Finish up the enumeration. */
15800 {
15805 }
15808 {
15810 {
15813 }
15815 {
15817 }
15818 }
15819 out:
15822 }
15824 /* Parse an enumerator-list. The enumerators all have the indicated
15825 TYPE.
15827 enumerator-list:
15828 enumerator-definition
15829 enumerator-list , enumerator-definition */
15831 static void
15833 {
15835 {
15836 /* Parse an enumerator-definition. */
15839 /* If the next token is not a ',', we've reached the end of
15840 the list. */
15843 /* Otherwise, consume the `,' and keep going. */
15845 /* If the next token is a `}', there is a trailing comma. */
15847 {
15852 }
15853 }
15854 }
15856 /* Parse an enumerator-definition. The enumerator has the indicated
15857 TYPE.
15859 enumerator-definition:
15860 enumerator
15861 enumerator = constant-expression
15863 enumerator:
15864 identifier */
15866 static void
15868 {
15869 tree identifier;
15870 tree value;
15871 location_t loc;
15873 /* Save the input location because we are interested in the location
15874 of the identifier and not the location of the explicit value. */
15877 /* Look for the identifier. */
15882 /* If the next token is an '=', then there is an explicit value. */
15884 {
15885 /* Consume the `=' token. */
15887 /* Parse the value. */
15889 }
15890 else
15893 /* If we are processing a template, make sure the initializer of the
15894 enumerator doesn't contain any bare template parameter pack. */
15898 /* integral_constant_value will pull out this expression, so make sure
15899 it's folded as appropriate. */
15902 /* Create the enumerator. */
15904 }
15906 /* Parse a namespace-name.
15908 namespace-name:
15909 original-namespace-name
15910 namespace-alias
15912 Returns the NAMESPACE_DECL for the namespace. */
15914 static tree
15916 {
15917 tree identifier;
15918 tree namespace_decl;
15922 /* Get the name of the namespace. */
15927 /* Look up the identifier in the currently active scope. Look only
15928 for namespaces, due to:
15930 [basic.lookup.udir]
15932 When looking up a namespace-name in a using-directive or alias
15933 definition, only namespace names are considered.
15935 And:
15937 [basic.lookup.qual]
15939 During the lookup of a name preceding the :: scope resolution
15940 operator, object, function, and enumerator names are ignored.
15942 (Note that cp_parser_qualifying_entity only calls this
15943 function if the token after the name is the scope resolution
15944 operator.) */
15946 none_type,
15952 /* If it's not a namespace, issue an error. */
15955 {
15960 }
15963 }
15965 /* Parse a namespace-definition.
15967 namespace-definition:
15968 named-namespace-definition
15969 unnamed-namespace-definition
15971 named-namespace-definition:
15972 original-namespace-definition
15973 extension-namespace-definition
15975 original-namespace-definition:
15976 namespace identifier { namespace-body }
15978 extension-namespace-definition:
15979 namespace original-namespace-name { namespace-body }
15981 unnamed-namespace-definition:
15982 namespace { namespace-body } */
15984 static void
15986 {
15993 {
15997 }
15998 else
16001 /* Look for the `namespace' keyword. */
16004 /* Get the name of the namespace. We do not attempt to distinguish
16005 between an original-namespace-definition and an
16006 extension-namespace-definition at this point. The semantic
16007 analysis routines are responsible for that. */
16010 else
16013 /* Parse any specified attributes. */
16016 /* Look for the `{' to start the namespace. */
16018 /* Start the namespace. */
16021 /* "inline namespace" is equivalent to a stub namespace definition
16022 followed by a strong using directive. */
16024 {
16026 /* Set up namespace association. */
16030 /* Import the contents of the inline namespace. */
16034 }
16038 /* Parse the body of the namespace. */
16044 /* Finish the namespace. */
16046 /* Look for the final `}'. */
16048 }
16050 /* Parse a namespace-body.
16052 namespace-body:
16053 declaration-seq [opt] */
16055 static void
16057 {
16059 }
16061 /* Parse a namespace-alias-definition.
16063 namespace-alias-definition:
16064 namespace identifier = qualified-namespace-specifier ; */
16066 static void
16068 {
16069 tree identifier;
16070 tree namespace_specifier;
16074 /* Look for the `namespace' keyword. */
16076 /* Look for the identifier. */
16080 /* Look for the `=' token. */
16083 {
16085 /* Skip the definition. */
16090 }
16092 /* Look for the qualified-namespace-specifier. */
16093 namespace_specifier
16095 /* Look for the `;' token. */
16098 /* Register the alias in the symbol table. */
16100 }
16102 /* Parse a qualified-namespace-specifier.
16104 qualified-namespace-specifier:
16105 :: [opt] nested-name-specifier [opt] namespace-name
16107 Returns a NAMESPACE_DECL corresponding to the specified
16108 namespace. */
16110 static tree
16112 {
16113 /* Look for the optional `::'. */
16117 /* Look for the optional nested-name-specifier. */
16125 }
16127 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16128 access declaration.
16130 using-declaration:
16131 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16132 using :: unqualified-id ;
16134 access-declaration:
16135 qualified-id ;
16137 */
16139 static bool
16142 {
16146 tree decl;
16147 tree identifier;
16148 tree qscope;
16153 {
16156 }
16157 else
16158 {
16159 /* Look for the `using' keyword. */
16162 /* Peek at the next token. */
16164 /* See if it's `typename'. */
16166 {
16167 /* Remember that we've seen it. */
16169 /* Consume the `typename' token. */
16171 }
16172 }
16174 /* Look for the optional global scope qualification. */
16175 global_scope_p
16180 /* If we saw `typename', or didn't see `::', then there must be a
16181 nested-name-specifier present. */
16183 {
16189 {
16192 }
16193 }
16194 /* Otherwise, we could be in either of the two productions. In that
16195 case, treat the nested-name-specifier as optional. */
16196 else
16208 /* Something has already gone wrong; there's no need to parse
16209 further. Since an error has occurred, the return value of
16210 cp_parser_parse_definitely will be false, as required. */
16214 /* Parse the unqualified-id. */
16222 {
16227 }
16229 /* The function we call to handle a using-declaration is different
16230 depending on what scope we are in. */
16232 ;
16235 /* [namespace.udecl]
16237 A using declaration shall not name a template-id. */
16240 else
16241 {
16243 {
16244 /* Create the USING_DECL. */
16251 {
16254 }
16255 else
16256 /* Add it to the list of members in this class. */
16258 }
16259 else
16260 {
16262 identifier,
16269 {
16272 }
16275 else
16277 }
16278 }
16280 /* Look for the final `;'. */
16285 "access declarations are deprecated "
16286 "in favour of using-declarations; "
16290 }
16292 /* Parse an alias-declaration.
16294 alias-declaration:
16295 using identifier attribute-specifier-seq [opt] = type-id */
16297 static tree
16299 {
16301 location_t id_location;
16303 cp_decl_specifier_seq decl_specs;
16307 /* Look for the `using' keyword. */
16308 cp_token *using_token
16330 /* Now we are going to parse the type-id of the declaration. */
16332 /*
16333 [dcl.type]/3 says:
16335 "A type-specifier-seq shall not define a class or enumeration
16336 unless it appears in the type-id of an alias-declaration (7.1.3) that
16337 is not the declaration of a template-declaration."
16339 In other words, if we currently are in an alias template, the
16340 type-id should not define a type.
16342 So let's set parser->type_definition_forbidden_message in that
16343 case; cp_parser_check_type_definition (called by
16344 cp_parser_class_specifier) will then emit an error if a type is
16345 defined in the type-id. */
16347 {
16351 }
16355 /* Restore the error message if need be. */
16361 {
16364 }
16366 /* A typedef-name can also be introduced by an alias-declaration. The
16367 identifier following the using keyword becomes a typedef-name. It has
16368 the same semantics as if it were introduced by the typedef
16369 specifier. In particular, it does not define a new type and it shall
16370 not appear in the type-id. */
16375 {
16378 ds_attribute,
16379 attrs_token);
16380 }
16382 ds_typedef,
16383 using_token);
16385 ds_alias,
16386 using_token);
16395 else
16406 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16407 added into the symbol table; otherwise, return the TYPE_DECL. */
16411 {
16415 }
16418 }
16420 /* Parse a using-directive.
16422 using-directive:
16423 using namespace :: [opt] nested-name-specifier [opt]
16424 namespace-name ; */
16426 static void
16428 {
16429 tree namespace_decl;
16430 tree attribs;
16432 /* Look for the `using' keyword. */
16434 /* And the `namespace' keyword. */
16436 /* Look for the optional `::' operator. */
16438 /* And the optional nested-name-specifier. */
16444 /* Get the namespace being used. */
16446 /* And any specified attributes. */
16448 /* Update the symbol table. */
16450 /* Look for the final `;'. */
16452 }
16454 /* Parse an asm-definition.
16456 asm-definition:
16457 asm ( string-literal ) ;
16459 GNU Extension:
16461 asm-definition:
16462 asm volatile [opt] ( string-literal ) ;
16463 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16464 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16465 : asm-operand-list [opt] ) ;
16466 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16467 : asm-operand-list [opt]
16468 : asm-clobber-list [opt] ) ;
16469 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16470 : asm-clobber-list [opt]
16471 : asm-goto-list ) ; */
16473 static void
16475 {
16476 tree string;
16481 tree asm_stmt;
16489 /* Look for the `asm' keyword. */
16496 /* See if the next token is `volatile'. */
16499 {
16500 /* Remember that we saw the `volatile' keyword. */
16502 /* Consume the token. */
16504 }
16508 {
16509 /* Remember that we saw the `goto' keyword. */
16511 /* Consume the token. */
16513 }
16514 /* Look for the opening `('. */
16517 /* Look for the string. */
16520 {
16524 }
16526 /* If we're allowing GNU extensions, check for the extended assembly
16527 syntax. Unfortunately, the `:' tokens need not be separated by
16528 a space in C, and so, for compatibility, we tolerate that here
16529 too. Doing that means that we have to treat the `::' operator as
16530 two `:' tokens. */
16535 {
16540 /* The extended syntax was used. */
16543 /* Look for outputs. */
16545 {
16546 /* Consume the `:'. */
16548 /* Parse the output-operands. */
16550 CPP_COLON)
16552 CPP_SCOPE)
16554 CPP_CLOSE_PAREN)
16560 }
16561 /* If the next token is `::', there are no outputs, and the
16562 next token is the beginning of the inputs. */
16564 /* The inputs are coming next. */
16567 /* Look for inputs. */
16570 {
16571 /* Consume the `:' or `::'. */
16573 /* Parse the output-operands. */
16575 CPP_COLON)
16577 CPP_SCOPE)
16579 CPP_CLOSE_PAREN))
16584 }
16586 /* The clobbers are coming next. */
16589 /* Look for clobbers. */
16592 {
16594 /* Consume the `:' or `::'. */
16596 /* Parse the clobbers. */
16598 CPP_COLON)
16600 CPP_CLOSE_PAREN))
16602 }
16605 /* The labels are coming next. */
16608 /* Look for labels. */
16611 {
16613 /* Consume the `:' or `::'. */
16615 /* Parse the labels. */
16617 }
16621 }
16625 /* Look for the closing `)'. */
16633 {
16634 /* Create the ASM_EXPR. */
16636 {
16639 /* If the extended syntax was not used, mark the ASM_EXPR. */
16641 {
16647 }
16648 }
16649 else
16651 }
16652 }
16654 /* Declarators [gram.dcl.decl] */
16656 /* Parse an init-declarator.
16658 init-declarator:
16659 declarator initializer [opt]
16661 GNU Extension:
16663 init-declarator:
16664 declarator asm-specification [opt] attributes [opt] initializer [opt]
16666 function-definition:
16667 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16668 function-body
16669 decl-specifier-seq [opt] declarator function-try-block
16671 GNU Extension:
16673 function-definition:
16674 __extension__ function-definition
16676 TM Extension:
16678 function-definition:
16679 decl-specifier-seq [opt] declarator function-transaction-block
16681 The DECL_SPECIFIERS apply to this declarator. Returns a
16682 representation of the entity declared. If MEMBER_P is TRUE, then
16683 this declarator appears in a class scope. The new DECL created by
16684 this declarator is returned.
16686 The CHECKS are access checks that should be performed once we know
16687 what entity is being declared (and, therefore, what classes have
16688 befriended it).
16690 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16691 for a function-definition here as well. If the declarator is a
16692 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16693 be TRUE upon return. By that point, the function-definition will
16694 have been completely parsed.
16696 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16697 is FALSE.
16699 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16700 parsed declaration if it is an uninitialized single declarator not followed
16701 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16702 if present, will not be consumed. If returned, this declarator will be
16703 created with SD_INITIALIZED but will not call cp_finish_decl. */
16705 static tree
16714 {
16718 tree prefix_attributes;
16720 tree asm_specification;
16721 tree initializer;
16723 tree scope;
16725 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16726 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16727 "(...)". */
16737 /* Gather the attributes that were provided with the
16738 decl-specifiers. */
16741 /* Assume that this is not the declarator for a function
16742 definition. */
16746 /* Default arguments are only permitted for function parameters. */
16750 /* Defer access checks while parsing the declarator; we cannot know
16751 what names are accessible until we know what is being
16752 declared. */
16755 /* Parse the declarator. */
16757 declarator
16762 /* Gather up the deferred checks. */
16767 /* If the DECLARATOR was erroneous, there's no need to go
16768 further. */
16772 /* Check that the number of template-parameter-lists is OK. */
16782 /* Figure out what scope the entity declared by the DECLARATOR is
16783 located in. `grokdeclarator' sometimes changes the scope, so
16784 we compute it now. */
16787 /* Perform any lookups in the declared type which were thought to be
16788 dependent, but are not in the scope of the declarator. */
16789 decl_specifiers->type
16792 /* If we're allowing GNU extensions, look for an
16793 asm-specification. */
16795 {
16796 /* Look for an asm-specification. */
16799 }
16800 else
16803 /* Look for attributes. */
16807 /* Peek at the next token. */
16813 {
16814 /* Check to see if the token indicates the start of a
16815 function-definition. */
16817 {
16819 {
16820 /* If a function-definition should not appear here, issue an
16821 error message. */
16825 }
16827 location_t func_brace_location
16830 /* Neither attributes nor an asm-specification are allowed
16831 on a function-definition. */
16834 "an asm-specification is not allowed "
16838 "attributes are not allowed "
16840 /* This is a function-definition. */
16843 /* Parse the function definition. */
16846 decl_specifiers,
16847 declarator,
16848 prefix_attributes);
16849 else
16850 decl =
16851 (cp_parser_function_definition_from_specifiers_and_declarator
16855 {
16856 /* This is where the prologue starts... */
16859 }
16862 }
16863 }
16865 {
16866 /* A non-template declaration involving a function parameter list
16867 containing an implicit template parameter will be made into a
16868 template. If the resulting declaration is not going to be an
16869 actual function then finish the template scope here to prevent it.
16870 An error message will be issued once we have a decl to talk about.
16872 FIXME probably we should do type deduction rather than create an
16873 implicit template, but the standard currently doesn't allow it. */
16876 }
16878 /* [dcl.dcl]
16880 Only in function declarations for constructors, destructors, and
16881 type conversions can the decl-specifier-seq be omitted.
16883 We explicitly postpone this check past the point where we handle
16884 function-definitions because we tolerate function-definitions
16885 that are missing their return types in some modes. */
16887 {
16891 }
16893 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16897 {
16905 {
16911 }
16912 }
16913 else
16914 {
16915 /* If the init-declarator isn't initialized and isn't followed by a
16916 `,' or `;', it's not a valid init-declarator. */
16919 {
16922 else
16923 {
16926 }
16927 }
16930 }
16932 /* Because start_decl has side-effects, we should only call it if we
16933 know we're going ahead. By this point, we know that we cannot
16934 possibly be looking at any other construct. */
16937 /* Enter the newly declared entry in the symbol table. If we're
16938 processing a declaration in a class-specifier, we wait until
16939 after processing the initializer. */
16941 {
16948 /* Adjust location of decl if declarator->id_loc is more appropriate:
16949 set, and decl wasn't merged with another decl, in which case its
16950 location would be different from input_location, and more accurate. */
16955 }
16957 /* Enter the SCOPE. That way unqualified names appearing in the
16958 initializer will be looked up in SCOPE. */
16961 /* Perform deferred access control checks, now that we know in which
16962 SCOPE the declared entity resides. */
16964 {
16967 /* If the entity being declared is a function, pretend that we
16968 are in its scope. If it is a `friend', it may have access to
16969 things that would not otherwise be accessible. */
16971 {
16974 }
16976 /* Perform access checks for template parameters. */
16979 /* Perform the access control checks for the declarator and the
16980 decl-specifiers. */
16983 /* Restore the saved value. */
16986 }
16988 /* Parse the initializer. */
16993 {
16995 {
16999 else
17000 {
17001 /* If the declaration was erroneous, we don't really
17002 know what the user intended, so just silently
17003 consume the initializer. */
17011 }
17012 }
17013 else
17014 {
17015 /* We want to record the extra mangling scope for in-class
17016 initializers of class members and initializers of static data
17017 member templates. The former involves deferring
17018 parsing of the initializer until end of class as with default
17019 arguments. So right here we only handle the latter. */
17029 }
17030 }
17032 /* The old parser allows attributes to appear after a parenthesized
17033 initializer. Mark Mitchell proposed removing this functionality
17034 on the GCC mailing lists on 2002-08-13. This parser accepts the
17035 attributes -- but ignores them. */
17042 /* And now complain about a non-function implicit template. */
17047 /* For an in-class declaration, use `grokfield' to create the
17048 declaration. */
17050 {
17052 {
17055 }
17063 }
17065 /* Finish processing the declaration. But, skip member
17066 declarations. */
17068 {
17071 asm_specification,
17072 /* If the initializer is in parentheses, then this is
17073 a direct-initialization, which means that an
17074 `explicit' constructor is OK. Otherwise, an
17075 `explicit' constructor cannot be used. */
17078 }
17081 /* Core issue #226 (C++0x only): A default template-argument
17082 shall not be specified in a friend class template
17083 declaration. */
17092 {
17095 else
17097 }
17100 }
17102 /* Parse a declarator.
17104 declarator:
17105 direct-declarator
17106 ptr-operator declarator
17108 abstract-declarator:
17109 ptr-operator abstract-declarator [opt]
17110 direct-abstract-declarator
17112 GNU Extensions:
17114 declarator:
17115 attributes [opt] direct-declarator
17116 attributes [opt] ptr-operator declarator
17118 abstract-declarator:
17119 attributes [opt] ptr-operator abstract-declarator [opt]
17120 attributes [opt] direct-abstract-declarator
17122 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17123 detect constructor, destructor or conversion operators. It is set
17124 to -1 if the declarator is a name, and +1 if it is a
17125 function. Otherwise it is set to zero. Usually you just want to
17126 test for >0, but internally the negative value is used.
17128 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17129 a decl-specifier-seq unless it declares a constructor, destructor,
17130 or conversion. It might seem that we could check this condition in
17131 semantic analysis, rather than parsing, but that makes it difficult
17132 to handle something like `f()'. We want to notice that there are
17133 no decl-specifiers, and therefore realize that this is an
17134 expression, not a declaration.)
17136 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17137 the declarator is a direct-declarator of the form "(...)".
17139 MEMBER_P is true iff this declarator is a member-declarator.
17141 FRIEND_P is true iff this declarator is a friend. */
17145 cp_parser_declarator_kind dcl_kind,
17149 {
17152 cp_cv_quals cv_quals;
17153 tree class_type;
17156 /* Assume this is not a constructor, destructor, or type-conversion
17157 operator. */
17164 /* Check for the ptr-operator production. */
17166 /* Parse the ptr-operator. */
17172 /* If that worked, then we have a ptr-operator. */
17174 {
17175 /* If a ptr-operator was found, then this declarator was not
17176 parenthesized. */
17179 /* The dependent declarator is optional if we are parsing an
17180 abstract-declarator. */
17184 /* Parse the dependent declarator. */
17189 friend_p);
17191 /* If we are parsing an abstract-declarator, we must handle the
17192 case where the dependent declarator is absent. */
17197 declarator = cp_parser_make_indirect_declarator
17199 }
17200 /* Everything else is a direct-declarator. */
17201 else
17202 {
17205 CPP_OPEN_PAREN);
17207 ctor_dtor_or_conv_p,
17209 }
17214 }
17216 /* Parse a direct-declarator or direct-abstract-declarator.
17218 direct-declarator:
17219 declarator-id
17220 direct-declarator ( parameter-declaration-clause )
17221 cv-qualifier-seq [opt]
17222 ref-qualifier [opt]
17223 exception-specification [opt]
17224 direct-declarator [ constant-expression [opt] ]
17225 ( declarator )
17227 direct-abstract-declarator:
17228 direct-abstract-declarator [opt]
17229 ( parameter-declaration-clause )
17230 cv-qualifier-seq [opt]
17231 ref-qualifier [opt]
17232 exception-specification [opt]
17233 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17234 ( abstract-declarator )
17236 Returns a representation of the declarator. DCL_KIND is
17237 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17238 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17239 we are parsing a direct-declarator. It is
17240 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17241 of ambiguity we prefer an abstract declarator, as per
17242 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17243 as for cp_parser_declarator. */
17247 cp_parser_declarator_kind dcl_kind,
17250 {
17260 {
17261 /* Peek at the next token. */
17264 {
17265 /* This is either a parameter-declaration-clause, or a
17266 parenthesized declarator. When we know we are parsing a
17267 named declarator, it must be a parenthesized declarator
17268 if FIRST is true. For instance, `(int)' is a
17269 parameter-declaration-clause, with an omitted
17270 direct-abstract-declarator. But `((*))', is a
17271 parenthesized abstract declarator. Finally, when T is a
17272 template parameter `(T)' is a
17273 parameter-declaration-clause, and not a parenthesized
17274 named declarator.
17276 We first try and parse a parameter-declaration-clause,
17277 and then try a nested declarator (if FIRST is true).
17279 It is not an error for it not to be a
17280 parameter-declaration-clause, even when FIRST is
17281 false. Consider,
17283 int i (int);
17284 int i (3);
17286 The first is the declaration of a function while the
17287 second is the definition of a variable, including its
17288 initializer.
17290 Having seen only the parenthesis, we cannot know which of
17291 these two alternatives should be selected. Even more
17292 complex are examples like:
17294 int i (int (a));
17295 int i (int (3));
17297 The former is a function-declaration; the latter is a
17298 variable initialization.
17300 Thus again, we try a parameter-declaration-clause, and if
17301 that fails, we back out and return. */
17304 {
17305 tree params;
17308 /* In a member-declarator, the only valid interpretation
17309 of a parenthesis is the start of a
17310 parameter-declaration-clause. (It is invalid to
17311 initialize a static data member with a parenthesized
17312 initializer; only the "=" form of initialization is
17313 permitted.) */
17317 /* Consume the `('. */
17320 {
17321 /* If this is going to be an abstract declarator, we're
17322 in a declarator and we can't have default args. */
17325 }
17329 /* Parse the parameter-declaration-clause. */
17332 /* Consume the `)'. */
17335 /* If all went well, parse the cv-qualifier-seq,
17336 ref-qualifier and the exception-specification. */
17338 {
17339 cp_cv_quals cv_quals;
17340 cp_virt_specifiers virt_specifiers;
17341 cp_ref_qualifier ref_qual;
17342 tree exception_specification;
17343 tree late_return;
17344 tree attrs;
17354 /* Parse the cv-qualifier-seq. */
17356 /* Parse the ref-qualifier. */
17358 /* And the exception-specification. */
17359 exception_specification
17364 /* In here, we handle cases where attribute is used after
17365 the function declaration. For example:
17366 void func (int x) __attribute__((vector(..))); */
17369 {
17373 CPP_SEMICOLON)
17375 CPP_OPEN_BRACE))
17378 ;
17379 else
17381 }
17382 late_return = (cp_parser_late_return_type_opt
17387 /* Parse the virt-specifier-seq. */
17390 /* Create the function-declarator. */
17392 params,
17393 cv_quals,
17394 virt_specifiers,
17395 ref_qual,
17396 exception_specification,
17397 late_return);
17399 /* Any subsequent parameter lists are to do with
17400 return type, so are not those of the declared
17401 function. */
17403 }
17405 /* Remove the function parms from scope. */
17409 /* Repeat the main loop. */
17411 }
17413 /* If this is the first, we can try a parenthesized
17414 declarator. */
17416 {
17422 /* Consume the `('. */
17424 /* Parse the nested declarator. */
17427 declarator
17433 /* Expect a `)'. */
17440 }
17441 /* Otherwise, we must be done. */
17442 else
17444 }
17448 {
17449 /* Parse an array-declarator. */
17458 /* Consume the `['. */
17460 /* Peek at the next token. */
17462 /* If the next token is `]', then there is no
17463 constant-expression. */
17465 {
17467 bounds
17477 {
17478 /* Normally, the array bound must be an integral constant
17479 expression. However, as an extension, we allow VLAs
17480 in function scopes as long as they aren't part of a
17481 parameter declaration. */
17485 }
17488 {
17489 /* Remember this wasn't a constant-expression. */
17492 }
17493 }
17494 else
17496 /* Look for the closing `]'. */
17498 {
17501 }
17506 }
17508 {
17509 {
17510 tree qualifying_scope;
17511 tree unqualified_name;
17512 tree attrs;
17513 special_function_kind sfk;
17518 /* Parse a declarator-id */
17521 {
17524 /* If we see an ellipsis, we should be looking at a
17525 parameter pack. */
17527 {
17528 /* Consume the `...' */
17532 }
17533 }
17536 unqualified_name
17540 {
17544 {
17545 /* Check whether an error occurred. */
17548 /* We already consumed the ellipsis to mark a
17549 parameter pack, but we have no way to report it,
17550 so abort the tentative parse. We will be exiting
17551 immediately anyway. */
17553 }
17554 else
17560 && (qualifying_scope
17562 {
17565 }
17566 }
17571 {
17576 }
17582 {
17583 /* In the declaration of a member of a template class
17584 outside of the class itself, the SCOPE will sometimes
17585 be a TYPENAME_TYPE. For example, given:
17587 template <typename T>
17588 int S<T>::R::i = 3;
17590 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17591 this context, we must resolve S<T>::R to an ordinary
17592 type, rather than a typename type.
17594 The reason we normally avoid resolving TYPENAME_TYPEs
17595 is that a specialization of `S' might render
17596 `S<T>::R' not a type. However, if `S' is
17597 specialized, then this `i' will not be used, so there
17598 is no harm in resolving the types here. */
17599 tree type;
17601 /* Resolve the TYPENAME_TYPE. */
17604 /* If that failed, the declarator is invalid. */
17606 {
17609 "cannot define member of dependent typedef "
17611 else
17616 }
17618 }
17623 {
17624 tree class_type;
17629 else
17633 {
17636 {
17639 {
17643 "use %<%T::%D%> instead of %<%T::%D%> to "
17645 class_type,
17650 }
17651 else
17653 }
17654 else
17655 {
17656 /* We do not attempt to print the declarator
17657 here because we do not have enough
17658 information about its original syntactic
17659 form. */
17663 }
17664 }
17667 {
17673 for an anonymous type, even if the type
17674 got a name for linkage purposes. */
17676 /* Handle correctly (c++/19200):
17678 struct S {
17679 struct T{};
17680 friend void S(T);
17681 };
17683 and also:
17685 namespace N {
17686 void S();
17687 }
17689 struct S {
17690 friend void N::S();
17691 }; */
17692 && !(friend_p
17695 class_type))
17696 {
17699 }
17707 }
17708 }
17710 unqualified_name,
17711 sfk);
17718 }
17720 handle_declarator:;
17723 {
17724 /* Any names that appear after the declarator-id for a
17725 member are looked up in the containing scope. */
17727 {
17728 /* But declarations with qualified-ids can't appear in a
17729 function. */
17733 }
17735 }
17739 /* Default args are only allowed on function
17740 declarations. */
17742 else
17746 }
17747 /* We're done. */
17748 else
17750 }
17752 /* For an abstract declarator, we might wind up with nothing at this
17753 point. That's an error; the declarator is not optional. */
17757 /* If we entered a scope, we must exit it now. */
17765 }
17767 /* Parse a ptr-operator.
17769 ptr-operator:
17770 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17771 * cv-qualifier-seq [opt]
17772 &
17773 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17774 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17776 GNU Extension:
17778 ptr-operator:
17779 & cv-qualifier-seq [opt]
17781 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17782 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17783 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17784 filled in with the TYPE containing the member. *CV_QUALS is
17785 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17786 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17787 Note that the tree codes returned by this function have nothing
17788 to do with the types of trees that will be eventually be created
17789 to represent the pointer or reference type being parsed. They are
17790 just constants with suggestive names. */
17791 static enum tree_code
17796 {
17801 /* Assume that it's not a pointer-to-member. */
17803 /* And that there are no cv-qualifiers. */
17806 /* Peek at the next token. */
17809 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17819 {
17820 /* Consume the `*', `&' or `&&'. */
17823 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17824 `&', if we are allowing GNU extensions. (The only qualifier
17825 that can legally appear after `&' is `restrict', but that is
17826 enforced during semantic analysis. */
17834 }
17835 else
17836 {
17837 /* Try the pointer-to-member case. */
17839 /* Look for the optional `::' operator. */
17842 /* Look for the nested-name specifier. */
17849 /* If we found it, and the next token is a `*', then we are
17850 indeed looking at a pointer-to-member operator. */
17853 {
17854 /* Indicate that the `*' operator was used. */
17862 else
17863 {
17864 /* The type of which the member is a member is given by the
17865 current SCOPE. */
17867 /* The next name will not be qualified. */
17871 /* Look for optional c++11 attributes. */
17875 /* Look for the optional cv-qualifier-seq. */
17877 }
17878 }
17879 /* If that didn't work we don't have a ptr-operator. */
17882 }
17885 }
17887 /* Parse an (optional) cv-qualifier-seq.
17889 cv-qualifier-seq:
17890 cv-qualifier cv-qualifier-seq [opt]
17892 cv-qualifier:
17893 const
17894 volatile
17896 GNU Extension:
17898 cv-qualifier:
17899 __restrict__
17901 Returns a bitmask representing the cv-qualifiers. */
17903 static cp_cv_quals
17905 {
17909 {
17911 cp_cv_quals cv_qualifier;
17913 /* Peek at the next token. */
17915 /* See if it's a cv-qualifier. */
17917 {
17933 }
17939 {
17942 }
17943 else
17944 {
17947 }
17948 }
17951 }
17953 /* Parse an (optional) ref-qualifier
17955 ref-qualifier:
17956 &
17957 &&
17959 Returns cp_ref_qualifier representing ref-qualifier. */
17961 static cp_ref_qualifier
17963 {
17966 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17971 {
17976 {
17988 }
17993 {
17996 }
17997 else
17998 {
18001 }
18002 }
18005 }
18007 /* Parse an (optional) virt-specifier-seq.
18009 virt-specifier-seq:
18010 virt-specifier virt-specifier-seq [opt]
18012 virt-specifier:
18013 override
18014 final
18016 Returns a bitmask representing the virt-specifiers. */
18018 static cp_virt_specifiers
18020 {
18024 {
18026 cp_virt_specifiers virt_specifier;
18028 /* Peek at the next token. */
18030 /* See if it's a virt-specifier-qualifier. */
18034 {
18037 }
18039 {
18042 }
18044 {
18046 }
18047 else
18051 {
18054 }
18055 else
18056 {
18059 }
18060 }
18062 }
18064 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18065 is in scope even though it isn't real. */
18067 void
18069 {
18070 tree this_parm;
18073 {
18074 /* We don't clear this between NSDMIs. Is it already what we want? */
18079 }
18082 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18084 current_class_ref
18087 }
18089 /* Return true iff our current scope is a non-static data member
18090 initializer. */
18092 bool
18094 {
18095 /* We recognize NSDMI context by the context-less 'this' pointer set up
18096 by the function above. */
18100 }
18102 /* Parse a late-specified return type, if any. This is not a separate
18103 non-terminal, but part of a function declarator, which looks like
18105 -> trailing-type-specifier-seq abstract-declarator(opt)
18107 Returns the type indicated by the type-id.
18109 In addition to this this parses any queued up omp declare simd
18110 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18112 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18113 function. */
18115 static tree
18117 cp_cv_quals quals)
18118 {
18122 && declarator
18128 /* Peek at the next token. */
18130 /* A late-specified return type is indicated by an initial '->'. */
18137 {
18138 /* DR 1207: 'this' is in scope in the trailing return type. */
18140 }
18143 {
18144 /* Consume the ->. */
18148 }
18151 declarator->std_attributes
18155 declarator->std_attributes
18160 {
18163 }
18166 }
18168 /* Parse a declarator-id.
18170 declarator-id:
18171 id-expression
18172 :: [opt] nested-name-specifier [opt] type-name
18174 In the `id-expression' case, the value returned is as for
18175 cp_parser_id_expression if the id-expression was an unqualified-id.
18176 If the id-expression was a qualified-id, then a SCOPE_REF is
18177 returned. The first operand is the scope (either a NAMESPACE_DECL
18178 or TREE_TYPE), but the second is still just a representation of an
18179 unqualified-id. */
18181 static tree
18183 {
18184 tree id;
18185 /* The expression must be an id-expression. Assume that qualified
18186 names are the names of types so that:
18188 template <class T>
18189 int S<T>::R::i = 3;
18191 will work; we must treat `S<T>::R' as the name of a type.
18192 Similarly, assume that qualified names are templates, where
18193 required, so that:
18195 template <class T>
18196 int S<T>::R<T>::i = 3;
18198 will work, too. */
18204 optional_p);
18208 }
18210 /* Parse a type-id.
18212 type-id:
18213 type-specifier-seq abstract-declarator [opt]
18215 Returns the TYPE specified. */
18217 static tree
18220 {
18221 cp_decl_specifier_seq type_specifier_seq;
18224 /* Parse the type-specifier-seq. */
18226 is_trailing_return,
18231 /* There might or might not be an abstract declarator. */
18233 /* Look for the declarator. */
18234 abstract_declarator
18239 /* Check to see if there really was a declarator. */
18244 /* None of the valid uses of 'auto' in C++14 involve the type-id
18245 nonterminal, but it is valid in a trailing-return-type. */
18248 {
18249 /* A type-id with type 'auto' is only ok if the abstract declarator
18250 is a function declarator with a late-specified return type. */
18255 else
18256 {
18259 }
18260 }
18263 is_template_arg);
18264 }
18267 {
18269 }
18272 {
18273 tree r;
18275 parser->type_definition_forbidden_message
18280 {
18283 }
18285 }
18288 {
18290 }
18292 /* Parse a type-specifier-seq.
18294 type-specifier-seq:
18295 type-specifier type-specifier-seq [opt]
18297 GNU extension:
18299 type-specifier-seq:
18300 attributes type-specifier-seq [opt]
18302 If IS_DECLARATION is true, we are at the start of a "condition" or
18303 exception-declaration, so we might be followed by a declarator-id.
18305 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18306 i.e. we've just seen "->".
18308 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18310 static void
18315 {
18320 /* Clear the TYPE_SPECIFIER_SEQ. */
18323 /* In the context of a trailing return type, enum E { } is an
18324 elaborated-type-specifier followed by a function-body, not an
18325 enum-specifier. */
18329 /* Parse the type-specifiers and attributes. */
18331 {
18332 tree type_specifier;
18335 /* Check for attributes first. */
18337 {
18342 }
18344 /* record the token of the beginning of the type specifier seq,
18345 for error reporting purposes*/
18349 /* Look for the type-specifier. */
18351 flags,
18352 type_specifier_seq,
18354 NULL,
18357 {
18358 /* If the first type-specifier could not be found, this is not a
18359 type-specifier-seq at all. */
18361 {
18362 /* Set in_declarator_p to avoid skipping to the semicolon. */
18374 }
18375 /* If subsequent type-specifiers could not be found, the
18376 type-specifier-seq is complete. */
18378 }
18381 /* The standard says that a condition can be:
18383 type-specifier-seq declarator = assignment-expression
18385 However, given:
18387 struct S {};
18388 if (int S = ...)
18390 we should treat the "S" as a declarator, not as a
18391 type-specifier. The standard doesn't say that explicitly for
18392 type-specifier-seq, but it does say that for
18393 decl-specifier-seq in an ordinary declaration. Perhaps it
18394 would be clearer just to allow a decl-specifier-seq here, and
18395 then add a semantic restriction that if any decl-specifiers
18396 that are not type-specifiers appear, the program is invalid. */
18399 }
18400 }
18402 /* Return whether the function currently being declared has an associated
18403 template parameter list. */
18405 static bool
18407 {
18420 }
18422 /* Parse a parameter-declaration-clause.
18424 parameter-declaration-clause:
18425 parameter-declaration-list [opt] ... [opt]
18426 parameter-declaration-list , ...
18428 Returns a representation for the parameter declarations. A return
18429 value of NULL indicates a parameter-declaration-clause consisting
18430 only of an ellipsis. */
18432 static tree
18434 {
18435 tree parameters;
18444 parser->auto_is_implicit_function_template_parm_p
18446 }
18452 && !processing_template_parmlist
18458 /* Peek at the next token. */
18460 /* Check for trivial parameter-declaration-clauses. */
18462 {
18463 /* Consume the `...' token. */
18466 }
18468 /* There are no parameters. */
18469 {
18470 #ifndef NO_IMPLICIT_EXTERN_C
18475 else
18476 #endif
18478 }
18479 /* Check for `(void)', too, which is a special case. */
18483 {
18484 /* Consume the `void' token. */
18486 /* There are no parameters. */
18488 }
18490 /* Parse the parameter-declaration-list. */
18492 /* If a parse error occurred while parsing the
18493 parameter-declaration-list, then the entire
18494 parameter-declaration-clause is erroneous. */
18498 /* Peek at the next token. */
18500 /* If it's a `,', the clause should terminate with an ellipsis. */
18502 {
18503 /* Consume the `,'. */
18505 /* Expect an ellipsis. */
18506 ellipsis_p
18508 }
18509 /* It might also be `...' if the optional trailing `,' was
18510 omitted. */
18512 {
18513 /* Consume the `...' token. */
18515 /* And remember that we saw it. */
18517 }
18518 else
18521 /* Finish the parameter list. */
18526 }
18528 /* Parse a parameter-declaration-list.
18530 parameter-declaration-list:
18531 parameter-declaration
18532 parameter-declaration-list , parameter-declaration
18534 Returns a representation of the parameter-declaration-list, as for
18535 cp_parser_parameter_declaration_clause. However, the
18536 `void_list_node' is never appended to the list. Upon return,
18537 *IS_ERROR will be true iff an error occurred. */
18539 static tree
18541 {
18547 /* Assume all will go well. */
18549 /* The special considerations that apply to a function within an
18550 unbraced linkage specifications do not apply to the parameters
18551 to the function. */
18552 saved_in_unbraced_linkage_specification_p
18556 /* Look for more parameters. */
18558 {
18566 /* Parse the parameter. */
18567 parameter
18572 /* We don't know yet if the enclosing context is deprecated, so wait
18573 and warn in grokparms if appropriate. */
18577 {
18578 /* If a function parameter pack was specified and an implicit template
18579 parameter was introduced during cp_parser_parameter_declaration,
18580 change any implicit parameters introduced into packs. */
18584 {
18592 }
18596 PARM,
18599 }
18603 /* If a parse error occurred parsing the parameter declaration,
18604 then the entire parameter-declaration-list is erroneous. */
18606 {
18610 }
18620 {
18624 }
18626 /* Add the new parameter to the list. */
18630 /* Peek at the next token. */
18633 /* These are for Objective-C++ */
18636 /* The parameter-declaration-list is complete. */
18639 {
18642 /* Peek at the next token. */
18644 /* If it's an ellipsis, then the list is complete. */
18647 /* Otherwise, there must be more parameters. Consume the
18648 `,'. */
18650 /* When parsing something like:
18652 int i(float f, double d)
18654 we can tell after seeing the declaration for "f" that we
18655 are not looking at an initialization of a variable "i",
18656 but rather at the declaration of a function "i".
18658 Due to the fact that the parsing of template arguments
18659 (as specified to a template-id) requires backtracking we
18660 cannot use this technique when inside a template argument
18661 list. */
18665 /* However, a parameter-declaration of the form
18666 "float(f)" (which is a valid declaration of a
18667 parameter "f") can also be interpreted as an
18668 expression (the conversion of "f" to "float"). */
18671 }
18672 else
18673 {
18681 }
18682 }
18684 parser->in_unbraced_linkage_specification_p
18687 /* Reset implicit_template_scope if we are about to leave the function
18688 parameter list that introduced it. Note that for out-of-line member
18689 definitions, there will be one or more class scopes before we get to
18690 the template parameter scope. */
18694 {
18698 {
18701 }
18702 }
18705 }
18707 /* Parse a parameter declaration.
18709 parameter-declaration:
18710 decl-specifier-seq ... [opt] declarator
18711 decl-specifier-seq declarator = assignment-expression
18712 decl-specifier-seq ... [opt] abstract-declarator [opt]
18713 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18715 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18716 declares a template parameter. (In that case, a non-nested `>'
18717 token encountered during the parsing of the assignment-expression
18718 is not interpreted as a greater-than operator.)
18720 Returns a representation of the parameter, or NULL if an error
18721 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18722 true iff the declarator is of the form "(p)". */
18728 {
18730 cp_decl_specifier_seq decl_specifiers;
18732 tree default_argument;
18736 /* In a template parameter, `>' is not an operator.
18738 [temp.param]
18740 When parsing a default template-argument for a non-type
18741 template-parameter, the first non-nested `>' is taken as the end
18742 of the template parameter-list rather than a greater-than
18743 operator. */
18745 /* Type definitions may not appear in parameter types. */
18747 parser->type_definition_forbidden_message
18750 /* Parse the declaration-specifiers. */
18752 CP_PARSER_FLAGS_NONE,
18756 /* Complain about missing 'typename' or other invalid type names. */
18761 /* If an error occurred, there's no reason to attempt to parse the
18762 rest of the declaration. */
18764 {
18767 }
18769 /* Peek at the next token. */
18772 /* If the next token is a `)', `,', `=', `>', or `...', then there
18773 is no declarator. However, when variadic templates are enabled,
18774 there may be a declarator following `...'. */
18779 {
18783 }
18784 /* Otherwise, there should be a declarator. */
18785 else
18786 {
18790 /* After seeing a decl-specifier-seq, if the next token is not a
18791 "(", there is no possibility that the code is a valid
18792 expression. Therefore, if parsing tentatively, we commit at
18793 this point. */
18795 /* In an expression context, having seen:
18797 (int((char ...
18799 we cannot be sure whether we are looking at a
18800 function-type (taking a "char" as a parameter) or a cast
18801 of some object of type "char" to "int". */
18807 /* Parse the declarator. */
18810 CP_PARSER_DECLARATOR_EITHER,
18812 parenthesized_p,
18816 /* After the declarator, allow more attributes. */
18817 decl_specifiers.attributes
18820 }
18822 /* If the next token is an ellipsis, and we have not seen a
18823 declarator name, and the type of the declarator contains parameter
18824 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18825 a parameter pack expansion expression. Otherwise, leave the
18826 ellipsis for a C-style variadic function. */
18829 {
18840 {
18841 /* Consume the `...'. */
18845 /* Build a pack expansion type */
18848 else
18850 }
18851 }
18853 /* The restriction on defining new types applies only to the type
18854 of the parameter, not to the default argument. */
18857 /* If the next token is `=', then process a default argument. */
18859 {
18861 /* If we are defining a class, then the tokens that make up the
18862 default argument must be saved and processed later. */
18867 /* Outside of a class definition, we can just parse the
18868 assignment-expression. */
18869 else
18870 default_argument
18874 {
18877 else
18878 {
18880 "default arguments are only "
18883 }
18884 }
18888 {
18889 /* Find the name of the parameter pack. */
18896 template_parm_p
18902 else
18904 template_parm_p
18911 }
18912 }
18913 else
18917 declarator,
18918 default_argument);
18919 }
18921 /* Parse a default argument and return it.
18923 TEMPLATE_PARM_P is true if this is a default argument for a
18924 non-type template parameter. */
18925 static tree
18927 {
18933 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18934 set correctly. */
18937 /* Local variable names (and the `this' keyword) may not
18938 appear in a default argument. */
18941 /* Parse the assignment-expression. */
18946 /* The "this" pointer is not valid in a default argument. */
18948 {
18953 }
18954 default_argument
18956 /* Restore the "this" pointer. */
18958 {
18961 }
18970 }
18972 /* Parse a function-body.
18974 function-body:
18975 compound_statement */
18977 static void
18979 {
18981 }
18983 /* Parse a ctor-initializer-opt followed by a function-body. Return
18984 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18985 is true we are parsing a function-try-block. */
18987 static bool
18990 {
18998 /* Begin the function body. */
19000 /* Parse the optional ctor-initializer. */
19003 /* If we're parsing a constexpr constructor definition, we need
19004 to check that the constructor body is indeed empty. However,
19005 before we get to cp_parser_function_body lot of junk has been
19006 generated, so we can't just check that we have an empty block.
19007 Rather we take a snapshot of the outermost block, and check whether
19008 cp_parser_function_body changed its state. */
19010 {
19014 }
19015 /* Parse the function-body. */
19019 /* Finish the function body. */
19023 }
19025 /* Parse an initializer.
19027 initializer:
19028 = initializer-clause
19029 ( expression-list )
19031 Returns an expression representing the initializer. If no
19032 initializer is present, NULL_TREE is returned.
19034 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19035 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19036 set to TRUE if there is no initializer present. If there is an
19037 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19038 is set to true; otherwise it is set to false. */
19040 static tree
19043 {
19045 tree init;
19047 /* Peek at the next token. */
19050 /* Let our caller know whether or not this initializer was
19051 parenthesized. */
19053 /* Assume that the initializer is constant. */
19057 {
19058 /* Consume the `='. */
19060 /* Parse the initializer-clause. */
19062 }
19064 {
19069 non_constant_p);
19074 }
19076 {
19081 }
19082 else
19083 {
19084 /* Anything else is an error. */
19087 }
19090 }
19092 /* Parse an initializer-clause.
19094 initializer-clause:
19095 assignment-expression
19096 braced-init-list
19098 Returns an expression representing the initializer.
19100 If the `assignment-expression' production is used the value
19101 returned is simply a representation for the expression.
19103 Otherwise, calls cp_parser_braced_list. */
19105 static tree
19107 {
19108 tree initializer;
19110 /* Assume the expression is constant. */
19113 /* If it is not a `{', then we are looking at an
19114 assignment-expression. */
19116 {
19117 initializer
19120 non_constant_p);
19121 }
19122 else
19126 }
19128 /* Parse a brace-enclosed initializer list.
19130 braced-init-list:
19131 { initializer-list , [opt] }
19132 { }
19134 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19135 the elements of the initializer-list (or NULL, if the last
19136 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19137 NULL_TREE. There is no way to detect whether or not the optional
19138 trailing `,' was provided. NON_CONSTANT_P is as for
19139 cp_parser_initializer. */
19141 static tree
19143 {
19144 tree initializer;
19146 /* Consume the `{' token. */
19148 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19150 /* If it's not a `}', then there is a non-trivial initializer. */
19152 {
19153 /* Parse the initializer list. */
19156 /* A trailing `,' token is allowed. */
19159 }
19160 else
19162 /* Now, there should be a trailing `}'. */
19166 }
19168 /* Consume tokens up to, and including, the next non-nested closing `]'.
19169 Returns true iff we found a closing `]'. */
19171 static bool
19173 {
19177 {
19181 {
19184 /* If we've run out of tokens, then there is no closing `]'. */
19193 {
19196 }
19201 }
19203 /* Consume the token. */
19205 }
19206 }
19208 /* Return true if we are looking at an array-designator, false otherwise. */
19210 static bool
19212 {
19213 /* Consume the `['. */
19218 /* Skip tokens until the next token is a closing square bracket.
19219 If we find the closing `]', and the next token is a `=', then
19220 we are looking at an array designator. */
19221 bool array_designator_p
19225 /* Roll back the tokens we skipped. */
19229 }
19231 /* Parse an initializer-list.
19233 initializer-list:
19234 initializer-clause ... [opt]
19235 initializer-list , initializer-clause ... [opt]
19237 GNU Extension:
19239 initializer-list:
19240 designation initializer-clause ...[opt]
19241 initializer-list , designation initializer-clause ...[opt]
19243 designation:
19244 . identifier =
19245 identifier :
19246 [ constant-expression ] =
19248 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19249 for the initializer. If the INDEX of the elt is non-NULL, it is the
19250 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19251 as for cp_parser_initializer. */
19255 {
19258 /* Assume all of the expressions are constant. */
19261 /* Parse the rest of the list. */
19263 {
19265 tree designator;
19266 tree initializer;
19269 /* If the next token is an identifier and the following one is a
19270 colon, we are looking at the GNU designated-initializer
19271 syntax. */
19275 {
19276 /* Warn the user that they are using an extension. */
19279 /* Consume the identifier. */
19281 /* Consume the `:'. */
19283 }
19284 /* Also handle the C99 syntax, '. id ='. */
19289 {
19290 /* Warn the user that they are using an extension. */
19293 /* Consume the `.'. */
19295 /* Consume the identifier. */
19297 /* Consume the `='. */
19299 }
19300 /* Also handle C99 array designators, '[ const ] ='. */
19304 {
19305 /* In C++11, [ could start a lambda-introducer. */
19311 {
19314 }
19315 else
19316 {
19321 }
19327 }
19328 else
19331 /* Parse the initializer. */
19334 /* If any clause is non-constant, so is the entire initializer. */
19338 /* If we have an ellipsis, this is an initializer pack
19339 expansion. */
19341 {
19342 /* Consume the `...'. */
19345 /* Turn the initializer into an initializer expansion. */
19347 }
19349 /* Add it to the vector. */
19352 /* If the next token is not a comma, we have reached the end of
19353 the list. */
19357 /* Peek at the next token. */
19359 /* If the next token is a `}', then we're still done. An
19360 initializer-clause can have a trailing `,' after the
19361 initializer-list and before the closing `}'. */
19365 /* Consume the `,' token. */
19367 }
19370 }
19372 /* Classes [gram.class] */
19374 /* Parse a class-name.
19376 class-name:
19377 identifier
19378 template-id
19380 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19381 to indicate that names looked up in dependent types should be
19382 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19383 keyword has been used to indicate that the name that appears next
19384 is a template. TAG_TYPE indicates the explicit tag given before
19385 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19386 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19387 is the class being defined in a class-head.
19389 Returns the TYPE_DECL representing the class. */
19391 static tree
19399 {
19400 tree decl;
19401 tree scope;
19406 /* All class-names start with an identifier. */
19409 {
19412 }
19414 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19415 to a template-id, so we save it here. */
19420 /* Any name names a type if we're following the `typename' keyword
19421 in a qualified name where the enclosing scope is type-dependent. */
19424 /* Handle the common case (an identifier, but not a template-id)
19425 efficiently. */
19428 {
19432 /* Look for the identifier. */
19436 /* If the next token isn't an identifier, we are certainly not
19437 looking at a class-name. */
19440 /* If we know this is a type-name, there's no need to look it
19441 up. */
19444 else
19445 {
19446 tree ambiguous_decls;
19447 /* If we already know that this lookup is ambiguous, then
19448 we've already issued an error message; there's no reason
19449 to check again. */
19451 {
19454 }
19455 /* If the next token is a `::', then the name must be a type
19456 name.
19458 [basic.lookup.qual]
19460 During the lookup for a name preceding the :: scope
19461 resolution operator, object, function, and enumerator
19462 names are ignored. */
19465 /* Look up the name. */
19467 tag_type,
19470 check_dependency_p,
19474 {
19478 }
19479 }
19480 }
19481 else
19482 {
19483 /* Try a template-id. */
19485 check_dependency_p,
19486 tag_type,
19487 is_declaration);
19490 }
19494 /* If this is a typename, create a TYPENAME_TYPE. */
19496 {
19501 }
19505 /* Check to see that it is really the name of a class. */
19509 /* Situations like this:
19511 template <typename T> struct A {
19512 typename T::template X<int>::I i;
19513 };
19515 are problematic. Is `T::template X<int>' a class-name? The
19516 standard does not seem to be definitive, but there is no other
19517 valid interpretation of the following `::'. Therefore, those
19518 names are considered class-names. */
19519 {
19523 }
19527 /* In Objective-C 2.0, a classname followed by '.' starts a
19528 dot-syntax expression, and it's not a type-name. */
19540 }
19542 /* Parse a class-specifier.
19544 class-specifier:
19545 class-head { member-specification [opt] }
19547 Returns the TREE_TYPE representing the class. */
19549 static tree
19551 {
19552 tree type;
19566 /* Parse the class-head. */
19569 /* If the class-head was a semantic disaster, skip the entire body
19570 of the class. */
19572 {
19576 }
19578 /* Look for the `{'. */
19580 {
19583 }
19587 /* Issue an error message if type-definitions are forbidden here. */
19589 /* Remember that we are defining one more class. */
19591 /* Inside the class, surrounding template-parameter-lists do not
19592 apply. */
19593 saved_num_template_parameter_lists
19596 /* We are not in a function body. */
19599 /* Or in a loop. */
19602 /* Or in a switch. */
19605 /* We are not immediately inside an extern "lang" block. */
19606 saved_in_unbraced_linkage_specification_p
19610 /* Start the class. */
19612 {
19615 }
19619 /* If the type is erroneous, skip the entire body of the class. */
19621 else
19622 /* Parse the member-specification. */
19625 /* Look for the trailing `}'. */
19627 /* Look for trailing attributes to apply to this class. */
19635 /* We've finished a type definition. Check for the common syntax
19636 error of forgetting a semicolon after the definition. We need to
19637 be careful, as we can't just check for not-a-semicolon and be done
19638 with it; the user might have typed:
19640 class X { } c = ...;
19641 class X { } *p = ...;
19643 and so forth. Instead, enumerate all the possible tokens that
19644 might follow this production; if we don't see one of them, then
19645 complain and silently insert the semicolon. */
19646 {
19651 /* Don't try to parse c++11 attributes here. As per the
19652 grammar, that should be a task for
19653 cp_parser_decl_specifier_seq. */
19657 {
19668 /* While it's legal for type qualifiers and storage class
19669 specifiers to follow type definitions in the grammar, only
19670 compiler testsuites contain code like that. Assume that if
19671 we see such code, then what we're really seeing is a case
19672 like:
19674 class X { }
19675 const <type> var = ...;
19677 or
19679 class Y { }
19680 static <type> func (...) ...
19682 i.e. the qualifier or specifier applies to the next
19683 declaration. To do so, however, we need to look ahead one
19684 more token to see if *that* token is a type specifier.
19686 This code could be improved to handle:
19688 class Z { }
19689 static const <type> var = ...; */
19692 {
19695 /* Handling user-defined types here would be nice, but very
19696 tricky. */
19697 want_semicolon
19700 }
19704 }
19706 /* If we don't have a type, then something is very wrong and we
19707 shouldn't try to do anything clever. Likewise for not seeing the
19708 closing brace. */
19710 {
19711 cp_token_position prev
19722 else
19725 /* Unget one token and smash it to look as though we encountered
19726 a semicolon in the input stream. */
19731 }
19732 }
19734 /* If this class is not itself within the scope of another class,
19735 then we need to parse the bodies of all of the queued function
19736 definitions. Note that the queued functions defined in a class
19737 are not always processed immediately following the
19738 class-specifier for that class. Consider:
19740 struct A {
19741 struct B { void f() { sizeof (A); } };
19742 };
19744 If `f' were processed before the processing of `A' were
19745 completed, there would be no way to compute the size of `A'.
19746 Note that the nesting we are interested in here is lexical --
19747 not the semantic nesting given by TYPE_CONTEXT. In particular,
19748 for:
19750 struct A { struct B; };
19751 struct A::B { void f() { } };
19753 there is no need to delay the parsing of `A::B::f'. */
19755 {
19756 tree decl;
19763 /* In a first pass, parse default arguments to the functions.
19764 Then, in a second pass, parse the bodies of the functions.
19765 This two-phased approach handles cases like:
19767 struct S {
19768 void f() { g(); }
19769 void g(int i = 3);
19770 };
19772 */
19774 {
19776 /* If there are default arguments that have not yet been processed,
19777 take care of them now. */
19779 {
19784 }
19785 /* Make sure that any template parameters are in scope. */
19787 /* Parse the default argument expressions. */
19789 /* Remove any template parameters from the symbol table. */
19791 }
19793 /* Now parse any NSDMIs. */
19797 {
19799 {
19804 }
19807 }
19814 /* Now do some post-NSDMI bookkeeping. */
19820 /* Now parse the body of the functions. */
19822 {
19823 /* OpenMP UDRs need to be parsed before all other functions. */
19830 }
19831 else
19835 }
19836 else
19839 /* Put back any saved access checks. */
19842 /* Restore saved state. */
19846 parser->num_template_parameter_lists
19848 parser->in_unbraced_linkage_specification_p
19852 }
19854 static tree
19856 {
19857 tree ret;
19862 }
19864 /* Parse a class-head.
19866 class-head:
19867 class-key identifier [opt] base-clause [opt]
19868 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19869 class-key nested-name-specifier [opt] template-id
19870 base-clause [opt]
19872 class-virt-specifier:
19873 final
19875 GNU Extensions:
19876 class-key attributes identifier [opt] base-clause [opt]
19877 class-key attributes nested-name-specifier identifier base-clause [opt]
19878 class-key attributes nested-name-specifier [opt] template-id
19879 base-clause [opt]
19881 Upon return BASES is initialized to the list of base classes (or
19882 NULL, if there are none) in the same form returned by
19883 cp_parser_base_clause.
19885 Returns the TYPE of the indicated class. Sets
19886 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19887 involving a nested-name-specifier was used, and FALSE otherwise.
19889 Returns error_mark_node if this is not a class-head.
19891 Returns NULL_TREE if the class-head is syntactically valid, but
19892 semantically invalid in a way that means we should skip the entire
19893 body of the class. */
19895 static tree
19898 {
19899 tree nested_name_specifier;
19903 tree attributes;
19904 tree bases;
19914 /* Assume no nested-name-specifier will be present. */
19916 /* Assume no template parameter lists will be used in defining the
19917 type. */
19921 /* Look for the class-key. */
19926 /* Parse the attributes. */
19929 /* If the next token is `::', that is invalid -- but sometimes
19930 people do try to write:
19932 struct ::S {};
19934 Handle this gracefully by accepting the extra qualifier, and then
19935 issuing an error about it later if this really is a
19936 class-head. If it turns out just to be an elaborated type
19937 specifier, remain silent. */
19943 /* Determine the name of the class. Begin by looking for an
19944 optional nested-name-specifier. */
19946 nested_name_specifier
19952 /* If there was a nested-name-specifier, then there *must* be an
19953 identifier. */
19955 {
19957 /* Although the grammar says `identifier', it really means
19958 `class-name' or `template-name'. You are only allowed to
19959 define a class that has already been declared with this
19960 syntax.
19962 The proposed resolution for Core Issue 180 says that wherever
19963 you see `class T::X' you should treat `X' as a type-name.
19965 It is OK to define an inaccessible class; for example:
19967 class A { class B; };
19968 class A::B {};
19970 We do not know if we will see a class-name, or a
19971 template-name. We look for a class-name first, in case the
19972 class-name is a template-id; if we looked for the
19973 template-name first we would stop after the template-name. */
19978 class_type,
19982 /* If that didn't work, ignore the nested-name-specifier. */
19984 {
19990 }
19991 /* If we could not find a corresponding TYPE, treat this
19992 declaration like an unqualified declaration. */
19995 /* Otherwise, count the number of templates used in TYPE and its
19996 containing scopes. */
19997 else
19998 {
19999 tree scope;
20011 }
20012 }
20013 /* Otherwise, the identifier is optional. */
20014 else
20015 {
20016 /* We don't know whether what comes next is a template-id,
20017 an identifier, or nothing at all. */
20019 /* Check for a template-id. */
20024 class_key,
20026 /* If that didn't work, it could still be an identifier. */
20028 {
20030 {
20033 }
20034 else
20036 }
20037 else
20038 {
20041 }
20042 }
20047 {
20049 class_key,
20051 }
20054 /* If it's not a `:' or a `{' then we can't really be looking at a
20055 class-head, since a class-head only appears as part of a
20056 class-specifier. We have to detect this situation before calling
20057 xref_tag, since that has irreversible side-effects. */
20059 {
20063 }
20065 /* At this point, we're going ahead with the class-specifier, even
20066 if some other problem occurs. */
20069 {
20074 }
20075 /* Issue the error about the overly-qualified name now. */
20077 {
20082 }
20084 {
20089 }
20091 {
20092 tree scope;
20094 /* Reject typedef-names in class heads. */
20096 {
20099 type);
20102 }
20104 /* Figure out in what scope the declaration is being placed. */
20106 /* If that scope does not contain the scope in which the
20107 class was originally declared, the program is invalid. */
20109 {
20112 "declaration of %qD in namespace %qD which does not "
20115 else
20121 }
20122 /* [dcl.meaning]
20124 A declarator-id shall not be qualified except for the
20125 definition of a ... nested class outside of its class
20126 ... [or] the definition or explicit instantiation of a
20127 class member of a namespace outside of its namespace. */
20129 {
20134 }
20135 }
20136 /* An explicit-specialization must be preceded by "template <>". If
20137 it is not, try to recover gracefully. */
20141 {
20145 /* Take the same action that would have been taken by
20146 cp_parser_explicit_specialization. */
20149 }
20150 /* There must be no "return" statements between this point and the
20151 end of this function; set "type "to the correct return value and
20152 use "goto done;" to return. */
20153 /* Make sure that the right number of template parameters were
20154 present. */
20158 {
20159 /* If something went wrong, there is no point in even trying to
20160 process the class-definition. */
20163 }
20165 /* Look up the type. */
20167 {
20171 {
20175 }
20176 else
20177 {
20180 }
20183 }
20185 {
20186 tree class_type;
20188 /* Given:
20190 template <typename T> struct S { struct T };
20191 template <typename T> struct S<T>::T { };
20193 we will get a TYPENAME_TYPE when processing the definition of
20194 `S::T'. We need to resolve it to the actual type before we
20195 try to define it. */
20197 {
20202 else
20203 {
20206 }
20207 }
20211 {
20214 }
20217 /* Enter the scope indicated by the nested-name-specifier. */
20219 /* Get the canonical version of this type. */
20221 /* Call push_template_decl if it seems like we should be defining a
20222 template either from the template headers or the type we're
20223 defining, so that we diagnose both extra and missing headers. */
20227 {
20230 {
20233 }
20234 }
20238 }
20240 {
20241 /* If the class was unnamed, create a dummy name. */
20246 }
20248 /* Indicate whether this class was declared as a `class' or as a
20249 `struct'. */
20254 /* If this type was already complete, and we see another definition,
20255 that's an error. */
20257 {
20259 type);
20261 type);
20264 }
20269 {
20270 /* Apply attributes now, before any use of the class as a template
20271 argument in its base list. */
20274 }
20276 /* We will have entered the scope containing the class; the names of
20277 base classes should be looked up in that context. For example:
20279 struct A { struct B {}; struct C; };
20280 struct A::C : B {};
20282 is valid. */
20284 /* Get the list of base-classes, if there is one. */
20286 {
20287 /* PR59482: enter the class scope so that base-specifiers are looked
20288 up correctly. */
20292 /* PR59482: get out of the previously pushed class scope so that the
20293 subsequent pops pop the right thing. */
20296 }
20297 else
20300 /* If we're really defining a class, process the base classes.
20301 If they're invalid, fail. */
20306 done:
20307 /* Leave the scope given by the nested-name-specifier. We will
20308 enter the class scope itself while processing the members. */
20313 {
20316 }
20322 out:
20325 }
20327 /* Parse a class-key.
20329 class-key:
20330 class
20331 struct
20332 union
20334 Returns the kind of class-key specified, or none_type to indicate
20335 error. */
20337 static enum tag_types
20339 {
20343 /* Look for the class-key. */
20348 /* Check to see if the TOKEN is a class-key. */
20353 }
20355 /* Parse a type-parameter-key.
20357 type-parameter-key:
20358 class
20359 typename
20360 */
20362 static void
20364 {
20365 /* Look for the type-parameter-key. */
20369 {
20372 /* typename is not allowed in a template template parameter
20373 by the standard until C++1Z. */
20375 "ISO C++ forbids typename key in template template parameter;"
20377 }
20378 else
20382 }
20384 /* Parse an (optional) member-specification.
20386 member-specification:
20387 member-declaration member-specification [opt]
20388 access-specifier : member-specification [opt] */
20390 static void
20392 {
20394 {
20398 /* Peek at the next token. */
20400 /* If it's a `}', or EOF then we've seen all the members. */
20406 /* See if this token is a keyword. */
20409 {
20413 /* Consume the access-specifier. */
20415 /* Remember which access-specifier is active. */
20417 /* Look for the `:'. */
20422 /* Accept #pragmas at class scope. */
20424 {
20427 }
20429 /* Otherwise, the next construction must be a
20430 member-declaration. */
20432 }
20433 }
20434 }
20436 /* Parse a member-declaration.
20438 member-declaration:
20439 decl-specifier-seq [opt] member-declarator-list [opt] ;
20440 function-definition ; [opt]
20441 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20442 using-declaration
20443 template-declaration
20444 alias-declaration
20446 member-declarator-list:
20447 member-declarator
20448 member-declarator-list , member-declarator
20450 member-declarator:
20451 declarator pure-specifier [opt]
20452 declarator constant-initializer [opt]
20453 identifier [opt] : constant-expression
20455 GNU Extensions:
20457 member-declaration:
20458 __extension__ member-declaration
20460 member-declarator:
20461 declarator attributes [opt] pure-specifier [opt]
20462 declarator attributes [opt] constant-initializer [opt]
20463 identifier [opt] attributes [opt] : constant-expression
20465 C++0x Extensions:
20467 member-declaration:
20468 static_assert-declaration */
20470 static void
20472 {
20473 cp_decl_specifier_seq decl_specifiers;
20474 tree prefix_attributes;
20475 tree decl;
20484 /* Check for the `__extension__' keyword. */
20486 {
20487 /* Recurse. */
20489 /* Restore the old value of the PEDANTIC flag. */
20493 }
20495 /* Check for a template-declaration. */
20497 {
20498 /* An explicit specialization here is an error condition, and we
20499 expect the specialization handler to detect and report this. */
20503 else
20507 }
20509 /* Check for a using-declaration. */
20511 {
20513 {
20514 /* Parse the using-declaration. */
20518 }
20519 else
20520 {
20521 tree decl;
20525 /* Note that if we actually see the '=' token after the
20526 identifier, cp_parser_alias_declaration commits the
20527 tentative parse. In that case, we really expects an
20528 alias-declaration. Otherwise, we expect a using
20529 declaration. */
20530 alias_decl_expected =
20536 else
20540 }
20541 }
20543 /* Check for @defs. */
20545 {
20550 {
20555 }
20557 }
20559 /* If the next token is `static_assert' we have a static assertion. */
20561 {
20564 }
20571 /* Parse the decl-specifier-seq. */
20574 CP_PARSER_FLAGS_OPTIONAL,
20577 /* Check for an invalid type-name. */
20581 /* If there is no declarator, then the decl-specifier-seq should
20582 specify a type. */
20584 {
20585 /* If there was no decl-specifier-seq, and the next token is a
20586 `;', then we have something like:
20588 struct S { ; };
20590 [class.mem]
20592 Each member-declaration shall declare at least one member
20593 name of the class. */
20595 {
20599 }
20600 else
20601 {
20602 tree type;
20604 /* See if this declaration is a friend. */
20606 /* If there were decl-specifiers, check to see if there was
20607 a class-declaration. */
20610 /* Nested classes have already been added to the class, but
20611 a `friend' needs to be explicitly registered. */
20613 {
20614 /* If the `friend' keyword was present, the friend must
20615 be introduced with a class-key. */
20618 "in C++03 a class-key must be used "
20620 /* In this case:
20622 template <typename T> struct A {
20623 friend struct A<T>::B;
20624 };
20626 A<T>::B will be represented by a TYPENAME_TYPE, and
20627 therefore not recognized by check_tag_decl. */
20629 {
20633 }
20636 "friend declaration does not name a class or "
20638 else
20641 }
20642 /* If there is no TYPE, an error message will already have
20643 been issued. */
20645 ;
20646 /* An anonymous aggregate has to be handled specially; such
20647 a declaration really declares a data member (with a
20648 particular type), as opposed to a nested class. */
20650 {
20651 /* C++11 9.5/6. */
20654 "a storage class on an anonymous aggregate "
20657 /* Remove constructors and such from TYPE, now that we
20658 know it is an anonymous aggregate. */
20660 /* And make the corresponding data member. */
20663 /* Add it to the class. */
20665 }
20666 else
20667 cp_parser_check_access_in_redeclaration
20670 }
20671 }
20672 else
20673 {
20676 /* Clear attributes from the decl_specifiers but keep them
20677 around as prefix attributes that apply them to the entity
20678 being declared. */
20682 /* See if these declarations will be friends. */
20685 /* Keep going until we hit the `;' at the end of the
20686 declaration. */
20688 {
20690 tree first_attribute;
20692 /* Peek at the next token. */
20695 /* Check for a bitfield declaration. */
20700 {
20701 tree identifier;
20702 tree width;
20704 /* Get the name of the bitfield. Note that we cannot just
20705 check TOKEN here because it may have been invalidated by
20706 the call to cp_lexer_peek_nth_token above. */
20709 else
20712 /* Consume the `:' token. */
20714 /* Get the width of the bitfield. */
20715 width
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 }
21042 }
21044 /* Derived classes [gram.class.derived] */
21046 /* Parse a base-clause.
21048 base-clause:
21049 : base-specifier-list
21051 base-specifier-list:
21052 base-specifier ... [opt]
21053 base-specifier-list , base-specifier ... [opt]
21055 Returns a TREE_LIST representing the base-classes, in the order in
21056 which they were declared. The representation of each node is as
21057 described by cp_parser_base_specifier.
21059 In the case that no bases are specified, this function will return
21060 NULL_TREE, not ERROR_MARK_NODE. */
21062 static tree
21064 {
21067 /* Look for the `:' that begins the list. */
21070 /* Scan the base-specifier-list. */
21072 {
21074 tree base;
21077 /* Look for the base-specifier. */
21079 /* Look for the (optional) ellipsis. */
21081 {
21082 /* Consume the `...'. */
21086 }
21088 /* Add BASE to the front of the list. */
21090 {
21092 /* Make this a pack expansion type. */
21096 {
21099 }
21100 }
21101 /* Peek at the next token. */
21103 /* If it's not a comma, then the list is complete. */
21106 /* Consume the `,'. */
21108 }
21110 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21111 base class had a qualified name. However, the next name that
21112 appears is certainly not qualified. */
21118 }
21120 /* Parse a base-specifier.
21122 base-specifier:
21123 :: [opt] nested-name-specifier [opt] class-name
21124 virtual access-specifier [opt] :: [opt] nested-name-specifier
21125 [opt] class-name
21126 access-specifier virtual [opt] :: [opt] nested-name-specifier
21127 [opt] class-name
21129 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21130 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21131 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21132 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21134 static tree
21136 {
21144 tree type;
21146 /* Process the optional `virtual' and `access-specifier'. */
21148 {
21149 /* Peek at the next token. */
21151 /* Process `virtual'. */
21153 {
21155 /* If `virtual' appears more than once, issue an error. */
21157 {
21161 }
21165 /* Consume the `virtual' token. */
21173 /* If more than one access specifier appears, issue an
21174 error. */
21177 {
21181 }
21185 /* Consume the access-specifier. */
21193 }
21194 }
21195 /* It is not uncommon to see programs mechanically, erroneously, use
21196 the 'typename' keyword to denote (dependent) qualified types
21197 as base classes. */
21199 {
21204 else
21206 "keyword %<typename%> not allowed in this context "
21209 }
21211 /* Look for the optional `::' operator. */
21213 /* Look for the nested-name-specifier. The simplest way to
21214 implement:
21216 [temp.res]
21218 The keyword `typename' is not permitted in a base-specifier or
21219 mem-initializer; in these contexts a qualified name that
21220 depends on a template-parameter is implicitly assumed to be a
21221 type name.
21223 is to pretend that we have seen the `typename' keyword at this
21224 point. */
21228 typename_type,
21230 /* If the base class is given by a qualified name, assume that names
21231 we see are type names or templates, as appropriate. */
21237 /* DR 950 allows decltype as a base-specifier. */
21239 else
21240 {
21241 /* Otherwise, look for the class-name. */
21243 class_scope_p,
21244 template_p,
21245 typename_type,
21250 }
21256 }
21258 /* Exception handling [gram.exception] */
21260 /* Parse an (optional) noexcept-specification.
21262 noexcept-specification:
21263 noexcept ( constant-expression ) [opt]
21265 If no noexcept-specification is present, returns NULL_TREE.
21266 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21267 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21268 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21269 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21270 in which case a boolean condition is returned instead. */
21272 static tree
21277 {
21281 /* Peek at the next token. */
21284 /* Is it a noexcept-specification? */
21286 {
21287 tree expr;
21291 {
21295 {
21296 /* Types may not be defined in an exception-specification. */
21298 parser->type_definition_forbidden_message
21303 /* Restore the saved message. */
21305 }
21306 else
21307 {
21310 }
21313 }
21314 else
21315 {
21319 }
21321 /* We cannot build a noexcept-spec right away because this will check
21322 that expr is a constexpr. */
21325 else
21327 }
21328 else
21330 }
21332 /* Parse an (optional) exception-specification.
21334 exception-specification:
21335 throw ( type-id-list [opt] )
21337 Returns a TREE_LIST representing the exception-specification. The
21338 TREE_VALUE of each node is a type. */
21340 static tree
21342 {
21344 tree type_id_list;
21347 /* Peek at the next token. */
21350 /* Is it a noexcept-specification? */
21356 /* If it's not `throw', then there's no exception-specification. */
21360 #if 0
21361 /* Enable this once a lot of code has transitioned to noexcept? */
21365 #endif
21367 /* Consume the `throw'. */
21370 /* Look for the `('. */
21373 /* Peek at the next token. */
21375 /* If it's not a `)', then there is a type-id-list. */
21377 {
21378 /* Types may not be defined in an exception-specification. */
21380 parser->type_definition_forbidden_message
21382 /* Parse the type-id-list. */
21384 /* Restore the saved message. */
21386 }
21387 else
21390 /* Look for the `)'. */
21394 }
21396 /* Parse an (optional) type-id-list.
21398 type-id-list:
21399 type-id ... [opt]
21400 type-id-list , type-id ... [opt]
21402 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21403 in the order that the types were presented. */
21405 static tree
21407 {
21411 {
21413 tree type;
21415 /* Get the next type-id. */
21417 /* Parse the optional ellipsis. */
21419 {
21420 /* Consume the `...'. */
21423 /* Turn the type into a pack expansion expression. */
21425 }
21426 /* Add it to the list. */
21428 /* Peek at the next token. */
21430 /* If it is not a `,', we are done. */
21433 /* Consume the `,'. */
21435 }
21438 }
21440 /* Parse a try-block.
21442 try-block:
21443 try compound-statement handler-seq */
21445 static tree
21447 {
21448 tree try_block;
21462 }
21464 /* Parse a function-try-block.
21466 function-try-block:
21467 try ctor-initializer [opt] function-body handler-seq */
21469 static bool
21471 {
21472 tree compound_stmt;
21473 tree try_block;
21476 /* Look for the `try' keyword. */
21479 /* Let the rest of the front end know where we are. */
21481 /* Parse the function-body. */
21482 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21484 /* We're done with the `try' part. */
21486 /* Parse the handlers. */
21488 /* We're done with the handlers. */
21492 }
21494 /* Parse a handler-seq.
21496 handler-seq:
21497 handler handler-seq [opt] */
21499 static void
21501 {
21503 {
21506 /* Parse the handler. */
21508 /* Peek at the next token. */
21510 /* If it's not `catch' then there are no more handlers. */
21513 }
21514 }
21516 /* Parse a handler.
21518 handler:
21519 catch ( exception-declaration ) compound-statement */
21521 static void
21523 {
21524 tree handler;
21525 tree declaration;
21535 }
21537 /* Parse an exception-declaration.
21539 exception-declaration:
21540 type-specifier-seq declarator
21541 type-specifier-seq abstract-declarator
21542 type-specifier-seq
21543 ...
21545 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21546 ellipsis variant is used. */
21548 static tree
21550 {
21551 cp_decl_specifier_seq type_specifiers;
21555 /* If it's an ellipsis, it's easy to handle. */
21557 {
21558 /* Consume the `...' token. */
21561 }
21563 /* Types may not be defined in exception-declarations. */
21565 parser->type_definition_forbidden_message
21568 /* Parse the type-specifier-seq. */
21572 /* If it's a `)', then there is no declarator. */
21575 else
21582 /* Restore the saved message. */
21589 }
21591 /* Parse a throw-expression.
21593 throw-expression:
21594 throw assignment-expression [opt]
21596 Returns a THROW_EXPR representing the throw-expression. */
21598 static tree
21600 {
21601 tree expression;
21606 /* Figure out whether or not there is an assignment-expression
21607 following the "throw" keyword. */
21615 else
21619 }
21621 /* GNU Extensions */
21623 /* Parse an (optional) asm-specification.
21625 asm-specification:
21626 asm ( string-literal )
21628 If the asm-specification is present, returns a STRING_CST
21629 corresponding to the string-literal. Otherwise, returns
21630 NULL_TREE. */
21632 static tree
21634 {
21636 tree asm_specification;
21638 /* Peek at the next token. */
21640 /* If the next token isn't the `asm' keyword, then there's no
21641 asm-specification. */
21645 /* Consume the `asm' token. */
21647 /* Look for the `('. */
21650 /* Look for the string-literal. */
21653 /* Look for the `)'. */
21657 }
21659 /* Parse an asm-operand-list.
21661 asm-operand-list:
21662 asm-operand
21663 asm-operand-list , asm-operand
21665 asm-operand:
21666 string-literal ( expression )
21667 [ string-literal ] string-literal ( expression )
21669 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21670 each node is the expression. The TREE_PURPOSE is itself a
21671 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21672 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21673 is a STRING_CST for the string literal before the parenthesis. Returns
21674 ERROR_MARK_NODE if any of the operands are invalid. */
21676 static tree
21678 {
21683 {
21684 tree string_literal;
21685 tree expression;
21686 tree name;
21689 {
21690 /* Consume the `[' token. */
21692 /* Read the operand name. */
21697 /* Look for the closing `]'. */
21699 }
21700 else
21702 /* Look for the string-literal. */
21705 /* Look for the `('. */
21707 /* Parse the expression. */
21709 /* Look for the `)'. */
21717 /* Add this operand to the list. */
21719 expression,
21720 asm_operands);
21721 /* If the next token is not a `,', there are no more
21722 operands. */
21725 /* Consume the `,'. */
21727 }
21730 }
21732 /* Parse an asm-clobber-list.
21734 asm-clobber-list:
21735 string-literal
21736 asm-clobber-list , string-literal
21738 Returns a TREE_LIST, indicating the clobbers in the order that they
21739 appeared. The TREE_VALUE of each node is a STRING_CST. */
21741 static tree
21743 {
21747 {
21748 tree string_literal;
21750 /* Look for the string literal. */
21752 /* Add it to the list. */
21754 /* If the next token is not a `,', then the list is
21755 complete. */
21758 /* Consume the `,' token. */
21760 }
21763 }
21765 /* Parse an asm-label-list.
21767 asm-label-list:
21768 identifier
21769 asm-label-list , identifier
21771 Returns a TREE_LIST, indicating the labels in the order that they
21772 appeared. The TREE_VALUE of each node is a label. */
21774 static tree
21776 {
21780 {
21783 /* Look for the identifier. */
21786 {
21789 {
21795 }
21796 }
21797 /* If the next token is not a `,', then the list is
21798 complete. */
21801 /* Consume the `,' token. */
21803 }
21806 }
21808 /* Return TRUE iff the next tokens in the stream are possibly the
21809 beginning of a GNU extension attribute. */
21811 static bool
21813 {
21815 }
21817 /* Return TRUE iff the next tokens in the stream are possibly the
21818 beginning of a standard C++-11 attribute specifier. */
21820 static bool
21822 {
21824 }
21826 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21827 beginning of a standard C++-11 attribute specifier. */
21829 static bool
21831 {
21839 }
21841 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21842 beginning of a GNU extension attribute. */
21844 static bool
21846 {
21850 }
21852 /* Return true iff the next tokens can be the beginning of either a
21853 GNU attribute list, or a standard C++11 attribute sequence. */
21855 static bool
21857 {
21860 }
21862 /* Return true iff the next Nth tokens can be the beginning of either
21863 a GNU attribute list, or a standard C++11 attribute sequence. */
21865 static bool
21867 {
21870 }
21872 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21873 of GNU attributes, or return NULL. */
21875 static tree
21877 {
21881 }
21883 #define CILK_SIMD_FN_CLAUSE_MASK \
21884 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21885 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21886 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21887 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21888 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21890 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21891 vector [(<clauses>)] */
21893 static void
21895 {
21899 {
21904 }
21907 {
21910 paren_scope++;
21911 }
21913 {
21916 paren_scope++;
21918 paren_scope--;
21919 /* Do not push the last ')' */
21922 }
21931 }
21933 /* Parse an (optional) series of attributes.
21935 attributes:
21936 attributes attribute
21938 attribute:
21939 __attribute__ (( attribute-list [opt] ))
21941 The return value is as for cp_parser_gnu_attribute_list. */
21943 static tree
21945 {
21949 {
21951 tree attribute_list;
21954 /* Peek at the next token. */
21956 /* If it's not `__attribute__', then we're done. */
21960 /* Consume the `__attribute__' keyword. */
21962 /* Look for the two `(' tokens. */
21966 /* Peek at the next token. */
21969 /* Parse the attribute-list. */
21971 else
21972 /* If the next token is a `)', then there is no attribute
21973 list. */
21976 /* Look for the two `)' tokens. */
21984 /* Add these new attributes to the list. */
21986 }
21989 }
21991 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21992 "__vector" or "__vector__." */
21996 {
22000 }
22002 /* Parse a GNU attribute-list.
22004 attribute-list:
22005 attribute
22006 attribute-list , attribute
22008 attribute:
22009 identifier
22010 identifier ( identifier )
22011 identifier ( identifier , expression-list )
22012 identifier ( expression-list )
22014 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22015 to an attribute. The TREE_PURPOSE of each node is the identifier
22016 indicating which attribute is in use. The TREE_VALUE represents
22017 the arguments, if any. */
22019 static tree
22021 {
22027 {
22029 tree identifier;
22030 tree attribute;
22032 /* Look for the identifier. We also allow keywords here; for
22033 example `__attribute__ ((const))' is legal. */
22037 {
22040 /* Consume the token, but save it since we need it for the
22041 SIMD enabled function parsing. */
22044 /* Save away the identifier that indicates which attribute
22045 this is. */
22047 /* For keywords, use the canonical spelling, not the
22048 parsed identifier. */
22054 /* Peek at the next token. */
22056 /* If it's an `(', then parse the attribute arguments. */
22058 {
22063 {
22066 }
22067 else
22068 vec = cp_parser_parenthesized_expression_list
22074 else
22075 {
22078 }
22079 /* Save the arguments away. */
22081 }
22083 {
22086 }
22089 {
22090 /* Add this attribute to the list. */
22093 }
22096 }
22097 /* Now, look for more attributes. If the next token isn't a
22098 `,', we're done. */
22102 /* Consume the comma and keep going. */
22104 }
22107 /* We built up the list in reverse order. */
22109 }
22111 /* Parse a standard C++11 attribute.
22113 The returned representation is a TREE_LIST which TREE_PURPOSE is
22114 the scoped name of the attribute, and the TREE_VALUE is its
22115 arguments list.
22117 Note that the scoped name of the attribute is itself a TREE_LIST
22118 which TREE_PURPOSE is the namespace of the attribute, and
22119 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22120 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22121 and which TREE_PURPOSE is directly the attribute name.
22123 Clients of the attribute code should use get_attribute_namespace
22124 and get_attribute_name to get the actual namespace and name of
22125 attributes, regardless of their being GNU or C++11 attributes.
22127 attribute:
22128 attribute-token attribute-argument-clause [opt]
22130 attribute-token:
22131 identifier
22132 attribute-scoped-token
22134 attribute-scoped-token:
22135 attribute-namespace :: identifier
22137 attribute-namespace:
22138 identifier
22140 attribute-argument-clause:
22141 ( balanced-token-seq )
22143 balanced-token-seq:
22144 balanced-token [opt]
22145 balanced-token-seq balanced-token
22147 balanced-token:
22148 ( balanced-token-seq )
22149 [ balanced-token-seq ]
22150 { balanced-token-seq }. */
22152 static tree
22154 {
22158 /* First, parse name of the the attribute, a.k.a
22159 attribute-token. */
22176 {
22177 /* We are seeing a scoped attribute token. */
22187 else
22188 {
22192 }
22194 NULL_TREE);
22196 }
22197 else
22198 {
22200 NULL_TREE);
22201 /* C++11 noreturn attribute is equivalent to GNU's. */
22204 /* C++14 deprecated attribute is equivalent to GNU's. */
22206 {
22209 "%<deprecated%> is a C++14 feature;"
22212 }
22213 }
22215 /* Now parse the optional argument clause of the attribute. */
22220 {
22226 /* A GNU attribute that takes an identifier in parameter. */
22229 vec = cp_parser_parenthesized_expression_list
22235 else
22236 {
22239 }
22243 else
22245 }
22248 }
22250 /* Parse a list of standard C++-11 attributes.
22252 attribute-list:
22253 attribute [opt]
22254 attribute-list , attribute[opt]
22255 attribute ...
22256 attribute-list , attribute ...
22257 */
22259 static tree
22261 {
22266 {
22271 {
22274 }
22279 }
22282 }
22284 /* Parse a standard C++-11 attribute specifier.
22286 attribute-specifier:
22287 [ [ attribute-list ] ]
22288 alignment-specifier
22290 alignment-specifier:
22291 alignas ( type-id ... [opt] )
22292 alignas ( alignment-expression ... [opt] ). */
22294 static tree
22296 {
22302 {
22311 else
22312 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22313 when we are sure that we have actually parsed them. */
22315 }
22316 else
22317 {
22318 tree alignas_expr;
22320 /* Look for an alignment-specifier. */
22332 {
22335 }
22341 {
22345 alignas_expr =
22352 }
22355 {
22358 }
22362 /* Build the C++-11 representation of an 'aligned'
22363 attribute. */
22364 attributes =
22368 }
22371 }
22373 /* Parse a standard C++-11 attribute-specifier-seq.
22375 attribute-specifier-seq:
22376 attribute-specifier-seq [opt] attribute-specifier
22377 */
22379 static tree
22381 {
22385 {
22394 }
22398 }
22400 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22401 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22402 current value of the PEDANTIC flag, regardless of whether or not
22403 the `__extension__' keyword is present. The caller is responsible
22404 for restoring the value of the PEDANTIC flag. */
22406 static bool
22408 {
22409 /* Save the old value of the PEDANTIC flag. */
22413 {
22414 /* Consume the `__extension__' token. */
22416 /* We're not being pedantic while the `__extension__' keyword is
22417 in effect. */
22421 }
22424 }
22426 /* Parse a label declaration.
22428 label-declaration:
22429 __label__ label-declarator-seq ;
22431 label-declarator-seq:
22432 identifier , label-declarator-seq
22433 identifier */
22435 static void
22437 {
22438 /* Look for the `__label__' keyword. */
22442 {
22443 tree identifier;
22445 /* Look for an identifier. */
22447 /* If we failed, stop. */
22450 /* Declare it as a label. */
22452 /* If the next token is a `;', stop. */
22455 /* Look for the `,' separating the label declarations. */
22457 }
22459 /* Look for the final `;'. */
22461 }
22463 /* Support Functions */
22465 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22466 NAME should have one of the representations used for an
22467 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22468 is returned. If PARSER->SCOPE is a dependent type, then a
22469 SCOPE_REF is returned.
22471 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22472 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22473 was formed. Abstractly, such entities should not be passed to this
22474 function, because they do not need to be looked up, but it is
22475 simpler to check for this special case here, rather than at the
22476 call-sites.
22478 In cases not explicitly covered above, this function returns a
22479 DECL, OVERLOAD, or baselink representing the result of the lookup.
22480 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22481 is returned.
22483 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22484 (e.g., "struct") that was used. In that case bindings that do not
22485 refer to types are ignored.
22487 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22488 ignored.
22490 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22491 are ignored.
22493 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22494 types.
22496 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22497 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22498 NULL_TREE otherwise. */
22500 static tree
22507 location_t name_location)
22508 {
22509 tree decl;
22512 /* Assume that the lookup will be unambiguous. */
22516 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22517 no longer valid. Note that if we are parsing tentatively, and
22518 the parse fails, OBJECT_TYPE will be automatically restored. */
22524 /* A template-id has already been resolved; there is no lookup to
22525 do. */
22529 {
22533 }
22535 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22536 it should already have been checked to make sure that the name
22537 used matches the type being destroyed. */
22539 {
22540 tree type;
22542 /* Figure out to which type this destructor applies. */
22547 else
22549 /* If that's not a class type, there is no destructor. */
22556 /* If it was a class type, return the destructor. */
22558 }
22560 /* By this point, the NAME should be an ordinary identifier. If
22561 the id-expression was a qualified name, the qualifying scope is
22562 stored in PARSER->SCOPE at this point. */
22565 /* Perform the lookup. */
22567 {
22573 /* If the SCOPE is dependent, the lookup must be deferred until
22574 the template is instantiated -- unless we are explicitly
22575 looking up names in uninstantiated templates. Even then, we
22576 cannot look up the name if the scope is not a class type; it
22577 might, for example, be a template type parameter. */
22582 /* Defer lookup. */
22584 else
22585 {
22588 /* If PARSER->SCOPE is a dependent type, then it must be a
22589 class type, and we must not be checking dependencies;
22590 otherwise, we would have processed this lookup above. So
22591 that PARSER->SCOPE is not considered a dependent base by
22592 lookup_member, we must enter the scope here. */
22596 /* If the PARSER->SCOPE is a template specialization, it
22597 may be instantiated during name lookup. In that case,
22598 errors may be issued. Even if we rollback the current
22599 tentative parse, those errors are valid. */
22604 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22605 lookup result and the nested-name-specifier nominates a class C:
22606 * if the name specified after the nested-name-specifier, when
22607 looked up in C, is the injected-class-name of C (Clause 9), or
22608 * if the name specified after the nested-name-specifier is the
22609 same as the identifier or the simple-template-id's template-
22610 name in the last component of the nested-name-specifier,
22611 the name is instead considered to name the constructor of
22612 class C. [ Note: for example, the constructor is not an
22613 acceptable lookup result in an elaborated-type-specifier so
22614 the constructor would not be used in place of the
22615 injected-class-name. --end note ] Such a constructor name
22616 shall be used only in the declarator-id of a declaration that
22617 names a constructor or in a using-declaration. */
22625 /* If we have a single function from a using decl, pull it out. */
22632 }
22634 /* If the scope is a dependent type and either we deferred lookup or
22635 we did lookup but didn't find the name, rememeber the name. */
22638 {
22640 {
22641 tree type;
22643 /* The resolution to Core Issue 180 says that `struct
22644 A::B' should be considered a type-name, even if `A'
22645 is dependent. */
22650 }
22654 CPP_CLOSE_PAREN)))
22658 else
22661 is_template);
22662 }
22665 }
22667 {
22668 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22669 OBJECT_TYPE is not a class. */
22671 /* If the OBJECT_TYPE is a template specialization, it may
22672 be instantiated during name lookup. In that case, errors
22673 may be issued. Even if we rollback the current tentative
22674 parse, those errors are valid. */
22676 name,
22679 tf_warning_or_error);
22680 else
22684 /* Look it up in the enclosing context. */
22690 }
22691 else
22692 {
22698 }
22700 /* If the lookup failed, let our caller know. */
22704 /* Pull out the template from an injected-class-name (or multiple). */
22708 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22710 {
22713 /* The error message we have to print is too complicated for
22714 cp_parser_error, so we incorporate its actions directly. */
22716 {
22718 name);
22720 }
22722 }
22730 /* If we have resolved the name of a member declaration, check to
22731 see if the declaration is accessible. When the name resolves to
22732 set of overloaded functions, accessibility is checked when
22733 overload resolution is done.
22735 During an explicit instantiation, access is not checked at all,
22736 as per [temp.explicit]. */
22743 }
22745 /* Like cp_parser_lookup_name, but for use in the typical case where
22746 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22747 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22749 static tree
22751 {
22753 none_type,
22758 location);
22759 }
22761 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22762 the current context, return the TYPE_DECL. If TAG_NAME_P is
22763 true, the DECL indicates the class being defined in a class-head,
22764 or declared in an elaborated-type-specifier.
22766 Otherwise, return DECL. */
22768 static tree
22770 {
22771 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22772 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22774 struct A {
22775 template <typename T> struct B;
22776 };
22778 template <typename T> struct A::B {};
22780 Similarly, in an elaborated-type-specifier:
22782 namespace N { struct X{}; }
22784 struct A {
22785 template <typename T> friend struct N::X;
22786 };
22788 However, if the DECL refers to a class type, and we are in
22789 the scope of the class, then the name lookup automatically
22790 finds the TYPE_DECL created by build_self_reference rather
22791 than a TEMPLATE_DECL. For example, in:
22793 template <class T> struct S {
22794 S s;
22795 };
22797 there is no need to handle such case. */
22803 }
22805 /* If too many, or too few, template-parameter lists apply to the
22806 declarator, issue an error message. Returns TRUE if all went well,
22807 and FALSE otherwise. */
22809 static bool
22812 location_t declarator_location)
22813 {
22815 {
22817 {
22825 /* If the DECLARATOR has the form `X<y>' then it uses one
22826 additional level of template parameters. */
22829 return cp_parser_check_template_parameters
22831 }
22846 }
22848 }
22850 /* NUM_TEMPLATES were used in the current declaration. If that is
22851 invalid, return FALSE and issue an error messages. Otherwise,
22852 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22853 declarator and we can print more accurate diagnostics. */
22855 static bool
22858 location_t location,
22860 {
22861 /* If there are the same number of template classes and parameter
22862 lists, that's OK. */
22865 /* If there are more, but only one more, then we are referring to a
22866 member template. That's OK too. */
22869 /* If there are more template classes than parameter lists, we have
22870 something like:
22872 template <class T> void S<T>::R<T>::f (); */
22874 {
22884 else
22887 }
22888 /* Otherwise, there are too many template parameter lists. We have
22889 something like:
22891 template <class T> template <class U> void S::f(); */
22894 }
22896 /* Parse an optional `::' token indicating that the following name is
22897 from the global namespace. If so, PARSER->SCOPE is set to the
22898 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22899 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22900 Returns the new value of PARSER->SCOPE, if the `::' token is
22901 present, and NULL_TREE otherwise. */
22903 static tree
22905 {
22908 /* Peek at the next token. */
22910 /* If we're looking at a `::' token then we're starting from the
22911 global namespace, not our current location. */
22913 {
22914 /* Consume the `::' token. */
22916 /* Set the SCOPE so that we know where to start the lookup. */
22922 }
22924 {
22928 }
22931 }
22933 /* Returns TRUE if the upcoming token sequence is the start of a
22934 constructor declarator. If FRIEND_P is true, the declarator is
22935 preceded by the `friend' specifier. */
22937 static bool
22939 {
22942 tree nested_name_specifier;
22945 /* The common case is that this is not a constructor declarator, so
22946 try to avoid doing lots of work if at all possible. It's not
22947 valid declare a constructor at function scope. */
22950 /* And only certain tokens can begin a constructor declarator. */
22958 /* Parse tentatively; we are going to roll back all of the tokens
22959 consumed here. */
22961 /* Assume that we are looking at a constructor declarator. */
22964 /* Look for the optional `::' operator. */
22967 /* Look for the nested-name-specifier. */
22968 nested_name_specifier
22979 /* Outside of a class-specifier, there must be a
22980 nested-name-specifier. */
22986 /* If we have a class scope, this is easy; DR 147 says that S::S always
22987 names the constructor, and no other qualified name could. */
22990 {
23000 }
23001 /* If we still think that this might be a constructor-declarator,
23002 look for a class-name. */
23004 {
23005 /* If we have:
23007 template <typename T> struct S {
23008 S();
23009 };
23011 we must recognize that the nested `S' names a class. */
23012 tree type_decl;
23016 none_type,
23020 /* If there was no class-name, then this is not a constructor.
23021 Otherwise, if we are in a class-specifier and we aren't
23022 handling a friend declaration, check that its type matches
23023 current_class_type (c++/38313). Note: error_mark_node
23024 is left alone for error recovery purposes. */
23026 && (outside_class_specifier_p
23031 /* If we're still considering a constructor, we have to see a `(',
23032 to begin the parameter-declaration-clause, followed by either a
23033 `)', an `...', or a decl-specifier. We need to check for a
23034 type-specifier to avoid being fooled into thinking that:
23036 S (f) (int);
23038 is a constructor. (It is actually a function named `f' that
23039 takes one parameter (of type `int') and returns a value of type
23040 `S'. */
23048 /* A parameter declaration begins with a decl-specifier,
23049 which is either the "attribute" keyword, a storage class
23050 specifier, or (usually) a type-specifier. */
23052 {
23053 tree type;
23057 /* Names appearing in the type-specifier should be looked up
23058 in the scope of the class. */
23061 else
23062 {
23065 {
23069 {
23072 }
23073 }
23075 }
23077 /* Inside the constructor parameter list, surrounding
23078 template-parameter-lists do not apply. */
23079 saved_num_template_parameter_lists
23083 /* Look for the type-specifier. */
23085 CP_PARSER_FLAGS_NONE,
23091 parser->num_template_parameter_lists
23094 /* Leave the scope of the class. */
23099 }
23100 }
23102 /* We did not really want to consume any tokens. */
23106 }
23108 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23109 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23110 they must be performed once we are in the scope of the function.
23112 Returns the function defined. */
23114 static tree
23115 cp_parser_function_definition_from_specifiers_and_declarator
23118 tree attributes,
23120 {
23121 tree fn;
23124 /* Begin the function-definition. */
23127 /* The things we're about to see are not directly qualified by any
23128 template headers we've seen thus far. */
23131 /* If there were names looked up in the decl-specifier-seq that we
23132 did not check, check them now. We must wait until we are in the
23133 scope of the function to perform the checks, since the function
23134 might be a friend. */
23138 {
23141 }
23144 {
23145 /* Skip the entire function. */
23148 }
23150 {
23151 /* Seen already, skip it. An error message has already been output. */
23155 /* If this is a function from a class, pop the nested class. */
23158 }
23159 else
23160 {
23161 timevar_id_t tv;
23164 else
23170 }
23173 }
23175 /* Parse the part of a function-definition that follows the
23176 declarator. INLINE_P is TRUE iff this function is an inline
23177 function defined within a class-specifier.
23179 Returns the function defined. */
23181 static tree
23184 {
23185 tree fn;
23191 bool fully_implicit_function_template_p
23194 tree implicit_template_parms
23197 cp_binding_level* implicit_template_scope
23203 /* If the next token is `return', then the code may be trying to
23204 make use of the "named return value" extension that G++ used to
23205 support. */
23208 {
23209 /* Consume the `return' keyword. */
23211 /* Look for the identifier that indicates what value is to be
23212 returned. */
23214 /* Issue an error message. */
23217 /* Skip tokens until we reach the start of the function body. */
23219 {
23226 }
23227 }
23228 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23229 anything declared inside `f'. */
23230 saved_in_unbraced_linkage_specification_p
23233 /* Inside the function, surrounding template-parameter-lists do not
23234 apply. */
23235 saved_num_template_parameter_lists
23241 /* If the next token is `try', `__transaction_atomic', or
23242 `__transaction_relaxed`, then we are looking at either function-try-block
23243 or function-transaction-block. Note that all of these include the
23244 function-body. */
23247 RID_TRANSACTION_ATOMIC);
23249 RID_TRANSACTION_RELAXED))
23251 RID_TRANSACTION_RELAXED);
23254 else
23255 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23260 /* Finish the function. */
23263 /* Generate code for it, if necessary. */
23265 /* Restore the saved values. */
23266 parser->in_unbraced_linkage_specification_p
23268 parser->num_template_parameter_lists
23272 parser->fully_implicit_function_template_p
23274 parser->implicit_template_parms
23276 parser->implicit_template_scope
23283 }
23285 /* Parse a template-declaration, assuming that the `export' (and
23286 `extern') keywords, if present, has already been scanned. MEMBER_P
23287 is as for cp_parser_template_declaration. */
23289 static void
23291 {
23294 tree parameter_list;
23299 /* Look for the `template' keyword. */
23304 /* And the `<'. */
23308 {
23309 /* 14.5.2.2 [temp.mem]
23311 A local class shall not have member templates. */
23316 }
23317 /* [temp]
23319 A template ... shall not have C linkage. */
23321 {
23323 /* Give it C++ linkage to avoid confusing other parts of the
23324 front end. */
23327 }
23328 else
23331 /* We cannot perform access checks on the template parameter
23332 declarations until we know what is being declared, just as we
23333 cannot check the decl-specifier list. */
23336 /* If the next token is `>', then we have an invalid
23337 specialization. Rather than complain about an invalid template
23338 parameter, issue an error message here. */
23340 {
23344 }
23345 else
23346 {
23347 /* Parse the template parameters. */
23349 }
23351 /* Get the deferred access checks from the parameter list. These
23352 will be checked once we know what is being declared, as for a
23353 member template the checks must be performed in the scope of the
23354 class containing the member. */
23357 /* Look for the `>'. */
23359 /* We just processed one more parameter list. */
23361 /* If the next token is `template', there are more template
23362 parameters. */
23364 RID_TEMPLATE))
23369 else
23370 {
23371 /* There are no access checks when parsing a template, as we do not
23372 know if a specialization will be a friend. */
23376 checks,
23377 member_p,
23382 /* If this is a member template declaration, let the front
23383 end know. */
23385 {
23390 }
23395 }
23396 /* We are done with the current parameter list. */
23401 /* Finish up. */
23404 /* Check the template arguments for a literal operator template. */
23408 {
23412 else
23413 {
23416 {
23422 }
23424 {
23432 }
23433 else
23435 }
23437 {
23440 " Expected non-type template argument pack <char...>"
23442 decl);
23443 else
23446 decl);
23447 }
23448 }
23449 /* Register member declarations. */
23452 /* For the erroneous case of a template with C linkage, we pushed an
23453 implicit C++ linkage scope; exit that scope now. */
23456 /* If DECL is a function template, we must return to parse it later.
23457 (Even though there is no definition, there might be default
23458 arguments that need handling.) */
23462 }
23464 /* Perform the deferred access checks from a template-parameter-list.
23465 CHECKS is a TREE_LIST of access checks, as returned by
23466 get_deferred_access_checks. */
23468 static void
23469 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23470 {
23474 }
23476 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23477 `function-definition' sequence that follows a template header.
23478 If MEMBER_P is true, this declaration appears in a class scope.
23480 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23481 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23483 static tree
23489 {
23492 cp_decl_specifier_seq decl_specifiers;
23496 /* This function is only used when processing a template
23497 declaration. */
23501 /* Defer access checks until we know what is being declared. */
23504 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23505 alternative. */
23508 CP_PARSER_FLAGS_OPTIONAL,
23514 /* There are no template typedefs. */
23516 {
23520 }
23522 /* Gather up the access checks that occurred the
23523 decl-specifier-seq. */
23526 /* Check for the declaration of a template class. */
23528 {
23530 {
23533 /* In this case:
23535 struct C {
23536 friend template <typename T> struct A<T>::B;
23537 };
23539 A<T>::B will be represented by a TYPENAME_TYPE, and
23540 therefore not recognized by shadow_tag. */
23542 && !decl
23549 else
23552 /* Perform access checks for template parameters. */
23554 }
23555 }
23557 /* Complain about missing 'typename' or other invalid type names. */
23560 {
23561 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23562 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23563 the rest of this declaration. */
23566 }
23568 /* If it's not a template class, try for a template function. If
23569 the next token is a `;', then this declaration does not declare
23570 anything. But, if there were errors in the decl-specifiers, then
23571 the error might well have come from an attempted class-specifier.
23572 In that case, there's no need to warn about a missing declarator. */
23576 {
23579 checks,
23581 member_p,
23582 declares_class_or_enum,
23584 NULL);
23586 /* 7.1.1-1 [dcl.stc]
23588 A storage-class-specifier shall not be specified in an explicit
23589 specialization... */
23591 && explicit_specialization_p
23593 {
23597 }
23601 }
23603 /* Look for a trailing `;' after the declaration. */
23609 out:
23612 /* Clear any current qualification; whatever comes next is the start
23613 of something new. */
23619 }
23621 /* Parse a cast-expression that is not the operand of a unary "&". */
23623 static tree
23625 {
23628 }
23630 /* Parse a functional cast to TYPE. Returns an expression
23631 representing the cast. */
23633 static tree
23635 {
23637 tree expression_list;
23638 tree cast;
23645 {
23653 tf_warning_or_error);
23654 }
23663 else
23664 {
23667 }
23670 tf_warning_or_error);
23671 /* [expr.const]/1: In an integral constant expression "only type
23672 conversions to integral or enumeration type can be used". */
23678 NIC_CONSTRUCTOR))
23681 }
23683 /* Save the tokens that make up the body of a member function defined
23684 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23685 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23686 specifiers applied to the declaration. Returns the FUNCTION_DECL
23687 for the member function. */
23689 static tree
23693 tree attributes)
23694 {
23697 tree fn;
23699 /* Create the FUNCTION_DECL. */
23702 /* If something went badly wrong, bail out now. */
23704 {
23705 /* If there's a function-body, skip it. */
23710 }
23712 /* Remember it, if there default args to post process. */
23715 /* Save away the tokens that make up the body of the
23716 function. */
23718 /* Handle function try blocks. */
23721 /* We can have braced-init-list mem-initializers before the fn body. */
23723 {
23726 {
23727 /* cache_group will stop after an un-nested { } pair, too. */
23731 /* variadic mem-inits have ... after the ')'. */
23734 }
23735 }
23737 /* Handle function try blocks. */
23742 /* Save away the inline definition; we will process it when the
23743 class is complete. */
23747 /* We need to know that this was defined in the class, so that
23748 friend templates are handled correctly. */
23751 /* Add FN to the queue of functions to be parsed later. */
23755 }
23757 /* Save the tokens that make up the in-class initializer for a non-static
23758 data member. Returns a DEFAULT_ARG. */
23760 static tree
23762 {
23764 }
23766 /* Parse a template-argument-list, as well as the trailing ">" (but
23767 not the opening "<"). See cp_parser_template_argument_list for the
23768 return value. */
23770 static tree
23772 {
23773 tree arguments;
23774 tree saved_scope;
23775 tree saved_qualifying_scope;
23776 tree saved_object_scope;
23781 /* [temp.names]
23783 When parsing a template-id, the first non-nested `>' is taken as
23784 the end of the template-argument-list rather than a greater-than
23785 operator. */
23786 saved_greater_than_is_operator_p
23789 /* Parsing the argument list may modify SCOPE, so we save it
23790 here. */
23794 /* We need to evaluate the template arguments, even though this
23795 template-id may be nested within a "sizeof". */
23800 /* Parse the template-argument-list itself. */
23804 else
23806 /* Look for the `>' that ends the template-argument-list. If we find
23807 a '>>' instead, it's probably just a typo. */
23809 {
23811 {
23812 /* In C++0x, a `>>' in a template argument list or cast
23813 expression is considered to be two separate `>'
23814 tokens. So, change the current token to a `>', but don't
23815 consume it: it will be consumed later when the outer
23816 template argument list (or cast expression) is parsed.
23817 Note that this replacement of `>' for `>>' is necessary
23818 even if we are parsing tentatively: in the tentative
23819 case, after calling
23820 cp_parser_enclosed_template_argument_list we will always
23821 throw away all of the template arguments and the first
23822 closing `>', either because the template argument list
23823 was erroneous or because we are replacing those tokens
23824 with a CPP_TEMPLATE_ID token. The second `>' (which will
23825 not have been thrown away) is needed either to close an
23826 outer template argument list or to complete a new-style
23827 cast. */
23830 }
23832 {
23833 /* If we're in a nested template argument list, the '>>' has
23834 to be a typo for '> >'. We emit the error message, but we
23835 continue parsing and we push a '>' as next token, so that
23836 the argument list will be parsed correctly. Note that the
23837 global source location is still on the token before the
23838 '>>', so we need to say explicitly where we want it. */
23844 }
23845 else
23846 {
23847 /* If this is not a nested template argument list, the '>>'
23848 is a typo for '>'. Emit an error message and continue.
23849 Same deal about the token location, but here we can get it
23850 right by consuming the '>>' before issuing the diagnostic. */
23853 "spurious %<>>%>, use %<>%> to terminate "
23855 }
23856 }
23857 else
23859 /* The `>' token might be a greater-than operator again now. */
23860 parser->greater_than_is_operator_p
23862 /* Restore the SAVED_SCOPE. */
23870 }
23872 /* MEMBER_FUNCTION is a member function, or a friend. If default
23873 arguments, or the body of the function have not yet been parsed,
23874 parse them now. */
23876 static void
23878 {
23880 /* If this member is a template, get the underlying
23881 FUNCTION_DECL. */
23885 /* There should not be any class definitions in progress at this
23886 point; the bodies of members are only parsed outside of all class
23887 definitions. */
23889 /* While we're parsing the member functions we might encounter more
23890 classes. We want to handle them right away, but we don't want
23891 them getting mixed up with functions that are currently in the
23892 queue. */
23895 /* Make sure that any template parameters are in scope. */
23898 /* If the body of the function has not yet been parsed, parse it
23899 now. */
23901 {
23902 tree function_scope;
23905 /* The function is no longer pending; we are processing it. */
23910 /* If this is a local class, enter the scope of the containing
23911 function. */
23916 /* Push the body of the function onto the lexer stack. */
23919 /* Let the front end know that we going to be defining this
23920 function. */
23924 /* Don't do access checking if it is a templated function. */
23928 /* #pragma omp declare reduction needs special parsing. */
23930 {
23935 }
23936 else
23937 /* Now, parse the body of the function. */
23944 /* Leave the scope of the containing function. */
23948 }
23950 /* Remove any template parameters from the symbol table. */
23953 /* Restore the queue. */
23956 }
23958 /* If DECL contains any default args, remember it on the unparsed
23959 functions queue. */
23961 static void
23963 {
23964 tree probe;
23967 probe;
23970 {
23974 }
23975 }
23977 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23978 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23979 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23980 from the parameter-type-list. */
23982 static tree
23985 {
23987 tree parsed_arg;
23993 /* Push the saved tokens for the default argument onto the parser's
23994 lexer stack. */
24000 /* Parse the default argument. */
24011 {
24012 /* In a non-template class, check conversions now. In a template,
24013 we'll wait and instantiate these as needed. */
24016 tf_warning_or_error);
24017 else
24019 }
24021 /* If the token stream has not been completely used up, then
24022 there was extra junk after the end of the default
24023 argument. */
24025 {
24028 else
24030 }
24032 /* Revert to the main lexer. */
24036 }
24038 /* FIELD is a non-static data member with an initializer which we saved for
24039 later; parse it now. */
24041 static void
24043 {
24044 tree def;
24051 NULL_TREE);
24057 }
24059 /* FN is a FUNCTION_DECL which may contains a parameter with an
24060 unparsed DEFAULT_ARG. Parse the default args now. This function
24061 assumes that the current scope is the scope in which the default
24062 argument should be processed. */
24064 static void
24066 {
24070 /* While we're parsing the default args, we might (due to the
24071 statement expression extension) encounter more classes. We want
24072 to handle them right away, but we don't want them getting mixed
24073 up with default args that are currently in the queue. */
24076 /* Local variable names (and the `this' keyword) may not appear
24077 in a default argument. */
24088 {
24090 tree parsed_arg;
24092 tree copy;
24099 /* This can happen for a friend declaration for a function
24100 already declared with default arguments. */
24103 parsed_arg
24105 default_arg,
24108 {
24110 }
24114 /* Update any instantiations we've already created. */
24118 }
24122 /* Make sure no default arg is missing. */
24125 /* Restore the state of local_variables_forbidden_p. */
24128 /* Restore the queue. */
24130 }
24132 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24134 sizeof ... ( identifier )
24136 where the 'sizeof' token has already been consumed. */
24138 static tree
24140 {
24141 /* Consume the `...'. */
24148 else
24156 /* The name is not qualified. */
24174 }
24176 /* Parse the operand of `sizeof' (or a similar operator). Returns
24177 either a TYPE or an expression, depending on the form of the
24178 input. The KEYWORD indicates which kind of expression we have
24179 encountered. */
24181 static tree
24183 {
24190 /* If it's a `...', then we are computing the length of a parameter
24191 pack. */
24196 /* Types cannot be defined in a `sizeof' expression. Save away the
24197 old message. */
24199 /* And create the new one. */
24205 /* The restrictions on constant-expressions do not apply inside
24206 sizeof expressions. */
24207 saved_integral_constant_expression_p
24209 saved_non_integral_constant_expression_p
24213 /* Do not actually evaluate the expression. */
24216 /* If it's a `(', then we might be looking at the type-id
24217 construction. */
24219 {
24222 /* We can't be sure yet whether we're looking at a type-id or an
24223 expression. */
24225 /* Note: as a GNU Extension, compound literals are considered
24226 postfix-expressions as they are in C99, so they are valid
24227 arguments to sizeof. See comment in cp_parser_cast_expression
24228 for details. */
24231 else
24232 {
24235 /* Look for the type-id. */
24237 /* Look for the closing `)'. */
24240 }
24242 /* If all went well, then we're done. */
24244 {
24245 cp_decl_specifier_seq decl_specs;
24247 /* Build a trivial decl-specifier-seq. */
24251 /* Call grokdeclarator to figure out what type this is. */
24254 TYPENAME,
24257 }
24258 }
24260 /* If the type-id production did not work out, then we must be
24261 looking at the unary-expression production. */
24266 /* Go back to evaluating expressions. */
24270 /* Free the message we created. */
24272 /* And restore the old one. */
24274 parser->integral_constant_expression_p
24276 parser->non_integral_constant_expression_p
24280 }
24282 /* If the current declaration has no declarator, return true. */
24284 static bool
24286 {
24287 /* If the next token is a `;' or a `,' then there is no
24288 declarator. */
24291 }
24293 /* Update the DECL_SPECS to reflect the storage class indicated by
24294 KEYWORD. */
24296 static void
24301 {
24302 cp_storage_class storage_class;
24305 {
24309 }
24311 {
24314 }
24319 {
24322 }
24325 {
24343 }
24347 /* A storage class specifier cannot be applied alongside a typedef
24348 specifier. If there is a typedef specifier present then set
24349 conflicting_specifiers_p which will trigger an error later
24350 on in grokdeclarator. */
24353 }
24355 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24356 is true, the type is a class or enum definition. */
24358 static void
24360 tree type_spec,
24363 {
24366 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24367 (with, for example, in "typedef int wchar_t;") we remember that
24368 this is what happened. In system headers, we ignore these
24369 declarations so that G++ can work with system headers that are not
24370 C++-safe. */
24372 && !type_definition_p
24382 {
24385 ds_redefined_builtin_type_spec,
24386 token);
24388 {
24392 }
24393 }
24396 else
24397 {
24402 }
24403 }
24405 /* True iff TOKEN is the GNU keyword __thread. */
24407 static bool
24409 {
24412 }
24414 /* Set the location for a declarator specifier and check if it is
24415 duplicated.
24417 DECL_SPECS is the sequence of declarator specifiers onto which to
24418 set the location.
24420 DS is the single declarator specifier to set which location is to
24421 be set onto the existing sequence of declarators.
24423 LOCATION is the location for the declarator specifier to
24424 consider. */
24426 static void
24429 {
24438 {
24442 }
24443 else
24444 {
24446 {
24450 else
24451 {
24454 OPT_Wlong_long,
24456 }
24457 }
24459 {
24464 else
24466 }
24467 else
24468 {
24484 "__complex"
24485 };
24488 }
24489 }
24490 }
24492 /* Return true iff the declarator specifier DS is present in the
24493 sequence of declarator specifiers DECL_SPECS. */
24495 bool
24497 cp_decl_spec ds)
24498 {
24505 }
24507 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24508 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24510 static bool
24512 {
24514 }
24516 /* Issue an error message indicating that TOKEN_DESC was expected.
24517 If KEYWORD is true, it indicated this function is called by
24518 cp_parser_require_keword and the required token can only be
24519 a indicated keyword. */
24521 static void
24523 required_token token_desc,
24525 {
24527 {
24596 }
24598 {
24600 {
24679 }
24680 }
24681 else
24683 }
24687 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24688 issue an error message indicating that TOKEN_DESC was expected.
24690 Returns the token consumed, if the token had the appropriate type.
24691 Otherwise, returns NULL. */
24696 required_token token_desc)
24697 {
24700 else
24701 {
24702 /* Output the MESSAGE -- unless we're parsing tentatively. */
24706 }
24707 }
24709 /* An error message is produced if the next token is not '>'.
24710 All further tokens are skipped until the desired token is
24711 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24713 static void
24715 {
24716 /* Current level of '< ... >'. */
24718 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24721 /* Are we ready, yet? If not, issue error message. */
24725 /* Skip tokens until the desired token is found. */
24727 {
24728 /* Peek at the next token. */
24730 {
24738 /* C++0x views the `>>' operator as two `>' tokens, but
24739 C++98 does not. */
24742 {
24743 /* We've hit a `>>' where the first `>' closes the
24744 template argument list, and the second `>' is
24745 spurious. Just consume the `>>' and stop; we've
24746 already produced at least one error. */
24749 }
24750 /* Fall through for C++0x, so we handle the second `>' in
24751 the `>>'. */
24755 {
24756 /* We've reached the token we want, consume it and stop. */
24759 }
24778 /* The '>' was probably forgotten, don't look further. */
24783 }
24785 /* Consume this token. */
24787 }
24788 }
24790 /* If the next token is the indicated keyword, consume it. Otherwise,
24791 issue an error message indicating that TOKEN_DESC was expected.
24793 Returns the token consumed, if the token had the appropriate type.
24794 Otherwise, returns NULL. */
24799 required_token token_desc)
24800 {
24804 {
24807 }
24810 }
24812 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24813 function-definition. */
24815 static bool
24817 {
24820 /* A ctor-initializer begins with a `:'. */
24822 /* A function-try-block begins with `try'. */
24824 /* A function-transaction-block begins with `__transaction_atomic'
24825 or `__transaction_relaxed'. */
24828 /* The named return value extension begins with `return'. */
24830 }
24832 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24833 definition. */
24835 static bool
24837 {
24844 }
24846 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24847 C++0x) ending a template-argument. */
24849 static bool
24851 {
24859 }
24861 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24862 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24864 static bool
24867 {
24873 /* Check for the sequence `<::' in the original code. It would be lexed as
24874 `[:', where `[' is a digraph, and there is no whitespace before
24875 `:'. */
24877 {
24882 }
24884 }
24886 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24887 or none_type otherwise. */
24889 static enum tag_types
24891 {
24893 {
24903 }
24904 }
24906 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
24907 or none_type otherwise or if the token is null. */
24909 static enum tag_types
24911 {
24916 {
24924 }
24925 }
24927 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24929 static void
24931 {
24935 {
24939 type))
24942 }
24943 }
24945 /* Issue an error message if DECL is redeclared with different
24946 access than its original declaration [class.access.spec/3].
24947 This applies to nested classes and nested class templates.
24948 [class.mem/1]. */
24950 static void
24952 {
24961 }
24963 /* Look for the `template' keyword, as a syntactic disambiguator.
24964 Return TRUE iff it is present, in which case it will be
24965 consumed. */
24967 static bool
24969 {
24971 {
24972 /* In C++98 the `template' keyword can only be used within templates;
24973 outside templates the parser can always figure out what is a
24974 template and what is not. In C++11, per the resolution of DR 468,
24975 `template' is allowed in cases where it is not strictly necessary. */
24978 {
24981 "in C++98 %<template%> (as a disambiguator) is only "
24983 /* If this part of the token stream is rescanned, the same
24984 error message would be generated. So, we purge the token
24985 from the stream. */
24988 }
24989 else
24990 {
24991 /* Consume the `template' keyword. */
24994 }
24995 }
24997 }
24999 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25000 set PARSER->SCOPE, and perform other related actions. */
25002 static void
25004 {
25010 /* Get the stored value. */
25012 /* Perform any access checks that were deferred. */
25015 {
25020 }
25021 /* Set the scope from the stored value. */
25025 }
25027 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25028 encounter the end of a block before what we were looking for. */
25030 static bool
25034 {
25036 {
25039 /* Abort a parenthesized expression if we encounter a semicolon. */
25043 /* If we've reached the end of the file, stop. */
25049 /* We've hit the end of an enclosing block, so there's been some
25050 kind of syntax error. */
25053 /* Consume the token. */
25055 /* See if it starts a new group. */
25057 {
25059 /* In theory this should probably check end == '}', but
25060 cp_parser_save_member_function_body needs it to exit
25061 after either '}' or ')' when called with ')'. */
25064 }
25066 {
25070 }
25075 }
25076 }
25078 /* Like above, for caching a default argument or NSDMI. Both of these are
25079 terminated by a non-nested comma, but it can be unclear whether or not a
25080 comma is nested in a template argument list unless we do more parsing.
25081 In order to handle this ambiguity, when we encounter a ',' after a '<'
25082 we try to parse what follows as a parameter-declaration-list (in the
25083 case of a default argument) or a member-declarator (in the case of an
25084 NSDMI). If that succeeds, then we stop caching. */
25086 static tree
25088 {
25093 tree default_argument;
25095 /* Add tokens until we have processed the entire default
25096 argument. We add the range [first_token, token). */
25099 {
25100 /* For list-initialization, this is straightforward. */
25103 }
25105 {
25108 /* Peek at the next token. */
25110 /* What we do depends on what token we have. */
25112 {
25113 /* In valid code, a default argument must be
25114 immediately followed by a `,' `)', or `...'. */
25117 {
25118 /* If we've seen a '<', we might be in a
25119 template-argument-list. Until Core issue 325 is
25120 resolved, we don't know how this situation ought
25121 to be handled, so try to DTRT. We check whether
25122 what comes after the comma is a valid parameter
25123 declaration list. If it is, then the comma ends
25124 the default argument; otherwise the default
25125 argument continues. */
25128 /* Set ITALP so cp_parser_parameter_declaration_list
25129 doesn't decide to commit to this parse. */
25137 {
25144 }
25145 else
25146 {
25150 }
25157 }
25160 /* If we run into a non-nested `;', `}', or `]',
25161 then the code is invalid -- but the default
25162 argument is certainly over. */
25167 /* Handle correctly int n = sizeof ... ( p ); */
25170 /* Update DEPTH, if necessary. */
25185 /* This might be the comparison operator, or it might
25186 start a template argument list. */
25193 /* Fall through for C++0x, which treats the `>>'
25194 operator like two `>' tokens in certain
25195 cases. */
25199 {
25200 /* This might be an operator, or it might close a
25201 template argument list. But if a previous '<'
25202 started a template argument list, this will have
25203 closed it, so we can't be in one anymore. */
25207 }
25210 /* If we run out of tokens, issue an error message. */
25219 /* In these cases, we should look for template-ids.
25220 For example, if the default argument is
25221 `X<int, double>()', we need to do name lookup to
25222 figure out whether or not `X' is a template; if
25223 so, the `,' does not end the default argument.
25225 That is not yet done. */
25230 }
25232 /* If we've reached the end, stop. */
25236 /* Add the token to the token block. */
25238 }
25240 /* Create a DEFAULT_ARG to represent the unparsed default
25241 argument. */
25248 }
25250 /* Begin parsing tentatively. We always save tokens while parsing
25251 tentatively so that if the tentative parsing fails we can restore the
25252 tokens. */
25254 static void
25256 {
25257 /* Enter a new parsing context. */
25259 /* Begin saving tokens. */
25261 /* In order to avoid repetitive access control error messages,
25262 access checks are queued up until we are no longer parsing
25263 tentatively. */
25265 }
25267 /* Commit to the currently active tentative parse. */
25269 static void
25271 {
25275 /* Mark all of the levels as committed. */
25278 {
25285 }
25286 }
25288 /* Commit to the topmost currently active tentative parse.
25290 Note that this function shouldn't be called when there are
25291 irreversible side-effects while in a tentative state. For
25292 example, we shouldn't create a permanent entry in the symbol
25293 table, or issue an error message that might not apply if the
25294 tentative parse is aborted. */
25296 static void
25298 {
25303 {
25311 }
25312 }
25314 /* Abort the currently active tentative parse. All consumed tokens
25315 will be rolled back, and no diagnostics will be issued. */
25317 static void
25319 {
25323 /* Now, pretend that we want to see if the construct was
25324 successfully parsed. */
25326 }
25328 /* Stop parsing tentatively. If a parse error has occurred, restore the
25329 token stream. Otherwise, commit to the tokens we have consumed.
25330 Returns true if no error occurred; false otherwise. */
25332 static bool
25334 {
25338 /* Remember whether or not an error occurred, since we are about to
25339 destroy that information. */
25341 /* Remove the topmost context from the stack. */
25344 /* If no parse errors occurred, commit to the tentative parse. */
25346 {
25347 /* Commit to the tokens read tentatively, unless that was
25348 already done. */
25353 }
25354 /* Otherwise, if errors occurred, roll back our state so that things
25355 are just as they were before we began the tentative parse. */
25356 else
25357 {
25360 }
25361 /* Add the context to the front of the free list. */
25366 }
25368 /* Returns true if we are parsing tentatively and are not committed to
25369 this tentative parse. */
25371 static bool
25373 {
25376 }
25378 /* Returns nonzero iff an error has occurred during the most recent
25379 tentative parse. */
25381 static bool
25383 {
25386 }
25388 /* Returns nonzero if GNU extensions are allowed. */
25390 static bool
25392 {
25394 }
25395 \f
25396 /* Objective-C++ Productions */
25399 /* Parse an Objective-C expression, which feeds into a primary-expression
25400 above.
25402 objc-expression:
25403 objc-message-expression
25404 objc-string-literal
25405 objc-encode-expression
25406 objc-protocol-expression
25407 objc-selector-expression
25409 Returns a tree representation of the expression. */
25411 static tree
25413 {
25414 /* Try to figure out what kind of declaration is present. */
25418 {
25428 {
25440 }
25446 }
25449 }
25451 /* Parse an Objective-C message expression.
25453 objc-message-expression:
25454 [ objc-message-receiver objc-message-args ]
25456 Returns a representation of an Objective-C message. */
25458 static tree
25460 {
25469 }
25471 /* Parse an objc-message-receiver.
25473 objc-message-receiver:
25474 expression
25475 simple-type-specifier
25477 Returns a representation of the type or expression. */
25479 static tree
25481 {
25482 tree rcv;
25484 /* An Objective-C message receiver may be either (1) a type
25485 or (2) an expression. */
25494 CP_PARSER_FLAGS_NONE);
25497 }
25499 /* Parse the arguments and selectors comprising an Objective-C message.
25501 objc-message-args:
25502 objc-selector
25503 objc-selector-args
25504 objc-selector-args , objc-comma-args
25506 objc-selector-args:
25507 objc-selector [opt] : assignment-expression
25508 objc-selector-args objc-selector [opt] : assignment-expression
25510 objc-comma-args:
25511 assignment-expression
25512 objc-comma-args , assignment-expression
25514 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25515 selector arguments and TREE_VALUE containing a list of comma
25516 arguments. */
25518 static tree
25520 {
25526 {
25532 /* Detect if we have a unary selector. */
25541 sel_args
25546 }
25548 /* Handle non-selector arguments, if any. */
25550 {
25551 tree arg;
25556 addl_args
25561 }
25564 {
25567 }
25570 }
25572 /* Parse an Objective-C encode expression.
25574 objc-encode-expression:
25575 @encode objc-typename
25577 Returns an encoded representation of the type argument. */
25579 static tree
25581 {
25582 tree type;
25592 {
25596 }
25598 /* This happens if we find @encode(T) (where T is a template
25599 typename or something dependent on a template typename) when
25600 parsing a template. In that case, we can't compile it
25601 immediately, but we rather create an AT_ENCODE_EXPR which will
25602 need to be instantiated when the template is used.
25603 */
25605 {
25609 }
25612 }
25614 /* Parse an Objective-C @defs expression. */
25616 static tree
25618 {
25619 tree name;
25627 }
25629 /* Parse an Objective-C protocol expression.
25631 objc-protocol-expression:
25632 @protocol ( identifier )
25634 Returns a representation of the protocol expression. */
25636 static tree
25638 {
25639 tree proto;
25647 }
25649 /* Parse an Objective-C selector expression.
25651 objc-selector-expression:
25652 @selector ( objc-method-signature )
25654 objc-method-signature:
25655 objc-selector
25656 objc-selector-seq
25658 objc-selector-seq:
25659 objc-selector :
25660 objc-selector-seq objc-selector :
25662 Returns a representation of the method selector. */
25664 static tree
25666 {
25678 {
25687 {
25688 /* Detect if we have a unary selector. */
25690 {
25693 }
25694 else
25695 {
25697 }
25698 }
25703 {
25704 sel_seq
25707 sel_seq
25710 }
25711 else
25712 sel_seq
25717 }
25719 finish_selector:
25723 }
25725 /* Parse a list of identifiers.
25727 objc-identifier-list:
25728 identifier
25729 objc-identifier-list , identifier
25731 Returns a TREE_LIST of identifier nodes. */
25733 static tree
25735 {
25736 tree identifier;
25737 tree list;
25748 {
25755 identifier));
25757 }
25760 }
25762 /* Parse an Objective-C alias declaration.
25764 objc-alias-declaration:
25765 @compatibility_alias identifier identifier ;
25767 This function registers the alias mapping with the Objective-C front end.
25768 It returns nothing. */
25770 static void
25772 {
25780 }
25782 /* Parse an Objective-C class forward-declaration.
25784 objc-class-declaration:
25785 @class objc-identifier-list ;
25787 The function registers the forward declarations with the Objective-C
25788 front end. It returns nothing. */
25790 static void
25792 {
25795 {
25796 tree id;
25806 else
25808 }
25810 }
25812 /* Parse a list of Objective-C protocol references.
25814 objc-protocol-refs-opt:
25815 objc-protocol-refs [opt]
25817 objc-protocol-refs:
25818 < objc-identifier-list >
25820 Returns a TREE_LIST of identifiers, if any. */
25822 static tree
25824 {
25828 {
25832 }
25835 }
25837 /* Parse a Objective-C visibility specification. */
25839 static void
25841 {
25845 {
25860 }
25862 /* Eat '@private'/'@protected'/'@public'. */
25864 }
25866 /* Parse an Objective-C method type. Return 'true' if it is a class
25867 (+) method, and 'false' if it is an instance (-) method. */
25871 {
25874 else
25876 }
25878 /* Parse an Objective-C protocol qualifier. */
25880 static tree
25882 {
25895 {
25900 }
25903 }
25905 /* Parse an Objective-C typename. */
25907 static tree
25909 {
25913 {
25919 /* An ObjC type name may consist of just protocol qualifiers, in which
25920 case the type shall default to 'id'. */
25922 {
25925 /* If the type could not be parsed, an error has already
25926 been produced. For error recovery, behave as if it had
25927 not been specified, which will use the default type
25928 'id'. */
25930 {
25932 /* We need to skip to the closing parenthesis as
25933 cp_parser_type_id() does not seem to do it for
25934 us. */
25939 }
25940 }
25944 }
25947 }
25949 /* Check to see if TYPE refers to an Objective-C selector name. */
25951 static bool
25953 {
25959 }
25961 /* Parse an Objective-C selector. */
25963 static tree
25965 {
25969 {
25972 }
25974 /* C++ operator names are allowed to appear in ObjC selectors. */
25976 {
25989 }
25990 }
25992 /* Parse an Objective-C params list. */
25994 static tree
25996 {
26002 {
26012 /* Detect if we have a unary selector. */
26015 {
26018 }
26022 {
26023 /* Something went quite wrong. There should be a colon
26024 here, but there is not. Stop parsing parameters. */
26026 }
26028 /* New ObjC allows attributes on parameters too. */
26033 params
26036 type_name,
26037 identifier,
26038 parm_attr));
26041 }
26044 {
26047 }
26049 /* We allow tail attributes for the method. */
26051 {
26059 }
26062 {
26065 }
26067 }
26069 /* Parse the non-keyword Objective-C params. */
26071 static tree
26074 {
26080 {
26082 tree parm;
26088 {
26093 }
26095 /* TODO: parse attributes for tail parameters. */
26104 }
26106 /* We allow tail attributes for the method. */
26108 {
26110 {
26115 }
26116 else
26117 /* We have an error, but parse the attributes, so that we can
26118 carry on. */
26124 }
26127 }
26129 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26131 static void
26133 {
26136 /* If the next token is `extern' and the following token is a string
26137 literal, then we have a linkage specification. */
26139 && cp_parser_is_pure_string_literal
26142 /* Handle #pragma, if any. */
26145 /* Allow stray semicolons. */
26148 /* Mark methods as optional or required, when building protocols. */
26150 {
26153 }
26155 {
26158 }
26161 /* Other stray characters must generate errors. */
26163 {
26167 }
26168 /* Finally, try to parse a block-declaration, or a function-definition. */
26169 else
26171 }
26173 /* Parse a method signature. */
26175 static tree
26177 {
26193 }
26195 static bool
26197 {
26198 tree tattr;
26203 /* If the attributes are followed by a method introducer, this is not allowed.
26204 Dump the attributes and flag the situation. */
26209 /* Otherwise, the attributes introduce some interstitial code, possibly so
26210 rewind to allow that check. */
26213 }
26215 /* Parse an Objective-C method prototype list. */
26217 static void
26219 {
26223 {
26225 {
26230 else
26234 {
26238 }
26241 }
26247 OPT_Wattributes,
26249 else
26250 /* Allow for interspersed non-ObjC++ code. */
26254 }
26258 else
26262 }
26264 /* Parse an Objective-C method definition list. */
26266 static void
26268 {
26272 {
26273 tree meth;
26276 {
26282 else
26287 {
26291 }
26293 NULL_TREE);
26295 /* For historical reasons, we accept an optional semicolon. */
26302 {
26309 }
26310 }
26311 /* The following case will be removed once @synthesize is
26312 completely implemented. */
26323 else
26324 /* Allow for interspersed non-ObjC++ code. */
26328 }
26332 else
26336 }
26338 /* Parse Objective-C ivars. */
26340 static void
26342 {
26353 {
26354 cp_decl_specifier_seq declspecs;
26356 tree prefix_attributes;
26364 CP_PARSER_FLAGS_OPTIONAL,
26368 /* auto, register, static, extern, mutable. */
26370 {
26373 }
26375 /* thread_local. */
26377 {
26380 }
26382 /* typedef. */
26384 {
26387 }
26392 /* Keep going until we hit the `;' at the end of the
26393 declaration. */
26395 {
26400 /* Check for a (possibly unnamed) bitfield declaration. */
26408 {
26409 /* Get the name of the bitfield. */
26412 sfk_none);
26414 eat_colon:
26416 /* Get the width of the bitfield. */
26417 width
26419 }
26420 else
26421 {
26422 /* Parse the declarator. */
26423 declarator
26429 }
26431 /* Look for attributes that apply to the ivar. */
26433 /* Remember which attributes are prefix attributes and
26434 which are not. */
26436 /* Combine the attributes. */
26440 /* Create the bitfield declaration. */
26442 width,
26443 attributes);
26444 else
26449 /* Add the instance variable. */
26453 /* Reset PREFIX_ATTRIBUTES. */
26462 {
26465 }
26467 }
26471 }
26476 /* Do not consume the RID_AT_END, so it will be read again as terminating
26477 the @interface of @implementation. */
26481 /* For historical reasons, we accept an optional semicolon. */
26484 }
26486 /* Parse an Objective-C protocol declaration. */
26488 static void
26490 {
26496 {
26501 }
26503 /* See if we have a forward declaration or a definition. */
26506 /* Try a forward declaration first. */
26508 {
26510 {
26511 tree id;
26521 else
26523 }
26525 }
26527 /* Ok, we got a full-fledged definition (or at least should). */
26528 else
26529 {
26534 }
26535 }
26537 /* Parse an Objective-C superclass or category. */
26539 static void
26544 {
26550 {
26553 }
26555 {
26558 /* If there is no category name, and this is an @interface, we
26559 have a class extension. */
26561 {
26564 }
26565 else
26569 }
26570 }
26572 /* Parse an Objective-C class interface. */
26574 static void
26576 {
26583 {
26584 /* It's hard to recover because even if valid @interface stuff
26585 is to follow, we can't compile it (or validate it) if we
26586 don't even know which class it refers to. Let's assume this
26587 was a stray '@interface' token in the stream and skip it.
26588 */
26590 }
26595 /* We have either a class or a category on our hands. */
26598 else
26599 {
26601 /* Handle instance variable declarations, if any. */
26604 }
26607 }
26609 /* Parse an Objective-C class implementation. */
26611 static void
26613 {
26620 {
26621 /* It's hard to recover because even if valid @implementation
26622 stuff is to follow, we can't compile it (or validate it) if
26623 we don't even know which class it refers to. Let's assume
26624 this was a stray '@implementation' token in the stream and
26625 skip it.
26626 */
26628 }
26632 /* We have either a class or a category on our hands. */
26635 else
26636 {
26638 /* Handle instance variable declarations, if any. */
26641 }
26644 }
26646 /* Consume the @end token and finish off the implementation. */
26648 static void
26650 {
26653 }
26655 /* Parse an Objective-C declaration. */
26657 static void
26659 {
26660 /* Try to figure out what kind of declaration is present. */
26665 {
26681 }
26684 {
26707 }
26708 }
26710 /* Parse an Objective-C try-catch-finally statement.
26712 objc-try-catch-finally-stmt:
26713 @try compound-statement objc-catch-clause-seq [opt]
26714 objc-finally-clause [opt]
26716 objc-catch-clause-seq:
26717 objc-catch-clause objc-catch-clause-seq [opt]
26719 objc-catch-clause:
26720 @catch ( objc-exception-declaration ) compound-statement
26722 objc-finally-clause:
26723 @finally compound-statement
26725 objc-exception-declaration:
26726 parameter-declaration
26727 '...'
26729 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26731 Returns NULL_TREE.
26733 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26734 for C. Keep them in sync. */
26736 static tree
26738 {
26739 location_t location;
26740 tree stmt;
26745 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26746 node, lest it get absorbed into the surrounding block. */
26752 {
26761 {
26762 /* We have "@catch (...)" (where the '...' are literally
26763 what is in the code). Skip the '...'.
26764 parameter_declaration is set to NULL_TREE, and
26765 objc_being_catch_clauses() knows that that means
26766 '...'. */
26769 }
26770 else
26771 {
26772 /* We have "@catch (NSException *exception)" or something
26773 like that. Parse the parameter declaration. */
26777 else
26782 }
26785 else
26786 {
26787 /* If there was no open parenthesis, we are recovering from
26788 an error, and we are trying to figure out what mistake
26789 the user has made. */
26791 /* If there is an immediate closing parenthesis, the user
26792 probably forgot the opening one (ie, they typed "@catch
26793 NSException *e)". Parse the closing parenthesis and keep
26794 going. */
26798 /* If these is no immediate closing parenthesis, the user
26799 probably doesn't know that parenthesis are required at
26800 all (ie, they typed "@catch NSException *e"). So, just
26801 forget about the closing parenthesis and keep going. */
26802 }
26806 }
26808 {
26811 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26812 node, lest it get absorbed into the surrounding block. */
26816 }
26819 }
26821 /* Parse an Objective-C synchronized statement.
26823 objc-synchronized-stmt:
26824 @synchronized ( expression ) compound-statement
26826 Returns NULL_TREE. */
26828 static tree
26830 {
26831 location_t location;
26842 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26843 node, lest it get absorbed into the surrounding block. */
26848 }
26850 /* Parse an Objective-C throw statement.
26852 objc-throw-stmt:
26853 @throw assignment-expression [opt] ;
26855 Returns a constructed '@throw' statement. */
26857 static tree
26859 {
26871 }
26873 /* Parse an Objective-C statement. */
26875 static tree
26877 {
26878 /* Try to figure out what kind of declaration is present. */
26882 {
26893 }
26896 }
26898 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26899 look ahead to see if an objc keyword follows the attributes. This
26900 is to detect the use of prefix attributes on ObjC @interface and
26901 @protocol. */
26903 static bool
26905 {
26910 {
26913 }
26916 }
26918 /* This routine is a minimal replacement for
26919 c_parser_struct_declaration () used when parsing the list of
26920 types/names or ObjC++ properties. For example, when parsing the
26921 code
26923 @property (readonly) int a, b, c;
26925 this function is responsible for parsing "int a, int b, int c" and
26926 returning the declarations as CHAIN of DECLs.
26928 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26929 similar parsing. */
26930 static tree
26932 {
26934 cp_decl_specifier_seq declspecs;
26936 tree prefix_attributes;
26939 CP_PARSER_FLAGS_NONE,
26946 /* auto, register, static, extern, mutable. */
26948 {
26951 }
26953 /* thread_local. */
26955 {
26958 }
26960 /* typedef. */
26962 {
26965 }
26970 /* Keep going until we hit the `;' at the end of the declaration. */
26972 {
26977 /* Parse the declarator. */
26981 /* Look for attributes that apply to the ivar. */
26983 /* Remember which attributes are prefix attributes and
26984 which are not. */
26986 /* Combine the attributes. */
26996 /* Reset PREFIX_ATTRIBUTES. */
27007 {
27010 }
27011 else
27013 }
27015 }
27017 /* Parse an Objective-C @property declaration. The syntax is:
27019 objc-property-declaration:
27020 '@property' objc-property-attributes[opt] struct-declaration ;
27022 objc-property-attributes:
27023 '(' objc-property-attribute-list ')'
27025 objc-property-attribute-list:
27026 objc-property-attribute
27027 objc-property-attribute-list, objc-property-attribute
27029 objc-property-attribute
27030 'getter' = identifier
27031 'setter' = identifier
27032 'readonly'
27033 'readwrite'
27034 'assign'
27035 'retain'
27036 'copy'
27037 'nonatomic'
27039 For example:
27040 @property NSString *name;
27041 @property (readonly) id object;
27042 @property (retain, nonatomic, getter=getTheName) id name;
27043 @property int a, b, c;
27045 PS: This function is identical to
27046 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27047 static void
27049 {
27050 /* The following variables hold the attributes of the properties as
27051 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27052 seen. When we see an attribute, we set them to 'true' (if they
27053 are boolean properties) or to the identifier (if they have an
27054 argument, ie, for getter and setter). Note that here we only
27055 parse the list of attributes, check the syntax and accumulate the
27056 attributes that we find. objc_add_property_declaration() will
27057 then process the information. */
27067 /* 'properties' is the list of properties that we read. Usually a
27068 single one, but maybe more (eg, in "@property int a, b, c;" there
27069 are three). */
27070 tree properties;
27071 location_t loc;
27077 /* Parse the optional attribute list... */
27079 {
27080 /* Eat the '('. */
27084 {
27090 {
27093 }
27097 {
27108 {
27112 else
27117 }
27120 {
27124 }
27126 {
27128 {
27131 }
27132 else
27136 else
27138 }
27139 else
27140 {
27142 {
27145 }
27146 else
27148 }
27154 }
27161 else
27163 }
27165 /* FIXME: "@property (setter, assign);" will generate a spurious
27166 "error: expected ‘)’ before ‘,’ token". This is because
27167 cp_parser_require, unlike the C counterpart, will produce an
27168 error even if we are in error recovery. */
27170 {
27175 }
27176 }
27178 /* ... and the property declaration(s). */
27182 {
27184 /* If the next token is now a `;', consume it. */
27188 }
27192 else
27193 {
27194 /* Comma-separated properties are chained together in
27195 reverse order; add them one by one. */
27204 }
27207 }
27209 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27211 objc-synthesize-declaration:
27212 @synthesize objc-synthesize-identifier-list ;
27214 objc-synthesize-identifier-list:
27215 objc-synthesize-identifier
27216 objc-synthesize-identifier-list, objc-synthesize-identifier
27218 objc-synthesize-identifier
27219 identifier
27220 identifier = identifier
27222 For example:
27223 @synthesize MyProperty;
27224 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27226 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27227 for C. Keep them in sync.
27228 */
27229 static void
27231 {
27233 location_t loc;
27238 {
27242 {
27245 }
27247 {
27251 {
27254 }
27255 }
27256 else
27261 else
27263 }
27266 }
27268 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27270 objc-dynamic-declaration:
27271 @dynamic identifier-list ;
27273 For example:
27274 @dynamic MyProperty;
27275 @dynamic MyProperty, AnotherProperty;
27277 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27278 for C. Keep them in sync.
27279 */
27280 static void
27282 {
27284 location_t loc;
27289 {
27290 tree property;
27293 {
27296 }
27300 else
27302 }
27305 }
27307 \f
27308 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27310 /* Returns name of the next clause.
27311 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27312 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27313 returned and the token is consumed. */
27315 static pragma_omp_clause
27317 {
27329 {
27334 {
27437 }
27438 }
27444 }
27446 /* Validate that a clause of the given type does not already exist. */
27448 static void
27451 {
27452 tree c;
27456 {
27459 }
27460 }
27462 /* OpenMP 2.5:
27463 variable-list:
27464 identifier
27465 variable-list , identifier
27467 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27468 colon). An opening parenthesis will have been consumed by the caller.
27470 If KIND is nonzero, create the appropriate node and install the decl
27471 in OMP_CLAUSE_DECL and add the node to the head of the list.
27473 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27474 return the list created.
27476 COLON can be NULL if only closing parenthesis should end the list,
27477 or pointer to bool which will receive false if the list is terminated
27478 by closing parenthesis or true if the list is terminated by colon. */
27480 static tree
27483 {
27487 {
27490 }
27492 {
27509 {
27511 {
27517 {
27525 parser->colon_corrects_to_scope_p
27529 else
27530 {
27531 /* Look for `:'. */
27535 CPP_CLOSE_SQUARE))
27537 }
27538 /* Look for the closing `]'. */
27540 RT_CLOSE_SQUARE))
27543 }
27547 }
27553 }
27554 else
27557 get_comma:
27561 }
27567 {
27571 }
27574 {
27577 /* Try to resync to an unnested comma. Copied from
27578 cp_parser_parenthesized_expression_list. */
27579 skip_comma:
27588 }
27591 }
27593 /* Similarly, but expect leading and trailing parenthesis. This is a very
27594 common case for omp clauses. */
27596 static tree
27598 {
27602 }
27604 /* OpenMP 3.0:
27605 collapse ( constant-expression ) */
27607 static tree
27609 {
27611 location_t loc;
27612 HOST_WIDE_INT n;
27632 {
27635 }
27643 }
27645 /* OpenMP 2.5:
27646 default ( shared | none ) */
27648 static tree
27650 {
27652 tree c;
27657 {
27662 {
27677 }
27680 }
27681 else
27682 {
27683 invalid_kind:
27685 }
27701 }
27703 /* OpenMP 3.1:
27704 final ( expression ) */
27706 static tree
27708 {
27729 }
27731 /* OpenMP 2.5:
27732 if ( expression ) */
27734 static tree
27736 {
27757 }
27759 /* OpenMP 3.1:
27760 mergeable */
27762 static tree
27765 {
27766 tree c;
27769 location);
27774 }
27776 /* OpenMP 2.5:
27777 nowait */
27779 static tree
27782 {
27783 tree c;
27790 }
27792 /* OpenMP 2.5:
27793 num_threads ( expression ) */
27795 static tree
27797 location_t location)
27798 {
27820 }
27822 /* OpenMP 2.5:
27823 ordered */
27825 static tree
27828 {
27829 tree c;
27837 }
27839 /* OpenMP 2.5:
27840 reduction ( reduction-operator : variable-list )
27842 reduction-operator:
27843 One of: + * - & ^ | && ||
27845 OpenMP 3.1:
27847 reduction-operator:
27848 One of: + * - & ^ | && || min max
27850 OpenMP 4.0:
27852 reduction-operator:
27853 One of: + * - & ^ | && ||
27854 id-expression */
27856 static tree
27858 {
27866 {
27876 }
27880 else
27881 {
27892 {
27922 }
27923 else
27924 {
27926 resync_fail:
27931 }
27932 }
27938 NULL);
27940 {
27943 }
27946 }
27948 /* OpenMP 2.5:
27949 schedule ( schedule-kind )
27950 schedule ( schedule-kind , expression )
27952 schedule-kind:
27953 static | dynamic | guided | runtime | auto */
27955 static tree
27957 {
27966 {
27971 {
27992 }
27993 }
27998 else
28003 {
28018 else
28023 }
28031 invalid_kind:
28033 resync_fail:
28038 }
28040 /* OpenMP 3.0:
28041 untied */
28043 static tree
28046 {
28047 tree c;
28054 }
28056 /* OpenMP 4.0:
28057 inbranch
28058 notinbranch */
28060 static tree
28063 {
28068 }
28070 /* OpenMP 4.0:
28071 parallel
28072 for
28073 sections
28074 taskgroup */
28076 static tree
28080 {
28084 }
28086 /* OpenMP 4.0:
28087 num_teams ( expression ) */
28089 static tree
28091 location_t location)
28092 {
28114 }
28116 /* OpenMP 4.0:
28117 thread_limit ( expression ) */
28119 static tree
28121 location_t location)
28122 {
28144 }
28146 /* OpenMP 4.0:
28147 aligned ( variable-list )
28148 aligned ( variable-list : constant-expression ) */
28150 static tree
28152 {
28163 {
28173 }
28179 }
28181 /* OpenMP 4.0:
28182 linear ( variable-list )
28183 linear ( variable-list : expression ) */
28185 static tree
28188 {
28199 {
28203 {
28206 }
28214 }
28220 }
28222 /* OpenMP 4.0:
28223 safelen ( constant-expression ) */
28225 static tree
28227 location_t location)
28228 {
28249 }
28251 /* OpenMP 4.0:
28252 simdlen ( constant-expression ) */
28254 static tree
28256 location_t location)
28257 {
28278 }
28280 /* OpenMP 4.0:
28281 depend ( depend-kind : variable-list )
28283 depend-kind:
28284 in | out | inout */
28286 static tree
28288 {
28296 {
28306 else
28308 }
28309 else
28317 NULL);
28324 invalid_kind:
28326 resync_fail:
28331 }
28333 /* OpenMP 4.0:
28334 map ( map-kind : variable-list )
28335 map ( variable-list )
28337 map-kind:
28338 alloc | to | from | tofrom */
28340 static tree
28342 {
28351 {
28363 else
28364 {
28370 }
28373 }
28376 NULL);
28382 }
28384 /* OpenMP 4.0:
28385 device ( expression ) */
28387 static tree
28389 location_t location)
28390 {
28412 }
28414 /* OpenMP 4.0:
28415 dist_schedule ( static )
28416 dist_schedule ( static , expression ) */
28418 static tree
28420 location_t location)
28421 {
28434 {
28445 }
28450 location);
28454 invalid_kind:
28456 resync_fail:
28461 }
28463 /* OpenMP 4.0:
28464 proc_bind ( proc-bind-kind )
28466 proc-bind-kind:
28467 master | close | spread */
28469 static tree
28471 location_t location)
28472 {
28473 tree c;
28480 {
28490 else
28492 }
28493 else
28502 location);
28507 invalid_kind:
28509 resync_fail:
28514 }
28516 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28517 is a bitmask in MASK. Return the list of clauses found; the result
28518 of clause default goes in *pdefault. */
28520 static tree
28524 {
28531 {
28532 pragma_omp_clause c_kind;
28543 {
28555 clauses);
28569 clauses);
28578 clauses);
28602 clauses);
28616 clauses);
28633 OMP_CLAUSE_NOTINBRANCH,
28642 {
28643 clause_not_first:
28647 }
28672 clauses);
28677 clauses);
28682 clauses);
28745 }
28750 {
28751 /* Remove the invalid clause(s) from the list to avoid
28752 confusing the rest of the compiler. */
28755 }
28756 }
28757 saw_error:
28758 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28759 no reason to skip to the end. */
28765 }
28767 /* OpenMP 2.5:
28768 structured-block:
28769 statement
28771 In practice, we're also interested in adding the statement to an
28772 outer node. So it is convenient if we work around the fact that
28773 cp_parser_statement calls add_stmt. */
28775 static unsigned
28777 {
28780 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28781 This preserves the "not within loop or switch" style error messages
28782 for nonsense cases like
28783 void foo() {
28784 #pragma omp single
28785 break;
28786 }
28787 */
28792 }
28794 static void
28796 {
28798 }
28800 static tree
28802 {
28810 }
28812 /* OpenMP 2.5:
28813 # pragma omp atomic new-line
28814 expression-stmt
28816 expression-stmt:
28817 x binop= expr | x++ | ++x | x-- | --x
28818 binop:
28819 +, *, -, /, &, ^, |, <<, >>
28821 where x is an lvalue expression with scalar type.
28823 OpenMP 3.1:
28824 # pragma omp atomic new-line
28825 update-stmt
28827 # pragma omp atomic read new-line
28828 read-stmt
28830 # pragma omp atomic write new-line
28831 write-stmt
28833 # pragma omp atomic update new-line
28834 update-stmt
28836 # pragma omp atomic capture new-line
28837 capture-stmt
28839 # pragma omp atomic capture new-line
28840 capture-block
28842 read-stmt:
28843 v = x
28844 write-stmt:
28845 x = expr
28846 update-stmt:
28847 expression-stmt | x = x binop expr
28848 capture-stmt:
28849 v = expression-stmt
28850 capture-block:
28851 { v = x; update-stmt; } | { update-stmt; v = x; }
28853 OpenMP 4.0:
28854 update-stmt:
28855 expression-stmt | x = x binop expr | x = expr binop x
28856 capture-stmt:
28857 v = update-stmt
28858 capture-block:
28859 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28861 where x and v are lvalue expressions with scalar type. */
28863 static void
28865 {
28873 {
28878 {
28884 }
28885 }
28887 {
28899 else
28903 }
28905 {
28911 {
28916 {
28919 }
28920 }
28921 }
28925 {
28936 else
28942 {
28943 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28944 opcode. */
28949 }
28953 {
28956 }
28957 else
28958 {
28965 }
28968 }
28970 restart:
28975 {
28982 /* FALLTHROUGH */
28992 /* FALLTHROUGH */
29007 /* Undo effects of boolean_increment for post {in,de}crement. */
29009 /* FALLTHRU */
29013 {
29014 /* Undo effects of boolean_increment. */
29016 {
29017 /* This is pre or post increment. */
29022 && !structured_block
29026 }
29027 }
29028 /* FALLTHRU */
29031 {
29066 {
29070 }
29073 {
29079 {
29084 }
29086 {
29097 {
29099 {
29104 }
29105 else
29107 }
29111 }
29114 {
29121 }
29125 }
29129 {
29132 {
29140 }
29142 {
29147 }
29182 }
29193 /* FALLTHROUGH */
29198 }
29205 }
29206 stmt_done:
29208 {
29221 }
29223 {
29226 }
29227 done:
29233 saw_error:
29236 {
29240 {
29244 }
29245 }
29246 }
29249 /* OpenMP 2.5:
29250 # pragma omp barrier new-line */
29252 static void
29254 {
29257 }
29259 /* OpenMP 2.5:
29260 # pragma omp critical [(name)] new-line
29261 structured-block */
29263 static tree
29265 {
29269 {
29281 }
29286 }
29288 /* OpenMP 2.5:
29289 # pragma omp flush flush-vars[opt] new-line
29291 flush-vars:
29292 ( variable-list ) */
29294 static void
29296 {
29302 }
29304 /* Helper function, to parse omp for increment expression. */
29306 static tree
29308 {
29313 {
29316 }
29319 {
29328 /* Fall through: OpenMP disallows NE_EXPR. */
29331 }
29333 /* If decl is an iterator, preserve LHS and RHS of the relational
29334 expr until finish_omp_for. */
29344 }
29346 /* Helper function, to parse omp for increment expression. */
29348 static tree
29350 {
29354 cp_id_kind idk;
29358 {
29366 }
29374 {
29379 }
29386 {
29390 }
29402 do
29403 {
29410 {
29412 {
29415 else
29417 tf_warning_or_error);
29418 }
29419 else
29422 }
29423 }
29427 {
29431 }
29432 else
29436 }
29438 /* Parse the initialization statement of either an OpenMP for loop or
29439 a Cilk Plus for loop.
29441 Return true if the resulting construct should have an
29442 OMP_CLAUSE_PRIVATE added to it. */
29444 static bool
29452 {
29458 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29460 init-expr:
29461 var = lb
29462 integer-type var = lb
29463 random-access-iterator-type var = lb
29464 pointer-type var = lb
29465 */
29466 cp_decl_specifier_seq type_specifiers;
29468 /* First, try to parse as an initialized declaration. See
29469 cp_parser_condition, from whence the bulk of this is copied. */
29476 {
29477 /* If parsing a type specifier seq succeeded, then this
29478 MUST be a initialized declaration. */
29483 CP_PARSER_DECLARATOR_NAMED,
29494 else
29495 {
29505 {
29507 CPP_OPEN_PAREN))
29508 {
29512 else
29515 }
29516 else
29517 /* Trigger an error. */
29522 }
29526 {
29534 {
29537 auto_node);
29542 }
29545 asm_specification,
29546 LOOKUP_ONLYCONVERTING);
29548 {
29551 }
29552 else
29555 }
29556 else
29557 {
29558 /* Consume '='. */
29562 non_class:
29565 else
29568 asm_specification,
29569 LOOKUP_ONLYCONVERTING);
29570 }
29574 }
29575 }
29576 else
29577 {
29578 cp_id_kind idk;
29579 /* If parsing a type specifier sequence failed, then
29580 this MUST be a simple expression. */
29588 && decl
29591 {
29592 tree rhs;
29599 rhs,
29600 tf_warning_or_error));
29602 }
29603 else
29604 {
29609 {
29613 }
29614 }
29615 }
29617 }
29619 /* Parse the restricted form of the for statement allowed by OpenMP. */
29621 static tree
29624 {
29628 location_t loc_first;
29647 {
29650 location_t loc;
29654 {
29657 }
29660 {
29663 }
29672 add_private_clause
29679 {
29682 {
29688 }
29689 else
29691 }
29698 {
29703 {
29707 }
29710 {
29711 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29712 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29717 {
29720 }
29721 else
29722 {
29725 }
29729 }
29730 else
29731 {
29736 }
29737 }
29740 {
29741 tree c;
29743 {
29752 decl);
29756 decl);
29757 }
29759 {
29764 {
29767 }
29768 }
29769 }
29778 {
29779 /* If decl is an iterator, preserve the operator on decl
29780 until finish_omp_for. */
29782 && ((processing_template_decl
29786 else
29790 }
29805 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29806 in between the collapsed for loops to be still considered perfectly
29807 nested. Hopefully the final version clarifies this.
29808 For now handle (multiple) {'s and empty statements. */
29810 do
29811 {
29815 {
29817 bracecount++;
29818 }
29822 else
29823 {
29830 }
29831 }
29835 {
29838 }
29839 }
29841 /* Note that we saved the original contents of this flag when we entered
29842 the structured block, and so we don't need to re-save it here. */
29845 else
29848 /* Note that the grammar doesn't call for a structured block here,
29849 though the loop as a whole is a structured block. */
29856 else
29861 {
29863 {
29865 nbraces--;
29866 }
29869 else
29870 {
29872 {
29875 }
29880 }
29881 }
29888 }
29890 /* Helper function for OpenMP parsing, split clauses and call
29891 finish_omp_clauses on each of the set of clauses afterwards. */
29893 static void
29896 {
29902 }
29904 /* OpenMP 4.0:
29905 #pragma omp simd simd-clause[optseq] new-line
29906 for-loop */
29908 #define OMP_SIMD_CLAUSE_MASK \
29909 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29917 static tree
29920 {
29932 {
29935 }
29946 }
29948 /* OpenMP 2.5:
29949 #pragma omp for for-clause[optseq] new-line
29950 for-loop
29952 OpenMP 4.0:
29953 #pragma omp for simd for-simd-clause[optseq] new-line
29954 for-loop */
29956 #define OMP_FOR_CLAUSE_MASK \
29957 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29966 static tree
29969 {
29980 {
29985 {
29993 cclauses);
29997 cclauses);
30009 }
30010 }
30012 {
30015 }
30020 {
30023 }
30034 }
30036 /* OpenMP 2.5:
30037 # pragma omp master new-line
30038 structured-block */
30040 static tree
30042 {
30046 }
30048 /* OpenMP 2.5:
30049 # pragma omp ordered new-line
30050 structured-block */
30052 static tree
30054 {
30058 }
30060 /* OpenMP 2.5:
30062 section-scope:
30063 { section-sequence }
30065 section-sequence:
30066 section-directive[opt] structured-block
30067 section-sequence section-directive structured-block */
30069 static tree
30071 {
30082 {
30086 }
30089 {
30097 {
30101 }
30103 {
30106 }
30111 }
30122 }
30124 /* OpenMP 2.5:
30125 # pragma omp sections sections-clause[optseq] newline
30126 sections-scope */
30128 #define OMP_SECTIONS_CLAUSE_MASK \
30129 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30135 static tree
30138 {
30150 {
30153 }
30160 }
30162 /* OpenMP 2.5:
30163 # pragma omp parallel parallel-clause[optseq] new-line
30164 structured-block
30165 # pragma omp parallel for parallel-for-clause[optseq] new-line
30166 structured-block
30167 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30168 structured-block
30170 OpenMP 4.0:
30171 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30172 structured-block */
30174 #define OMP_PARALLEL_CLAUSE_MASK \
30175 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30185 static tree
30188 {
30197 {
30210 block);
30215 }
30217 {
30221 }
30223 {
30226 }
30228 {
30232 {
30242 block);
30245 }
30246 }
30256 }
30258 /* OpenMP 2.5:
30259 # pragma omp single single-clause[optseq] new-line
30260 structured-block */
30262 #define OMP_SINGLE_CLAUSE_MASK \
30263 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30268 static tree
30270 {
30280 }
30282 /* OpenMP 3.0:
30283 # pragma omp task task-clause[optseq] new-line
30284 structured-block */
30286 #define OMP_TASK_CLAUSE_MASK \
30287 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30297 static tree
30299 {
30310 }
30312 /* OpenMP 3.0:
30313 # pragma omp taskwait new-line */
30315 static void
30317 {
30320 }
30322 /* OpenMP 3.1:
30323 # pragma omp taskyield new-line */
30325 static void
30327 {
30330 }
30332 /* OpenMP 4.0:
30333 # pragma omp taskgroup new-line
30334 structured-block */
30336 static tree
30338 {
30342 }
30345 /* OpenMP 2.5:
30346 # pragma omp threadprivate (variable-list) */
30348 static void
30350 {
30351 tree vars;
30357 }
30359 /* OpenMP 4.0:
30360 # pragma omp cancel cancel-clause[optseq] new-line */
30362 #define OMP_CANCEL_CLAUSE_MASK \
30363 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30369 static void
30371 {
30375 }
30377 /* OpenMP 4.0:
30378 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30380 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30381 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30386 static void
30388 {
30389 tree clauses;
30393 {
30398 {
30401 }
30402 }
30404 {
30408 }
30411 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30413 pragma_tok);
30415 }
30417 /* OpenMP 4.0:
30418 #pragma omp distribute distribute-clause[optseq] new-line
30419 for-loop */
30421 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30422 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30427 static tree
30430 {
30439 {
30447 else
30450 {
30456 {
30459 cclauses);
30460 else
30462 cclauses);
30463 }
30468 cclauses);
30469 else
30471 cclauses);
30483 }
30484 }
30486 {
30489 }
30494 {
30497 }
30508 }
30510 /* OpenMP 4.0:
30511 # pragma omp teams teams-clause[optseq] new-line
30512 structured-block */
30514 #define OMP_TEAMS_CLAUSE_MASK \
30515 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30523 static tree
30526 {
30535 {
30539 {
30547 cclauses);
30551 cclauses);
30562 }
30563 }
30565 {
30568 }
30573 {
30576 }
30584 }
30586 /* OpenMP 4.0:
30587 # pragma omp target data target-data-clause[optseq] new-line
30588 structured-block */
30590 #define OMP_TARGET_DATA_CLAUSE_MASK \
30591 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30595 static tree
30597 {
30609 }
30611 /* OpenMP 4.0:
30612 # pragma omp target update target-update-clause[optseq] new-line */
30614 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30615 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30620 static bool
30623 {
30625 {
30627 "%<#pragma omp target update%> may only be "
30631 }
30633 tree clauses
30638 {
30640 "%<#pragma omp target update must contain at least one "
30643 }
30651 }
30653 /* OpenMP 4.0:
30654 # pragma omp target target-clause[optseq] new-line
30655 structured-block */
30657 #define OMP_TARGET_CLAUSE_MASK \
30658 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30662 static bool
30665 {
30667 {
30671 }
30674 {
30679 {
30687 {
30689 OMP_TARGET_CLAUSE_MASK,
30690 cclauses);
30692 }
30708 }
30710 {
30713 }
30715 {
30719 }
30721 {
30724 }
30725 }
30739 }
30741 /* OpenMP 4.0:
30742 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30744 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30745 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30752 static void
30755 {
30757 cp_omp_declare_simd_data data;
30759 {
30764 }
30775 {
30779 {
30792 }
30797 "%<#pragma omp declare simd%> not immediately followed by "
30801 }
30802 }
30804 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30805 This function is modelled similar to the late parsing of omp declare
30806 simd. */
30808 static tree
30810 {
30816 {
30822 }
30824 {
30828 }
30833 {
30840 NULL);
30854 }
30859 }
30861 /* Finalize #pragma omp declare simd clauses after direct declarator has
30862 been parsed, and put that into "omp declare simd" attribute. */
30864 static tree
30866 {
30872 {
30877 }
30882 {
30900 }
30904 }
30907 /* OpenMP 4.0:
30908 # pragma omp declare target new-line
30909 declarations and definitions
30910 # pragma omp end declare target new-line */
30912 static void
30914 {
30917 }
30919 static void
30921 {
30924 {
30927 }
30929 {
30933 {
30936 }
30939 else
30940 {
30944 }
30945 }
30946 else
30947 {
30951 }
30955 "%<#pragma omp end declare target%> without corresponding "
30957 else
30959 }
30961 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30962 expression and optional initializer clause of
30963 #pragma omp declare reduction. We store the expression(s) as
30964 either 3, 6 or 7 special statements inside of the artificial function's
30965 body. The first two statements are DECL_EXPRs for the artificial
30966 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30967 expression that uses those variables.
30968 If there was any INITIALIZER clause, this is followed by further statements,
30969 the fourth and fifth statements are DECL_EXPRs for the artificial
30970 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30971 constructor variant (first token after open paren is not omp_priv),
30972 then the sixth statement is a statement with the function call expression
30973 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30974 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30975 to initialize the OMP_PRIV artificial variable and there is seventh
30976 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30978 static bool
30980 {
30992 tree combiner;
31007 {
31010 }
31013 {
31020 {
31023 }
31039 {
31043 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31047 == CPP_CLOSE_PAREN
31050 {
31054 }
31059 }
31060 else
31061 {
31077 {
31082 }
31084 tree arg;
31097 }
31108 }
31114 }
31116 /* OpenMP 4.0
31117 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31118 initializer-clause[opt] new-line
31120 initializer-clause:
31121 initializer (omp_priv initializer)
31122 initializer (function-name (argument-list)) */
31124 static void
31127 {
31137 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31144 {
31176 }
31188 /* Types may not be defined in declare reduction type list. */
31191 parser->type_definition_forbidden_message
31197 saved_colon_doesnt_start_class_def_p
31202 {
31206 ;
31227 else
31232 else
31234 }
31236 /* Restore the saved message. */
31239 parser->colon_doesnt_start_class_def_p
31244 {
31245 fail:
31248 }
31254 {
31255 tree fntype
31258 NULL_TREE);
31277 {
31282 }
31284 {
31286 {
31295 }
31302 }
31303 else
31304 {
31307 }
31310 else
31313 {
31316 }
31318 {
31321 else
31326 }
31331 else
31332 {
31341 }
31348 }
31352 done:
31353 /* Free any declarators allocated. */
31355 }
31357 /* OpenMP 4.0
31358 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31359 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31360 initializer-clause[opt] new-line
31361 #pragma omp declare target new-line */
31363 static void
31366 {
31368 {
31373 {
31376 context);
31378 }
31381 {
31384 context);
31386 }
31388 {
31391 }
31393 {
31397 }
31398 }
31402 }
31404 /* Main entry point to OpenMP statement pragmas. */
31406 static void
31408 {
31409 tree stmt;
31414 {
31462 }
31466 }
31467 \f
31468 /* Transactional Memory parsing routines. */
31470 /* Parse a transaction attribute.
31472 txn-attribute:
31473 attribute
31474 [ [ identifier ] ]
31476 ??? Simplify this when C++0x bracket attributes are
31477 implemented properly. */
31479 static tree
31481 {
31496 {
31500 /* For keywords, use the canonical spelling,
31501 not the parsed identifier. */
31505 }
31506 else
31510 error1:
31513 }
31515 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31517 transaction-statement:
31518 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31519 compound-statement
31520 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31521 */
31523 static tree
31525 {
31540 else
31541 {
31545 }
31547 /* Parse a noexcept specification. */
31550 /* Keep track if we're in the lexical scope of an outer transaction. */
31562 }
31564 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31566 transaction-expression:
31567 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31568 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31569 */
31571 static tree
31573 {
31598 /* Set this early. This might mean that we allow transaction_cancel in
31599 an expression that we find out later actually has to be a constexpr.
31600 However, we expect that cxx_constant_value will be able to deal with
31601 this; also, if the noexcept has no constexpr, then what we parse next
31602 really is a transaction's body. */
31605 /* Parse a noexcept specification. */
31611 {
31618 }
31619 else
31620 {
31621 /* The only expression that is available got parsed for the noexcept
31622 already. noexcept is true then. */
31625 }
31634 }
31636 /* Parse a function-transaction-block.
31638 function-transaction-block:
31639 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31640 function-body
31641 __transaction_atomic txn-attribute[opt] function-try-block
31642 __transaction_relaxed ctor-initializer[opt] function-body
31643 __transaction_relaxed function-try-block
31644 */
31646 static bool
31648 {
31664 else
31665 {
31669 }
31677 else
31678 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31686 }
31688 /* Parse a __transaction_cancel statement.
31690 cancel-statement:
31691 __transaction_cancel txn-attribute[opt] ;
31692 __transaction_cancel txn-attribute[opt] throw-expression ;
31694 ??? Cancel and throw is not yet implemented. */
31696 static tree
31698 {
31704 RT_TRANSACTION_CANCEL);
31711 /* ??? Parse cancel-and-throw here. */
31716 {
31720 }
31722 {
31726 }
31728 {
31731 {
31737 }
31738 }
31740 {
31744 }
31750 }
31751 \f
31752 /* The parser. */
31756 \f
31757 /* Special handling for the first token or line in the file. The first
31758 thing in the file might be #pragma GCC pch_preprocess, which loads a
31759 PCH file, which is a GC collection point. So we need to handle this
31760 first pragma without benefit of an existing lexer structure.
31762 Always returns one token to the caller in *FIRST_TOKEN. This is
31763 either the true first token of the file, or the first token after
31764 the initial pragma. */
31766 static void
31768 {
31777 {
31784 }
31785 else
31788 /* Skip to the end of the pragma. */
31792 /* Now actually load the PCH file. */
31796 /* Read one more token to return to our caller. We have to do this
31797 after reading the PCH file in, since its pointers have to be
31798 live. */
31800 }
31802 /* Parses the grainsize pragma for the _Cilk_for statement.
31803 Syntax:
31804 #pragma cilk grainsize = <VALUE>. */
31806 static void
31808 {
31810 {
31815 {
31818 }
31820 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31823 else
31825 "%<#pragma cilk grainsize%> is not followed by "
31828 }
31830 }
31832 /* Normal parsing of a pragma token. Here we can (and must) use the
31833 regular lexer. */
31835 static bool
31837 {
31849 {
31857 {
31867 }
31872 {
31882 }
31887 {
31893 "%<#pragma omp taskwait%> may only be "
31898 }
31903 {
31909 "%<#pragma omp taskyield%> may only be "
31914 }
31919 {
31925 "%<#pragma omp cancel%> may only be "
31930 }
31935 {
31941 "%<#pragma omp cancellation point%> may only be "
31946 }
31984 "%<#pragma omp section%> may only be used in "
31989 {
31996 {
31999 }
32002 }
32006 {
32010 }
32016 {
32020 }
32022 /* Ignore the pragma if Cilk Plus is not enabled. */
32024 {
32027 }
32028 else
32029 {
32033 }
32040 bad_stmt:
32043 }
32047 }
32049 /* The interface the pragma parsers have to the lexer. */
32051 enum cpp_ttype
32053 {
32066 else
32067 {
32071 }
32074 }
32076 \f
32077 /* External interface. */
32079 /* Parse one entire translation unit. */
32081 void
32083 {
32095 }
32097 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32098 vectorlength clause:
32099 Syntax:
32100 vectorlength ( constant-expression ) */
32102 static tree
32105 {
32107 tree expr;
32108 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32109 safelen clause. Thus, vectorlength is represented as OMP 4.0
32110 safelen. For SIMD-enabled function it is represented by OMP 4.0
32111 simdlen. */
32114 loc);
32115 else
32117 loc);
32125 /* If expr == error_mark_node, then don't emit any errors nor
32126 create a clause. if any of the above functions returns
32127 error mark node then they would have emitted an error message. */
32129 ;
32137 else
32138 {
32139 tree c;
32141 {
32146 }
32147 else
32148 {
32153 }
32154 }
32159 }
32161 /* Handles the Cilk Plus #pragma simd linear clause.
32162 Syntax:
32163 linear ( simd-linear-variable-list )
32165 simd-linear-variable-list:
32166 simd-linear-variable
32167 simd-linear-variable-list , simd-linear-variable
32169 simd-linear-variable:
32170 id-expression
32171 id-expression : simd-linear-step
32173 simd-linear-step:
32174 conditional-expression */
32176 static tree
32178 {
32184 {
32188 }
32193 {
32196 {
32200 }
32207 {
32211 }
32212 else
32213 {
32217 /* If present, parse the linear step. Otherwise, assume the default
32218 value of 1. */
32220 {
32227 {
32228 /* If an error has occurred, then the whole pragma is
32229 considered ill-formed. Thus, no reason to keep
32230 parsing. */
32233 }
32241 else
32243 "step size must be an integer constant "
32245 }
32247 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32253 }
32258 else
32259 {
32264 }
32265 }
32269 }
32271 /* Returns the name of the next clause. If the clause is not
32272 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32273 token is not consumed. Otherwise, the appropriate enum from the
32274 pragma_simd_clause is returned and the token is consumed. */
32276 static pragma_omp_clause
32278 {
32279 pragma_omp_clause clause_type;
32296 else
32301 }
32303 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32305 static tree
32307 {
32312 {
32313 pragma_omp_clause c_kind;
32320 /* Use the OpenMP 4.0 equivalent function. */
32323 /* Use the OpenMP 4.0 equivalent function. */
32325 clauses);
32327 /* Use the OMP 4.0 equivalent function. */
32329 clauses);
32331 /* Use the OMP 4.0 equivalent function. */
32333 else
32334 {
32338 }
32339 }
32345 else
32347 }
32349 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32351 static void
32353 {
32360 {
32364 }
32373 }
32375 /* Main entry-point for parsing Cilk Plus _Cilk_for
32376 loops. The return value is error_mark_node
32377 when errors happen and CILK_FOR tree on success. */
32379 static tree
32381 {
32396 else
32402 }
32404 /* Create an identifier for a generic parameter type (a synthesized
32405 template parameter implied by `auto' or a concept identifier). */
32408 static tree
32410 {
32414 }
32416 /* Predicate that behaves as is_auto_or_concept but matches the parent
32417 node of the generic type rather than the generic type itself. This
32418 allows for type transformation in add_implicit_template_parms. */
32422 {
32424 }
32426 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32427 (creating a new template parameter list if necessary). Returns the newly
32428 created template type parm. */
32430 tree
32432 {
32435 /* We are either continuing a function template that already contains implicit
32436 template parameters, creating a new fully-implicit function template, or
32437 extending an existing explicit function template with implicit template
32438 parameters. */
32446 {
32450 }
32451 else
32452 {
32453 /* Roll back to the existing template parameter scope (in the case of
32454 extending an explicit function template) or introduce a new template
32455 parameter scope ahead of the function parameter scope (or class scope
32456 in the case of out-of-line member definitions). The function scope is
32457 added back after template parameter synthesis below. */
32462 {
32465 }
32467 {
32468 /* If not defining a class, then any class scope is a scope level in
32469 an out-of-line member definition. In this case simply wind back
32470 beyond the first such scope to inject the template parameter list.
32471 Otherwise wind back to the class being defined. The latter can
32472 occur in class member friend declarations such as:
32474 class A {
32475 void foo (auto);
32476 };
32477 class B {
32478 friend void A::foo (auto);
32479 };
32481 The template parameter list synthesized for the friend declaration
32482 must be injected in the scope of 'B'. This can also occur in
32483 erroneous cases such as:
32485 struct A {
32486 struct B {
32487 void foo (auto);
32488 };
32489 void B::foo (auto) {}
32490 };
32492 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32493 but, nevertheless, the template parameter list synthesized for the
32494 declarator should be injected into the scope of 'A' as if the
32495 ill-formed template was specified explicitly. */
32498 {
32501 }
32502 }
32508 {
32509 /* Introduce a new template parameter list for implicit template
32510 parameters. */
32514 parser->implicit_template_scope
32521 }
32522 else
32523 {
32524 /* Synthesize implicit template parameters at the end of the explicit
32525 template parameter list. */
32532 parser->implicit_template_parms
32534 }
32535 }
32537 /* Synthesize a new template parameter and track the current template
32538 parameter chain with implicit_template_parms. */
32542 synth_id);
32543 tree new_parm
32545 input_location,
32552 parser->implicit_template_parms
32554 else
32559 /* If creating a fully implicit function template, start the new implicit
32560 template parameter list with this synthesized type, otherwise grow the
32561 current template parameter list. */
32564 {
32571 }
32572 else
32573 {
32578 }
32583 }
32585 /* Finish the declaration of a fully implicit function template. Such a
32586 template has no explicit template parameter list so has not been through the
32587 normal template head and tail processing. synthesize_implicit_template_parm
32588 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32589 provided if the declaration is a class member such that its template
32590 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32591 form is returned. Otherwise NULL_TREE is returned. */
32593 tree
32595 {
32600 {
32604 }
32614 }