| blob | a3c947a9a6908d5a987e5847a9124467eda82398 |
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
2491 /* Returns nonzero if we are parsing tentatively. */
2495 {
2497 }
2499 /* Returns nonzero if TOKEN is a string literal. */
2501 static bool
2503 {
2509 }
2511 /* Returns nonzero if TOKEN is a string literal
2512 of a user-defined string literal. */
2514 static bool
2516 {
2523 }
2525 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2527 static bool
2529 {
2531 }
2533 /* If not parsing tentatively, issue a diagnostic of the form
2534 FILE:LINE: MESSAGE before TOKEN
2535 where TOKEN is the next token in the input stream. MESSAGE
2536 (specified by the caller) is usually of the form "expected
2537 OTHER-TOKEN". */
2539 static void
2541 {
2543 {
2545 /* This diagnostic makes more sense if it is tagged to the line
2546 of the token we just peeked at. */
2550 {
2555 }
2558 /* Because c_parser_error does not understand
2559 CPP_KEYWORD, keywords are treated like
2560 identifiers. */
2563 }
2564 }
2566 /* Issue an error about name-lookup failing. NAME is the
2567 IDENTIFIER_NODE DECL is the result of
2568 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2569 the thing that we hoped to find. */
2571 static void
2573 tree name,
2574 tree decl,
2575 name_lookup_error desired,
2576 location_t location)
2577 {
2578 /* If name lookup completely failed, tell the user that NAME was not
2579 declared. */
2581 {
2594 else
2596 }
2598 {
2600 {
2617 }
2618 }
2620 {
2622 {
2632 name);
2636 }
2637 }
2638 else
2639 {
2641 {
2654 }
2655 }
2656 }
2658 /* If we are parsing tentatively, remember that an error has occurred
2659 during this tentative parse. Returns true if the error was
2660 simulated; false if a message should be issued by the caller. */
2662 static bool
2664 {
2666 {
2669 }
2671 }
2673 /* This function is called when a type is defined. If type
2674 definitions are forbidden at this point, an error message is
2675 issued. */
2677 static bool
2679 {
2680 /* If types are forbidden here, issue a message. */
2682 {
2683 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2684 in the message need to be interpreted. */
2687 }
2689 }
2691 /* This function is called when the DECLARATOR is processed. The TYPE
2692 was a type defined in the decl-specifiers. If it is invalid to
2693 define a type in the decl-specifiers for DECLARATOR, an error is
2694 issued. TYPE_LOCATION is the location of TYPE and is used
2695 for error reporting. */
2697 static void
2700 {
2701 /* [dcl.fct] forbids type definitions in return types.
2702 Unfortunately, it's not easy to know whether or not we are
2703 processing a return type until after the fact. */
2711 {
2716 type);
2717 }
2718 }
2720 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2721 "<" in any valid C++ program. If the next token is indeed "<",
2722 issue a message warning the user about what appears to be an
2723 invalid attempt to form a template-id. LOCATION is the location
2724 of the type-specifier (TYPE) */
2726 static void
2728 tree type,
2730 location_t location)
2731 {
2735 {
2739 {
2742 else
2744 }
2745 else
2747 /* Remember the location of the invalid "<". */
2750 /* Consume the "<". */
2752 /* Parse the template arguments. */
2754 /* Permanently remove the invalid template arguments so that
2755 this error message is not issued again. */
2758 }
2759 }
2761 /* If parsing an integral constant-expression, issue an error message
2762 about the fact that THING appeared and return true. Otherwise,
2763 return false. In either case, set
2764 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2766 static bool
2768 non_integral_constant thing)
2769 {
2772 {
2774 {
2777 {
2784 "enumeration type cannot appear in a "
2875 }
2879 }
2880 }
2882 }
2884 /* Emit a diagnostic for an invalid type name. This function commits
2885 to the current active tentative parse, if any. (Otherwise, the
2886 problematic construct might be encountered again later, resulting
2887 in duplicate error messages.) LOCATION is the location of ID. */
2889 static void
2891 location_t location)
2892 {
2895 /* Try to lookup the identifier. */
2902 /* If the lookup was ambiguous, an error will already have
2903 been issued. */
2905 /* If the lookup found a template-name, it means that the user forgot
2906 to specify an argument list. Emit a useful error message. */
2910 decl);
2914 /* Something like 'unsigned A a;' */
2917 {
2918 /* Issue an error message. */
2920 /* If we're in a template class, it's possible that the user was
2921 referring to a type from a base class. For example:
2923 template <typename T> struct A { typedef T X; };
2924 template <typename T> struct B : public A<T> { X x; };
2926 The user should have said "typename A<T>::X". */
2939 {
2940 tree b;
2943 b;
2945 {
2949 {
2950 tree field;
2951 /* Go from a particular instantiation of the
2952 template (which will have an empty TYPE_FIELDs),
2953 to the main version. */
2956 field;
2960 {
2965 }
2968 }
2969 }
2970 }
2971 }
2972 /* Here we diagnose qualified-ids where the scope is actually correct,
2973 but the identifier does not resolve to a valid type name. */
2975 {
2977 {
2982 else
2986 }
2989 {
2990 /* A<T>::A<T>() */
2996 }
3003 {
3008 else
3012 }
3013 else
3015 }
3016 }
3018 /* Check for a common situation where a type-name should be present,
3019 but is not, and issue a sensible error message. Returns true if an
3020 invalid type-name was detected.
3022 The situation handled by this function are variable declarations of the
3023 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3024 Usually, `ID' should name a type, but if we got here it means that it
3025 does not. We try to emit the best possible error message depending on
3026 how exactly the id-expression looks like. */
3028 static bool
3030 {
3031 tree id;
3034 /* Avoid duplicate error about ambiguous lookup. */
3036 {
3040 }
3049 /* If the next token is a (, this is a function with no explicit return
3050 type, i.e. constructor, destructor or conversion op. */
3053 {
3056 }
3060 /* Emit a diagnostic for the invalid type. */
3062 out:
3063 /* If we aren't in the middle of a declarator (i.e. in a
3064 parameter-declaration-clause), skip to the end of the declaration;
3065 there's no point in trying to process it. */
3069 }
3071 /* Consume tokens up to, and including, the next non-nested closing `)'.
3072 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3073 are doing error recovery. Returns -1 if OR_COMMA is true and we
3074 found an unnested comma. */
3076 static int
3081 {
3091 {
3095 {
3098 /* If we've run out of tokens, then there is no closing `)'. */
3101 /* This is good for lambda expression capture-lists. */
3111 /* This matches the processing in skip_to_end_of_statement. */
3137 {
3141 }
3146 }
3148 /* Consume the token. */
3150 }
3151 }
3153 /* Consume tokens until we reach the end of the current statement.
3154 Normally, that will be just before consuming a `;'. However, if a
3155 non-nested `}' comes first, then we stop before consuming that. */
3157 static void
3159 {
3162 /* Unwind generic function template scope if necessary. */
3167 {
3171 {
3174 /* If we've run out of tokens, stop. */
3178 /* If the next token is a `;', we have reached the end of the
3179 statement. */
3185 /* If this is a non-nested '}', stop before consuming it.
3186 That way, when confronted with something like:
3188 { 3 + }
3190 we stop before consuming the closing '}', even though we
3191 have not yet reached a `;'. */
3195 /* If it is the closing '}' for a block that we have
3196 scanned, stop -- but only after consuming the token.
3197 That way given:
3199 void f g () { ... }
3200 typedef int I;
3202 we will stop after the body of the erroneously declared
3203 function, but before consuming the following `typedef'
3204 declaration. */
3206 {
3209 }
3217 }
3219 /* Consume the token. */
3221 }
3222 }
3224 /* This function is called at the end of a statement or declaration.
3225 If the next token is a semicolon, it is consumed; otherwise, error
3226 recovery is attempted. */
3228 static void
3230 {
3231 /* Look for the trailing `;'. */
3233 {
3234 /* If there is additional (erroneous) input, skip to the end of
3235 the statement. */
3237 /* If the next token is now a `;', consume it. */
3240 }
3241 }
3243 /* Skip tokens until we have consumed an entire block, or until we
3244 have consumed a non-nested `;'. */
3246 static void
3248 {
3251 /* Unwind generic function template scope if necessary. */
3256 {
3260 {
3263 /* If we've run out of tokens, stop. */
3267 /* Stop if this is an unnested ';'. */
3273 /* Stop if this is an unnested '}', or closes the outermost
3274 nesting level. */
3275 nesting_depth--;
3283 /* Nest. */
3284 nesting_depth++;
3289 }
3291 /* Consume the token. */
3293 }
3294 }
3296 /* Skip tokens until a non-nested closing curly brace is the next
3297 token, or there are no more tokens. Return true in the first case,
3298 false otherwise. */
3300 static bool
3302 {
3306 {
3310 {
3313 /* If we've run out of tokens, stop. */
3317 /* If the next token is a non-nested `}', then we have reached
3318 the end of the current block. */
3324 /* If it the next token is a `{', then we are entering a new
3325 block. Consume the entire block. */
3331 }
3333 /* Consume the token. */
3335 }
3336 }
3338 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3339 parameter is the PRAGMA token, allowing us to purge the entire pragma
3340 sequence. */
3342 static void
3344 {
3349 do
3353 /* Ensure that the pragma is not parsed again. */
3355 }
3357 /* Require pragma end of line, resyncing with it as necessary. The
3358 arguments are as for cp_parser_skip_to_pragma_eol. */
3360 static void
3362 {
3366 }
3368 /* This is a simple wrapper around make_typename_type. When the id is
3369 an unresolved identifier node, we can provide a superior diagnostic
3370 using cp_parser_diagnose_invalid_type_name. */
3372 static tree
3374 location_t id_location)
3375 {
3376 tree result;
3378 {
3384 }
3386 }
3388 /* This is a wrapper around the
3389 make_{pointer,ptrmem,reference}_declarator functions that decides
3390 which one to call based on the CODE and CLASS_TYPE arguments. The
3391 CODE argument should be one of the values returned by
3392 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3393 appertain to the pointer or reference. */
3397 cp_cv_quals cv_qualifiers,
3399 tree attributes)
3400 {
3407 else
3417 }
3419 /* Create a new C++ parser. */
3423 {
3428 /* cp_lexer_new_main is called before doing GC allocation because
3429 cp_lexer_new_main might load a PCH file. */
3432 /* Initialize the binops_by_token so that we can get the tree
3433 directly from the token. */
3441 /* For now, we always accept GNU extensions. */
3444 /* The `>' token is a greater-than operator, not the end of a
3445 template-id. */
3450 /* We are not parsing a constant-expression. */
3455 /* Local variable names are not forbidden. */
3458 /* We are not processing an `extern "C"' declaration. */
3461 /* We are not processing a declarator. */
3464 /* We are not processing a template-argument-list. */
3467 /* We are not in an iteration statement. */
3470 /* We are not in a switch statement. */
3473 /* We are not parsing a type-id inside an expression. */
3476 /* Declarations aren't implicitly extern "C". */
3479 /* String literals should be translated to the execution character set. */
3482 /* We are not parsing a function body. */
3485 /* We can correct until told otherwise. */
3488 /* The unparsed function queue is empty. */
3491 /* There are no classes being defined. */
3494 /* No template parameters apply. */
3497 /* Not declaring an implicit function template. */
3504 }
3506 /* Create a cp_lexer structure which will emit the tokens in CACHE
3507 and push it onto the parser's lexer stack. This is used for delayed
3508 parsing of in-class method bodies and default arguments, and should
3509 not be confused with tentative parsing. */
3510 static void
3512 {
3517 /* Move the current source position to that of the first token in the
3518 new lexer. */
3520 }
3522 /* Pop the top lexer off the parser stack. This is never used for the
3523 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3524 static void
3526 {
3531 /* Put the current source position back where it was before this
3532 lexer was pushed. */
3534 }
3536 /* Lexical conventions [gram.lex] */
3538 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3539 identifier. */
3541 static tree
3543 {
3546 /* Look for the identifier. */
3548 /* Return the value. */
3550 }
3552 /* Parse a sequence of adjacent string constants. Returns a
3553 TREE_STRING representing the combined, nul-terminated string
3554 constant. If TRANSLATE is true, translate the string to the
3555 execution character set. If WIDE_OK is true, a wide string is
3556 invalid here.
3558 C++98 [lex.string] says that if a narrow string literal token is
3559 adjacent to a wide string literal token, the behavior is undefined.
3560 However, C99 6.4.5p4 says that this results in a wide string literal.
3561 We follow C99 here, for consistency with the C front end.
3563 This code is largely lifted from lex_string() in c-lex.c.
3565 FUTURE: ObjC++ will need to handle @-strings here. */
3566 static tree
3569 {
3570 tree value;
3577 tree string_tree;
3583 {
3586 }
3589 {
3593 }
3594 else
3595 {
3598 }
3601 /* Try to avoid the overhead of creating and destroying an obstack
3602 for the common case of just one string. */
3605 {
3613 {
3617 }
3618 else
3622 }
3623 else
3624 {
3628 do
3629 {
3631 count++;
3636 {
3639 {
3642 }
3645 {
3650 }
3652 }
3653 else
3657 {
3662 "unsupported non-standard concatenation "
3664 }
3670 {
3674 }
3675 else
3676 {
3680 }
3681 }
3685 }
3688 {
3691 }
3695 {
3700 {
3715 }
3720 {
3725 else
3727 }
3728 }
3729 else
3730 /* cpp_interpret_string has issued an error. */
3737 }
3739 /* Look up a literal operator with the name and the exact arguments. */
3741 static tree
3743 {
3750 {
3756 {
3759 {
3769 }
3772 /* May be this should be sufficient_parms_p instead,
3773 depending on how exactly should user-defined literals
3774 work in presence of default arguments on the literal
3775 operator parameters. */
3778 }
3779 }
3782 }
3784 /* Parse a user-defined char constant. Returns a call to a user-defined
3785 literal operator taking the character as an argument. */
3787 static tree
3789 {
3797 /* Build up a call to the user-defined operator */
3798 /* Lookup the name we got back from the id-expression. */
3803 {
3808 }
3817 }
3819 /* A subroutine of cp_parser_userdef_numeric_literal to
3820 create a char... template parameter pack from a string node. */
3822 static tree
3824 {
3825 tree charvec;
3831 /* Fill in CHARVEC with all of the parameters. */
3836 /* Build the argument packs. */
3843 }
3845 /* A subroutine of cp_parser_userdef_numeric_literal to
3846 create a char... template parameter pack from a string node. */
3848 static tree
3850 {
3851 tree charvec;
3862 /* First template parm is character type. */
3865 /* Fill in CHARVEC with all of the parameters. */
3872 /* Build the argument packs. */
3879 }
3881 /* Parse a user-defined numeric constant. returns a call to a user-defined
3882 literal operator. */
3884 static tree
3886 {
3897 /* Look for a literal operator taking the exact type of numeric argument
3898 as the literal value. */
3903 {
3906 {
3910 long_long_unsigned_type_node);
3911 else
3912 {
3916 long_double_type_node);
3920 }
3923 }
3924 }
3927 /* If the numeric argument didn't work, look for a raw literal
3928 operator taking a const char* argument consisting of the number
3929 in string format. */
3934 {
3937 {
3940 }
3941 }
3944 /* If the raw literal didn't work, look for a non-type template
3945 function with parameter pack char.... Call the function with
3946 template parameter characters representing the number. */
3950 {
3955 {
3958 }
3959 }
3967 }
3969 /* Parse a user-defined string constant. Returns a call to a user-defined
3970 literal operator taking a character pointer and the length of the string
3971 as arguments. */
3973 static tree
3975 {
3984 /* Look for a template function with typename parameter CharT
3985 and parameter pack CharT... Call the function with
3986 template parameter characters representing the string. */
3990 {
3995 {
3998 }
3999 }
4002 /* Build up a call to the user-defined operator */
4003 /* Lookup the name we got back from the id-expression. */
4009 {
4013 }
4022 }
4025 /* Basic concepts [gram.basic] */
4027 /* Parse a translation-unit.
4029 translation-unit:
4030 declaration-seq [opt]
4032 Returns TRUE if all went well. */
4034 static bool
4036 {
4037 /* The address of the first non-permanent object on the declarator
4038 obstack. */
4043 /* Create the declarator obstack, if necessary. */
4045 {
4047 /* Create the error declarator. */
4049 /* Create the empty parameter list. */
4051 /* Remember where the base of the declarator obstack lies. */
4053 }
4057 /* If there are no tokens left then all went well. */
4059 {
4060 /* Get rid of the token array; we don't need it any more. */
4064 /* This file might have been a context that's implicitly extern
4065 "C". If so, pop the lang context. (Only relevant for PCH.) */
4067 {
4070 }
4072 /* Finish up. */
4076 }
4077 else
4078 {
4081 }
4083 /* Make sure the declarator obstack was fully cleaned up. */
4087 /* All went well. */
4089 }
4091 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4092 decltype context. */
4096 {
4101 }
4103 /* Expressions [gram.expr] */
4105 /* Parse a primary-expression.
4107 primary-expression:
4108 literal
4109 this
4110 ( expression )
4111 id-expression
4112 lambda-expression (C++11)
4114 GNU Extensions:
4116 primary-expression:
4117 ( compound-statement )
4118 __builtin_va_arg ( assignment-expression , type-id )
4119 __builtin_offsetof ( type-id , offsetof-expression )
4121 C++ Extensions:
4122 __has_nothrow_assign ( type-id )
4123 __has_nothrow_constructor ( type-id )
4124 __has_nothrow_copy ( type-id )
4125 __has_trivial_assign ( type-id )
4126 __has_trivial_constructor ( type-id )
4127 __has_trivial_copy ( type-id )
4128 __has_trivial_destructor ( type-id )
4129 __has_virtual_destructor ( type-id )
4130 __is_abstract ( type-id )
4131 __is_base_of ( type-id , type-id )
4132 __is_class ( type-id )
4133 __is_convertible_to ( type-id , type-id )
4134 __is_empty ( type-id )
4135 __is_enum ( type-id )
4136 __is_final ( type-id )
4137 __is_literal_type ( type-id )
4138 __is_pod ( type-id )
4139 __is_polymorphic ( type-id )
4140 __is_std_layout ( type-id )
4141 __is_trivial ( type-id )
4142 __is_union ( type-id )
4144 Objective-C++ Extension:
4146 primary-expression:
4147 objc-expression
4149 literal:
4150 __null
4152 ADDRESS_P is true iff this expression was immediately preceded by
4153 "&" and therefore might denote a pointer-to-member. CAST_P is true
4154 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4155 true iff this expression is a template argument.
4157 Returns a representation of the expression. Upon return, *IDK
4158 indicates what kind of id-expression (if any) was present. */
4160 static tree
4167 {
4170 /* Assume the primary expression is not an id-expression. */
4173 /* Peek at the next token. */
4176 {
4177 /* literal:
4178 integer-literal
4179 character-literal
4180 floating-literal
4181 string-literal
4182 boolean-literal
4183 pointer-literal
4184 user-defined-literal */
4194 {
4198 }
4199 /* Floating-point literals are only allowed in an integral
4200 constant expression if they are cast to an integral or
4201 enumeration type. */
4205 {
4206 /* CAST_P will be set even in invalid code like "int(2.7 +
4207 ...)". Therefore, we have to check that the next token
4208 is sure to end the cast. */
4210 {
4215 enumerator-definition. */
4217 /* The curly brace at the end of an enum-specifier. */
4219 /* The end of a statement. */
4221 /* The end of the cast-expression. */
4223 /* The end of an array bound. */
4225 /* The closing ">" in a template-argument-list. */
4228 /* C++0x only: A ">>" treated like two ">" tokens,
4229 in a template-argument-list. */
4234 }
4236 /* If we are within a cast, then the constraint that the
4237 cast is to an integral or enumeration type will be
4238 checked at that point. If we are not within a cast, then
4239 this code is invalid. */
4242 }
4261 /* ??? Should wide strings be allowed when parser->translate_strings_p
4262 is false (i.e. in attributes)? If not, we can kill the third
4263 argument to cp_parser_string_literal. */
4269 {
4270 tree expr;
4273 /* Consume the `('. */
4275 /* Within a parenthesized expression, a `>' token is always
4276 the greater-than operator. */
4277 saved_greater_than_is_operator_p
4280 /* If we see `( { ' then we are looking at the beginning of
4281 a GNU statement-expression. */
4284 {
4285 /* Statement-expressions are not allowed by the standard. */
4289 /* And they're not allowed outside of a function-body; you
4290 cannot, for example, write:
4292 int i = ({ int j = 3; j + 1; });
4294 at class or namespace scope. */
4297 {
4299 "statement-expressions are not allowed outside "
4303 }
4304 else
4305 {
4306 /* Start the statement-expression. */
4308 /* Parse the compound-statement. */
4310 /* Finish up. */
4312 }
4313 }
4314 else
4315 {
4316 /* Parse the parenthesized expression. */
4318 /* Let the front end know that this expression was
4319 enclosed in parentheses. This matters in case, for
4320 example, the expression is of the form `A::B', since
4321 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4322 not. */
4324 /* DR 705: Wrapping an unqualified name in parentheses
4325 suppresses arg-dependent lookup. We want to pass back
4326 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4327 (c++/37862), but none of the others. */
4330 }
4331 /* The `>' token might be the end of a template-id or
4332 template-parameter-list now. */
4333 parser->greater_than_is_operator_p
4335 /* Consume the `)'. */
4340 }
4344 /* We have an Objective-C++ message. */
4346 {
4348 /* Don't warn about a failed tentative parse. */
4353 }
4357 /* We have an Objective-C++ string literal. */
4364 {
4365 /* These two are the boolean literals. */
4373 /* The `__null' literal. */
4378 /* The `nullptr' literal. */
4383 /* Recognize the `this' keyword. */
4387 {
4391 }
4392 /* Pointers cannot appear in constant-expressions. */
4397 /* The `operator' keyword can be the beginning of an
4398 id-expression. */
4405 {
4406 non_integral_constant name;
4408 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4409 __func__ are the names of variables -- but they are
4410 treated specially. Therefore, they are handled here,
4411 rather than relying on the generic id-expression logic
4412 below. Grammatically, these names are id-expressions.
4414 Consume the token. */
4418 {
4430 }
4435 /* Look up the name. */
4437 }
4440 {
4441 tree expression;
4442 tree type;
4443 source_location type_location;
4445 /* The `__builtin_va_arg' construct is used to handle
4446 `va_arg'. Consume the `__builtin_va_arg' token. */
4448 /* Look for the opening `('. */
4450 /* Now, parse the assignment-expression. */
4453 /* Look for the `,'. */
4456 /* Parse the type-id. */
4458 /* Look for the closing `)'. */
4460 /* Using `va_arg' in a constant-expression is not
4461 allowed. */
4463 NIC_VA_ARG))
4466 }
4494 /* Objective-C++ expressions. */
4504 {
4509 }
4513 }
4515 /* An id-expression can start with either an identifier, a
4516 `::' as the beginning of a qualified-id, or the "operator"
4517 keyword. */
4522 {
4523 tree id_expression;
4524 tree decl;
4530 id_expression:
4531 /* Parse the id-expression. */
4532 id_expression
4549 /* If we have a template-id, then no further lookup is
4550 required. If the template-id was for a template-class, we
4551 will sometimes have a TYPE_DECL at this point. */
4555 /* Look up the name. */
4556 else
4557 {
4558 tree ambiguous_decls;
4560 /* If we already know that this lookup is ambiguous, then
4561 we've already issued an error message; there's no reason
4562 to check again. */
4565 {
4568 }
4571 none_type,
4572 template_p,
4577 /* If the lookup was ambiguous, an error will already have
4578 been issued. */
4582 /* In Objective-C++, we may have an Objective-C 2.0
4583 dot-syntax for classes here. */
4588 {
4589 tree component;
4596 }
4598 /* In Objective-C++, an instance variable (ivar) may be preferred
4599 to whatever cp_parser_lookup_name() found. */
4602 /* If name lookup gives us a SCOPE_REF, then the
4603 qualifying scope was dependent. */
4605 {
4606 /* At this point, we do not know if DECL is a valid
4607 integral constant expression. We assume that it is
4608 in fact such an expression, so that code like:
4610 template <int N> struct A {
4611 int a[B<N>::i];
4612 };
4614 is accepted. At template-instantiation time, we
4615 will check that B<N>::i is actually a constant. */
4617 }
4618 /* Check to see if DECL is a local variable in a context
4619 where that is forbidden. */
4622 {
4623 /* It might be that we only found DECL because we are
4624 trying to be generous with pre-ISO scoping rules.
4625 For example, consider:
4627 int i;
4628 void g() {
4629 for (int i = 0; i < 10; ++i) {}
4630 extern void f(int j = i);
4631 }
4633 Here, name look up will originally find the out
4634 of scope `i'. We need to issue a warning message,
4635 but then use the global `i'. */
4638 {
4641 decl);
4643 }
4644 }
4645 }
4647 decl = (finish_id_expression
4649 idk,
4654 template_arg_p,
4660 }
4662 /* Anything else is an error. */
4666 }
4667 }
4675 {
4678 }
4680 /* Parse an id-expression.
4682 id-expression:
4683 unqualified-id
4684 qualified-id
4686 qualified-id:
4687 :: [opt] nested-name-specifier template [opt] unqualified-id
4688 :: identifier
4689 :: operator-function-id
4690 :: template-id
4692 Return a representation of the unqualified portion of the
4693 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4694 a `::' or nested-name-specifier.
4696 Often, if the id-expression was a qualified-id, the caller will
4697 want to make a SCOPE_REF to represent the qualified-id. This
4698 function does not do this in order to avoid wastefully creating
4699 SCOPE_REFs when they are not required.
4701 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4702 `template' keyword.
4704 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4705 uninstantiated templates.
4707 If *TEMPLATE_P is non-NULL, it is set to true iff the
4708 `template' keyword is used to explicitly indicate that the entity
4709 named is a template.
4711 If DECLARATOR_P is true, the id-expression is appearing as part of
4712 a declarator, rather than as part of an expression. */
4714 static tree
4721 {
4725 /* Assume the `template' keyword was not used. */
4729 /* Look for the optional `::' operator. */
4730 global_scope_p
4733 /* Look for the optional nested-name-specifier. */
4734 nested_name_specifier_p
4737 check_dependency_p,
4739 declarator_p)
4741 /* If there is a nested-name-specifier, then we are looking at
4742 the first qualified-id production. */
4744 {
4745 tree saved_scope;
4746 tree saved_object_scope;
4747 tree saved_qualifying_scope;
4748 tree unqualified_id;
4751 /* See if the next token is the `template' keyword. */
4755 /* Name lookup we do during the processing of the
4756 unqualified-id might obliterate SCOPE. */
4760 /* Process the final unqualified-id. */
4762 check_dependency_p,
4763 declarator_p,
4765 /* Restore the SAVED_SCOPE for our caller. */
4771 }
4772 /* Otherwise, if we are in global scope, then we are looking at one
4773 of the other qualified-id productions. */
4775 {
4777 tree id;
4779 /* Peek at the next token. */
4782 /* If it's an identifier, and the next token is not a "<", then
4783 we can avoid the template-id case. This is an optimization
4784 for this common case. */
4786 && !cp_parser_nth_token_starts_template_argument_list_p
4791 /* Try a template-id. */
4795 none_type,
4796 declarator_p);
4797 /* If that worked, we're done. */
4801 /* Peek at the next token. (Changes in the token buffer may
4802 have invalidated the pointer obtained above.) */
4806 {
4813 /* Fall through. */
4818 }
4819 }
4820 else
4823 declarator_p,
4824 optional_p);
4825 }
4827 /* Parse an unqualified-id.
4829 unqualified-id:
4830 identifier
4831 operator-function-id
4832 conversion-function-id
4833 ~ class-name
4834 template-id
4836 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4837 keyword, in a construct like `A::template ...'.
4839 Returns a representation of unqualified-id. For the `identifier'
4840 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4841 production a BIT_NOT_EXPR is returned; the operand of the
4842 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4843 other productions, see the documentation accompanying the
4844 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4845 names are looked up in uninstantiated templates. If DECLARATOR_P
4846 is true, the unqualified-id is appearing as part of a declarator,
4847 rather than as part of an expression. */
4849 static tree
4855 {
4858 /* Peek at the next token. */
4862 {
4864 {
4865 tree id;
4867 /* We don't know yet whether or not this will be a
4868 template-id. */
4870 /* Try a template-id. */
4872 check_dependency_p,
4873 none_type,
4874 declarator_p);
4875 /* If it worked, we're done. */
4878 /* Otherwise, it's an ordinary identifier. */
4880 }
4884 check_dependency_p,
4885 none_type,
4886 declarator_p);
4889 {
4890 tree type_decl;
4891 tree qualifying_scope;
4892 tree object_scope;
4893 tree scope;
4896 /* Consume the `~' token. */
4898 /* Parse the class-name. The standard, as written, seems to
4899 say that:
4901 template <typename T> struct S { ~S (); };
4902 template <typename T> S<T>::~S() {}
4904 is invalid, since `~' must be followed by a class-name, but
4905 `S<T>' is dependent, and so not known to be a class.
4906 That's not right; we need to look in uninstantiated
4907 templates. A further complication arises from:
4909 template <typename T> void f(T t) {
4910 t.T::~T();
4911 }
4913 Here, it is not possible to look up `T' in the scope of `T'
4914 itself. We must look in both the current scope, and the
4915 scope of the containing complete expression.
4917 Yet another issue is:
4919 struct S {
4920 int S;
4921 ~S();
4922 };
4924 S::~S() {}
4926 The standard does not seem to say that the `S' in `~S'
4927 should refer to the type `S' and not the data member
4928 `S::S'. */
4930 /* DR 244 says that we look up the name after the "~" in the
4931 same scope as we looked up the qualifying name. That idea
4932 isn't fully worked out; it's more complicated than that. */
4937 /* Check for invalid scopes. */
4939 {
4943 }
4945 {
4949 scope);
4954 }
4957 /* If the name is of the form "X::~X" it's OK even if X is a
4958 typedef. */
4967 {
4970 }
4972 /* ~auto means the destructor of whatever the object is. */
4974 {
4977 "%<~auto%> only available with "
4981 }
4983 /* If there was an explicit qualification (S::~T), first look
4984 in the scope given by the qualification (i.e., S).
4986 Note: in the calls to cp_parser_class_name below we pass
4987 typename_type so that lookup finds the injected-class-name
4988 rather than the constructor. */
4992 {
4997 typename_type,
5000 declarator_p);
5003 }
5004 /* In "N::S::~S", look in "N" as well. */
5006 {
5011 type_decl
5015 typename_type,
5018 declarator_p);
5021 }
5022 /* In "p->S::~T", look in the scope given by "*p" as well. */
5024 {
5029 type_decl
5033 typename_type,
5036 declarator_p);
5039 }
5040 /* Look in the surrounding context. */
5042 {
5048 type_decl
5052 typename_type,
5055 declarator_p);
5058 {
5059 /* We couldn't find a type with this name, so just accept
5060 it and check for a match at instantiation time. */
5065 }
5066 }
5067 /* If an error occurred, assume that the name of the
5068 destructor is the same as the name of the qualifying
5069 class. That allows us to keep parsing after running
5070 into ill-formed destructor names. */
5076 /* Check that destructor name and scope match. */
5078 {
5085 }
5087 /* [class.dtor]
5089 A typedef-name that names a class shall not be used as the
5090 identifier in the declarator for a destructor declaration. */
5097 type_decl);
5100 }
5104 {
5105 tree id;
5107 /* This could be a template-id, so we try that first. */
5109 /* Try a template-id. */
5112 none_type,
5113 declarator_p);
5114 /* If that worked, we're done. */
5117 /* We still don't know whether we're looking at an
5118 operator-function-id or a conversion-function-id. */
5120 /* Try an operator-function-id. */
5122 /* If that didn't work, try a conversion-function-id. */
5126 {
5127 /* 17.6.3.3.5 */
5133 }
5136 }
5137 /* Fall through. */
5144 }
5145 }
5147 /* Parse an (optional) nested-name-specifier.
5149 nested-name-specifier: [C++98]
5150 class-or-namespace-name :: nested-name-specifier [opt]
5151 class-or-namespace-name :: template nested-name-specifier [opt]
5153 nested-name-specifier: [C++0x]
5154 type-name ::
5155 namespace-name ::
5156 nested-name-specifier identifier ::
5157 nested-name-specifier template [opt] simple-template-id ::
5159 PARSER->SCOPE should be set appropriately before this function is
5160 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5161 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5162 in name lookups.
5164 Sets PARSER->SCOPE to the class (TYPE) or namespace
5165 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5166 it unchanged if there is no nested-name-specifier. Returns the new
5167 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5169 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5170 part of a declaration and/or decl-specifier. */
5172 static tree
5178 {
5183 /* Remember where the nested-name-specifier starts. */
5185 {
5188 }
5191 {
5192 tree new_scope;
5193 tree old_scope;
5194 tree saved_qualifying_scope;
5197 /* Spot cases that cannot be the beginning of a
5198 nested-name-specifier. */
5201 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5202 the already parsed nested-name-specifier. */
5204 {
5205 /* Grab the nested-name-specifier and continue the loop. */
5207 /* If we originally encountered this nested-name-specifier
5208 with IS_DECLARATION set to false, we will not have
5209 resolved TYPENAME_TYPEs, so we must do so here. */
5212 {
5217 }
5220 }
5222 /* Spot cases that cannot be the beginning of a
5223 nested-name-specifier. On the second and subsequent times
5224 through the loop, we look for the `template' keyword. */
5226 ;
5227 /* A template-id can start a nested-name-specifier. */
5229 ;
5230 /* DR 743: decltype can be used in a nested-name-specifier. */
5232 ;
5233 else
5234 {
5235 /* If the next token is not an identifier, then it is
5236 definitely not a type-name or namespace-name. */
5239 /* If the following token is neither a `<' (to begin a
5240 template-id), nor a `::', then we are not looking at a
5241 nested-name-specifier. */
5247 {
5251 }
5254 && !cp_parser_nth_token_starts_template_argument_list_p
5257 }
5259 /* The nested-name-specifier is optional, so we parse
5260 tentatively. */
5263 /* Look for the optional `template' keyword, if this isn't the
5264 first time through the loop. */
5267 else
5270 /* Save the old scope since the name lookup we are about to do
5271 might destroy it. */
5274 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5275 look up names in "X<T>::I" in order to determine that "Y" is
5276 a template. So, if we have a typename at this point, we make
5277 an effort to look through it. */
5279 && !typename_keyword_p
5284 /* Parse the qualifying entity. */
5285 new_scope
5287 typename_keyword_p,
5288 template_keyword_p,
5289 check_dependency_p,
5290 type_p,
5291 is_declaration);
5292 /* Look for the `::' token. */
5295 /* If we found what we wanted, we keep going; otherwise, we're
5296 done. */
5298 {
5301 /* Restore the OLD_SCOPE since it was valid before the
5302 failed attempt at finding the last
5303 class-or-namespace-name. */
5307 /* If the next token is a decltype, and the one after that is a
5308 `::', then the decltype has failed to resolve to a class or
5309 enumeration type. Give this error even when parsing
5310 tentatively since it can't possibly be valid--and we're going
5311 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5312 won't get another chance.*/
5316 {
5323 /* As below. */
5326 }
5330 /* If the next token is an identifier, and the one after
5331 that is a `::', then any valid interpretation would have
5332 found a class-or-namespace-name. */
5338 {
5341 {
5343 {
5344 tree decl;
5345 tree ambiguous_decls;
5348 none_type,
5357 decl);
5359 {
5360 // cp_parser_lookup_name has the same diagnostic,
5361 // thus make sure to emit it at most once.
5364 {
5369 }
5371 }
5372 else
5373 {
5375 cp_parser_name_lookup_error
5378 else
5379 cp_parser_name_lookup_error
5382 }
5383 }
5386 /* Treat this as a successful nested-name-specifier
5387 due to:
5389 [basic.lookup.qual]
5391 If the name found is not a class-name (clause
5392 _class_) or namespace-name (_namespace.def_), the
5393 program is ill-formed. */
5395 }
5397 }
5399 }
5400 /* We've found one valid nested-name-specifier. */
5402 /* Name lookup always gives us a DECL. */
5405 /* Uses of "template" must be followed by actual templates. */
5417 new_scope);
5418 /* If it is a class scope, try to complete it; we are about to
5419 be looking up names inside the class. */
5421 /* Since checking types for dependency can be expensive,
5422 avoid doing it if the type is already complete. */
5424 /* Do not try to complete dependent types. */
5426 {
5428 /* If it is a typedef to current class, use the current
5429 class instead, as the typedef won't have any names inside
5430 it yet. */
5434 }
5435 /* Make sure we look in the right scope the next time through
5436 the loop. */
5438 }
5440 /* If parsing tentatively, replace the sequence of tokens that makes
5441 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5442 token. That way, should we re-parse the token stream, we will
5443 not have to repeat the effort required to do the parse, nor will
5444 we issue duplicate error messages. */
5446 {
5450 /* Reset the contents of the START token. */
5452 /* Retrieve any deferred checks. Do not pop this access checks yet
5453 so the memory will not be reclaimed during token replacing below. */
5461 /* Purge all subsequent tokens. */
5463 }
5469 }
5471 /* Parse a nested-name-specifier. See
5472 cp_parser_nested_name_specifier_opt for details. This function
5473 behaves identically, except that it will an issue an error if no
5474 nested-name-specifier is present. */
5476 static tree
5482 {
5483 tree scope;
5485 /* Look for the nested-name-specifier. */
5487 typename_keyword_p,
5488 check_dependency_p,
5489 type_p,
5490 is_declaration);
5491 /* If it was not present, issue an error message. */
5493 {
5496 }
5499 }
5501 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5502 this is either a class-name or a namespace-name (which corresponds
5503 to the class-or-namespace-name production in the grammar). For
5504 C++0x, it can also be a type-name that refers to an enumeration
5505 type or a simple-template-id.
5507 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5508 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5509 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5510 TYPE_P is TRUE iff the next name should be taken as a class-name,
5511 even the same name is declared to be another entity in the same
5512 scope.
5514 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5515 specified by the class-or-namespace-name. If neither is found the
5516 ERROR_MARK_NODE is returned. */
5518 static tree
5525 {
5526 tree saved_scope;
5527 tree saved_qualifying_scope;
5528 tree saved_object_scope;
5529 tree scope;
5533 /* DR 743: decltype can appear in a nested-name-specifier. */
5535 {
5539 {
5542 }
5546 }
5548 /* Before we try to parse the class-name, we must save away the
5549 current PARSER->SCOPE since cp_parser_class_name will destroy
5550 it. */
5554 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5555 there is no need to look for a namespace-name. */
5556 only_class_p = template_keyword_p
5561 typename_keyword_p,
5562 template_keyword_p,
5564 check_dependency_p,
5566 is_declaration);
5568 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5572 {
5573 /* Restore the saved scope. */
5578 /* Parse tentatively. */
5581 /* Parse a type-name */
5584 /* "If the name found does not designate a namespace or a class,
5585 enumeration, or dependent type, the program is ill-formed."
5587 We cover classes and dependent types above and namespaces below,
5588 so this code is only looking for enums. */
5594 }
5595 /* If that didn't work, try for a namespace-name. */
5597 {
5598 /* Restore the saved scope. */
5602 /* If we are not looking at an identifier followed by the scope
5603 resolution operator, then this is not part of a
5604 nested-name-specifier. (Note that this function is only used
5605 to parse the components of a nested-name-specifier.) */
5610 }
5613 }
5615 /* Return true if we are looking at a compound-literal, false otherwise. */
5617 static bool
5619 {
5620 /* Consume the `('. */
5625 /* Skip tokens until the next token is a closing parenthesis.
5626 If we find the closing `)', and the next token is a `{', then
5627 we are looking at a compound-literal. */
5628 bool compound_literal_p
5633 /* Roll back the tokens we skipped. */
5637 }
5639 /* Parse a postfix-expression.
5641 postfix-expression:
5642 primary-expression
5643 postfix-expression [ expression ]
5644 postfix-expression ( expression-list [opt] )
5645 simple-type-specifier ( expression-list [opt] )
5646 typename :: [opt] nested-name-specifier identifier
5647 ( expression-list [opt] )
5648 typename :: [opt] nested-name-specifier template [opt] template-id
5649 ( expression-list [opt] )
5650 postfix-expression . template [opt] id-expression
5651 postfix-expression -> template [opt] id-expression
5652 postfix-expression . pseudo-destructor-name
5653 postfix-expression -> pseudo-destructor-name
5654 postfix-expression ++
5655 postfix-expression --
5656 dynamic_cast < type-id > ( expression )
5657 static_cast < type-id > ( expression )
5658 reinterpret_cast < type-id > ( expression )
5659 const_cast < type-id > ( expression )
5660 typeid ( expression )
5661 typeid ( type-id )
5663 GNU Extension:
5665 postfix-expression:
5666 ( type-id ) { initializer-list , [opt] }
5668 This extension is a GNU version of the C99 compound-literal
5669 construct. (The C99 grammar uses `type-name' instead of `type-id',
5670 but they are essentially the same concept.)
5672 If ADDRESS_P is true, the postfix expression is the operand of the
5673 `&' operator. CAST_P is true if this expression is the target of a
5674 cast.
5676 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5677 class member access expressions [expr.ref].
5679 Returns a representation of the expression. */
5681 static tree
5685 {
5687 location_t loc;
5694 /* Peek at the next token. */
5697 /* Some of the productions are determined by keywords. */
5700 {
5705 {
5706 tree type;
5707 tree expression;
5711 /* All of these can be handled in the same way from the point
5712 of view of parsing. Begin by consuming the token
5713 identifying the cast. */
5716 /* New types cannot be defined in the cast. */
5718 parser->type_definition_forbidden_message
5721 /* Look for the opening `<'. */
5723 /* Parse the type to which we are casting. */
5728 /* Look for the closing `>'. */
5730 /* Restore the old message. */
5733 bool saved_greater_than_is_operator_p
5737 /* And the expression which is being cast. */
5742 parser->greater_than_is_operator_p
5745 /* Only type conversions to integral or enumeration types
5746 can be used in constant-expressions. */
5752 {
5754 postfix_expression
5758 postfix_expression
5762 postfix_expression
5764 tf_warning_or_error);
5767 postfix_expression
5772 }
5773 }
5777 {
5778 tree type;
5782 /* Consume the `typeid' token. */
5784 /* Look for the `(' token. */
5786 /* Types cannot be defined in a `typeid' expression. */
5788 parser->type_definition_forbidden_message
5790 /* We can't be sure yet whether we're looking at a type-id or an
5791 expression. */
5793 /* Try a type-id first. */
5798 /* Look for the `)' token. Otherwise, we can't be sure that
5799 we're not looking at an expression: consider `typeid (int
5800 (3))', for example. */
5802 /* If all went well, simply lookup the type-id. */
5805 /* Otherwise, fall back to the expression variant. */
5806 else
5807 {
5808 tree expression;
5810 /* Look for an expression. */
5812 /* Compute its typeid. */
5814 /* Look for the `)' token. */
5816 }
5817 /* Restore the saved message. */
5819 /* `typeid' may not appear in an integral constant expression. */
5822 }
5826 {
5827 tree type;
5828 /* The syntax permitted here is the same permitted for an
5829 elaborated-type-specifier. */
5834 }
5838 {
5842 {
5847 }
5849 {
5854 }
5855 else
5856 {
5857 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5860 }
5862 postfix_expression =
5866 {
5870 }
5872 {
5877 }
5878 else
5879 {
5881 postfix_expression);
5885 }
5887 }
5890 {
5893 tree p;
5907 tf_warning_or_error);
5910 tf_warning_or_error);
5911 else
5912 {
5916 }
5918 }
5921 {
5922 tree type;
5924 /* If the next thing is a simple-type-specifier, we may be
5925 looking at a functional cast. We could also be looking at
5926 an id-expression. So, we try the functional cast, and if
5927 that doesn't work we fall back to the primary-expression. */
5929 /* Look for the simple-type-specifier. */
5932 CP_PARSER_FLAGS_NONE);
5933 /* Parse the cast itself. */
5935 postfix_expression
5937 /* If that worked, we're done. */
5941 /* If the functional-cast didn't work out, try a
5942 compound-literal. */
5945 {
5950 /* Avoid calling cp_parser_type_id pointlessly, see comment
5951 in cp_parser_cast_expression about c++/29234. */
5954 else
5955 {
5956 /* Parse the type. */
5961 /* Look for the `)'. */
5963 }
5965 /* If things aren't going well, there's no need to
5966 keep going. */
5968 {
5970 /* Parse the brace-enclosed initializer list. */
5973 }
5974 /* If that worked, we're definitely looking at a
5975 compound-literal expression. */
5977 {
5978 /* Warn the user that a compound literal is not
5979 allowed in standard C++. */
5982 /* For simplicity, we disallow compound literals in
5983 constant-expressions. We could
5984 allow compound literals of integer type, whose
5985 initializer was a constant, in constant
5986 expressions. Permitting that usage, as a further
5987 extension, would not change the meaning of any
5988 currently accepted programs. (Of course, as
5989 compound literals are not part of ISO C++, the
5990 standard has nothing to say.) */
5992 NIC_NCC))
5993 {
5996 }
5997 /* Form the representation of the compound-literal. */
5998 postfix_expression
6000 tf_warning_or_error);
6002 }
6003 }
6005 /* It must be a primary-expression. */
6006 postfix_expression
6009 decltype_p,
6011 }
6013 }
6015 /* Note that we don't need to worry about calling build_cplus_new on a
6016 class-valued CALL_EXPR in decltype when it isn't the end of the
6017 postfix-expression; unary_complex_lvalue will take care of that for
6018 all these cases. */
6020 /* Keep looping until the postfix-expression is complete. */
6022 {
6026 /* It is not a Koenig lookup function call. */
6027 postfix_expression
6030 /* Peek at the next token. */
6034 {
6037 {
6039 "two consecutive %<[%> shall "
6042 }
6043 postfix_expression
6045 postfix_expression,
6047 decltype_p);
6053 /* postfix-expression ( expression-list [opt] ) */
6054 {
6064 is_builtin_constant_p
6067 {
6068 /* The whole point of __builtin_constant_p is to allow
6069 non-constant expressions to appear as arguments. */
6070 saved_integral_constant_expression_p
6072 saved_non_integral_constant_expression_p
6075 }
6076 args = (cp_parser_parenthesized_expression_list
6082 {
6083 parser->integral_constant_expression_p
6085 parser->non_integral_constant_expression_p
6087 }
6090 {
6093 }
6095 /* Function calls are not permitted in
6096 constant-expressions. */
6099 NIC_FUNC_CALL))
6100 {
6104 }
6109 {
6111 {
6113 {
6116 postfix_expression
6118 complain);
6119 }
6120 else
6121 postfix_expression
6123 }
6124 /* We do not perform argument-dependent lookup if
6125 normal lookup finds a non-function, in accordance
6126 with the expected resolution of DR 218. */
6129 {
6133 /* Do not do argument dependent lookup if regular
6134 lookup finds a member function or a block-scope
6135 function declaration. [basic.lookup.argdep]/3 */
6138 {
6141 postfix_expression
6143 complain);
6144 }
6145 }
6146 }
6149 {
6159 "%<memset%> used with constant zero length "
6160 "parameter; this could be due to transposed "
6163 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6164 to avoid leaking those into folder and middle-end. */
6166 tree arg;
6170 }
6173 {
6183 {
6184 postfix_expression
6188 }
6191 {
6192 postfix_expression
6193 = (build_new_method_call
6199 complain));
6200 }
6201 else
6202 postfix_expression
6206 complain);
6207 }
6211 postfix_expression = (build_offset_ref_call_from_tree
6213 complain));
6215 /* A call to a static class member, or a namespace-scope
6216 function. */
6217 postfix_expression
6220 koenig_p,
6221 complain);
6222 else
6223 /* All other function calls. */
6224 postfix_expression
6227 koenig_p,
6228 complain);
6232 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6236 }
6241 /* postfix-expression . template [opt] id-expression
6242 postfix-expression . pseudo-destructor-name
6243 postfix-expression -> template [opt] id-expression
6244 postfix-expression -> pseudo-destructor-name */
6246 /* Consume the `.' or `->' operator. */
6249 postfix_expression
6251 postfix_expression,
6258 /* postfix-expression ++ */
6259 /* Consume the `++' token. */
6261 /* Generate a representation for the complete expression. */
6262 postfix_expression
6264 POSTINCREMENT_EXPR);
6265 /* Increments may not appear in constant-expressions. */
6273 /* postfix-expression -- */
6274 /* Consume the `--' token. */
6276 /* Generate a representation for the complete expression. */
6277 postfix_expression
6279 POSTDECREMENT_EXPR);
6280 /* Decrements may not appear in constant-expressions. */
6292 else
6294 }
6295 }
6297 /* We should never get here. */
6300 }
6302 /* This function parses Cilk Plus array notations. If a normal array expr. is
6303 parsed then the array index is passed back to the caller through *INIT_INDEX
6304 and the function returns a NULL_TREE. If array notation expr. is parsed,
6305 then *INIT_INDEX is ignored by the caller and the function returns
6306 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6307 error_mark_node. */
6309 static tree
6311 tree array_value)
6312 {
6316 {
6319 }
6328 {
6331 }
6333 {
6334 /* Consume the ':'. */
6337 /* If we are here, then we have a case like this A[:]. */
6339 {
6343 }
6347 }
6348 else
6349 {
6350 /* If we are here, then there are three valid possibilities:
6351 1. ARRAY [ EXP ]
6352 2. ARRAY [ EXP : EXP ]
6353 3. ARRAY [ EXP : EXP : EXP ] */
6357 {
6358 /* This indicates that we have a normal array expression. */
6361 }
6363 /* Consume the ':'. */
6367 {
6370 }
6371 }
6376 {
6380 }
6386 }
6388 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6389 by cp_parser_builtin_offsetof. We're looking for
6391 postfix-expression [ expression ]
6392 postfix-expression [ braced-init-list ] (C++11)
6394 FOR_OFFSETOF is set if we're being called in that context, which
6395 changes how we deal with integer constant expressions. */
6397 static tree
6399 tree postfix_expression,
6402 {
6407 /* Consume the `[' token. */
6413 /* Parse the index expression. */
6414 /* ??? For offsetof, there is a question of what to allow here. If
6415 offsetof is not being used in an integral constant expression context,
6416 then we *could* get the right answer by computing the value at runtime.
6417 If we are in an integral constant expression context, then we might
6418 could accept any constant expression; hard to say without analysis.
6419 Rather than open the barn door too wide right away, allow only integer
6420 constant expressions here. */
6423 else
6424 {
6426 {
6433 {
6435 "braced list index is not allowed with array "
6439 }
6440 }
6442 {
6443 /* Here are have these two options:
6444 ARRAY[EXP : EXP] - Array notation expr with default
6445 stride of 1.
6446 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6447 stride. */
6449 postfix_expression);
6452 }
6453 else
6455 }
6459 /* Look for the closing `]'. */
6462 /* Build the ARRAY_REF. */
6466 /* When not doing offsetof, array references are not permitted in
6467 constant-expressions. */
6473 }
6475 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6476 by cp_parser_builtin_offsetof. We're looking for
6478 postfix-expression . template [opt] id-expression
6479 postfix-expression . pseudo-destructor-name
6480 postfix-expression -> template [opt] id-expression
6481 postfix-expression -> pseudo-destructor-name
6483 FOR_OFFSETOF is set if we're being called in that context. That sorta
6484 limits what of the above we'll actually accept, but nevermind.
6485 TOKEN_TYPE is the "." or "->" token, which will already have been
6486 removed from the stream. */
6488 static tree
6491 tree postfix_expression,
6493 location_t location)
6494 {
6495 tree name;
6500 /* If this is a `->' operator, dereference the pointer. */
6503 tf_warning_or_error);
6504 /* Check to see whether or not the expression is type-dependent. */
6506 /* The identifier following the `->' or `.' is not qualified. */
6512 /* Enter the scope corresponding to the type of the object
6513 given by the POSTFIX_EXPRESSION. */
6515 {
6517 /* According to the standard, no expression should ever have
6518 reference type. Unfortunately, we do not currently match
6519 the standard in this respect in that our internal representation
6520 of an expression may have reference type even when the standard
6521 says it does not. Therefore, we have to manually obtain the
6522 underlying type here. */
6524 /* The type of the POSTFIX_EXPRESSION must be complete. */
6526 {
6528 postfix_expression);
6530 }
6531 /* Unlike the object expression in other contexts, *this is not
6532 required to be of complete type for purposes of class member
6533 access (5.2.5) outside the member function body. */
6537 /* Let the name lookup machinery know that we are processing a
6538 class member access expression. */
6540 /* If something went wrong, we want to be able to discern that case,
6541 as opposed to the case where there was no SCOPE due to the type
6542 of expression being dependent. */
6545 /* If the SCOPE was erroneous, make the various semantic analysis
6546 functions exit quickly -- and without issuing additional error
6547 messages. */
6550 }
6552 /* Assume this expression is not a pseudo-destructor access. */
6555 /* If the SCOPE is a scalar type, then, if this is a valid program,
6556 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6557 is type dependent, it can be pseudo-destructor-name or something else.
6558 Try to parse it as pseudo-destructor-name first. */
6560 {
6561 tree s;
6562 tree type;
6565 /* Parse the pseudo-destructor-name. */
6574 {
6576 postfix_expression
6579 }
6580 }
6583 {
6584 /* If the SCOPE is not a scalar type, we are looking at an
6585 ordinary class member access expression, rather than a
6586 pseudo-destructor-name. */
6589 /* Parse the id-expression. */
6590 name = (cp_parser_id_expression
6597 /* In general, build a SCOPE_REF if the member name is qualified.
6598 However, if the name was not dependent and has already been
6599 resolved; there is no need to build the SCOPE_REF. For example;
6601 struct X { void f(); };
6602 template <typename T> void f(T* t) { t->X::f(); }
6604 Even though "t" is dependent, "X::f" is not and has been resolved
6605 to a BASELINK; there is no need to include scope information. */
6607 /* But we do need to remember that there was an explicit scope for
6608 virtual function calls. */
6612 /* If the name is a template-id that names a type, we will get a
6613 TYPE_DECL here. That is invalid code. */
6615 {
6618 }
6619 else
6620 {
6622 {
6624 {
6628 }
6629 else
6632 name,
6633 template_p);
6637 }
6639 adjust_result_of_qualified_name_lookup
6641 postfix_expression
6643 template_p,
6644 tf_warning_or_error);
6645 }
6646 }
6648 /* We no longer need to look up names in the scope of the object on
6649 the left-hand side of the `.' or `->' operator. */
6652 /* Outside of offsetof, these operators may not appear in
6653 constant-expressions. */
6655 && (cp_parser_non_integral_constant_expression
6660 }
6662 /* Cache of LITERAL_ZERO_P constants. */
6666 /* Parse a parenthesized expression-list.
6668 expression-list:
6669 assignment-expression
6670 expression-list, assignment-expression
6672 attribute-list:
6673 expression-list
6674 identifier
6675 identifier, expression-list
6677 CAST_P is true if this expression is the target of a cast.
6679 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6680 argument pack.
6682 Returns a vector of trees. Each element is a representation of an
6683 assignment-expression. NULL is returned if the ( and or ) are
6684 missing. An empty, but allocated, vector is returned on no
6685 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6686 if we are parsing an attribute list for an attribute that wants a
6687 plain identifier argument, normal_attr for an attribute that wants
6688 an expression, or non_attr if we aren't parsing an attribute list. If
6689 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6690 not all of the expressions in the list were constant.
6691 WANT_LITERAL_ZERO_P is true if the caller is interested in
6692 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6693 immediately, this can be removed. */
6702 {
6708 /* Assume all the expressions will be constant. */
6717 /* Within a parenthesized expression, a `>' token is always
6718 the greater-than operator. */
6719 saved_greater_than_is_operator_p
6723 /* Consume expressions until there are no more. */
6726 {
6727 tree expr;
6729 /* At the beginning of attribute lists, check to see if the
6730 next token is an identifier. */
6733 {
6736 /* Consume the identifier. */
6738 /* Save the identifier. */
6740 }
6741 else
6742 {
6745 /* Parse the next assignment-expression. */
6747 {
6748 /* A braced-init-list. */
6754 }
6756 {
6757 expr = (cp_parser_constant_expression
6762 }
6763 else
6764 {
6768 {
6774 /* If a parameter is literal zero alone, remember it
6775 for -Wmemset-transposed-args warning. */
6778 && want_literal_zero_p
6780 == CPP_COMMA
6783 {
6790 else
6791 {
6796 }
6797 /* Consume the 0 token (or '\0', 0LL etc.). */
6799 }
6803 }
6806 NULL);
6807 }
6812 /* If we have an ellipsis, then this is an expression
6813 expansion. */
6816 {
6817 /* Consume the `...'. */
6820 /* Build the argument pack. */
6822 }
6824 /* Add it to the list. We add error_mark_node
6825 expressions to the list, so that we can still tell if
6826 the correct form for a parenthesized expression-list
6827 is found. That gives better errors. */
6832 }
6834 /* After the first item, attribute lists look the same as
6835 expression lists. */
6838 get_comma:;
6839 /* If the next token isn't a `,', then we are done. */
6843 /* Otherwise, consume the `,' and keep going. */
6845 }
6848 {
6851 skip_comma:;
6852 /* We try and resync to an unnested comma, as that will give the
6853 user better diagnostics. */
6861 {
6862 parser->greater_than_is_operator_p
6865 }
6866 }
6868 parser->greater_than_is_operator_p
6875 }
6877 /* Parse a pseudo-destructor-name.
6879 pseudo-destructor-name:
6880 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6881 :: [opt] nested-name-specifier template template-id :: ~ type-name
6882 :: [opt] nested-name-specifier [opt] ~ type-name
6884 If either of the first two productions is used, sets *SCOPE to the
6885 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6886 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6887 or ERROR_MARK_NODE if the parse fails. */
6889 static void
6891 tree object,
6894 {
6897 /* Handle ~auto. */
6901 {
6904 "%<~auto%> only available with "
6911 }
6913 /* Assume that things will not work out. */
6916 /* Look for the optional `::' operator. */
6918 /* Look for the optional nested-name-specifier. */
6919 nested_name_specifier_p
6926 /* Now, if we saw a nested-name-specifier, we might be doing the
6927 second production. */
6930 {
6931 /* Consume the `template' keyword. */
6933 /* Parse the template-id. */
6937 class_type,
6939 /* Look for the `::' token. */
6941 }
6942 /* If the next token is not a `~', then there might be some
6943 additional qualification. */
6945 {
6946 /* At this point, we're looking for "type-name :: ~". The type-name
6947 must not be a class-name, since this is a pseudo-destructor. So,
6948 it must be either an enum-name, or a typedef-name -- both of which
6949 are just identifiers. So, we peek ahead to check that the "::"
6950 and "~" tokens are present; if they are not, then we can avoid
6951 calling type_name. */
6955 {
6958 }
6960 /* Look for the type-name. */
6965 /* Look for the `::' token. */
6967 }
6968 else
6971 /* Look for the `~'. */
6974 /* Once we see the ~, this has to be a pseudo-destructor. */
6978 /* Look for the type-name again. We are not responsible for
6979 checking that it matches the first type-name. */
6981 }
6983 /* Parse a unary-expression.
6985 unary-expression:
6986 postfix-expression
6987 ++ cast-expression
6988 -- cast-expression
6989 unary-operator cast-expression
6990 sizeof unary-expression
6991 sizeof ( type-id )
6992 alignof ( type-id ) [C++0x]
6993 new-expression
6994 delete-expression
6996 GNU Extensions:
6998 unary-expression:
6999 __extension__ cast-expression
7000 __alignof__ unary-expression
7001 __alignof__ ( type-id )
7002 alignof unary-expression [C++0x]
7003 __real__ cast-expression
7004 __imag__ cast-expression
7005 && identifier
7006 sizeof ( type-id ) { initializer-list , [opt] }
7007 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7008 __alignof__ ( type-id ) { initializer-list , [opt] }
7010 ADDRESS_P is true iff the unary-expression is appearing as the
7011 operand of the `&' operator. CAST_P is true if this expression is
7012 the target of a cast.
7014 Returns a representation of the expression. */
7016 static tree
7019 {
7023 /* Peek at the next token. */
7025 /* Some keywords give away the kind of expression. */
7027 {
7031 {
7034 {
7037 location_t first_loc;
7040 /* Consume the token. */
7043 /* Parse the operand. */
7048 else
7049 {
7050 /* ISO C++ defines alignof only with types, not with
7051 expressions. So pedwarn if alignof is used with a non-
7052 type expression. However, __alignof__ is ok. */
7055 "ISO C++ does not allow %<alignof%> "
7059 }
7060 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7061 SIZEOF_EXPR with the original operand. */
7063 {
7065 {
7067 {
7070 error_mark_node));
7072 }
7073 else
7077 }
7079 }
7081 }
7090 {
7091 /* The saved value of the PEDANTIC flag. */
7093 tree expr;
7095 /* Save away the PEDANTIC flag. */
7097 /* Parse the cast-expression. */
7099 /* Restore the PEDANTIC flag. */
7103 }
7107 {
7108 tree expression;
7110 /* Consume the `__real__' or `__imag__' token. */
7112 /* Parse the cast-expression. */
7114 /* Create the complete representation. */
7118 expression,
7119 tf_warning_or_error);
7120 }
7128 {
7129 tree expr;
7139 parser->type_definition_forbidden_message
7142 saved_integral_constant_expression_p
7144 saved_non_integral_constant_expression_p
7148 saved_greater_than_is_operator_p
7158 parser->greater_than_is_operator_p
7161 parser->integral_constant_expression_p
7163 parser->non_integral_constant_expression_p
7170 }
7174 }
7175 }
7177 /* Look for the `:: new' and `:: delete', which also signal the
7178 beginning of a new-expression, or delete-expression,
7179 respectively. If the next token is `::', then it might be one of
7180 these. */
7182 {
7185 /* See if the token after the `::' is one of the keywords in
7186 which we're interested. */
7188 /* If it's `new', we have a new-expression. */
7191 /* Similarly, for `delete'. */
7194 }
7196 /* Look for a unary operator. */
7198 /* The `++' and `--' operators can be handled similarly, even though
7199 they are not technically unary-operators in the grammar. */
7201 {
7206 /* Handle the GNU address-of-label extension. */
7209 {
7210 tree identifier;
7211 tree expression;
7214 /* Consume the '&&' token. */
7216 /* Look for the identifier. */
7218 /* Create an expression representing the address. */
7221 NIC_ADDR_LABEL))
7224 }
7225 }
7227 {
7228 tree cast_expression;
7234 /* Consume the operator token. */
7236 /* Parse the cast-expression. */
7237 cast_expression
7242 pidk);
7243 /* Now, build an appropriate representation. */
7245 {
7249 RO_UNARY_STAR,
7250 complain);
7255 /* Fall through. */
7258 cast_expression,
7259 complain);
7266 /* Fall through. */
7276 }
7280 non_constant_p))
7284 }
7288 decltype_p,
7289 pidk);
7290 }
7295 {
7298 }
7300 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7301 unary-operator, the corresponding tree code is returned. */
7303 static enum tree_code
7305 {
7307 {
7328 }
7329 }
7331 /* Parse a new-expression.
7333 new-expression:
7334 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7335 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7337 Returns a representation of the expression. */
7339 static tree
7341 {
7344 tree type;
7347 tree ret;
7349 /* Look for the optional `::' operator. */
7350 global_scope_p
7354 /* Look for the `new' operator. */
7356 /* There's no easy way to tell a new-placement from the
7357 `( type-id )' construct. */
7359 /* Look for a new-placement. */
7361 /* If that didn't work out, there's no new-placement. */
7363 {
7367 }
7369 /* If the next token is a `(', then we have a parenthesized
7370 type-id. */
7372 {
7376 /* Consume the `('. */
7379 /* Parse the type-id. */
7380 parser->type_definition_forbidden_message
7385 /* Look for the closing `)'. */
7388 /* There should not be a direct-new-declarator in this production,
7389 but GCC used to allowed this, so we check and emit a sensible error
7390 message for this case. */
7392 {
7398 }
7399 }
7400 /* Otherwise, there must be a new-type-id. */
7401 else
7404 /* If the next token is a `(' or '{', then we have a new-initializer. */
7408 else
7411 /* A new-expression may not appear in an integral constant
7412 expression. */
7415 else
7416 {
7417 /* Create a representation of the new-expression. */
7419 tf_warning_or_error);
7420 }
7428 }
7430 /* Parse a new-placement.
7432 new-placement:
7433 ( expression-list )
7435 Returns the same representation as for an expression-list. */
7439 {
7442 /* Parse the expression-list. */
7443 expression_list = (cp_parser_parenthesized_expression_list
7449 }
7451 /* Parse a new-type-id.
7453 new-type-id:
7454 type-specifier-seq new-declarator [opt]
7456 Returns the TYPE allocated. If the new-type-id indicates an array
7457 type, *NELTS is set to the number of elements in the last array
7458 bound; the TYPE will not include the last array bound. */
7460 static tree
7462 {
7463 cp_decl_specifier_seq type_specifier_seq;
7469 /* The type-specifier sequence must not contain type definitions.
7470 (It cannot contain declarations of new types either, but if they
7471 are not definitions we will catch that because they are not
7472 complete.) */
7474 parser->type_definition_forbidden_message
7476 /* Parse the type-specifier-seq. */
7480 /* Restore the old message. */
7486 /* Parse the new-declarator. */
7489 /* Determine the number of elements in the last array dimension, if
7490 any. */
7492 /* Skip down to the last array dimension. */
7497 {
7500 }
7505 {
7508 }
7511 {
7518 else
7520 }
7523 }
7525 /* Parse an (optional) new-declarator.
7527 new-declarator:
7528 ptr-operator new-declarator [opt]
7529 direct-new-declarator
7531 Returns the declarator. */
7535 {
7538 cp_cv_quals cv_quals;
7540 /* We don't know if there's a ptr-operator next, or not. */
7542 /* Look for a ptr-operator. */
7544 /* If that worked, look for more new-declarators. */
7546 {
7549 /* Parse another optional declarator. */
7552 declarator = cp_parser_make_indirect_declarator
7556 }
7558 /* If the next token is a `[', there is a direct-new-declarator. */
7563 }
7565 /* Parse a direct-new-declarator.
7567 direct-new-declarator:
7568 [ expression ]
7569 direct-new-declarator [constant-expression]
7571 */
7575 {
7579 {
7580 tree expression;
7583 /* Look for the opening `['. */
7588 /* The standard requires that the expression have integral
7589 type. DR 74 adds enumeration types. We believe that the
7590 real intent is that these expressions be handled like the
7591 expression in a `switch' condition, which also allows
7592 classes with a single conversion to integral or
7593 enumeration type. */
7595 {
7596 expression
7598 expression,
7601 {
7603 "expression in new-declarator must have integral "
7606 }
7607 }
7609 /* Look for the closing `]'. */
7612 /* Add this bound to the declarator. */
7615 /* If the next token is not a `[', then there are no more
7616 bounds. */
7619 }
7622 }
7624 /* Parse a new-initializer.
7626 new-initializer:
7627 ( expression-list [opt] )
7628 braced-init-list
7630 Returns a representation of the expression-list. */
7634 {
7638 {
7639 tree t;
7646 }
7647 else
7648 expression_list = (cp_parser_parenthesized_expression_list
7654 }
7656 /* Parse a delete-expression.
7658 delete-expression:
7659 :: [opt] delete cast-expression
7660 :: [opt] delete [ ] cast-expression
7662 Returns a representation of the expression. */
7664 static tree
7666 {
7669 tree expression;
7671 /* Look for the optional `::' operator. */
7672 global_scope_p
7676 /* Look for the `delete' keyword. */
7678 /* See if the array syntax is in use. */
7680 {
7681 /* Consume the `[' token. */
7683 /* Look for the `]' token. */
7685 /* Remember that this is the `[]' construct. */
7687 }
7688 else
7691 /* Parse the cast-expression. */
7694 /* A delete-expression may not appear in an integral constant
7695 expression. */
7700 tf_warning_or_error);
7701 }
7703 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7704 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7705 0 otherwise. */
7707 static int
7709 {
7712 {
7754 /* In ((type ()) () the last () isn't a valid cast-expression,
7755 so the whole must be parsed as postfix-expression. */
7760 /* '[' may start a primary-expression in obj-c++ and in C++11,
7761 as a lambda-expression, eg, '(void)[]{}'. */
7768 /* '++' and '--' may or may not start a cast-expression:
7770 struct T { void operator++(int); };
7771 void f() { (T())++; }
7773 vs
7775 int a;
7776 (int)++a; */
7781 }
7782 }
7784 /* Parse a cast-expression.
7786 cast-expression:
7787 unary-expression
7788 ( type-id ) cast-expression
7790 ADDRESS_P is true iff the unary-expression is appearing as the
7791 operand of the `&' operator. CAST_P is true if this expression is
7792 the target of a cast.
7794 Returns a representation of the expression. */
7796 static tree
7799 {
7800 /* If it's a `(', then we might be looking at a cast. */
7802 {
7808 /* There's no way to know yet whether or not this is a cast.
7809 For example, `(int (3))' is a unary-expression, while `(int)
7810 3' is a cast. So, we resort to parsing tentatively. */
7812 /* Types may not be defined in a cast. */
7814 parser->type_definition_forbidden_message
7816 /* Consume the `('. */
7818 /* A very tricky bit is that `(struct S) { 3 }' is a
7819 compound-literal (which we permit in C++ as an extension).
7820 But, that construct is not a cast-expression -- it is a
7821 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7822 is legal; if the compound-literal were a cast-expression,
7823 you'd need an extra set of parentheses.) But, if we parse
7824 the type-id, and it happens to be a class-specifier, then we
7825 will commit to the parse at that point, because we cannot
7826 undo the action that is done when creating a new class. So,
7827 then we cannot back up and do a postfix-expression.
7829 Another tricky case is the following (c++/29234):
7831 struct S { void operator () (); };
7833 void foo ()
7834 {
7835 ( S()() );
7836 }
7838 As a type-id we parse the parenthesized S()() as a function
7839 returning a function, groktypename complains and we cannot
7840 back up in this case either.
7842 Therefore, we scan ahead to the closing `)', and check to see
7843 if the tokens after the `)' can start a cast-expression. Otherwise
7844 we are dealing with an unary-expression, a postfix-expression
7845 or something else.
7847 Yet another tricky case, in C++11, is the following (c++/54891):
7849 (void)[]{};
7851 The issue is that usually, besides the case of lambda-expressions,
7852 the parenthesized type-id cannot be followed by '[', and, eg, we
7853 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7854 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7855 we don't commit, we try a cast-expression, then an unary-expression.
7857 Save tokens so that we can put them back. */
7860 /* We may be looking at a cast-expression. */
7863 cast_expression
7866 /* Roll back the tokens we skipped. */
7868 /* If we aren't looking at a cast-expression, simulate an error so
7869 that the call to cp_parser_error_occurred below returns true. */
7872 else
7873 {
7876 /* Look for the type-id. */
7878 /* Look for the closing `)'. */
7881 }
7883 /* Restore the saved message. */
7886 /* At this point this can only be either a cast or a
7887 parenthesized ctor such as `(T ())' that looks like a cast to
7888 function returning T. */
7890 {
7891 /* Only commit if the cast-expression doesn't start with
7892 '++', '--', or '[' in C++11. */
7900 pidk);
7903 {
7904 /* Warn about old-style casts, if so requested. */
7911 /* Only type conversions to integral or enumeration types
7912 can be used in constant-expressions. */
7915 NIC_CAST))
7918 /* Perform the cast. */
7921 }
7922 }
7923 else
7925 }
7927 /* If we get here, then it's not a cast, so it must be a
7928 unary-expression. */
7931 }
7933 /* Parse a binary expression of the general form:
7935 pm-expression:
7936 cast-expression
7937 pm-expression .* cast-expression
7938 pm-expression ->* cast-expression
7940 multiplicative-expression:
7941 pm-expression
7942 multiplicative-expression * pm-expression
7943 multiplicative-expression / pm-expression
7944 multiplicative-expression % pm-expression
7946 additive-expression:
7947 multiplicative-expression
7948 additive-expression + multiplicative-expression
7949 additive-expression - multiplicative-expression
7951 shift-expression:
7952 additive-expression
7953 shift-expression << additive-expression
7954 shift-expression >> additive-expression
7956 relational-expression:
7957 shift-expression
7958 relational-expression < shift-expression
7959 relational-expression > shift-expression
7960 relational-expression <= shift-expression
7961 relational-expression >= shift-expression
7963 GNU Extension:
7965 relational-expression:
7966 relational-expression <? shift-expression
7967 relational-expression >? shift-expression
7969 equality-expression:
7970 relational-expression
7971 equality-expression == relational-expression
7972 equality-expression != relational-expression
7974 and-expression:
7975 equality-expression
7976 and-expression & equality-expression
7978 exclusive-or-expression:
7979 and-expression
7980 exclusive-or-expression ^ and-expression
7982 inclusive-or-expression:
7983 exclusive-or-expression
7984 inclusive-or-expression | exclusive-or-expression
7986 logical-and-expression:
7987 inclusive-or-expression
7988 logical-and-expression && inclusive-or-expression
7990 logical-or-expression:
7991 logical-and-expression
7992 logical-or-expression || logical-and-expression
7994 All these are implemented with a single function like:
7996 binary-expression:
7997 simple-cast-expression
7998 binary-expression <token> binary-expression
8000 CAST_P is true if this expression is the target of a cast.
8002 The binops_by_token map is used to get the tree codes for each <token> type.
8003 binary-expressions are associated according to a precedence table. */
8005 #define TOKEN_PRECEDENCE(token) \
8006 (((token->type == CPP_GREATER \
8007 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8008 && !parser->greater_than_is_operator_p) \
8009 ? PREC_NOT_OPERATOR \
8010 : binops_by_token[token->type].prec)
8012 static tree
8018 {
8019 cp_parser_expression_stack stack;
8021 cp_parser_expression_stack_entry current;
8022 tree rhs;
8026 tree overload;
8028 /* Parse the first expression. */
8039 {
8040 /* Get an operator token. */
8046 {
8048 "%<>>%> operator is treated"
8052 }
8056 /* Popping an entry off the stack means we completed a subexpression:
8057 - either we found a token which is not an operator (`>' where it is not
8058 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8059 will happen repeatedly;
8060 - or, we found an operator which has lower priority. This is the case
8061 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8062 parsing `3 * 4'. */
8064 {
8067 else
8069 }
8071 get_rhs:
8075 /* We used the operator token. */
8078 /* For "false && x" or "true || x", x will never be executed;
8079 disable warnings while evaluating it. */
8085 /* Extract another operand. It may be the RHS of this expression
8086 or the LHS of a new, higher priority expression. */
8091 /* Get another operator token. Look up its precedence to avoid
8092 building a useless (immediately popped) stack entry for common
8093 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8097 {
8098 /* ... and prepare to parse the RHS of the new, higher priority
8099 expression. Since precedence levels on the stack are
8100 monotonically increasing, we do not have to care about
8101 stack overflows. */
8110 pop:
8112 /* If the stack is not empty, we have parsed into LHS the right side
8113 (`4' in the example above) of an expression we had suspended.
8114 We can use the information on the stack to recover the LHS (`3')
8115 from the stack together with the tree code (`MULT_EXPR'), and
8116 the precedence of the higher level subexpression
8117 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8118 which will be used to actually build the additive expression. */
8123 }
8125 /* Undo the disabling of warnings done above. */
8136 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8137 ERROR_MARK for everything that is not a binary expression.
8138 This makes warn_about_parentheses miss some warnings that
8139 involve unary operators. For unary expressions we should
8140 pass the correct tree_code unless the unary expression was
8141 surrounded by parentheses.
8142 */
8148 == tcc_comparison
8151 else
8160 /* If the binary operator required the use of an overloaded operator,
8161 then this expression cannot be an integral constant-expression.
8162 An overloaded operator can be used even if both operands are
8163 otherwise permissible in an integral constant-expression if at
8164 least one of the operands is of enumeration type. */
8168 NIC_OVERLOADED))
8170 }
8173 }
8175 static tree
8180 {
8183 }
8185 /* Parse the `? expression : assignment-expression' part of a
8186 conditional-expression. The LOGICAL_OR_EXPR is the
8187 logical-or-expression that started the conditional-expression.
8188 Returns a representation of the entire conditional-expression.
8190 This routine is used by cp_parser_assignment_expression.
8192 ? expression : assignment-expression
8194 GNU Extensions:
8196 ? : assignment-expression */
8198 static tree
8200 {
8201 tree expr;
8202 tree assignment_expr;
8206 /* Consume the `?' token. */
8211 {
8214 /* Implicit true clause. */
8218 }
8219 else
8220 {
8223 /* Parse the expression. */
8226 c_inhibit_evaluation_warnings +=
8230 }
8232 /* The next token should be a `:'. */
8234 /* Parse the assignment-expression. */
8238 /* Build the conditional-expression. */
8240 expr,
8241 assignment_expr,
8242 tf_warning_or_error);
8243 }
8245 /* Parse an assignment-expression.
8247 assignment-expression:
8248 conditional-expression
8249 logical-or-expression assignment-operator assignment_expression
8250 throw-expression
8252 CAST_P is true if this expression is the target of a cast.
8253 DECLTYPE_P is true if this expression is the operand of decltype.
8255 Returns a representation for the expression. */
8257 static tree
8260 {
8261 tree expr;
8263 /* If the next token is the `throw' keyword, then we're looking at
8264 a throw-expression. */
8267 /* Otherwise, it must be that we are looking at a
8268 logical-or-expression. */
8269 else
8270 {
8271 /* Parse the binary expressions (logical-or-expression). */
8273 decltype_p,
8275 /* If the next token is a `?' then we're actually looking at a
8276 conditional-expression. */
8279 else
8280 {
8283 /* If it's an assignment-operator, we're using the second
8284 production. */
8285 enum tree_code assignment_operator
8288 {
8290 location_t saved_input_location;
8292 /* Parse the right-hand side of the assignment. */
8298 /* An assignment may not appear in a
8299 constant-expression. */
8301 NIC_ASSIGNMENT))
8303 /* Build the assignment expression. Its default
8304 location is the location of the '=' token. */
8308 assignment_operator,
8309 rhs,
8312 }
8313 }
8314 }
8317 }
8319 static tree
8322 {
8325 }
8327 /* Parse an (optional) assignment-operator.
8329 assignment-operator: one of
8330 = *= /= %= += -= >>= <<= &= ^= |=
8332 GNU Extension:
8334 assignment-operator: one of
8335 <?= >?=
8337 If the next token is an assignment operator, the corresponding tree
8338 code is returned, and the token is consumed. For example, for
8339 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8340 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8341 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8342 operator, ERROR_MARK is returned. */
8344 static enum tree_code
8346 {
8350 /* Peek at the next token. */
8354 {
8400 /* Nothing else is an assignment operator. */
8402 }
8404 /* If it was an assignment operator, consume it. */
8409 }
8411 /* Parse an expression.
8413 expression:
8414 assignment-expression
8415 expression , assignment-expression
8417 CAST_P is true if this expression is the target of a cast.
8418 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8419 except possibly parenthesized or on the RHS of a comma (N3276).
8421 Returns a representation of the expression. */
8423 static tree
8426 {
8431 {
8432 tree assignment_expression;
8434 /* Parse the next assignment-expression. */
8435 assignment_expression
8438 /* We don't create a temporary for a call that is the immediate operand
8439 of decltype or on the RHS of a comma. But when we see a comma, we
8440 need to create a temporary for a call on the LHS. */
8445 assignment_expression
8449 /* If this is the first assignment-expression, we can just
8450 save it away. */
8453 else
8455 assignment_expression,
8457 /* If the next token is not a comma, then we are done with the
8458 expression. */
8461 /* Consume the `,'. */
8464 /* A comma operator cannot appear in a constant-expression. */
8467 }
8470 }
8472 /* Parse a constant-expression.
8474 constant-expression:
8475 conditional-expression
8477 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8478 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8479 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8480 is false, NON_CONSTANT_P should be NULL. */
8482 static tree
8486 {
8490 tree expression;
8492 /* It might seem that we could simply parse the
8493 conditional-expression, and then check to see if it were
8494 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8495 one that the compiler can figure out is constant, possibly after
8496 doing some simplifications or optimizations. The standard has a
8497 precise definition of constant-expression, and we must honor
8498 that, even though it is somewhat more restrictive.
8500 For example:
8502 int i[(2, 3)];
8504 is not a legal declaration, because `(2, 3)' is not a
8505 constant-expression. The `,' operator is forbidden in a
8506 constant-expression. However, GCC's constant-folding machinery
8507 will fold this operation to an INTEGER_CST for `3'. */
8509 /* Save the old settings. */
8511 saved_allow_non_integral_constant_expression_p
8514 /* We are now parsing a constant-expression. */
8516 parser->allow_non_integral_constant_expression_p
8519 /* Although the grammar says "conditional-expression", we parse an
8520 "assignment-expression", which also permits "throw-expression"
8521 and the use of assignment operators. In the case that
8522 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8523 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8524 actually essential that we look for an assignment-expression.
8525 For example, cp_parser_initializer_clauses uses this function to
8526 determine whether a particular assignment-expression is in fact
8527 constant. */
8529 /* Restore the old settings. */
8530 parser->integral_constant_expression_p
8532 parser->allow_non_integral_constant_expression_p
8535 {
8536 /* Require an rvalue constant expression here; that's what our
8537 callers expect. Reference constant expressions are handled
8538 separately in e.g. cp_parser_template_argument. */
8543 }
8546 parser->non_integral_constant_expression_p
8550 }
8552 /* Parse __builtin_offsetof.
8554 offsetof-expression:
8555 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8557 offsetof-member-designator:
8558 id-expression
8559 | offsetof-member-designator "." id-expression
8560 | offsetof-member-designator "[" expression "]"
8561 | offsetof-member-designator "->" id-expression */
8563 static tree
8565 {
8568 cp_id_kind dummy;
8571 /* We're about to accept non-integral-constant things, but will
8572 definitely yield an integral constant expression. Save and
8573 restore these values around our local parsing. */
8577 /* Consume the "__builtin_offsetof" token. */
8579 /* Consume the opening `('. */
8581 /* Parse the type-id. */
8584 /* Look for the `,'. */
8588 /* Build the (type *)null that begins the traditional offsetof macro. */
8590 tf_warning_or_error);
8592 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8596 {
8599 {
8601 /* offsetof-member-designator "[" expression "]" */
8607 /* offsetof-member-designator "->" identifier */
8610 /* FALLTHRU */
8613 /* offsetof-member-designator "." identifier */
8621 /* Consume the ")" token. */
8626 /* Error. We know the following require will fail, but
8627 that gives the proper error message. */
8632 }
8633 }
8635 success:
8636 /* If we're processing a template, we can't finish the semantics yet.
8637 Otherwise we can fold the entire expression now. */
8639 {
8642 }
8643 else
8646 failure:
8651 }
8653 /* Parse a trait expression.
8655 Returns a representation of the expression, the underlying type
8656 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8658 static tree
8660 {
8661 cp_trait_kind kind;
8664 cp_decl_specifier_seq decl_specs;
8667 {
8744 }
8746 /* Consume the token. */
8756 /* Build a trivial decl-specifier-seq. */
8760 /* Call grokdeclarator to figure out what type this is. */
8765 {
8773 /* Build a trivial decl-specifier-seq. */
8777 /* Call grokdeclarator to figure out what type this is. */
8780 }
8784 /* Complete the trait expression, which may mean either processing
8785 the trait expr now or saving it for template instantiation. */
8787 {
8796 }
8797 }
8799 /* Lambdas that appear in variable initializer or default argument scope
8800 get that in their mangling, so we need to record it. We might as well
8801 use the count for function and namespace scopes as well. */
8805 {
8806 tree t;
8811 static void
8813 {
8814 tree_int ti;
8816 /* Once we're inside a function, we ignore other scopes and just push
8817 the function again so that popping works properly. */
8824 {
8825 /* Don't reset the count if we're still in the same function. */
8828 }
8829 }
8831 static void
8833 {
8836 }
8838 static void
8840 {
8843 {
8846 }
8848 }
8850 /* Parse a lambda expression.
8852 lambda-expression:
8853 lambda-introducer lambda-declarator [opt] compound-statement
8855 Returns a representation of the expression. */
8857 static tree
8859 {
8861 tree type;
8868 {
8870 {
8874 }
8876 }
8878 /* We may be in the middle of deferred access check. Disable
8879 it now. */
8890 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8893 /* Now that we've started the type, add the capture fields for any
8894 explicit captures. */
8897 {
8898 /* Inside the class, surrounding template-parameter-lists do not apply. */
8899 unsigned int saved_num_template_parameter_lists
8903 bool fully_implicit_function_template_p
8907 bool auto_is_implicit_function_template_parm_p
8918 /* By virtue of defining a local class, a lambda expression has access to
8919 the private variables of enclosing classes. */
8926 {
8929 }
8931 /* The capture list was built up in reverse order; fix that now. */
8943 parser->fully_implicit_function_template_p
8947 parser->auto_is_implicit_function_template_parm_p
8949 }
8953 /* This field is only used during parsing of the lambda. */
8956 /* This lambda shouldn't have any proxies left at this point. */
8958 /* And now that we're done, push proxies for an enclosing lambda. */
8963 else
8965 }
8967 /* Parse the beginning of a lambda expression.
8969 lambda-introducer:
8970 [ lambda-capture [opt] ]
8972 LAMBDA_EXPR is the current representation of the lambda expression. */
8974 static void
8976 {
8977 /* Need commas after the first capture. */
8980 /* Eat the leading `['. */
8983 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8991 {
8994 }
8997 {
8999 tree capture_id;
9000 tree capture_init_expr;
9004 enum capture_kind_type
9005 {
9006 BY_COPY,
9007 BY_REFERENCE
9008 };
9012 {
9015 }
9019 else
9022 /* Possibly capture `this'. */
9024 {
9034 explicit_init_p);
9036 }
9038 /* Remember whether we want to capture as a reference or not. */
9040 {
9043 }
9045 /* Get the identifier. */
9050 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9051 delimiters, but I modified this to stop on unnested ']' as well. It
9052 was already changed to stop on unnested '}', so the
9053 "closing_parenthesis" name is no more misleading with my change. */
9054 {
9060 }
9062 /* Find the initializer for this capture. */
9066 {
9068 /* An explicit initializer exists. */
9071 "lambda capture initializers "
9077 {
9080 }
9081 }
9082 else
9083 {
9086 /* Turn the identifier into an id-expression. */
9087 capture_init_expr
9092 {
9095 }
9099 {
9102 capture_init_expr);
9105 }
9108 {
9111 capture_init_expr))
9114 }
9116 capture_init_expr
9117 = finish_id_expression
9119 capture_init_expr,
9133 {
9136 }
9137 else
9139 }
9143 {
9148 capture_id);
9152 "capture of %qD redundant with by-reference capture "
9154 }
9157 capture_id,
9158 capture_init_expr,
9160 explicit_init_p);
9161 }
9164 }
9166 /* Parse the (optional) middle of a lambda expression.
9168 lambda-declarator:
9169 < template-parameter-list [opt] >
9170 ( parameter-declaration-clause [opt] )
9171 attribute-specifier [opt]
9172 mutable [opt]
9173 exception-specification [opt]
9174 lambda-return-type-clause [opt]
9176 LAMBDA_EXPR is the current representation of the lambda expression. */
9178 static bool
9180 {
9181 /* 5.1.1.4 of the standard says:
9182 If a lambda-expression does not include a lambda-declarator, it is as if
9183 the lambda-declarator were ().
9184 This means an empty parameter list, no attributes, and no exception
9185 specification. */
9191 /* The template-parameter-list is optional, but must begin with
9192 an opening angle if present. */
9194 {
9197 "lambda templates are only available with "
9206 /* We just processed one more parameter list. */
9208 }
9210 /* The parameter-declaration-clause is optional (unless
9211 template-parameter-list was given), but must begin with an
9212 opening parenthesis if present. */
9214 {
9219 /* Parse parameters. */
9222 /* Default arguments shall not be specified in the
9223 parameter-declaration-clause of a lambda-declarator. */
9233 /* Parse optional `mutable' keyword. */
9235 {
9238 }
9240 /* Parse optional exception specification. */
9243 /* Parse optional trailing return type. */
9245 {
9249 }
9251 /* The function parameters must be in scope all the way until after the
9252 trailing-return-type in case of decltype. */
9254 }
9258 /* Create the function call operator.
9260 Messing with declarators like this is no uglier than building up the
9261 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9262 other code. */
9263 {
9264 cp_decl_specifier_seq return_type_specs;
9266 tree fco;
9273 else
9274 /* Maybe we will deduce the return type later. */
9280 sfk_none);
9285 VIRT_SPEC_UNSPECIFIED,
9286 REF_QUAL_NONE,
9287 exception_spec,
9292 declarator,
9293 attributes);
9295 {
9298 /* Give the object parameter a different name. */
9302 }
9304 {
9308 }
9317 }
9318 }
9320 /* Parse the body of a lambda expression, which is simply
9322 compound-statement
9324 but which requires special handling.
9325 LAMBDA_EXPR is the current representation of the lambda expression. */
9327 static void
9329 {
9334 else
9335 /* Still increment function_depth so that we don't GC in the
9336 middle of an expression. */
9338 /* Clear this in case we're in the middle of a default argument. */
9341 /* Finish the function call operator
9342 - class_specifier
9343 + late_parsing_for_member
9344 + function_definition_after_declarator
9345 + ctor_initializer_opt_and_function_body */
9346 {
9348 tree body;
9350 tree compound_stmt;
9351 tree cap;
9353 /* Let the front end know that we are going to be defining this
9354 function. */
9356 NULL_TREE,
9365 /* Push the proxies for any explicit captures. */
9372 /* 5.1.1.4 of the standard says:
9373 If a lambda-expression does not include a trailing-return-type, it
9374 is as if the trailing-return-type denotes the following type:
9375 * if the compound-statement is of the form
9376 { return attribute-specifier [opt] expression ; }
9377 the type of the returned expression after lvalue-to-rvalue
9378 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9379 (_conv.array_ 4.2), and function-to-pointer conversion
9380 (_conv.func_ 4.3);
9381 * otherwise, void. */
9383 /* In a lambda that has neither a lambda-return-type-clause
9384 nor a deducible form, errors should be reported for return statements
9385 in the body. Since we used void as the placeholder return type, parsing
9386 the body as usual will give such desired behavior. */
9390 {
9394 /* Parse tentatively in case there's more after the initial return
9395 statement. */
9406 {
9410 /* Will get error here if type not deduced yet. */
9414 }
9415 }
9418 {
9423 }
9427 out:
9431 /* Finish the function and generate code for it if necessary. */
9434 /* Only expand if the call op is not a template. */
9437 }
9442 else
9444 }
9446 /* Statements [gram.stmt.stmt] */
9448 /* Parse a statement.
9450 statement:
9451 labeled-statement
9452 expression-statement
9453 compound-statement
9454 selection-statement
9455 iteration-statement
9456 jump-statement
9457 declaration-statement
9458 try-block
9460 C++11:
9462 statement:
9463 labeled-statement
9464 attribute-specifier-seq (opt) expression-statement
9465 attribute-specifier-seq (opt) compound-statement
9466 attribute-specifier-seq (opt) selection-statement
9467 attribute-specifier-seq (opt) iteration-statement
9468 attribute-specifier-seq (opt) jump-statement
9469 declaration-statement
9470 attribute-specifier-seq (opt) try-block
9472 TM Extension:
9474 statement:
9475 atomic-statement
9477 IN_COMPOUND is true when the statement is nested inside a
9478 cp_parser_compound_statement; this matters for certain pragmas.
9480 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9481 is a (possibly labeled) if statement which is not enclosed in braces
9482 and has an else clause. This is used to implement -Wparentheses. */
9484 static void
9487 {
9492 restart:
9495 /* There is no statement yet. */
9501 /* In obj-c++, seeing '[[' might be the either the beginning of
9502 c++11 attributes, or a nested objc-message-expression. So
9503 let's parse the c++11 attributes tentatively. */
9507 {
9510 }
9512 /* Peek at the next token. */
9514 /* Remember the location of the first token in the statement. */
9516 /* If this is a keyword, then that will often determine what kind of
9517 statement we have. */
9519 {
9523 {
9526 /* Looks like a labeled-statement with a case label.
9527 Parse the label, and then use tail recursion to parse
9528 the statement. */
9545 {
9550 }
9551 else
9565 {
9570 }
9571 else
9572 {
9576 }
9580 /* Objective-C++ exception-handling constructs. */
9594 /* This must be a namespace alias definition. */
9607 /* It might be a keyword like `int' that can start a
9608 declaration-statement. */
9610 }
9611 }
9613 {
9614 /* If the next token is a `:', then we are looking at a
9615 labeled-statement. */
9618 {
9619 /* Looks like a labeled-statement with an ordinary label.
9620 Parse the label, and then use tail recursion to parse
9621 the statement. */
9625 }
9626 }
9627 /* Anything that starts with a `{' must be a compound-statement. */
9630 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9631 a statement all its own. */
9633 {
9634 /* Only certain OpenMP pragmas are attached to statements, and thus
9635 are considered statements themselves. All others are not. In
9636 the context of a compound, accept the pragma as a "statement" and
9637 return so that we can check for a close brace. Otherwise we
9638 require a real statement and must go back and read one. */
9644 }
9646 {
9649 }
9651 /* Everything else must be a declaration-statement or an
9652 expression-statement. Try for the declaration-statement
9653 first, unless we are looking at a `;', in which case we know that
9654 we have an expression-statement. */
9656 {
9658 {
9660 {
9661 /* Attributes should be parsed as part of the the
9662 declaration, so let's un-parse them. */
9665 }
9668 /* Try to parse the declaration-statement. */
9670 /* If that worked, we're done. */
9673 }
9674 /* Look for an expression-statement instead. */
9676 }
9678 /* Set the line number for the statement. */
9682 /* Note that for now, we don't do anything with c++11 statements
9683 parsed at this level. */
9686 OPT_Wattributes,
9688 }
9690 /* Parse the label for a labeled-statement, i.e.
9692 identifier :
9693 case constant-expression :
9694 default :
9696 GNU Extension:
9697 case constant-expression ... constant-expression : statement
9699 When a label is parsed without errors, the label is added to the
9700 parse tree by the finish_* functions, so this function doesn't
9701 have to return the label. */
9703 static void
9705 {
9710 /* The next token should be an identifier. */
9714 {
9717 }
9721 {
9723 {
9727 /* Consume the `case' token. */
9729 /* Parse the constant-expression. */
9732 NULL);
9736 {
9737 /* Consume the `...' token. */
9739 expr_hi =
9742 NULL);
9743 /* We don't need to emit warnings here, as the common code
9744 will do this for us. */
9745 }
9746 else
9751 else
9754 expr);
9755 }
9759 /* Consume the `default' token. */
9764 else
9769 /* Anything else must be an ordinary label. */
9772 }
9774 /* Require the `:' token. */
9777 /* An ordinary label may optionally be followed by attributes.
9778 However, this is only permitted if the attributes are then
9779 followed by a semicolon. This is because, for backward
9780 compatibility, when parsing
9781 lab: __attribute__ ((unused)) int i;
9782 we want the attribute to attach to "i", not "lab". */
9785 {
9786 tree attrs;
9793 ;
9794 else
9796 }
9802 }
9804 /* Parse an expression-statement.
9806 expression-statement:
9807 expression [opt] ;
9809 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9810 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9811 indicates whether this expression-statement is part of an
9812 expression statement. */
9814 static tree
9816 {
9820 /* If the next token is a ';', then there is no expression
9821 statement. */
9823 {
9827 {
9830 }
9831 }
9833 /* Give a helpful message for "A<T>::type t;" and the like. */
9836 {
9843 {
9844 /* A::A a; */
9849 }
9850 }
9852 /* Consume the final `;'. */
9857 /* This is the final expression statement of a statement
9858 expression. */
9864 }
9866 /* Parse a compound-statement.
9868 compound-statement:
9869 { statement-seq [opt] }
9871 GNU extension:
9873 compound-statement:
9874 { label-declaration-seq [opt] statement-seq [opt] }
9876 label-declaration-seq:
9877 label-declaration
9878 label-declaration-seq label-declaration
9880 Returns a tree representing the statement. */
9882 static tree
9885 {
9886 tree compound_stmt;
9888 /* Consume the `{'. */
9895 /* Begin the compound-statement. */
9897 /* If the next keyword is `__label__' we have a label declaration. */
9900 /* Parse an (optional) statement-seq. */
9902 /* Finish the compound-statement. */
9904 /* Consume the `}'. */
9908 }
9910 /* Parse an (optional) statement-seq.
9912 statement-seq:
9913 statement
9914 statement-seq [opt] statement */
9916 static void
9918 {
9919 /* Scan statements until there aren't any more. */
9921 {
9924 /* If we are looking at a `}', then we have run out of
9925 statements; the same is true if we have reached the end
9926 of file, or have stumbled upon a stray '@end'. */
9933 /* If we are in a compound statement and find 'else' then
9934 something went wrong. */
9936 {
9939 else
9940 {
9943 }
9944 }
9946 /* Parse the statement. */
9948 }
9949 }
9951 /* Parse a selection-statement.
9953 selection-statement:
9954 if ( condition ) statement
9955 if ( condition ) statement else statement
9956 switch ( condition ) statement
9958 Returns the new IF_STMT or SWITCH_STMT.
9960 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9961 is a (possibly labeled) if statement which is not enclosed in
9962 braces and has an else clause. This is used to implement
9963 -Wparentheses. */
9965 static tree
9967 {
9974 /* Peek at the next token. */
9977 /* See what kind of keyword it is. */
9980 {
9983 {
9984 tree statement;
9985 tree condition;
9987 /* Look for the `('. */
9989 {
9992 }
9994 /* Begin the selection-statement. */
9997 else
10000 /* Parse the condition. */
10002 /* Look for the `)'. */
10008 {
10012 /* Add the condition. */
10015 /* Parse the then-clause. */
10019 {
10027 }
10028 else
10034 /* If the next token is `else', parse the else-clause. */
10036 RID_ELSE))
10037 {
10038 /* Consume the `else' keyword. */
10041 /* Parse the else-clause. */
10043 {
10044 location_t loc;
10051 }
10052 else
10057 /* If we are currently parsing a then-clause, then
10058 IF_P will not be NULL. We set it to true to
10059 indicate that this if statement has an else clause.
10060 This may trigger the Wparentheses warning below
10061 when we get back up to the parent if statement. */
10064 }
10065 else
10066 {
10067 /* This if statement does not have an else clause. If
10068 NESTED_IF is true, then the then-clause is an if
10069 statement which does have an else clause. We warn
10070 about the potential ambiguity. */
10073 "suggest explicit braces to avoid ambiguous"
10075 }
10077 /* Now we're all done with the if-statement. */
10079 }
10080 else
10081 {
10085 /* Add the condition. */
10088 /* Parse the body of the switch-statement. */
10097 /* Now we're all done with the switch-statement. */
10099 }
10102 }
10108 }
10109 }
10111 /* Parse a condition.
10113 condition:
10114 expression
10115 type-specifier-seq declarator = initializer-clause
10116 type-specifier-seq declarator braced-init-list
10118 GNU Extension:
10120 condition:
10121 type-specifier-seq declarator asm-specification [opt]
10122 attributes [opt] = assignment-expression
10124 Returns the expression that should be tested. */
10126 static tree
10128 {
10129 cp_decl_specifier_seq type_specifiers;
10133 /* Try the declaration first. */
10135 /* New types are not allowed in the type-specifier-seq for a
10136 condition. */
10138 parser->type_definition_forbidden_message
10140 /* Parse the type-specifier-seq. */
10142 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10145 /* Restore the saved message. */
10147 /* If all is well, we might be looking at a declaration. */
10149 {
10150 tree decl;
10151 tree asm_specification;
10152 tree attributes;
10156 /* Parse the declarator. */
10162 /* Parse the attributes. */
10164 /* Parse the asm-specification. */
10166 /* If the next token is not an `=' or '{', then we might still be
10167 looking at an expression. For example:
10169 if (A(a).x)
10171 looks like a decl-specifier-seq and a declarator -- but then
10172 there is no `=', so this is an expression. */
10177 /* If we did see an `=' or '{', then we are looking at a declaration
10178 for sure. */
10180 {
10181 tree pushed_scope;
10185 /* Create the declaration. */
10191 /* Parse the initializer. */
10193 {
10197 }
10198 else
10199 {
10200 /* Consume the `='. */
10203 }
10207 /* Process the initializer. */
10210 asm_specification,
10211 flags);
10217 }
10218 }
10219 /* If we didn't even get past the declarator successfully, we are
10220 definitely not looking at a declaration. */
10221 else
10224 /* Otherwise, we are looking at an expression. */
10226 }
10228 /* Parses a for-statement or range-for-statement until the closing ')',
10229 not included. */
10231 static tree
10233 {
10237 /* Begin the for-statement. */
10240 /* Parse the initialization. */
10245 else
10247 }
10249 static tree
10251 {
10252 /* Normal for loop */
10255 tree stmt;
10258 /* The for-init-statement has already been parsed in
10259 cp_parser_for_init_statement, so no work is needed here. */
10262 /* If there's a condition, process it. */
10266 {
10270 }
10272 /* Look for the `;'. */
10275 /* If there's an expression, process it. */
10281 }
10283 /* Tries to parse a range-based for-statement:
10285 range-based-for:
10286 decl-specifier-seq declarator : expression
10288 The decl-specifier-seq declarator and the `:' are already parsed by
10289 cp_parser_for_init_statement. If processing_template_decl it returns a
10290 newly created RANGE_FOR_STMT; if not, it is converted to a
10291 regular FOR_STMT. */
10293 static tree
10296 {
10300 {
10303 }
10304 else
10307 /* If in template, STMT is converted to a normal for-statement
10308 at instantiation. If not, it is done just ahead. */
10310 {
10318 /* do_auto_deduction doesn't mess with template init-lists. */
10321 }
10322 else
10323 {
10326 }
10328 }
10330 /* Subroutine of cp_convert_range_for: given the initializer expression,
10331 builds up the range temporary. */
10333 static tree
10335 {
10338 /* Find out the type deduced by the declaration
10339 `auto &&__range = range_expr'. */
10344 /* Create the __range variable. */
10351 }
10353 /* Used by cp_parser_range_for in template context: we aren't going to
10354 do a full conversion yet, but we still need to resolve auto in the
10355 type of the for-range-declaration if present. This is basically
10356 a shortcut version of cp_convert_range_for. */
10358 static void
10360 {
10363 {
10366 iter_type = (cp_parser_perform_range_for_lookup
10369 {
10371 iter_type);
10373 tf_warning_or_error);
10376 }
10377 }
10378 }
10380 /* Converts a range-based for-statement into a normal
10381 for-statement, as per the definition.
10383 for (RANGE_DECL : RANGE_EXPR)
10384 BLOCK
10386 should be equivalent to:
10388 {
10389 auto &&__range = RANGE_EXPR;
10390 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10391 __begin != __end;
10392 ++__begin)
10393 {
10394 RANGE_DECL = *__begin;
10395 BLOCK
10396 }
10397 }
10399 If RANGE_EXPR is an array:
10400 BEGIN_EXPR = __range
10401 END_EXPR = __range + ARRAY_SIZE(__range)
10402 Else if RANGE_EXPR has a member 'begin' or 'end':
10403 BEGIN_EXPR = __range.begin()
10404 END_EXPR = __range.end()
10405 Else:
10406 BEGIN_EXPR = begin(__range)
10407 END_EXPR = end(__range);
10409 If __range has a member 'begin' but not 'end', or vice versa, we must
10410 still use the second alternative (it will surely fail, however).
10411 When calling begin()/end() in the third alternative we must use
10412 argument dependent lookup, but always considering 'std' as an associated
10413 namespace. */
10415 tree
10418 {
10424 /* If an error happened previously do nothing or else a lot of
10425 unhelpful errors would be issued. */
10427 else
10428 {
10429 tree range_temp;
10433 /* Can't bind a reference to an array of runtime bound. */
10435 else
10436 {
10441 LOOKUP_ONLYCONVERTING);
10443 }
10446 }
10448 /* The new for initialization statement. */
10456 LOOKUP_ONLYCONVERTING);
10465 LOOKUP_ONLYCONVERTING);
10469 /* The new for condition. */
10476 /* The new increment expression. */
10479 tf_warning_or_error);
10482 /* The declaration is initialized with *__begin inside the loop body. */
10485 tf_warning_or_error),
10487 LOOKUP_ONLYCONVERTING);
10490 }
10492 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10493 We need to solve both at the same time because the method used
10494 depends on the existence of members begin or end.
10495 Returns the type deduced for the iterator expression. */
10497 static tree
10499 {
10501 {
10504 }
10507 {
10512 }
10514 {
10515 /* If RANGE is an array, we will use pointer arithmetic. */
10518 range,
10522 }
10523 else
10524 {
10525 /* If it is not an array, we must do a bit of magic. */
10535 tf_warning_or_error);
10538 tf_warning_or_error);
10541 {
10542 /* Use the member functions. */
10545 else
10551 else
10554 }
10555 else
10556 {
10557 /* Use global functions with ADL. */
10564 tf_warning_or_error);
10566 tf_warning_or_error);
10568 tf_warning_or_error);
10570 tf_warning_or_error);
10573 }
10575 /* Last common checks. */
10577 {
10578 /* If one of the expressions is an error do no more checks. */
10581 }
10584 /* Can happen, when, eg, in a template context, Koenig lookup
10585 can't resolve begin/end (c++/58503). */
10587 else
10588 {
10590 /* The unqualified type of the __begin and __end temporaries should
10591 be the same, as required by the multiple auto declaration. */
10597 }
10598 }
10599 }
10601 /* Helper function for cp_parser_perform_range_for_lookup.
10602 Builds a tree for RANGE.IDENTIFIER(). */
10604 static tree
10606 {
10619 tf_warning_or_error);
10622 }
10624 /* Parse an iteration-statement.
10626 iteration-statement:
10627 while ( condition ) statement
10628 do statement while ( expression ) ;
10629 for ( for-init-statement condition [opt] ; expression [opt] )
10630 statement
10632 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10634 static tree
10636 {
10639 tree statement;
10642 /* Peek at the next token. */
10647 /* Remember whether or not we are already within an iteration
10648 statement. */
10651 /* See what kind of keyword it is. */
10654 {
10656 {
10657 tree condition;
10659 /* Begin the while-statement. */
10661 /* Look for the `('. */
10663 /* Parse the condition. */
10666 /* Look for the `)'. */
10668 /* Parse the dependent statement. */
10672 /* We're done with the while-statement. */
10674 }
10678 {
10679 tree expression;
10681 /* Begin the do-statement. */
10683 /* Parse the body of the do-statement. */
10688 /* Look for the `while' keyword. */
10690 /* Look for the `('. */
10692 /* Parse the expression. */
10694 /* We're done with the do-statement. */
10696 /* Look for the `)'. */
10698 /* Look for the `;'. */
10700 }
10704 {
10705 /* Look for the `('. */
10710 /* Look for the `)'. */
10713 /* Parse the body of the for-statement. */
10718 /* We're done with the for-statement. */
10720 }
10727 }
10730 }
10732 /* Parse a for-init-statement or the declarator of a range-based-for.
10733 Returns true if a range-based-for declaration is seen.
10735 for-init-statement:
10736 expression-statement
10737 simple-declaration */
10739 static bool
10741 {
10742 /* If the next token is a `;', then we have an empty
10743 expression-statement. Grammatically, this is also a
10744 simple-declaration, but an invalid one, because it does not
10745 declare anything. Therefore, if we did not handle this case
10746 specially, we would issue an error message about an invalid
10747 declaration. */
10749 {
10755 {
10756 /* N3994 -- for (id : init) ... */
10759 "type-specifier only available with "
10767 }
10769 /* A colon is used in range-based for. */
10772 /* We're going to speculatively look for a declaration, falling back
10773 to an expression, if necessary. */
10775 /* Parse the declaration. */
10778 decl);
10781 {
10782 /* It is a range-for, consume the ':' */
10786 {
10788 "range-based %<for%> loops only available with "
10791 }
10792 }
10793 else
10794 /* The ';' is not consumed yet because we told
10795 cp_parser_simple_declaration not to. */
10800 /* If the tentative parse failed, then we shall need to look for an
10801 expression-statement. */
10802 }
10803 /* If we are here, it is an expression-statement. */
10806 }
10808 /* Parse a jump-statement.
10810 jump-statement:
10811 break ;
10812 continue ;
10813 return expression [opt] ;
10814 return braced-init-list ;
10815 goto identifier ;
10817 GNU extension:
10819 jump-statement:
10820 goto * expression ;
10822 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10824 static tree
10826 {
10832 /* Peek at the next token. */
10837 /* See what kind of keyword it is. */
10840 {
10844 {
10864 }
10870 {
10877 /* Fall through. */
10887 }
10892 {
10893 tree expr;
10897 {
10901 }
10904 else
10905 /* If the next token is a `;', then there is no
10906 expression. */
10908 /* Build the return-statement. */
10910 /* Look for the final `;'. */
10912 }
10916 /* Create the goto-statement. */
10918 {
10919 /* Issue a warning about this use of a GNU extension. */
10921 /* Consume the '*' token. */
10923 /* Parse the dependent expression. */
10925 }
10926 else
10928 /* Look for the final `;'. */
10935 }
10938 }
10940 /* Parse a declaration-statement.
10942 declaration-statement:
10943 block-declaration */
10945 static void
10947 {
10950 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10953 /* Parse the block-declaration. */
10956 /* Free any declarators allocated. */
10958 }
10960 /* Some dependent statements (like `if (cond) statement'), are
10961 implicitly in their own scope. In other words, if the statement is
10962 a single statement (as opposed to a compound-statement), it is
10963 none-the-less treated as if it were enclosed in braces. Any
10964 declarations appearing in the dependent statement are out of scope
10965 after control passes that point. This function parses a statement,
10966 but ensures that is in its own scope, even if it is not a
10967 compound-statement.
10969 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10970 is a (possibly labeled) if statement which is not enclosed in
10971 braces and has an else clause. This is used to implement
10972 -Wparentheses.
10974 Returns the new statement. */
10976 static tree
10978 {
10979 tree statement;
10984 /* Mark if () ; with a special NOP_EXPR. */
10986 {
10990 }
10991 /* if a compound is opened, we simply parse the statement directly. */
10994 /* If the token is not a `{', then we must take special action. */
10995 else
10996 {
10997 /* Create a compound-statement. */
10999 /* Parse the dependent-statement. */
11001 /* Finish the dummy compound-statement. */
11003 }
11005 /* Return the statement. */
11007 }
11009 /* For some dependent statements (like `while (cond) statement'), we
11010 have already created a scope. Therefore, even if the dependent
11011 statement is a compound-statement, we do not want to create another
11012 scope. */
11014 static void
11016 {
11017 /* If the token is a `{', then we must take special action. */
11020 else
11021 {
11022 /* Avoid calling cp_parser_compound_statement, so that we
11023 don't create a new scope. Do everything else by hand. */
11025 /* If the next keyword is `__label__' we have a label declaration. */
11028 /* Parse an (optional) statement-seq. */
11031 }
11032 }
11034 /* Declarations [gram.dcl.dcl] */
11036 /* Parse an optional declaration-sequence.
11038 declaration-seq:
11039 declaration
11040 declaration-seq declaration */
11042 static void
11044 {
11046 {
11057 {
11058 /* A declaration consisting of a single semicolon is
11059 invalid. Allow it unless we're being pedantic. */
11064 }
11066 /* If we're entering or exiting a region that's implicitly
11067 extern "C", modify the lang context appropriately. */
11069 {
11072 }
11074 {
11077 }
11080 {
11081 /* A top-level declaration can consist solely of a #pragma.
11082 A nested declaration cannot, so this is done here and not
11083 in cp_parser_declaration. (A #pragma at block scope is
11084 handled in cp_parser_statement.) */
11087 }
11089 /* Parse the declaration itself. */
11091 }
11092 }
11094 /* Parse a declaration.
11096 declaration:
11097 block-declaration
11098 function-definition
11099 template-declaration
11100 explicit-instantiation
11101 explicit-specialization
11102 linkage-specification
11103 namespace-definition
11105 GNU extension:
11107 declaration:
11108 __extension__ declaration */
11110 static void
11112 {
11113 cp_token token1;
11114 cp_token token2;
11119 /* Check for the `__extension__' keyword. */
11121 {
11122 /* Parse the qualified declaration. */
11124 /* Restore the PEDANTIC flag. */
11128 }
11130 /* Try to figure out what kind of declaration is present. */
11135 else
11136 {
11139 }
11141 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11144 /* If the next token is `extern' and the following token is a string
11145 literal, then we have a linkage specification. */
11149 /* If the next token is `template', then we have either a template
11150 declaration, an explicit instantiation, or an explicit
11151 specialization. */
11153 {
11154 /* `template <>' indicates a template specialization. */
11158 /* `template <' indicates a template declaration. */
11161 /* Anything else must be an explicit instantiation. */
11162 else
11164 }
11165 /* If the next token is `export', then we have a template
11166 declaration. */
11169 /* If the next token is `extern', 'static' or 'inline' and the one
11170 after that is `template', we have a GNU extended explicit
11171 instantiation directive. */
11178 /* If the next token is `namespace', check for a named or unnamed
11179 namespace definition. */
11185 /* An unnamed namespace definition. */
11189 /* An inline (associated) namespace definition. */
11193 /* Objective-C++ declaration/definition. */
11200 /* We must have either a block declaration or a function
11201 definition. */
11202 else
11203 /* Try to parse a block-declaration, or a function-definition. */
11206 /* Free any declarators allocated. */
11208 }
11210 /* Parse a block-declaration.
11212 block-declaration:
11213 simple-declaration
11214 asm-definition
11215 namespace-alias-definition
11216 using-declaration
11217 using-directive
11219 GNU Extension:
11221 block-declaration:
11222 __extension__ block-declaration
11224 C++0x Extension:
11226 block-declaration:
11227 static_assert-declaration
11229 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11230 part of a declaration-statement. */
11232 static void
11235 {
11239 /* Check for the `__extension__' keyword. */
11241 {
11242 /* Parse the qualified declaration. */
11244 /* Restore the PEDANTIC flag. */
11248 }
11250 /* Peek at the next token to figure out which kind of declaration is
11251 present. */
11254 /* If the next keyword is `asm', we have an asm-definition. */
11256 {
11260 }
11261 /* If the next keyword is `namespace', we have a
11262 namespace-alias-definition. */
11265 /* If the next keyword is `using', we have a
11266 using-declaration, a using-directive, or an alias-declaration. */
11268 {
11273 /* If the token after `using' is `namespace', then we have a
11274 using-directive. */
11278 /* If the second token after 'using' is '=', then we have an
11279 alias-declaration. */
11285 /* Otherwise, it's a using-declaration. */
11286 else
11289 }
11290 /* If the next keyword is `__label__' we have a misplaced label
11291 declaration. */
11293 {
11297 /* If the next token is now a `;', consume it. */
11300 }
11301 /* If the next token is `static_assert' we have a static assertion. */
11304 /* Anything else must be a simple-declaration. */
11305 else
11308 }
11310 /* Parse a simple-declaration.
11312 simple-declaration:
11313 decl-specifier-seq [opt] init-declarator-list [opt] ;
11315 init-declarator-list:
11316 init-declarator
11317 init-declarator-list , init-declarator
11319 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11320 function-definition as a simple-declaration.
11322 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11323 parsed declaration if it is an uninitialized single declarator not followed
11324 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11325 if present, will not be consumed. */
11327 static void
11331 {
11332 cp_decl_specifier_seq decl_specifiers;
11339 /* Defer access checks until we know what is being declared; the
11340 checks for names appearing in the decl-specifier-seq should be
11341 done as if we were in the scope of the thing being declared. */
11344 /* Parse the decl-specifier-seq. We have to keep track of whether
11345 or not the decl-specifier-seq declares a named class or
11346 enumeration type, since that is the only case in which the
11347 init-declarator-list is allowed to be empty.
11349 [dcl.dcl]
11351 In a simple-declaration, the optional init-declarator-list can be
11352 omitted only when declaring a class or enumeration, that is when
11353 the decl-specifier-seq contains either a class-specifier, an
11354 elaborated-type-specifier, or an enum-specifier. */
11356 CP_PARSER_FLAGS_OPTIONAL,
11359 /* We no longer need to defer access checks. */
11362 /* In a block scope, a valid declaration must always have a
11363 decl-specifier-seq. By not trying to parse declarators, we can
11364 resolve the declaration/expression ambiguity more quickly. */
11367 {
11370 }
11372 /* If the next two tokens are both identifiers, the code is
11373 erroneous. The usual cause of this situation is code like:
11375 T t;
11377 where "T" should name a type -- but does not. */
11380 {
11381 /* If parsing tentatively, we should commit; we really are
11382 looking at a declaration. */
11384 /* Give up. */
11386 }
11388 /* If we have seen at least one decl-specifier, and the next token
11389 is not a parenthesis, then we must be looking at a declaration.
11390 (After "int (" we might be looking at a functional cast.) */
11397 /* Keep going until we hit the `;' at the end of the simple
11398 declaration. */
11401 CPP_SEMICOLON))
11402 {
11405 tree decl;
11408 {
11409 /* If we are processing next declarator, coma is expected */
11415 }
11416 else
11419 /* Parse the init-declarator. */
11422 function_definition_allowed_p,
11424 declares_class_or_enum,
11426 maybe_range_for_decl);
11427 /* If an error occurred while parsing tentatively, exit quickly.
11428 (That usually happens when in the body of a function; each
11429 statement is treated as a declaration-statement until proven
11430 otherwise.) */
11433 /* Handle function definitions specially. */
11435 {
11436 /* If the next token is a `,', then we are probably
11437 processing something like:
11439 void f() {}, *p;
11441 which is erroneous. */
11443 {
11446 "mixing"
11448 }
11449 /* Otherwise, we're done with the list of declarators. */
11450 else
11451 {
11454 }
11455 }
11458 /* The next token should be either a `,' or a `;'. */
11460 /* If it's a `,', there are more declarators to come. */
11463 /* If it's a `;', we are done. */
11466 /* Anything else is an error. */
11467 else
11468 {
11469 /* If we have already issued an error message we don't need
11470 to issue another one. */
11474 /* Skip tokens until we reach the end of the statement. */
11476 /* If the next token is now a `;', consume it. */
11480 }
11481 /* After the first time around, a function-definition is not
11482 allowed -- even if it was OK at first. For example:
11484 int i, f() {}
11486 is not valid. */
11488 }
11490 /* Issue an error message if no declarators are present, and the
11491 decl-specifier-seq does not itself declare a class or
11492 enumeration: [dcl.dcl]/3. */
11494 {
11496 {
11500 /* Ensure an error is issued anyway when finish_decltype_type,
11501 called via cp_parser_decl_specifier_seq, returns a class or
11502 an enumeration (c++/51786). */
11505 }
11506 /* Perform any deferred access checks. */
11508 }
11510 /* Consume the `;'. */
11514 done:
11516 }
11518 /* Parse a decl-specifier-seq.
11520 decl-specifier-seq:
11521 decl-specifier-seq [opt] decl-specifier
11522 decl-specifier attribute-specifier-seq [opt] (C++11)
11524 decl-specifier:
11525 storage-class-specifier
11526 type-specifier
11527 function-specifier
11528 friend
11529 typedef
11531 GNU Extension:
11533 decl-specifier:
11534 attributes
11536 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11538 The parser flags FLAGS is used to control type-specifier parsing.
11540 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11541 flags:
11543 1: one of the decl-specifiers is an elaborated-type-specifier
11544 (i.e., a type declaration)
11545 2: one of the decl-specifiers is an enum-specifier or a
11546 class-specifier (i.e., a type definition)
11548 */
11550 static void
11552 cp_parser_flags flags,
11555 {
11559 cp_decl_spec ds;
11561 /* Clear DECL_SPECS. */
11564 /* Assume no class or enumeration type is declared. */
11567 /* Keep reading specifiers until there are no more to read. */
11569 {
11574 /* Peek at the next token. */
11577 /* Save the first token of the decl spec list for error
11578 reporting. */
11581 /* Handle attributes. */
11583 {
11584 /* Parse the attributes. */
11587 /* In a sequence of declaration specifiers, c++11 attributes
11588 appertain to the type that precede them. In that case
11589 [dcl.spec]/1 says:
11591 The attribute-specifier-seq affects the type only for
11592 the declaration it appears in, not other declarations
11593 involving the same type.
11595 But for now let's force the user to position the
11596 attribute either at the beginning of the declaration or
11597 after the declarator-id, which would clearly mean that it
11598 applies to the declarator. */
11600 {
11602 /* The c++11 attribute is at the beginning of the
11603 declaration. It appertains to the entity being
11605 else
11606 {
11608 {
11609 /* This is an attribute following a
11610 class-specifier. */
11615 }
11616 else
11617 {
11618 decl_specs->std_attributes
11620 attrs);
11623 }
11625 }
11626 }
11628 decl_specs->attributes
11630 attrs);
11634 }
11635 /* Assume we will find a decl-specifier keyword. */
11637 /* If the next token is an appropriate keyword, we can simply
11638 add it to the list. */
11640 {
11641 /* decl-specifier:
11642 friend
11643 constexpr */
11646 {
11649 }
11650 else
11651 {
11653 /* Consume the token. */
11655 }
11663 /* function-specifier:
11664 inline
11665 virtual
11666 explicit */
11673 /* decl-specifier:
11674 typedef */
11677 /* Consume the token. */
11679 /* A constructor declarator cannot appear in a typedef. */
11681 /* The "typedef" keyword can only occur in a declaration; we
11682 may as well commit at this point. */
11689 /* storage-class-specifier:
11690 auto
11691 register
11692 static
11693 extern
11694 mutable
11696 GNU Extension:
11697 thread */
11700 {
11701 /* Consume the token. */
11704 /* Complain about `auto' as a storage specifier, if
11705 we're complaining about C++0x compatibility. */
11709 /* Set the storage class anyway. */
11711 token);
11712 }
11713 else
11714 /* C++0x auto type-specifier. */
11722 /* Consume the token. */
11725 token);
11728 /* Consume the token. */
11734 /* We did not yet find a decl-specifier yet. */
11737 }
11747 /* Constructors are a special case. The `S' in `S()' is not a
11748 decl-specifier; it is the beginning of the declarator. */
11749 constructor_p
11750 = (!found_decl_spec
11751 && constructor_possible_p
11752 && (cp_parser_constructor_declarator_p
11755 /* If we don't have a DECL_SPEC yet, then we must be looking at
11756 a type-specifier. */
11758 {
11761 tree type_spec;
11763 type_spec
11765 decl_specs,
11771 /* If this type-specifier referenced a user-defined type
11772 (a typedef, class-name, etc.), then we can't allow any
11773 more such type-specifiers henceforth.
11775 [dcl.spec]
11777 The longest sequence of decl-specifiers that could
11778 possibly be a type name is taken as the
11779 decl-specifier-seq of a declaration. The sequence shall
11780 be self-consistent as described below.
11782 [dcl.type]
11784 As a general rule, at most one type-specifier is allowed
11785 in the complete decl-specifier-seq of a declaration. The
11786 only exceptions are the following:
11788 -- const or volatile can be combined with any other
11789 type-specifier.
11791 -- signed or unsigned can be combined with char, long,
11792 short, or int.
11794 -- ..
11796 Example:
11798 typedef char* Pc;
11799 void g (const int Pc);
11801 Here, Pc is *not* part of the decl-specifier seq; it's
11802 the declarator. Therefore, once we see a type-specifier
11803 (other than a cv-qualifier), we forbid any additional
11804 user-defined types. We *do* still allow things like `int
11805 int' to be considered a decl-specifier-seq, and issue the
11806 error message later. */
11809 /* A constructor declarator cannot follow a type-specifier. */
11811 {
11816 }
11817 }
11819 /* If we still do not have a DECL_SPEC, then there are no more
11820 decl-specifiers. */
11825 /* After we see one decl-specifier, further decl-specifiers are
11826 always optional. */
11828 }
11830 /* Don't allow a friend specifier with a class definition. */
11835 }
11837 /* Parse an (optional) storage-class-specifier.
11839 storage-class-specifier:
11840 auto
11841 register
11842 static
11843 extern
11844 mutable
11846 GNU Extension:
11848 storage-class-specifier:
11849 thread
11851 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11853 static tree
11855 {
11857 {
11861 /* Fall through for C++98. */
11868 /* Consume the token. */
11873 }
11874 }
11876 /* Parse an (optional) function-specifier.
11878 function-specifier:
11879 inline
11880 virtual
11881 explicit
11883 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11884 Updates DECL_SPECS, if it is non-NULL. */
11886 static tree
11889 {
11892 {
11898 /* 14.5.2.3 [temp.mem]
11900 A member function template shall not be virtual. */
11903 else
11913 }
11915 /* Consume the token. */
11917 }
11919 /* Parse a linkage-specification.
11921 linkage-specification:
11922 extern string-literal { declaration-seq [opt] }
11923 extern string-literal declaration */
11925 static void
11927 {
11928 tree linkage;
11930 /* Look for the `extern' keyword. */
11933 /* Look for the string-literal. */
11936 /* Transform the literal into an identifier. If the literal is a
11937 wide-character string, or contains embedded NULs, then we can't
11938 handle it as the user wants. */
11941 {
11943 /* Assume C++ linkage. */
11945 }
11946 else
11949 /* We're now using the new linkage. */
11952 /* If the next token is a `{', then we're using the first
11953 production. */
11955 {
11958 /* Consume the `{' token. */
11960 /* Parse the declarations. */
11962 /* Look for the closing `}'. */
11964 }
11965 /* Otherwise, there's just one declaration. */
11966 else
11967 {
11970 saved_in_unbraced_linkage_specification_p
11974 parser->in_unbraced_linkage_specification_p
11976 }
11978 /* We're done with the linkage-specification. */
11980 }
11982 /* Parse a static_assert-declaration.
11984 static_assert-declaration:
11985 static_assert ( constant-expression , string-literal ) ;
11987 If MEMBER_P, this static_assert is a class member. */
11989 static void
11991 {
11992 tree condition;
11993 tree message;
11995 location_t saved_loc;
11998 /* Peek at the `static_assert' token so we can keep track of exactly
11999 where the static assertion started. */
12003 /* Look for the `static_assert' keyword. */
12005 RT_STATIC_ASSERT))
12008 /* We know we are in a static assertion; commit to any tentative
12009 parse. */
12013 /* Parse the `(' starting the static assertion condition. */
12016 /* Parse the constant-expression. Allow a non-constant expression
12017 here in order to give better diagnostics in finish_static_assert. */
12018 condition =
12023 /* Parse the separating `,'. */
12026 /* Parse the string-literal message. */
12031 /* A `)' completes the static assertion. */
12038 /* A semicolon terminates the declaration. */
12041 /* Complete the static assertion, which may mean either processing
12042 the static assert now or saving it for template instantiation. */
12044 }
12046 /* Parse the expression in decltype ( expression ). */
12048 static tree
12051 {
12053 tree expr;
12055 /* First, try parsing an id-expression. */
12066 {
12069 cp_id_kind idk;
12073 /* Lookup the name we got back from the id-expression. */
12084 {
12085 /* Complete lookup of the id-expression. */
12086 expr = (finish_id_expression
12099 /* We found an id-expression, but it was something that we
12100 should not have found. This is an error, not something
12101 we can recover from, so note that we found an
12102 id-expression and we'll recover as gracefully as
12103 possible. */
12105 }
12110 /* We have an id-expression. */
12112 }
12115 {
12116 /* Abort the id-expression parse. */
12119 /* Parsing tentatively, again. */
12122 /* Parse a class member access. */
12130 /* We have an id-expression. */
12132 }
12135 /* We have parsed the complete id-expression or member access. */
12137 else
12138 {
12139 /* Abort our attempt to parse an id-expression or member access
12140 expression. */
12143 /* Parse a full expression. */
12146 }
12149 }
12151 /* Parse a `decltype' type. Returns the type.
12153 simple-type-specifier:
12154 decltype ( expression )
12155 C++14 proposal:
12156 decltype ( auto ) */
12158 static tree
12160 {
12161 tree expr;
12170 {
12171 /* Already parsed. */
12174 }
12176 /* Look for the `decltype' token. */
12180 /* Parse the opening `('. */
12184 /* decltype (auto) */
12187 {
12194 }
12196 /* Types cannot be defined in a `decltype' expression. Save away the
12197 old message. */
12200 /* And create the new one. */
12201 parser->type_definition_forbidden_message
12204 /* The restrictions on constant-expressions do not apply inside
12205 decltype expressions. */
12206 saved_integral_constant_expression_p
12208 saved_non_integral_constant_expression_p
12212 /* Within a parenthesized expression, a `>' token is always
12213 the greater-than operator. */
12214 saved_greater_than_is_operator_p
12218 /* Do not actually evaluate the expression. */
12221 /* Do not warn about problems with the expression. */
12226 /* Go back to evaluating expressions. */
12230 /* The `>' token might be the end of a template-id or
12231 template-parameter-list now. */
12232 parser->greater_than_is_operator_p
12235 /* Restore the old message and the integral constant expression
12236 flags. */
12238 parser->integral_constant_expression_p
12240 parser->non_integral_constant_expression_p
12243 /* Parse to the closing `)'. */
12245 {
12249 }
12252 tf_warning_or_error);
12254 rewrite:
12255 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12256 it again. */
12263 }
12265 /* Special member functions [gram.special] */
12267 /* Parse a conversion-function-id.
12269 conversion-function-id:
12270 operator conversion-type-id
12272 Returns an IDENTIFIER_NODE representing the operator. */
12274 static tree
12276 {
12277 tree type;
12278 tree saved_scope;
12279 tree saved_qualifying_scope;
12280 tree saved_object_scope;
12283 /* Look for the `operator' token. */
12286 /* When we parse the conversion-type-id, the current scope will be
12287 reset. However, we need that information in able to look up the
12288 conversion function later, so we save it here. */
12292 /* We must enter the scope of the class so that the names of
12293 entities declared within the class are available in the
12294 conversion-type-id. For example, consider:
12296 struct S {
12297 typedef int I;
12298 operator I();
12299 };
12301 S::operator I() { ... }
12303 In order to see that `I' is a type-name in the definition, we
12304 must be in the scope of `S'. */
12307 /* Parse the conversion-type-id. */
12309 /* Leave the scope of the class, if any. */
12312 /* Restore the saved scope. */
12316 /* If the TYPE is invalid, indicate failure. */
12320 }
12322 /* Parse a conversion-type-id:
12324 conversion-type-id:
12325 type-specifier-seq conversion-declarator [opt]
12327 Returns the TYPE specified. */
12329 static tree
12331 {
12332 tree attributes;
12333 cp_decl_specifier_seq type_specifiers;
12335 tree type_specified;
12338 /* Parse the attributes. */
12342 parser->type_definition_forbidden_message
12345 /* Parse the type-specifiers. */
12352 /* If that didn't work, stop. */
12355 /* Parse the conversion-declarator. */
12363 /* Don't give this error when parsing tentatively. This happens to
12364 work because we always parse this definitively once. */
12367 {
12369 {
12372 }
12376 }
12379 }
12381 /* Parse an (optional) conversion-declarator.
12383 conversion-declarator:
12384 ptr-operator conversion-declarator [opt]
12386 */
12390 {
12393 cp_cv_quals cv_quals;
12395 /* We don't know if there's a ptr-operator next, or not. */
12397 /* Try the ptr-operator. */
12400 /* If it worked, look for more conversion-declarators. */
12402 {
12405 /* Parse another optional declarator. */
12408 declarator = cp_parser_make_indirect_declarator
12412 }
12415 }
12417 /* Parse an (optional) ctor-initializer.
12419 ctor-initializer:
12420 : mem-initializer-list
12422 Returns TRUE iff the ctor-initializer was actually present. */
12424 static bool
12426 {
12427 /* If the next token is not a `:', then there is no
12428 ctor-initializer. */
12430 {
12431 /* Do default initialization of any bases and members. */
12436 }
12438 /* Consume the `:' token. */
12440 /* And the mem-initializer-list. */
12444 }
12446 /* Parse a mem-initializer-list.
12448 mem-initializer-list:
12449 mem-initializer ... [opt]
12450 mem-initializer ... [opt] , mem-initializer-list */
12452 static void
12454 {
12459 /* Let the semantic analysis code know that we are starting the
12460 mem-initializer-list. */
12465 /* Loop through the list. */
12467 {
12468 tree mem_initializer;
12471 /* Parse the mem-initializer. */
12473 /* If the next token is a `...', we're expanding member initializers. */
12475 {
12476 /* Consume the `...'. */
12479 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12480 can be expanded but members cannot. */
12483 {
12488 }
12490 /* Construct the pack expansion type. */
12493 }
12496 {
12500 }
12501 /* Look for a target constructor. */
12505 {
12508 {
12512 }
12514 }
12515 /* Add it to the list, unless it was erroneous. */
12517 {
12520 }
12521 /* If the next token is not a `,', we're done. */
12524 /* Consume the `,' token. */
12526 }
12528 /* Perform semantic analysis. */
12531 }
12533 /* Parse a mem-initializer.
12535 mem-initializer:
12536 mem-initializer-id ( expression-list [opt] )
12537 mem-initializer-id braced-init-list
12539 GNU extension:
12541 mem-initializer:
12542 ( expression-list [opt] )
12544 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12545 class) or FIELD_DECL (for a non-static data member) to initialize;
12546 the TREE_VALUE is the expression-list. An empty initialization
12547 list is represented by void_list_node. */
12549 static tree
12551 {
12552 tree mem_initializer_id;
12553 tree expression_list;
12554 tree member;
12557 /* Find out what is being initialized. */
12559 {
12563 }
12564 else
12565 {
12569 }
12575 {
12582 }
12583 else
12584 {
12594 }
12604 }
12606 /* Parse a mem-initializer-id.
12608 mem-initializer-id:
12609 :: [opt] nested-name-specifier [opt] class-name
12610 identifier
12612 Returns a TYPE indicating the class to be initializer for the first
12613 production. Returns an IDENTIFIER_NODE indicating the data member
12614 to be initialized for the second production. */
12616 static tree
12618 {
12622 tree id;
12626 /* `typename' is not allowed in this context ([temp.res]). */
12628 {
12630 "keyword %<typename%> not allowed in this context (a qualified "
12633 }
12634 /* Look for the optional `::' operator. */
12635 global_scope_p
12639 /* Look for the optional nested-name-specifier. The simplest way to
12640 implement:
12642 [temp.res]
12644 The keyword `typename' is not permitted in a base-specifier or
12645 mem-initializer; in these contexts a qualified name that
12646 depends on a template-parameter is implicitly assumed to be a
12647 type name.
12649 is to assume that we have seen the `typename' keyword at this
12650 point. */
12651 nested_name_specifier_p
12660 /* If there is a `::' operator or a nested-name-specifier, then we
12661 are definitely looking for a class-name. */
12666 typename_type,
12670 /* Otherwise, we could also be looking for an ordinary identifier. */
12672 /* Try a class-name. */
12676 none_type,
12680 /* If we found one, we're done. */
12683 /* Otherwise, look for an ordinary identifier. */
12685 }
12687 /* Overloading [gram.over] */
12689 /* Parse an operator-function-id.
12691 operator-function-id:
12692 operator operator
12694 Returns an IDENTIFIER_NODE for the operator which is a
12695 human-readable spelling of the identifier, e.g., `operator +'. */
12697 static tree
12699 {
12700 /* Look for the `operator' keyword. */
12703 /* And then the name of the operator itself. */
12705 }
12707 /* Return an identifier node for a user-defined literal operator.
12708 The suffix identifier is chained to the operator name identifier. */
12710 static tree
12712 {
12713 tree identifier;
12720 }
12722 /* Parse an operator.
12724 operator:
12725 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12726 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12727 || ++ -- , ->* -> () []
12729 GNU Extensions:
12731 operator:
12732 <? >? <?= >?=
12734 Returns an IDENTIFIER_NODE for the operator which is a
12735 human-readable spelling of the identifier, e.g., `operator +'. */
12737 static tree
12739 {
12744 /* Peek at the next token. */
12746 /* Figure out which operator we have. */
12748 {
12750 {
12753 /* The keyword should be either `new' or `delete'. */
12758 else
12761 /* Consume the `new' or `delete' token. */
12764 /* Peek at the next token. */
12766 /* If it's a `[' token then this is the array variant of the
12767 operator. */
12769 {
12770 /* Consume the `[' token. */
12772 /* Look for the `]' token. */
12776 }
12777 /* Otherwise, we have the non-array variant. */
12778 else
12782 }
12929 /* Consume the `('. */
12931 /* Look for the matching `)'. */
12936 /* Consume the `['. */
12938 /* Look for the matching `]'. */
12953 {
12960 /* Consume the string. */
12966 {
12969 }
12970 else
12971 {
12973 /* Look for the suffix identifier. */
12978 {
12982 }
12983 else
12984 {
12987 }
12988 }
12993 {
12996 }
12999 {
13002 }
13004 {
13007 }
13009 }
13012 /* Anything else is an error. */
13014 }
13016 /* If we have selected an identifier, we need to consume the
13017 operator token. */
13020 /* Otherwise, no valid operator name was present. */
13021 else
13022 {
13025 }
13028 }
13030 /* Parse a template-declaration.
13032 template-declaration:
13033 export [opt] template < template-parameter-list > declaration
13035 If MEMBER_P is TRUE, this template-declaration occurs within a
13036 class-specifier.
13038 The grammar rule given by the standard isn't correct. What
13039 is really meant is:
13041 template-declaration:
13042 export [opt] template-parameter-list-seq
13043 decl-specifier-seq [opt] init-declarator [opt] ;
13044 export [opt] template-parameter-list-seq
13045 function-definition
13047 template-parameter-list-seq:
13048 template-parameter-list-seq [opt]
13049 template < template-parameter-list > */
13051 static void
13053 {
13054 /* Check for `export'. */
13056 {
13057 /* Consume the `export' token. */
13059 /* Warn that we do not support `export'. */
13061 }
13064 }
13066 /* Parse a template-parameter-list.
13068 template-parameter-list:
13069 template-parameter
13070 template-parameter-list , template-parameter
13072 Returns a TREE_LIST. Each node represents a template parameter.
13073 The nodes are connected via their TREE_CHAINs. */
13075 static tree
13077 {
13082 /* The loop below parses the template parms. We first need to know
13083 the total number of template parms to be able to compute proper
13084 canonical types of each dependent type. So after the loop, when
13085 we know the total number of template parms,
13086 end_template_parm_list computes the proper canonical types and
13087 fixes up the dependent types accordingly. */
13089 {
13090 tree parameter;
13093 location_t parm_loc;
13095 /* Parse the template-parameter. */
13100 /* Add it to the list. */
13103 parm_loc,
13104 parameter,
13105 is_non_type,
13106 is_parameter_pack);
13107 else
13108 {
13111 }
13113 /* If the next token is not a `,', we're done. */
13116 /* Otherwise, consume the `,' token. */
13118 }
13121 }
13123 /* Parse a template-parameter.
13125 template-parameter:
13126 type-parameter
13127 parameter-declaration
13129 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13130 the parameter. The TREE_PURPOSE is the default value, if any.
13131 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13132 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13133 set to true iff this parameter is a parameter pack. */
13135 static tree
13138 {
13142 tree parm;
13144 /* Assume it is a type parameter or a template parameter. */
13146 /* Assume it not a parameter pack. */
13148 /* Peek at the next token. */
13150 /* If it is `class' or `template', we have a type-parameter. */
13153 /* If it is `class' or `typename' we do not know yet whether it is a
13154 type parameter or a non-type parameter. Consider:
13156 template <typename T, typename T::X X> ...
13158 or:
13160 template <class C, class D*> ...
13162 Here, the first parameter is a type parameter, and the second is
13163 a non-type parameter. We can tell by looking at the token after
13164 the identifier -- if it is a `,', `=', or `>' then we have a type
13165 parameter. */
13167 {
13168 /* Peek at the token after `class' or `typename'. */
13170 /* If it's an ellipsis, we have a template type parameter
13171 pack. */
13174 /* If it's an identifier, skip it. */
13177 /* Now, see if the token looks like the end of a template
13178 parameter. */
13183 }
13185 /* Otherwise, it is a non-type parameter.
13187 [temp.param]
13189 When parsing a default template-argument for a non-type
13190 template-parameter, the first non-nested `>' is taken as the end
13191 of the template parameter-list rather than a greater-than
13192 operator. */
13194 parameter_declarator
13201 /* If the parameter declaration is marked as a parameter pack, set
13202 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13203 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13204 grokdeclarator. */
13207 {
13210 }
13213 {
13214 /* Can happen in some cases of erroneous input (c++/34892). */
13216 /* Consume the `...' for better error recovery. */
13218 }
13219 /* If the next token is an ellipsis, and we don't already have it
13220 marked as a parameter pack, then we have a parameter pack (that
13221 has no declarator). */
13224 && (declarator_can_be_parameter_pack
13226 {
13227 /* Consume the `...'. */
13232 }
13233 /* We might end up with a pack expansion as the type of the non-type
13234 template parameter, in which case this is a non-type template
13235 parameter pack. */
13238 {
13242 }
13245 {
13246 /* Parameter packs cannot have default arguments. However, a
13247 user may try to do so, so we'll parse them and give an
13248 appropriate diagnostic here. */
13252 /* Find the name of the parameter pack. */
13261 else
13265 /* Parse the default argument, but throw away the result. */
13267 }
13277 }
13279 /* Parse a type-parameter.
13281 type-parameter:
13282 class identifier [opt]
13283 class identifier [opt] = type-id
13284 typename identifier [opt]
13285 typename identifier [opt] = type-id
13286 template < template-parameter-list > class identifier [opt]
13287 template < template-parameter-list > class identifier [opt]
13288 = id-expression
13290 GNU Extension (variadic templates):
13292 type-parameter:
13293 class ... identifier [opt]
13294 typename ... identifier [opt]
13296 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13297 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13298 the declaration of the parameter.
13300 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13302 static tree
13304 {
13306 tree parameter;
13308 /* Look for a keyword to tell us what kind of parameter this is. */
13314 {
13317 {
13318 tree identifier;
13319 tree default_argument;
13321 /* If the next token is an ellipsis, we have a template
13322 argument pack. */
13324 {
13325 /* Consume the `...' token. */
13330 }
13332 /* If the next token is an identifier, then it names the
13333 parameter. */
13336 else
13339 /* Create the parameter. */
13342 /* If the next token is an `=', we have a default argument. */
13344 {
13345 /* Consume the `=' token. */
13347 /* Parse the default-argument. */
13351 /* Template parameter packs cannot have default
13352 arguments. */
13354 {
13357 "template parameter pack %qD cannot have a "
13359 else
13361 "template parameter packs cannot have "
13364 }
13366 }
13367 else
13370 /* Create the combined representation of the parameter and the
13371 default argument. */
13373 }
13377 {
13378 tree identifier;
13379 tree default_argument;
13381 /* Look for the `<'. */
13383 /* Parse the template-parameter-list. */
13385 /* Look for the `>'. */
13387 /* Look for the `class' or 'typename' keywords. */
13389 /* If the next token is an ellipsis, we have a template
13390 argument pack. */
13392 {
13393 /* Consume the `...' token. */
13398 }
13399 /* If the next token is an `=', then there is a
13400 default-argument. If the next token is a `>', we are at
13401 the end of the parameter-list. If the next token is a `,',
13402 then we are at the end of this parameter. */
13406 {
13408 /* Treat invalid names as if the parameter were nameless. */
13411 }
13412 else
13415 /* Create the template parameter. */
13417 identifier);
13419 /* If the next token is an `=', then there is a
13420 default-argument. */
13422 {
13425 /* Consume the `='. */
13427 /* Parse the id-expression. */
13429 /* save token before parsing the id-expression, for error
13430 reporting */
13432 default_argument
13440 /* If the id-expression was a template-id that refers to
13441 a template-class, we already have the declaration here,
13442 so no further lookup is needed. */
13443 ;
13444 else
13445 /* Look up the name. */
13446 default_argument
13448 none_type,
13454 /* See if the default argument is valid. */
13455 default_argument
13458 /* Template parameter packs cannot have default
13459 arguments. */
13461 {
13464 "template parameter pack %qD cannot "
13466 identifier);
13467 else
13471 }
13473 }
13474 else
13477 /* Create the combined representation of the parameter and the
13478 default argument. */
13480 }
13486 }
13489 }
13491 /* Parse a template-id.
13493 template-id:
13494 template-name < template-argument-list [opt] >
13496 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13497 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13498 returned. Otherwise, if the template-name names a function, or set
13499 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13500 names a class, returns a TYPE_DECL for the specialization.
13502 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13503 uninstantiated templates. */
13505 static tree
13511 {
13513 tree templ;
13514 tree arguments;
13515 tree template_id;
13522 /* If the next token corresponds to a template-id, there is no need
13523 to reparse it. */
13526 {
13529 /* Get the stored value. */
13531 /* Perform any access checks that were deferred. */
13534 {
13539 tf_warning_or_error);
13540 }
13541 /* Return the stored value. */
13543 }
13545 /* Avoid performing name lookup if there is no possibility of
13546 finding a template-id. */
13549 && !cp_parser_nth_token_starts_template_argument_list_p
13551 {
13554 }
13556 /* Remember where the template-id starts. */
13562 /* Parse the template-name. */
13565 check_dependency_p,
13566 is_declaration,
13567 tag_type,
13570 {
13573 }
13575 /* If we find the sequence `[:' after a template-name, it's probably
13576 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13577 parse correctly the argument list. */
13584 {
13586 /* Change `:' into `::'. */
13588 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13589 CPP_LESS. */
13592 /* Parse the arguments. */
13595 {
13596 /* If we couldn't parse an argument list, then we revert our changes
13597 and return simply an error. Maybe this is not a template-id
13598 after all. */
13603 }
13604 /* Otherwise, emit an error about the invalid digraph, but continue
13605 parsing because we got our argument list. */
13608 {
13611 "%<<:%> is an alternate spelling for %<[%>."
13614 {
13616 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13619 }
13620 }
13621 }
13622 else
13623 {
13624 /* Look for the `<' that starts the template-argument-list. */
13626 {
13629 }
13630 /* Parse the arguments. */
13632 }
13634 /* Build a representation of the specialization. */
13637 TEMPLATE_ID_EXPR,
13641 {
13643 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13644 template (rather than some instantiation thereof) only if
13645 is not nested within some other construct. For example, in
13646 "template <typename T> void f(T) { A<T>::", A<T> is just an
13647 instantiation of A. */
13650 CPP_SCOPE));
13651 template_id
13653 }
13655 {
13657 }
13658 else
13659 {
13660 /* If it's not a class-template or a template-template, it should be
13661 a function-template. */
13667 }
13669 /* If parsing tentatively, replace the sequence of tokens that makes
13670 up the template-id with a CPP_TEMPLATE_ID token. That way,
13671 should we re-parse the token stream, we will not have to repeat
13672 the effort required to do the parse, nor will we issue duplicate
13673 error messages about problems during instantiation of the
13674 template. */
13676 /* Don't do this if we had a parse error in a declarator; re-parsing
13677 might succeed if a name changes meaning (60361). */
13681 {
13684 /* Reset the contents of the START_OF_ID token. */
13686 /* Retrieve any deferred checks. Do not pop this access checks yet
13687 so the memory will not be reclaimed during token replacing below. */
13693 /* Purge all subsequent tokens. */
13696 /* ??? Can we actually assume that, if template_id ==
13697 error_mark_node, we will have issued a diagnostic to the
13698 user, as opposed to simply marking the tentative parse as
13699 failed? */
13702 }
13706 }
13708 /* Parse a template-name.
13710 template-name:
13711 identifier
13713 The standard should actually say:
13715 template-name:
13716 identifier
13717 operator-function-id
13719 A defect report has been filed about this issue.
13721 A conversion-function-id cannot be a template name because they cannot
13722 be part of a template-id. In fact, looking at this code:
13724 a.operator K<int>()
13726 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13727 It is impossible to call a templated conversion-function-id with an
13728 explicit argument list, since the only allowed template parameter is
13729 the type to which it is converting.
13731 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13732 `template' keyword, in a construction like:
13734 T::template f<3>()
13736 In that case `f' is taken to be a template-name, even though there
13737 is no way of knowing for sure.
13739 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13740 name refers to a set of overloaded functions, at least one of which
13741 is a template, or an IDENTIFIER_NODE with the name of the template,
13742 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13743 names are looked up inside uninstantiated templates. */
13745 static tree
13752 {
13753 tree identifier;
13754 tree decl;
13755 tree fns;
13758 /* If the next token is `operator', then we have either an
13759 operator-function-id or a conversion-function-id. */
13761 {
13762 /* We don't know whether we're looking at an
13763 operator-function-id or a conversion-function-id. */
13765 /* Try an operator-function-id. */
13767 /* If that didn't work, try a conversion-function-id. */
13769 {
13772 }
13773 }
13774 /* Look for the identifier. */
13775 else
13778 /* If we didn't find an identifier, we don't have a template-id. */
13782 /* If the name immediately followed the `template' keyword, then it
13783 is a template-name. However, if the next token is not `<', then
13784 we do not treat it as a template-name, since it is not being used
13785 as part of a template-id. This enables us to handle constructs
13786 like:
13788 template <typename T> struct S { S(); };
13789 template <typename T> S<T>::S();
13791 correctly. We would treat `S' as a template -- if it were `S<T>'
13792 -- but we do not if there is no `<'. */
13796 {
13797 /* In a declaration, in a dependent context, we pretend that the
13798 "template" keyword was present in order to improve error
13799 recovery. For example, given:
13801 template <typename T> void f(T::X<int>);
13803 we want to treat "X<int>" as a template-id. */
13805 && !template_keyword_p
13807 && check_dependency_p
13809 /* Do not do this for dtors (or ctors), since they never
13810 need the template keyword before their name. */
13812 {
13815 /* Explain what went wrong. */
13817 identifier);
13820 /* If parsing tentatively, find the location of the "<" token. */
13823 /* Parse the template arguments so that we can issue error
13824 messages about them. */
13827 /* Skip tokens until we find a good place from which to
13828 continue parsing. */
13833 /* If parsing tentatively, permanently remove the
13834 template argument list. That will prevent duplicate
13835 error messages from being issued about the missing
13836 "template" keyword. */
13842 }
13844 /* If the "template" keyword is present, then there is generally
13845 no point in doing name-lookup, so we just return IDENTIFIER.
13846 But, if the qualifying scope is non-dependent then we can
13847 (and must) do name-lookup normally. */
13853 }
13855 /* Look up the name. */
13857 tag_type,
13860 check_dependency_p,
13864 /* If DECL is a template, then the name was a template-name. */
13866 ;
13867 else
13868 {
13871 /* The standard does not explicitly indicate whether a name that
13872 names a set of overloaded declarations, some of which are
13873 templates, is a template-name. However, such a name should
13874 be a template-name; otherwise, there is no way to form a
13875 template-id for the overloaded templates. */
13883 {
13884 /* The name does not name a template. */
13887 }
13888 }
13890 /* If DECL is dependent, and refers to a function, then just return
13891 its name; we will look it up again during template instantiation. */
13893 {
13897 }
13900 }
13902 /* Parse a template-argument-list.
13904 template-argument-list:
13905 template-argument ... [opt]
13906 template-argument-list , template-argument ... [opt]
13908 Returns a TREE_VEC containing the arguments. */
13910 static tree
13912 {
13917 tree vec;
13924 /* Even if the template-id appears in an integral
13925 constant-expression, the contents of the argument list do
13926 not. */
13932 /* Parse the arguments. */
13933 do
13934 {
13935 tree argument;
13938 /* Consume the comma. */
13941 /* Parse the template-argument. */
13944 /* If the next token is an ellipsis, we're expanding a template
13945 argument pack. */
13947 {
13949 {
13953 }
13954 /* Consume the `...' token. */
13957 /* Make the argument into a TYPE_PACK_EXPANSION or
13958 EXPR_PACK_EXPANSION. */
13960 }
13963 {
13967 {
13970 }
13971 else
13973 }
13975 }
13988 #ifdef ENABLE_CHECKING
13990 #endif
13992 }
13994 /* Parse a template-argument.
13996 template-argument:
13997 assignment-expression
13998 type-id
13999 id-expression
14001 The representation is that of an assignment-expression, type-id, or
14002 id-expression -- except that the qualified id-expression is
14003 evaluated, so that the value returned is either a DECL or an
14004 OVERLOAD.
14006 Although the standard says "assignment-expression", it forbids
14007 throw-expressions or assignments in the template argument.
14008 Therefore, we use "conditional-expression" instead. */
14010 static tree
14012 {
14013 tree argument;
14019 cp_id_kind idk;
14021 /* There's really no way to know what we're looking at, so we just
14022 try each alternative in order.
14024 [temp.arg]
14026 In a template-argument, an ambiguity between a type-id and an
14027 expression is resolved to a type-id, regardless of the form of
14028 the corresponding template-parameter.
14030 Therefore, we try a type-id first. */
14033 /* If there was no error parsing the type-id but the next token is a
14034 '>>', our behavior depends on which dialect of C++ we're
14035 parsing. In C++98, we probably found a typo for '> >'. But there
14036 are type-id which are also valid expressions. For instance:
14038 struct X { int operator >> (int); };
14039 template <int V> struct Foo {};
14040 Foo<X () >> 5> r;
14042 Here 'X()' is a valid type-id of a function type, but the user just
14043 wanted to write the expression "X() >> 5". Thus, we remember that we
14044 found a valid type-id, but we still try to parse the argument as an
14045 expression to see what happens.
14047 In C++0x, the '>>' will be considered two separate '>'
14048 tokens. */
14052 {
14055 }
14056 else
14057 {
14058 /* If the next token isn't a `,' or a `>', then this argument wasn't
14059 really finished. This means that the argument is not a valid
14060 type-id. */
14063 /* If that worked, we're done. */
14066 }
14067 /* We're still not sure what the argument will be. */
14069 /* Try a template. */
14077 /* If the next token isn't a `,' or a `>', then this argument wasn't
14078 really finished. */
14082 {
14083 /* Figure out what is being referred to. If the id-expression
14084 was for a class template specialization, then we will have a
14085 TYPE_DECL at this point. There is no need to do name lookup
14086 at this point in that case. */
14089 none_type,
14098 }
14101 /* It must be a non-type argument. There permitted cases are given
14102 in [temp.arg.nontype]:
14104 -- an integral constant-expression of integral or enumeration
14105 type; or
14107 -- the name of a non-type template-parameter; or
14109 -- the name of an object or function with external linkage...
14111 -- the address of an object or function with external linkage...
14113 -- a pointer to member... */
14114 /* Look for a non-type template parameter. */
14116 {
14128 }
14130 /* If the next token is "&", the argument must be the address of an
14131 object or function with external linkage. */
14134 {
14137 }
14138 /* See if we might have an id-expression. */
14145 {
14148 address_p,
14155 else
14156 {
14157 tree probe;
14160 {
14161 /* Strip the dereference temporarily. */
14164 }
14166 /* If we're in a template, we represent a qualified-id referring
14167 to a static data member as a SCOPE_REF even if the scope isn't
14168 dependent so that we can check access control later. */
14173 {
14174 /* A variable without external linkage might still be a
14175 valid constant-expression, so no error is issued here
14176 if the external-linkage check fails. */
14179 }
14181 /* All overloaded functions are allowed; if the external
14182 linkage test does not pass, an error will be issued
14183 later. */
14184 ;
14188 /* A pointer-to-member. */
14189 ;
14191 ;
14192 else
14196 {
14199 tf_warning_or_error);
14200 else
14203 }
14204 }
14205 }
14206 /* If the argument started with "&", there are no other valid
14207 alternatives at this point. */
14209 {
14212 }
14214 /* If the argument wasn't successfully parsed as a type-id followed
14215 by '>>', the argument can only be a constant expression now.
14216 Otherwise, we try parsing the constant-expression tentatively,
14217 because the argument could really be a type-id. */
14229 /* We did our best to parse the argument as a non type-id, but that
14230 was the only alternative that matched (albeit with a '>' after
14231 it). We can assume it's just a typo from the user, and a
14232 diagnostic will then be issued. */
14234 }
14236 /* Parse an explicit-instantiation.
14238 explicit-instantiation:
14239 template declaration
14241 Although the standard says `declaration', what it really means is:
14243 explicit-instantiation:
14244 template decl-specifier-seq [opt] declarator [opt] ;
14246 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14247 supposed to be allowed. A defect report has been filed about this
14248 issue.
14250 GNU Extension:
14252 explicit-instantiation:
14253 storage-class-specifier template
14254 decl-specifier-seq [opt] declarator [opt] ;
14255 function-specifier template
14256 decl-specifier-seq [opt] declarator [opt] ; */
14258 static void
14260 {
14262 cp_decl_specifier_seq decl_specifiers;
14267 /* Look for an (optional) storage-class-specifier or
14268 function-specifier. */
14270 {
14271 extension_specifier
14274 extension_specifier
14277 }
14279 /* Look for the `template' keyword. */
14281 /* Let the front end know that we are processing an explicit
14282 instantiation. */
14284 /* [temp.explicit] says that we are supposed to ignore access
14285 control while processing explicit instantiation directives. */
14287 /* Parse a decl-specifier-seq. */
14289 CP_PARSER_FLAGS_OPTIONAL,
14292 /* If there was exactly one decl-specifier, and it declared a class,
14293 and there's no declarator, then we have an explicit type
14294 instantiation. */
14296 {
14297 tree type;
14301 /* Turn access control back on for names used during
14302 template instantiation. */
14307 }
14308 else
14309 {
14311 tree decl;
14313 /* Parse the declarator. */
14314 declarator
14325 {
14328 "explicit instantiation shall not use"
14332 "explicit instantiation shall not use"
14337 /* Turn access control back on for names used during
14338 template instantiation. */
14340 /* Do the explicit instantiation. */
14342 }
14343 else
14344 {
14346 /* Skip the body of the explicit instantiation. */
14348 }
14349 }
14350 /* We're done with the instantiation. */
14356 }
14358 /* Parse an explicit-specialization.
14360 explicit-specialization:
14361 template < > declaration
14363 Although the standard says `declaration', what it really means is:
14365 explicit-specialization:
14366 template <> decl-specifier [opt] init-declarator [opt] ;
14367 template <> function-definition
14368 template <> explicit-specialization
14369 template <> template-declaration */
14371 static void
14373 {
14377 /* Look for the `template' keyword. */
14379 /* Look for the `<'. */
14381 /* Look for the `>'. */
14383 /* We have processed another parameter list. */
14385 /* [temp]
14387 A template ... explicit specialization ... shall not have C
14388 linkage. */
14390 {
14392 /* Give it C++ linkage to avoid confusing other parts of the
14393 front end. */
14396 }
14397 else
14399 /* Let the front end know that we are beginning a specialization. */
14401 {
14404 }
14406 /* If the next keyword is `template', we need to figure out whether
14407 or not we're looking a template-declaration. */
14409 {
14414 else
14416 }
14417 else
14418 /* Parse the dependent declaration. */
14424 /* We're done with the specialization. */
14426 /* For the erroneous case of a template with C linkage, we pushed an
14427 implicit C++ linkage scope; exit that scope now. */
14430 /* We're done with this parameter list. */
14432 }
14434 /* Parse a type-specifier.
14436 type-specifier:
14437 simple-type-specifier
14438 class-specifier
14439 enum-specifier
14440 elaborated-type-specifier
14441 cv-qualifier
14443 GNU Extension:
14445 type-specifier:
14446 __complex__
14448 Returns a representation of the type-specifier. For a
14449 class-specifier, enum-specifier, or elaborated-type-specifier, a
14450 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14452 The parser flags FLAGS is used to control type-specifier parsing.
14454 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14455 in a decl-specifier-seq.
14457 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14458 class-specifier, enum-specifier, or elaborated-type-specifier, then
14459 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14460 if a type is declared; 2 if it is defined. Otherwise, it is set to
14461 zero.
14463 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14464 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14465 is set to FALSE. */
14467 static tree
14469 cp_parser_flags flags,
14474 {
14480 /* Assume this type-specifier does not declare a new type. */
14483 /* And that it does not specify a cv-qualifier. */
14486 /* Peek at the next token. */
14489 /* If we're looking at a keyword, we can use that to guide the
14490 production we choose. */
14493 {
14498 /* Look for the enum-specifier. */
14500 /* If that worked, we're done. */
14502 {
14507 type_spec,
14508 token,
14511 }
14512 else
14515 /* Any of these indicate either a class-specifier, or an
14516 elaborated-type-specifier. */
14523 /* Parse tentatively so that we can back up if we don't find a
14524 class-specifier. */
14526 /* Look for the class-specifier. */
14529 /* If that worked, we're done. */
14531 {
14536 type_spec,
14537 token,
14540 }
14542 /* Fall through. */
14543 elaborated_type_specifier:
14544 /* We're declaring (not defining) a class or enum. */
14548 /* Fall through. */
14550 /* Look for an elaborated-type-specifier. */
14551 type_spec
14552 = (cp_parser_elaborated_type_specifier
14555 is_declaration));
14558 type_spec,
14559 token,
14582 /* The `__complex__' keyword is a GNU extension. */
14588 }
14590 /* Handle simple keywords. */
14592 {
14594 {
14597 }
14599 }
14601 /* If we do not already have a type-specifier, assume we are looking
14602 at a simple-type-specifier. */
14604 decl_specs,
14605 flags);
14607 /* If we didn't find a type-specifier, and a type-specifier was not
14608 optional in this context, issue an error message. */
14610 {
14613 }
14616 }
14618 /* Parse a simple-type-specifier.
14620 simple-type-specifier:
14621 :: [opt] nested-name-specifier [opt] type-name
14622 :: [opt] nested-name-specifier template template-id
14623 char
14624 wchar_t
14625 bool
14626 short
14627 int
14628 long
14629 signed
14630 unsigned
14631 float
14632 double
14633 void
14635 C++0x Extension:
14637 simple-type-specifier:
14638 auto
14639 decltype ( expression )
14640 char16_t
14641 char32_t
14642 __underlying_type ( type-id )
14644 GNU Extension:
14646 simple-type-specifier:
14647 __int128
14648 __typeof__ unary-expression
14649 __typeof__ ( type-id )
14650 __typeof__ ( type-id ) { initializer-list , [opt] }
14652 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14653 appropriately updated. */
14655 static tree
14658 cp_parser_flags flags)
14659 {
14663 /* Peek at the next token. */
14666 /* If we're looking at a keyword, things are easy. */
14668 {
14728 {
14732 {
14735 "use of %<auto%> in lambda parameter declaration "
14736 "only available with "
14738 }
14741 "use of %<auto%> in parameter declaration "
14742 "only available with "
14744 else
14746 "ISO C++ forbids use of %<auto%> in parameter "
14748 }
14749 else
14754 /* Since DR 743, decltype can either be a simple-type-specifier by
14755 itself or begin a nested-name-specifier. Parsing it will replace
14756 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14757 handling below decide what to do. */
14763 /* Consume the `typeof' token. */
14765 /* Parse the operand to `typeof'. */
14767 /* If it is not already a TYPE, take its type. */
14773 token,
14782 token,
14792 token,
14797 }
14799 /* If token is an already-parsed decltype not followed by ::,
14800 it's a simple-type-specifier. */
14803 {
14807 token,
14811 }
14813 /* If the type-specifier was for a built-in type, we're done. */
14815 {
14816 /* Record the type. */
14823 type,
14824 token,
14829 /* Consume the token. */
14832 /* There is no valid C++ program where a non-template type is
14833 followed by a "<". That usually indicates that the user thought
14834 that the type was a template. */
14839 }
14841 /* The type-specifier must be a user-defined type. */
14843 {
14847 /* Don't gobble tokens or issue error messages if this is an
14848 optional type-specifier. */
14852 /* Look for the optional `::' operator. */
14853 global_p
14857 /* Look for the nested-name specifier. */
14858 qualified_p
14866 /* If we have seen a nested-name-specifier, and the next token
14867 is `template', then we are using the template-id production. */
14870 {
14871 /* Look for the template-id. */
14875 none_type,
14877 /* If the template-id did not name a type, we are out of
14878 luck. */
14880 {
14883 }
14884 }
14885 /* Otherwise, look for a type-name. */
14886 else
14888 /* Keep track of all name-lookups performed in class scopes. */
14890 && !global_p
14891 && !qualified_p
14895 /* If it didn't work out, we don't have a TYPE. */
14901 token,
14903 }
14905 /* If we didn't get a type-name, issue an error message. */
14907 {
14910 }
14913 {
14914 /* See if TYPE is an Objective-C type, and if so, parse and
14915 accept any protocol references following it. Do this before
14916 the cp_parser_check_for_invalid_template_id() call, because
14917 Objective-C types can be followed by '<...>' which would
14918 enclose protocol names rather than template arguments, and so
14919 everything is fine. */
14922 {
14926 /* Clobber the "unqualified" type previously entered into
14927 DECL_SPECS with the new, improved protocol-qualified version. */
14932 }
14934 /* There is no valid C++ program where a non-template type is
14935 followed by a "<". That usually indicates that the user
14936 thought that the type was a template. */
14938 none_type,
14940 }
14943 }
14945 /* Parse a type-name.
14947 type-name:
14948 class-name
14949 enum-name
14950 typedef-name
14951 simple-template-id [in c++0x]
14953 enum-name:
14954 identifier
14956 typedef-name:
14957 identifier
14959 Returns a TYPE_DECL for the type. */
14961 static tree
14963 {
14964 tree type_decl;
14966 /* We can't know yet whether it is a class-name or not. */
14968 /* Try a class-name. */
14972 none_type,
14976 /* If it's not a class-name, keep looking. */
14978 {
14980 /* It must be a typedef-name or an enum-name. */
14984 /* It is either a simple-template-id representing an
14985 instantiation of an alias template... */
14989 none_type,
14991 /* Note that this must be an instantiation of an alias template
14992 because [temp.names]/6 says:
14994 A template-id that names an alias template specialization
14995 is a type-name.
14997 Whereas [temp.names]/7 says:
14999 A simple-template-id that names a class template
15000 specialization is a class-name. */
15005 else
15009 /* ... Or a typedef-name or an enum-name. */
15011 }
15014 }
15016 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15018 enum-name:
15019 identifier
15021 typedef-name:
15022 identifier
15024 Returns a TYPE_DECL for the type. */
15026 static tree
15028 {
15029 tree type_decl;
15030 tree identifier;
15037 /* Look up the type-name. */
15044 {
15045 /* See if this is an Objective-C type. */
15050 }
15052 /* Issue an error if we did not find a type-name. */
15054 /* In Objective-C, we have the complication that class names are
15055 normally type names and start declarations (eg, the
15056 "NSObject" in "NSObject *object;"), but can be used in an
15057 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15058 is an expression. So, a classname followed by a dot is not a
15059 valid type-name. */
15062 {
15067 }
15068 /* Remember that the name was used in the definition of the
15069 current class so that we can check later to see if the
15070 meaning would have been different after the class was
15071 entirely defined. */
15077 }
15079 /* Parse an elaborated-type-specifier. Note that the grammar given
15080 here incorporates the resolution to DR68.
15082 elaborated-type-specifier:
15083 class-key :: [opt] nested-name-specifier [opt] identifier
15084 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15085 enum-key :: [opt] nested-name-specifier [opt] identifier
15086 typename :: [opt] nested-name-specifier identifier
15087 typename :: [opt] nested-name-specifier template [opt]
15088 template-id
15090 GNU extension:
15092 elaborated-type-specifier:
15093 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15094 class-key attributes :: [opt] nested-name-specifier [opt]
15095 template [opt] template-id
15096 enum attributes :: [opt] nested-name-specifier [opt] identifier
15098 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15099 declared `friend'. If IS_DECLARATION is TRUE, then this
15100 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15101 something is being declared.
15103 Returns the TYPE specified. */
15105 static tree
15109 {
15111 tree identifier;
15114 tree globalscope;
15117 /* See if we're looking at the `enum' keyword. */
15119 {
15120 /* Consume the `enum' token. */
15122 /* Remember that it's an enumeration type. */
15124 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15125 enums) is used here. */
15128 {
15132 /* Consume the `struct' or `class' and parse it anyway. */
15134 }
15135 /* Parse the attributes. */
15137 }
15138 /* Or, it might be `typename'. */
15140 RID_TYPENAME))
15141 {
15142 /* Consume the `typename' token. */
15144 /* Remember that it's a `typename' type. */
15146 }
15147 /* Otherwise it must be a class-key. */
15148 else
15149 {
15153 /* Parse the attributes. */
15155 }
15157 /* Look for the `::' operator. */
15160 /* Look for the nested-name-specifier. */
15162 {
15167 is_declaration))
15169 }
15170 else
15171 /* Even though `typename' is not present, the proposed resolution
15172 to Core Issue 180 says that in `class A<T>::B', `B' should be
15173 considered a type-name, even if `A<T>' is dependent. */
15178 is_declaration);
15179 /* For everything but enumeration types, consider a template-id.
15180 For an enumeration type, consider only a plain identifier. */
15182 {
15184 tree decl;
15186 /* Allow the `template' keyword. */
15188 /* If we didn't see `template', we don't know if there's a
15189 template-id or not. */
15192 /* Parse the template-id. */
15196 tag_type,
15197 is_declaration);
15198 /* If we didn't find a template-id, look for an ordinary
15199 identifier. */
15201 ;
15202 /* We can get here when cp_parser_template_id, called by
15203 cp_parser_class_name with tag_type == none_type, succeeds
15204 and caches a BASELINK. Then, when called again here,
15205 instead of failing and returning an error_mark_node
15206 returns it (see template/typename17.C in C++11).
15207 ??? Could we diagnose this earlier? */
15209 {
15212 }
15213 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15214 in effect, then we must assume that, upon instantiation, the
15215 template will correspond to a class. */
15219 typename_type,
15221 /* If the `typename' keyword is in effect and DECL is not a type
15222 decl, then type is non existent. */
15224 ;
15230 }
15233 {
15238 {
15241 }
15243 /* For a `typename', we needn't call xref_tag. */
15249 /* Template parameter lists apply only if we are not within a
15250 function parameter list. */
15251 bool template_parm_lists_apply
15260 /* Look up a qualified name in the usual way. */
15262 {
15263 tree decl;
15264 tree ambiguous_decls;
15267 tag_type,
15274 /* If the lookup was ambiguous, an error will already have been
15275 issued. */
15279 /* If we are parsing friend declaration, DECL may be a
15280 TEMPLATE_DECL tree node here. However, we need to check
15281 whether this TEMPLATE_DECL results in valid code. Consider
15282 the following example:
15284 namespace N {
15285 template <class T> class C {};
15286 }
15287 class X {
15288 template <class T> friend class N::C; // #1, valid code
15289 };
15290 template <class T> class Y {
15291 friend class N::C; // #2, invalid code
15292 };
15294 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15295 name lookup of `N::C'. We see that friend declaration must
15296 be template for the code to be valid. Note that
15297 processing_template_decl does not work here since it is
15298 always 1 for the above two cases. */
15300 decl = (cp_parser_maybe_treat_template_as_class
15305 {
15307 identifier,
15310 }
15313 {
15317 allow_template);
15321 }
15323 /* Forward declarations of nested types, such as
15325 class C1::C2;
15326 class C1::C2::C3;
15328 are invalid unless all components preceding the final '::'
15329 are complete. If all enclosing types are complete, these
15330 declarations become merely pointless.
15332 Invalid forward declarations of nested types are errors
15333 caught elsewhere in parsing. Those that are pointless arrive
15334 here. */
15341 }
15342 else
15343 {
15344 /* An elaborated-type-specifier sometimes introduces a new type and
15345 sometimes names an existing type. Normally, the rule is that it
15346 introduces a new type only if there is not an existing type of
15347 the same name already in scope. For example, given:
15349 struct S {};
15350 void f() { struct S s; }
15352 the `struct S' in the body of `f' is the same `struct S' as in
15353 the global scope; the existing definition is used. However, if
15354 there were no global declaration, this would introduce a new
15355 local class named `S'.
15357 An exception to this rule applies to the following code:
15359 namespace N { struct S; }
15361 Here, the elaborated-type-specifier names a new type
15362 unconditionally; even if there is already an `S' in the
15363 containing scope this declaration names a new type.
15364 This exception only applies if the elaborated-type-specifier
15365 forms the complete declaration:
15367 [class.name]
15369 A declaration consisting solely of `class-key identifier ;' is
15370 either a redeclaration of the name in the current scope or a
15371 forward declaration of the identifier as a class name. It
15372 introduces the name into the current scope.
15374 We are in this situation precisely when the next token is a `;'.
15376 An exception to the exception is that a `friend' declaration does
15377 *not* name a new type; i.e., given:
15379 struct S { friend struct T; };
15381 `T' is not a new type in the scope of `S'.
15383 Also, `new struct S' or `sizeof (struct S)' never results in the
15384 definition of a new type; a new type can only be declared in a
15385 declaration context. */
15387 tag_scope ts;
15391 /* Friends have special name lookup rules. */
15395 CPP_SEMICOLON))
15396 /* This is a `class-key identifier ;' */
15398 else
15401 template_p =
15402 (template_parm_lists_apply
15405 /* An unqualified name was used to reference this type, so
15406 there were no qualifying templates. */
15414 }
15415 }
15420 /* Allow attributes on forward declarations of classes. */
15422 {
15432 else
15435 }
15438 {
15439 /* Indicate whether this class was declared as a `class' or as a
15440 `struct'. */
15444 }
15446 /* A "<" cannot follow an elaborated type specifier. If that
15447 happens, the user was probably trying to form a template-id. */
15452 }
15454 /* Parse an enum-specifier.
15456 enum-specifier:
15457 enum-head { enumerator-list [opt] }
15458 enum-head { enumerator-list , } [C++0x]
15460 enum-head:
15461 enum-key identifier [opt] enum-base [opt]
15462 enum-key nested-name-specifier identifier enum-base [opt]
15464 enum-key:
15465 enum
15466 enum class [C++0x]
15467 enum struct [C++0x]
15469 enum-base: [C++0x]
15470 : type-specifier-seq
15472 opaque-enum-specifier:
15473 enum-key identifier enum-base [opt] ;
15475 GNU Extensions:
15476 enum-key attributes[opt] identifier [opt] enum-base [opt]
15477 { enumerator-list [opt] }attributes[opt]
15478 enum-key attributes[opt] identifier [opt] enum-base [opt]
15479 { enumerator-list, }attributes[opt] [C++0x]
15481 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15482 if the token stream isn't an enum-specifier after all. */
15484 static tree
15486 {
15487 tree identifier;
15489 tree prev_scope;
15491 tree attributes;
15504 /* Parse tentatively so that we can back up if we don't find a
15505 enum-specifier. */
15508 /* Caller guarantees that the current token is 'enum', an identifier
15509 possibly follows, and the token after that is an opening brace.
15510 If we don't have an identifier, fabricate an anonymous name for
15511 the enumeration being defined. */
15514 /* Parse the "class" or "struct", which indicates a scoped
15515 enumeration type in C++0x. */
15518 {
15522 /* Consume the `struct' or `class' token. */
15526 }
15530 /* Clear the qualification. */
15535 /* Figure out in what scope the declaration is being placed. */
15541 nested_name_specifier
15549 {
15550 tree name;
15554 enum_type,
15559 input_location);
15561 {
15564 {
15565 /* Are template enums allowed in ISO? */
15569 /* ignore a typename reference, for it will be solved by name
15570 in start_enum. */
15572 }
15573 }
15576 else
15579 }
15580 else
15581 {
15584 else
15585 {
15591 }
15592 }
15595 /* Check for the `:' that denotes a specified underlying type in C++0x.
15596 Note that a ':' could also indicate a bitfield width, however. */
15598 {
15599 cp_decl_specifier_seq type_specifiers;
15601 /* Consume the `:'. */
15604 /* Parse the type-specifier-seq. */
15609 /* At this point this is surely not elaborated type specifier. */
15618 /* If that didn't work, stop. */
15620 {
15626 }
15627 }
15629 /* Look for the `{' but don't consume it yet. */
15631 {
15633 {
15636 {
15639 }
15640 }
15641 /* An opaque-enum-specifier must have a ';' here. */
15644 {
15647 {
15650 }
15651 }
15652 }
15658 {
15660 {
15664 }
15666 {
15668 }
15669 }
15671 /* Issue an error message if type-definitions are forbidden here. */
15674 else
15675 /* Create the new type. We do this before consuming the opening
15676 brace so the enum will be recorded as being on the line of its
15677 tag (or the 'enum' keyword, if there is no tag). */
15681 /* If the next token is not '{' it is an opaque-enum-specifier or an
15682 elaborated-type-specifier. */
15684 {
15688 {
15689 /* The following catches invalid code such as:
15690 enum class S<int>::E { A, B, C }; */
15698 {
15702 nested_name_specifier);
15704 }
15705 /* If that scope does not contain the scope in which the
15706 class was originally declared, the program is invalid. */
15708 nested_name_specifier))
15709 {
15712 "declaration of %qD in namespace %qD which does not "
15715 else
15717 "declaration of %qD in %qD which does not "
15721 }
15722 }
15727 /* Consume the opening brace. */
15734 {
15738 }
15739 else
15740 {
15746 }
15750 /* If the next token is not '}', then there are some enumerators. */
15752 {
15756 }
15757 else
15760 /* Consume the final '}'. */
15766 }
15767 else
15768 {
15769 /* If a ';' follows, then it is an opaque-enum-specifier
15770 and additional restrictions apply. */
15772 {
15779 }
15780 }
15782 /* Look for trailing attributes to apply to this enumeration, and
15783 apply them if appropriate. */
15785 {
15789 trailing_attr,
15791 }
15793 /* Finish up the enumeration. */
15795 {
15800 }
15803 {
15805 {
15808 }
15810 {
15812 }
15813 }
15814 out:
15817 }
15819 /* Parse an enumerator-list. The enumerators all have the indicated
15820 TYPE.
15822 enumerator-list:
15823 enumerator-definition
15824 enumerator-list , enumerator-definition */
15826 static void
15828 {
15830 {
15831 /* Parse an enumerator-definition. */
15834 /* If the next token is not a ',', we've reached the end of
15835 the list. */
15838 /* Otherwise, consume the `,' and keep going. */
15840 /* If the next token is a `}', there is a trailing comma. */
15842 {
15847 }
15848 }
15849 }
15851 /* Parse an enumerator-definition. The enumerator has the indicated
15852 TYPE.
15854 enumerator-definition:
15855 enumerator
15856 enumerator = constant-expression
15858 enumerator:
15859 identifier */
15861 static void
15863 {
15864 tree identifier;
15865 tree value;
15866 location_t loc;
15868 /* Save the input location because we are interested in the location
15869 of the identifier and not the location of the explicit value. */
15872 /* Look for the identifier. */
15877 /* If the next token is an '=', then there is an explicit value. */
15879 {
15880 /* Consume the `=' token. */
15882 /* Parse the value. */
15885 NULL);
15886 }
15887 else
15890 /* If we are processing a template, make sure the initializer of the
15891 enumerator doesn't contain any bare template parameter pack. */
15895 /* integral_constant_value will pull out this expression, so make sure
15896 it's folded as appropriate. */
15899 /* Create the enumerator. */
15901 }
15903 /* Parse a namespace-name.
15905 namespace-name:
15906 original-namespace-name
15907 namespace-alias
15909 Returns the NAMESPACE_DECL for the namespace. */
15911 static tree
15913 {
15914 tree identifier;
15915 tree namespace_decl;
15919 /* Get the name of the namespace. */
15924 /* Look up the identifier in the currently active scope. Look only
15925 for namespaces, due to:
15927 [basic.lookup.udir]
15929 When looking up a namespace-name in a using-directive or alias
15930 definition, only namespace names are considered.
15932 And:
15934 [basic.lookup.qual]
15936 During the lookup of a name preceding the :: scope resolution
15937 operator, object, function, and enumerator names are ignored.
15939 (Note that cp_parser_qualifying_entity only calls this
15940 function if the token after the name is the scope resolution
15941 operator.) */
15943 none_type,
15949 /* If it's not a namespace, issue an error. */
15952 {
15957 }
15960 }
15962 /* Parse a namespace-definition.
15964 namespace-definition:
15965 named-namespace-definition
15966 unnamed-namespace-definition
15968 named-namespace-definition:
15969 original-namespace-definition
15970 extension-namespace-definition
15972 original-namespace-definition:
15973 namespace identifier { namespace-body }
15975 extension-namespace-definition:
15976 namespace original-namespace-name { namespace-body }
15978 unnamed-namespace-definition:
15979 namespace { namespace-body } */
15981 static void
15983 {
15990 {
15994 }
15995 else
15998 /* Look for the `namespace' keyword. */
16001 /* Get the name of the namespace. We do not attempt to distinguish
16002 between an original-namespace-definition and an
16003 extension-namespace-definition at this point. The semantic
16004 analysis routines are responsible for that. */
16007 else
16010 /* Parse any specified attributes. */
16013 /* Look for the `{' to start the namespace. */
16015 /* Start the namespace. */
16018 /* "inline namespace" is equivalent to a stub namespace definition
16019 followed by a strong using directive. */
16021 {
16023 /* Set up namespace association. */
16027 /* Import the contents of the inline namespace. */
16031 }
16035 /* Parse the body of the namespace. */
16041 /* Finish the namespace. */
16043 /* Look for the final `}'. */
16045 }
16047 /* Parse a namespace-body.
16049 namespace-body:
16050 declaration-seq [opt] */
16052 static void
16054 {
16056 }
16058 /* Parse a namespace-alias-definition.
16060 namespace-alias-definition:
16061 namespace identifier = qualified-namespace-specifier ; */
16063 static void
16065 {
16066 tree identifier;
16067 tree namespace_specifier;
16071 /* Look for the `namespace' keyword. */
16073 /* Look for the identifier. */
16077 /* Look for the `=' token. */
16080 {
16082 /* Skip the definition. */
16087 }
16089 /* Look for the qualified-namespace-specifier. */
16090 namespace_specifier
16092 /* Look for the `;' token. */
16095 /* Register the alias in the symbol table. */
16097 }
16099 /* Parse a qualified-namespace-specifier.
16101 qualified-namespace-specifier:
16102 :: [opt] nested-name-specifier [opt] namespace-name
16104 Returns a NAMESPACE_DECL corresponding to the specified
16105 namespace. */
16107 static tree
16109 {
16110 /* Look for the optional `::'. */
16114 /* Look for the optional nested-name-specifier. */
16122 }
16124 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16125 access declaration.
16127 using-declaration:
16128 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16129 using :: unqualified-id ;
16131 access-declaration:
16132 qualified-id ;
16134 */
16136 static bool
16139 {
16143 tree decl;
16144 tree identifier;
16145 tree qscope;
16150 {
16153 }
16154 else
16155 {
16156 /* Look for the `using' keyword. */
16159 /* Peek at the next token. */
16161 /* See if it's `typename'. */
16163 {
16164 /* Remember that we've seen it. */
16166 /* Consume the `typename' token. */
16168 }
16169 }
16171 /* Look for the optional global scope qualification. */
16172 global_scope_p
16177 /* If we saw `typename', or didn't see `::', then there must be a
16178 nested-name-specifier present. */
16180 {
16186 {
16189 }
16190 }
16191 /* Otherwise, we could be in either of the two productions. In that
16192 case, treat the nested-name-specifier as optional. */
16193 else
16205 /* Something has already gone wrong; there's no need to parse
16206 further. Since an error has occurred, the return value of
16207 cp_parser_parse_definitely will be false, as required. */
16211 /* Parse the unqualified-id. */
16219 {
16224 }
16226 /* The function we call to handle a using-declaration is different
16227 depending on what scope we are in. */
16229 ;
16232 /* [namespace.udecl]
16234 A using declaration shall not name a template-id. */
16237 else
16238 {
16240 {
16241 /* Create the USING_DECL. */
16248 {
16251 }
16252 else
16253 /* Add it to the list of members in this class. */
16255 }
16256 else
16257 {
16259 identifier,
16266 {
16269 }
16272 else
16274 }
16275 }
16277 /* Look for the final `;'. */
16282 "access declarations are deprecated "
16283 "in favour of using-declarations; "
16287 }
16289 /* Parse an alias-declaration.
16291 alias-declaration:
16292 using identifier attribute-specifier-seq [opt] = type-id */
16294 static tree
16296 {
16298 location_t id_location;
16300 cp_decl_specifier_seq decl_specs;
16304 /* Look for the `using' keyword. */
16305 cp_token *using_token
16327 /* Now we are going to parse the type-id of the declaration. */
16329 /*
16330 [dcl.type]/3 says:
16332 "A type-specifier-seq shall not define a class or enumeration
16333 unless it appears in the type-id of an alias-declaration (7.1.3) that
16334 is not the declaration of a template-declaration."
16336 In other words, if we currently are in an alias template, the
16337 type-id should not define a type.
16339 So let's set parser->type_definition_forbidden_message in that
16340 case; cp_parser_check_type_definition (called by
16341 cp_parser_class_specifier) will then emit an error if a type is
16342 defined in the type-id. */
16344 {
16348 }
16352 /* Restore the error message if need be. */
16358 {
16361 }
16363 /* A typedef-name can also be introduced by an alias-declaration. The
16364 identifier following the using keyword becomes a typedef-name. It has
16365 the same semantics as if it were introduced by the typedef
16366 specifier. In particular, it does not define a new type and it shall
16367 not appear in the type-id. */
16372 {
16375 ds_attribute,
16376 attrs_token);
16377 }
16379 ds_typedef,
16380 using_token);
16382 ds_alias,
16383 using_token);
16392 else
16403 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16404 added into the symbol table; otherwise, return the TYPE_DECL. */
16408 {
16412 }
16415 }
16417 /* Parse a using-directive.
16419 using-directive:
16420 using namespace :: [opt] nested-name-specifier [opt]
16421 namespace-name ; */
16423 static void
16425 {
16426 tree namespace_decl;
16427 tree attribs;
16429 /* Look for the `using' keyword. */
16431 /* And the `namespace' keyword. */
16433 /* Look for the optional `::' operator. */
16435 /* And the optional nested-name-specifier. */
16441 /* Get the namespace being used. */
16443 /* And any specified attributes. */
16445 /* Update the symbol table. */
16447 /* Look for the final `;'. */
16449 }
16451 /* Parse an asm-definition.
16453 asm-definition:
16454 asm ( string-literal ) ;
16456 GNU Extension:
16458 asm-definition:
16459 asm volatile [opt] ( string-literal ) ;
16460 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16461 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16462 : asm-operand-list [opt] ) ;
16463 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16464 : asm-operand-list [opt]
16465 : asm-clobber-list [opt] ) ;
16466 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16467 : asm-clobber-list [opt]
16468 : asm-goto-list ) ; */
16470 static void
16472 {
16473 tree string;
16478 tree asm_stmt;
16486 /* Look for the `asm' keyword. */
16488 /* See if the next token is `volatile'. */
16491 {
16492 /* Remember that we saw the `volatile' keyword. */
16494 /* Consume the token. */
16496 }
16500 {
16501 /* Remember that we saw the `goto' keyword. */
16503 /* Consume the token. */
16505 }
16506 /* Look for the opening `('. */
16509 /* Look for the string. */
16512 {
16516 }
16518 /* If we're allowing GNU extensions, check for the extended assembly
16519 syntax. Unfortunately, the `:' tokens need not be separated by
16520 a space in C, and so, for compatibility, we tolerate that here
16521 too. Doing that means that we have to treat the `::' operator as
16522 two `:' tokens. */
16527 {
16532 /* The extended syntax was used. */
16535 /* Look for outputs. */
16537 {
16538 /* Consume the `:'. */
16540 /* Parse the output-operands. */
16542 CPP_COLON)
16544 CPP_SCOPE)
16546 CPP_CLOSE_PAREN)
16552 }
16553 /* If the next token is `::', there are no outputs, and the
16554 next token is the beginning of the inputs. */
16556 /* The inputs are coming next. */
16559 /* Look for inputs. */
16562 {
16563 /* Consume the `:' or `::'. */
16565 /* Parse the output-operands. */
16567 CPP_COLON)
16569 CPP_SCOPE)
16571 CPP_CLOSE_PAREN))
16576 }
16578 /* The clobbers are coming next. */
16581 /* Look for clobbers. */
16584 {
16586 /* Consume the `:' or `::'. */
16588 /* Parse the clobbers. */
16590 CPP_COLON)
16592 CPP_CLOSE_PAREN))
16594 }
16597 /* The labels are coming next. */
16600 /* Look for labels. */
16603 {
16605 /* Consume the `:' or `::'. */
16607 /* Parse the labels. */
16609 }
16613 }
16617 /* Look for the closing `)'. */
16625 {
16626 /* Create the ASM_EXPR. */
16628 {
16631 /* If the extended syntax was not used, mark the ASM_EXPR. */
16633 {
16639 }
16640 }
16641 else
16643 }
16644 }
16646 /* Declarators [gram.dcl.decl] */
16648 /* Parse an init-declarator.
16650 init-declarator:
16651 declarator initializer [opt]
16653 GNU Extension:
16655 init-declarator:
16656 declarator asm-specification [opt] attributes [opt] initializer [opt]
16658 function-definition:
16659 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16660 function-body
16661 decl-specifier-seq [opt] declarator function-try-block
16663 GNU Extension:
16665 function-definition:
16666 __extension__ function-definition
16668 TM Extension:
16670 function-definition:
16671 decl-specifier-seq [opt] declarator function-transaction-block
16673 The DECL_SPECIFIERS apply to this declarator. Returns a
16674 representation of the entity declared. If MEMBER_P is TRUE, then
16675 this declarator appears in a class scope. The new DECL created by
16676 this declarator is returned.
16678 The CHECKS are access checks that should be performed once we know
16679 what entity is being declared (and, therefore, what classes have
16680 befriended it).
16682 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16683 for a function-definition here as well. If the declarator is a
16684 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16685 be TRUE upon return. By that point, the function-definition will
16686 have been completely parsed.
16688 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16689 is FALSE.
16691 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16692 parsed declaration if it is an uninitialized single declarator not followed
16693 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16694 if present, will not be consumed. If returned, this declarator will be
16695 created with SD_INITIALIZED but will not call cp_finish_decl. */
16697 static tree
16706 {
16710 tree prefix_attributes;
16712 tree asm_specification;
16713 tree initializer;
16715 tree scope;
16717 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16718 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16719 "(...)". */
16729 /* Gather the attributes that were provided with the
16730 decl-specifiers. */
16733 /* Assume that this is not the declarator for a function
16734 definition. */
16738 /* Default arguments are only permitted for function parameters. */
16742 /* Defer access checks while parsing the declarator; we cannot know
16743 what names are accessible until we know what is being
16744 declared. */
16747 /* Parse the declarator. */
16749 declarator
16754 /* Gather up the deferred checks. */
16759 /* If the DECLARATOR was erroneous, there's no need to go
16760 further. */
16764 /* Check that the number of template-parameter-lists is OK. */
16774 /* Figure out what scope the entity declared by the DECLARATOR is
16775 located in. `grokdeclarator' sometimes changes the scope, so
16776 we compute it now. */
16779 /* Perform any lookups in the declared type which were thought to be
16780 dependent, but are not in the scope of the declarator. */
16781 decl_specifiers->type
16784 /* If we're allowing GNU extensions, look for an
16785 asm-specification. */
16787 {
16788 /* Look for an asm-specification. */
16791 }
16792 else
16795 /* Look for attributes. */
16799 /* Peek at the next token. */
16805 {
16806 /* Check to see if the token indicates the start of a
16807 function-definition. */
16809 {
16811 {
16812 /* If a function-definition should not appear here, issue an
16813 error message. */
16817 }
16819 location_t func_brace_location
16822 /* Neither attributes nor an asm-specification are allowed
16823 on a function-definition. */
16826 "an asm-specification is not allowed "
16830 "attributes are not allowed "
16832 /* This is a function-definition. */
16835 /* Parse the function definition. */
16838 decl_specifiers,
16839 declarator,
16840 prefix_attributes);
16841 else
16842 decl =
16843 (cp_parser_function_definition_from_specifiers_and_declarator
16847 {
16848 /* This is where the prologue starts... */
16851 }
16854 }
16855 }
16857 {
16858 /* A non-template declaration involving a function parameter list
16859 containing an implicit template parameter will be made into a
16860 template. If the resulting declaration is not going to be an
16861 actual function then finish the template scope here to prevent it.
16862 An error message will be issued once we have a decl to talk about.
16864 FIXME probably we should do type deduction rather than create an
16865 implicit template, but the standard currently doesn't allow it. */
16868 }
16870 /* [dcl.dcl]
16872 Only in function declarations for constructors, destructors, and
16873 type conversions can the decl-specifier-seq be omitted.
16875 We explicitly postpone this check past the point where we handle
16876 function-definitions because we tolerate function-definitions
16877 that are missing their return types in some modes. */
16879 {
16883 }
16885 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16889 {
16897 {
16903 }
16904 }
16905 else
16906 {
16907 /* If the init-declarator isn't initialized and isn't followed by a
16908 `,' or `;', it's not a valid init-declarator. */
16911 {
16914 else
16915 {
16918 }
16919 }
16922 }
16924 /* Because start_decl has side-effects, we should only call it if we
16925 know we're going ahead. By this point, we know that we cannot
16926 possibly be looking at any other construct. */
16929 /* Enter the newly declared entry in the symbol table. If we're
16930 processing a declaration in a class-specifier, we wait until
16931 after processing the initializer. */
16933 {
16940 /* Adjust location of decl if declarator->id_loc is more appropriate:
16941 set, and decl wasn't merged with another decl, in which case its
16942 location would be different from input_location, and more accurate. */
16947 }
16949 /* Enter the SCOPE. That way unqualified names appearing in the
16950 initializer will be looked up in SCOPE. */
16953 /* Perform deferred access control checks, now that we know in which
16954 SCOPE the declared entity resides. */
16956 {
16959 /* If the entity being declared is a function, pretend that we
16960 are in its scope. If it is a `friend', it may have access to
16961 things that would not otherwise be accessible. */
16963 {
16966 }
16968 /* Perform access checks for template parameters. */
16971 /* Perform the access control checks for the declarator and the
16972 decl-specifiers. */
16975 /* Restore the saved value. */
16978 }
16980 /* Parse the initializer. */
16985 {
16987 {
16991 else
16992 {
16993 /* If the declaration was erroneous, we don't really
16994 know what the user intended, so just silently
16995 consume the initializer. */
17003 }
17004 }
17005 else
17006 {
17007 /* We want to record the extra mangling scope for in-class
17008 initializers of class members and initializers of static data
17009 member templates. The former involves deferring
17010 parsing of the initializer until end of class as with default
17011 arguments. So right here we only handle the latter. */
17021 }
17022 }
17024 /* The old parser allows attributes to appear after a parenthesized
17025 initializer. Mark Mitchell proposed removing this functionality
17026 on the GCC mailing lists on 2002-08-13. This parser accepts the
17027 attributes -- but ignores them. */
17034 /* And now complain about a non-function implicit template. */
17039 /* For an in-class declaration, use `grokfield' to create the
17040 declaration. */
17042 {
17044 {
17047 }
17055 }
17057 /* Finish processing the declaration. But, skip member
17058 declarations. */
17060 {
17063 asm_specification,
17064 /* If the initializer is in parentheses, then this is
17065 a direct-initialization, which means that an
17066 `explicit' constructor is OK. Otherwise, an
17067 `explicit' constructor cannot be used. */
17070 }
17073 /* Core issue #226 (C++0x only): A default template-argument
17074 shall not be specified in a friend class template
17075 declaration. */
17084 {
17087 else
17089 }
17092 }
17094 /* Parse a declarator.
17096 declarator:
17097 direct-declarator
17098 ptr-operator declarator
17100 abstract-declarator:
17101 ptr-operator abstract-declarator [opt]
17102 direct-abstract-declarator
17104 GNU Extensions:
17106 declarator:
17107 attributes [opt] direct-declarator
17108 attributes [opt] ptr-operator declarator
17110 abstract-declarator:
17111 attributes [opt] ptr-operator abstract-declarator [opt]
17112 attributes [opt] direct-abstract-declarator
17114 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17115 detect constructor, destructor or conversion operators. It is set
17116 to -1 if the declarator is a name, and +1 if it is a
17117 function. Otherwise it is set to zero. Usually you just want to
17118 test for >0, but internally the negative value is used.
17120 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17121 a decl-specifier-seq unless it declares a constructor, destructor,
17122 or conversion. It might seem that we could check this condition in
17123 semantic analysis, rather than parsing, but that makes it difficult
17124 to handle something like `f()'. We want to notice that there are
17125 no decl-specifiers, and therefore realize that this is an
17126 expression, not a declaration.)
17128 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17129 the declarator is a direct-declarator of the form "(...)".
17131 MEMBER_P is true iff this declarator is a member-declarator.
17133 FRIEND_P is true iff this declarator is a friend. */
17137 cp_parser_declarator_kind dcl_kind,
17141 {
17144 cp_cv_quals cv_quals;
17145 tree class_type;
17148 /* Assume this is not a constructor, destructor, or type-conversion
17149 operator. */
17156 /* Check for the ptr-operator production. */
17158 /* Parse the ptr-operator. */
17164 /* If that worked, then we have a ptr-operator. */
17166 {
17167 /* If a ptr-operator was found, then this declarator was not
17168 parenthesized. */
17171 /* The dependent declarator is optional if we are parsing an
17172 abstract-declarator. */
17176 /* Parse the dependent declarator. */
17181 friend_p);
17183 /* If we are parsing an abstract-declarator, we must handle the
17184 case where the dependent declarator is absent. */
17189 declarator = cp_parser_make_indirect_declarator
17191 }
17192 /* Everything else is a direct-declarator. */
17193 else
17194 {
17197 CPP_OPEN_PAREN);
17199 ctor_dtor_or_conv_p,
17201 }
17206 }
17208 /* Parse a direct-declarator or direct-abstract-declarator.
17210 direct-declarator:
17211 declarator-id
17212 direct-declarator ( parameter-declaration-clause )
17213 cv-qualifier-seq [opt]
17214 ref-qualifier [opt]
17215 exception-specification [opt]
17216 direct-declarator [ constant-expression [opt] ]
17217 ( declarator )
17219 direct-abstract-declarator:
17220 direct-abstract-declarator [opt]
17221 ( parameter-declaration-clause )
17222 cv-qualifier-seq [opt]
17223 ref-qualifier [opt]
17224 exception-specification [opt]
17225 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17226 ( abstract-declarator )
17228 Returns a representation of the declarator. DCL_KIND is
17229 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17230 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17231 we are parsing a direct-declarator. It is
17232 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17233 of ambiguity we prefer an abstract declarator, as per
17234 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17235 as for cp_parser_declarator. */
17239 cp_parser_declarator_kind dcl_kind,
17242 {
17252 {
17253 /* Peek at the next token. */
17256 {
17257 /* This is either a parameter-declaration-clause, or a
17258 parenthesized declarator. When we know we are parsing a
17259 named declarator, it must be a parenthesized declarator
17260 if FIRST is true. For instance, `(int)' is a
17261 parameter-declaration-clause, with an omitted
17262 direct-abstract-declarator. But `((*))', is a
17263 parenthesized abstract declarator. Finally, when T is a
17264 template parameter `(T)' is a
17265 parameter-declaration-clause, and not a parenthesized
17266 named declarator.
17268 We first try and parse a parameter-declaration-clause,
17269 and then try a nested declarator (if FIRST is true).
17271 It is not an error for it not to be a
17272 parameter-declaration-clause, even when FIRST is
17273 false. Consider,
17275 int i (int);
17276 int i (3);
17278 The first is the declaration of a function while the
17279 second is the definition of a variable, including its
17280 initializer.
17282 Having seen only the parenthesis, we cannot know which of
17283 these two alternatives should be selected. Even more
17284 complex are examples like:
17286 int i (int (a));
17287 int i (int (3));
17289 The former is a function-declaration; the latter is a
17290 variable initialization.
17292 Thus again, we try a parameter-declaration-clause, and if
17293 that fails, we back out and return. */
17296 {
17297 tree params;
17300 /* In a member-declarator, the only valid interpretation
17301 of a parenthesis is the start of a
17302 parameter-declaration-clause. (It is invalid to
17303 initialize a static data member with a parenthesized
17304 initializer; only the "=" form of initialization is
17305 permitted.) */
17309 /* Consume the `('. */
17312 {
17313 /* If this is going to be an abstract declarator, we're
17314 in a declarator and we can't have default args. */
17317 }
17321 /* Parse the parameter-declaration-clause. */
17324 /* Consume the `)'. */
17327 /* If all went well, parse the cv-qualifier-seq,
17328 ref-qualifier and the exception-specification. */
17330 {
17331 cp_cv_quals cv_quals;
17332 cp_virt_specifiers virt_specifiers;
17333 cp_ref_qualifier ref_qual;
17334 tree exception_specification;
17335 tree late_return;
17336 tree attrs;
17346 /* Parse the cv-qualifier-seq. */
17348 /* Parse the ref-qualifier. */
17350 /* And the exception-specification. */
17351 exception_specification
17356 /* In here, we handle cases where attribute is used after
17357 the function declaration. For example:
17358 void func (int x) __attribute__((vector(..))); */
17361 {
17365 CPP_SEMICOLON)
17367 CPP_OPEN_BRACE))
17370 ;
17371 else
17373 }
17374 late_return = (cp_parser_late_return_type_opt
17379 /* Parse the virt-specifier-seq. */
17382 /* Create the function-declarator. */
17384 params,
17385 cv_quals,
17386 virt_specifiers,
17387 ref_qual,
17388 exception_specification,
17389 late_return);
17391 /* Any subsequent parameter lists are to do with
17392 return type, so are not those of the declared
17393 function. */
17395 }
17397 /* Remove the function parms from scope. */
17401 /* Repeat the main loop. */
17403 }
17405 /* If this is the first, we can try a parenthesized
17406 declarator. */
17408 {
17414 /* Consume the `('. */
17416 /* Parse the nested declarator. */
17419 declarator
17425 /* Expect a `)'. */
17432 }
17433 /* Otherwise, we must be done. */
17434 else
17436 }
17440 {
17441 /* Parse an array-declarator. */
17450 /* Consume the `['. */
17452 /* Peek at the next token. */
17454 /* If the next token is `]', then there is no
17455 constant-expression. */
17457 {
17459 bounds
17469 {
17470 /* Normally, the array bound must be an integral constant
17471 expression. However, as an extension, we allow VLAs
17472 in function scopes as long as they aren't part of a
17473 parameter declaration. */
17477 }
17480 {
17481 /* Remember this wasn't a constant-expression. */
17484 }
17485 }
17486 else
17488 /* Look for the closing `]'. */
17490 {
17493 }
17498 }
17500 {
17501 {
17502 tree qualifying_scope;
17503 tree unqualified_name;
17504 tree attrs;
17505 special_function_kind sfk;
17510 /* Parse a declarator-id */
17513 {
17516 /* If we see an ellipsis, we should be looking at a
17517 parameter pack. */
17519 {
17520 /* Consume the `...' */
17524 }
17525 }
17528 unqualified_name
17532 {
17536 {
17537 /* Check whether an error occurred. */
17540 /* We already consumed the ellipsis to mark a
17541 parameter pack, but we have no way to report it,
17542 so abort the tentative parse. We will be exiting
17543 immediately anyway. */
17545 }
17546 else
17552 && (qualifying_scope
17554 {
17557 }
17558 }
17563 {
17568 }
17574 {
17575 /* In the declaration of a member of a template class
17576 outside of the class itself, the SCOPE will sometimes
17577 be a TYPENAME_TYPE. For example, given:
17579 template <typename T>
17580 int S<T>::R::i = 3;
17582 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17583 this context, we must resolve S<T>::R to an ordinary
17584 type, rather than a typename type.
17586 The reason we normally avoid resolving TYPENAME_TYPEs
17587 is that a specialization of `S' might render
17588 `S<T>::R' not a type. However, if `S' is
17589 specialized, then this `i' will not be used, so there
17590 is no harm in resolving the types here. */
17591 tree type;
17593 /* Resolve the TYPENAME_TYPE. */
17596 /* If that failed, the declarator is invalid. */
17598 {
17601 "cannot define member of dependent typedef "
17603 else
17608 }
17610 }
17615 {
17616 tree class_type;
17621 else
17625 {
17628 {
17631 {
17635 "use %<%T::%D%> instead of %<%T::%D%> to "
17637 class_type,
17642 }
17643 else
17645 }
17646 else
17647 {
17648 /* We do not attempt to print the declarator
17649 here because we do not have enough
17650 information about its original syntactic
17651 form. */
17655 }
17656 }
17659 {
17665 for an anonymous type, even if the type
17666 got a name for linkage purposes. */
17668 /* Handle correctly (c++/19200):
17670 struct S {
17671 struct T{};
17672 friend void S(T);
17673 };
17675 and also:
17677 namespace N {
17678 void S();
17679 }
17681 struct S {
17682 friend void N::S();
17683 }; */
17684 && !(friend_p
17687 class_type))
17688 {
17691 }
17699 }
17700 }
17702 unqualified_name,
17703 sfk);
17710 }
17712 handle_declarator:;
17715 {
17716 /* Any names that appear after the declarator-id for a
17717 member are looked up in the containing scope. */
17719 {
17720 /* But declarations with qualified-ids can't appear in a
17721 function. */
17725 }
17727 }
17731 /* Default args are only allowed on function
17732 declarations. */
17734 else
17738 }
17739 /* We're done. */
17740 else
17742 }
17744 /* For an abstract declarator, we might wind up with nothing at this
17745 point. That's an error; the declarator is not optional. */
17749 /* If we entered a scope, we must exit it now. */
17757 }
17759 /* Parse a ptr-operator.
17761 ptr-operator:
17762 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17763 * cv-qualifier-seq [opt]
17764 &
17765 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17766 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17768 GNU Extension:
17770 ptr-operator:
17771 & cv-qualifier-seq [opt]
17773 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17774 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17775 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17776 filled in with the TYPE containing the member. *CV_QUALS is
17777 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17778 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17779 Note that the tree codes returned by this function have nothing
17780 to do with the types of trees that will be eventually be created
17781 to represent the pointer or reference type being parsed. They are
17782 just constants with suggestive names. */
17783 static enum tree_code
17788 {
17793 /* Assume that it's not a pointer-to-member. */
17795 /* And that there are no cv-qualifiers. */
17798 /* Peek at the next token. */
17801 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17811 {
17812 /* Consume the `*', `&' or `&&'. */
17815 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17816 `&', if we are allowing GNU extensions. (The only qualifier
17817 that can legally appear after `&' is `restrict', but that is
17818 enforced during semantic analysis. */
17826 }
17827 else
17828 {
17829 /* Try the pointer-to-member case. */
17831 /* Look for the optional `::' operator. */
17834 /* Look for the nested-name specifier. */
17841 /* If we found it, and the next token is a `*', then we are
17842 indeed looking at a pointer-to-member operator. */
17845 {
17846 /* Indicate that the `*' operator was used. */
17854 else
17855 {
17856 /* The type of which the member is a member is given by the
17857 current SCOPE. */
17859 /* The next name will not be qualified. */
17863 /* Look for optional c++11 attributes. */
17867 /* Look for the optional cv-qualifier-seq. */
17869 }
17870 }
17871 /* If that didn't work we don't have a ptr-operator. */
17874 }
17877 }
17879 /* Parse an (optional) cv-qualifier-seq.
17881 cv-qualifier-seq:
17882 cv-qualifier cv-qualifier-seq [opt]
17884 cv-qualifier:
17885 const
17886 volatile
17888 GNU Extension:
17890 cv-qualifier:
17891 __restrict__
17893 Returns a bitmask representing the cv-qualifiers. */
17895 static cp_cv_quals
17897 {
17901 {
17903 cp_cv_quals cv_qualifier;
17905 /* Peek at the next token. */
17907 /* See if it's a cv-qualifier. */
17909 {
17925 }
17931 {
17934 }
17935 else
17936 {
17939 }
17940 }
17943 }
17945 /* Parse an (optional) ref-qualifier
17947 ref-qualifier:
17948 &
17949 &&
17951 Returns cp_ref_qualifier representing ref-qualifier. */
17953 static cp_ref_qualifier
17955 {
17958 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17963 {
17968 {
17980 }
17985 {
17988 }
17989 else
17990 {
17993 }
17994 }
17997 }
17999 /* Parse an (optional) virt-specifier-seq.
18001 virt-specifier-seq:
18002 virt-specifier virt-specifier-seq [opt]
18004 virt-specifier:
18005 override
18006 final
18008 Returns a bitmask representing the virt-specifiers. */
18010 static cp_virt_specifiers
18012 {
18016 {
18018 cp_virt_specifiers virt_specifier;
18020 /* Peek at the next token. */
18022 /* See if it's a virt-specifier-qualifier. */
18026 {
18029 }
18031 {
18034 }
18036 {
18038 }
18039 else
18043 {
18046 }
18047 else
18048 {
18051 }
18052 }
18054 }
18056 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18057 is in scope even though it isn't real. */
18059 void
18061 {
18062 tree this_parm;
18065 {
18066 /* We don't clear this between NSDMIs. Is it already what we want? */
18071 }
18074 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18076 current_class_ref
18079 }
18081 /* Return true iff our current scope is a non-static data member
18082 initializer. */
18084 bool
18086 {
18087 /* We recognize NSDMI context by the context-less 'this' pointer set up
18088 by the function above. */
18092 }
18094 /* Parse a late-specified return type, if any. This is not a separate
18095 non-terminal, but part of a function declarator, which looks like
18097 -> trailing-type-specifier-seq abstract-declarator(opt)
18099 Returns the type indicated by the type-id.
18101 In addition to this this parses any queued up omp declare simd
18102 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18104 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18105 function. */
18107 static tree
18109 cp_cv_quals quals)
18110 {
18114 && declarator
18120 /* Peek at the next token. */
18122 /* A late-specified return type is indicated by an initial '->'. */
18129 {
18130 /* DR 1207: 'this' is in scope in the trailing return type. */
18132 }
18135 {
18136 /* Consume the ->. */
18140 }
18143 declarator->std_attributes
18147 declarator->std_attributes
18152 {
18155 }
18158 }
18160 /* Parse a declarator-id.
18162 declarator-id:
18163 id-expression
18164 :: [opt] nested-name-specifier [opt] type-name
18166 In the `id-expression' case, the value returned is as for
18167 cp_parser_id_expression if the id-expression was an unqualified-id.
18168 If the id-expression was a qualified-id, then a SCOPE_REF is
18169 returned. The first operand is the scope (either a NAMESPACE_DECL
18170 or TREE_TYPE), but the second is still just a representation of an
18171 unqualified-id. */
18173 static tree
18175 {
18176 tree id;
18177 /* The expression must be an id-expression. Assume that qualified
18178 names are the names of types so that:
18180 template <class T>
18181 int S<T>::R::i = 3;
18183 will work; we must treat `S<T>::R' as the name of a type.
18184 Similarly, assume that qualified names are templates, where
18185 required, so that:
18187 template <class T>
18188 int S<T>::R<T>::i = 3;
18190 will work, too. */
18196 optional_p);
18200 }
18202 /* Parse a type-id.
18204 type-id:
18205 type-specifier-seq abstract-declarator [opt]
18207 Returns the TYPE specified. */
18209 static tree
18212 {
18213 cp_decl_specifier_seq type_specifier_seq;
18216 /* Parse the type-specifier-seq. */
18218 is_trailing_return,
18223 /* There might or might not be an abstract declarator. */
18225 /* Look for the declarator. */
18226 abstract_declarator
18231 /* Check to see if there really was a declarator. */
18236 /* None of the valid uses of 'auto' in C++14 involve the type-id
18237 nonterminal, but it is valid in a trailing-return-type. */
18240 {
18241 /* A type-id with type 'auto' is only ok if the abstract declarator
18242 is a function declarator with a late-specified return type. */
18247 else
18248 {
18251 }
18252 }
18255 is_template_arg);
18256 }
18259 {
18261 }
18264 {
18265 tree r;
18267 parser->type_definition_forbidden_message
18272 {
18275 }
18277 }
18280 {
18282 }
18284 /* Parse a type-specifier-seq.
18286 type-specifier-seq:
18287 type-specifier type-specifier-seq [opt]
18289 GNU extension:
18291 type-specifier-seq:
18292 attributes type-specifier-seq [opt]
18294 If IS_DECLARATION is true, we are at the start of a "condition" or
18295 exception-declaration, so we might be followed by a declarator-id.
18297 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18298 i.e. we've just seen "->".
18300 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18302 static void
18307 {
18312 /* Clear the TYPE_SPECIFIER_SEQ. */
18315 /* In the context of a trailing return type, enum E { } is an
18316 elaborated-type-specifier followed by a function-body, not an
18317 enum-specifier. */
18321 /* Parse the type-specifiers and attributes. */
18323 {
18324 tree type_specifier;
18327 /* Check for attributes first. */
18329 {
18334 }
18336 /* record the token of the beginning of the type specifier seq,
18337 for error reporting purposes*/
18341 /* Look for the type-specifier. */
18343 flags,
18344 type_specifier_seq,
18346 NULL,
18349 {
18350 /* If the first type-specifier could not be found, this is not a
18351 type-specifier-seq at all. */
18353 {
18354 /* Set in_declarator_p to avoid skipping to the semicolon. */
18366 }
18367 /* If subsequent type-specifiers could not be found, the
18368 type-specifier-seq is complete. */
18370 }
18373 /* The standard says that a condition can be:
18375 type-specifier-seq declarator = assignment-expression
18377 However, given:
18379 struct S {};
18380 if (int S = ...)
18382 we should treat the "S" as a declarator, not as a
18383 type-specifier. The standard doesn't say that explicitly for
18384 type-specifier-seq, but it does say that for
18385 decl-specifier-seq in an ordinary declaration. Perhaps it
18386 would be clearer just to allow a decl-specifier-seq here, and
18387 then add a semantic restriction that if any decl-specifiers
18388 that are not type-specifiers appear, the program is invalid. */
18391 }
18392 }
18394 /* Return whether the function currently being declared has an associated
18395 template parameter list. */
18397 static bool
18399 {
18412 }
18414 /* Parse a parameter-declaration-clause.
18416 parameter-declaration-clause:
18417 parameter-declaration-list [opt] ... [opt]
18418 parameter-declaration-list , ...
18420 Returns a representation for the parameter declarations. A return
18421 value of NULL indicates a parameter-declaration-clause consisting
18422 only of an ellipsis. */
18424 static tree
18426 {
18427 tree parameters;
18436 parser->auto_is_implicit_function_template_parm_p
18438 }
18444 && !processing_template_parmlist
18450 /* Peek at the next token. */
18452 /* Check for trivial parameter-declaration-clauses. */
18454 {
18455 /* Consume the `...' token. */
18458 }
18460 /* There are no parameters. */
18461 {
18462 #ifndef NO_IMPLICIT_EXTERN_C
18467 else
18468 #endif
18470 }
18471 /* Check for `(void)', too, which is a special case. */
18475 {
18476 /* Consume the `void' token. */
18478 /* There are no parameters. */
18480 }
18482 /* Parse the parameter-declaration-list. */
18484 /* If a parse error occurred while parsing the
18485 parameter-declaration-list, then the entire
18486 parameter-declaration-clause is erroneous. */
18490 /* Peek at the next token. */
18492 /* If it's a `,', the clause should terminate with an ellipsis. */
18494 {
18495 /* Consume the `,'. */
18497 /* Expect an ellipsis. */
18498 ellipsis_p
18500 }
18501 /* It might also be `...' if the optional trailing `,' was
18502 omitted. */
18504 {
18505 /* Consume the `...' token. */
18507 /* And remember that we saw it. */
18509 }
18510 else
18513 /* Finish the parameter list. */
18518 }
18520 /* Parse a parameter-declaration-list.
18522 parameter-declaration-list:
18523 parameter-declaration
18524 parameter-declaration-list , parameter-declaration
18526 Returns a representation of the parameter-declaration-list, as for
18527 cp_parser_parameter_declaration_clause. However, the
18528 `void_list_node' is never appended to the list. Upon return,
18529 *IS_ERROR will be true iff an error occurred. */
18531 static tree
18533 {
18539 /* Assume all will go well. */
18541 /* The special considerations that apply to a function within an
18542 unbraced linkage specifications do not apply to the parameters
18543 to the function. */
18544 saved_in_unbraced_linkage_specification_p
18548 /* Look for more parameters. */
18550 {
18558 /* Parse the parameter. */
18559 parameter
18564 /* We don't know yet if the enclosing context is deprecated, so wait
18565 and warn in grokparms if appropriate. */
18569 {
18570 /* If a function parameter pack was specified and an implicit template
18571 parameter was introduced during cp_parser_parameter_declaration,
18572 change any implicit parameters introduced into packs. */
18576 {
18584 }
18588 PARM,
18591 }
18595 /* If a parse error occurred parsing the parameter declaration,
18596 then the entire parameter-declaration-list is erroneous. */
18598 {
18602 }
18612 {
18616 }
18618 /* Add the new parameter to the list. */
18622 /* Peek at the next token. */
18625 /* These are for Objective-C++ */
18628 /* The parameter-declaration-list is complete. */
18631 {
18634 /* Peek at the next token. */
18636 /* If it's an ellipsis, then the list is complete. */
18639 /* Otherwise, there must be more parameters. Consume the
18640 `,'. */
18642 /* When parsing something like:
18644 int i(float f, double d)
18646 we can tell after seeing the declaration for "f" that we
18647 are not looking at an initialization of a variable "i",
18648 but rather at the declaration of a function "i".
18650 Due to the fact that the parsing of template arguments
18651 (as specified to a template-id) requires backtracking we
18652 cannot use this technique when inside a template argument
18653 list. */
18657 /* However, a parameter-declaration of the form
18658 "float(f)" (which is a valid declaration of a
18659 parameter "f") can also be interpreted as an
18660 expression (the conversion of "f" to "float"). */
18663 }
18664 else
18665 {
18673 }
18674 }
18676 parser->in_unbraced_linkage_specification_p
18679 /* Reset implicit_template_scope if we are about to leave the function
18680 parameter list that introduced it. Note that for out-of-line member
18681 definitions, there will be one or more class scopes before we get to
18682 the template parameter scope. */
18686 {
18690 {
18693 }
18694 }
18697 }
18699 /* Parse a parameter declaration.
18701 parameter-declaration:
18702 decl-specifier-seq ... [opt] declarator
18703 decl-specifier-seq declarator = assignment-expression
18704 decl-specifier-seq ... [opt] abstract-declarator [opt]
18705 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18707 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18708 declares a template parameter. (In that case, a non-nested `>'
18709 token encountered during the parsing of the assignment-expression
18710 is not interpreted as a greater-than operator.)
18712 Returns a representation of the parameter, or NULL if an error
18713 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18714 true iff the declarator is of the form "(p)". */
18720 {
18722 cp_decl_specifier_seq decl_specifiers;
18724 tree default_argument;
18728 /* In a template parameter, `>' is not an operator.
18730 [temp.param]
18732 When parsing a default template-argument for a non-type
18733 template-parameter, the first non-nested `>' is taken as the end
18734 of the template parameter-list rather than a greater-than
18735 operator. */
18737 /* Type definitions may not appear in parameter types. */
18739 parser->type_definition_forbidden_message
18742 /* Parse the declaration-specifiers. */
18744 CP_PARSER_FLAGS_NONE,
18748 /* Complain about missing 'typename' or other invalid type names. */
18753 /* If an error occurred, there's no reason to attempt to parse the
18754 rest of the declaration. */
18756 {
18759 }
18761 /* Peek at the next token. */
18764 /* If the next token is a `)', `,', `=', `>', or `...', then there
18765 is no declarator. However, when variadic templates are enabled,
18766 there may be a declarator following `...'. */
18771 {
18775 }
18776 /* Otherwise, there should be a declarator. */
18777 else
18778 {
18782 /* After seeing a decl-specifier-seq, if the next token is not a
18783 "(", there is no possibility that the code is a valid
18784 expression. Therefore, if parsing tentatively, we commit at
18785 this point. */
18787 /* In an expression context, having seen:
18789 (int((char ...
18791 we cannot be sure whether we are looking at a
18792 function-type (taking a "char" as a parameter) or a cast
18793 of some object of type "char" to "int". */
18799 /* Parse the declarator. */
18802 CP_PARSER_DECLARATOR_EITHER,
18804 parenthesized_p,
18808 /* After the declarator, allow more attributes. */
18809 decl_specifiers.attributes
18812 }
18814 /* If the next token is an ellipsis, and we have not seen a
18815 declarator name, and the type of the declarator contains parameter
18816 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18817 a parameter pack expansion expression. Otherwise, leave the
18818 ellipsis for a C-style variadic function. */
18821 {
18832 {
18833 /* Consume the `...'. */
18837 /* Build a pack expansion type */
18840 else
18842 }
18843 }
18845 /* The restriction on defining new types applies only to the type
18846 of the parameter, not to the default argument. */
18849 /* If the next token is `=', then process a default argument. */
18851 {
18853 /* If we are defining a class, then the tokens that make up the
18854 default argument must be saved and processed later. */
18859 /* Outside of a class definition, we can just parse the
18860 assignment-expression. */
18861 else
18862 default_argument
18866 {
18869 else
18870 {
18872 "default arguments are only "
18875 }
18876 }
18880 {
18881 /* Find the name of the parameter pack. */
18888 template_parm_p
18894 else
18896 template_parm_p
18903 }
18904 }
18905 else
18909 declarator,
18910 default_argument);
18911 }
18913 /* Parse a default argument and return it.
18915 TEMPLATE_PARM_P is true if this is a default argument for a
18916 non-type template parameter. */
18917 static tree
18919 {
18925 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18926 set correctly. */
18929 /* Local variable names (and the `this' keyword) may not
18930 appear in a default argument. */
18933 /* Parse the assignment-expression. */
18938 /* The "this" pointer is not valid in a default argument. */
18940 {
18945 }
18946 default_argument
18948 /* Restore the "this" pointer. */
18950 {
18953 }
18962 }
18964 /* Parse a function-body.
18966 function-body:
18967 compound_statement */
18969 static void
18971 {
18973 }
18975 /* Parse a ctor-initializer-opt followed by a function-body. Return
18976 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18977 is true we are parsing a function-try-block. */
18979 static bool
18982 {
18990 /* Begin the function body. */
18992 /* Parse the optional ctor-initializer. */
18995 /* If we're parsing a constexpr constructor definition, we need
18996 to check that the constructor body is indeed empty. However,
18997 before we get to cp_parser_function_body lot of junk has been
18998 generated, so we can't just check that we have an empty block.
18999 Rather we take a snapshot of the outermost block, and check whether
19000 cp_parser_function_body changed its state. */
19002 {
19006 }
19007 /* Parse the function-body. */
19011 /* Finish the function body. */
19015 }
19017 /* Parse an initializer.
19019 initializer:
19020 = initializer-clause
19021 ( expression-list )
19023 Returns an expression representing the initializer. If no
19024 initializer is present, NULL_TREE is returned.
19026 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19027 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19028 set to TRUE if there is no initializer present. If there is an
19029 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19030 is set to true; otherwise it is set to false. */
19032 static tree
19035 {
19037 tree init;
19039 /* Peek at the next token. */
19042 /* Let our caller know whether or not this initializer was
19043 parenthesized. */
19045 /* Assume that the initializer is constant. */
19049 {
19050 /* Consume the `='. */
19052 /* Parse the initializer-clause. */
19054 }
19056 {
19061 non_constant_p);
19066 }
19068 {
19073 }
19074 else
19075 {
19076 /* Anything else is an error. */
19079 }
19082 }
19084 /* Parse an initializer-clause.
19086 initializer-clause:
19087 assignment-expression
19088 braced-init-list
19090 Returns an expression representing the initializer.
19092 If the `assignment-expression' production is used the value
19093 returned is simply a representation for the expression.
19095 Otherwise, calls cp_parser_braced_list. */
19097 static tree
19099 {
19100 tree initializer;
19102 /* Assume the expression is constant. */
19105 /* If it is not a `{', then we are looking at an
19106 assignment-expression. */
19108 {
19109 initializer
19112 non_constant_p);
19113 }
19114 else
19118 }
19120 /* Parse a brace-enclosed initializer list.
19122 braced-init-list:
19123 { initializer-list , [opt] }
19124 { }
19126 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19127 the elements of the initializer-list (or NULL, if the last
19128 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19129 NULL_TREE. There is no way to detect whether or not the optional
19130 trailing `,' was provided. NON_CONSTANT_P is as for
19131 cp_parser_initializer. */
19133 static tree
19135 {
19136 tree initializer;
19138 /* Consume the `{' token. */
19140 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19142 /* If it's not a `}', then there is a non-trivial initializer. */
19144 {
19145 /* Parse the initializer list. */
19148 /* A trailing `,' token is allowed. */
19151 }
19152 else
19154 /* Now, there should be a trailing `}'. */
19158 }
19160 /* Parse an initializer-list.
19162 initializer-list:
19163 initializer-clause ... [opt]
19164 initializer-list , initializer-clause ... [opt]
19166 GNU Extension:
19168 initializer-list:
19169 designation initializer-clause ...[opt]
19170 initializer-list , designation initializer-clause ...[opt]
19172 designation:
19173 . identifier =
19174 identifier :
19175 [ constant-expression ] =
19177 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19178 for the initializer. If the INDEX of the elt is non-NULL, it is the
19179 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19180 as for cp_parser_initializer. */
19184 {
19187 /* Assume all of the expressions are constant. */
19190 /* Parse the rest of the list. */
19192 {
19194 tree designator;
19195 tree initializer;
19198 /* If the next token is an identifier and the following one is a
19199 colon, we are looking at the GNU designated-initializer
19200 syntax. */
19204 {
19205 /* Warn the user that they are using an extension. */
19208 /* Consume the identifier. */
19210 /* Consume the `:'. */
19212 }
19213 /* Also handle the C99 syntax, '. id ='. */
19218 {
19219 /* Warn the user that they are using an extension. */
19222 /* Consume the `.'. */
19224 /* Consume the identifier. */
19226 /* Consume the `='. */
19228 }
19229 /* Also handle C99 array designators, '[ const ] ='. */
19233 {
19234 /* In C++11, [ could start a lambda-introducer. */
19246 }
19247 else
19250 /* Parse the initializer. */
19253 /* If any clause is non-constant, so is the entire initializer. */
19257 /* If we have an ellipsis, this is an initializer pack
19258 expansion. */
19260 {
19261 /* Consume the `...'. */
19264 /* Turn the initializer into an initializer expansion. */
19266 }
19268 /* Add it to the vector. */
19271 /* If the next token is not a comma, we have reached the end of
19272 the list. */
19276 /* Peek at the next token. */
19278 /* If the next token is a `}', then we're still done. An
19279 initializer-clause can have a trailing `,' after the
19280 initializer-list and before the closing `}'. */
19284 /* Consume the `,' token. */
19286 }
19289 }
19291 /* Classes [gram.class] */
19293 /* Parse a class-name.
19295 class-name:
19296 identifier
19297 template-id
19299 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19300 to indicate that names looked up in dependent types should be
19301 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19302 keyword has been used to indicate that the name that appears next
19303 is a template. TAG_TYPE indicates the explicit tag given before
19304 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19305 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19306 is the class being defined in a class-head.
19308 Returns the TYPE_DECL representing the class. */
19310 static tree
19318 {
19319 tree decl;
19320 tree scope;
19325 /* All class-names start with an identifier. */
19328 {
19331 }
19333 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19334 to a template-id, so we save it here. */
19339 /* Any name names a type if we're following the `typename' keyword
19340 in a qualified name where the enclosing scope is type-dependent. */
19343 /* Handle the common case (an identifier, but not a template-id)
19344 efficiently. */
19347 {
19351 /* Look for the identifier. */
19355 /* If the next token isn't an identifier, we are certainly not
19356 looking at a class-name. */
19359 /* If we know this is a type-name, there's no need to look it
19360 up. */
19363 else
19364 {
19365 tree ambiguous_decls;
19366 /* If we already know that this lookup is ambiguous, then
19367 we've already issued an error message; there's no reason
19368 to check again. */
19370 {
19373 }
19374 /* If the next token is a `::', then the name must be a type
19375 name.
19377 [basic.lookup.qual]
19379 During the lookup for a name preceding the :: scope
19380 resolution operator, object, function, and enumerator
19381 names are ignored. */
19384 /* Look up the name. */
19386 tag_type,
19389 check_dependency_p,
19393 {
19397 }
19398 }
19399 }
19400 else
19401 {
19402 /* Try a template-id. */
19404 check_dependency_p,
19405 tag_type,
19406 is_declaration);
19409 }
19413 /* If this is a typename, create a TYPENAME_TYPE. */
19415 {
19420 }
19424 /* Check to see that it is really the name of a class. */
19428 /* Situations like this:
19430 template <typename T> struct A {
19431 typename T::template X<int>::I i;
19432 };
19434 are problematic. Is `T::template X<int>' a class-name? The
19435 standard does not seem to be definitive, but there is no other
19436 valid interpretation of the following `::'. Therefore, those
19437 names are considered class-names. */
19438 {
19442 }
19446 /* In Objective-C 2.0, a classname followed by '.' starts a
19447 dot-syntax expression, and it's not a type-name. */
19459 }
19461 /* Parse a class-specifier.
19463 class-specifier:
19464 class-head { member-specification [opt] }
19466 Returns the TREE_TYPE representing the class. */
19468 static tree
19470 {
19471 tree type;
19485 /* Parse the class-head. */
19488 /* If the class-head was a semantic disaster, skip the entire body
19489 of the class. */
19491 {
19495 }
19497 /* Look for the `{'. */
19499 {
19502 }
19506 /* Issue an error message if type-definitions are forbidden here. */
19508 /* Remember that we are defining one more class. */
19510 /* Inside the class, surrounding template-parameter-lists do not
19511 apply. */
19512 saved_num_template_parameter_lists
19515 /* We are not in a function body. */
19518 /* Or in a loop. */
19521 /* Or in a switch. */
19524 /* We are not immediately inside an extern "lang" block. */
19525 saved_in_unbraced_linkage_specification_p
19529 /* Start the class. */
19531 {
19534 }
19538 /* If the type is erroneous, skip the entire body of the class. */
19540 else
19541 /* Parse the member-specification. */
19544 /* Look for the trailing `}'. */
19546 /* Look for trailing attributes to apply to this class. */
19554 /* We've finished a type definition. Check for the common syntax
19555 error of forgetting a semicolon after the definition. We need to
19556 be careful, as we can't just check for not-a-semicolon and be done
19557 with it; the user might have typed:
19559 class X { } c = ...;
19560 class X { } *p = ...;
19562 and so forth. Instead, enumerate all the possible tokens that
19563 might follow this production; if we don't see one of them, then
19564 complain and silently insert the semicolon. */
19565 {
19570 /* Don't try to parse c++11 attributes here. As per the
19571 grammar, that should be a task for
19572 cp_parser_decl_specifier_seq. */
19576 {
19587 /* While it's legal for type qualifiers and storage class
19588 specifiers to follow type definitions in the grammar, only
19589 compiler testsuites contain code like that. Assume that if
19590 we see such code, then what we're really seeing is a case
19591 like:
19593 class X { }
19594 const <type> var = ...;
19596 or
19598 class Y { }
19599 static <type> func (...) ...
19601 i.e. the qualifier or specifier applies to the next
19602 declaration. To do so, however, we need to look ahead one
19603 more token to see if *that* token is a type specifier.
19605 This code could be improved to handle:
19607 class Z { }
19608 static const <type> var = ...; */
19611 {
19614 /* Handling user-defined types here would be nice, but very
19615 tricky. */
19616 want_semicolon
19619 }
19623 }
19625 /* If we don't have a type, then something is very wrong and we
19626 shouldn't try to do anything clever. Likewise for not seeing the
19627 closing brace. */
19629 {
19630 cp_token_position prev
19641 else
19644 /* Unget one token and smash it to look as though we encountered
19645 a semicolon in the input stream. */
19650 }
19651 }
19653 /* If this class is not itself within the scope of another class,
19654 then we need to parse the bodies of all of the queued function
19655 definitions. Note that the queued functions defined in a class
19656 are not always processed immediately following the
19657 class-specifier for that class. Consider:
19659 struct A {
19660 struct B { void f() { sizeof (A); } };
19661 };
19663 If `f' were processed before the processing of `A' were
19664 completed, there would be no way to compute the size of `A'.
19665 Note that the nesting we are interested in here is lexical --
19666 not the semantic nesting given by TYPE_CONTEXT. In particular,
19667 for:
19669 struct A { struct B; };
19670 struct A::B { void f() { } };
19672 there is no need to delay the parsing of `A::B::f'. */
19674 {
19675 tree decl;
19682 /* In a first pass, parse default arguments to the functions.
19683 Then, in a second pass, parse the bodies of the functions.
19684 This two-phased approach handles cases like:
19686 struct S {
19687 void f() { g(); }
19688 void g(int i = 3);
19689 };
19691 */
19693 {
19695 /* If there are default arguments that have not yet been processed,
19696 take care of them now. */
19698 {
19703 }
19704 /* Make sure that any template parameters are in scope. */
19706 /* Parse the default argument expressions. */
19708 /* Remove any template parameters from the symbol table. */
19710 }
19712 /* Now parse any NSDMIs. */
19716 {
19718 {
19723 }
19726 }
19733 /* Now do some post-NSDMI bookkeeping. */
19739 /* Now parse the body of the functions. */
19741 {
19742 /* OpenMP UDRs need to be parsed before all other functions. */
19749 }
19750 else
19754 }
19755 else
19758 /* Put back any saved access checks. */
19761 /* Restore saved state. */
19765 parser->num_template_parameter_lists
19767 parser->in_unbraced_linkage_specification_p
19771 }
19773 static tree
19775 {
19776 tree ret;
19781 }
19783 /* Parse a class-head.
19785 class-head:
19786 class-key identifier [opt] base-clause [opt]
19787 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19788 class-key nested-name-specifier [opt] template-id
19789 base-clause [opt]
19791 class-virt-specifier:
19792 final
19794 GNU Extensions:
19795 class-key attributes identifier [opt] base-clause [opt]
19796 class-key attributes nested-name-specifier identifier base-clause [opt]
19797 class-key attributes nested-name-specifier [opt] template-id
19798 base-clause [opt]
19800 Upon return BASES is initialized to the list of base classes (or
19801 NULL, if there are none) in the same form returned by
19802 cp_parser_base_clause.
19804 Returns the TYPE of the indicated class. Sets
19805 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19806 involving a nested-name-specifier was used, and FALSE otherwise.
19808 Returns error_mark_node if this is not a class-head.
19810 Returns NULL_TREE if the class-head is syntactically valid, but
19811 semantically invalid in a way that means we should skip the entire
19812 body of the class. */
19814 static tree
19817 {
19818 tree nested_name_specifier;
19822 tree attributes;
19823 tree bases;
19833 /* Assume no nested-name-specifier will be present. */
19835 /* Assume no template parameter lists will be used in defining the
19836 type. */
19840 /* Look for the class-key. */
19845 /* Parse the attributes. */
19848 /* If the next token is `::', that is invalid -- but sometimes
19849 people do try to write:
19851 struct ::S {};
19853 Handle this gracefully by accepting the extra qualifier, and then
19854 issuing an error about it later if this really is a
19855 class-head. If it turns out just to be an elaborated type
19856 specifier, remain silent. */
19862 /* Determine the name of the class. Begin by looking for an
19863 optional nested-name-specifier. */
19865 nested_name_specifier
19871 /* If there was a nested-name-specifier, then there *must* be an
19872 identifier. */
19874 {
19876 /* Although the grammar says `identifier', it really means
19877 `class-name' or `template-name'. You are only allowed to
19878 define a class that has already been declared with this
19879 syntax.
19881 The proposed resolution for Core Issue 180 says that wherever
19882 you see `class T::X' you should treat `X' as a type-name.
19884 It is OK to define an inaccessible class; for example:
19886 class A { class B; };
19887 class A::B {};
19889 We do not know if we will see a class-name, or a
19890 template-name. We look for a class-name first, in case the
19891 class-name is a template-id; if we looked for the
19892 template-name first we would stop after the template-name. */
19897 class_type,
19901 /* If that didn't work, ignore the nested-name-specifier. */
19903 {
19909 }
19910 /* If we could not find a corresponding TYPE, treat this
19911 declaration like an unqualified declaration. */
19914 /* Otherwise, count the number of templates used in TYPE and its
19915 containing scopes. */
19916 else
19917 {
19918 tree scope;
19930 }
19931 }
19932 /* Otherwise, the identifier is optional. */
19933 else
19934 {
19935 /* We don't know whether what comes next is a template-id,
19936 an identifier, or nothing at all. */
19938 /* Check for a template-id. */
19943 class_key,
19945 /* If that didn't work, it could still be an identifier. */
19947 {
19949 {
19952 }
19953 else
19955 }
19956 else
19957 {
19960 }
19961 }
19966 {
19968 class_key,
19970 }
19973 /* If it's not a `:' or a `{' then we can't really be looking at a
19974 class-head, since a class-head only appears as part of a
19975 class-specifier. We have to detect this situation before calling
19976 xref_tag, since that has irreversible side-effects. */
19978 {
19982 }
19984 /* At this point, we're going ahead with the class-specifier, even
19985 if some other problem occurs. */
19988 {
19993 }
19994 /* Issue the error about the overly-qualified name now. */
19996 {
20001 }
20003 {
20008 }
20010 {
20011 tree scope;
20013 /* Reject typedef-names in class heads. */
20015 {
20018 type);
20021 }
20023 /* Figure out in what scope the declaration is being placed. */
20025 /* If that scope does not contain the scope in which the
20026 class was originally declared, the program is invalid. */
20028 {
20031 "declaration of %qD in namespace %qD which does not "
20034 else
20040 }
20041 /* [dcl.meaning]
20043 A declarator-id shall not be qualified except for the
20044 definition of a ... nested class outside of its class
20045 ... [or] the definition or explicit instantiation of a
20046 class member of a namespace outside of its namespace. */
20048 {
20053 }
20054 }
20055 /* An explicit-specialization must be preceded by "template <>". If
20056 it is not, try to recover gracefully. */
20060 {
20064 /* Take the same action that would have been taken by
20065 cp_parser_explicit_specialization. */
20068 }
20069 /* There must be no "return" statements between this point and the
20070 end of this function; set "type "to the correct return value and
20071 use "goto done;" to return. */
20072 /* Make sure that the right number of template parameters were
20073 present. */
20077 {
20078 /* If something went wrong, there is no point in even trying to
20079 process the class-definition. */
20082 }
20084 /* Look up the type. */
20086 {
20090 {
20094 }
20095 else
20096 {
20099 }
20102 }
20104 {
20105 tree class_type;
20107 /* Given:
20109 template <typename T> struct S { struct T };
20110 template <typename T> struct S<T>::T { };
20112 we will get a TYPENAME_TYPE when processing the definition of
20113 `S::T'. We need to resolve it to the actual type before we
20114 try to define it. */
20116 {
20121 else
20122 {
20125 }
20126 }
20130 {
20133 }
20136 /* Enter the scope indicated by the nested-name-specifier. */
20138 /* Get the canonical version of this type. */
20140 /* Call push_template_decl if it seems like we should be defining a
20141 template either from the template headers or the type we're
20142 defining, so that we diagnose both extra and missing headers. */
20148 {
20151 {
20154 }
20155 }
20159 }
20161 {
20162 /* If the class was unnamed, create a dummy name. */
20167 }
20169 /* Indicate whether this class was declared as a `class' or as a
20170 `struct'. */
20175 /* If this type was already complete, and we see another definition,
20176 that's an error. */
20178 {
20180 type);
20182 type);
20185 }
20190 {
20191 /* Apply attributes now, before any use of the class as a template
20192 argument in its base list. */
20195 }
20197 /* We will have entered the scope containing the class; the names of
20198 base classes should be looked up in that context. For example:
20200 struct A { struct B {}; struct C; };
20201 struct A::C : B {};
20203 is valid. */
20205 /* Get the list of base-classes, if there is one. */
20207 {
20208 /* PR59482: enter the class scope so that base-specifiers are looked
20209 up correctly. */
20213 /* PR59482: get out of the previously pushed class scope so that the
20214 subsequent pops pop the right thing. */
20217 }
20218 else
20221 /* If we're really defining a class, process the base classes.
20222 If they're invalid, fail. */
20227 done:
20228 /* Leave the scope given by the nested-name-specifier. We will
20229 enter the class scope itself while processing the members. */
20234 {
20237 }
20243 out:
20246 }
20248 /* Parse a class-key.
20250 class-key:
20251 class
20252 struct
20253 union
20255 Returns the kind of class-key specified, or none_type to indicate
20256 error. */
20258 static enum tag_types
20260 {
20264 /* Look for the class-key. */
20269 /* Check to see if the TOKEN is a class-key. */
20274 }
20276 /* Parse a type-parameter-key.
20278 type-parameter-key:
20279 class
20280 typename
20281 */
20283 static void
20285 {
20286 /* Look for the type-parameter-key. */
20290 {
20293 /* typename is not allowed in a template template parameter
20294 by the standard until C++1Z. */
20296 "ISO C++ forbids typename key in template template parameter;"
20298 }
20299 else
20303 }
20305 /* Parse an (optional) member-specification.
20307 member-specification:
20308 member-declaration member-specification [opt]
20309 access-specifier : member-specification [opt] */
20311 static void
20313 {
20315 {
20319 /* Peek at the next token. */
20321 /* If it's a `}', or EOF then we've seen all the members. */
20327 /* See if this token is a keyword. */
20330 {
20334 /* Consume the access-specifier. */
20336 /* Remember which access-specifier is active. */
20338 /* Look for the `:'. */
20343 /* Accept #pragmas at class scope. */
20345 {
20348 }
20350 /* Otherwise, the next construction must be a
20351 member-declaration. */
20353 }
20354 }
20355 }
20357 /* Parse a member-declaration.
20359 member-declaration:
20360 decl-specifier-seq [opt] member-declarator-list [opt] ;
20361 function-definition ; [opt]
20362 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20363 using-declaration
20364 template-declaration
20365 alias-declaration
20367 member-declarator-list:
20368 member-declarator
20369 member-declarator-list , member-declarator
20371 member-declarator:
20372 declarator pure-specifier [opt]
20373 declarator constant-initializer [opt]
20374 identifier [opt] : constant-expression
20376 GNU Extensions:
20378 member-declaration:
20379 __extension__ member-declaration
20381 member-declarator:
20382 declarator attributes [opt] pure-specifier [opt]
20383 declarator attributes [opt] constant-initializer [opt]
20384 identifier [opt] attributes [opt] : constant-expression
20386 C++0x Extensions:
20388 member-declaration:
20389 static_assert-declaration */
20391 static void
20393 {
20394 cp_decl_specifier_seq decl_specifiers;
20395 tree prefix_attributes;
20396 tree decl;
20405 /* Check for the `__extension__' keyword. */
20407 {
20408 /* Recurse. */
20410 /* Restore the old value of the PEDANTIC flag. */
20414 }
20416 /* Check for a template-declaration. */
20418 {
20419 /* An explicit specialization here is an error condition, and we
20420 expect the specialization handler to detect and report this. */
20424 else
20428 }
20430 /* Check for a using-declaration. */
20432 {
20434 {
20435 /* Parse the using-declaration. */
20439 }
20440 else
20441 {
20442 tree decl;
20446 /* Note that if we actually see the '=' token after the
20447 identifier, cp_parser_alias_declaration commits the
20448 tentative parse. In that case, we really expects an
20449 alias-declaration. Otherwise, we expect a using
20450 declaration. */
20451 alias_decl_expected =
20457 else
20461 }
20462 }
20464 /* Check for @defs. */
20466 {
20471 {
20476 }
20478 }
20480 /* If the next token is `static_assert' we have a static assertion. */
20482 {
20485 }
20492 /* Parse the decl-specifier-seq. */
20495 CP_PARSER_FLAGS_OPTIONAL,
20498 /* Check for an invalid type-name. */
20502 /* If there is no declarator, then the decl-specifier-seq should
20503 specify a type. */
20505 {
20506 /* If there was no decl-specifier-seq, and the next token is a
20507 `;', then we have something like:
20509 struct S { ; };
20511 [class.mem]
20513 Each member-declaration shall declare at least one member
20514 name of the class. */
20516 {
20520 }
20521 else
20522 {
20523 tree type;
20525 /* See if this declaration is a friend. */
20527 /* If there were decl-specifiers, check to see if there was
20528 a class-declaration. */
20531 /* Nested classes have already been added to the class, but
20532 a `friend' needs to be explicitly registered. */
20534 {
20535 /* If the `friend' keyword was present, the friend must
20536 be introduced with a class-key. */
20539 "in C++03 a class-key must be used "
20541 /* In this case:
20543 template <typename T> struct A {
20544 friend struct A<T>::B;
20545 };
20547 A<T>::B will be represented by a TYPENAME_TYPE, and
20548 therefore not recognized by check_tag_decl. */
20550 {
20554 }
20557 "friend declaration does not name a class or "
20559 else
20562 }
20563 /* If there is no TYPE, an error message will already have
20564 been issued. */
20566 ;
20567 /* An anonymous aggregate has to be handled specially; such
20568 a declaration really declares a data member (with a
20569 particular type), as opposed to a nested class. */
20571 {
20572 /* C++11 9.5/6. */
20575 "a storage class on an anonymous aggregate "
20578 /* Remove constructors and such from TYPE, now that we
20579 know it is an anonymous aggregate. */
20581 /* And make the corresponding data member. */
20584 /* Add it to the class. */
20586 }
20587 else
20588 cp_parser_check_access_in_redeclaration
20591 }
20592 }
20593 else
20594 {
20597 /* Clear attributes from the decl_specifiers but keep them
20598 around as prefix attributes that apply them to the entity
20599 being declared. */
20603 /* See if these declarations will be friends. */
20606 /* Keep going until we hit the `;' at the end of the
20607 declaration. */
20609 {
20611 tree first_attribute;
20613 /* Peek at the next token. */
20616 /* Check for a bitfield declaration. */
20621 {
20622 tree identifier;
20623 tree width;
20625 /* Get the name of the bitfield. Note that we cannot just
20626 check TOKEN here because it may have been invalidated by
20627 the call to cp_lexer_peek_nth_token above. */
20630 else
20633 /* Consume the `:' token. */
20635 /* Get the width of the bitfield. */
20636 width
20639 NULL);
20641 /* Look for attributes that apply to the bitfield. */
20643 /* Remember which attributes are prefix attributes and
20644 which are not. */
20646 /* Combine the attributes. */
20649 /* Create the bitfield declaration. */
20652 identifier,
20653 sfk_none)
20656 width,
20657 attributes);
20658 }
20659 else
20660 {
20662 tree initializer;
20663 tree asm_specification;
20666 /* Parse the declarator. */
20667 declarator
20672 friend_p);
20674 /* If something went wrong parsing the declarator, make sure
20675 that we at least consume some tokens. */
20677 {
20678 /* Skip to the end of the statement. */
20680 /* If the next token is not a semicolon, that is
20681 probably because we just skipped over the body of
20682 a function. So, we consume a semicolon if
20683 present, but do not issue an error message if it
20684 is not present. */
20686 CPP_SEMICOLON))
20689 }
20692 cp_parser_check_for_definition_in_return_type
20696 /* Look for an asm-specification. */
20698 /* Look for attributes that apply to the declaration. */
20700 /* Remember which attributes are prefix attributes and
20701 which are not. */
20703 /* Combine the attributes. */
20706 /* If it's an `=', then we have a constant-initializer or a
20707 pure-specifier. It is not correct to parse the
20708 initializer before registering the member declaration
20709 since the member declaration should be in scope while
20710 its initializer is processed. However, the rest of the
20711 front end does not yet provide an interface that allows
20712 us to handle this correctly. */
20714 {
20715 /* In [class.mem]:
20717 A pure-specifier shall be used only in the declaration of
20718 a virtual function.
20720 A member-declarator can contain a constant-initializer
20721 only if it declares a static member of integral or
20722 enumeration type.
20724 Therefore, if the DECLARATOR is for a function, we look
20725 for a pure-specifier; otherwise, we look for a
20726 constant-initializer. When we call `grokfield', it will
20727 perform more stringent semantics checks. */
20739 {
20741 /* Don't require a constant rvalue in C++11, since we
20742 might want a reference constant. We'll enforce
20743 constancy later. */
20745 /* Parse the initializer. */
20748 }
20749 else
20750 /* Parse the initializer. */
20752 }
20755 {
20759 else
20761 }
20762 /* Otherwise, there is no initializer. */
20763 else
20766 /* See if we are probably looking at a function
20767 definition. We are certainly not looking at a
20768 member-declarator. Calling `grokfield' has
20769 side-effects, so we must not do it unless we are sure
20770 that we are looking at a member-declarator. */
20773 {
20774 /* The grammar does not allow a pure-specifier to be
20775 used when a member function is defined. (It is
20776 possible that this fact is an oversight in the
20777 standard, since a pure function may be defined
20778 outside of the class-specifier. */
20784 declarator,
20785 attributes);
20788 /* If the member was not a friend, declare it here. */
20791 /* Peek at the next token. */
20793 /* If the next token is a semicolon, consume it. */
20797 }
20798 else
20801 /* Create the declaration. */
20806 {
20809 else
20811 }
20812 }
20816 /* Reset PREFIX_ATTRIBUTES. */
20822 /* If there is any qualification still in effect, clear it
20823 now; we will be starting fresh with the next declarator. */
20827 /* If it's a `,', then there are more declarators. */
20829 {
20832 {
20836 }
20837 }
20838 /* If the next token isn't a `;', then we have a parse error. */
20840 CPP_SEMICOLON))
20841 {
20842 /* The next token might be a ways away from where the
20843 actual semicolon is missing. Find the previous token
20844 and use that for our error position. */
20849 /* Assume that the user meant to provide a semicolon. If
20850 we were to cp_parser_skip_to_end_of_statement, we might
20851 skip to a semicolon inside a member function definition
20852 and issue nonsensical error messages. */
20854 }
20857 {
20858 /* Add DECL to the list of members. */
20867 /* Add DECL to the queue of NSDMI to be parsed later. */
20869 }
20873 }
20874 }
20877 out:
20879 }
20881 /* Parse a pure-specifier.
20883 pure-specifier:
20884 = 0
20886 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20887 Otherwise, ERROR_MARK_NODE is returned. */
20889 static tree
20891 {
20894 /* Look for the `=' token. */
20897 /* Look for the `0' token. */
20906 /* Accept = default or = delete in c++0x mode. */
20909 {
20912 }
20914 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20916 {
20921 }
20923 {
20926 }
20929 }
20931 /* Parse a constant-initializer.
20933 constant-initializer:
20934 = constant-expression
20936 Returns a representation of the constant-expression. */
20938 static tree
20940 {
20941 /* Look for the `=' token. */
20945 /* It is invalid to write:
20947 struct S { static const int i = { 7 }; };
20949 */
20951 {
20954 /* Consume the opening brace. */
20956 /* Skip the initializer. */
20958 /* Look for the trailing `}'. */
20962 }
20966 NULL);
20967 }
20969 /* Derived classes [gram.class.derived] */
20971 /* Parse a base-clause.
20973 base-clause:
20974 : base-specifier-list
20976 base-specifier-list:
20977 base-specifier ... [opt]
20978 base-specifier-list , base-specifier ... [opt]
20980 Returns a TREE_LIST representing the base-classes, in the order in
20981 which they were declared. The representation of each node is as
20982 described by cp_parser_base_specifier.
20984 In the case that no bases are specified, this function will return
20985 NULL_TREE, not ERROR_MARK_NODE. */
20987 static tree
20989 {
20992 /* Look for the `:' that begins the list. */
20995 /* Scan the base-specifier-list. */
20997 {
20999 tree base;
21002 /* Look for the base-specifier. */
21004 /* Look for the (optional) ellipsis. */
21006 {
21007 /* Consume the `...'. */
21011 }
21013 /* Add BASE to the front of the list. */
21015 {
21017 /* Make this a pack expansion type. */
21021 {
21024 }
21025 }
21026 /* Peek at the next token. */
21028 /* If it's not a comma, then the list is complete. */
21031 /* Consume the `,'. */
21033 }
21035 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21036 base class had a qualified name. However, the next name that
21037 appears is certainly not qualified. */
21043 }
21045 /* Parse a base-specifier.
21047 base-specifier:
21048 :: [opt] nested-name-specifier [opt] class-name
21049 virtual access-specifier [opt] :: [opt] nested-name-specifier
21050 [opt] class-name
21051 access-specifier virtual [opt] :: [opt] nested-name-specifier
21052 [opt] class-name
21054 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21055 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21056 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21057 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21059 static tree
21061 {
21069 tree type;
21071 /* Process the optional `virtual' and `access-specifier'. */
21073 {
21074 /* Peek at the next token. */
21076 /* Process `virtual'. */
21078 {
21080 /* If `virtual' appears more than once, issue an error. */
21082 {
21086 }
21090 /* Consume the `virtual' token. */
21098 /* If more than one access specifier appears, issue an
21099 error. */
21102 {
21106 }
21110 /* Consume the access-specifier. */
21118 }
21119 }
21120 /* It is not uncommon to see programs mechanically, erroneously, use
21121 the 'typename' keyword to denote (dependent) qualified types
21122 as base classes. */
21124 {
21129 else
21131 "keyword %<typename%> not allowed in this context "
21134 }
21136 /* Look for the optional `::' operator. */
21138 /* Look for the nested-name-specifier. The simplest way to
21139 implement:
21141 [temp.res]
21143 The keyword `typename' is not permitted in a base-specifier or
21144 mem-initializer; in these contexts a qualified name that
21145 depends on a template-parameter is implicitly assumed to be a
21146 type name.
21148 is to pretend that we have seen the `typename' keyword at this
21149 point. */
21153 typename_type,
21155 /* If the base class is given by a qualified name, assume that names
21156 we see are type names or templates, as appropriate. */
21162 /* DR 950 allows decltype as a base-specifier. */
21164 else
21165 {
21166 /* Otherwise, look for the class-name. */
21168 class_scope_p,
21169 template_p,
21170 typename_type,
21175 }
21181 }
21183 /* Exception handling [gram.exception] */
21185 /* Parse an (optional) noexcept-specification.
21187 noexcept-specification:
21188 noexcept ( constant-expression ) [opt]
21190 If no noexcept-specification is present, returns NULL_TREE.
21191 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21192 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21193 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21194 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21195 in which case a boolean condition is returned instead. */
21197 static tree
21202 {
21206 /* Peek at the next token. */
21209 /* Is it a noexcept-specification? */
21211 {
21212 tree expr;
21216 {
21220 {
21221 /* Types may not be defined in an exception-specification. */
21223 parser->type_definition_forbidden_message
21228 /* Restore the saved message. */
21230 }
21231 else
21232 {
21235 }
21238 }
21239 else
21240 {
21244 }
21246 /* We cannot build a noexcept-spec right away because this will check
21247 that expr is a constexpr. */
21250 else
21252 }
21253 else
21255 }
21257 /* Parse an (optional) exception-specification.
21259 exception-specification:
21260 throw ( type-id-list [opt] )
21262 Returns a TREE_LIST representing the exception-specification. The
21263 TREE_VALUE of each node is a type. */
21265 static tree
21267 {
21269 tree type_id_list;
21272 /* Peek at the next token. */
21275 /* Is it a noexcept-specification? */
21281 /* If it's not `throw', then there's no exception-specification. */
21285 #if 0
21286 /* Enable this once a lot of code has transitioned to noexcept? */
21290 #endif
21292 /* Consume the `throw'. */
21295 /* Look for the `('. */
21298 /* Peek at the next token. */
21300 /* If it's not a `)', then there is a type-id-list. */
21302 {
21303 /* Types may not be defined in an exception-specification. */
21305 parser->type_definition_forbidden_message
21307 /* Parse the type-id-list. */
21309 /* Restore the saved message. */
21311 }
21312 else
21315 /* Look for the `)'. */
21319 }
21321 /* Parse an (optional) type-id-list.
21323 type-id-list:
21324 type-id ... [opt]
21325 type-id-list , type-id ... [opt]
21327 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21328 in the order that the types were presented. */
21330 static tree
21332 {
21336 {
21338 tree type;
21340 /* Get the next type-id. */
21342 /* Parse the optional ellipsis. */
21344 {
21345 /* Consume the `...'. */
21348 /* Turn the type into a pack expansion expression. */
21350 }
21351 /* Add it to the list. */
21353 /* Peek at the next token. */
21355 /* If it is not a `,', we are done. */
21358 /* Consume the `,'. */
21360 }
21363 }
21365 /* Parse a try-block.
21367 try-block:
21368 try compound-statement handler-seq */
21370 static tree
21372 {
21373 tree try_block;
21383 }
21385 /* Parse a function-try-block.
21387 function-try-block:
21388 try ctor-initializer [opt] function-body handler-seq */
21390 static bool
21392 {
21393 tree compound_stmt;
21394 tree try_block;
21397 /* Look for the `try' keyword. */
21400 /* Let the rest of the front end know where we are. */
21402 /* Parse the function-body. */
21403 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21405 /* We're done with the `try' part. */
21407 /* Parse the handlers. */
21409 /* We're done with the handlers. */
21413 }
21415 /* Parse a handler-seq.
21417 handler-seq:
21418 handler handler-seq [opt] */
21420 static void
21422 {
21424 {
21427 /* Parse the handler. */
21429 /* Peek at the next token. */
21431 /* If it's not `catch' then there are no more handlers. */
21434 }
21435 }
21437 /* Parse a handler.
21439 handler:
21440 catch ( exception-declaration ) compound-statement */
21442 static void
21444 {
21445 tree handler;
21446 tree declaration;
21456 }
21458 /* Parse an exception-declaration.
21460 exception-declaration:
21461 type-specifier-seq declarator
21462 type-specifier-seq abstract-declarator
21463 type-specifier-seq
21464 ...
21466 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21467 ellipsis variant is used. */
21469 static tree
21471 {
21472 cp_decl_specifier_seq type_specifiers;
21476 /* If it's an ellipsis, it's easy to handle. */
21478 {
21479 /* Consume the `...' token. */
21482 }
21484 /* Types may not be defined in exception-declarations. */
21486 parser->type_definition_forbidden_message
21489 /* Parse the type-specifier-seq. */
21493 /* If it's a `)', then there is no declarator. */
21496 else
21503 /* Restore the saved message. */
21510 }
21512 /* Parse a throw-expression.
21514 throw-expression:
21515 throw assignment-expression [opt]
21517 Returns a THROW_EXPR representing the throw-expression. */
21519 static tree
21521 {
21522 tree expression;
21527 /* Figure out whether or not there is an assignment-expression
21528 following the "throw" keyword. */
21536 else
21541 }
21543 /* GNU Extensions */
21545 /* Parse an (optional) asm-specification.
21547 asm-specification:
21548 asm ( string-literal )
21550 If the asm-specification is present, returns a STRING_CST
21551 corresponding to the string-literal. Otherwise, returns
21552 NULL_TREE. */
21554 static tree
21556 {
21558 tree asm_specification;
21560 /* Peek at the next token. */
21562 /* If the next token isn't the `asm' keyword, then there's no
21563 asm-specification. */
21567 /* Consume the `asm' token. */
21569 /* Look for the `('. */
21572 /* Look for the string-literal. */
21575 /* Look for the `)'. */
21579 }
21581 /* Parse an asm-operand-list.
21583 asm-operand-list:
21584 asm-operand
21585 asm-operand-list , asm-operand
21587 asm-operand:
21588 string-literal ( expression )
21589 [ string-literal ] string-literal ( expression )
21591 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21592 each node is the expression. The TREE_PURPOSE is itself a
21593 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21594 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21595 is a STRING_CST for the string literal before the parenthesis. Returns
21596 ERROR_MARK_NODE if any of the operands are invalid. */
21598 static tree
21600 {
21605 {
21606 tree string_literal;
21607 tree expression;
21608 tree name;
21611 {
21612 /* Consume the `[' token. */
21614 /* Read the operand name. */
21619 /* Look for the closing `]'. */
21621 }
21622 else
21624 /* Look for the string-literal. */
21627 /* Look for the `('. */
21629 /* Parse the expression. */
21631 /* Look for the `)'. */
21639 /* Add this operand to the list. */
21641 expression,
21642 asm_operands);
21643 /* If the next token is not a `,', there are no more
21644 operands. */
21647 /* Consume the `,'. */
21649 }
21652 }
21654 /* Parse an asm-clobber-list.
21656 asm-clobber-list:
21657 string-literal
21658 asm-clobber-list , string-literal
21660 Returns a TREE_LIST, indicating the clobbers in the order that they
21661 appeared. The TREE_VALUE of each node is a STRING_CST. */
21663 static tree
21665 {
21669 {
21670 tree string_literal;
21672 /* Look for the string literal. */
21674 /* Add it to the list. */
21676 /* If the next token is not a `,', then the list is
21677 complete. */
21680 /* Consume the `,' token. */
21682 }
21685 }
21687 /* Parse an asm-label-list.
21689 asm-label-list:
21690 identifier
21691 asm-label-list , identifier
21693 Returns a TREE_LIST, indicating the labels in the order that they
21694 appeared. The TREE_VALUE of each node is a label. */
21696 static tree
21698 {
21702 {
21705 /* Look for the identifier. */
21708 {
21711 {
21717 }
21718 }
21719 /* If the next token is not a `,', then the list is
21720 complete. */
21723 /* Consume the `,' token. */
21725 }
21728 }
21730 /* Return TRUE iff the next tokens in the stream are possibly the
21731 beginning of a GNU extension attribute. */
21733 static bool
21735 {
21737 }
21739 /* Return TRUE iff the next tokens in the stream are possibly the
21740 beginning of a standard C++-11 attribute specifier. */
21742 static bool
21744 {
21746 }
21748 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21749 beginning of a standard C++-11 attribute specifier. */
21751 static bool
21753 {
21761 }
21763 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21764 beginning of a GNU extension attribute. */
21766 static bool
21768 {
21772 }
21774 /* Return true iff the next tokens can be the beginning of either a
21775 GNU attribute list, or a standard C++11 attribute sequence. */
21777 static bool
21779 {
21782 }
21784 /* Return true iff the next Nth tokens can be the beginning of either
21785 a GNU attribute list, or a standard C++11 attribute sequence. */
21787 static bool
21789 {
21792 }
21794 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21795 of GNU attributes, or return NULL. */
21797 static tree
21799 {
21803 }
21805 #define CILK_SIMD_FN_CLAUSE_MASK \
21806 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21807 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21808 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21809 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21810 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21812 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21813 vector [(<clauses>)] */
21815 static void
21817 {
21821 {
21826 }
21829 {
21832 paren_scope++;
21833 }
21835 {
21838 paren_scope++;
21840 paren_scope--;
21841 /* Do not push the last ')' */
21844 }
21853 }
21855 /* Parse an (optional) series of attributes.
21857 attributes:
21858 attributes attribute
21860 attribute:
21861 __attribute__ (( attribute-list [opt] ))
21863 The return value is as for cp_parser_gnu_attribute_list. */
21865 static tree
21867 {
21871 {
21873 tree attribute_list;
21876 /* Peek at the next token. */
21878 /* If it's not `__attribute__', then we're done. */
21882 /* Consume the `__attribute__' keyword. */
21884 /* Look for the two `(' tokens. */
21888 /* Peek at the next token. */
21891 /* Parse the attribute-list. */
21893 else
21894 /* If the next token is a `)', then there is no attribute
21895 list. */
21898 /* Look for the two `)' tokens. */
21906 /* Add these new attributes to the list. */
21908 }
21911 }
21913 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21914 "__vector" or "__vector__." */
21918 {
21922 }
21924 /* Parse a GNU attribute-list.
21926 attribute-list:
21927 attribute
21928 attribute-list , attribute
21930 attribute:
21931 identifier
21932 identifier ( identifier )
21933 identifier ( identifier , expression-list )
21934 identifier ( expression-list )
21936 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21937 to an attribute. The TREE_PURPOSE of each node is the identifier
21938 indicating which attribute is in use. The TREE_VALUE represents
21939 the arguments, if any. */
21941 static tree
21943 {
21949 {
21951 tree identifier;
21952 tree attribute;
21954 /* Look for the identifier. We also allow keywords here; for
21955 example `__attribute__ ((const))' is legal. */
21959 {
21962 /* Consume the token, but save it since we need it for the
21963 SIMD enabled function parsing. */
21966 /* Save away the identifier that indicates which attribute
21967 this is. */
21969 /* For keywords, use the canonical spelling, not the
21970 parsed identifier. */
21976 /* Peek at the next token. */
21978 /* If it's an `(', then parse the attribute arguments. */
21980 {
21985 {
21988 }
21989 else
21990 vec = cp_parser_parenthesized_expression_list
21996 else
21997 {
22000 }
22001 /* Save the arguments away. */
22003 }
22005 {
22008 }
22011 {
22012 /* Add this attribute to the list. */
22015 }
22018 }
22019 /* Now, look for more attributes. If the next token isn't a
22020 `,', we're done. */
22024 /* Consume the comma and keep going. */
22026 }
22029 /* We built up the list in reverse order. */
22031 }
22033 /* Parse a standard C++11 attribute.
22035 The returned representation is a TREE_LIST which TREE_PURPOSE is
22036 the scoped name of the attribute, and the TREE_VALUE is its
22037 arguments list.
22039 Note that the scoped name of the attribute is itself a TREE_LIST
22040 which TREE_PURPOSE is the namespace of the attribute, and
22041 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22042 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22043 and which TREE_PURPOSE is directly the attribute name.
22045 Clients of the attribute code should use get_attribute_namespace
22046 and get_attribute_name to get the actual namespace and name of
22047 attributes, regardless of their being GNU or C++11 attributes.
22049 attribute:
22050 attribute-token attribute-argument-clause [opt]
22052 attribute-token:
22053 identifier
22054 attribute-scoped-token
22056 attribute-scoped-token:
22057 attribute-namespace :: identifier
22059 attribute-namespace:
22060 identifier
22062 attribute-argument-clause:
22063 ( balanced-token-seq )
22065 balanced-token-seq:
22066 balanced-token [opt]
22067 balanced-token-seq balanced-token
22069 balanced-token:
22070 ( balanced-token-seq )
22071 [ balanced-token-seq ]
22072 { balanced-token-seq }. */
22074 static tree
22076 {
22080 /* First, parse name of the the attribute, a.k.a
22081 attribute-token. */
22098 {
22099 /* We are seeing a scoped attribute token. */
22109 else
22110 {
22114 }
22116 NULL_TREE);
22118 }
22119 else
22120 {
22122 NULL_TREE);
22123 /* C++11 noreturn attribute is equivalent to GNU's. */
22126 /* C++14 deprecated attribute is equivalent to GNU's. */
22129 }
22131 /* Now parse the optional argument clause of the attribute. */
22136 {
22142 /* A GNU attribute that takes an identifier in parameter. */
22145 vec = cp_parser_parenthesized_expression_list
22151 else
22152 {
22155 }
22159 else
22161 }
22164 }
22166 /* Parse a list of standard C++-11 attributes.
22168 attribute-list:
22169 attribute [opt]
22170 attribute-list , attribute[opt]
22171 attribute ...
22172 attribute-list , attribute ...
22173 */
22175 static tree
22177 {
22182 {
22187 {
22190 }
22195 }
22198 }
22200 /* Parse a standard C++-11 attribute specifier.
22202 attribute-specifier:
22203 [ [ attribute-list ] ]
22204 alignment-specifier
22206 alignment-specifier:
22207 alignas ( type-id ... [opt] )
22208 alignas ( alignment-expression ... [opt] ). */
22210 static tree
22212 {
22218 {
22227 else
22228 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22229 when we are sure that we have actually parsed them. */
22231 }
22232 else
22233 {
22234 tree alignas_expr;
22236 /* Look for an alignment-specifier. */
22248 {
22251 }
22257 {
22261 alignas_expr =
22269 }
22272 {
22275 }
22279 /* Build the C++-11 representation of an 'aligned'
22280 attribute. */
22281 attributes =
22285 }
22288 }
22290 /* Parse a standard C++-11 attribute-specifier-seq.
22292 attribute-specifier-seq:
22293 attribute-specifier-seq [opt] attribute-specifier
22294 */
22296 static tree
22298 {
22302 {
22311 }
22315 }
22317 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22318 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22319 current value of the PEDANTIC flag, regardless of whether or not
22320 the `__extension__' keyword is present. The caller is responsible
22321 for restoring the value of the PEDANTIC flag. */
22323 static bool
22325 {
22326 /* Save the old value of the PEDANTIC flag. */
22330 {
22331 /* Consume the `__extension__' token. */
22333 /* We're not being pedantic while the `__extension__' keyword is
22334 in effect. */
22338 }
22341 }
22343 /* Parse a label declaration.
22345 label-declaration:
22346 __label__ label-declarator-seq ;
22348 label-declarator-seq:
22349 identifier , label-declarator-seq
22350 identifier */
22352 static void
22354 {
22355 /* Look for the `__label__' keyword. */
22359 {
22360 tree identifier;
22362 /* Look for an identifier. */
22364 /* If we failed, stop. */
22367 /* Declare it as a label. */
22369 /* If the next token is a `;', stop. */
22372 /* Look for the `,' separating the label declarations. */
22374 }
22376 /* Look for the final `;'. */
22378 }
22380 /* Support Functions */
22382 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22383 NAME should have one of the representations used for an
22384 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22385 is returned. If PARSER->SCOPE is a dependent type, then a
22386 SCOPE_REF is returned.
22388 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22389 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22390 was formed. Abstractly, such entities should not be passed to this
22391 function, because they do not need to be looked up, but it is
22392 simpler to check for this special case here, rather than at the
22393 call-sites.
22395 In cases not explicitly covered above, this function returns a
22396 DECL, OVERLOAD, or baselink representing the result of the lookup.
22397 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22398 is returned.
22400 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22401 (e.g., "struct") that was used. In that case bindings that do not
22402 refer to types are ignored.
22404 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22405 ignored.
22407 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22408 are ignored.
22410 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22411 types.
22413 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22414 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22415 NULL_TREE otherwise. */
22417 static tree
22424 location_t name_location)
22425 {
22426 tree decl;
22429 /* Assume that the lookup will be unambiguous. */
22433 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22434 no longer valid. Note that if we are parsing tentatively, and
22435 the parse fails, OBJECT_TYPE will be automatically restored. */
22441 /* A template-id has already been resolved; there is no lookup to
22442 do. */
22446 {
22450 }
22452 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22453 it should already have been checked to make sure that the name
22454 used matches the type being destroyed. */
22456 {
22457 tree type;
22459 /* Figure out to which type this destructor applies. */
22464 else
22466 /* If that's not a class type, there is no destructor. */
22473 /* If it was a class type, return the destructor. */
22475 }
22477 /* By this point, the NAME should be an ordinary identifier. If
22478 the id-expression was a qualified name, the qualifying scope is
22479 stored in PARSER->SCOPE at this point. */
22482 /* Perform the lookup. */
22484 {
22490 /* If the SCOPE is dependent, the lookup must be deferred until
22491 the template is instantiated -- unless we are explicitly
22492 looking up names in uninstantiated templates. Even then, we
22493 cannot look up the name if the scope is not a class type; it
22494 might, for example, be a template type parameter. */
22499 /* Defer lookup. */
22501 else
22502 {
22505 /* If PARSER->SCOPE is a dependent type, then it must be a
22506 class type, and we must not be checking dependencies;
22507 otherwise, we would have processed this lookup above. So
22508 that PARSER->SCOPE is not considered a dependent base by
22509 lookup_member, we must enter the scope here. */
22513 /* If the PARSER->SCOPE is a template specialization, it
22514 may be instantiated during name lookup. In that case,
22515 errors may be issued. Even if we rollback the current
22516 tentative parse, those errors are valid. */
22521 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22522 lookup result and the nested-name-specifier nominates a class C:
22523 * if the name specified after the nested-name-specifier, when
22524 looked up in C, is the injected-class-name of C (Clause 9), or
22525 * if the name specified after the nested-name-specifier is the
22526 same as the identifier or the simple-template-id's template-
22527 name in the last component of the nested-name-specifier,
22528 the name is instead considered to name the constructor of
22529 class C. [ Note: for example, the constructor is not an
22530 acceptable lookup result in an elaborated-type-specifier so
22531 the constructor would not be used in place of the
22532 injected-class-name. --end note ] Such a constructor name
22533 shall be used only in the declarator-id of a declaration that
22534 names a constructor or in a using-declaration. */
22542 /* If we have a single function from a using decl, pull it out. */
22549 }
22551 /* If the scope is a dependent type and either we deferred lookup or
22552 we did lookup but didn't find the name, rememeber the name. */
22555 {
22557 {
22558 tree type;
22560 /* The resolution to Core Issue 180 says that `struct
22561 A::B' should be considered a type-name, even if `A'
22562 is dependent. */
22567 }
22571 CPP_CLOSE_PAREN)))
22575 else
22578 is_template);
22579 }
22582 }
22584 {
22585 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22586 OBJECT_TYPE is not a class. */
22588 /* If the OBJECT_TYPE is a template specialization, it may
22589 be instantiated during name lookup. In that case, errors
22590 may be issued. Even if we rollback the current tentative
22591 parse, those errors are valid. */
22593 name,
22596 tf_warning_or_error);
22597 else
22601 /* Look it up in the enclosing context. */
22607 }
22608 else
22609 {
22615 }
22617 /* If the lookup failed, let our caller know. */
22621 /* Pull out the template from an injected-class-name (or multiple). */
22625 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22627 {
22630 /* The error message we have to print is too complicated for
22631 cp_parser_error, so we incorporate its actions directly. */
22633 {
22635 name);
22637 }
22639 }
22647 /* If we have resolved the name of a member declaration, check to
22648 see if the declaration is accessible. When the name resolves to
22649 set of overloaded functions, accessibility is checked when
22650 overload resolution is done.
22652 During an explicit instantiation, access is not checked at all,
22653 as per [temp.explicit]. */
22660 }
22662 /* Like cp_parser_lookup_name, but for use in the typical case where
22663 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22664 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22666 static tree
22668 {
22670 none_type,
22675 location);
22676 }
22678 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22679 the current context, return the TYPE_DECL. If TAG_NAME_P is
22680 true, the DECL indicates the class being defined in a class-head,
22681 or declared in an elaborated-type-specifier.
22683 Otherwise, return DECL. */
22685 static tree
22687 {
22688 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22689 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22691 struct A {
22692 template <typename T> struct B;
22693 };
22695 template <typename T> struct A::B {};
22697 Similarly, in an elaborated-type-specifier:
22699 namespace N { struct X{}; }
22701 struct A {
22702 template <typename T> friend struct N::X;
22703 };
22705 However, if the DECL refers to a class type, and we are in
22706 the scope of the class, then the name lookup automatically
22707 finds the TYPE_DECL created by build_self_reference rather
22708 than a TEMPLATE_DECL. For example, in:
22710 template <class T> struct S {
22711 S s;
22712 };
22714 there is no need to handle such case. */
22720 }
22722 /* If too many, or too few, template-parameter lists apply to the
22723 declarator, issue an error message. Returns TRUE if all went well,
22724 and FALSE otherwise. */
22726 static bool
22729 location_t declarator_location)
22730 {
22732 {
22734 {
22742 /* If the DECLARATOR has the form `X<y>' then it uses one
22743 additional level of template parameters. */
22746 return cp_parser_check_template_parameters
22748 }
22763 }
22765 }
22767 /* NUM_TEMPLATES were used in the current declaration. If that is
22768 invalid, return FALSE and issue an error messages. Otherwise,
22769 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22770 declarator and we can print more accurate diagnostics. */
22772 static bool
22775 location_t location,
22777 {
22778 /* If there are the same number of template classes and parameter
22779 lists, that's OK. */
22782 /* If there are more, but only one more, then we are referring to a
22783 member template. That's OK too. */
22786 /* If there are more template classes than parameter lists, we have
22787 something like:
22789 template <class T> void S<T>::R<T>::f (); */
22791 {
22801 else
22804 }
22805 /* Otherwise, there are too many template parameter lists. We have
22806 something like:
22808 template <class T> template <class U> void S::f(); */
22811 }
22813 /* Parse an optional `::' token indicating that the following name is
22814 from the global namespace. If so, PARSER->SCOPE is set to the
22815 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22816 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22817 Returns the new value of PARSER->SCOPE, if the `::' token is
22818 present, and NULL_TREE otherwise. */
22820 static tree
22822 {
22825 /* Peek at the next token. */
22827 /* If we're looking at a `::' token then we're starting from the
22828 global namespace, not our current location. */
22830 {
22831 /* Consume the `::' token. */
22833 /* Set the SCOPE so that we know where to start the lookup. */
22839 }
22841 {
22845 }
22848 }
22850 /* Returns TRUE if the upcoming token sequence is the start of a
22851 constructor declarator. If FRIEND_P is true, the declarator is
22852 preceded by the `friend' specifier. */
22854 static bool
22856 {
22859 tree nested_name_specifier;
22862 /* The common case is that this is not a constructor declarator, so
22863 try to avoid doing lots of work if at all possible. It's not
22864 valid declare a constructor at function scope. */
22867 /* And only certain tokens can begin a constructor declarator. */
22875 /* Parse tentatively; we are going to roll back all of the tokens
22876 consumed here. */
22878 /* Assume that we are looking at a constructor declarator. */
22881 /* Look for the optional `::' operator. */
22884 /* Look for the nested-name-specifier. */
22885 nested_name_specifier
22896 /* Outside of a class-specifier, there must be a
22897 nested-name-specifier. */
22903 /* If we have a class scope, this is easy; DR 147 says that S::S always
22904 names the constructor, and no other qualified name could. */
22907 {
22917 }
22918 /* If we still think that this might be a constructor-declarator,
22919 look for a class-name. */
22921 {
22922 /* If we have:
22924 template <typename T> struct S {
22925 S();
22926 };
22928 we must recognize that the nested `S' names a class. */
22929 tree type_decl;
22933 none_type,
22937 /* If there was no class-name, then this is not a constructor.
22938 Otherwise, if we are in a class-specifier and we aren't
22939 handling a friend declaration, check that its type matches
22940 current_class_type (c++/38313). Note: error_mark_node
22941 is left alone for error recovery purposes. */
22943 && (outside_class_specifier_p
22948 /* If we're still considering a constructor, we have to see a `(',
22949 to begin the parameter-declaration-clause, followed by either a
22950 `)', an `...', or a decl-specifier. We need to check for a
22951 type-specifier to avoid being fooled into thinking that:
22953 S (f) (int);
22955 is a constructor. (It is actually a function named `f' that
22956 takes one parameter (of type `int') and returns a value of type
22957 `S'. */
22965 /* A parameter declaration begins with a decl-specifier,
22966 which is either the "attribute" keyword, a storage class
22967 specifier, or (usually) a type-specifier. */
22969 {
22970 tree type;
22974 /* Names appearing in the type-specifier should be looked up
22975 in the scope of the class. */
22978 else
22979 {
22982 {
22986 {
22989 }
22990 }
22992 }
22994 /* Inside the constructor parameter list, surrounding
22995 template-parameter-lists do not apply. */
22996 saved_num_template_parameter_lists
23000 /* Look for the type-specifier. */
23002 CP_PARSER_FLAGS_NONE,
23008 parser->num_template_parameter_lists
23011 /* Leave the scope of the class. */
23016 }
23017 }
23019 /* We did not really want to consume any tokens. */
23023 }
23025 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23026 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23027 they must be performed once we are in the scope of the function.
23029 Returns the function defined. */
23031 static tree
23032 cp_parser_function_definition_from_specifiers_and_declarator
23035 tree attributes,
23037 {
23038 tree fn;
23041 /* Begin the function-definition. */
23044 /* The things we're about to see are not directly qualified by any
23045 template headers we've seen thus far. */
23048 /* If there were names looked up in the decl-specifier-seq that we
23049 did not check, check them now. We must wait until we are in the
23050 scope of the function to perform the checks, since the function
23051 might be a friend. */
23055 {
23058 }
23061 {
23062 /* Skip the entire function. */
23065 }
23067 {
23068 /* Seen already, skip it. An error message has already been output. */
23072 /* If this is a function from a class, pop the nested class. */
23075 }
23076 else
23077 {
23078 timevar_id_t tv;
23081 else
23087 }
23090 }
23092 /* Parse the part of a function-definition that follows the
23093 declarator. INLINE_P is TRUE iff this function is an inline
23094 function defined within a class-specifier.
23096 Returns the function defined. */
23098 static tree
23101 {
23102 tree fn;
23108 bool fully_implicit_function_template_p
23111 tree implicit_template_parms
23114 cp_binding_level* implicit_template_scope
23120 /* If the next token is `return', then the code may be trying to
23121 make use of the "named return value" extension that G++ used to
23122 support. */
23125 {
23126 /* Consume the `return' keyword. */
23128 /* Look for the identifier that indicates what value is to be
23129 returned. */
23131 /* Issue an error message. */
23134 /* Skip tokens until we reach the start of the function body. */
23136 {
23143 }
23144 }
23145 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23146 anything declared inside `f'. */
23147 saved_in_unbraced_linkage_specification_p
23150 /* Inside the function, surrounding template-parameter-lists do not
23151 apply. */
23152 saved_num_template_parameter_lists
23158 /* If the next token is `try', `__transaction_atomic', or
23159 `__transaction_relaxed`, then we are looking at either function-try-block
23160 or function-transaction-block. Note that all of these include the
23161 function-body. */
23164 RID_TRANSACTION_ATOMIC);
23166 RID_TRANSACTION_RELAXED))
23168 RID_TRANSACTION_RELAXED);
23171 else
23172 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23177 /* Finish the function. */
23180 /* Generate code for it, if necessary. */
23182 /* Restore the saved values. */
23183 parser->in_unbraced_linkage_specification_p
23185 parser->num_template_parameter_lists
23189 parser->fully_implicit_function_template_p
23191 parser->implicit_template_parms
23193 parser->implicit_template_scope
23200 }
23202 /* Parse a template-declaration, assuming that the `export' (and
23203 `extern') keywords, if present, has already been scanned. MEMBER_P
23204 is as for cp_parser_template_declaration. */
23206 static void
23208 {
23211 tree parameter_list;
23216 /* Look for the `template' keyword. */
23221 /* And the `<'. */
23225 {
23226 /* 14.5.2.2 [temp.mem]
23228 A local class shall not have member templates. */
23233 }
23234 /* [temp]
23236 A template ... shall not have C linkage. */
23238 {
23240 /* Give it C++ linkage to avoid confusing other parts of the
23241 front end. */
23244 }
23245 else
23248 /* We cannot perform access checks on the template parameter
23249 declarations until we know what is being declared, just as we
23250 cannot check the decl-specifier list. */
23253 /* If the next token is `>', then we have an invalid
23254 specialization. Rather than complain about an invalid template
23255 parameter, issue an error message here. */
23257 {
23261 }
23262 else
23263 {
23264 /* Parse the template parameters. */
23266 }
23268 /* Get the deferred access checks from the parameter list. These
23269 will be checked once we know what is being declared, as for a
23270 member template the checks must be performed in the scope of the
23271 class containing the member. */
23274 /* Look for the `>'. */
23276 /* We just processed one more parameter list. */
23278 /* If the next token is `template', there are more template
23279 parameters. */
23281 RID_TEMPLATE))
23286 else
23287 {
23288 /* There are no access checks when parsing a template, as we do not
23289 know if a specialization will be a friend. */
23293 checks,
23294 member_p,
23299 /* If this is a member template declaration, let the front
23300 end know. */
23302 {
23307 }
23312 }
23313 /* We are done with the current parameter list. */
23318 /* Finish up. */
23321 /* Check the template arguments for a literal operator template. */
23325 {
23329 else
23330 {
23333 {
23339 }
23341 {
23349 }
23350 else
23352 }
23354 {
23357 " Expected non-type template argument pack <char...>"
23359 decl);
23360 else
23363 decl);
23364 }
23365 }
23366 /* Register member declarations. */
23369 /* For the erroneous case of a template with C linkage, we pushed an
23370 implicit C++ linkage scope; exit that scope now. */
23373 /* If DECL is a function template, we must return to parse it later.
23374 (Even though there is no definition, there might be default
23375 arguments that need handling.) */
23379 }
23381 /* Perform the deferred access checks from a template-parameter-list.
23382 CHECKS is a TREE_LIST of access checks, as returned by
23383 get_deferred_access_checks. */
23385 static void
23386 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23387 {
23391 }
23393 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23394 `function-definition' sequence that follows a template header.
23395 If MEMBER_P is true, this declaration appears in a class scope.
23397 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23398 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23400 static tree
23406 {
23409 cp_decl_specifier_seq decl_specifiers;
23413 /* This function is only used when processing a template
23414 declaration. */
23418 /* Defer access checks until we know what is being declared. */
23421 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23422 alternative. */
23425 CP_PARSER_FLAGS_OPTIONAL,
23431 /* There are no template typedefs. */
23433 {
23437 }
23439 /* Gather up the access checks that occurred the
23440 decl-specifier-seq. */
23443 /* Check for the declaration of a template class. */
23445 {
23447 {
23450 /* In this case:
23452 struct C {
23453 friend template <typename T> struct A<T>::B;
23454 };
23456 A<T>::B will be represented by a TYPENAME_TYPE, and
23457 therefore not recognized by shadow_tag. */
23459 && !decl
23466 else
23469 /* Perform access checks for template parameters. */
23471 }
23472 }
23474 /* Complain about missing 'typename' or other invalid type names. */
23477 {
23478 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23479 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23480 the rest of this declaration. */
23483 }
23485 /* If it's not a template class, try for a template function. If
23486 the next token is a `;', then this declaration does not declare
23487 anything. But, if there were errors in the decl-specifiers, then
23488 the error might well have come from an attempted class-specifier.
23489 In that case, there's no need to warn about a missing declarator. */
23493 {
23496 checks,
23498 member_p,
23499 declares_class_or_enum,
23501 NULL);
23503 /* 7.1.1-1 [dcl.stc]
23505 A storage-class-specifier shall not be specified in an explicit
23506 specialization... */
23508 && explicit_specialization_p
23510 {
23514 }
23518 }
23520 /* Look for a trailing `;' after the declaration. */
23526 out:
23529 /* Clear any current qualification; whatever comes next is the start
23530 of something new. */
23536 }
23538 /* Parse a cast-expression that is not the operand of a unary "&". */
23540 static tree
23542 {
23545 }
23547 /* Parse a functional cast to TYPE. Returns an expression
23548 representing the cast. */
23550 static tree
23552 {
23554 tree expression_list;
23555 tree cast;
23562 {
23570 tf_warning_or_error);
23571 }
23580 else
23581 {
23584 }
23587 tf_warning_or_error);
23588 /* [expr.const]/1: In an integral constant expression "only type
23589 conversions to integral or enumeration type can be used". */
23595 NIC_CONSTRUCTOR))
23598 }
23600 /* Save the tokens that make up the body of a member function defined
23601 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23602 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23603 specifiers applied to the declaration. Returns the FUNCTION_DECL
23604 for the member function. */
23606 static tree
23610 tree attributes)
23611 {
23614 tree fn;
23616 /* Create the FUNCTION_DECL. */
23619 /* If something went badly wrong, bail out now. */
23621 {
23622 /* If there's a function-body, skip it. */
23627 }
23629 /* Remember it, if there default args to post process. */
23632 /* Save away the tokens that make up the body of the
23633 function. */
23635 /* Handle function try blocks. */
23638 /* We can have braced-init-list mem-initializers before the fn body. */
23640 {
23643 {
23644 /* cache_group will stop after an un-nested { } pair, too. */
23648 /* variadic mem-inits have ... after the ')'. */
23651 }
23652 }
23654 /* Handle function try blocks. */
23659 /* Save away the inline definition; we will process it when the
23660 class is complete. */
23664 /* We need to know that this was defined in the class, so that
23665 friend templates are handled correctly. */
23668 /* Add FN to the queue of functions to be parsed later. */
23672 }
23674 /* Save the tokens that make up the in-class initializer for a non-static
23675 data member. Returns a DEFAULT_ARG. */
23677 static tree
23679 {
23681 }
23683 /* Parse a template-argument-list, as well as the trailing ">" (but
23684 not the opening "<"). See cp_parser_template_argument_list for the
23685 return value. */
23687 static tree
23689 {
23690 tree arguments;
23691 tree saved_scope;
23692 tree saved_qualifying_scope;
23693 tree saved_object_scope;
23698 /* [temp.names]
23700 When parsing a template-id, the first non-nested `>' is taken as
23701 the end of the template-argument-list rather than a greater-than
23702 operator. */
23703 saved_greater_than_is_operator_p
23706 /* Parsing the argument list may modify SCOPE, so we save it
23707 here. */
23711 /* We need to evaluate the template arguments, even though this
23712 template-id may be nested within a "sizeof". */
23717 /* Parse the template-argument-list itself. */
23721 else
23723 /* Look for the `>' that ends the template-argument-list. If we find
23724 a '>>' instead, it's probably just a typo. */
23726 {
23728 {
23729 /* In C++0x, a `>>' in a template argument list or cast
23730 expression is considered to be two separate `>'
23731 tokens. So, change the current token to a `>', but don't
23732 consume it: it will be consumed later when the outer
23733 template argument list (or cast expression) is parsed.
23734 Note that this replacement of `>' for `>>' is necessary
23735 even if we are parsing tentatively: in the tentative
23736 case, after calling
23737 cp_parser_enclosed_template_argument_list we will always
23738 throw away all of the template arguments and the first
23739 closing `>', either because the template argument list
23740 was erroneous or because we are replacing those tokens
23741 with a CPP_TEMPLATE_ID token. The second `>' (which will
23742 not have been thrown away) is needed either to close an
23743 outer template argument list or to complete a new-style
23744 cast. */
23747 }
23749 {
23750 /* If we're in a nested template argument list, the '>>' has
23751 to be a typo for '> >'. We emit the error message, but we
23752 continue parsing and we push a '>' as next token, so that
23753 the argument list will be parsed correctly. Note that the
23754 global source location is still on the token before the
23755 '>>', so we need to say explicitly where we want it. */
23761 }
23762 else
23763 {
23764 /* If this is not a nested template argument list, the '>>'
23765 is a typo for '>'. Emit an error message and continue.
23766 Same deal about the token location, but here we can get it
23767 right by consuming the '>>' before issuing the diagnostic. */
23770 "spurious %<>>%>, use %<>%> to terminate "
23772 }
23773 }
23774 else
23776 /* The `>' token might be a greater-than operator again now. */
23777 parser->greater_than_is_operator_p
23779 /* Restore the SAVED_SCOPE. */
23787 }
23789 /* MEMBER_FUNCTION is a member function, or a friend. If default
23790 arguments, or the body of the function have not yet been parsed,
23791 parse them now. */
23793 static void
23795 {
23797 /* If this member is a template, get the underlying
23798 FUNCTION_DECL. */
23802 /* There should not be any class definitions in progress at this
23803 point; the bodies of members are only parsed outside of all class
23804 definitions. */
23806 /* While we're parsing the member functions we might encounter more
23807 classes. We want to handle them right away, but we don't want
23808 them getting mixed up with functions that are currently in the
23809 queue. */
23812 /* Make sure that any template parameters are in scope. */
23815 /* If the body of the function has not yet been parsed, parse it
23816 now. */
23818 {
23819 tree function_scope;
23822 /* The function is no longer pending; we are processing it. */
23827 /* If this is a local class, enter the scope of the containing
23828 function. */
23833 /* Push the body of the function onto the lexer stack. */
23836 /* Let the front end know that we going to be defining this
23837 function. */
23841 /* Don't do access checking if it is a templated function. */
23845 /* #pragma omp declare reduction needs special parsing. */
23847 {
23852 }
23853 else
23854 /* Now, parse the body of the function. */
23861 /* Leave the scope of the containing function. */
23865 }
23867 /* Remove any template parameters from the symbol table. */
23870 /* Restore the queue. */
23873 }
23875 /* If DECL contains any default args, remember it on the unparsed
23876 functions queue. */
23878 static void
23880 {
23881 tree probe;
23884 probe;
23887 {
23891 }
23892 }
23894 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23895 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23896 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23897 from the parameter-type-list. */
23899 static tree
23902 {
23904 tree parsed_arg;
23910 /* Push the saved tokens for the default argument onto the parser's
23911 lexer stack. */
23917 /* Parse the default argument. */
23928 {
23929 /* In a non-template class, check conversions now. In a template,
23930 we'll wait and instantiate these as needed. */
23933 tf_warning_or_error);
23934 else
23936 }
23938 /* If the token stream has not been completely used up, then
23939 there was extra junk after the end of the default
23940 argument. */
23942 {
23945 else
23947 }
23949 /* Revert to the main lexer. */
23953 }
23955 /* FIELD is a non-static data member with an initializer which we saved for
23956 later; parse it now. */
23958 static void
23960 {
23961 tree def;
23968 NULL_TREE);
23974 }
23976 /* FN is a FUNCTION_DECL which may contains a parameter with an
23977 unparsed DEFAULT_ARG. Parse the default args now. This function
23978 assumes that the current scope is the scope in which the default
23979 argument should be processed. */
23981 static void
23983 {
23987 /* While we're parsing the default args, we might (due to the
23988 statement expression extension) encounter more classes. We want
23989 to handle them right away, but we don't want them getting mixed
23990 up with default args that are currently in the queue. */
23993 /* Local variable names (and the `this' keyword) may not appear
23994 in a default argument. */
24005 {
24007 tree parsed_arg;
24009 tree copy;
24016 /* This can happen for a friend declaration for a function
24017 already declared with default arguments. */
24020 parsed_arg
24022 default_arg,
24025 {
24027 }
24031 /* Update any instantiations we've already created. */
24035 }
24039 /* Make sure no default arg is missing. */
24042 /* Restore the state of local_variables_forbidden_p. */
24045 /* Restore the queue. */
24047 }
24049 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24051 sizeof ... ( identifier )
24053 where the 'sizeof' token has already been consumed. */
24055 static tree
24057 {
24058 /* Consume the `...'. */
24065 else
24073 /* The name is not qualified. */
24091 }
24093 /* Parse the operand of `sizeof' (or a similar operator). Returns
24094 either a TYPE or an expression, depending on the form of the
24095 input. The KEYWORD indicates which kind of expression we have
24096 encountered. */
24098 static tree
24100 {
24107 /* If it's a `...', then we are computing the length of a parameter
24108 pack. */
24113 /* Types cannot be defined in a `sizeof' expression. Save away the
24114 old message. */
24116 /* And create the new one. */
24122 /* The restrictions on constant-expressions do not apply inside
24123 sizeof expressions. */
24124 saved_integral_constant_expression_p
24126 saved_non_integral_constant_expression_p
24130 /* Do not actually evaluate the expression. */
24133 /* If it's a `(', then we might be looking at the type-id
24134 construction. */
24136 {
24139 /* We can't be sure yet whether we're looking at a type-id or an
24140 expression. */
24142 /* Note: as a GNU Extension, compound literals are considered
24143 postfix-expressions as they are in C99, so they are valid
24144 arguments to sizeof. See comment in cp_parser_cast_expression
24145 for details. */
24148 else
24149 {
24152 /* Look for the type-id. */
24154 /* Look for the closing `)'. */
24157 }
24159 /* If all went well, then we're done. */
24161 {
24162 cp_decl_specifier_seq decl_specs;
24164 /* Build a trivial decl-specifier-seq. */
24168 /* Call grokdeclarator to figure out what type this is. */
24171 TYPENAME,
24174 }
24175 }
24177 /* If the type-id production did not work out, then we must be
24178 looking at the unary-expression production. */
24183 /* Go back to evaluating expressions. */
24187 /* Free the message we created. */
24189 /* And restore the old one. */
24191 parser->integral_constant_expression_p
24193 parser->non_integral_constant_expression_p
24197 }
24199 /* If the current declaration has no declarator, return true. */
24201 static bool
24203 {
24204 /* If the next token is a `;' or a `,' then there is no
24205 declarator. */
24208 }
24210 /* Update the DECL_SPECS to reflect the storage class indicated by
24211 KEYWORD. */
24213 static void
24218 {
24219 cp_storage_class storage_class;
24222 {
24226 }
24228 {
24231 }
24236 {
24239 }
24242 {
24260 }
24264 /* A storage class specifier cannot be applied alongside a typedef
24265 specifier. If there is a typedef specifier present then set
24266 conflicting_specifiers_p which will trigger an error later
24267 on in grokdeclarator. */
24270 }
24272 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24273 is true, the type is a class or enum definition. */
24275 static void
24277 tree type_spec,
24280 {
24283 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24284 (with, for example, in "typedef int wchar_t;") we remember that
24285 this is what happened. In system headers, we ignore these
24286 declarations so that G++ can work with system headers that are not
24287 C++-safe. */
24289 && !type_definition_p
24299 {
24302 ds_redefined_builtin_type_spec,
24303 token);
24305 {
24309 }
24310 }
24313 else
24314 {
24319 }
24320 }
24322 /* True iff TOKEN is the GNU keyword __thread. */
24324 static bool
24326 {
24329 }
24331 /* Set the location for a declarator specifier and check if it is
24332 duplicated.
24334 DECL_SPECS is the sequence of declarator specifiers onto which to
24335 set the location.
24337 DS is the single declarator specifier to set which location is to
24338 be set onto the existing sequence of declarators.
24340 LOCATION is the location for the declarator specifier to
24341 consider. */
24343 static void
24346 {
24355 {
24359 }
24360 else
24361 {
24363 {
24367 else
24368 {
24371 OPT_Wlong_long,
24373 }
24374 }
24376 {
24381 else
24383 }
24384 else
24385 {
24401 "__complex"
24402 };
24405 }
24406 }
24407 }
24409 /* Return true iff the declarator specifier DS is present in the
24410 sequence of declarator specifiers DECL_SPECS. */
24412 bool
24414 cp_decl_spec ds)
24415 {
24422 }
24424 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24425 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24427 static bool
24429 {
24431 }
24433 /* Issue an error message indicating that TOKEN_DESC was expected.
24434 If KEYWORD is true, it indicated this function is called by
24435 cp_parser_require_keword and the required token can only be
24436 a indicated keyword. */
24438 static void
24440 required_token token_desc,
24442 {
24444 {
24513 }
24515 {
24517 {
24596 }
24597 }
24598 else
24600 }
24604 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24605 issue an error message indicating that TOKEN_DESC was expected.
24607 Returns the token consumed, if the token had the appropriate type.
24608 Otherwise, returns NULL. */
24613 required_token token_desc)
24614 {
24617 else
24618 {
24619 /* Output the MESSAGE -- unless we're parsing tentatively. */
24623 }
24624 }
24626 /* An error message is produced if the next token is not '>'.
24627 All further tokens are skipped until the desired token is
24628 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24630 static void
24632 {
24633 /* Current level of '< ... >'. */
24635 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24638 /* Are we ready, yet? If not, issue error message. */
24642 /* Skip tokens until the desired token is found. */
24644 {
24645 /* Peek at the next token. */
24647 {
24655 /* C++0x views the `>>' operator as two `>' tokens, but
24656 C++98 does not. */
24659 {
24660 /* We've hit a `>>' where the first `>' closes the
24661 template argument list, and the second `>' is
24662 spurious. Just consume the `>>' and stop; we've
24663 already produced at least one error. */
24666 }
24667 /* Fall through for C++0x, so we handle the second `>' in
24668 the `>>'. */
24672 {
24673 /* We've reached the token we want, consume it and stop. */
24676 }
24695 /* The '>' was probably forgotten, don't look further. */
24700 }
24702 /* Consume this token. */
24704 }
24705 }
24707 /* If the next token is the indicated keyword, consume it. Otherwise,
24708 issue an error message indicating that TOKEN_DESC was expected.
24710 Returns the token consumed, if the token had the appropriate type.
24711 Otherwise, returns NULL. */
24716 required_token token_desc)
24717 {
24721 {
24724 }
24727 }
24729 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24730 function-definition. */
24732 static bool
24734 {
24737 /* A ctor-initializer begins with a `:'. */
24739 /* A function-try-block begins with `try'. */
24741 /* A function-transaction-block begins with `__transaction_atomic'
24742 or `__transaction_relaxed'. */
24745 /* The named return value extension begins with `return'. */
24747 }
24749 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24750 definition. */
24752 static bool
24754 {
24761 }
24763 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24764 C++0x) ending a template-argument. */
24766 static bool
24768 {
24776 }
24778 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24779 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24781 static bool
24784 {
24790 /* Check for the sequence `<::' in the original code. It would be lexed as
24791 `[:', where `[' is a digraph, and there is no whitespace before
24792 `:'. */
24794 {
24799 }
24801 }
24803 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24804 or none_type otherwise. */
24806 static enum tag_types
24808 {
24810 {
24820 }
24821 }
24823 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
24824 or none_type otherwise or if the token is null. */
24826 static enum tag_types
24828 {
24833 {
24841 }
24842 }
24844 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24846 static void
24848 {
24852 {
24856 type))
24859 }
24860 }
24862 /* Issue an error message if DECL is redeclared with different
24863 access than its original declaration [class.access.spec/3].
24864 This applies to nested classes and nested class templates.
24865 [class.mem/1]. */
24867 static void
24869 {
24878 }
24880 /* Look for the `template' keyword, as a syntactic disambiguator.
24881 Return TRUE iff it is present, in which case it will be
24882 consumed. */
24884 static bool
24886 {
24888 {
24889 /* In C++98 the `template' keyword can only be used within templates;
24890 outside templates the parser can always figure out what is a
24891 template and what is not. In C++11, per the resolution of DR 468,
24892 `template' is allowed in cases where it is not strictly necessary. */
24895 {
24898 "in C++98 %<template%> (as a disambiguator) is only "
24900 /* If this part of the token stream is rescanned, the same
24901 error message would be generated. So, we purge the token
24902 from the stream. */
24905 }
24906 else
24907 {
24908 /* Consume the `template' keyword. */
24911 }
24912 }
24914 }
24916 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24917 set PARSER->SCOPE, and perform other related actions. */
24919 static void
24921 {
24927 /* Get the stored value. */
24929 /* Perform any access checks that were deferred. */
24932 {
24937 }
24938 /* Set the scope from the stored value. */
24942 }
24944 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24945 encounter the end of a block before what we were looking for. */
24947 static bool
24951 {
24953 {
24956 /* Abort a parenthesized expression if we encounter a semicolon. */
24960 /* If we've reached the end of the file, stop. */
24966 /* We've hit the end of an enclosing block, so there's been some
24967 kind of syntax error. */
24970 /* Consume the token. */
24972 /* See if it starts a new group. */
24974 {
24976 /* In theory this should probably check end == '}', but
24977 cp_parser_save_member_function_body needs it to exit
24978 after either '}' or ')' when called with ')'. */
24981 }
24983 {
24987 }
24992 }
24993 }
24995 /* Like above, for caching a default argument or NSDMI. Both of these are
24996 terminated by a non-nested comma, but it can be unclear whether or not a
24997 comma is nested in a template argument list unless we do more parsing.
24998 In order to handle this ambiguity, when we encounter a ',' after a '<'
24999 we try to parse what follows as a parameter-declaration-list (in the
25000 case of a default argument) or a member-declarator (in the case of an
25001 NSDMI). If that succeeds, then we stop caching. */
25003 static tree
25005 {
25010 tree default_argument;
25012 /* Add tokens until we have processed the entire default
25013 argument. We add the range [first_token, token). */
25016 {
25017 /* For list-initialization, this is straightforward. */
25020 }
25022 {
25025 /* Peek at the next token. */
25027 /* What we do depends on what token we have. */
25029 {
25030 /* In valid code, a default argument must be
25031 immediately followed by a `,' `)', or `...'. */
25034 {
25035 /* If we've seen a '<', we might be in a
25036 template-argument-list. Until Core issue 325 is
25037 resolved, we don't know how this situation ought
25038 to be handled, so try to DTRT. We check whether
25039 what comes after the comma is a valid parameter
25040 declaration list. If it is, then the comma ends
25041 the default argument; otherwise the default
25042 argument continues. */
25045 /* Set ITALP so cp_parser_parameter_declaration_list
25046 doesn't decide to commit to this parse. */
25054 {
25061 }
25062 else
25063 {
25067 }
25074 }
25077 /* If we run into a non-nested `;', `}', or `]',
25078 then the code is invalid -- but the default
25079 argument is certainly over. */
25084 /* Handle correctly int n = sizeof ... ( p ); */
25087 /* Update DEPTH, if necessary. */
25102 /* This might be the comparison operator, or it might
25103 start a template argument list. */
25110 /* Fall through for C++0x, which treats the `>>'
25111 operator like two `>' tokens in certain
25112 cases. */
25116 {
25117 /* This might be an operator, or it might close a
25118 template argument list. But if a previous '<'
25119 started a template argument list, this will have
25120 closed it, so we can't be in one anymore. */
25124 }
25127 /* If we run out of tokens, issue an error message. */
25136 /* In these cases, we should look for template-ids.
25137 For example, if the default argument is
25138 `X<int, double>()', we need to do name lookup to
25139 figure out whether or not `X' is a template; if
25140 so, the `,' does not end the default argument.
25142 That is not yet done. */
25147 }
25149 /* If we've reached the end, stop. */
25153 /* Add the token to the token block. */
25155 }
25157 /* Create a DEFAULT_ARG to represent the unparsed default
25158 argument. */
25165 }
25167 /* Begin parsing tentatively. We always save tokens while parsing
25168 tentatively so that if the tentative parsing fails we can restore the
25169 tokens. */
25171 static void
25173 {
25174 /* Enter a new parsing context. */
25176 /* Begin saving tokens. */
25178 /* In order to avoid repetitive access control error messages,
25179 access checks are queued up until we are no longer parsing
25180 tentatively. */
25182 }
25184 /* Commit to the currently active tentative parse. */
25186 static void
25188 {
25192 /* Mark all of the levels as committed. */
25195 {
25202 }
25203 }
25205 /* Commit to the topmost currently active tentative parse.
25207 Note that this function shouldn't be called when there are
25208 irreversible side-effects while in a tentative state. For
25209 example, we shouldn't create a permanent entry in the symbol
25210 table, or issue an error message that might not apply if the
25211 tentative parse is aborted. */
25213 static void
25215 {
25220 {
25228 }
25229 }
25231 /* Abort the currently active tentative parse. All consumed tokens
25232 will be rolled back, and no diagnostics will be issued. */
25234 static void
25236 {
25240 /* Now, pretend that we want to see if the construct was
25241 successfully parsed. */
25243 }
25245 /* Stop parsing tentatively. If a parse error has occurred, restore the
25246 token stream. Otherwise, commit to the tokens we have consumed.
25247 Returns true if no error occurred; false otherwise. */
25249 static bool
25251 {
25255 /* Remember whether or not an error occurred, since we are about to
25256 destroy that information. */
25258 /* Remove the topmost context from the stack. */
25261 /* If no parse errors occurred, commit to the tentative parse. */
25263 {
25264 /* Commit to the tokens read tentatively, unless that was
25265 already done. */
25270 }
25271 /* Otherwise, if errors occurred, roll back our state so that things
25272 are just as they were before we began the tentative parse. */
25273 else
25274 {
25277 }
25278 /* Add the context to the front of the free list. */
25283 }
25285 /* Returns true if we are parsing tentatively and are not committed to
25286 this tentative parse. */
25288 static bool
25290 {
25293 }
25295 /* Returns nonzero iff an error has occurred during the most recent
25296 tentative parse. */
25298 static bool
25300 {
25303 }
25305 /* Returns nonzero if GNU extensions are allowed. */
25307 static bool
25309 {
25311 }
25312 \f
25313 /* Objective-C++ Productions */
25316 /* Parse an Objective-C expression, which feeds into a primary-expression
25317 above.
25319 objc-expression:
25320 objc-message-expression
25321 objc-string-literal
25322 objc-encode-expression
25323 objc-protocol-expression
25324 objc-selector-expression
25326 Returns a tree representation of the expression. */
25328 static tree
25330 {
25331 /* Try to figure out what kind of declaration is present. */
25335 {
25345 {
25357 }
25363 }
25366 }
25368 /* Parse an Objective-C message expression.
25370 objc-message-expression:
25371 [ objc-message-receiver objc-message-args ]
25373 Returns a representation of an Objective-C message. */
25375 static tree
25377 {
25386 }
25388 /* Parse an objc-message-receiver.
25390 objc-message-receiver:
25391 expression
25392 simple-type-specifier
25394 Returns a representation of the type or expression. */
25396 static tree
25398 {
25399 tree rcv;
25401 /* An Objective-C message receiver may be either (1) a type
25402 or (2) an expression. */
25411 CP_PARSER_FLAGS_NONE);
25414 }
25416 /* Parse the arguments and selectors comprising an Objective-C message.
25418 objc-message-args:
25419 objc-selector
25420 objc-selector-args
25421 objc-selector-args , objc-comma-args
25423 objc-selector-args:
25424 objc-selector [opt] : assignment-expression
25425 objc-selector-args objc-selector [opt] : assignment-expression
25427 objc-comma-args:
25428 assignment-expression
25429 objc-comma-args , assignment-expression
25431 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25432 selector arguments and TREE_VALUE containing a list of comma
25433 arguments. */
25435 static tree
25437 {
25443 {
25449 /* Detect if we have a unary selector. */
25458 sel_args
25463 }
25465 /* Handle non-selector arguments, if any. */
25467 {
25468 tree arg;
25473 addl_args
25478 }
25481 {
25484 }
25487 }
25489 /* Parse an Objective-C encode expression.
25491 objc-encode-expression:
25492 @encode objc-typename
25494 Returns an encoded representation of the type argument. */
25496 static tree
25498 {
25499 tree type;
25509 {
25513 }
25515 /* This happens if we find @encode(T) (where T is a template
25516 typename or something dependent on a template typename) when
25517 parsing a template. In that case, we can't compile it
25518 immediately, but we rather create an AT_ENCODE_EXPR which will
25519 need to be instantiated when the template is used.
25520 */
25522 {
25526 }
25529 }
25531 /* Parse an Objective-C @defs expression. */
25533 static tree
25535 {
25536 tree name;
25544 }
25546 /* Parse an Objective-C protocol expression.
25548 objc-protocol-expression:
25549 @protocol ( identifier )
25551 Returns a representation of the protocol expression. */
25553 static tree
25555 {
25556 tree proto;
25564 }
25566 /* Parse an Objective-C selector expression.
25568 objc-selector-expression:
25569 @selector ( objc-method-signature )
25571 objc-method-signature:
25572 objc-selector
25573 objc-selector-seq
25575 objc-selector-seq:
25576 objc-selector :
25577 objc-selector-seq objc-selector :
25579 Returns a representation of the method selector. */
25581 static tree
25583 {
25595 {
25604 {
25605 /* Detect if we have a unary selector. */
25607 {
25610 }
25611 else
25612 {
25614 }
25615 }
25620 {
25621 sel_seq
25624 sel_seq
25627 }
25628 else
25629 sel_seq
25634 }
25636 finish_selector:
25640 }
25642 /* Parse a list of identifiers.
25644 objc-identifier-list:
25645 identifier
25646 objc-identifier-list , identifier
25648 Returns a TREE_LIST of identifier nodes. */
25650 static tree
25652 {
25653 tree identifier;
25654 tree list;
25665 {
25672 identifier));
25674 }
25677 }
25679 /* Parse an Objective-C alias declaration.
25681 objc-alias-declaration:
25682 @compatibility_alias identifier identifier ;
25684 This function registers the alias mapping with the Objective-C front end.
25685 It returns nothing. */
25687 static void
25689 {
25697 }
25699 /* Parse an Objective-C class forward-declaration.
25701 objc-class-declaration:
25702 @class objc-identifier-list ;
25704 The function registers the forward declarations with the Objective-C
25705 front end. It returns nothing. */
25707 static void
25709 {
25712 {
25713 tree id;
25723 else
25725 }
25727 }
25729 /* Parse a list of Objective-C protocol references.
25731 objc-protocol-refs-opt:
25732 objc-protocol-refs [opt]
25734 objc-protocol-refs:
25735 < objc-identifier-list >
25737 Returns a TREE_LIST of identifiers, if any. */
25739 static tree
25741 {
25745 {
25749 }
25752 }
25754 /* Parse a Objective-C visibility specification. */
25756 static void
25758 {
25762 {
25777 }
25779 /* Eat '@private'/'@protected'/'@public'. */
25781 }
25783 /* Parse an Objective-C method type. Return 'true' if it is a class
25784 (+) method, and 'false' if it is an instance (-) method. */
25788 {
25791 else
25793 }
25795 /* Parse an Objective-C protocol qualifier. */
25797 static tree
25799 {
25812 {
25817 }
25820 }
25822 /* Parse an Objective-C typename. */
25824 static tree
25826 {
25830 {
25836 /* An ObjC type name may consist of just protocol qualifiers, in which
25837 case the type shall default to 'id'. */
25839 {
25842 /* If the type could not be parsed, an error has already
25843 been produced. For error recovery, behave as if it had
25844 not been specified, which will use the default type
25845 'id'. */
25847 {
25849 /* We need to skip to the closing parenthesis as
25850 cp_parser_type_id() does not seem to do it for
25851 us. */
25856 }
25857 }
25861 }
25864 }
25866 /* Check to see if TYPE refers to an Objective-C selector name. */
25868 static bool
25870 {
25876 }
25878 /* Parse an Objective-C selector. */
25880 static tree
25882 {
25886 {
25889 }
25891 /* C++ operator names are allowed to appear in ObjC selectors. */
25893 {
25906 }
25907 }
25909 /* Parse an Objective-C params list. */
25911 static tree
25913 {
25919 {
25929 /* Detect if we have a unary selector. */
25932 {
25935 }
25939 {
25940 /* Something went quite wrong. There should be a colon
25941 here, but there is not. Stop parsing parameters. */
25943 }
25945 /* New ObjC allows attributes on parameters too. */
25950 params
25953 type_name,
25954 identifier,
25955 parm_attr));
25958 }
25961 {
25964 }
25966 /* We allow tail attributes for the method. */
25968 {
25976 }
25979 {
25982 }
25984 }
25986 /* Parse the non-keyword Objective-C params. */
25988 static tree
25991 {
25997 {
25999 tree parm;
26005 {
26010 }
26012 /* TODO: parse attributes for tail parameters. */
26021 }
26023 /* We allow tail attributes for the method. */
26025 {
26027 {
26032 }
26033 else
26034 /* We have an error, but parse the attributes, so that we can
26035 carry on. */
26041 }
26044 }
26046 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26048 static void
26050 {
26053 /* If the next token is `extern' and the following token is a string
26054 literal, then we have a linkage specification. */
26056 && cp_parser_is_pure_string_literal
26059 /* Handle #pragma, if any. */
26062 /* Allow stray semicolons. */
26065 /* Mark methods as optional or required, when building protocols. */
26067 {
26070 }
26072 {
26075 }
26078 /* Other stray characters must generate errors. */
26080 {
26084 }
26085 /* Finally, try to parse a block-declaration, or a function-definition. */
26086 else
26088 }
26090 /* Parse a method signature. */
26092 static tree
26094 {
26110 }
26112 static bool
26114 {
26115 tree tattr;
26120 /* If the attributes are followed by a method introducer, this is not allowed.
26121 Dump the attributes and flag the situation. */
26126 /* Otherwise, the attributes introduce some interstitial code, possibly so
26127 rewind to allow that check. */
26130 }
26132 /* Parse an Objective-C method prototype list. */
26134 static void
26136 {
26140 {
26142 {
26147 else
26151 {
26155 }
26158 }
26164 OPT_Wattributes,
26166 else
26167 /* Allow for interspersed non-ObjC++ code. */
26171 }
26175 else
26179 }
26181 /* Parse an Objective-C method definition list. */
26183 static void
26185 {
26189 {
26190 tree meth;
26193 {
26199 else
26204 {
26208 }
26210 NULL_TREE);
26212 /* For historical reasons, we accept an optional semicolon. */
26219 {
26226 }
26227 }
26228 /* The following case will be removed once @synthesize is
26229 completely implemented. */
26240 else
26241 /* Allow for interspersed non-ObjC++ code. */
26245 }
26249 else
26253 }
26255 /* Parse Objective-C ivars. */
26257 static void
26259 {
26270 {
26271 cp_decl_specifier_seq declspecs;
26273 tree prefix_attributes;
26281 CP_PARSER_FLAGS_OPTIONAL,
26285 /* auto, register, static, extern, mutable. */
26287 {
26290 }
26292 /* thread_local. */
26294 {
26297 }
26299 /* typedef. */
26301 {
26304 }
26309 /* Keep going until we hit the `;' at the end of the
26310 declaration. */
26312 {
26317 /* Check for a (possibly unnamed) bitfield declaration. */
26325 {
26326 /* Get the name of the bitfield. */
26329 sfk_none);
26331 eat_colon:
26333 /* Get the width of the bitfield. */
26334 width
26337 NULL);
26338 }
26339 else
26340 {
26341 /* Parse the declarator. */
26342 declarator
26348 }
26350 /* Look for attributes that apply to the ivar. */
26352 /* Remember which attributes are prefix attributes and
26353 which are not. */
26355 /* Combine the attributes. */
26359 /* Create the bitfield declaration. */
26361 width,
26362 attributes);
26363 else
26368 /* Add the instance variable. */
26372 /* Reset PREFIX_ATTRIBUTES. */
26381 {
26384 }
26386 }
26390 }
26395 /* Do not consume the RID_AT_END, so it will be read again as terminating
26396 the @interface of @implementation. */
26400 /* For historical reasons, we accept an optional semicolon. */
26403 }
26405 /* Parse an Objective-C protocol declaration. */
26407 static void
26409 {
26415 {
26420 }
26422 /* See if we have a forward declaration or a definition. */
26425 /* Try a forward declaration first. */
26427 {
26429 {
26430 tree id;
26440 else
26442 }
26444 }
26446 /* Ok, we got a full-fledged definition (or at least should). */
26447 else
26448 {
26453 }
26454 }
26456 /* Parse an Objective-C superclass or category. */
26458 static void
26463 {
26469 {
26472 }
26474 {
26477 /* If there is no category name, and this is an @interface, we
26478 have a class extension. */
26480 {
26483 }
26484 else
26488 }
26489 }
26491 /* Parse an Objective-C class interface. */
26493 static void
26495 {
26502 {
26503 /* It's hard to recover because even if valid @interface stuff
26504 is to follow, we can't compile it (or validate it) if we
26505 don't even know which class it refers to. Let's assume this
26506 was a stray '@interface' token in the stream and skip it.
26507 */
26509 }
26514 /* We have either a class or a category on our hands. */
26517 else
26518 {
26520 /* Handle instance variable declarations, if any. */
26523 }
26526 }
26528 /* Parse an Objective-C class implementation. */
26530 static void
26532 {
26539 {
26540 /* It's hard to recover because even if valid @implementation
26541 stuff is to follow, we can't compile it (or validate it) if
26542 we don't even know which class it refers to. Let's assume
26543 this was a stray '@implementation' token in the stream and
26544 skip it.
26545 */
26547 }
26551 /* We have either a class or a category on our hands. */
26554 else
26555 {
26557 /* Handle instance variable declarations, if any. */
26560 }
26563 }
26565 /* Consume the @end token and finish off the implementation. */
26567 static void
26569 {
26572 }
26574 /* Parse an Objective-C declaration. */
26576 static void
26578 {
26579 /* Try to figure out what kind of declaration is present. */
26584 {
26600 }
26603 {
26626 }
26627 }
26629 /* Parse an Objective-C try-catch-finally statement.
26631 objc-try-catch-finally-stmt:
26632 @try compound-statement objc-catch-clause-seq [opt]
26633 objc-finally-clause [opt]
26635 objc-catch-clause-seq:
26636 objc-catch-clause objc-catch-clause-seq [opt]
26638 objc-catch-clause:
26639 @catch ( objc-exception-declaration ) compound-statement
26641 objc-finally-clause:
26642 @finally compound-statement
26644 objc-exception-declaration:
26645 parameter-declaration
26646 '...'
26648 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26650 Returns NULL_TREE.
26652 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26653 for C. Keep them in sync. */
26655 static tree
26657 {
26658 location_t location;
26659 tree stmt;
26664 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26665 node, lest it get absorbed into the surrounding block. */
26671 {
26680 {
26681 /* We have "@catch (...)" (where the '...' are literally
26682 what is in the code). Skip the '...'.
26683 parameter_declaration is set to NULL_TREE, and
26684 objc_being_catch_clauses() knows that that means
26685 '...'. */
26688 }
26689 else
26690 {
26691 /* We have "@catch (NSException *exception)" or something
26692 like that. Parse the parameter declaration. */
26696 else
26701 }
26704 else
26705 {
26706 /* If there was no open parenthesis, we are recovering from
26707 an error, and we are trying to figure out what mistake
26708 the user has made. */
26710 /* If there is an immediate closing parenthesis, the user
26711 probably forgot the opening one (ie, they typed "@catch
26712 NSException *e)". Parse the closing parenthesis and keep
26713 going. */
26717 /* If these is no immediate closing parenthesis, the user
26718 probably doesn't know that parenthesis are required at
26719 all (ie, they typed "@catch NSException *e"). So, just
26720 forget about the closing parenthesis and keep going. */
26721 }
26725 }
26727 {
26730 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26731 node, lest it get absorbed into the surrounding block. */
26735 }
26738 }
26740 /* Parse an Objective-C synchronized statement.
26742 objc-synchronized-stmt:
26743 @synchronized ( expression ) compound-statement
26745 Returns NULL_TREE. */
26747 static tree
26749 {
26750 location_t location;
26761 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26762 node, lest it get absorbed into the surrounding block. */
26767 }
26769 /* Parse an Objective-C throw statement.
26771 objc-throw-stmt:
26772 @throw assignment-expression [opt] ;
26774 Returns a constructed '@throw' statement. */
26776 static tree
26778 {
26790 }
26792 /* Parse an Objective-C statement. */
26794 static tree
26796 {
26797 /* Try to figure out what kind of declaration is present. */
26801 {
26812 }
26815 }
26817 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26818 look ahead to see if an objc keyword follows the attributes. This
26819 is to detect the use of prefix attributes on ObjC @interface and
26820 @protocol. */
26822 static bool
26824 {
26829 {
26832 }
26835 }
26837 /* This routine is a minimal replacement for
26838 c_parser_struct_declaration () used when parsing the list of
26839 types/names or ObjC++ properties. For example, when parsing the
26840 code
26842 @property (readonly) int a, b, c;
26844 this function is responsible for parsing "int a, int b, int c" and
26845 returning the declarations as CHAIN of DECLs.
26847 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26848 similar parsing. */
26849 static tree
26851 {
26853 cp_decl_specifier_seq declspecs;
26855 tree prefix_attributes;
26858 CP_PARSER_FLAGS_NONE,
26865 /* auto, register, static, extern, mutable. */
26867 {
26870 }
26872 /* thread_local. */
26874 {
26877 }
26879 /* typedef. */
26881 {
26884 }
26889 /* Keep going until we hit the `;' at the end of the declaration. */
26891 {
26896 /* Parse the declarator. */
26900 /* Look for attributes that apply to the ivar. */
26902 /* Remember which attributes are prefix attributes and
26903 which are not. */
26905 /* Combine the attributes. */
26915 /* Reset PREFIX_ATTRIBUTES. */
26926 {
26929 }
26930 else
26932 }
26934 }
26936 /* Parse an Objective-C @property declaration. The syntax is:
26938 objc-property-declaration:
26939 '@property' objc-property-attributes[opt] struct-declaration ;
26941 objc-property-attributes:
26942 '(' objc-property-attribute-list ')'
26944 objc-property-attribute-list:
26945 objc-property-attribute
26946 objc-property-attribute-list, objc-property-attribute
26948 objc-property-attribute
26949 'getter' = identifier
26950 'setter' = identifier
26951 'readonly'
26952 'readwrite'
26953 'assign'
26954 'retain'
26955 'copy'
26956 'nonatomic'
26958 For example:
26959 @property NSString *name;
26960 @property (readonly) id object;
26961 @property (retain, nonatomic, getter=getTheName) id name;
26962 @property int a, b, c;
26964 PS: This function is identical to
26965 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26966 static void
26968 {
26969 /* The following variables hold the attributes of the properties as
26970 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26971 seen. When we see an attribute, we set them to 'true' (if they
26972 are boolean properties) or to the identifier (if they have an
26973 argument, ie, for getter and setter). Note that here we only
26974 parse the list of attributes, check the syntax and accumulate the
26975 attributes that we find. objc_add_property_declaration() will
26976 then process the information. */
26986 /* 'properties' is the list of properties that we read. Usually a
26987 single one, but maybe more (eg, in "@property int a, b, c;" there
26988 are three). */
26989 tree properties;
26990 location_t loc;
26996 /* Parse the optional attribute list... */
26998 {
26999 /* Eat the '('. */
27003 {
27009 {
27012 }
27016 {
27027 {
27031 else
27036 }
27039 {
27043 }
27045 {
27047 {
27050 }
27051 else
27055 else
27057 }
27058 else
27059 {
27061 {
27064 }
27065 else
27067 }
27073 }
27080 else
27082 }
27084 /* FIXME: "@property (setter, assign);" will generate a spurious
27085 "error: expected ‘)’ before ‘,’ token". This is because
27086 cp_parser_require, unlike the C counterpart, will produce an
27087 error even if we are in error recovery. */
27089 {
27094 }
27095 }
27097 /* ... and the property declaration(s). */
27101 {
27103 /* If the next token is now a `;', consume it. */
27107 }
27111 else
27112 {
27113 /* Comma-separated properties are chained together in
27114 reverse order; add them one by one. */
27123 }
27126 }
27128 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27130 objc-synthesize-declaration:
27131 @synthesize objc-synthesize-identifier-list ;
27133 objc-synthesize-identifier-list:
27134 objc-synthesize-identifier
27135 objc-synthesize-identifier-list, objc-synthesize-identifier
27137 objc-synthesize-identifier
27138 identifier
27139 identifier = identifier
27141 For example:
27142 @synthesize MyProperty;
27143 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27145 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27146 for C. Keep them in sync.
27147 */
27148 static void
27150 {
27152 location_t loc;
27157 {
27161 {
27164 }
27166 {
27170 {
27173 }
27174 }
27175 else
27180 else
27182 }
27185 }
27187 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27189 objc-dynamic-declaration:
27190 @dynamic identifier-list ;
27192 For example:
27193 @dynamic MyProperty;
27194 @dynamic MyProperty, AnotherProperty;
27196 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27197 for C. Keep them in sync.
27198 */
27199 static void
27201 {
27203 location_t loc;
27208 {
27209 tree property;
27212 {
27215 }
27219 else
27221 }
27224 }
27226 \f
27227 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27229 /* Returns name of the next clause.
27230 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27231 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27232 returned and the token is consumed. */
27234 static pragma_omp_clause
27236 {
27248 {
27253 {
27356 }
27357 }
27363 }
27365 /* Validate that a clause of the given type does not already exist. */
27367 static void
27370 {
27371 tree c;
27375 {
27378 }
27379 }
27381 /* OpenMP 2.5:
27382 variable-list:
27383 identifier
27384 variable-list , identifier
27386 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27387 colon). An opening parenthesis will have been consumed by the caller.
27389 If KIND is nonzero, create the appropriate node and install the decl
27390 in OMP_CLAUSE_DECL and add the node to the head of the list.
27392 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27393 return the list created.
27395 COLON can be NULL if only closing parenthesis should end the list,
27396 or pointer to bool which will receive false if the list is terminated
27397 by closing parenthesis or true if the list is terminated by colon. */
27399 static tree
27402 {
27406 {
27409 }
27411 {
27428 {
27430 {
27436 {
27444 parser->colon_corrects_to_scope_p
27448 else
27449 {
27450 /* Look for `:'. */
27454 CPP_CLOSE_SQUARE))
27456 }
27457 /* Look for the closing `]'. */
27459 RT_CLOSE_SQUARE))
27462 }
27466 }
27472 }
27473 else
27476 get_comma:
27480 }
27486 {
27490 }
27493 {
27496 /* Try to resync to an unnested comma. Copied from
27497 cp_parser_parenthesized_expression_list. */
27498 skip_comma:
27507 }
27510 }
27512 /* Similarly, but expect leading and trailing parenthesis. This is a very
27513 common case for omp clauses. */
27515 static tree
27517 {
27521 }
27523 /* OpenMP 3.0:
27524 collapse ( constant-expression ) */
27526 static tree
27528 {
27530 location_t loc;
27531 HOST_WIDE_INT n;
27551 {
27554 }
27562 }
27564 /* OpenMP 2.5:
27565 default ( shared | none ) */
27567 static tree
27569 {
27571 tree c;
27576 {
27581 {
27596 }
27599 }
27600 else
27601 {
27602 invalid_kind:
27604 }
27620 }
27622 /* OpenMP 3.1:
27623 final ( expression ) */
27625 static tree
27627 {
27648 }
27650 /* OpenMP 2.5:
27651 if ( expression ) */
27653 static tree
27655 {
27676 }
27678 /* OpenMP 3.1:
27679 mergeable */
27681 static tree
27684 {
27685 tree c;
27688 location);
27693 }
27695 /* OpenMP 2.5:
27696 nowait */
27698 static tree
27701 {
27702 tree c;
27709 }
27711 /* OpenMP 2.5:
27712 num_threads ( expression ) */
27714 static tree
27716 location_t location)
27717 {
27739 }
27741 /* OpenMP 2.5:
27742 ordered */
27744 static tree
27747 {
27748 tree c;
27756 }
27758 /* OpenMP 2.5:
27759 reduction ( reduction-operator : variable-list )
27761 reduction-operator:
27762 One of: + * - & ^ | && ||
27764 OpenMP 3.1:
27766 reduction-operator:
27767 One of: + * - & ^ | && || min max
27769 OpenMP 4.0:
27771 reduction-operator:
27772 One of: + * - & ^ | && ||
27773 id-expression */
27775 static tree
27777 {
27785 {
27795 }
27799 else
27800 {
27811 {
27841 }
27842 else
27843 {
27845 resync_fail:
27850 }
27851 }
27857 NULL);
27859 {
27862 }
27865 }
27867 /* OpenMP 2.5:
27868 schedule ( schedule-kind )
27869 schedule ( schedule-kind , expression )
27871 schedule-kind:
27872 static | dynamic | guided | runtime | auto */
27874 static tree
27876 {
27885 {
27890 {
27911 }
27912 }
27917 else
27922 {
27937 else
27942 }
27950 invalid_kind:
27952 resync_fail:
27957 }
27959 /* OpenMP 3.0:
27960 untied */
27962 static tree
27965 {
27966 tree c;
27973 }
27975 /* OpenMP 4.0:
27976 inbranch
27977 notinbranch */
27979 static tree
27982 {
27987 }
27989 /* OpenMP 4.0:
27990 parallel
27991 for
27992 sections
27993 taskgroup */
27995 static tree
27999 {
28003 }
28005 /* OpenMP 4.0:
28006 num_teams ( expression ) */
28008 static tree
28010 location_t location)
28011 {
28033 }
28035 /* OpenMP 4.0:
28036 thread_limit ( expression ) */
28038 static tree
28040 location_t location)
28041 {
28063 }
28065 /* OpenMP 4.0:
28066 aligned ( variable-list )
28067 aligned ( variable-list : constant-expression ) */
28069 static tree
28071 {
28082 {
28092 }
28098 }
28100 /* OpenMP 4.0:
28101 linear ( variable-list )
28102 linear ( variable-list : expression ) */
28104 static tree
28107 {
28118 {
28122 {
28125 }
28133 }
28139 }
28141 /* OpenMP 4.0:
28142 safelen ( constant-expression ) */
28144 static tree
28146 location_t location)
28147 {
28168 }
28170 /* OpenMP 4.0:
28171 simdlen ( constant-expression ) */
28173 static tree
28175 location_t location)
28176 {
28197 }
28199 /* OpenMP 4.0:
28200 depend ( depend-kind : variable-list )
28202 depend-kind:
28203 in | out | inout */
28205 static tree
28207 {
28215 {
28225 else
28227 }
28228 else
28236 NULL);
28243 invalid_kind:
28245 resync_fail:
28250 }
28252 /* OpenMP 4.0:
28253 map ( map-kind : variable-list )
28254 map ( variable-list )
28256 map-kind:
28257 alloc | to | from | tofrom */
28259 static tree
28261 {
28270 {
28282 else
28283 {
28289 }
28292 }
28295 NULL);
28301 }
28303 /* OpenMP 4.0:
28304 device ( expression ) */
28306 static tree
28308 location_t location)
28309 {
28331 }
28333 /* OpenMP 4.0:
28334 dist_schedule ( static )
28335 dist_schedule ( static , expression ) */
28337 static tree
28339 location_t location)
28340 {
28353 {
28364 }
28369 location);
28373 invalid_kind:
28375 resync_fail:
28380 }
28382 /* OpenMP 4.0:
28383 proc_bind ( proc-bind-kind )
28385 proc-bind-kind:
28386 master | close | spread */
28388 static tree
28390 location_t location)
28391 {
28392 tree c;
28399 {
28409 else
28411 }
28412 else
28421 location);
28426 invalid_kind:
28428 resync_fail:
28433 }
28435 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28436 is a bitmask in MASK. Return the list of clauses found; the result
28437 of clause default goes in *pdefault. */
28439 static tree
28443 {
28450 {
28451 pragma_omp_clause c_kind;
28462 {
28474 clauses);
28488 clauses);
28497 clauses);
28521 clauses);
28535 clauses);
28552 OMP_CLAUSE_NOTINBRANCH,
28561 {
28562 clause_not_first:
28566 }
28591 clauses);
28596 clauses);
28601 clauses);
28664 }
28669 {
28670 /* Remove the invalid clause(s) from the list to avoid
28671 confusing the rest of the compiler. */
28674 }
28675 }
28676 saw_error:
28677 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28678 no reason to skip to the end. */
28684 }
28686 /* OpenMP 2.5:
28687 structured-block:
28688 statement
28690 In practice, we're also interested in adding the statement to an
28691 outer node. So it is convenient if we work around the fact that
28692 cp_parser_statement calls add_stmt. */
28694 static unsigned
28696 {
28699 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28700 This preserves the "not within loop or switch" style error messages
28701 for nonsense cases like
28702 void foo() {
28703 #pragma omp single
28704 break;
28705 }
28706 */
28711 }
28713 static void
28715 {
28717 }
28719 static tree
28721 {
28729 }
28731 /* OpenMP 2.5:
28732 # pragma omp atomic new-line
28733 expression-stmt
28735 expression-stmt:
28736 x binop= expr | x++ | ++x | x-- | --x
28737 binop:
28738 +, *, -, /, &, ^, |, <<, >>
28740 where x is an lvalue expression with scalar type.
28742 OpenMP 3.1:
28743 # pragma omp atomic new-line
28744 update-stmt
28746 # pragma omp atomic read new-line
28747 read-stmt
28749 # pragma omp atomic write new-line
28750 write-stmt
28752 # pragma omp atomic update new-line
28753 update-stmt
28755 # pragma omp atomic capture new-line
28756 capture-stmt
28758 # pragma omp atomic capture new-line
28759 capture-block
28761 read-stmt:
28762 v = x
28763 write-stmt:
28764 x = expr
28765 update-stmt:
28766 expression-stmt | x = x binop expr
28767 capture-stmt:
28768 v = expression-stmt
28769 capture-block:
28770 { v = x; update-stmt; } | { update-stmt; v = x; }
28772 OpenMP 4.0:
28773 update-stmt:
28774 expression-stmt | x = x binop expr | x = expr binop x
28775 capture-stmt:
28776 v = update-stmt
28777 capture-block:
28778 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28780 where x and v are lvalue expressions with scalar type. */
28782 static void
28784 {
28792 {
28797 {
28803 }
28804 }
28806 {
28818 else
28822 }
28824 {
28830 {
28835 {
28838 }
28839 }
28840 }
28844 {
28855 else
28861 {
28862 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28863 opcode. */
28868 }
28872 {
28875 }
28876 else
28877 {
28884 }
28887 }
28889 restart:
28894 {
28901 /* FALLTHROUGH */
28911 /* FALLTHROUGH */
28926 /* Undo effects of boolean_increment for post {in,de}crement. */
28928 /* FALLTHRU */
28932 {
28933 /* Undo effects of boolean_increment. */
28935 {
28936 /* This is pre or post increment. */
28941 && !structured_block
28945 }
28946 }
28947 /* FALLTHRU */
28950 {
28985 {
28989 }
28992 {
28998 {
29003 }
29005 {
29016 {
29018 {
29023 }
29024 else
29026 }
29030 }
29033 {
29040 }
29044 }
29048 {
29051 {
29059 }
29061 {
29066 }
29101 }
29112 /* FALLTHROUGH */
29117 }
29124 }
29125 stmt_done:
29127 {
29140 }
29142 {
29145 }
29146 done:
29152 saw_error:
29155 {
29159 {
29163 }
29164 }
29165 }
29168 /* OpenMP 2.5:
29169 # pragma omp barrier new-line */
29171 static void
29173 {
29176 }
29178 /* OpenMP 2.5:
29179 # pragma omp critical [(name)] new-line
29180 structured-block */
29182 static tree
29184 {
29188 {
29200 }
29205 }
29207 /* OpenMP 2.5:
29208 # pragma omp flush flush-vars[opt] new-line
29210 flush-vars:
29211 ( variable-list ) */
29213 static void
29215 {
29221 }
29223 /* Helper function, to parse omp for increment expression. */
29225 static tree
29227 {
29232 {
29235 }
29238 {
29247 /* Fall through: OpenMP disallows NE_EXPR. */
29250 }
29252 /* If decl is an iterator, preserve LHS and RHS of the relational
29253 expr until finish_omp_for. */
29263 }
29265 /* Helper function, to parse omp for increment expression. */
29267 static tree
29269 {
29273 cp_id_kind idk;
29277 {
29285 }
29293 {
29298 }
29305 {
29309 }
29321 do
29322 {
29329 {
29331 {
29334 else
29336 tf_warning_or_error);
29337 }
29338 else
29341 }
29342 }
29346 {
29350 }
29351 else
29355 }
29357 /* Parse the initialization statement of either an OpenMP for loop or
29358 a Cilk Plus for loop.
29360 Return true if the resulting construct should have an
29361 OMP_CLAUSE_PRIVATE added to it. */
29363 static bool
29371 {
29377 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29379 init-expr:
29380 var = lb
29381 integer-type var = lb
29382 random-access-iterator-type var = lb
29383 pointer-type var = lb
29384 */
29385 cp_decl_specifier_seq type_specifiers;
29387 /* First, try to parse as an initialized declaration. See
29388 cp_parser_condition, from whence the bulk of this is copied. */
29395 {
29396 /* If parsing a type specifier seq succeeded, then this
29397 MUST be a initialized declaration. */
29402 CP_PARSER_DECLARATOR_NAMED,
29413 else
29414 {
29424 {
29426 CPP_OPEN_PAREN))
29427 {
29431 else
29434 }
29435 else
29436 /* Trigger an error. */
29441 }
29445 {
29453 {
29456 auto_node);
29461 }
29464 asm_specification,
29465 LOOKUP_ONLYCONVERTING);
29467 {
29470 }
29471 else
29474 }
29475 else
29476 {
29477 /* Consume '='. */
29481 non_class:
29484 else
29487 asm_specification,
29488 LOOKUP_ONLYCONVERTING);
29489 }
29493 }
29494 }
29495 else
29496 {
29497 cp_id_kind idk;
29498 /* If parsing a type specifier sequence failed, then
29499 this MUST be a simple expression. */
29507 && decl
29510 {
29511 tree rhs;
29518 rhs,
29519 tf_warning_or_error));
29521 }
29522 else
29523 {
29528 {
29532 }
29533 }
29534 }
29536 }
29538 /* Parse the restricted form of the for statement allowed by OpenMP. */
29540 static tree
29543 {
29547 location_t loc_first;
29566 {
29569 location_t loc;
29573 {
29576 }
29579 {
29582 }
29591 add_private_clause
29598 {
29601 {
29607 }
29608 else
29610 }
29617 {
29622 {
29626 }
29629 {
29630 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29631 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29636 {
29639 }
29640 else
29641 {
29644 }
29648 }
29649 else
29650 {
29655 }
29656 }
29659 {
29660 tree c;
29662 {
29671 decl);
29675 decl);
29676 }
29678 {
29683 {
29686 }
29687 }
29688 }
29697 {
29698 /* If decl is an iterator, preserve the operator on decl
29699 until finish_omp_for. */
29701 && ((processing_template_decl
29705 else
29709 }
29724 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29725 in between the collapsed for loops to be still considered perfectly
29726 nested. Hopefully the final version clarifies this.
29727 For now handle (multiple) {'s and empty statements. */
29729 do
29730 {
29734 {
29736 bracecount++;
29737 }
29741 else
29742 {
29749 }
29750 }
29754 {
29757 }
29758 }
29760 /* Note that we saved the original contents of this flag when we entered
29761 the structured block, and so we don't need to re-save it here. */
29764 else
29767 /* Note that the grammar doesn't call for a structured block here,
29768 though the loop as a whole is a structured block. */
29775 else
29780 {
29782 {
29784 nbraces--;
29785 }
29788 else
29789 {
29791 {
29794 }
29799 }
29800 }
29807 }
29809 /* Helper function for OpenMP parsing, split clauses and call
29810 finish_omp_clauses on each of the set of clauses afterwards. */
29812 static void
29815 {
29821 }
29823 /* OpenMP 4.0:
29824 #pragma omp simd simd-clause[optseq] new-line
29825 for-loop */
29827 #define OMP_SIMD_CLAUSE_MASK \
29828 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29836 static tree
29839 {
29851 {
29854 }
29865 }
29867 /* OpenMP 2.5:
29868 #pragma omp for for-clause[optseq] new-line
29869 for-loop
29871 OpenMP 4.0:
29872 #pragma omp for simd for-simd-clause[optseq] new-line
29873 for-loop */
29875 #define OMP_FOR_CLAUSE_MASK \
29876 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29885 static tree
29888 {
29899 {
29904 {
29912 cclauses);
29916 cclauses);
29928 }
29929 }
29931 {
29934 }
29939 {
29942 }
29953 }
29955 /* OpenMP 2.5:
29956 # pragma omp master new-line
29957 structured-block */
29959 static tree
29961 {
29965 }
29967 /* OpenMP 2.5:
29968 # pragma omp ordered new-line
29969 structured-block */
29971 static tree
29973 {
29977 }
29979 /* OpenMP 2.5:
29981 section-scope:
29982 { section-sequence }
29984 section-sequence:
29985 section-directive[opt] structured-block
29986 section-sequence section-directive structured-block */
29988 static tree
29990 {
30001 {
30005 }
30008 {
30016 {
30020 }
30022 {
30025 }
30030 }
30041 }
30043 /* OpenMP 2.5:
30044 # pragma omp sections sections-clause[optseq] newline
30045 sections-scope */
30047 #define OMP_SECTIONS_CLAUSE_MASK \
30048 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30054 static tree
30057 {
30069 {
30072 }
30079 }
30081 /* OpenMP 2.5:
30082 # pragma omp parallel parallel-clause[optseq] new-line
30083 structured-block
30084 # pragma omp parallel for parallel-for-clause[optseq] new-line
30085 structured-block
30086 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30087 structured-block
30089 OpenMP 4.0:
30090 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30091 structured-block */
30093 #define OMP_PARALLEL_CLAUSE_MASK \
30094 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30104 static tree
30107 {
30116 {
30129 block);
30134 }
30136 {
30140 }
30142 {
30145 }
30147 {
30151 {
30161 block);
30164 }
30165 }
30175 }
30177 /* OpenMP 2.5:
30178 # pragma omp single single-clause[optseq] new-line
30179 structured-block */
30181 #define OMP_SINGLE_CLAUSE_MASK \
30182 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30187 static tree
30189 {
30199 }
30201 /* OpenMP 3.0:
30202 # pragma omp task task-clause[optseq] new-line
30203 structured-block */
30205 #define OMP_TASK_CLAUSE_MASK \
30206 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30216 static tree
30218 {
30229 }
30231 /* OpenMP 3.0:
30232 # pragma omp taskwait new-line */
30234 static void
30236 {
30239 }
30241 /* OpenMP 3.1:
30242 # pragma omp taskyield new-line */
30244 static void
30246 {
30249 }
30251 /* OpenMP 4.0:
30252 # pragma omp taskgroup new-line
30253 structured-block */
30255 static tree
30257 {
30261 }
30264 /* OpenMP 2.5:
30265 # pragma omp threadprivate (variable-list) */
30267 static void
30269 {
30270 tree vars;
30276 }
30278 /* OpenMP 4.0:
30279 # pragma omp cancel cancel-clause[optseq] new-line */
30281 #define OMP_CANCEL_CLAUSE_MASK \
30282 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30288 static void
30290 {
30294 }
30296 /* OpenMP 4.0:
30297 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30299 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30300 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30305 static void
30307 {
30308 tree clauses;
30312 {
30317 {
30320 }
30321 }
30323 {
30327 }
30330 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30332 pragma_tok);
30334 }
30336 /* OpenMP 4.0:
30337 #pragma omp distribute distribute-clause[optseq] new-line
30338 for-loop */
30340 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30341 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30346 static tree
30349 {
30358 {
30366 else
30369 {
30375 {
30378 cclauses);
30379 else
30381 cclauses);
30382 }
30387 cclauses);
30388 else
30390 cclauses);
30402 }
30403 }
30405 {
30408 }
30413 {
30416 }
30427 }
30429 /* OpenMP 4.0:
30430 # pragma omp teams teams-clause[optseq] new-line
30431 structured-block */
30433 #define OMP_TEAMS_CLAUSE_MASK \
30434 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30442 static tree
30445 {
30454 {
30458 {
30466 cclauses);
30470 cclauses);
30481 }
30482 }
30484 {
30487 }
30492 {
30495 }
30503 }
30505 /* OpenMP 4.0:
30506 # pragma omp target data target-data-clause[optseq] new-line
30507 structured-block */
30509 #define OMP_TARGET_DATA_CLAUSE_MASK \
30510 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30514 static tree
30516 {
30528 }
30530 /* OpenMP 4.0:
30531 # pragma omp target update target-update-clause[optseq] new-line */
30533 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30534 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30539 static bool
30542 {
30544 {
30546 "%<#pragma omp target update%> may only be "
30550 }
30552 tree clauses
30557 {
30559 "%<#pragma omp target update must contain at least one "
30562 }
30570 }
30572 /* OpenMP 4.0:
30573 # pragma omp target target-clause[optseq] new-line
30574 structured-block */
30576 #define OMP_TARGET_CLAUSE_MASK \
30577 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30581 static bool
30584 {
30586 {
30590 }
30593 {
30598 {
30606 {
30608 OMP_TARGET_CLAUSE_MASK,
30609 cclauses);
30611 }
30627 }
30629 {
30632 }
30634 {
30638 }
30640 {
30643 }
30644 }
30658 }
30660 /* OpenMP 4.0:
30661 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30663 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30664 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30671 static void
30674 {
30676 cp_omp_declare_simd_data data;
30678 {
30683 }
30694 {
30698 {
30711 }
30716 "%<#pragma omp declare simd%> not immediately followed by "
30720 }
30721 }
30723 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30724 This function is modelled similar to the late parsing of omp declare
30725 simd. */
30727 static tree
30729 {
30735 {
30741 }
30743 {
30747 }
30752 {
30759 NULL);
30773 }
30778 }
30780 /* Finalize #pragma omp declare simd clauses after direct declarator has
30781 been parsed, and put that into "omp declare simd" attribute. */
30783 static tree
30785 {
30791 {
30796 }
30801 {
30819 }
30823 }
30826 /* OpenMP 4.0:
30827 # pragma omp declare target new-line
30828 declarations and definitions
30829 # pragma omp end declare target new-line */
30831 static void
30833 {
30836 }
30838 static void
30840 {
30843 {
30846 }
30848 {
30852 {
30855 }
30858 else
30859 {
30863 }
30864 }
30865 else
30866 {
30870 }
30874 "%<#pragma omp end declare target%> without corresponding "
30876 else
30878 }
30880 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30881 expression and optional initializer clause of
30882 #pragma omp declare reduction. We store the expression(s) as
30883 either 3, 6 or 7 special statements inside of the artificial function's
30884 body. The first two statements are DECL_EXPRs for the artificial
30885 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30886 expression that uses those variables.
30887 If there was any INITIALIZER clause, this is followed by further statements,
30888 the fourth and fifth statements are DECL_EXPRs for the artificial
30889 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30890 constructor variant (first token after open paren is not omp_priv),
30891 then the sixth statement is a statement with the function call expression
30892 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30893 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30894 to initialize the OMP_PRIV artificial variable and there is seventh
30895 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30897 static bool
30899 {
30911 tree combiner;
30926 {
30929 }
30932 {
30939 {
30942 }
30958 {
30962 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30966 == CPP_CLOSE_PAREN
30969 {
30973 }
30978 }
30979 else
30980 {
30996 {
31001 }
31003 tree arg;
31016 }
31027 }
31033 }
31035 /* OpenMP 4.0
31036 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31037 initializer-clause[opt] new-line
31039 initializer-clause:
31040 initializer (omp_priv initializer)
31041 initializer (function-name (argument-list)) */
31043 static void
31046 {
31056 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31063 {
31095 }
31107 /* Types may not be defined in declare reduction type list. */
31110 parser->type_definition_forbidden_message
31116 saved_colon_doesnt_start_class_def_p
31121 {
31125 ;
31146 else
31151 else
31153 }
31155 /* Restore the saved message. */
31158 parser->colon_doesnt_start_class_def_p
31163 {
31164 fail:
31167 }
31173 {
31174 tree fntype
31177 NULL_TREE);
31196 {
31201 }
31203 {
31205 {
31214 }
31221 }
31222 else
31223 {
31226 }
31229 else
31232 {
31235 }
31237 {
31240 else
31245 }
31250 else
31251 {
31260 }
31267 }
31271 done:
31272 /* Free any declarators allocated. */
31274 }
31276 /* OpenMP 4.0
31277 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31278 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31279 initializer-clause[opt] new-line
31280 #pragma omp declare target new-line */
31282 static void
31285 {
31287 {
31292 {
31295 context);
31297 }
31300 {
31303 context);
31305 }
31307 {
31310 }
31312 {
31316 }
31317 }
31321 }
31323 /* Main entry point to OpenMP statement pragmas. */
31325 static void
31327 {
31328 tree stmt;
31333 {
31381 }
31385 }
31386 \f
31387 /* Transactional Memory parsing routines. */
31389 /* Parse a transaction attribute.
31391 txn-attribute:
31392 attribute
31393 [ [ identifier ] ]
31395 ??? Simplify this when C++0x bracket attributes are
31396 implemented properly. */
31398 static tree
31400 {
31415 {
31419 /* For keywords, use the canonical spelling,
31420 not the parsed identifier. */
31424 }
31425 else
31429 error1:
31432 }
31434 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31436 transaction-statement:
31437 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31438 compound-statement
31439 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31440 */
31442 static tree
31444 {
31459 else
31460 {
31464 }
31466 /* Parse a noexcept specification. */
31469 /* Keep track if we're in the lexical scope of an outer transaction. */
31481 }
31483 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31485 transaction-expression:
31486 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31487 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31488 */
31490 static tree
31492 {
31517 /* Set this early. This might mean that we allow transaction_cancel in
31518 an expression that we find out later actually has to be a constexpr.
31519 However, we expect that cxx_constant_value will be able to deal with
31520 this; also, if the noexcept has no constexpr, then what we parse next
31521 really is a transaction's body. */
31524 /* Parse a noexcept specification. */
31530 {
31537 }
31538 else
31539 {
31540 /* The only expression that is available got parsed for the noexcept
31541 already. noexcept is true then. */
31544 }
31553 }
31555 /* Parse a function-transaction-block.
31557 function-transaction-block:
31558 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31559 function-body
31560 __transaction_atomic txn-attribute[opt] function-try-block
31561 __transaction_relaxed ctor-initializer[opt] function-body
31562 __transaction_relaxed function-try-block
31563 */
31565 static bool
31567 {
31583 else
31584 {
31588 }
31596 else
31597 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31605 }
31607 /* Parse a __transaction_cancel statement.
31609 cancel-statement:
31610 __transaction_cancel txn-attribute[opt] ;
31611 __transaction_cancel txn-attribute[opt] throw-expression ;
31613 ??? Cancel and throw is not yet implemented. */
31615 static tree
31617 {
31623 RT_TRANSACTION_CANCEL);
31630 /* ??? Parse cancel-and-throw here. */
31635 {
31639 }
31641 {
31645 }
31647 {
31650 {
31656 }
31657 }
31659 {
31663 }
31669 }
31670 \f
31671 /* The parser. */
31675 \f
31676 /* Special handling for the first token or line in the file. The first
31677 thing in the file might be #pragma GCC pch_preprocess, which loads a
31678 PCH file, which is a GC collection point. So we need to handle this
31679 first pragma without benefit of an existing lexer structure.
31681 Always returns one token to the caller in *FIRST_TOKEN. This is
31682 either the true first token of the file, or the first token after
31683 the initial pragma. */
31685 static void
31687 {
31696 {
31703 }
31704 else
31707 /* Skip to the end of the pragma. */
31711 /* Now actually load the PCH file. */
31715 /* Read one more token to return to our caller. We have to do this
31716 after reading the PCH file in, since its pointers have to be
31717 live. */
31719 }
31721 /* Parses the grainsize pragma for the _Cilk_for statement.
31722 Syntax:
31723 #pragma cilk grainsize = <VALUE>. */
31725 static void
31727 {
31729 {
31734 {
31737 }
31739 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31742 else
31744 "%<#pragma cilk grainsize%> is not followed by "
31747 }
31749 }
31751 /* Normal parsing of a pragma token. Here we can (and must) use the
31752 regular lexer. */
31754 static bool
31756 {
31768 {
31776 {
31786 }
31791 {
31801 }
31806 {
31812 "%<#pragma omp taskwait%> may only be "
31817 }
31822 {
31828 "%<#pragma omp taskyield%> may only be "
31833 }
31838 {
31844 "%<#pragma omp cancel%> may only be "
31849 }
31854 {
31860 "%<#pragma omp cancellation point%> may only be "
31865 }
31903 "%<#pragma omp section%> may only be used in "
31908 {
31915 {
31918 }
31921 }
31925 {
31929 }
31935 {
31939 }
31941 /* Ignore the pragma if Cilk Plus is not enabled. */
31943 {
31946 }
31947 else
31948 {
31952 }
31959 bad_stmt:
31962 }
31966 }
31968 /* The interface the pragma parsers have to the lexer. */
31970 enum cpp_ttype
31972 {
31985 else
31986 {
31990 }
31993 }
31995 \f
31996 /* External interface. */
31998 /* Parse one entire translation unit. */
32000 void
32002 {
32014 }
32016 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32017 vectorlength clause:
32018 Syntax:
32019 vectorlength ( constant-expression ) */
32021 static tree
32024 {
32026 tree expr;
32027 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32028 safelen clause. Thus, vectorlength is represented as OMP 4.0
32029 safelen. For SIMD-enabled function it is represented by OMP 4.0
32030 simdlen. */
32033 loc);
32034 else
32036 loc);
32044 /* If expr == error_mark_node, then don't emit any errors nor
32045 create a clause. if any of the above functions returns
32046 error mark node then they would have emitted an error message. */
32048 ;
32056 else
32057 {
32058 tree c;
32060 {
32065 }
32066 else
32067 {
32072 }
32073 }
32078 }
32080 /* Handles the Cilk Plus #pragma simd linear clause.
32081 Syntax:
32082 linear ( simd-linear-variable-list )
32084 simd-linear-variable-list:
32085 simd-linear-variable
32086 simd-linear-variable-list , simd-linear-variable
32088 simd-linear-variable:
32089 id-expression
32090 id-expression : simd-linear-step
32092 simd-linear-step:
32093 conditional-expression */
32095 static tree
32097 {
32103 {
32107 }
32112 {
32115 {
32119 }
32126 {
32130 }
32131 else
32132 {
32136 /* If present, parse the linear step. Otherwise, assume the default
32137 value of 1. */
32139 {
32146 {
32147 /* If an error has occurred, then the whole pragma is
32148 considered ill-formed. Thus, no reason to keep
32149 parsing. */
32152 }
32160 else
32162 "step size must be an integer constant "
32164 }
32166 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32172 }
32177 else
32178 {
32183 }
32184 }
32188 }
32190 /* Returns the name of the next clause. If the clause is not
32191 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32192 token is not consumed. Otherwise, the appropriate enum from the
32193 pragma_simd_clause is returned and the token is consumed. */
32195 static pragma_omp_clause
32197 {
32198 pragma_omp_clause clause_type;
32215 else
32220 }
32222 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32224 static tree
32226 {
32231 {
32232 pragma_omp_clause c_kind;
32239 /* Use the OpenMP 4.0 equivalent function. */
32242 /* Use the OpenMP 4.0 equivalent function. */
32244 clauses);
32246 /* Use the OMP 4.0 equivalent function. */
32248 clauses);
32250 /* Use the OMP 4.0 equivalent function. */
32252 else
32253 {
32257 }
32258 }
32264 else
32266 }
32268 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32270 static void
32272 {
32279 {
32283 }
32292 }
32294 /* Main entry-point for parsing Cilk Plus _Cilk_for
32295 loops. The return value is error_mark_node
32296 when errors happen and CILK_FOR tree on success. */
32298 static tree
32300 {
32315 else
32321 }
32323 /* Create an identifier for a generic parameter type (a synthesized
32324 template parameter implied by `auto' or a concept identifier). */
32327 static tree
32329 {
32333 }
32335 /* Predicate that behaves as is_auto_or_concept but matches the parent
32336 node of the generic type rather than the generic type itself. This
32337 allows for type transformation in add_implicit_template_parms. */
32341 {
32343 }
32345 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32346 (creating a new template parameter list if necessary). Returns the newly
32347 created template type parm. */
32349 tree
32351 {
32354 /* We are either continuing a function template that already contains implicit
32355 template parameters, creating a new fully-implicit function template, or
32356 extending an existing explicit function template with implicit template
32357 parameters. */
32365 {
32369 }
32370 else
32371 {
32372 /* Roll back to the existing template parameter scope (in the case of
32373 extending an explicit function template) or introduce a new template
32374 parameter scope ahead of the function parameter scope (or class scope
32375 in the case of out-of-line member definitions). The function scope is
32376 added back after template parameter synthesis below. */
32381 {
32384 }
32386 {
32387 /* If not defining a class, then any class scope is a scope level in
32388 an out-of-line member definition. In this case simply wind back
32389 beyond the first such scope to inject the template parameter list.
32390 Otherwise wind back to the class being defined. The latter can
32391 occur in class member friend declarations such as:
32393 class A {
32394 void foo (auto);
32395 };
32396 class B {
32397 friend void A::foo (auto);
32398 };
32400 The template parameter list synthesized for the friend declaration
32401 must be injected in the scope of 'B'. This can also occur in
32402 erroneous cases such as:
32404 struct A {
32405 struct B {
32406 void foo (auto);
32407 };
32408 void B::foo (auto) {}
32409 };
32411 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32412 but, nevertheless, the template parameter list synthesized for the
32413 declarator should be injected into the scope of 'A' as if the
32414 ill-formed template was specified explicitly. */
32417 {
32420 }
32421 }
32427 {
32428 /* Introduce a new template parameter list for implicit template
32429 parameters. */
32433 parser->implicit_template_scope
32440 }
32441 else
32442 {
32443 /* Synthesize implicit template parameters at the end of the explicit
32444 template parameter list. */
32451 parser->implicit_template_parms
32453 }
32454 }
32456 /* Synthesize a new template parameter and track the current template
32457 parameter chain with implicit_template_parms. */
32461 synth_id);
32462 tree new_parm
32464 input_location,
32471 parser->implicit_template_parms
32473 else
32478 /* If creating a fully implicit function template, start the new implicit
32479 template parameter list with this synthesized type, otherwise grow the
32480 current template parameter list. */
32483 {
32490 }
32491 else
32492 {
32497 }
32502 }
32504 /* Finish the declaration of a fully implicit function template. Such a
32505 template has no explicit template parameter list so has not been through the
32506 normal template head and tail processing. synthesize_implicit_template_parm
32507 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32508 provided if the declaration is a class member such that its template
32509 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32510 form is returned. Otherwise NULL_TREE is returned. */
32512 tree
32514 {
32519 {
32523 }
32533 }