| blob | 20d758e888bf8f5efd061c0ad145fde96b5c78ca |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 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/>. */
65 \f
68 // A helper function. Returns the object pointed to by P
69 // and sets P to NULL.
72 {
76 }
80 /* The lexer. */
82 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
83 and c-lex.c) and the C++ parser. */
86 {
88 };
90 /* The various kinds of non integral constant we encounter. */
92 NIC_NONE,
93 /* floating-point literal */
94 NIC_FLOAT,
95 /* %<this%> */
96 NIC_THIS,
97 /* %<__FUNCTION__%> */
98 NIC_FUNC_NAME,
99 /* %<__PRETTY_FUNCTION__%> */
100 NIC_PRETTY_FUNC,
101 /* %<__func__%> */
102 NIC_C99_FUNC,
103 /* "%<va_arg%> */
104 NIC_VA_ARG,
105 /* a cast */
106 NIC_CAST,
107 /* %<typeid%> operator */
108 NIC_TYPEID,
109 /* non-constant compound literals */
110 NIC_NCC,
111 /* a function call */
112 NIC_FUNC_CALL,
113 /* an increment */
114 NIC_INC,
115 /* an decrement */
116 NIC_DEC,
117 /* an array reference */
118 NIC_ARRAY_REF,
119 /* %<->%> */
120 NIC_ARROW,
121 /* %<.%> */
122 NIC_POINT,
123 /* the address of a label */
124 NIC_ADDR_LABEL,
125 /* %<*%> */
126 NIC_STAR,
127 /* %<&%> */
128 NIC_ADDR,
129 /* %<++%> */
130 NIC_PREINCREMENT,
131 /* %<--%> */
132 NIC_PREDECREMENT,
133 /* %<new%> */
134 NIC_NEW,
135 /* %<delete%> */
136 NIC_DEL,
137 /* calls to overloaded operators */
138 NIC_OVERLOADED,
139 /* an assignment */
140 NIC_ASSIGNMENT,
141 /* a comma operator */
142 NIC_COMMA,
143 /* a call to a constructor */
144 NIC_CONSTRUCTOR,
145 /* a transaction expression */
146 NIC_TRANSACTION
149 /* The various kinds of errors about name-lookup failing. */
151 /* NULL */
152 NLE_NULL,
153 /* is not a type */
154 NLE_TYPE,
155 /* is not a class or namespace */
156 NLE_CXX98,
157 /* is not a class, namespace, or enumeration */
158 NLE_NOT_CXX98
161 /* The various kinds of required token */
163 RT_NONE,
185 /* The type is CPP_KEYWORD */
214 RT_TRANSACTION_CANCEL /* __transaction_cancel */
217 /* Prototypes. */
223 static void cp_lexer_destroy
225 static int cp_lexer_saving_tokens
229 static void cp_lexer_get_preprocessor_token
237 static bool cp_lexer_next_token_is_not
239 static bool cp_lexer_next_token_is_keyword
243 static void cp_lexer_purge_token
245 static void cp_lexer_purge_tokens_after
247 static void cp_lexer_save_tokens
249 static void cp_lexer_commit_tokens
251 static void cp_lexer_rollback_tokens
253 static void cp_lexer_print_token
257 static void cp_lexer_start_debugging
259 static void cp_lexer_stop_debugging
265 static void cp_parser_initial_pragma
268 static tree cp_literal_operator_id
271 static void cp_parser_cilk_simd
273 static tree cp_parser_cilk_for
275 static bool cp_parser_omp_declare_reduction_exprs
277 static tree cp_parser_cilk_simd_vectorlength
280 /* Manifest constants. */
281 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
282 #define CP_SAVED_TOKEN_STACK 5
284 /* Variables. */
286 /* The stream to which debugging output should be written. */
289 /* Nonzero if we are parsing an unevaluated operand: an operand to
290 sizeof, typeof, or alignof. */
293 /* Dump up to NUM tokens in BUFFER to FILE starting with token
294 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
295 first token in BUFFER. If NUM is 0, dump all the tokens. If
296 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
297 highlighted by surrounding it in [[ ]]. */
299 static void
303 {
320 {
323 }
328 {
335 nprinted++;
345 {
355 }
356 }
359 {
362 }
365 }
368 /* Dump all tokens in BUFFER to stderr. */
370 void
372 {
374 }
376 DEBUG_FUNCTION void
378 {
380 }
382 DEBUG_FUNCTION void
384 {
387 else
389 }
392 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
393 description for T. */
395 static void
397 {
399 {
402 }
403 }
406 /* Dump parser context C to FILE. */
408 static void
410 {
415 }
418 /* Print the stack of parsing contexts to FILE starting with FIRST. */
420 static void
422 {
428 {
431 }
432 }
435 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
437 static void
439 {
442 }
445 /* Print an unparsed function entry UF to FILE. */
447 static void
449 {
452 tree fn;
457 i++)
458 {
464 }
469 {
472 }
478 {
481 }
483 }
486 /* Print the stack of unparsed member functions S to FILE. */
488 static void
491 {
497 {
500 }
501 }
504 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
505 the given PARSER. If FILE is NULL, the output is printed on stderr. */
507 static void
509 {
521 next_token);
522 }
525 /* Dump debugging information for the given PARSER. If FILE is NULL,
526 the output is printed on stderr. */
528 void
530 {
533 expanded_location eloc;
611 }
613 DEBUG_FUNCTION void
615 {
617 }
619 DEBUG_FUNCTION void
621 {
624 else
626 }
628 /* Allocate memory for a new lexer object and return it. */
632 {
637 /* Allocate the memory. */
640 /* Initially we are not debugging. */
645 /* Create the buffer. */
649 }
652 /* Create a new main C++ lexer, the lexer that gets tokens from the
653 preprocessor. */
657 {
659 cp_token token;
661 /* It's possible that parsing the first pragma will load a PCH file,
662 which is a GC collection point. So we have to do that before
663 allocating any memory. */
668 /* Put the first token in the buffer. */
671 /* Get the remaining tokens from the preprocessor. */
673 {
676 }
685 /* Subsequent preprocessor diagnostics should use compiler
686 diagnostic functions to get the compiler source location. */
691 }
693 /* Create a new lexer whose token stream is primed with the tokens in
694 CACHE. When these tokens are exhausted, no new tokens will be read. */
698 {
703 /* We do not own the buffer. */
710 /* Initially we are not debugging. */
715 }
717 /* Frees all resources associated with LEXER. */
719 static void
721 {
725 }
727 /* Returns nonzero if debugging information should be output. */
731 {
733 }
738 {
742 }
746 {
748 }
752 {
754 }
758 {
761 else
763 }
767 {
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
800 /* On some systems, some header files are surrounded by an
801 implicit extern "C" block. Set a flag in the token if it
802 comes from such a header. */
807 /* Check to see if this token is a keyword. */
809 {
811 {
812 /* Mark this token as a keyword. */
814 /* Record which keyword. */
816 }
817 else
818 {
822 {
823 /* Warn about the C++0x keyword (but still treat it as
824 an identifier). */
829 /* Clear out the C_RID_CODE so we don't warn about this
830 particular identifier-turned-keyword again. */
832 }
835 }
836 }
838 {
839 /* This only happens in Objective-C++; it must be a keyword. */
842 {
843 /* Replace 'class' with '@class', 'private' with '@private',
844 etc. This prevents confusion with the C++ keyword
845 'class', and makes the tokens consistent with other
846 Objective-C 'AT' keywords. For example '@class' is
847 reported as RID_AT_CLASS which is consistent with
848 '@synchronized', which is reported as
849 RID_AT_SYNCHRONIZED.
850 */
859 }
860 }
862 {
863 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
867 }
868 }
870 /* Update the globals input_location and the input file stack from TOKEN. */
873 {
875 {
877 }
878 }
880 /* Update the globals input_location and the input file stack from LEXER. */
883 {
886 }
888 /* Return a pointer to the next token in the token stream, but do not
889 consume it. */
893 {
895 {
899 }
901 }
903 /* Return true if the next token has the indicated TYPE. */
907 {
909 }
911 /* Return true if the next token does not have the indicated TYPE. */
915 {
917 }
919 /* Return true if the next token is the indicated KEYWORD. */
923 {
925 }
929 {
931 }
935 {
937 }
939 /* Return true if the next token is not the indicated KEYWORD. */
943 {
945 }
947 /* Return true if the next token is a keyword for a decl-specifier. */
949 static bool
951 {
956 {
957 /* auto specifier: storage-class-specifier in C++,
958 simple-type-specifier in C++0x. */
960 /* Storage classes. */
966 /* Elaborated type specifiers. */
972 /* Simple type specifiers. */
986 /* GNU extensions. */
989 /* C++0x extensions. */
1000 }
1001 }
1003 /* Returns TRUE iff the token T begins a decltype type. */
1005 static bool
1007 {
1010 }
1012 /* Returns TRUE iff the next token begins a decltype type. */
1014 static bool
1016 {
1019 }
1021 /* Return a pointer to the Nth token in the token stream. If N is 1,
1022 then this is precisely equivalent to cp_lexer_peek_token (except
1023 that it is not inline). One would like to disallow that case, but
1024 there is one case (cp_parser_nth_token_starts_template_id) where
1025 the caller passes a variable for N and it might be 1. */
1029 {
1032 /* N is 1-based, not zero-based. */
1043 {
1046 {
1049 }
1053 }
1056 {
1059 }
1062 }
1064 /* Return the next token, and advance the lexer's next_token pointer
1065 to point to the next non-purged token. */
1069 {
1075 do
1076 {
1079 {
1082 }
1084 }
1089 /* Provide debugging output. */
1091 {
1095 }
1098 }
1100 /* Permanently remove the next token from the token stream, and
1101 advance the next_token pointer to refer to the next non-purged
1102 token. */
1104 static void
1106 {
1115 do
1116 {
1117 tok++;
1119 {
1122 }
1123 }
1126 }
1128 /* Permanently remove all tokens after TOK, up to, but not
1129 including, the token that will be returned next by
1130 cp_lexer_peek_token. */
1132 static void
1134 {
1143 {
1148 }
1149 }
1151 /* Begin saving tokens. All tokens consumed after this point will be
1152 preserved. */
1154 static void
1156 {
1157 /* Provide debugging output. */
1162 }
1164 /* Commit to the portion of the token stream most recently saved. */
1166 static void
1168 {
1169 /* Provide debugging output. */
1174 }
1176 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1177 to the token stream. Stop saving tokens. */
1179 static void
1181 {
1182 /* Provide debugging output. */
1187 }
1189 /* RAII wrapper around the above functions, with sanity checking. Creating
1190 a variable saves tokens, which are committed when the variable is
1191 destroyed unless they are explicitly rolled back by calling the rollback
1192 member function. */
1194 struct saved_token_sentinel
1195 {
1200 {
1203 }
1205 {
1208 }
1210 {
1214 }
1215 };
1217 /* Print a representation of the TOKEN on the STREAM. */
1219 static void
1221 {
1222 /* We don't use cpp_type2name here because the parser defines
1223 a few tokens of its own. */
1225 /* cpplib-defined token types */
1226 #define OP(e, s) #e,
1227 #define TK(e, s) #e,
1228 TTYPE_TABLE
1229 #undef OP
1230 #undef TK
1231 /* C++ parser token types - see "Manifest constants", above. */
1235 };
1237 /* For some tokens, print the associated data. */
1239 {
1241 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1242 For example, `struct' is mapped to an INTEGER_CST. */
1245 /* else fall through */
1263 /* If we have a name for the token, print it out. Otherwise, we
1264 simply give the numeric code. */
1267 else
1270 }
1271 }
1273 DEBUG_FUNCTION void
1275 {
1278 }
1280 DEBUG_FUNCTION void
1282 {
1285 else
1287 }
1290 /* Start emitting debugging information. */
1292 static void
1294 {
1297 }
1299 /* Stop emitting debugging information. */
1301 static void
1303 {
1306 }
1308 /* Create a new cp_token_cache, representing a range of tokens. */
1312 {
1317 }
1319 /* Diagnose if #pragma omp declare simd isn't followed immediately
1320 by function declaration or definition. */
1324 {
1326 {
1330 }
1331 }
1333 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1334 and put that into "omp declare simd" attribute. */
1338 {
1340 {
1342 {
1345 }
1347 {
1350 }
1351 }
1352 }
1353 \f
1354 /* Decl-specifiers. */
1356 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1358 static void
1360 {
1362 }
1364 /* Declarators. */
1366 /* Nothing other than the parser should be creating declarators;
1367 declarators are a semi-syntactic representation of C++ entities.
1368 Other parts of the front end that need to create entities (like
1369 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1384 /* An erroneous declarator. */
1387 /* The obstack on which declarators and related data structures are
1388 allocated. */
1391 /* Alloc BYTES from the declarator memory pool. */
1395 {
1397 }
1399 /* Allocate a declarator of the indicated KIND. Clear fields that are
1400 common to all declarators. */
1404 {
1416 }
1418 /* Make a declarator for a generalized identifier. If
1419 QUALIFYING_SCOPE is non-NULL, the identifier is
1420 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1421 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1422 is, if any. */
1426 special_function_kind sfk)
1427 {
1430 /* It is valid to write:
1432 class C { void f(); };
1433 typedef C D;
1434 void D::f();
1436 The standard is not clear about whether `typedef const C D' is
1437 legal; as of 2002-09-15 the committee is considering that
1438 question. EDG 3.0 allows that syntax. Therefore, we do as
1439 well. */
1453 }
1455 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1456 of modifiers such as const or volatile to apply to the pointer
1457 type, represented as identifiers. ATTRIBUTES represent the attributes that
1458 appertain to the pointer or reference. */
1460 cp_declarator *
1462 tree attributes)
1463 {
1471 {
1475 }
1476 else
1482 }
1484 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1485 represent the attributes that appertain to the pointer or
1486 reference. */
1488 cp_declarator *
1491 {
1499 {
1503 }
1504 else
1510 }
1512 /* Like make_pointer_declarator -- but for a pointer to a non-static
1513 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1514 appertain to the pointer or reference. */
1516 cp_declarator *
1519 tree attributes)
1520 {
1529 {
1532 }
1533 else
1539 }
1541 /* Make a declarator for the function given by TARGET, with the
1542 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1543 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1544 indicates what exceptions can be thrown. */
1546 cp_declarator *
1548 tree parms,
1549 cp_cv_quals cv_qualifiers,
1550 cp_virt_specifiers virt_specifiers,
1551 cp_ref_qualifier ref_qualifier,
1552 tree exception_specification,
1553 tree late_return_type,
1554 tree requires_clause)
1555 {
1568 {
1572 }
1573 else
1577 }
1579 /* Make a declarator for an array of BOUNDS elements, each of which is
1580 defined by ELEMENT. */
1582 cp_declarator *
1584 {
1591 {
1595 }
1596 else
1600 }
1602 /* Determine whether the declarator we've seen so far can be a
1603 parameter pack, when followed by an ellipsis. */
1604 static bool
1606 {
1607 /* Search for a declarator name, or any other declarator that goes
1608 after the point where the ellipsis could appear in a parameter
1609 pack. If we find any of these, then this declarator can not be
1610 made into a parameter pack. */
1613 {
1615 {
1627 }
1628 }
1631 }
1635 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1636 DECLARATOR and DEFAULT_ARGUMENT. */
1638 cp_parameter_declarator *
1641 tree default_argument)
1642 {
1650 else
1657 }
1659 /* Returns true iff DECLARATOR is a declaration for a function. */
1661 static bool
1663 {
1665 {
1673 }
1675 }
1677 /* The parser. */
1679 /* Overview
1680 --------
1682 A cp_parser parses the token stream as specified by the C++
1683 grammar. Its job is purely parsing, not semantic analysis. For
1684 example, the parser breaks the token stream into declarators,
1685 expressions, statements, and other similar syntactic constructs.
1686 It does not check that the types of the expressions on either side
1687 of an assignment-statement are compatible, or that a function is
1688 not declared with a parameter of type `void'.
1690 The parser invokes routines elsewhere in the compiler to perform
1691 semantic analysis and to build up the abstract syntax tree for the
1692 code processed.
1694 The parser (and the template instantiation code, which is, in a
1695 way, a close relative of parsing) are the only parts of the
1696 compiler that should be calling push_scope and pop_scope, or
1697 related functions. The parser (and template instantiation code)
1698 keeps track of what scope is presently active; everything else
1699 should simply honor that. (The code that generates static
1700 initializers may also need to set the scope, in order to check
1701 access control correctly when emitting the initializers.)
1703 Methodology
1704 -----------
1706 The parser is of the standard recursive-descent variety. Upcoming
1707 tokens in the token stream are examined in order to determine which
1708 production to use when parsing a non-terminal. Some C++ constructs
1709 require arbitrary look ahead to disambiguate. For example, it is
1710 impossible, in the general case, to tell whether a statement is an
1711 expression or declaration without scanning the entire statement.
1712 Therefore, the parser is capable of "parsing tentatively." When the
1713 parser is not sure what construct comes next, it enters this mode.
1714 Then, while we attempt to parse the construct, the parser queues up
1715 error messages, rather than issuing them immediately, and saves the
1716 tokens it consumes. If the construct is parsed successfully, the
1717 parser "commits", i.e., it issues any queued error messages and
1718 the tokens that were being preserved are permanently discarded.
1719 If, however, the construct is not parsed successfully, the parser
1720 rolls back its state completely so that it can resume parsing using
1721 a different alternative.
1723 Future Improvements
1724 -------------------
1726 The performance of the parser could probably be improved substantially.
1727 We could often eliminate the need to parse tentatively by looking ahead
1728 a little bit. In some places, this approach might not entirely eliminate
1729 the need to parse tentatively, but it might still speed up the average
1730 case. */
1732 /* Flags that are passed to some parsing functions. These values can
1733 be bitwise-ored together. */
1735 enum
1736 {
1737 /* No flags. */
1739 /* The construct is optional. If it is not present, then no error
1740 should be issued. */
1742 /* When parsing a type-specifier, treat user-defined type-names
1743 as non-type identifiers. */
1745 /* When parsing a type-specifier, do not try to parse a class-specifier
1746 or enum-specifier. */
1748 /* When parsing a decl-specifier-seq, only allow type-specifier or
1749 constexpr. */
1751 };
1753 /* This type is used for parameters and variables which hold
1754 combinations of the above flags. */
1757 /* The different kinds of declarators we want to parse. */
1760 {
1761 /* We want an abstract declarator. */
1762 CP_PARSER_DECLARATOR_ABSTRACT,
1763 /* We want a named declarator. */
1764 CP_PARSER_DECLARATOR_NAMED,
1765 /* We don't mind, but the name must be an unqualified-id. */
1766 CP_PARSER_DECLARATOR_EITHER
1769 /* The precedence values used to parse binary expressions. The minimum value
1770 of PREC must be 1, because zero is reserved to quickly discriminate
1771 binary operators from other tokens. */
1773 enum cp_parser_prec
1774 {
1775 PREC_NOT_OPERATOR,
1776 PREC_LOGICAL_OR_EXPRESSION,
1777 PREC_LOGICAL_AND_EXPRESSION,
1778 PREC_INCLUSIVE_OR_EXPRESSION,
1779 PREC_EXCLUSIVE_OR_EXPRESSION,
1780 PREC_AND_EXPRESSION,
1781 PREC_EQUALITY_EXPRESSION,
1782 PREC_RELATIONAL_EXPRESSION,
1783 PREC_SHIFT_EXPRESSION,
1784 PREC_ADDITIVE_EXPRESSION,
1785 PREC_MULTIPLICATIVE_EXPRESSION,
1786 PREC_PM_EXPRESSION,
1787 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1788 };
1790 /* A mapping from a token type to a corresponding tree node type, with a
1791 precedence value. */
1794 {
1795 /* The token type. */
1797 /* The corresponding tree code. */
1799 /* The precedence of this operator. */
1804 {
1805 /* Left hand side of the binary operation we are currently
1806 parsing. */
1807 tree lhs;
1808 /* Original tree code for left hand side, if it was a binary
1809 expression itself (used for -Wparentheses). */
1811 /* Tree code for the binary operation we are parsing. */
1813 /* Precedence of the binary operation we are parsing. */
1815 /* Location of the binary operation we are parsing. */
1816 location_t loc;
1819 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1820 entries because precedence levels on the stack are monotonically
1821 increasing. */
1825 /* Prototypes. */
1827 /* Constructors and destructors. */
1832 /* Class variables. */
1836 /* The operator-precedence table used by cp_parser_binary_expression.
1837 Transformed into an associative array (binops_by_token) by
1838 cp_parser_new. */
1871 };
1873 /* The same as binops, but initialized by cp_parser_new so that
1874 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1875 for speed. */
1878 /* Constructors and destructors. */
1880 /* Construct a new context. The context below this one on the stack
1881 is given by NEXT. */
1885 {
1888 /* Allocate the storage. */
1890 {
1891 /* Pull the first entry from the free list. */
1895 }
1896 else
1899 /* No errors have occurred yet in this context. */
1901 /* If this is not the bottommost context, copy information that we
1902 need from the previous context. */
1904 {
1905 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1906 expression, then we are parsing one in this context, too. */
1908 /* Thread the stack. */
1910 }
1913 }
1915 /* Managing the unparsed function queues. */
1917 #define unparsed_funs_with_default_args \
1918 parser->unparsed_queues->last ().funs_with_default_args
1919 #define unparsed_funs_with_definitions \
1920 parser->unparsed_queues->last ().funs_with_definitions
1921 #define unparsed_nsdmis \
1922 parser->unparsed_queues->last ().nsdmis
1923 #define unparsed_classes \
1924 parser->unparsed_queues->last ().classes
1926 static void
1928 {
1931 }
1933 static void
1935 {
1938 }
1940 /* Prototypes. */
1942 /* Constructors and destructors. */
1947 /* Routines to parse various constructs.
1949 Those that return `tree' will return the error_mark_node (rather
1950 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1951 Sometimes, they will return an ordinary node if error-recovery was
1952 attempted, even though a parse error occurred. So, to check
1953 whether or not a parse error occurred, you should always use
1954 cp_parser_error_occurred. If the construct is optional (indicated
1955 either by an `_opt' in the name of the function that does the
1956 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1957 the construct is not present. */
1959 /* Lexical conventions [gram.lex] */
1961 static tree cp_parser_identifier
1963 static tree cp_parser_string_literal
1965 static tree cp_parser_userdef_char_literal
1967 static tree cp_parser_userdef_string_literal
1969 static tree cp_parser_userdef_numeric_literal
1972 /* Basic concepts [gram.basic] */
1974 static bool cp_parser_translation_unit
1977 /* Expressions [gram.expr] */
1979 static tree cp_parser_primary_expression
1981 static tree cp_parser_id_expression
1983 static tree cp_parser_unqualified_id
1985 static tree cp_parser_nested_name_specifier_opt
1987 static tree cp_parser_nested_name_specifier
1989 static tree cp_parser_qualifying_entity
1991 static tree cp_parser_postfix_expression
1993 static tree cp_parser_postfix_open_square_expression
1995 static tree cp_parser_postfix_dot_deref_expression
1999 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2001 static void cp_parser_pseudo_destructor_name
2003 static tree cp_parser_unary_expression
2005 static enum tree_code cp_parser_unary_operator
2007 static tree cp_parser_new_expression
2011 static tree cp_parser_new_type_id
2019 static tree cp_parser_delete_expression
2021 static tree cp_parser_cast_expression
2023 static tree cp_parser_binary_expression
2025 static tree cp_parser_question_colon_clause
2027 static tree cp_parser_assignment_expression
2029 static enum tree_code cp_parser_assignment_operator_opt
2031 static tree cp_parser_expression
2033 static tree cp_parser_constant_expression
2035 static tree cp_parser_builtin_offsetof
2037 static tree cp_parser_lambda_expression
2039 static void cp_parser_lambda_introducer
2041 static bool cp_parser_lambda_declarator_opt
2043 static void cp_parser_lambda_body
2046 /* Statements [gram.stmt.stmt] */
2048 static void cp_parser_statement
2050 static void cp_parser_label_for_labeled_statement
2052 static tree cp_parser_expression_statement
2054 static tree cp_parser_compound_statement
2056 static void cp_parser_statement_seq_opt
2058 static tree cp_parser_selection_statement
2060 static tree cp_parser_condition
2062 static tree cp_parser_iteration_statement
2064 static bool cp_parser_for_init_statement
2066 static tree cp_parser_for
2068 static tree cp_parser_c_for
2070 static tree cp_parser_range_for
2072 static void do_range_for_auto_deduction
2074 static tree cp_parser_perform_range_for_lookup
2076 static tree cp_parser_range_for_member_function
2078 static tree cp_parser_jump_statement
2080 static void cp_parser_declaration_statement
2083 static tree cp_parser_implicitly_scoped_statement
2085 static void cp_parser_already_scoped_statement
2088 /* Declarations [gram.dcl.dcl] */
2090 static void cp_parser_declaration_seq_opt
2092 static void cp_parser_declaration
2094 static void cp_parser_block_declaration
2096 static void cp_parser_simple_declaration
2098 static void cp_parser_decl_specifier_seq
2100 static tree cp_parser_storage_class_specifier_opt
2102 static tree cp_parser_function_specifier_opt
2104 static tree cp_parser_type_specifier
2107 static tree cp_parser_simple_type_specifier
2109 static tree cp_parser_type_name
2111 static tree cp_parser_type_name
2113 static tree cp_parser_nonclass_name
2115 static tree cp_parser_elaborated_type_specifier
2117 static tree cp_parser_enum_specifier
2119 static void cp_parser_enumerator_list
2121 static void cp_parser_enumerator_definition
2123 static tree cp_parser_namespace_name
2125 static void cp_parser_namespace_definition
2127 static void cp_parser_namespace_body
2129 static tree cp_parser_qualified_namespace_specifier
2131 static void cp_parser_namespace_alias_definition
2133 static bool cp_parser_using_declaration
2135 static void cp_parser_using_directive
2137 static tree cp_parser_alias_declaration
2139 static void cp_parser_asm_definition
2141 static void cp_parser_linkage_specification
2143 static void cp_parser_static_assert
2145 static tree cp_parser_decltype
2148 /* Declarators [gram.dcl.decl] */
2150 static tree cp_parser_init_declarator
2157 static enum tree_code cp_parser_ptr_operator
2159 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2161 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2163 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2165 static tree cp_parser_late_return_type_opt
2167 static tree cp_parser_declarator_id
2169 static tree cp_parser_type_id
2171 static tree cp_parser_template_type_arg
2174 static tree cp_parser_type_id_1
2176 static void cp_parser_type_specifier_seq
2178 static tree cp_parser_parameter_declaration_clause
2180 static tree cp_parser_parameter_declaration_list
2184 static tree cp_parser_default_argument
2186 static void cp_parser_function_body
2188 static tree cp_parser_initializer
2190 static tree cp_parser_initializer_clause
2192 static tree cp_parser_braced_list
2197 static bool cp_parser_ctor_initializer_opt_and_function_body
2200 static tree cp_parser_late_parsing_omp_declare_simd
2203 static tree cp_parser_late_parsing_cilk_simd_fn_info
2206 static tree synthesize_implicit_template_parm
2208 static tree finish_fully_implicit_template
2211 /* Classes [gram.class] */
2213 static tree cp_parser_class_name
2215 static tree cp_parser_class_specifier
2217 static tree cp_parser_class_head
2219 static enum tag_types cp_parser_class_key
2221 static void cp_parser_type_parameter_key
2223 static void cp_parser_member_specification_opt
2225 static void cp_parser_member_declaration
2227 static tree cp_parser_pure_specifier
2229 static tree cp_parser_constant_initializer
2232 /* Derived classes [gram.class.derived] */
2234 static tree cp_parser_base_clause
2236 static tree cp_parser_base_specifier
2239 /* Special member functions [gram.special] */
2241 static tree cp_parser_conversion_function_id
2243 static tree cp_parser_conversion_type_id
2247 static bool cp_parser_ctor_initializer_opt
2249 static void cp_parser_mem_initializer_list
2251 static tree cp_parser_mem_initializer
2253 static tree cp_parser_mem_initializer_id
2256 /* Overloading [gram.over] */
2258 static tree cp_parser_operator_function_id
2260 static tree cp_parser_operator
2263 /* Templates [gram.temp] */
2265 static void cp_parser_template_declaration
2267 static tree cp_parser_template_parameter_list
2269 static tree cp_parser_template_parameter
2271 static tree cp_parser_type_parameter
2273 static tree cp_parser_template_id
2275 static tree cp_parser_template_name
2277 static tree cp_parser_template_argument_list
2279 static tree cp_parser_template_argument
2281 static void cp_parser_explicit_instantiation
2283 static void cp_parser_explicit_specialization
2286 /* Exception handling [gram.exception] */
2288 static tree cp_parser_try_block
2290 static bool cp_parser_function_try_block
2292 static void cp_parser_handler_seq
2294 static void cp_parser_handler
2296 static tree cp_parser_exception_declaration
2298 static tree cp_parser_throw_expression
2300 static tree cp_parser_exception_specification_opt
2302 static tree cp_parser_type_id_list
2305 /* GNU Extensions */
2307 static tree cp_parser_asm_specification_opt
2309 static tree cp_parser_asm_operand_list
2311 static tree cp_parser_asm_clobber_list
2313 static tree cp_parser_asm_label_list
2315 static bool cp_next_tokens_can_be_attribute_p
2317 static bool cp_next_tokens_can_be_gnu_attribute_p
2319 static bool cp_next_tokens_can_be_std_attribute_p
2321 static bool cp_nth_tokens_can_be_std_attribute_p
2323 static bool cp_nth_tokens_can_be_gnu_attribute_p
2325 static bool cp_nth_tokens_can_be_attribute_p
2327 static tree cp_parser_attributes_opt
2329 static tree cp_parser_gnu_attributes_opt
2331 static tree cp_parser_gnu_attribute_list
2333 static tree cp_parser_std_attribute
2335 static tree cp_parser_std_attribute_spec
2337 static tree cp_parser_std_attribute_spec_seq
2339 static bool cp_parser_extension_opt
2341 static void cp_parser_label_declaration
2344 /* Concept Extensions */
2346 static tree cp_parser_requires_clause
2348 static tree cp_parser_requires_clause_opt
2350 static tree cp_parser_requires_expression
2352 static tree cp_parser_requirement_parameter_list
2354 static tree cp_parser_requirement_body
2356 static tree cp_parser_requirement_list
2358 static tree cp_parser_requirement
2360 static tree cp_parser_simple_requirement
2362 static tree cp_parser_compound_requirement
2364 static tree cp_parser_type_requirement
2366 static tree cp_parser_nested_requirement
2369 /* Transactional Memory Extensions */
2371 static tree cp_parser_transaction
2373 static tree cp_parser_transaction_expression
2375 static bool cp_parser_function_transaction
2377 static tree cp_parser_transaction_cancel
2381 pragma_external,
2382 pragma_member,
2383 pragma_objc_icode,
2384 pragma_stmt,
2385 pragma_compound
2386 };
2387 static bool cp_parser_pragma
2390 /* Objective-C++ Productions */
2392 static tree cp_parser_objc_message_receiver
2394 static tree cp_parser_objc_message_args
2396 static tree cp_parser_objc_message_expression
2398 static tree cp_parser_objc_encode_expression
2400 static tree cp_parser_objc_defs_expression
2402 static tree cp_parser_objc_protocol_expression
2404 static tree cp_parser_objc_selector_expression
2406 static tree cp_parser_objc_expression
2408 static bool cp_parser_objc_selector_p
2410 static tree cp_parser_objc_selector
2412 static tree cp_parser_objc_protocol_refs_opt
2414 static void cp_parser_objc_declaration
2416 static tree cp_parser_objc_statement
2418 static bool cp_parser_objc_valid_prefix_attributes
2420 static void cp_parser_objc_at_property_declaration
2422 static void cp_parser_objc_at_synthesize_declaration
2424 static void cp_parser_objc_at_dynamic_declaration
2426 static tree cp_parser_objc_struct_declaration
2429 /* Utility Routines */
2431 static tree cp_parser_lookup_name
2433 static tree cp_parser_lookup_name_simple
2435 static tree cp_parser_maybe_treat_template_as_class
2437 static bool cp_parser_check_declarator_template_parameters
2439 static bool cp_parser_check_template_parameters
2441 static tree cp_parser_simple_cast_expression
2443 static tree cp_parser_global_scope_opt
2445 static bool cp_parser_constructor_declarator_p
2447 static tree cp_parser_function_definition_from_specifiers_and_declarator
2449 static tree cp_parser_function_definition_after_declarator
2451 static void cp_parser_template_declaration_after_export
2453 static void cp_parser_perform_template_parameter_access_checks
2455 static tree cp_parser_single_declaration
2457 static tree cp_parser_functional_cast
2459 static tree cp_parser_save_member_function_body
2461 static tree cp_parser_save_nsdmi
2463 static tree cp_parser_enclosed_template_argument_list
2465 static void cp_parser_save_default_args
2467 static void cp_parser_late_parsing_for_member
2469 static tree cp_parser_late_parse_one_default_arg
2471 static void cp_parser_late_parsing_nsdmi
2473 static void cp_parser_late_parsing_default_args
2475 static tree cp_parser_sizeof_operand
2477 static tree cp_parser_trait_expr
2479 static bool cp_parser_declares_only_class_p
2481 static void cp_parser_set_storage_class
2483 static void cp_parser_set_decl_spec_type
2485 static void set_and_check_decl_spec_loc
2488 static bool cp_parser_friend_p
2490 static void cp_parser_required_error
2496 static bool cp_parser_token_starts_function_definition_p
2498 static bool cp_parser_next_token_starts_class_definition_p
2500 static bool cp_parser_next_token_ends_template_argument_p
2502 static bool cp_parser_nth_token_starts_template_argument_list_p
2504 static enum tag_types cp_parser_token_is_class_key
2506 static enum tag_types cp_parser_token_is_type_parameter_key
2508 static void cp_parser_check_class_key
2510 static void cp_parser_check_access_in_redeclaration
2512 static bool cp_parser_optional_template_keyword
2514 static void cp_parser_pre_parsed_nested_name_specifier
2516 static bool cp_parser_cache_group
2518 static tree cp_parser_cache_defarg
2520 static void cp_parser_parse_tentatively
2522 static void cp_parser_commit_to_tentative_parse
2524 static void cp_parser_commit_to_topmost_tentative_parse
2526 static void cp_parser_abort_tentative_parse
2528 static bool cp_parser_parse_definitely
2532 static bool cp_parser_uncommitted_to_tentative_parse_p
2534 static void cp_parser_error
2536 static void cp_parser_name_lookup_error
2538 static bool cp_parser_simulate_error
2540 static bool cp_parser_check_type_definition
2542 static void cp_parser_check_for_definition_in_return_type
2544 static void cp_parser_check_for_invalid_template_id
2546 static bool cp_parser_non_integral_constant_expression
2548 static void cp_parser_diagnose_invalid_type_name
2550 static bool cp_parser_parse_and_diagnose_invalid_type_name
2552 static int cp_parser_skip_to_closing_parenthesis
2554 static void cp_parser_skip_to_end_of_statement
2556 static void cp_parser_consume_semicolon_at_end_of_statement
2558 static void cp_parser_skip_to_end_of_block_or_statement
2560 static bool cp_parser_skip_to_closing_brace
2562 static void cp_parser_skip_to_end_of_template_parameter_list
2564 static void cp_parser_skip_to_pragma_eol
2566 static bool cp_parser_error_occurred
2568 static bool cp_parser_allow_gnu_extensions_p
2570 static bool cp_parser_is_pure_string_literal
2572 static bool cp_parser_is_string_literal
2574 static bool cp_parser_is_keyword
2576 static tree cp_parser_make_typename_type
2580 static bool cp_parser_compound_literal_p
2582 static bool cp_parser_array_designator_p
2584 static bool cp_parser_skip_to_closing_square_bracket
2587 /* Concept-related syntactic transformations */
2592 // -------------------------------------------------------------------------- //
2593 // Unevaluated Operand Guard
2594 //
2595 // Implementation of an RAII helper for unevaluated operand parsing.
2597 {
2600 }
2603 {
2606 }
2608 // -------------------------------------------------------------------------- //
2609 // Tentative Parsing
2611 /* Returns nonzero if we are parsing tentatively. */
2615 {
2617 }
2619 /* Returns nonzero if TOKEN is a string literal. */
2621 static bool
2623 {
2629 }
2631 /* Returns nonzero if TOKEN is a string literal
2632 of a user-defined string literal. */
2634 static bool
2636 {
2643 }
2645 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2647 static bool
2649 {
2651 }
2653 /* If not parsing tentatively, issue a diagnostic of the form
2654 FILE:LINE: MESSAGE before TOKEN
2655 where TOKEN is the next token in the input stream. MESSAGE
2656 (specified by the caller) is usually of the form "expected
2657 OTHER-TOKEN". */
2659 static void
2661 {
2663 {
2665 /* This diagnostic makes more sense if it is tagged to the line
2666 of the token we just peeked at. */
2670 {
2675 }
2678 /* Because c_parser_error does not understand
2679 CPP_KEYWORD, keywords are treated like
2680 identifiers. */
2683 }
2684 }
2686 /* Issue an error about name-lookup failing. NAME is the
2687 IDENTIFIER_NODE DECL is the result of
2688 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2689 the thing that we hoped to find. */
2691 static void
2693 tree name,
2694 tree decl,
2695 name_lookup_error desired,
2696 location_t location)
2697 {
2698 /* If name lookup completely failed, tell the user that NAME was not
2699 declared. */
2701 {
2714 else
2716 }
2718 {
2720 {
2737 }
2738 }
2740 {
2742 {
2752 name);
2756 }
2757 }
2758 else
2759 {
2761 {
2774 }
2775 }
2776 }
2778 /* If we are parsing tentatively, remember that an error has occurred
2779 during this tentative parse. Returns true if the error was
2780 simulated; false if a message should be issued by the caller. */
2782 static bool
2784 {
2786 {
2789 }
2791 }
2793 /* This function is called when a type is defined. If type
2794 definitions are forbidden at this point, an error message is
2795 issued. */
2797 static bool
2799 {
2800 /* If types are forbidden here, issue a message. */
2802 {
2803 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2804 in the message need to be interpreted. */
2807 }
2809 }
2811 /* This function is called when the DECLARATOR is processed. The TYPE
2812 was a type defined in the decl-specifiers. If it is invalid to
2813 define a type in the decl-specifiers for DECLARATOR, an error is
2814 issued. TYPE_LOCATION is the location of TYPE and is used
2815 for error reporting. */
2817 static void
2820 {
2821 /* [dcl.fct] forbids type definitions in return types.
2822 Unfortunately, it's not easy to know whether or not we are
2823 processing a return type until after the fact. */
2831 {
2836 type);
2837 }
2838 }
2840 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2841 "<" in any valid C++ program. If the next token is indeed "<",
2842 issue a message warning the user about what appears to be an
2843 invalid attempt to form a template-id. LOCATION is the location
2844 of the type-specifier (TYPE) */
2846 static void
2848 tree type,
2850 location_t location)
2851 {
2855 {
2859 {
2862 else
2864 }
2865 else
2867 /* Remember the location of the invalid "<". */
2870 /* Consume the "<". */
2872 /* Parse the template arguments. */
2874 /* Permanently remove the invalid template arguments so that
2875 this error message is not issued again. */
2878 }
2879 }
2881 /* If parsing an integral constant-expression, issue an error message
2882 about the fact that THING appeared and return true. Otherwise,
2883 return false. In either case, set
2884 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2886 static bool
2888 non_integral_constant thing)
2889 {
2892 {
2894 {
2897 {
2904 "enumeration type cannot appear in a "
2995 }
2999 }
3000 }
3002 }
3004 /* Emit a diagnostic for an invalid type name. This function commits
3005 to the current active tentative parse, if any. (Otherwise, the
3006 problematic construct might be encountered again later, resulting
3007 in duplicate error messages.) LOCATION is the location of ID. */
3009 static void
3011 location_t location)
3012 {
3015 /* Try to lookup the identifier. */
3022 /* If the lookup was ambiguous, an error will already have
3023 been issued. */
3025 /* If the lookup found a template-name, it means that the user forgot
3026 to specify an argument list. Emit a useful error message. */
3030 decl);
3034 /* Something like 'unsigned A a;' */
3037 {
3038 /* Issue an error message. */
3040 /* If we're in a template class, it's possible that the user was
3041 referring to a type from a base class. For example:
3043 template <typename T> struct A { typedef T X; };
3044 template <typename T> struct B : public A<T> { X x; };
3046 The user should have said "typename A<T>::X". */
3060 {
3061 tree b;
3064 b;
3066 {
3070 {
3071 tree field;
3072 /* Go from a particular instantiation of the
3073 template (which will have an empty TYPE_FIELDs),
3074 to the main version. */
3077 field;
3081 {
3086 }
3089 }
3090 }
3091 }
3092 }
3093 /* Here we diagnose qualified-ids where the scope is actually correct,
3094 but the identifier does not resolve to a valid type name. */
3096 {
3098 {
3103 else
3107 }
3110 {
3111 /* A<T>::A<T>() */
3117 }
3124 {
3129 else
3133 }
3134 else
3136 }
3137 }
3139 /* Check for a common situation where a type-name should be present,
3140 but is not, and issue a sensible error message. Returns true if an
3141 invalid type-name was detected.
3143 The situation handled by this function are variable declarations of the
3144 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3145 Usually, `ID' should name a type, but if we got here it means that it
3146 does not. We try to emit the best possible error message depending on
3147 how exactly the id-expression looks like. */
3149 static bool
3151 {
3152 tree id;
3155 /* Avoid duplicate error about ambiguous lookup. */
3157 {
3161 }
3170 /* If the next token is a (, this is a function with no explicit return
3171 type, i.e. constructor, destructor or conversion op. */
3174 {
3177 }
3181 /* Emit a diagnostic for the invalid type. */
3183 out:
3184 /* If we aren't in the middle of a declarator (i.e. in a
3185 parameter-declaration-clause), skip to the end of the declaration;
3186 there's no point in trying to process it. */
3190 }
3192 /* Consume tokens up to, and including, the next non-nested closing `)'.
3193 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3194 are doing error recovery. Returns -1 if OR_COMMA is true and we
3195 found an unnested comma. */
3197 static int
3202 {
3212 {
3216 {
3219 /* If we've run out of tokens, then there is no closing `)'. */
3222 /* This is good for lambda expression capture-lists. */
3232 /* This matches the processing in skip_to_end_of_statement. */
3258 {
3262 }
3267 }
3269 /* Consume the token. */
3271 }
3272 }
3274 /* Consume tokens until we reach the end of the current statement.
3275 Normally, that will be just before consuming a `;'. However, if a
3276 non-nested `}' comes first, then we stop before consuming that. */
3278 static void
3280 {
3283 /* Unwind generic function template scope if necessary. */
3288 {
3292 {
3295 /* If we've run out of tokens, stop. */
3299 /* If the next token is a `;', we have reached the end of the
3300 statement. */
3306 /* If this is a non-nested '}', stop before consuming it.
3307 That way, when confronted with something like:
3309 { 3 + }
3311 we stop before consuming the closing '}', even though we
3312 have not yet reached a `;'. */
3316 /* If it is the closing '}' for a block that we have
3317 scanned, stop -- but only after consuming the token.
3318 That way given:
3320 void f g () { ... }
3321 typedef int I;
3323 we will stop after the body of the erroneously declared
3324 function, but before consuming the following `typedef'
3325 declaration. */
3327 {
3330 }
3338 }
3340 /* Consume the token. */
3342 }
3343 }
3345 /* This function is called at the end of a statement or declaration.
3346 If the next token is a semicolon, it is consumed; otherwise, error
3347 recovery is attempted. */
3349 static void
3351 {
3352 /* Look for the trailing `;'. */
3354 {
3355 /* If there is additional (erroneous) input, skip to the end of
3356 the statement. */
3358 /* If the next token is now a `;', consume it. */
3361 }
3362 }
3364 /* Skip tokens until we have consumed an entire block, or until we
3365 have consumed a non-nested `;'. */
3367 static void
3369 {
3372 /* Unwind generic function template scope if necessary. */
3377 {
3381 {
3384 /* If we've run out of tokens, stop. */
3388 /* Stop if this is an unnested ';'. */
3394 /* Stop if this is an unnested '}', or closes the outermost
3395 nesting level. */
3396 nesting_depth--;
3404 /* Nest. */
3405 nesting_depth++;
3410 }
3412 /* Consume the token. */
3414 }
3415 }
3417 /* Skip tokens until a non-nested closing curly brace is the next
3418 token, or there are no more tokens. Return true in the first case,
3419 false otherwise. */
3421 static bool
3423 {
3427 {
3431 {
3434 /* If we've run out of tokens, stop. */
3438 /* If the next token is a non-nested `}', then we have reached
3439 the end of the current block. */
3445 /* If it the next token is a `{', then we are entering a new
3446 block. Consume the entire block. */
3452 }
3454 /* Consume the token. */
3456 }
3457 }
3459 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3460 parameter is the PRAGMA token, allowing us to purge the entire pragma
3461 sequence. */
3463 static void
3465 {
3470 do
3474 /* Ensure that the pragma is not parsed again. */
3476 }
3478 /* Require pragma end of line, resyncing with it as necessary. The
3479 arguments are as for cp_parser_skip_to_pragma_eol. */
3481 static void
3483 {
3487 }
3489 /* This is a simple wrapper around make_typename_type. When the id is
3490 an unresolved identifier node, we can provide a superior diagnostic
3491 using cp_parser_diagnose_invalid_type_name. */
3493 static tree
3495 location_t id_location)
3496 {
3497 tree result;
3499 {
3505 }
3507 }
3509 /* This is a wrapper around the
3510 make_{pointer,ptrmem,reference}_declarator functions that decides
3511 which one to call based on the CODE and CLASS_TYPE arguments. The
3512 CODE argument should be one of the values returned by
3513 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3514 appertain to the pointer or reference. */
3518 cp_cv_quals cv_qualifiers,
3520 tree attributes)
3521 {
3528 else
3538 }
3540 /* Create a new C++ parser. */
3544 {
3549 /* cp_lexer_new_main is called before doing GC allocation because
3550 cp_lexer_new_main might load a PCH file. */
3553 /* Initialize the binops_by_token so that we can get the tree
3554 directly from the token. */
3562 /* For now, we always accept GNU extensions. */
3565 /* The `>' token is a greater-than operator, not the end of a
3566 template-id. */
3571 /* We are not parsing a constant-expression. */
3576 /* Local variable names are not forbidden. */
3579 /* We are not processing an `extern "C"' declaration. */
3582 /* We are not processing a declarator. */
3585 /* We are not processing a template-argument-list. */
3588 /* We are not in an iteration statement. */
3591 /* We are not in a switch statement. */
3594 /* We are not parsing a type-id inside an expression. */
3597 /* Declarations aren't implicitly extern "C". */
3600 /* String literals should be translated to the execution character set. */
3603 /* We are not parsing a function body. */
3606 /* We can correct until told otherwise. */
3609 /* The unparsed function queue is empty. */
3612 /* There are no classes being defined. */
3615 /* No template parameters apply. */
3618 /* Not declaring an implicit function template. */
3625 }
3627 /* Create a cp_lexer structure which will emit the tokens in CACHE
3628 and push it onto the parser's lexer stack. This is used for delayed
3629 parsing of in-class method bodies and default arguments, and should
3630 not be confused with tentative parsing. */
3631 static void
3633 {
3638 /* Move the current source position to that of the first token in the
3639 new lexer. */
3641 }
3643 /* Pop the top lexer off the parser stack. This is never used for the
3644 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3645 static void
3647 {
3652 /* Put the current source position back where it was before this
3653 lexer was pushed. */
3655 }
3657 /* Lexical conventions [gram.lex] */
3659 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3660 identifier. */
3662 static tree
3664 {
3667 /* Look for the identifier. */
3669 /* Return the value. */
3671 }
3673 /* Parse a sequence of adjacent string constants. Returns a
3674 TREE_STRING representing the combined, nul-terminated string
3675 constant. If TRANSLATE is true, translate the string to the
3676 execution character set. If WIDE_OK is true, a wide string is
3677 invalid here.
3679 C++98 [lex.string] says that if a narrow string literal token is
3680 adjacent to a wide string literal token, the behavior is undefined.
3681 However, C99 6.4.5p4 says that this results in a wide string literal.
3682 We follow C99 here, for consistency with the C front end.
3684 This code is largely lifted from lex_string() in c-lex.c.
3686 FUTURE: ObjC++ will need to handle @-strings here. */
3687 static tree
3690 {
3691 tree value;
3698 tree string_tree;
3704 {
3707 }
3710 {
3714 }
3715 else
3716 {
3719 }
3722 /* Try to avoid the overhead of creating and destroying an obstack
3723 for the common case of just one string. */
3726 {
3734 {
3738 }
3739 else
3743 }
3744 else
3745 {
3749 do
3750 {
3752 count++;
3757 {
3760 {
3763 }
3766 {
3771 }
3773 }
3774 else
3778 {
3783 "unsupported non-standard concatenation "
3785 }
3791 {
3795 }
3796 else
3797 {
3801 }
3802 }
3806 }
3809 {
3812 }
3816 {
3821 {
3836 }
3841 {
3846 else
3848 }
3849 }
3850 else
3851 /* cpp_interpret_string has issued an error. */
3858 }
3860 /* Look up a literal operator with the name and the exact arguments. */
3862 static tree
3864 {
3871 {
3877 {
3880 {
3890 }
3893 /* May be this should be sufficient_parms_p instead,
3894 depending on how exactly should user-defined literals
3895 work in presence of default arguments on the literal
3896 operator parameters. */
3899 }
3900 }
3903 }
3905 /* Parse a user-defined char constant. Returns a call to a user-defined
3906 literal operator taking the character as an argument. */
3908 static tree
3910 {
3918 /* Build up a call to the user-defined operator */
3919 /* Lookup the name we got back from the id-expression. */
3924 {
3929 }
3933 }
3935 /* A subroutine of cp_parser_userdef_numeric_literal to
3936 create a char... template parameter pack from a string node. */
3938 static tree
3940 {
3941 tree charvec;
3947 /* Fill in CHARVEC with all of the parameters. */
3952 /* Build the argument packs. */
3959 }
3961 /* A subroutine of cp_parser_userdef_numeric_literal to
3962 create a char... template parameter pack from a string node. */
3964 static tree
3966 {
3967 tree charvec;
3978 /* First template parm is character type. */
3981 /* Fill in CHARVEC with all of the parameters. */
3988 /* Build the argument packs. */
3995 }
3997 /* Parse a user-defined numeric constant. returns a call to a user-defined
3998 literal operator. */
4000 static tree
4002 {
4013 /* Look for a literal operator taking the exact type of numeric argument
4014 as the literal value. */
4019 {
4021 tf_warning_or_error);
4024 {
4027 long_long_unsigned_type_node);
4028 }
4029 else
4030 {
4034 long_double_type_node);
4038 }
4042 }
4045 /* If the numeric argument didn't work, look for a raw literal
4046 operator taking a const char* argument consisting of the number
4047 in string format. */
4052 {
4054 tf_warning_or_error);
4057 }
4060 /* If the raw literal didn't work, look for a non-type template
4061 function with parameter pack char.... Call the function with
4062 template parameter characters representing the number. */
4066 {
4070 tf_warning_or_error);
4073 }
4082 }
4084 /* Parse a user-defined string constant. Returns a call to a user-defined
4085 literal operator taking a character pointer and the length of the string
4086 as arguments. */
4088 static tree
4090 {
4099 /* Build up a call to the user-defined operator. */
4100 /* Lookup the name we got back from the id-expression. */
4107 {
4109 tf_warning_or_error);
4112 }
4115 /* Look for a template function with typename parameter CharT
4116 and parameter pack CharT... Call the function with
4117 template parameter characters representing the string. */
4121 {
4125 tf_warning_or_error);
4128 }
4134 }
4137 /* Basic concepts [gram.basic] */
4139 /* Parse a translation-unit.
4141 translation-unit:
4142 declaration-seq [opt]
4144 Returns TRUE if all went well. */
4146 static bool
4148 {
4149 /* The address of the first non-permanent object on the declarator
4150 obstack. */
4155 /* Create the declarator obstack, if necessary. */
4157 {
4159 /* Create the error declarator. */
4161 /* Create the empty parameter list. */
4163 /* Remember where the base of the declarator obstack lies. */
4165 }
4169 /* If there are no tokens left then all went well. */
4171 {
4172 /* Get rid of the token array; we don't need it any more. */
4176 /* This file might have been a context that's implicitly extern
4177 "C". If so, pop the lang context. (Only relevant for PCH.) */
4179 {
4182 }
4184 /* Finish up. */
4188 }
4189 else
4190 {
4193 }
4195 /* Make sure the declarator obstack was fully cleaned up. */
4199 /* All went well. */
4201 }
4203 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4204 decltype context. */
4208 {
4213 }
4215 /* We're about to parse a collection of statements. If we're currently
4216 parsing tentatively, set up a firewall so that any nested
4217 cp_parser_commit_to_tentative_parse won't affect the current context. */
4219 static cp_token_position
4221 {
4228 }
4230 /* We've finished parsing the collection of statements. Wrap up the
4231 firewall and replace the relevant tokens with the parsed form. */
4233 static void
4235 tree expr)
4236 {
4240 /* Finish the firewall level. */
4242 /* And remember the result of the parse for when we try again. */
4248 }
4250 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4251 enclosing parentheses. */
4253 static tree
4255 {
4258 /* Consume the '('. */
4260 /* Start the statement-expression. */
4262 /* Parse the compound-statement. */
4264 /* Finish up. */
4266 /* Consume the ')'. */
4272 }
4274 /* Expressions [gram.expr] */
4276 /* Parse a primary-expression.
4278 primary-expression:
4279 literal
4280 this
4281 ( expression )
4282 id-expression
4283 lambda-expression (C++11)
4285 GNU Extensions:
4287 primary-expression:
4288 ( compound-statement )
4289 __builtin_va_arg ( assignment-expression , type-id )
4290 __builtin_offsetof ( type-id , offsetof-expression )
4292 C++ Extensions:
4293 __has_nothrow_assign ( type-id )
4294 __has_nothrow_constructor ( type-id )
4295 __has_nothrow_copy ( type-id )
4296 __has_trivial_assign ( type-id )
4297 __has_trivial_constructor ( type-id )
4298 __has_trivial_copy ( type-id )
4299 __has_trivial_destructor ( type-id )
4300 __has_virtual_destructor ( type-id )
4301 __is_abstract ( type-id )
4302 __is_base_of ( type-id , type-id )
4303 __is_class ( type-id )
4304 __is_empty ( type-id )
4305 __is_enum ( type-id )
4306 __is_final ( type-id )
4307 __is_literal_type ( type-id )
4308 __is_pod ( type-id )
4309 __is_polymorphic ( type-id )
4310 __is_std_layout ( type-id )
4311 __is_trivial ( type-id )
4312 __is_union ( type-id )
4314 Objective-C++ Extension:
4316 primary-expression:
4317 objc-expression
4319 literal:
4320 __null
4322 ADDRESS_P is true iff this expression was immediately preceded by
4323 "&" and therefore might denote a pointer-to-member. CAST_P is true
4324 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4325 true iff this expression is a template argument.
4327 Returns a representation of the expression. Upon return, *IDK
4328 indicates what kind of id-expression (if any) was present. */
4330 static tree
4337 {
4340 /* Assume the primary expression is not an id-expression. */
4343 /* Peek at the next token. */
4346 {
4347 /* literal:
4348 integer-literal
4349 character-literal
4350 floating-literal
4351 string-literal
4352 boolean-literal
4353 pointer-literal
4354 user-defined-literal */
4365 {
4369 }
4370 /* Floating-point literals are only allowed in an integral
4371 constant expression if they are cast to an integral or
4372 enumeration type. */
4376 {
4377 /* CAST_P will be set even in invalid code like "int(2.7 +
4378 ...)". Therefore, we have to check that the next token
4379 is sure to end the cast. */
4381 {
4386 enumerator-definition. */
4388 /* The curly brace at the end of an enum-specifier. */
4390 /* The end of a statement. */
4392 /* The end of the cast-expression. */
4394 /* The end of an array bound. */
4396 /* The closing ">" in a template-argument-list. */
4399 /* C++0x only: A ">>" treated like two ">" tokens,
4400 in a template-argument-list. */
4405 }
4407 /* If we are within a cast, then the constraint that the
4408 cast is to an integral or enumeration type will be
4409 checked at that point. If we are not within a cast, then
4410 this code is invalid. */
4413 }
4432 /* ??? Should wide strings be allowed when parser->translate_strings_p
4433 is false (i.e. in attributes)? If not, we can kill the third
4434 argument to cp_parser_string_literal. */
4440 /* If we see `( { ' then we are looking at the beginning of
4441 a GNU statement-expression. */
4444 {
4445 /* Statement-expressions are not allowed by the standard. */
4449 /* And they're not allowed outside of a function-body; you
4450 cannot, for example, write:
4452 int i = ({ int j = 3; j + 1; });
4454 at class or namespace scope. */
4457 {
4459 "statement-expressions are not allowed outside "
4465 }
4466 else
4468 }
4469 /* Otherwise it's a normal parenthesized expression. */
4470 {
4471 tree expr;
4474 /* Consume the `('. */
4476 /* Within a parenthesized expression, a `>' token is always
4477 the greater-than operator. */
4478 saved_greater_than_is_operator_p
4482 /* Parse the parenthesized expression. */
4484 /* Let the front end know that this expression was
4485 enclosed in parentheses. This matters in case, for
4486 example, the expression is of the form `A::B', since
4487 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4488 not. */
4490 /* DR 705: Wrapping an unqualified name in parentheses
4491 suppresses arg-dependent lookup. We want to pass back
4492 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4493 (c++/37862), but none of the others. */
4497 /* The `>' token might be the end of a template-id or
4498 template-parameter-list now. */
4499 parser->greater_than_is_operator_p
4501 /* Consume the `)'. */
4506 }
4509 {
4511 {
4512 /* We might have an Objective-C++ message. */
4515 /* If that works out, we're done ... */
4518 /* ... else, fall though to see if it's a lambda. */
4519 }
4521 /* Don't warn about a failed tentative parse. */
4526 }
4530 /* We have an Objective-C++ string literal. */
4537 {
4538 /* These two are the boolean literals. */
4546 /* The `__null' literal. */
4551 /* The `nullptr' literal. */
4556 /* Recognize the `this' keyword. */
4560 {
4564 }
4565 /* Pointers cannot appear in constant-expressions. */
4570 /* The `operator' keyword can be the beginning of an
4571 id-expression. */
4578 {
4579 non_integral_constant name;
4581 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4582 __func__ are the names of variables -- but they are
4583 treated specially. Therefore, they are handled here,
4584 rather than relying on the generic id-expression logic
4585 below. Grammatically, these names are id-expressions.
4587 Consume the token. */
4591 {
4603 }
4608 /* Look up the name. */
4610 }
4613 {
4614 tree expression;
4615 tree type;
4616 source_location type_location;
4618 /* The `__builtin_va_arg' construct is used to handle
4619 `va_arg'. Consume the `__builtin_va_arg' token. */
4621 /* Look for the opening `('. */
4623 /* Now, parse the assignment-expression. */
4625 /* Look for the `,'. */
4628 /* Parse the type-id. */
4630 /* Look for the closing `)'. */
4632 /* Using `va_arg' in a constant-expression is not
4633 allowed. */
4635 NIC_VA_ARG))
4638 }
4669 // C++ concepts
4673 /* Objective-C++ expressions. */
4683 {
4688 }
4692 }
4694 /* An id-expression can start with either an identifier, a
4695 `::' as the beginning of a qualified-id, or the "operator"
4696 keyword. */
4701 {
4702 tree id_expression;
4703 tree decl;
4709 id_expression:
4710 /* Parse the id-expression. */
4711 id_expression
4728 /* If we have a template-id, then no further lookup is
4729 required. If the template-id was for a template-class, we
4730 will sometimes have a TYPE_DECL at this point. */
4734 /* Look up the name. */
4735 else
4736 {
4737 tree ambiguous_decls;
4739 /* If we already know that this lookup is ambiguous, then
4740 we've already issued an error message; there's no reason
4741 to check again. */
4744 {
4747 }
4750 none_type,
4751 template_p,
4756 /* If the lookup was ambiguous, an error will already have
4757 been issued. */
4761 /* In Objective-C++, we may have an Objective-C 2.0
4762 dot-syntax for classes here. */
4767 {
4768 tree component;
4775 }
4777 /* In Objective-C++, an instance variable (ivar) may be preferred
4778 to whatever cp_parser_lookup_name() found. */
4781 /* If name lookup gives us a SCOPE_REF, then the
4782 qualifying scope was dependent. */
4784 {
4785 /* At this point, we do not know if DECL is a valid
4786 integral constant expression. We assume that it is
4787 in fact such an expression, so that code like:
4789 template <int N> struct A {
4790 int a[B<N>::i];
4791 };
4793 is accepted. At template-instantiation time, we
4794 will check that B<N>::i is actually a constant. */
4796 }
4797 /* Check to see if DECL is a local variable in a context
4798 where that is forbidden. */
4801 {
4802 /* It might be that we only found DECL because we are
4803 trying to be generous with pre-ISO scoping rules.
4804 For example, consider:
4806 int i;
4807 void g() {
4808 for (int i = 0; i < 10; ++i) {}
4809 extern void f(int j = i);
4810 }
4812 Here, name look up will originally find the out
4813 of scope `i'. We need to issue a warning message,
4814 but then use the global `i'. */
4817 {
4820 decl);
4822 }
4823 }
4824 }
4826 decl = (finish_id_expression
4828 idk,
4833 template_arg_p,
4839 }
4841 /* Anything else is an error. */
4845 }
4846 }
4854 {
4857 }
4859 /* Parse an id-expression.
4861 id-expression:
4862 unqualified-id
4863 qualified-id
4865 qualified-id:
4866 :: [opt] nested-name-specifier template [opt] unqualified-id
4867 :: identifier
4868 :: operator-function-id
4869 :: template-id
4871 Return a representation of the unqualified portion of the
4872 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4873 a `::' or nested-name-specifier.
4875 Often, if the id-expression was a qualified-id, the caller will
4876 want to make a SCOPE_REF to represent the qualified-id. This
4877 function does not do this in order to avoid wastefully creating
4878 SCOPE_REFs when they are not required.
4880 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4881 `template' keyword.
4883 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4884 uninstantiated templates.
4886 If *TEMPLATE_P is non-NULL, it is set to true iff the
4887 `template' keyword is used to explicitly indicate that the entity
4888 named is a template.
4890 If DECLARATOR_P is true, the id-expression is appearing as part of
4891 a declarator, rather than as part of an expression. */
4893 static tree
4900 {
4904 /* Assume the `template' keyword was not used. */
4908 /* Look for the optional `::' operator. */
4909 global_scope_p
4912 /* Look for the optional nested-name-specifier. */
4913 nested_name_specifier_p
4916 check_dependency_p,
4918 declarator_p)
4920 /* If there is a nested-name-specifier, then we are looking at
4921 the first qualified-id production. */
4923 {
4924 tree saved_scope;
4925 tree saved_object_scope;
4926 tree saved_qualifying_scope;
4927 tree unqualified_id;
4930 /* See if the next token is the `template' keyword. */
4934 /* Name lookup we do during the processing of the
4935 unqualified-id might obliterate SCOPE. */
4939 /* Process the final unqualified-id. */
4941 check_dependency_p,
4942 declarator_p,
4944 /* Restore the SAVED_SCOPE for our caller. */
4950 }
4951 /* Otherwise, if we are in global scope, then we are looking at one
4952 of the other qualified-id productions. */
4954 {
4956 tree id;
4958 /* Peek at the next token. */
4961 /* If it's an identifier, and the next token is not a "<", then
4962 we can avoid the template-id case. This is an optimization
4963 for this common case. */
4965 && !cp_parser_nth_token_starts_template_argument_list_p
4970 /* Try a template-id. */
4974 none_type,
4975 declarator_p);
4976 /* If that worked, we're done. */
4980 /* Peek at the next token. (Changes in the token buffer may
4981 have invalidated the pointer obtained above.) */
4985 {
4992 /* Fall through. */
4997 }
4998 }
4999 else
5002 declarator_p,
5003 optional_p);
5004 }
5006 /* Parse an unqualified-id.
5008 unqualified-id:
5009 identifier
5010 operator-function-id
5011 conversion-function-id
5012 ~ class-name
5013 template-id
5015 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5016 keyword, in a construct like `A::template ...'.
5018 Returns a representation of unqualified-id. For the `identifier'
5019 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5020 production a BIT_NOT_EXPR is returned; the operand of the
5021 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5022 other productions, see the documentation accompanying the
5023 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5024 names are looked up in uninstantiated templates. If DECLARATOR_P
5025 is true, the unqualified-id is appearing as part of a declarator,
5026 rather than as part of an expression. */
5028 static tree
5034 {
5037 /* Peek at the next token. */
5041 {
5043 {
5044 tree id;
5046 /* We don't know yet whether or not this will be a
5047 template-id. */
5049 /* Try a template-id. */
5051 check_dependency_p,
5052 none_type,
5053 declarator_p);
5054 /* If it worked, we're done. */
5057 /* Otherwise, it's an ordinary identifier. */
5059 }
5063 check_dependency_p,
5064 none_type,
5065 declarator_p);
5068 {
5069 tree type_decl;
5070 tree qualifying_scope;
5071 tree object_scope;
5072 tree scope;
5075 /* Consume the `~' token. */
5077 /* Parse the class-name. The standard, as written, seems to
5078 say that:
5080 template <typename T> struct S { ~S (); };
5081 template <typename T> S<T>::~S() {}
5083 is invalid, since `~' must be followed by a class-name, but
5084 `S<T>' is dependent, and so not known to be a class.
5085 That's not right; we need to look in uninstantiated
5086 templates. A further complication arises from:
5088 template <typename T> void f(T t) {
5089 t.T::~T();
5090 }
5092 Here, it is not possible to look up `T' in the scope of `T'
5093 itself. We must look in both the current scope, and the
5094 scope of the containing complete expression.
5096 Yet another issue is:
5098 struct S {
5099 int S;
5100 ~S();
5101 };
5103 S::~S() {}
5105 The standard does not seem to say that the `S' in `~S'
5106 should refer to the type `S' and not the data member
5107 `S::S'. */
5109 /* DR 244 says that we look up the name after the "~" in the
5110 same scope as we looked up the qualifying name. That idea
5111 isn't fully worked out; it's more complicated than that. */
5116 /* Check for invalid scopes. */
5118 {
5122 }
5124 {
5128 scope);
5133 }
5136 /* If the name is of the form "X::~X" it's OK even if X is a
5137 typedef. */
5146 {
5149 }
5151 /* ~auto means the destructor of whatever the object is. */
5153 {
5156 "%<~auto%> only available with "
5160 }
5162 /* If there was an explicit qualification (S::~T), first look
5163 in the scope given by the qualification (i.e., S).
5165 Note: in the calls to cp_parser_class_name below we pass
5166 typename_type so that lookup finds the injected-class-name
5167 rather than the constructor. */
5171 {
5176 typename_type,
5179 declarator_p);
5182 }
5183 /* In "N::S::~S", look in "N" as well. */
5185 {
5190 type_decl
5194 typename_type,
5197 declarator_p);
5200 }
5201 /* In "p->S::~T", look in the scope given by "*p" as well. */
5203 {
5208 type_decl
5212 typename_type,
5215 declarator_p);
5218 }
5219 /* Look in the surrounding context. */
5221 {
5227 type_decl
5231 typename_type,
5234 declarator_p);
5237 {
5238 /* We couldn't find a type with this name, so just accept
5239 it and check for a match at instantiation time. */
5244 }
5245 }
5246 /* If an error occurred, assume that the name of the
5247 destructor is the same as the name of the qualifying
5248 class. That allows us to keep parsing after running
5249 into ill-formed destructor names. */
5255 /* Check that destructor name and scope match. */
5257 {
5264 }
5266 /* [class.dtor]
5268 A typedef-name that names a class shall not be used as the
5269 identifier in the declarator for a destructor declaration. */
5276 type_decl);
5279 }
5283 {
5284 tree id;
5286 /* This could be a template-id, so we try that first. */
5288 /* Try a template-id. */
5291 none_type,
5292 declarator_p);
5293 /* If that worked, we're done. */
5296 /* We still don't know whether we're looking at an
5297 operator-function-id or a conversion-function-id. */
5299 /* Try an operator-function-id. */
5301 /* If that didn't work, try a conversion-function-id. */
5305 {
5306 /* 17.6.3.3.5 */
5312 }
5315 }
5316 /* Fall through. */
5323 }
5324 }
5326 /* Parse an (optional) nested-name-specifier.
5328 nested-name-specifier: [C++98]
5329 class-or-namespace-name :: nested-name-specifier [opt]
5330 class-or-namespace-name :: template nested-name-specifier [opt]
5332 nested-name-specifier: [C++0x]
5333 type-name ::
5334 namespace-name ::
5335 nested-name-specifier identifier ::
5336 nested-name-specifier template [opt] simple-template-id ::
5338 PARSER->SCOPE should be set appropriately before this function is
5339 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5340 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5341 in name lookups.
5343 Sets PARSER->SCOPE to the class (TYPE) or namespace
5344 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5345 it unchanged if there is no nested-name-specifier. Returns the new
5346 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5348 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5349 part of a declaration and/or decl-specifier. */
5351 static tree
5357 {
5362 /* Remember where the nested-name-specifier starts. */
5364 {
5367 }
5370 {
5371 tree new_scope;
5372 tree old_scope;
5373 tree saved_qualifying_scope;
5376 /* Spot cases that cannot be the beginning of a
5377 nested-name-specifier. */
5380 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5381 the already parsed nested-name-specifier. */
5383 {
5384 /* Grab the nested-name-specifier and continue the loop. */
5386 /* If we originally encountered this nested-name-specifier
5387 with IS_DECLARATION set to false, we will not have
5388 resolved TYPENAME_TYPEs, so we must do so here. */
5391 {
5396 }
5399 }
5401 /* Spot cases that cannot be the beginning of a
5402 nested-name-specifier. On the second and subsequent times
5403 through the loop, we look for the `template' keyword. */
5405 ;
5406 /* A template-id can start a nested-name-specifier. */
5408 ;
5409 /* DR 743: decltype can be used in a nested-name-specifier. */
5411 ;
5412 else
5413 {
5414 /* If the next token is not an identifier, then it is
5415 definitely not a type-name or namespace-name. */
5418 /* If the following token is neither a `<' (to begin a
5419 template-id), nor a `::', then we are not looking at a
5420 nested-name-specifier. */
5426 {
5430 }
5433 && !cp_parser_nth_token_starts_template_argument_list_p
5436 }
5438 /* The nested-name-specifier is optional, so we parse
5439 tentatively. */
5442 /* Look for the optional `template' keyword, if this isn't the
5443 first time through the loop. */
5446 else
5449 /* Save the old scope since the name lookup we are about to do
5450 might destroy it. */
5453 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5454 look up names in "X<T>::I" in order to determine that "Y" is
5455 a template. So, if we have a typename at this point, we make
5456 an effort to look through it. */
5458 && !typename_keyword_p
5463 /* Parse the qualifying entity. */
5464 new_scope
5466 typename_keyword_p,
5467 template_keyword_p,
5468 check_dependency_p,
5469 type_p,
5470 is_declaration);
5471 /* Look for the `::' token. */
5474 /* If we found what we wanted, we keep going; otherwise, we're
5475 done. */
5477 {
5480 /* Restore the OLD_SCOPE since it was valid before the
5481 failed attempt at finding the last
5482 class-or-namespace-name. */
5486 /* If the next token is a decltype, and the one after that is a
5487 `::', then the decltype has failed to resolve to a class or
5488 enumeration type. Give this error even when parsing
5489 tentatively since it can't possibly be valid--and we're going
5490 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5491 won't get another chance.*/
5495 {
5502 /* As below. */
5505 }
5509 {
5510 /* If we have a non-type template-id followed by ::, it can't
5511 possibly be valid. */
5516 {
5519 {
5525 }
5526 else
5527 {
5528 /* Variable template. */
5533 }
5540 /* As below. */
5544 }
5545 }
5549 /* If the next token is an identifier, and the one after
5550 that is a `::', then any valid interpretation would have
5551 found a class-or-namespace-name. */
5557 {
5560 {
5562 {
5563 tree decl;
5564 tree ambiguous_decls;
5567 none_type,
5576 decl);
5578 {
5579 // cp_parser_lookup_name has the same diagnostic,
5580 // thus make sure to emit it at most once.
5583 {
5588 }
5590 }
5591 else
5592 {
5594 cp_parser_name_lookup_error
5597 else
5598 cp_parser_name_lookup_error
5601 }
5602 }
5605 /* Treat this as a successful nested-name-specifier
5606 due to:
5608 [basic.lookup.qual]
5610 If the name found is not a class-name (clause
5611 _class_) or namespace-name (_namespace.def_), the
5612 program is ill-formed. */
5614 }
5616 }
5618 }
5619 /* We've found one valid nested-name-specifier. */
5621 /* Name lookup always gives us a DECL. */
5624 /* Uses of "template" must be followed by actual templates. */
5636 new_scope);
5637 /* If it is a class scope, try to complete it; we are about to
5638 be looking up names inside the class. */
5640 /* Since checking types for dependency can be expensive,
5641 avoid doing it if the type is already complete. */
5643 /* Do not try to complete dependent types. */
5645 {
5647 /* If it is a typedef to current class, use the current
5648 class instead, as the typedef won't have any names inside
5649 it yet. */
5653 }
5654 /* Make sure we look in the right scope the next time through
5655 the loop. */
5657 }
5659 /* If parsing tentatively, replace the sequence of tokens that makes
5660 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5661 token. That way, should we re-parse the token stream, we will
5662 not have to repeat the effort required to do the parse, nor will
5663 we issue duplicate error messages. */
5665 {
5669 /* Reset the contents of the START token. */
5671 /* Retrieve any deferred checks. Do not pop this access checks yet
5672 so the memory will not be reclaimed during token replacing below. */
5680 /* Purge all subsequent tokens. */
5682 }
5688 }
5690 /* Parse a nested-name-specifier. See
5691 cp_parser_nested_name_specifier_opt for details. This function
5692 behaves identically, except that it will an issue an error if no
5693 nested-name-specifier is present. */
5695 static tree
5701 {
5702 tree scope;
5704 /* Look for the nested-name-specifier. */
5706 typename_keyword_p,
5707 check_dependency_p,
5708 type_p,
5709 is_declaration);
5710 /* If it was not present, issue an error message. */
5712 {
5715 }
5718 }
5720 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5721 this is either a class-name or a namespace-name (which corresponds
5722 to the class-or-namespace-name production in the grammar). For
5723 C++0x, it can also be a type-name that refers to an enumeration
5724 type or a simple-template-id.
5726 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5727 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5728 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5729 TYPE_P is TRUE iff the next name should be taken as a class-name,
5730 even the same name is declared to be another entity in the same
5731 scope.
5733 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5734 specified by the class-or-namespace-name. If neither is found the
5735 ERROR_MARK_NODE is returned. */
5737 static tree
5744 {
5745 tree saved_scope;
5746 tree saved_qualifying_scope;
5747 tree saved_object_scope;
5748 tree scope;
5752 /* DR 743: decltype can appear in a nested-name-specifier. */
5754 {
5758 {
5761 }
5765 }
5767 /* Before we try to parse the class-name, we must save away the
5768 current PARSER->SCOPE since cp_parser_class_name will destroy
5769 it. */
5773 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5774 there is no need to look for a namespace-name. */
5775 only_class_p = template_keyword_p
5780 typename_keyword_p,
5781 template_keyword_p,
5783 check_dependency_p,
5785 is_declaration);
5787 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5791 {
5792 /* Restore the saved scope. */
5797 /* Parse tentatively. */
5800 /* Parse a type-name */
5803 /* "If the name found does not designate a namespace or a class,
5804 enumeration, or dependent type, the program is ill-formed."
5806 We cover classes and dependent types above and namespaces below,
5807 so this code is only looking for enums. */
5813 }
5814 /* If that didn't work, try for a namespace-name. */
5816 {
5817 /* Restore the saved scope. */
5821 /* If we are not looking at an identifier followed by the scope
5822 resolution operator, then this is not part of a
5823 nested-name-specifier. (Note that this function is only used
5824 to parse the components of a nested-name-specifier.) */
5829 }
5832 }
5834 /* Return true if we are looking at a compound-literal, false otherwise. */
5836 static bool
5838 {
5839 /* Consume the `('. */
5844 /* Skip tokens until the next token is a closing parenthesis.
5845 If we find the closing `)', and the next token is a `{', then
5846 we are looking at a compound-literal. */
5847 bool compound_literal_p
5852 /* Roll back the tokens we skipped. */
5856 }
5858 /* Parse a postfix-expression.
5860 postfix-expression:
5861 primary-expression
5862 postfix-expression [ expression ]
5863 postfix-expression ( expression-list [opt] )
5864 simple-type-specifier ( expression-list [opt] )
5865 typename :: [opt] nested-name-specifier identifier
5866 ( expression-list [opt] )
5867 typename :: [opt] nested-name-specifier template [opt] template-id
5868 ( expression-list [opt] )
5869 postfix-expression . template [opt] id-expression
5870 postfix-expression -> template [opt] id-expression
5871 postfix-expression . pseudo-destructor-name
5872 postfix-expression -> pseudo-destructor-name
5873 postfix-expression ++
5874 postfix-expression --
5875 dynamic_cast < type-id > ( expression )
5876 static_cast < type-id > ( expression )
5877 reinterpret_cast < type-id > ( expression )
5878 const_cast < type-id > ( expression )
5879 typeid ( expression )
5880 typeid ( type-id )
5882 GNU Extension:
5884 postfix-expression:
5885 ( type-id ) { initializer-list , [opt] }
5887 This extension is a GNU version of the C99 compound-literal
5888 construct. (The C99 grammar uses `type-name' instead of `type-id',
5889 but they are essentially the same concept.)
5891 If ADDRESS_P is true, the postfix expression is the operand of the
5892 `&' operator. CAST_P is true if this expression is the target of a
5893 cast.
5895 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5896 class member access expressions [expr.ref].
5898 Returns a representation of the expression. */
5900 static tree
5904 {
5906 location_t loc;
5913 /* Peek at the next token. */
5916 /* Some of the productions are determined by keywords. */
5919 {
5924 {
5925 tree type;
5926 tree expression;
5930 /* All of these can be handled in the same way from the point
5931 of view of parsing. Begin by consuming the token
5932 identifying the cast. */
5935 /* New types cannot be defined in the cast. */
5937 parser->type_definition_forbidden_message
5940 /* Look for the opening `<'. */
5942 /* Parse the type to which we are casting. */
5947 /* Look for the closing `>'. */
5949 /* Restore the old message. */
5952 bool saved_greater_than_is_operator_p
5956 /* And the expression which is being cast. */
5961 parser->greater_than_is_operator_p
5964 /* Only type conversions to integral or enumeration types
5965 can be used in constant-expressions. */
5971 {
5973 postfix_expression
5977 postfix_expression
5981 postfix_expression
5983 tf_warning_or_error);
5986 postfix_expression
5991 }
5992 }
5996 {
5997 tree type;
6001 /* Consume the `typeid' token. */
6003 /* Look for the `(' token. */
6005 /* Types cannot be defined in a `typeid' expression. */
6007 parser->type_definition_forbidden_message
6009 /* We can't be sure yet whether we're looking at a type-id or an
6010 expression. */
6012 /* Try a type-id first. */
6017 /* Look for the `)' token. Otherwise, we can't be sure that
6018 we're not looking at an expression: consider `typeid (int
6019 (3))', for example. */
6021 /* If all went well, simply lookup the type-id. */
6024 /* Otherwise, fall back to the expression variant. */
6025 else
6026 {
6027 tree expression;
6029 /* Look for an expression. */
6031 /* Compute its typeid. */
6033 /* Look for the `)' token. */
6035 }
6036 /* Restore the saved message. */
6038 /* `typeid' may not appear in an integral constant expression. */
6041 }
6045 {
6046 tree type;
6047 /* The syntax permitted here is the same permitted for an
6048 elaborated-type-specifier. */
6053 }
6057 {
6061 {
6066 }
6068 {
6073 }
6074 else
6075 {
6076 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6079 }
6081 postfix_expression =
6085 {
6089 }
6091 {
6096 }
6097 else
6098 {
6100 postfix_expression);
6104 }
6106 }
6109 {
6112 tree p;
6126 tf_warning_or_error);
6129 tf_warning_or_error);
6130 else
6131 {
6135 }
6137 }
6140 {
6141 tree type;
6143 /* If the next thing is a simple-type-specifier, we may be
6144 looking at a functional cast. We could also be looking at
6145 an id-expression. So, we try the functional cast, and if
6146 that doesn't work we fall back to the primary-expression. */
6148 /* Look for the simple-type-specifier. */
6151 CP_PARSER_FLAGS_NONE);
6152 /* Parse the cast itself. */
6154 postfix_expression
6156 /* If that worked, we're done. */
6160 /* If the functional-cast didn't work out, try a
6161 compound-literal. */
6164 {
6169 /* Avoid calling cp_parser_type_id pointlessly, see comment
6170 in cp_parser_cast_expression about c++/29234. */
6173 else
6174 {
6175 /* Parse the type. */
6180 /* Look for the `)'. */
6182 }
6184 /* If things aren't going well, there's no need to
6185 keep going. */
6187 {
6189 /* Parse the brace-enclosed initializer list. */
6192 }
6193 /* If that worked, we're definitely looking at a
6194 compound-literal expression. */
6196 {
6197 /* Warn the user that a compound literal is not
6198 allowed in standard C++. */
6201 /* For simplicity, we disallow compound literals in
6202 constant-expressions. We could
6203 allow compound literals of integer type, whose
6204 initializer was a constant, in constant
6205 expressions. Permitting that usage, as a further
6206 extension, would not change the meaning of any
6207 currently accepted programs. (Of course, as
6208 compound literals are not part of ISO C++, the
6209 standard has nothing to say.) */
6211 NIC_NCC))
6212 {
6215 }
6216 /* Form the representation of the compound-literal. */
6217 postfix_expression
6219 tf_warning_or_error);
6221 }
6222 }
6224 /* It must be a primary-expression. */
6225 postfix_expression
6228 decltype_p,
6230 }
6232 }
6234 /* Note that we don't need to worry about calling build_cplus_new on a
6235 class-valued CALL_EXPR in decltype when it isn't the end of the
6236 postfix-expression; unary_complex_lvalue will take care of that for
6237 all these cases. */
6239 /* Keep looping until the postfix-expression is complete. */
6241 {
6245 /* It is not a Koenig lookup function call. */
6246 postfix_expression
6249 /* Peek at the next token. */
6253 {
6256 {
6258 "two consecutive %<[%> shall "
6261 }
6262 postfix_expression
6264 postfix_expression,
6266 decltype_p);
6272 /* postfix-expression ( expression-list [opt] ) */
6273 {
6283 is_builtin_constant_p
6286 {
6287 /* The whole point of __builtin_constant_p is to allow
6288 non-constant expressions to appear as arguments. */
6289 saved_integral_constant_expression_p
6291 saved_non_integral_constant_expression_p
6294 }
6295 args = (cp_parser_parenthesized_expression_list
6301 {
6302 parser->integral_constant_expression_p
6304 parser->non_integral_constant_expression_p
6306 }
6309 {
6312 }
6314 /* Function calls are not permitted in
6315 constant-expressions. */
6318 NIC_FUNC_CALL))
6319 {
6323 }
6328 {
6330 {
6332 {
6335 postfix_expression
6337 complain);
6338 }
6339 else
6340 postfix_expression
6342 }
6343 /* We do not perform argument-dependent lookup if
6344 normal lookup finds a non-function, in accordance
6345 with the expected resolution of DR 218. */
6348 {
6352 /* Do not do argument dependent lookup if regular
6353 lookup finds a member function or a block-scope
6354 function declaration. [basic.lookup.argdep]/3 */
6357 {
6360 postfix_expression
6362 complain);
6363 }
6364 }
6365 }
6368 {
6378 "%<memset%> used with constant zero length "
6379 "parameter; this could be due to transposed "
6382 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6383 to avoid leaking those into folder and middle-end. */
6385 tree arg;
6389 }
6392 {
6402 {
6403 postfix_expression
6407 }
6410 {
6411 postfix_expression
6412 = (build_new_method_call
6418 complain));
6419 }
6420 else
6421 postfix_expression
6425 complain);
6426 }
6430 postfix_expression = (build_offset_ref_call_from_tree
6432 complain));
6434 /* A call to a static class member, or a namespace-scope
6435 function. */
6436 postfix_expression
6439 koenig_p,
6440 complain);
6441 else
6442 /* All other function calls. */
6443 postfix_expression
6446 koenig_p,
6447 complain);
6451 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6455 }
6460 /* postfix-expression . template [opt] id-expression
6461 postfix-expression . pseudo-destructor-name
6462 postfix-expression -> template [opt] id-expression
6463 postfix-expression -> pseudo-destructor-name */
6465 /* Consume the `.' or `->' operator. */
6468 postfix_expression
6470 postfix_expression,
6477 /* postfix-expression ++ */
6478 /* Consume the `++' token. */
6480 /* Generate a representation for the complete expression. */
6481 postfix_expression
6483 POSTINCREMENT_EXPR);
6484 /* Increments may not appear in constant-expressions. */
6492 /* postfix-expression -- */
6493 /* Consume the `--' token. */
6495 /* Generate a representation for the complete expression. */
6496 postfix_expression
6498 POSTDECREMENT_EXPR);
6499 /* Decrements may not appear in constant-expressions. */
6511 else
6513 }
6514 }
6516 /* We should never get here. */
6519 }
6521 /* This function parses Cilk Plus array notations. If a normal array expr. is
6522 parsed then the array index is passed back to the caller through *INIT_INDEX
6523 and the function returns a NULL_TREE. If array notation expr. is parsed,
6524 then *INIT_INDEX is ignored by the caller and the function returns
6525 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6526 error_mark_node. */
6528 static tree
6530 tree array_value)
6531 {
6535 {
6538 }
6547 {
6550 }
6552 {
6553 /* Consume the ':'. */
6556 /* If we are here, then we have a case like this A[:]. */
6558 {
6562 }
6566 }
6567 else
6568 {
6569 /* If we are here, then there are three valid possibilities:
6570 1. ARRAY [ EXP ]
6571 2. ARRAY [ EXP : EXP ]
6572 3. ARRAY [ EXP : EXP : EXP ] */
6576 {
6577 /* This indicates that we have a normal array expression. */
6580 }
6582 /* Consume the ':'. */
6586 {
6589 }
6590 }
6595 {
6599 }
6605 }
6607 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6608 by cp_parser_builtin_offsetof. We're looking for
6610 postfix-expression [ expression ]
6611 postfix-expression [ braced-init-list ] (C++11)
6613 FOR_OFFSETOF is set if we're being called in that context, which
6614 changes how we deal with integer constant expressions. */
6616 static tree
6618 tree postfix_expression,
6621 {
6626 /* Consume the `[' token. */
6632 /* Parse the index expression. */
6633 /* ??? For offsetof, there is a question of what to allow here. If
6634 offsetof is not being used in an integral constant expression context,
6635 then we *could* get the right answer by computing the value at runtime.
6636 If we are in an integral constant expression context, then we might
6637 could accept any constant expression; hard to say without analysis.
6638 Rather than open the barn door too wide right away, allow only integer
6639 constant expressions here. */
6642 else
6643 {
6645 {
6652 {
6654 "braced list index is not allowed with array "
6658 }
6659 }
6661 {
6662 /* Here are have these two options:
6663 ARRAY[EXP : EXP] - Array notation expr with default
6664 stride of 1.
6665 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6666 stride. */
6668 postfix_expression);
6671 }
6672 else
6674 }
6678 /* Look for the closing `]'. */
6681 /* Build the ARRAY_REF. */
6685 /* When not doing offsetof, array references are not permitted in
6686 constant-expressions. */
6692 }
6694 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6695 by cp_parser_builtin_offsetof. We're looking for
6697 postfix-expression . template [opt] id-expression
6698 postfix-expression . pseudo-destructor-name
6699 postfix-expression -> template [opt] id-expression
6700 postfix-expression -> pseudo-destructor-name
6702 FOR_OFFSETOF is set if we're being called in that context. That sorta
6703 limits what of the above we'll actually accept, but nevermind.
6704 TOKEN_TYPE is the "." or "->" token, which will already have been
6705 removed from the stream. */
6707 static tree
6710 tree postfix_expression,
6712 location_t location)
6713 {
6714 tree name;
6719 /* If this is a `->' operator, dereference the pointer. */
6722 tf_warning_or_error);
6723 /* Check to see whether or not the expression is type-dependent. */
6725 /* The identifier following the `->' or `.' is not qualified. */
6731 /* Enter the scope corresponding to the type of the object
6732 given by the POSTFIX_EXPRESSION. */
6734 {
6736 /* According to the standard, no expression should ever have
6737 reference type. Unfortunately, we do not currently match
6738 the standard in this respect in that our internal representation
6739 of an expression may have reference type even when the standard
6740 says it does not. Therefore, we have to manually obtain the
6741 underlying type here. */
6743 /* The type of the POSTFIX_EXPRESSION must be complete. */
6745 {
6747 postfix_expression);
6749 }
6750 /* Unlike the object expression in other contexts, *this is not
6751 required to be of complete type for purposes of class member
6752 access (5.2.5) outside the member function body. */
6756 /* Let the name lookup machinery know that we are processing a
6757 class member access expression. */
6759 /* If something went wrong, we want to be able to discern that case,
6760 as opposed to the case where there was no SCOPE due to the type
6761 of expression being dependent. */
6764 /* If the SCOPE was erroneous, make the various semantic analysis
6765 functions exit quickly -- and without issuing additional error
6766 messages. */
6769 }
6771 /* Assume this expression is not a pseudo-destructor access. */
6774 /* If the SCOPE is a scalar type, then, if this is a valid program,
6775 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6776 is type dependent, it can be pseudo-destructor-name or something else.
6777 Try to parse it as pseudo-destructor-name first. */
6779 {
6780 tree s;
6781 tree type;
6784 /* Parse the pseudo-destructor-name. */
6793 {
6795 postfix_expression
6798 }
6799 }
6802 {
6803 /* If the SCOPE is not a scalar type, we are looking at an
6804 ordinary class member access expression, rather than a
6805 pseudo-destructor-name. */
6808 /* Parse the id-expression. */
6809 name = (cp_parser_id_expression
6816 /* In general, build a SCOPE_REF if the member name is qualified.
6817 However, if the name was not dependent and has already been
6818 resolved; there is no need to build the SCOPE_REF. For example;
6820 struct X { void f(); };
6821 template <typename T> void f(T* t) { t->X::f(); }
6823 Even though "t" is dependent, "X::f" is not and has been resolved
6824 to a BASELINK; there is no need to include scope information. */
6826 /* But we do need to remember that there was an explicit scope for
6827 virtual function calls. */
6831 /* If the name is a template-id that names a type, we will get a
6832 TYPE_DECL here. That is invalid code. */
6834 {
6837 }
6838 else
6839 {
6841 {
6843 {
6847 }
6848 else
6851 name,
6852 template_p);
6856 }
6858 adjust_result_of_qualified_name_lookup
6860 postfix_expression
6862 template_p,
6863 tf_warning_or_error);
6864 }
6865 }
6867 /* We no longer need to look up names in the scope of the object on
6868 the left-hand side of the `.' or `->' operator. */
6871 /* Outside of offsetof, these operators may not appear in
6872 constant-expressions. */
6874 && (cp_parser_non_integral_constant_expression
6879 }
6881 /* Cache of LITERAL_ZERO_P constants. */
6885 /* Parse a parenthesized expression-list.
6887 expression-list:
6888 assignment-expression
6889 expression-list, assignment-expression
6891 attribute-list:
6892 expression-list
6893 identifier
6894 identifier, expression-list
6896 CAST_P is true if this expression is the target of a cast.
6898 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6899 argument pack.
6901 Returns a vector of trees. Each element is a representation of an
6902 assignment-expression. NULL is returned if the ( and or ) are
6903 missing. An empty, but allocated, vector is returned on no
6904 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6905 if we are parsing an attribute list for an attribute that wants a
6906 plain identifier argument, normal_attr for an attribute that wants
6907 an expression, or non_attr if we aren't parsing an attribute list. If
6908 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6909 not all of the expressions in the list were constant.
6910 WANT_LITERAL_ZERO_P is true if the caller is interested in
6911 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6912 immediately, this can be removed. */
6921 {
6927 /* Assume all the expressions will be constant. */
6936 /* Within a parenthesized expression, a `>' token is always
6937 the greater-than operator. */
6938 saved_greater_than_is_operator_p
6942 /* Consume expressions until there are no more. */
6945 {
6946 tree expr;
6948 /* At the beginning of attribute lists, check to see if the
6949 next token is an identifier. */
6952 {
6955 /* Consume the identifier. */
6957 /* Save the identifier. */
6959 }
6960 else
6961 {
6964 /* Parse the next assignment-expression. */
6966 {
6967 /* A braced-init-list. */
6973 }
6975 {
6976 expr = (cp_parser_constant_expression
6981 }
6982 else
6983 {
6987 {
6993 /* If a parameter is literal zero alone, remember it
6994 for -Wmemset-transposed-args warning. */
6997 && want_literal_zero_p
6999 == CPP_COMMA
7002 {
7009 else
7010 {
7015 }
7016 /* Consume the 0 token (or '\0', 0LL etc.). */
7018 }
7022 }
7025 cast_p);
7026 }
7031 /* If we have an ellipsis, then this is an expression
7032 expansion. */
7035 {
7036 /* Consume the `...'. */
7039 /* Build the argument pack. */
7041 }
7043 /* Add it to the list. We add error_mark_node
7044 expressions to the list, so that we can still tell if
7045 the correct form for a parenthesized expression-list
7046 is found. That gives better errors. */
7051 }
7053 /* After the first item, attribute lists look the same as
7054 expression lists. */
7057 get_comma:;
7058 /* If the next token isn't a `,', then we are done. */
7062 /* Otherwise, consume the `,' and keep going. */
7064 }
7067 {
7070 skip_comma:;
7071 /* We try and resync to an unnested comma, as that will give the
7072 user better diagnostics. */
7080 {
7081 parser->greater_than_is_operator_p
7084 }
7085 }
7087 parser->greater_than_is_operator_p
7094 }
7096 /* Parse a pseudo-destructor-name.
7098 pseudo-destructor-name:
7099 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7100 :: [opt] nested-name-specifier template template-id :: ~ type-name
7101 :: [opt] nested-name-specifier [opt] ~ type-name
7103 If either of the first two productions is used, sets *SCOPE to the
7104 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7105 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7106 or ERROR_MARK_NODE if the parse fails. */
7108 static void
7110 tree object,
7113 {
7116 /* Handle ~auto. */
7120 {
7123 "%<~auto%> only available with "
7130 }
7132 /* Assume that things will not work out. */
7135 /* Look for the optional `::' operator. */
7137 /* Look for the optional nested-name-specifier. */
7138 nested_name_specifier_p
7145 /* Now, if we saw a nested-name-specifier, we might be doing the
7146 second production. */
7149 {
7150 /* Consume the `template' keyword. */
7152 /* Parse the template-id. */
7156 class_type,
7158 /* Look for the `::' token. */
7160 }
7161 /* If the next token is not a `~', then there might be some
7162 additional qualification. */
7164 {
7165 /* At this point, we're looking for "type-name :: ~". The type-name
7166 must not be a class-name, since this is a pseudo-destructor. So,
7167 it must be either an enum-name, or a typedef-name -- both of which
7168 are just identifiers. So, we peek ahead to check that the "::"
7169 and "~" tokens are present; if they are not, then we can avoid
7170 calling type_name. */
7174 {
7177 }
7179 /* Look for the type-name. */
7184 /* Look for the `::' token. */
7186 }
7187 else
7190 /* Look for the `~'. */
7193 /* Once we see the ~, this has to be a pseudo-destructor. */
7197 /* Look for the type-name again. We are not responsible for
7198 checking that it matches the first type-name. */
7200 }
7202 /* Parse a unary-expression.
7204 unary-expression:
7205 postfix-expression
7206 ++ cast-expression
7207 -- cast-expression
7208 unary-operator cast-expression
7209 sizeof unary-expression
7210 sizeof ( type-id )
7211 alignof ( type-id ) [C++0x]
7212 new-expression
7213 delete-expression
7215 GNU Extensions:
7217 unary-expression:
7218 __extension__ cast-expression
7219 __alignof__ unary-expression
7220 __alignof__ ( type-id )
7221 alignof unary-expression [C++0x]
7222 __real__ cast-expression
7223 __imag__ cast-expression
7224 && identifier
7225 sizeof ( type-id ) { initializer-list , [opt] }
7226 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7227 __alignof__ ( type-id ) { initializer-list , [opt] }
7229 ADDRESS_P is true iff the unary-expression is appearing as the
7230 operand of the `&' operator. CAST_P is true if this expression is
7231 the target of a cast.
7233 Returns a representation of the expression. */
7235 static tree
7238 {
7242 /* Peek at the next token. */
7244 /* Some keywords give away the kind of expression. */
7246 {
7250 {
7253 {
7256 location_t first_loc;
7259 /* Consume the token. */
7262 /* Parse the operand. */
7267 else
7268 {
7269 /* ISO C++ defines alignof only with types, not with
7270 expressions. So pedwarn if alignof is used with a non-
7271 type expression. However, __alignof__ is ok. */
7274 "ISO C++ does not allow %<alignof%> "
7278 }
7279 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7280 SIZEOF_EXPR with the original operand. */
7282 {
7284 {
7286 {
7289 error_mark_node));
7291 }
7292 else
7296 }
7298 }
7300 }
7309 {
7310 /* The saved value of the PEDANTIC flag. */
7312 tree expr;
7314 /* Save away the PEDANTIC flag. */
7316 /* Parse the cast-expression. */
7318 /* Restore the PEDANTIC flag. */
7322 }
7326 {
7327 tree expression;
7329 /* Consume the `__real__' or `__imag__' token. */
7331 /* Parse the cast-expression. */
7333 /* Create the complete representation. */
7337 expression,
7338 tf_warning_or_error);
7339 }
7347 {
7348 tree expr;
7358 parser->type_definition_forbidden_message
7361 saved_integral_constant_expression_p
7363 saved_non_integral_constant_expression_p
7367 saved_greater_than_is_operator_p
7379 parser->greater_than_is_operator_p
7382 parser->integral_constant_expression_p
7384 parser->non_integral_constant_expression_p
7391 }
7395 }
7396 }
7398 /* Look for the `:: new' and `:: delete', which also signal the
7399 beginning of a new-expression, or delete-expression,
7400 respectively. If the next token is `::', then it might be one of
7401 these. */
7403 {
7406 /* See if the token after the `::' is one of the keywords in
7407 which we're interested. */
7409 /* If it's `new', we have a new-expression. */
7412 /* Similarly, for `delete'. */
7415 }
7417 /* Look for a unary operator. */
7419 /* The `++' and `--' operators can be handled similarly, even though
7420 they are not technically unary-operators in the grammar. */
7422 {
7427 /* Handle the GNU address-of-label extension. */
7430 {
7431 tree identifier;
7432 tree expression;
7435 /* Consume the '&&' token. */
7437 /* Look for the identifier. */
7439 /* Create an expression representing the address. */
7442 NIC_ADDR_LABEL))
7445 }
7446 }
7448 {
7449 tree cast_expression;
7455 /* Consume the operator token. */
7457 /* Parse the cast-expression. */
7458 cast_expression
7463 pidk);
7464 /* Now, build an appropriate representation. */
7466 {
7470 RO_UNARY_STAR,
7471 complain);
7476 /* Fall through. */
7479 cast_expression,
7480 complain);
7487 /* Fall through. */
7497 }
7501 non_constant_p))
7505 }
7509 decltype_p,
7510 pidk);
7511 }
7513 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7514 unary-operator, the corresponding tree code is returned. */
7516 static enum tree_code
7518 {
7520 {
7541 }
7542 }
7544 /* Parse a new-expression.
7546 new-expression:
7547 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7548 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7550 Returns a representation of the expression. */
7552 static tree
7554 {
7557 tree type;
7560 tree ret;
7562 /* Look for the optional `::' operator. */
7563 global_scope_p
7567 /* Look for the `new' operator. */
7569 /* There's no easy way to tell a new-placement from the
7570 `( type-id )' construct. */
7572 /* Look for a new-placement. */
7574 /* If that didn't work out, there's no new-placement. */
7576 {
7580 }
7582 /* If the next token is a `(', then we have a parenthesized
7583 type-id. */
7585 {
7589 /* Consume the `('. */
7592 /* Parse the type-id. */
7593 parser->type_definition_forbidden_message
7598 /* Look for the closing `)'. */
7601 /* There should not be a direct-new-declarator in this production,
7602 but GCC used to allowed this, so we check and emit a sensible error
7603 message for this case. */
7605 {
7611 }
7612 }
7613 /* Otherwise, there must be a new-type-id. */
7614 else
7617 /* If the next token is a `(' or '{', then we have a new-initializer. */
7621 else
7624 /* A new-expression may not appear in an integral constant
7625 expression. */
7628 else
7629 {
7630 /* Create a representation of the new-expression. */
7632 tf_warning_or_error);
7633 }
7641 }
7643 /* Parse a new-placement.
7645 new-placement:
7646 ( expression-list )
7648 Returns the same representation as for an expression-list. */
7652 {
7655 /* Parse the expression-list. */
7656 expression_list = (cp_parser_parenthesized_expression_list
7662 }
7664 /* Parse a new-type-id.
7666 new-type-id:
7667 type-specifier-seq new-declarator [opt]
7669 Returns the TYPE allocated. If the new-type-id indicates an array
7670 type, *NELTS is set to the number of elements in the last array
7671 bound; the TYPE will not include the last array bound. */
7673 static tree
7675 {
7676 cp_decl_specifier_seq type_specifier_seq;
7682 /* The type-specifier sequence must not contain type definitions.
7683 (It cannot contain declarations of new types either, but if they
7684 are not definitions we will catch that because they are not
7685 complete.) */
7687 parser->type_definition_forbidden_message
7689 /* Parse the type-specifier-seq. */
7693 /* Restore the old message. */
7699 /* Parse the new-declarator. */
7702 /* Determine the number of elements in the last array dimension, if
7703 any. */
7705 /* Skip down to the last array dimension. */
7710 {
7713 }
7718 {
7721 }
7724 {
7731 else
7733 }
7736 }
7738 /* Parse an (optional) new-declarator.
7740 new-declarator:
7741 ptr-operator new-declarator [opt]
7742 direct-new-declarator
7744 Returns the declarator. */
7748 {
7751 cp_cv_quals cv_quals;
7753 /* We don't know if there's a ptr-operator next, or not. */
7755 /* Look for a ptr-operator. */
7757 /* If that worked, look for more new-declarators. */
7759 {
7762 /* Parse another optional declarator. */
7765 declarator = cp_parser_make_indirect_declarator
7769 }
7771 /* If the next token is a `[', there is a direct-new-declarator. */
7776 }
7778 /* Parse a direct-new-declarator.
7780 direct-new-declarator:
7781 [ expression ]
7782 direct-new-declarator [constant-expression]
7784 */
7788 {
7792 {
7793 tree expression;
7796 /* Look for the opening `['. */
7801 /* The standard requires that the expression have integral
7802 type. DR 74 adds enumeration types. We believe that the
7803 real intent is that these expressions be handled like the
7804 expression in a `switch' condition, which also allows
7805 classes with a single conversion to integral or
7806 enumeration type. */
7808 {
7809 expression
7811 expression,
7814 {
7816 "expression in new-declarator must have integral "
7819 }
7820 }
7822 /* Look for the closing `]'. */
7825 /* Add this bound to the declarator. */
7828 /* If the next token is not a `[', then there are no more
7829 bounds. */
7832 }
7835 }
7837 /* Parse a new-initializer.
7839 new-initializer:
7840 ( expression-list [opt] )
7841 braced-init-list
7843 Returns a representation of the expression-list. */
7847 {
7851 {
7852 tree t;
7859 }
7860 else
7861 expression_list = (cp_parser_parenthesized_expression_list
7867 }
7869 /* Parse a delete-expression.
7871 delete-expression:
7872 :: [opt] delete cast-expression
7873 :: [opt] delete [ ] cast-expression
7875 Returns a representation of the expression. */
7877 static tree
7879 {
7882 tree expression;
7884 /* Look for the optional `::' operator. */
7885 global_scope_p
7889 /* Look for the `delete' keyword. */
7891 /* See if the array syntax is in use. */
7893 {
7894 /* Consume the `[' token. */
7896 /* Look for the `]' token. */
7898 /* Remember that this is the `[]' construct. */
7900 }
7901 else
7904 /* Parse the cast-expression. */
7907 /* A delete-expression may not appear in an integral constant
7908 expression. */
7913 tf_warning_or_error);
7914 }
7916 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7917 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7918 0 otherwise. */
7920 static int
7922 {
7925 {
7967 /* In ((type ()) () the last () isn't a valid cast-expression,
7968 so the whole must be parsed as postfix-expression. */
7973 /* '[' may start a primary-expression in obj-c++ and in C++11,
7974 as a lambda-expression, eg, '(void)[]{}'. */
7981 /* '++' and '--' may or may not start a cast-expression:
7983 struct T { void operator++(int); };
7984 void f() { (T())++; }
7986 vs
7988 int a;
7989 (int)++a; */
7994 }
7995 }
7997 /* Parse a cast-expression.
7999 cast-expression:
8000 unary-expression
8001 ( type-id ) cast-expression
8003 ADDRESS_P is true iff the unary-expression is appearing as the
8004 operand of the `&' operator. CAST_P is true if this expression is
8005 the target of a cast.
8007 Returns a representation of the expression. */
8009 static tree
8012 {
8013 /* If it's a `(', then we might be looking at a cast. */
8015 {
8021 /* There's no way to know yet whether or not this is a cast.
8022 For example, `(int (3))' is a unary-expression, while `(int)
8023 3' is a cast. So, we resort to parsing tentatively. */
8025 /* Types may not be defined in a cast. */
8027 parser->type_definition_forbidden_message
8029 /* Consume the `('. */
8031 /* A very tricky bit is that `(struct S) { 3 }' is a
8032 compound-literal (which we permit in C++ as an extension).
8033 But, that construct is not a cast-expression -- it is a
8034 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8035 is legal; if the compound-literal were a cast-expression,
8036 you'd need an extra set of parentheses.) But, if we parse
8037 the type-id, and it happens to be a class-specifier, then we
8038 will commit to the parse at that point, because we cannot
8039 undo the action that is done when creating a new class. So,
8040 then we cannot back up and do a postfix-expression.
8042 Another tricky case is the following (c++/29234):
8044 struct S { void operator () (); };
8046 void foo ()
8047 {
8048 ( S()() );
8049 }
8051 As a type-id we parse the parenthesized S()() as a function
8052 returning a function, groktypename complains and we cannot
8053 back up in this case either.
8055 Therefore, we scan ahead to the closing `)', and check to see
8056 if the tokens after the `)' can start a cast-expression. Otherwise
8057 we are dealing with an unary-expression, a postfix-expression
8058 or something else.
8060 Yet another tricky case, in C++11, is the following (c++/54891):
8062 (void)[]{};
8064 The issue is that usually, besides the case of lambda-expressions,
8065 the parenthesized type-id cannot be followed by '[', and, eg, we
8066 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8067 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8068 we don't commit, we try a cast-expression, then an unary-expression.
8070 Save tokens so that we can put them back. */
8073 /* We may be looking at a cast-expression. */
8076 cast_expression
8079 /* Roll back the tokens we skipped. */
8081 /* If we aren't looking at a cast-expression, simulate an error so
8082 that the call to cp_parser_error_occurred below returns true. */
8085 else
8086 {
8089 /* Look for the type-id. */
8091 /* Look for the closing `)'. */
8094 }
8096 /* Restore the saved message. */
8099 /* At this point this can only be either a cast or a
8100 parenthesized ctor such as `(T ())' that looks like a cast to
8101 function returning T. */
8103 {
8104 /* Only commit if the cast-expression doesn't start with
8105 '++', '--', or '[' in C++11. */
8113 pidk);
8116 {
8117 /* Warn about old-style casts, if so requested. */
8124 /* Only type conversions to integral or enumeration types
8125 can be used in constant-expressions. */
8128 NIC_CAST))
8131 /* Perform the cast. */
8134 }
8135 }
8136 else
8138 }
8140 /* If we get here, then it's not a cast, so it must be a
8141 unary-expression. */
8144 }
8146 /* Parse a binary expression of the general form:
8148 pm-expression:
8149 cast-expression
8150 pm-expression .* cast-expression
8151 pm-expression ->* cast-expression
8153 multiplicative-expression:
8154 pm-expression
8155 multiplicative-expression * pm-expression
8156 multiplicative-expression / pm-expression
8157 multiplicative-expression % pm-expression
8159 additive-expression:
8160 multiplicative-expression
8161 additive-expression + multiplicative-expression
8162 additive-expression - multiplicative-expression
8164 shift-expression:
8165 additive-expression
8166 shift-expression << additive-expression
8167 shift-expression >> additive-expression
8169 relational-expression:
8170 shift-expression
8171 relational-expression < shift-expression
8172 relational-expression > shift-expression
8173 relational-expression <= shift-expression
8174 relational-expression >= shift-expression
8176 GNU Extension:
8178 relational-expression:
8179 relational-expression <? shift-expression
8180 relational-expression >? shift-expression
8182 equality-expression:
8183 relational-expression
8184 equality-expression == relational-expression
8185 equality-expression != relational-expression
8187 and-expression:
8188 equality-expression
8189 and-expression & equality-expression
8191 exclusive-or-expression:
8192 and-expression
8193 exclusive-or-expression ^ and-expression
8195 inclusive-or-expression:
8196 exclusive-or-expression
8197 inclusive-or-expression | exclusive-or-expression
8199 logical-and-expression:
8200 inclusive-or-expression
8201 logical-and-expression && inclusive-or-expression
8203 logical-or-expression:
8204 logical-and-expression
8205 logical-or-expression || logical-and-expression
8207 All these are implemented with a single function like:
8209 binary-expression:
8210 simple-cast-expression
8211 binary-expression <token> binary-expression
8213 CAST_P is true if this expression is the target of a cast.
8215 The binops_by_token map is used to get the tree codes for each <token> type.
8216 binary-expressions are associated according to a precedence table. */
8218 #define TOKEN_PRECEDENCE(token) \
8219 (((token->type == CPP_GREATER \
8220 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8221 && !parser->greater_than_is_operator_p) \
8222 ? PREC_NOT_OPERATOR \
8223 : binops_by_token[token->type].prec)
8225 static tree
8231 {
8232 cp_parser_expression_stack stack;
8234 cp_parser_expression_stack_entry current;
8235 tree rhs;
8239 tree overload;
8241 /* Parse the first expression. */
8252 {
8253 /* Get an operator token. */
8259 {
8261 "%<>>%> operator is treated"
8265 }
8269 /* Popping an entry off the stack means we completed a subexpression:
8270 - either we found a token which is not an operator (`>' where it is not
8271 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8272 will happen repeatedly;
8273 - or, we found an operator which has lower priority. This is the case
8274 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8275 parsing `3 * 4'. */
8277 {
8280 else
8282 }
8284 get_rhs:
8288 /* We used the operator token. */
8291 /* For "false && x" or "true || x", x will never be executed;
8292 disable warnings while evaluating it. */
8298 /* Extract another operand. It may be the RHS of this expression
8299 or the LHS of a new, higher priority expression. */
8304 /* Get another operator token. Look up its precedence to avoid
8305 building a useless (immediately popped) stack entry for common
8306 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8310 {
8311 /* ... and prepare to parse the RHS of the new, higher priority
8312 expression. Since precedence levels on the stack are
8313 monotonically increasing, we do not have to care about
8314 stack overflows. */
8323 pop:
8325 /* If the stack is not empty, we have parsed into LHS the right side
8326 (`4' in the example above) of an expression we had suspended.
8327 We can use the information on the stack to recover the LHS (`3')
8328 from the stack together with the tree code (`MULT_EXPR'), and
8329 the precedence of the higher level subexpression
8330 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8331 which will be used to actually build the additive expression. */
8336 }
8338 /* Undo the disabling of warnings done above. */
8347 /* Avoid warning for !!x == y. */
8352 /* Avoid warning for !b == y where b is boolean. */
8356 /* Avoid warning for !!b == y where b is boolean. */
8364 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8365 ERROR_MARK for everything that is not a binary expression.
8366 This makes warn_about_parentheses miss some warnings that
8367 involve unary operators. For unary expressions we should
8368 pass the correct tree_code unless the unary expression was
8369 surrounded by parentheses.
8370 */
8376 == tcc_comparison
8379 else
8388 /* If the binary operator required the use of an overloaded operator,
8389 then this expression cannot be an integral constant-expression.
8390 An overloaded operator can be used even if both operands are
8391 otherwise permissible in an integral constant-expression if at
8392 least one of the operands is of enumeration type. */
8396 NIC_OVERLOADED))
8398 }
8401 }
8403 static tree
8408 {
8411 }
8413 /* Parse the `? expression : assignment-expression' part of a
8414 conditional-expression. The LOGICAL_OR_EXPR is the
8415 logical-or-expression that started the conditional-expression.
8416 Returns a representation of the entire conditional-expression.
8418 This routine is used by cp_parser_assignment_expression.
8420 ? expression : assignment-expression
8422 GNU Extensions:
8424 ? : assignment-expression */
8426 static tree
8428 {
8429 tree expr;
8430 tree assignment_expr;
8434 /* Consume the `?' token. */
8439 {
8442 /* Implicit true clause. */
8446 }
8447 else
8448 {
8451 /* Parse the expression. */
8454 c_inhibit_evaluation_warnings +=
8458 }
8460 /* The next token should be a `:'. */
8462 /* Parse the assignment-expression. */
8466 /* Build the conditional-expression. */
8468 expr,
8469 assignment_expr,
8470 tf_warning_or_error);
8471 }
8473 /* Parse an assignment-expression.
8475 assignment-expression:
8476 conditional-expression
8477 logical-or-expression assignment-operator assignment_expression
8478 throw-expression
8480 CAST_P is true if this expression is the target of a cast.
8481 DECLTYPE_P is true if this expression is the operand of decltype.
8483 Returns a representation for the expression. */
8485 static tree
8488 {
8489 tree expr;
8491 /* If the next token is the `throw' keyword, then we're looking at
8492 a throw-expression. */
8495 /* Otherwise, it must be that we are looking at a
8496 logical-or-expression. */
8497 else
8498 {
8499 /* Parse the binary expressions (logical-or-expression). */
8501 decltype_p,
8503 /* If the next token is a `?' then we're actually looking at a
8504 conditional-expression. */
8507 else
8508 {
8511 /* If it's an assignment-operator, we're using the second
8512 production. */
8513 enum tree_code assignment_operator
8516 {
8518 location_t saved_input_location;
8520 /* Parse the right-hand side of the assignment. */
8526 /* An assignment may not appear in a
8527 constant-expression. */
8529 NIC_ASSIGNMENT))
8531 /* Build the assignment expression. Its default
8532 location is the location of the '=' token. */
8536 assignment_operator,
8537 rhs,
8540 }
8541 }
8542 }
8545 }
8547 /* Parse an (optional) assignment-operator.
8549 assignment-operator: one of
8550 = *= /= %= += -= >>= <<= &= ^= |=
8552 GNU Extension:
8554 assignment-operator: one of
8555 <?= >?=
8557 If the next token is an assignment operator, the corresponding tree
8558 code is returned, and the token is consumed. For example, for
8559 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8560 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8561 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8562 operator, ERROR_MARK is returned. */
8564 static enum tree_code
8566 {
8570 /* Peek at the next token. */
8574 {
8620 /* Nothing else is an assignment operator. */
8622 }
8624 /* If it was an assignment operator, consume it. */
8629 }
8631 /* Parse an expression.
8633 expression:
8634 assignment-expression
8635 expression , assignment-expression
8637 CAST_P is true if this expression is the target of a cast.
8638 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8639 except possibly parenthesized or on the RHS of a comma (N3276).
8641 Returns a representation of the expression. */
8643 static tree
8646 {
8651 {
8652 tree assignment_expression;
8654 /* Parse the next assignment-expression. */
8655 assignment_expression
8658 /* We don't create a temporary for a call that is the immediate operand
8659 of decltype or on the RHS of a comma. But when we see a comma, we
8660 need to create a temporary for a call on the LHS. */
8665 assignment_expression
8669 /* If this is the first assignment-expression, we can just
8670 save it away. */
8673 else
8675 assignment_expression,
8677 /* If the next token is not a comma, then we are done with the
8678 expression. */
8681 /* Consume the `,'. */
8684 /* A comma operator cannot appear in a constant-expression. */
8687 }
8690 }
8692 /* Parse a constant-expression.
8694 constant-expression:
8695 conditional-expression
8697 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8698 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8699 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8700 is false, NON_CONSTANT_P should be NULL. */
8702 static tree
8706 {
8710 tree expression;
8712 /* It might seem that we could simply parse the
8713 conditional-expression, and then check to see if it were
8714 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8715 one that the compiler can figure out is constant, possibly after
8716 doing some simplifications or optimizations. The standard has a
8717 precise definition of constant-expression, and we must honor
8718 that, even though it is somewhat more restrictive.
8720 For example:
8722 int i[(2, 3)];
8724 is not a legal declaration, because `(2, 3)' is not a
8725 constant-expression. The `,' operator is forbidden in a
8726 constant-expression. However, GCC's constant-folding machinery
8727 will fold this operation to an INTEGER_CST for `3'. */
8729 /* Save the old settings. */
8731 saved_allow_non_integral_constant_expression_p
8734 /* We are now parsing a constant-expression. */
8736 parser->allow_non_integral_constant_expression_p
8739 /* Although the grammar says "conditional-expression", we parse an
8740 "assignment-expression", which also permits "throw-expression"
8741 and the use of assignment operators. In the case that
8742 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8743 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8744 actually essential that we look for an assignment-expression.
8745 For example, cp_parser_initializer_clauses uses this function to
8746 determine whether a particular assignment-expression is in fact
8747 constant. */
8749 /* Restore the old settings. */
8750 parser->integral_constant_expression_p
8752 parser->allow_non_integral_constant_expression_p
8755 {
8756 /* Require an rvalue constant expression here; that's what our
8757 callers expect. Reference constant expressions are handled
8758 separately in e.g. cp_parser_template_argument. */
8763 }
8766 parser->non_integral_constant_expression_p
8770 }
8772 /* Parse __builtin_offsetof.
8774 offsetof-expression:
8775 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8777 offsetof-member-designator:
8778 id-expression
8779 | offsetof-member-designator "." id-expression
8780 | offsetof-member-designator "[" expression "]"
8781 | offsetof-member-designator "->" id-expression */
8783 static tree
8785 {
8788 cp_id_kind dummy;
8791 /* We're about to accept non-integral-constant things, but will
8792 definitely yield an integral constant expression. Save and
8793 restore these values around our local parsing. */
8797 /* Consume the "__builtin_offsetof" token. */
8799 /* Consume the opening `('. */
8801 /* Parse the type-id. */
8804 /* Look for the `,'. */
8808 /* Build the (type *)null that begins the traditional offsetof macro. */
8810 tf_warning_or_error);
8812 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8816 {
8819 {
8821 /* offsetof-member-designator "[" expression "]" */
8827 /* offsetof-member-designator "->" identifier */
8830 /* FALLTHRU */
8833 /* offsetof-member-designator "." identifier */
8841 /* Consume the ")" token. */
8846 /* Error. We know the following require will fail, but
8847 that gives the proper error message. */
8852 }
8853 }
8855 success:
8858 failure:
8863 }
8865 /* Parse a trait expression.
8867 Returns a representation of the expression, the underlying type
8868 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8870 static tree
8872 {
8873 cp_trait_kind kind;
8879 {
8967 }
8969 /* Consume the token. */
8980 {
8987 }
8989 {
8991 {
8995 {
8998 }
9002 }
9003 }
9007 /* Complete the trait expression, which may mean either processing
9008 the trait expr now or saving it for template instantiation. */
9010 {
9019 }
9020 }
9022 /* Lambdas that appear in variable initializer or default argument scope
9023 get that in their mangling, so we need to record it. We might as well
9024 use the count for function and namespace scopes as well. */
9028 {
9029 tree t;
9034 static void
9036 {
9037 tree_int ti;
9039 /* Once we're inside a function, we ignore other scopes and just push
9040 the function again so that popping works properly. */
9047 {
9048 /* Don't reset the count if we're still in the same function. */
9051 }
9052 }
9054 static void
9056 {
9059 }
9061 static void
9063 {
9066 {
9069 }
9071 }
9073 /* Parse a lambda expression.
9075 lambda-expression:
9076 lambda-introducer lambda-declarator [opt] compound-statement
9078 Returns a representation of the expression. */
9080 static tree
9082 {
9084 tree type;
9092 {
9094 {
9098 }
9100 }
9102 {
9104 {
9107 }
9109 }
9111 /* We may be in the middle of deferred access check. Disable
9112 it now. */
9123 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9126 /* Now that we've started the type, add the capture fields for any
9127 explicit captures. */
9130 {
9131 /* Inside the class, surrounding template-parameter-lists do not apply. */
9132 unsigned int saved_num_template_parameter_lists
9136 bool fully_implicit_function_template_p
9140 bool auto_is_implicit_function_template_parm_p
9151 /* By virtue of defining a local class, a lambda expression has access to
9152 the private variables of enclosing classes. */
9157 {
9163 }
9165 {
9168 }
9170 /* The capture list was built up in reverse order; fix that now. */
9182 parser->fully_implicit_function_template_p
9186 parser->auto_is_implicit_function_template_parm_p
9188 }
9192 /* This field is only used during parsing of the lambda. */
9195 /* This lambda shouldn't have any proxies left at this point. */
9197 /* And now that we're done, push proxies for an enclosing lambda. */
9202 else
9208 }
9210 /* Parse the beginning of a lambda expression.
9212 lambda-introducer:
9213 [ lambda-capture [opt] ]
9215 LAMBDA_EXPR is the current representation of the lambda expression. */
9217 static void
9219 {
9220 /* Need commas after the first capture. */
9223 /* Eat the leading `['. */
9226 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9234 {
9237 }
9240 {
9242 tree capture_id;
9243 tree capture_init_expr;
9247 enum capture_kind_type
9248 {
9249 BY_COPY,
9250 BY_REFERENCE
9251 };
9255 {
9258 }
9262 else
9265 /* Possibly capture `this'. */
9267 {
9277 explicit_init_p);
9279 }
9281 /* Remember whether we want to capture as a reference or not. */
9283 {
9286 }
9288 /* Get the identifier. */
9293 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9294 delimiters, but I modified this to stop on unnested ']' as well. It
9295 was already changed to stop on unnested '}', so the
9296 "closing_parenthesis" name is no more misleading with my change. */
9297 {
9303 }
9305 /* Find the initializer for this capture. */
9309 {
9311 /* An explicit initializer exists. */
9314 "lambda capture initializers "
9320 {
9323 }
9324 }
9325 else
9326 {
9329 /* Turn the identifier into an id-expression. */
9330 capture_init_expr
9335 {
9338 }
9342 {
9345 capture_init_expr);
9348 }
9351 {
9354 capture_init_expr))
9357 }
9359 capture_init_expr
9360 = finish_id_expression
9362 capture_init_expr,
9376 {
9379 }
9380 else
9382 }
9386 {
9391 capture_id);
9395 "capture of %qD redundant with by-reference capture "
9397 }
9400 capture_id,
9401 capture_init_expr,
9403 explicit_init_p);
9404 }
9407 }
9409 /* Parse the (optional) middle of a lambda expression.
9411 lambda-declarator:
9412 < template-parameter-list [opt] >
9413 ( parameter-declaration-clause [opt] )
9414 attribute-specifier [opt]
9415 mutable [opt]
9416 exception-specification [opt]
9417 lambda-return-type-clause [opt]
9419 LAMBDA_EXPR is the current representation of the lambda expression. */
9421 static bool
9423 {
9424 /* 5.1.1.4 of the standard says:
9425 If a lambda-expression does not include a lambda-declarator, it is as if
9426 the lambda-declarator were ().
9427 This means an empty parameter list, no attributes, and no exception
9428 specification. */
9434 /* The template-parameter-list is optional, but must begin with
9435 an opening angle if present. */
9437 {
9440 "lambda templates are only available with "
9449 /* We just processed one more parameter list. */
9451 }
9453 /* The parameter-declaration-clause is optional (unless
9454 template-parameter-list was given), but must begin with an
9455 opening parenthesis if present. */
9457 {
9462 /* Parse parameters. */
9465 /* Default arguments shall not be specified in the
9466 parameter-declaration-clause of a lambda-declarator. */
9476 /* Parse optional `mutable' keyword. */
9478 {
9481 }
9483 /* Parse optional exception specification. */
9486 /* Parse optional trailing return type. */
9488 {
9492 }
9494 /* The function parameters must be in scope all the way until after the
9495 trailing-return-type in case of decltype. */
9497 }
9501 /* Create the function call operator.
9503 Messing with declarators like this is no uglier than building up the
9504 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9505 other code. */
9506 {
9507 cp_decl_specifier_seq return_type_specs;
9509 tree fco;
9516 else
9517 /* Maybe we will deduce the return type later. */
9523 sfk_none);
9528 VIRT_SPEC_UNSPECIFIED,
9529 REF_QUAL_NONE,
9530 exception_spec,
9537 declarator,
9538 attributes);
9540 {
9543 /* Give the object parameter a different name. */
9547 }
9549 {
9553 }
9562 }
9563 }
9565 /* Parse the body of a lambda expression, which is simply
9567 compound-statement
9569 but which requires special handling.
9570 LAMBDA_EXPR is the current representation of the lambda expression. */
9572 static void
9574 {
9579 else
9580 /* Still increment function_depth so that we don't GC in the
9581 middle of an expression. */
9583 /* Clear this in case we're in the middle of a default argument. */
9586 /* Finish the function call operator
9587 - class_specifier
9588 + late_parsing_for_member
9589 + function_definition_after_declarator
9590 + ctor_initializer_opt_and_function_body */
9591 {
9593 tree body;
9595 tree compound_stmt;
9596 tree cap;
9598 /* Let the front end know that we are going to be defining this
9599 function. */
9601 NULL_TREE,
9610 /* Push the proxies for any explicit captures. */
9617 /* 5.1.1.4 of the standard says:
9618 If a lambda-expression does not include a trailing-return-type, it
9619 is as if the trailing-return-type denotes the following type:
9620 * if the compound-statement is of the form
9621 { return attribute-specifier [opt] expression ; }
9622 the type of the returned expression after lvalue-to-rvalue
9623 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9624 (_conv.array_ 4.2), and function-to-pointer conversion
9625 (_conv.func_ 4.3);
9626 * otherwise, void. */
9628 /* In a lambda that has neither a lambda-return-type-clause
9629 nor a deducible form, errors should be reported for return statements
9630 in the body. Since we used void as the placeholder return type, parsing
9631 the body as usual will give such desired behavior. */
9635 {
9639 /* Parse tentatively in case there's more after the initial return
9640 statement. */
9651 {
9655 /* Will get error here if type not deduced yet. */
9659 }
9660 }
9663 {
9668 }
9672 out:
9676 /* Finish the function and generate code for it if necessary. */
9679 /* Only expand if the call op is not a template. */
9682 }
9687 else
9689 }
9691 /* Statements [gram.stmt.stmt] */
9693 /* Parse a statement.
9695 statement:
9696 labeled-statement
9697 expression-statement
9698 compound-statement
9699 selection-statement
9700 iteration-statement
9701 jump-statement
9702 declaration-statement
9703 try-block
9705 C++11:
9707 statement:
9708 labeled-statement
9709 attribute-specifier-seq (opt) expression-statement
9710 attribute-specifier-seq (opt) compound-statement
9711 attribute-specifier-seq (opt) selection-statement
9712 attribute-specifier-seq (opt) iteration-statement
9713 attribute-specifier-seq (opt) jump-statement
9714 declaration-statement
9715 attribute-specifier-seq (opt) try-block
9717 TM Extension:
9719 statement:
9720 atomic-statement
9722 IN_COMPOUND is true when the statement is nested inside a
9723 cp_parser_compound_statement; this matters for certain pragmas.
9725 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9726 is a (possibly labeled) if statement which is not enclosed in braces
9727 and has an else clause. This is used to implement -Wparentheses. */
9729 static void
9732 {
9737 restart:
9740 /* There is no statement yet. */
9746 /* In obj-c++, seeing '[[' might be the either the beginning of
9747 c++11 attributes, or a nested objc-message-expression. So
9748 let's parse the c++11 attributes tentatively. */
9752 {
9755 }
9757 /* Peek at the next token. */
9759 /* Remember the location of the first token in the statement. */
9761 /* If this is a keyword, then that will often determine what kind of
9762 statement we have. */
9764 {
9768 {
9771 /* Looks like a labeled-statement with a case label.
9772 Parse the label, and then use tail recursion to parse
9773 the statement. */
9790 {
9795 }
9796 else
9810 {
9815 }
9816 else
9817 {
9821 }
9825 /* Objective-C++ exception-handling constructs. */
9839 /* This must be a namespace alias definition. */
9852 /* It might be a keyword like `int' that can start a
9853 declaration-statement. */
9855 }
9856 }
9858 {
9859 /* If the next token is a `:', then we are looking at a
9860 labeled-statement. */
9863 {
9864 /* Looks like a labeled-statement with an ordinary label.
9865 Parse the label, and then use tail recursion to parse
9866 the statement. */
9870 }
9871 }
9872 /* Anything that starts with a `{' must be a compound-statement. */
9875 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9876 a statement all its own. */
9878 {
9879 /* Only certain OpenMP pragmas are attached to statements, and thus
9880 are considered statements themselves. All others are not. In
9881 the context of a compound, accept the pragma as a "statement" and
9882 return so that we can check for a close brace. Otherwise we
9883 require a real statement and must go back and read one. */
9889 }
9891 {
9894 }
9896 /* Everything else must be a declaration-statement or an
9897 expression-statement. Try for the declaration-statement
9898 first, unless we are looking at a `;', in which case we know that
9899 we have an expression-statement. */
9901 {
9903 {
9905 {
9906 /* Attributes should be parsed as part of the the
9907 declaration, so let's un-parse them. */
9910 }
9913 /* Try to parse the declaration-statement. */
9915 /* If that worked, we're done. */
9918 }
9919 /* Look for an expression-statement instead. */
9921 }
9923 /* Set the line number for the statement. */
9927 /* Note that for now, we don't do anything with c++11 statements
9928 parsed at this level. */
9931 OPT_Wattributes,
9933 }
9935 /* Parse the label for a labeled-statement, i.e.
9937 identifier :
9938 case constant-expression :
9939 default :
9941 GNU Extension:
9942 case constant-expression ... constant-expression : statement
9944 When a label is parsed without errors, the label is added to the
9945 parse tree by the finish_* functions, so this function doesn't
9946 have to return the label. */
9948 static void
9950 {
9955 /* The next token should be an identifier. */
9959 {
9962 }
9966 {
9968 {
9972 /* Consume the `case' token. */
9974 /* Parse the constant-expression. */
9981 {
9982 /* Consume the `...' token. */
9988 /* We don't need to emit warnings here, as the common code
9989 will do this for us. */
9990 }
9991 else
9996 else
9999 expr);
10000 }
10004 /* Consume the `default' token. */
10009 else
10014 /* Anything else must be an ordinary label. */
10017 }
10019 /* Require the `:' token. */
10022 /* An ordinary label may optionally be followed by attributes.
10023 However, this is only permitted if the attributes are then
10024 followed by a semicolon. This is because, for backward
10025 compatibility, when parsing
10026 lab: __attribute__ ((unused)) int i;
10027 we want the attribute to attach to "i", not "lab". */
10030 {
10031 tree attrs;
10038 ;
10039 else
10041 }
10047 }
10049 /* Parse an expression-statement.
10051 expression-statement:
10052 expression [opt] ;
10054 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10055 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10056 indicates whether this expression-statement is part of an
10057 expression statement. */
10059 static tree
10061 {
10065 /* If the next token is a ';', then there is no expression
10066 statement. */
10068 {
10072 {
10075 }
10076 }
10078 /* Give a helpful message for "A<T>::type t;" and the like. */
10081 {
10088 {
10089 /* A::A a; */
10094 }
10095 }
10097 /* Consume the final `;'. */
10102 /* This is the final expression statement of a statement
10103 expression. */
10109 }
10111 /* Parse a compound-statement.
10113 compound-statement:
10114 { statement-seq [opt] }
10116 GNU extension:
10118 compound-statement:
10119 { label-declaration-seq [opt] statement-seq [opt] }
10121 label-declaration-seq:
10122 label-declaration
10123 label-declaration-seq label-declaration
10125 Returns a tree representing the statement. */
10127 static tree
10130 {
10131 tree compound_stmt;
10133 /* Consume the `{'. */
10140 /* Begin the compound-statement. */
10142 /* If the next keyword is `__label__' we have a label declaration. */
10145 /* Parse an (optional) statement-seq. */
10147 /* Finish the compound-statement. */
10149 /* Consume the `}'. */
10153 }
10155 /* Parse an (optional) statement-seq.
10157 statement-seq:
10158 statement
10159 statement-seq [opt] statement */
10161 static void
10163 {
10164 /* Scan statements until there aren't any more. */
10166 {
10169 /* If we are looking at a `}', then we have run out of
10170 statements; the same is true if we have reached the end
10171 of file, or have stumbled upon a stray '@end'. */
10178 /* If we are in a compound statement and find 'else' then
10179 something went wrong. */
10181 {
10184 else
10185 {
10188 }
10189 }
10191 /* Parse the statement. */
10193 }
10194 }
10196 /* Parse a selection-statement.
10198 selection-statement:
10199 if ( condition ) statement
10200 if ( condition ) statement else statement
10201 switch ( condition ) statement
10203 Returns the new IF_STMT or SWITCH_STMT.
10205 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10206 is a (possibly labeled) if statement which is not enclosed in
10207 braces and has an else clause. This is used to implement
10208 -Wparentheses. */
10210 static tree
10212 {
10219 /* Peek at the next token. */
10222 /* See what kind of keyword it is. */
10225 {
10228 {
10229 tree statement;
10230 tree condition;
10232 /* Look for the `('. */
10234 {
10237 }
10239 /* Begin the selection-statement. */
10242 else
10245 /* Parse the condition. */
10247 /* Look for the `)'. */
10253 {
10257 /* Add the condition. */
10260 /* Parse the then-clause. */
10264 {
10272 }
10273 else
10279 /* If the next token is `else', parse the else-clause. */
10281 RID_ELSE))
10282 {
10283 /* Consume the `else' keyword. */
10286 /* Parse the else-clause. */
10288 {
10289 location_t loc;
10296 }
10297 else
10302 /* If we are currently parsing a then-clause, then
10303 IF_P will not be NULL. We set it to true to
10304 indicate that this if statement has an else clause.
10305 This may trigger the Wparentheses warning below
10306 when we get back up to the parent if statement. */
10309 }
10310 else
10311 {
10312 /* This if statement does not have an else clause. If
10313 NESTED_IF is true, then the then-clause is an if
10314 statement which does have an else clause. We warn
10315 about the potential ambiguity. */
10318 "suggest explicit braces to avoid ambiguous"
10320 }
10322 /* Now we're all done with the if-statement. */
10324 }
10325 else
10326 {
10330 /* Add the condition. */
10333 /* Parse the body of the switch-statement. */
10342 /* Now we're all done with the switch-statement. */
10344 }
10347 }
10353 }
10354 }
10356 /* Parse a condition.
10358 condition:
10359 expression
10360 type-specifier-seq declarator = initializer-clause
10361 type-specifier-seq declarator braced-init-list
10363 GNU Extension:
10365 condition:
10366 type-specifier-seq declarator asm-specification [opt]
10367 attributes [opt] = assignment-expression
10369 Returns the expression that should be tested. */
10371 static tree
10373 {
10374 cp_decl_specifier_seq type_specifiers;
10378 /* Try the declaration first. */
10380 /* New types are not allowed in the type-specifier-seq for a
10381 condition. */
10383 parser->type_definition_forbidden_message
10385 /* Parse the type-specifier-seq. */
10387 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10390 /* Restore the saved message. */
10392 /* If all is well, we might be looking at a declaration. */
10394 {
10395 tree decl;
10396 tree asm_specification;
10397 tree attributes;
10401 /* Parse the declarator. */
10407 /* Parse the attributes. */
10409 /* Parse the asm-specification. */
10411 /* If the next token is not an `=' or '{', then we might still be
10412 looking at an expression. For example:
10414 if (A(a).x)
10416 looks like a decl-specifier-seq and a declarator -- but then
10417 there is no `=', so this is an expression. */
10422 /* If we did see an `=' or '{', then we are looking at a declaration
10423 for sure. */
10425 {
10426 tree pushed_scope;
10430 /* Create the declaration. */
10436 /* Parse the initializer. */
10438 {
10442 }
10443 else
10444 {
10445 /* Consume the `='. */
10448 }
10452 /* Process the initializer. */
10455 asm_specification,
10456 flags);
10462 }
10463 }
10464 /* If we didn't even get past the declarator successfully, we are
10465 definitely not looking at a declaration. */
10466 else
10469 /* Otherwise, we are looking at an expression. */
10471 }
10473 /* Parses a for-statement or range-for-statement until the closing ')',
10474 not included. */
10476 static tree
10478 {
10482 /* Begin the for-statement. */
10485 /* Parse the initialization. */
10490 else
10492 }
10494 static tree
10496 {
10497 /* Normal for loop */
10500 tree stmt;
10503 /* The for-init-statement has already been parsed in
10504 cp_parser_for_init_statement, so no work is needed here. */
10507 /* If there's a condition, process it. */
10511 {
10515 }
10517 /* Look for the `;'. */
10520 /* If there's an expression, process it. */
10526 }
10528 /* Tries to parse a range-based for-statement:
10530 range-based-for:
10531 decl-specifier-seq declarator : expression
10533 The decl-specifier-seq declarator and the `:' are already parsed by
10534 cp_parser_for_init_statement. If processing_template_decl it returns a
10535 newly created RANGE_FOR_STMT; if not, it is converted to a
10536 regular FOR_STMT. */
10538 static tree
10541 {
10545 {
10548 }
10549 else
10552 /* If in template, STMT is converted to a normal for-statement
10553 at instantiation. If not, it is done just ahead. */
10555 {
10563 /* do_auto_deduction doesn't mess with template init-lists. */
10566 }
10567 else
10568 {
10571 }
10573 }
10575 /* Subroutine of cp_convert_range_for: given the initializer expression,
10576 builds up the range temporary. */
10578 static tree
10580 {
10583 /* Find out the type deduced by the declaration
10584 `auto &&__range = range_expr'. */
10589 /* Create the __range variable. */
10596 }
10598 /* Used by cp_parser_range_for in template context: we aren't going to
10599 do a full conversion yet, but we still need to resolve auto in the
10600 type of the for-range-declaration if present. This is basically
10601 a shortcut version of cp_convert_range_for. */
10603 static void
10605 {
10608 {
10611 iter_type = (cp_parser_perform_range_for_lookup
10614 {
10616 iter_type);
10618 tf_warning_or_error);
10621 }
10622 }
10623 }
10625 /* Converts a range-based for-statement into a normal
10626 for-statement, as per the definition.
10628 for (RANGE_DECL : RANGE_EXPR)
10629 BLOCK
10631 should be equivalent to:
10633 {
10634 auto &&__range = RANGE_EXPR;
10635 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10636 __begin != __end;
10637 ++__begin)
10638 {
10639 RANGE_DECL = *__begin;
10640 BLOCK
10641 }
10642 }
10644 If RANGE_EXPR is an array:
10645 BEGIN_EXPR = __range
10646 END_EXPR = __range + ARRAY_SIZE(__range)
10647 Else if RANGE_EXPR has a member 'begin' or 'end':
10648 BEGIN_EXPR = __range.begin()
10649 END_EXPR = __range.end()
10650 Else:
10651 BEGIN_EXPR = begin(__range)
10652 END_EXPR = end(__range);
10654 If __range has a member 'begin' but not 'end', or vice versa, we must
10655 still use the second alternative (it will surely fail, however).
10656 When calling begin()/end() in the third alternative we must use
10657 argument dependent lookup, but always considering 'std' as an associated
10658 namespace. */
10660 tree
10663 {
10669 /* If an error happened previously do nothing or else a lot of
10670 unhelpful errors would be issued. */
10672 else
10673 {
10674 tree range_temp;
10678 /* Can't bind a reference to an array of runtime bound. */
10680 else
10681 {
10686 LOOKUP_ONLYCONVERTING);
10688 }
10691 }
10693 /* The new for initialization statement. */
10701 LOOKUP_ONLYCONVERTING);
10710 LOOKUP_ONLYCONVERTING);
10714 /* The new for condition. */
10721 /* The new increment expression. */
10724 tf_warning_or_error);
10727 /* The declaration is initialized with *__begin inside the loop body. */
10730 tf_warning_or_error),
10732 LOOKUP_ONLYCONVERTING);
10735 }
10737 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10738 We need to solve both at the same time because the method used
10739 depends on the existence of members begin or end.
10740 Returns the type deduced for the iterator expression. */
10742 static tree
10744 {
10746 {
10749 }
10752 {
10757 }
10759 {
10760 /* If RANGE is an array, we will use pointer arithmetic. */
10763 range,
10767 }
10768 else
10769 {
10770 /* If it is not an array, we must do a bit of magic. */
10780 tf_warning_or_error);
10783 tf_warning_or_error);
10786 {
10787 /* Use the member functions. */
10790 else
10796 else
10799 }
10800 else
10801 {
10802 /* Use global functions with ADL. */
10809 tf_warning_or_error);
10811 tf_warning_or_error);
10813 tf_warning_or_error);
10815 tf_warning_or_error);
10818 }
10820 /* Last common checks. */
10822 {
10823 /* If one of the expressions is an error do no more checks. */
10826 }
10829 /* Can happen, when, eg, in a template context, Koenig lookup
10830 can't resolve begin/end (c++/58503). */
10832 else
10833 {
10835 /* The unqualified type of the __begin and __end temporaries should
10836 be the same, as required by the multiple auto declaration. */
10842 }
10843 }
10844 }
10846 /* Helper function for cp_parser_perform_range_for_lookup.
10847 Builds a tree for RANGE.IDENTIFIER(). */
10849 static tree
10851 {
10864 tf_warning_or_error);
10867 }
10869 /* Parse an iteration-statement.
10871 iteration-statement:
10872 while ( condition ) statement
10873 do statement while ( expression ) ;
10874 for ( for-init-statement condition [opt] ; expression [opt] )
10875 statement
10877 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10879 static tree
10881 {
10884 tree statement;
10887 /* Peek at the next token. */
10892 /* Remember whether or not we are already within an iteration
10893 statement. */
10896 /* See what kind of keyword it is. */
10899 {
10901 {
10902 tree condition;
10904 /* Begin the while-statement. */
10906 /* Look for the `('. */
10908 /* Parse the condition. */
10911 /* Look for the `)'. */
10913 /* Parse the dependent statement. */
10917 /* We're done with the while-statement. */
10919 }
10923 {
10924 tree expression;
10926 /* Begin the do-statement. */
10928 /* Parse the body of the do-statement. */
10933 /* Look for the `while' keyword. */
10935 /* Look for the `('. */
10937 /* Parse the expression. */
10939 /* We're done with the do-statement. */
10941 /* Look for the `)'. */
10943 /* Look for the `;'. */
10945 }
10949 {
10950 /* Look for the `('. */
10955 /* Look for the `)'. */
10958 /* Parse the body of the for-statement. */
10963 /* We're done with the for-statement. */
10965 }
10972 }
10975 }
10977 /* Parse a for-init-statement or the declarator of a range-based-for.
10978 Returns true if a range-based-for declaration is seen.
10980 for-init-statement:
10981 expression-statement
10982 simple-declaration */
10984 static bool
10986 {
10987 /* If the next token is a `;', then we have an empty
10988 expression-statement. Grammatically, this is also a
10989 simple-declaration, but an invalid one, because it does not
10990 declare anything. Therefore, if we did not handle this case
10991 specially, we would issue an error message about an invalid
10992 declaration. */
10994 {
11000 {
11001 /* N3994 -- for (id : init) ... */
11004 "type-specifier only available with "
11012 }
11014 /* A colon is used in range-based for. */
11017 /* We're going to speculatively look for a declaration, falling back
11018 to an expression, if necessary. */
11020 /* Parse the declaration. */
11023 decl);
11026 {
11027 /* It is a range-for, consume the ':' */
11031 {
11033 "range-based %<for%> loops only available with "
11036 }
11037 }
11038 else
11039 /* The ';' is not consumed yet because we told
11040 cp_parser_simple_declaration not to. */
11045 /* If the tentative parse failed, then we shall need to look for an
11046 expression-statement. */
11047 }
11048 /* If we are here, it is an expression-statement. */
11051 }
11053 /* Parse a jump-statement.
11055 jump-statement:
11056 break ;
11057 continue ;
11058 return expression [opt] ;
11059 return braced-init-list ;
11060 goto identifier ;
11062 GNU extension:
11064 jump-statement:
11065 goto * expression ;
11067 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11069 static tree
11071 {
11077 /* Peek at the next token. */
11082 /* See what kind of keyword it is. */
11085 {
11089 {
11109 }
11115 {
11122 /* Fall through. */
11132 }
11137 {
11138 tree expr;
11142 {
11146 }
11149 else
11150 /* If the next token is a `;', then there is no
11151 expression. */
11153 /* Build the return-statement. */
11155 /* Look for the final `;'. */
11157 }
11163 {
11166 }
11168 /* Create the goto-statement. */
11170 {
11171 /* Issue a warning about this use of a GNU extension. */
11173 /* Consume the '*' token. */
11175 /* Parse the dependent expression. */
11177 }
11178 else
11180 /* Look for the final `;'. */
11187 }
11190 }
11192 /* Parse a declaration-statement.
11194 declaration-statement:
11195 block-declaration */
11197 static void
11199 {
11202 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11205 /* Parse the block-declaration. */
11208 /* Free any declarators allocated. */
11210 }
11212 /* Some dependent statements (like `if (cond) statement'), are
11213 implicitly in their own scope. In other words, if the statement is
11214 a single statement (as opposed to a compound-statement), it is
11215 none-the-less treated as if it were enclosed in braces. Any
11216 declarations appearing in the dependent statement are out of scope
11217 after control passes that point. This function parses a statement,
11218 but ensures that is in its own scope, even if it is not a
11219 compound-statement.
11221 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11222 is a (possibly labeled) if statement which is not enclosed in
11223 braces and has an else clause. This is used to implement
11224 -Wparentheses.
11226 Returns the new statement. */
11228 static tree
11230 {
11231 tree statement;
11236 /* Mark if () ; with a special NOP_EXPR. */
11238 {
11242 }
11243 /* if a compound is opened, we simply parse the statement directly. */
11246 /* If the token is not a `{', then we must take special action. */
11247 else
11248 {
11249 /* Create a compound-statement. */
11251 /* Parse the dependent-statement. */
11253 /* Finish the dummy compound-statement. */
11255 }
11257 /* Return the statement. */
11259 }
11261 /* For some dependent statements (like `while (cond) statement'), we
11262 have already created a scope. Therefore, even if the dependent
11263 statement is a compound-statement, we do not want to create another
11264 scope. */
11266 static void
11268 {
11269 /* If the token is a `{', then we must take special action. */
11272 else
11273 {
11274 /* Avoid calling cp_parser_compound_statement, so that we
11275 don't create a new scope. Do everything else by hand. */
11277 /* If the next keyword is `__label__' we have a label declaration. */
11280 /* Parse an (optional) statement-seq. */
11283 }
11284 }
11286 /* Declarations [gram.dcl.dcl] */
11288 /* Parse an optional declaration-sequence.
11290 declaration-seq:
11291 declaration
11292 declaration-seq declaration */
11294 static void
11296 {
11298 {
11309 {
11310 /* A declaration consisting of a single semicolon is
11311 invalid. Allow it unless we're being pedantic. */
11316 }
11318 /* If we're entering or exiting a region that's implicitly
11319 extern "C", modify the lang context appropriately. */
11321 {
11324 }
11326 {
11329 }
11332 {
11333 /* A top-level declaration can consist solely of a #pragma.
11334 A nested declaration cannot, so this is done here and not
11335 in cp_parser_declaration. (A #pragma at block scope is
11336 handled in cp_parser_statement.) */
11339 }
11341 /* Parse the declaration itself. */
11343 }
11344 }
11346 /* Parse a declaration.
11348 declaration:
11349 block-declaration
11350 function-definition
11351 template-declaration
11352 explicit-instantiation
11353 explicit-specialization
11354 linkage-specification
11355 namespace-definition
11357 GNU extension:
11359 declaration:
11360 __extension__ declaration */
11362 static void
11364 {
11365 cp_token token1;
11366 cp_token token2;
11371 /* Check for the `__extension__' keyword. */
11373 {
11374 /* Parse the qualified declaration. */
11376 /* Restore the PEDANTIC flag. */
11380 }
11382 /* Try to figure out what kind of declaration is present. */
11387 else
11388 {
11391 }
11393 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11396 /* If the next token is `extern' and the following token is a string
11397 literal, then we have a linkage specification. */
11401 /* If the next token is `template', then we have either a template
11402 declaration, an explicit instantiation, or an explicit
11403 specialization. */
11405 {
11406 /* `template <>' indicates a template specialization. */
11410 /* `template <' indicates a template declaration. */
11413 /* Anything else must be an explicit instantiation. */
11414 else
11416 }
11417 /* If the next token is `export', then we have a template
11418 declaration. */
11421 /* If the next token is `extern', 'static' or 'inline' and the one
11422 after that is `template', we have a GNU extended explicit
11423 instantiation directive. */
11430 /* If the next token is `namespace', check for a named or unnamed
11431 namespace definition. */
11437 /* An unnamed namespace definition. */
11441 /* An inline (associated) namespace definition. */
11445 /* Objective-C++ declaration/definition. */
11452 /* We must have either a block declaration or a function
11453 definition. */
11454 else
11455 {
11456 /* At this point we may have a template declared by a concept
11457 introduction. */
11462 /* Try to parse a block-declaration, or a function-definition. */
11464 }
11466 /* Free any declarators allocated. */
11468 }
11470 /* Parse a block-declaration.
11472 block-declaration:
11473 simple-declaration
11474 asm-definition
11475 namespace-alias-definition
11476 using-declaration
11477 using-directive
11479 GNU Extension:
11481 block-declaration:
11482 __extension__ block-declaration
11484 C++0x Extension:
11486 block-declaration:
11487 static_assert-declaration
11489 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11490 part of a declaration-statement. */
11492 static void
11495 {
11499 /* Check for the `__extension__' keyword. */
11501 {
11502 /* Parse the qualified declaration. */
11504 /* Restore the PEDANTIC flag. */
11508 }
11510 /* Peek at the next token to figure out which kind of declaration is
11511 present. */
11514 /* If the next keyword is `asm', we have an asm-definition. */
11516 {
11520 }
11521 /* If the next keyword is `namespace', we have a
11522 namespace-alias-definition. */
11525 /* If the next keyword is `using', we have a
11526 using-declaration, a using-directive, or an alias-declaration. */
11528 {
11533 /* If the token after `using' is `namespace', then we have a
11534 using-directive. */
11538 /* If the second token after 'using' is '=', then we have an
11539 alias-declaration. */
11545 /* Otherwise, it's a using-declaration. */
11546 else
11549 }
11550 /* If the next keyword is `__label__' we have a misplaced label
11551 declaration. */
11553 {
11557 /* If the next token is now a `;', consume it. */
11560 }
11561 /* If the next token is `static_assert' we have a static assertion. */
11564 /* Anything else must be a simple-declaration. */
11565 else
11568 }
11570 /* Parse a simple-declaration.
11572 simple-declaration:
11573 decl-specifier-seq [opt] init-declarator-list [opt] ;
11575 init-declarator-list:
11576 init-declarator
11577 init-declarator-list , init-declarator
11579 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11580 function-definition as a simple-declaration.
11582 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11583 parsed declaration if it is an uninitialized single declarator not followed
11584 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11585 if present, will not be consumed. */
11587 static void
11591 {
11592 cp_decl_specifier_seq decl_specifiers;
11601 /* Defer access checks until we know what is being declared; the
11602 checks for names appearing in the decl-specifier-seq should be
11603 done as if we were in the scope of the thing being declared. */
11606 /* Parse the decl-specifier-seq. We have to keep track of whether
11607 or not the decl-specifier-seq declares a named class or
11608 enumeration type, since that is the only case in which the
11609 init-declarator-list is allowed to be empty.
11611 [dcl.dcl]
11613 In a simple-declaration, the optional init-declarator-list can be
11614 omitted only when declaring a class or enumeration, that is when
11615 the decl-specifier-seq contains either a class-specifier, an
11616 elaborated-type-specifier, or an enum-specifier. */
11618 CP_PARSER_FLAGS_OPTIONAL,
11621 /* We no longer need to defer access checks. */
11624 /* In a block scope, a valid declaration must always have a
11625 decl-specifier-seq. By not trying to parse declarators, we can
11626 resolve the declaration/expression ambiguity more quickly. */
11629 {
11632 }
11634 /* If the next two tokens are both identifiers, the code is
11635 erroneous. The usual cause of this situation is code like:
11637 T t;
11639 where "T" should name a type -- but does not. */
11642 {
11643 /* If parsing tentatively, we should commit; we really are
11644 looking at a declaration. */
11646 /* Give up. */
11648 }
11650 /* If we have seen at least one decl-specifier, and the next token
11651 is not a parenthesis, then we must be looking at a declaration.
11652 (After "int (" we might be looking at a functional cast.) */
11659 /* Keep going until we hit the `;' at the end of the simple
11660 declaration. */
11663 CPP_SEMICOLON))
11664 {
11667 tree decl;
11670 {
11671 /* If we are processing next declarator, comma is expected */
11676 {
11680 }
11681 }
11682 else
11685 /* Parse the init-declarator. */
11688 function_definition_allowed_p,
11690 declares_class_or_enum,
11692 maybe_range_for_decl,
11694 /* If an error occurred while parsing tentatively, exit quickly.
11695 (That usually happens when in the body of a function; each
11696 statement is treated as a declaration-statement until proven
11697 otherwise.) */
11700 /* Handle function definitions specially. */
11702 {
11703 /* If the next token is a `,', then we are probably
11704 processing something like:
11706 void f() {}, *p;
11708 which is erroneous. */
11710 {
11713 "mixing"
11715 }
11716 /* Otherwise, we're done with the list of declarators. */
11717 else
11718 {
11721 }
11722 }
11725 /* The next token should be either a `,' or a `;'. */
11727 /* If it's a `,', there are more declarators to come. */
11730 /* If it's a `;', we are done. */
11733 /* Anything else is an error. */
11734 else
11735 {
11736 /* If we have already issued an error message we don't need
11737 to issue another one. */
11741 /* Skip tokens until we reach the end of the statement. */
11743 /* If the next token is now a `;', consume it. */
11747 }
11748 /* After the first time around, a function-definition is not
11749 allowed -- even if it was OK at first. For example:
11751 int i, f() {}
11753 is not valid. */
11755 }
11757 /* Issue an error message if no declarators are present, and the
11758 decl-specifier-seq does not itself declare a class or
11759 enumeration: [dcl.dcl]/3. */
11761 {
11763 {
11767 /* Ensure an error is issued anyway when finish_decltype_type,
11768 called via cp_parser_decl_specifier_seq, returns a class or
11769 an enumeration (c++/51786). */
11772 }
11773 /* Perform any deferred access checks. */
11775 }
11777 /* Consume the `;'. */
11781 {
11787 }
11789 done:
11791 }
11793 /* Parse a decl-specifier-seq.
11795 decl-specifier-seq:
11796 decl-specifier-seq [opt] decl-specifier
11797 decl-specifier attribute-specifier-seq [opt] (C++11)
11799 decl-specifier:
11800 storage-class-specifier
11801 type-specifier
11802 function-specifier
11803 friend
11804 typedef
11806 GNU Extension:
11808 decl-specifier:
11809 attributes
11811 Concepts Extension:
11813 decl-specifier:
11814 concept
11817 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11819 The parser flags FLAGS is used to control type-specifier parsing.
11821 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11822 flags:
11824 1: one of the decl-specifiers is an elaborated-type-specifier
11825 (i.e., a type declaration)
11826 2: one of the decl-specifiers is an enum-specifier or a
11827 class-specifier (i.e., a type definition)
11829 */
11831 static void
11833 cp_parser_flags flags,
11836 {
11840 cp_decl_spec ds;
11842 /* Clear DECL_SPECS. */
11845 /* Assume no class or enumeration type is declared. */
11848 /* Keep reading specifiers until there are no more to read. */
11850 {
11855 /* Peek at the next token. */
11858 /* Save the first token of the decl spec list for error
11859 reporting. */
11862 /* Handle attributes. */
11864 {
11865 /* Parse the attributes. */
11868 /* In a sequence of declaration specifiers, c++11 attributes
11869 appertain to the type that precede them. In that case
11870 [dcl.spec]/1 says:
11872 The attribute-specifier-seq affects the type only for
11873 the declaration it appears in, not other declarations
11874 involving the same type.
11876 But for now let's force the user to position the
11877 attribute either at the beginning of the declaration or
11878 after the declarator-id, which would clearly mean that it
11879 applies to the declarator. */
11881 {
11883 /* The c++11 attribute is at the beginning of the
11884 declaration. It appertains to the entity being
11886 else
11887 {
11889 {
11890 /* This is an attribute following a
11891 class-specifier. */
11896 }
11897 else
11898 {
11899 decl_specs->std_attributes
11901 attrs);
11904 }
11906 }
11907 }
11909 decl_specs->attributes
11911 attrs);
11915 }
11916 /* Assume we will find a decl-specifier keyword. */
11918 /* If the next token is an appropriate keyword, we can simply
11919 add it to the list. */
11921 {
11922 /* decl-specifier:
11923 friend
11924 constexpr */
11927 {
11930 }
11931 else
11932 {
11934 /* Consume the token. */
11936 }
11949 /* function-specifier:
11950 inline
11951 virtual
11952 explicit */
11959 /* decl-specifier:
11960 typedef */
11963 /* Consume the token. */
11965 /* A constructor declarator cannot appear in a typedef. */
11967 /* The "typedef" keyword can only occur in a declaration; we
11968 may as well commit at this point. */
11975 /* storage-class-specifier:
11976 auto
11977 register
11978 static
11979 extern
11980 mutable
11982 GNU Extension:
11983 thread */
11986 {
11987 /* Consume the token. */
11990 /* Complain about `auto' as a storage specifier, if
11991 we're complaining about C++0x compatibility. */
11995 /* Set the storage class anyway. */
11997 token);
11998 }
11999 else
12000 /* C++0x auto type-specifier. */
12008 /* Consume the token. */
12011 token);
12014 /* Consume the token. */
12020 /* We did not yet find a decl-specifier yet. */
12023 }
12033 /* Constructors are a special case. The `S' in `S()' is not a
12034 decl-specifier; it is the beginning of the declarator. */
12035 constructor_p
12036 = (!found_decl_spec
12037 && constructor_possible_p
12038 && (cp_parser_constructor_declarator_p
12041 /* If we don't have a DECL_SPEC yet, then we must be looking at
12042 a type-specifier. */
12044 {
12047 tree type_spec;
12049 type_spec
12051 decl_specs,
12057 /* If this type-specifier referenced a user-defined type
12058 (a typedef, class-name, etc.), then we can't allow any
12059 more such type-specifiers henceforth.
12061 [dcl.spec]
12063 The longest sequence of decl-specifiers that could
12064 possibly be a type name is taken as the
12065 decl-specifier-seq of a declaration. The sequence shall
12066 be self-consistent as described below.
12068 [dcl.type]
12070 As a general rule, at most one type-specifier is allowed
12071 in the complete decl-specifier-seq of a declaration. The
12072 only exceptions are the following:
12074 -- const or volatile can be combined with any other
12075 type-specifier.
12077 -- signed or unsigned can be combined with char, long,
12078 short, or int.
12080 -- ..
12082 Example:
12084 typedef char* Pc;
12085 void g (const int Pc);
12087 Here, Pc is *not* part of the decl-specifier seq; it's
12088 the declarator. Therefore, once we see a type-specifier
12089 (other than a cv-qualifier), we forbid any additional
12090 user-defined types. We *do* still allow things like `int
12091 int' to be considered a decl-specifier-seq, and issue the
12092 error message later. */
12095 /* A constructor declarator cannot follow a type-specifier. */
12097 {
12102 }
12103 }
12105 /* If we still do not have a DECL_SPEC, then there are no more
12106 decl-specifiers. */
12111 /* After we see one decl-specifier, further decl-specifiers are
12112 always optional. */
12114 }
12116 /* Don't allow a friend specifier with a class definition. */
12121 }
12123 /* Parse an (optional) storage-class-specifier.
12125 storage-class-specifier:
12126 auto
12127 register
12128 static
12129 extern
12130 mutable
12132 GNU Extension:
12134 storage-class-specifier:
12135 thread
12137 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12139 static tree
12141 {
12143 {
12147 /* Fall through for C++98. */
12154 /* Consume the token. */
12159 }
12160 }
12162 /* Parse an (optional) function-specifier.
12164 function-specifier:
12165 inline
12166 virtual
12167 explicit
12169 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12170 Updates DECL_SPECS, if it is non-NULL. */
12172 static tree
12175 {
12178 {
12184 /* 14.5.2.3 [temp.mem]
12186 A member function template shall not be virtual. */
12189 else
12199 }
12201 /* Consume the token. */
12203 }
12205 /* Parse a linkage-specification.
12207 linkage-specification:
12208 extern string-literal { declaration-seq [opt] }
12209 extern string-literal declaration */
12211 static void
12213 {
12214 tree linkage;
12216 /* Look for the `extern' keyword. */
12219 /* Look for the string-literal. */
12222 /* Transform the literal into an identifier. If the literal is a
12223 wide-character string, or contains embedded NULs, then we can't
12224 handle it as the user wants. */
12227 {
12229 /* Assume C++ linkage. */
12231 }
12232 else
12235 /* We're now using the new linkage. */
12238 /* If the next token is a `{', then we're using the first
12239 production. */
12241 {
12244 /* Consume the `{' token. */
12246 /* Parse the declarations. */
12248 /* Look for the closing `}'. */
12250 }
12251 /* Otherwise, there's just one declaration. */
12252 else
12253 {
12256 saved_in_unbraced_linkage_specification_p
12260 parser->in_unbraced_linkage_specification_p
12262 }
12264 /* We're done with the linkage-specification. */
12266 }
12268 /* Parse a static_assert-declaration.
12270 static_assert-declaration:
12271 static_assert ( constant-expression , string-literal ) ;
12273 If MEMBER_P, this static_assert is a class member. */
12275 static void
12277 {
12278 tree condition;
12279 tree message;
12281 location_t saved_loc;
12284 /* Peek at the `static_assert' token so we can keep track of exactly
12285 where the static assertion started. */
12289 /* Look for the `static_assert' keyword. */
12291 RT_STATIC_ASSERT))
12294 /* We know we are in a static assertion; commit to any tentative
12295 parse. */
12299 /* Parse the `(' starting the static assertion condition. */
12302 /* Parse the constant-expression. Allow a non-constant expression
12303 here in order to give better diagnostics in finish_static_assert. */
12304 condition =
12309 /* Parse the separating `,'. */
12312 /* Parse the string-literal message. */
12317 /* A `)' completes the static assertion. */
12324 /* A semicolon terminates the declaration. */
12327 /* Complete the static assertion, which may mean either processing
12328 the static assert now or saving it for template instantiation. */
12330 }
12332 /* Parse the expression in decltype ( expression ). */
12334 static tree
12337 {
12339 tree expr;
12341 /* First, try parsing an id-expression. */
12352 {
12355 cp_id_kind idk;
12359 /* Lookup the name we got back from the id-expression. */
12369 {
12370 /* Complete lookup of the id-expression. */
12371 expr = (finish_id_expression
12384 /* We found an id-expression, but it was something that we
12385 should not have found. This is an error, not something
12386 we can recover from, so note that we found an
12387 id-expression and we'll recover as gracefully as
12388 possible. */
12390 }
12395 /* We have an id-expression. */
12397 }
12400 {
12401 /* Abort the id-expression parse. */
12404 /* Parsing tentatively, again. */
12407 /* Parse a class member access. */
12415 /* We have an id-expression. */
12417 }
12420 /* We have parsed the complete id-expression or member access. */
12422 else
12423 {
12424 /* Abort our attempt to parse an id-expression or member access
12425 expression. */
12428 /* Parse a full expression. */
12431 }
12434 }
12436 /* Parse a `decltype' type. Returns the type.
12438 simple-type-specifier:
12439 decltype ( expression )
12440 C++14 proposal:
12441 decltype ( auto ) */
12443 static tree
12445 {
12446 tree expr;
12455 {
12456 /* Already parsed. */
12459 }
12461 /* Look for the `decltype' token. */
12465 /* Parse the opening `('. */
12469 /* decltype (auto) */
12472 {
12479 }
12481 /* Types cannot be defined in a `decltype' expression. Save away the
12482 old message. */
12485 /* And create the new one. */
12486 parser->type_definition_forbidden_message
12489 /* The restrictions on constant-expressions do not apply inside
12490 decltype expressions. */
12491 saved_integral_constant_expression_p
12493 saved_non_integral_constant_expression_p
12497 /* Within a parenthesized expression, a `>' token is always
12498 the greater-than operator. */
12499 saved_greater_than_is_operator_p
12503 /* Do not actually evaluate the expression. */
12506 /* Do not warn about problems with the expression. */
12511 /* Go back to evaluating expressions. */
12515 /* The `>' token might be the end of a template-id or
12516 template-parameter-list now. */
12517 parser->greater_than_is_operator_p
12520 /* Restore the old message and the integral constant expression
12521 flags. */
12523 parser->integral_constant_expression_p
12525 parser->non_integral_constant_expression_p
12528 /* Parse to the closing `)'. */
12530 {
12534 }
12537 tf_warning_or_error);
12539 rewrite:
12540 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12541 it again. */
12548 }
12550 /* Special member functions [gram.special] */
12552 /* Parse a conversion-function-id.
12554 conversion-function-id:
12555 operator conversion-type-id
12557 Returns an IDENTIFIER_NODE representing the operator. */
12559 static tree
12561 {
12562 tree type;
12563 tree saved_scope;
12564 tree saved_qualifying_scope;
12565 tree saved_object_scope;
12568 /* Look for the `operator' token. */
12571 /* When we parse the conversion-type-id, the current scope will be
12572 reset. However, we need that information in able to look up the
12573 conversion function later, so we save it here. */
12577 /* We must enter the scope of the class so that the names of
12578 entities declared within the class are available in the
12579 conversion-type-id. For example, consider:
12581 struct S {
12582 typedef int I;
12583 operator I();
12584 };
12586 S::operator I() { ... }
12588 In order to see that `I' is a type-name in the definition, we
12589 must be in the scope of `S'. */
12592 /* Parse the conversion-type-id. */
12594 /* Leave the scope of the class, if any. */
12597 /* Restore the saved scope. */
12601 /* If the TYPE is invalid, indicate failure. */
12605 }
12607 /* Parse a conversion-type-id:
12609 conversion-type-id:
12610 type-specifier-seq conversion-declarator [opt]
12612 Returns the TYPE specified. */
12614 static tree
12616 {
12617 tree attributes;
12618 cp_decl_specifier_seq type_specifiers;
12620 tree type_specified;
12623 /* Parse the attributes. */
12627 parser->type_definition_forbidden_message
12630 /* Parse the type-specifiers. */
12637 /* If that didn't work, stop. */
12640 /* Parse the conversion-declarator. */
12648 /* Don't give this error when parsing tentatively. This happens to
12649 work because we always parse this definitively once. */
12652 {
12654 {
12657 }
12661 }
12664 }
12666 /* Parse an (optional) conversion-declarator.
12668 conversion-declarator:
12669 ptr-operator conversion-declarator [opt]
12671 */
12675 {
12678 cp_cv_quals cv_quals;
12680 /* We don't know if there's a ptr-operator next, or not. */
12682 /* Try the ptr-operator. */
12685 /* If it worked, look for more conversion-declarators. */
12687 {
12690 /* Parse another optional declarator. */
12693 declarator = cp_parser_make_indirect_declarator
12697 }
12700 }
12702 /* Parse an (optional) ctor-initializer.
12704 ctor-initializer:
12705 : mem-initializer-list
12707 Returns TRUE iff the ctor-initializer was actually present. */
12709 static bool
12711 {
12712 /* If the next token is not a `:', then there is no
12713 ctor-initializer. */
12715 {
12716 /* Do default initialization of any bases and members. */
12721 }
12723 /* Consume the `:' token. */
12725 /* And the mem-initializer-list. */
12729 }
12731 /* Parse a mem-initializer-list.
12733 mem-initializer-list:
12734 mem-initializer ... [opt]
12735 mem-initializer ... [opt] , mem-initializer-list */
12737 static void
12739 {
12744 /* Let the semantic analysis code know that we are starting the
12745 mem-initializer-list. */
12750 /* Loop through the list. */
12752 {
12753 tree mem_initializer;
12756 /* Parse the mem-initializer. */
12758 /* If the next token is a `...', we're expanding member initializers. */
12760 {
12761 /* Consume the `...'. */
12764 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12765 can be expanded but members cannot. */
12768 {
12773 }
12775 /* Construct the pack expansion type. */
12778 }
12781 {
12785 }
12786 /* Look for a target constructor. */
12790 {
12793 {
12797 }
12799 }
12800 /* Add it to the list, unless it was erroneous. */
12802 {
12805 }
12806 /* If the next token is not a `,', we're done. */
12809 /* Consume the `,' token. */
12811 }
12813 /* Perform semantic analysis. */
12816 }
12818 /* Parse a mem-initializer.
12820 mem-initializer:
12821 mem-initializer-id ( expression-list [opt] )
12822 mem-initializer-id braced-init-list
12824 GNU extension:
12826 mem-initializer:
12827 ( expression-list [opt] )
12829 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12830 class) or FIELD_DECL (for a non-static data member) to initialize;
12831 the TREE_VALUE is the expression-list. An empty initialization
12832 list is represented by void_list_node. */
12834 static tree
12836 {
12837 tree mem_initializer_id;
12838 tree expression_list;
12839 tree member;
12842 /* Find out what is being initialized. */
12844 {
12848 }
12849 else
12850 {
12854 }
12860 {
12867 }
12868 else
12869 {
12879 }
12889 }
12891 /* Parse a mem-initializer-id.
12893 mem-initializer-id:
12894 :: [opt] nested-name-specifier [opt] class-name
12895 identifier
12897 Returns a TYPE indicating the class to be initializer for the first
12898 production. Returns an IDENTIFIER_NODE indicating the data member
12899 to be initialized for the second production. */
12901 static tree
12903 {
12907 tree id;
12911 /* `typename' is not allowed in this context ([temp.res]). */
12913 {
12915 "keyword %<typename%> not allowed in this context (a qualified "
12918 }
12919 /* Look for the optional `::' operator. */
12920 global_scope_p
12924 /* Look for the optional nested-name-specifier. The simplest way to
12925 implement:
12927 [temp.res]
12929 The keyword `typename' is not permitted in a base-specifier or
12930 mem-initializer; in these contexts a qualified name that
12931 depends on a template-parameter is implicitly assumed to be a
12932 type name.
12934 is to assume that we have seen the `typename' keyword at this
12935 point. */
12936 nested_name_specifier_p
12945 /* If there is a `::' operator or a nested-name-specifier, then we
12946 are definitely looking for a class-name. */
12951 typename_type,
12955 /* Otherwise, we could also be looking for an ordinary identifier. */
12957 /* Try a class-name. */
12961 none_type,
12965 /* If we found one, we're done. */
12968 /* Otherwise, look for an ordinary identifier. */
12970 }
12972 /* Overloading [gram.over] */
12974 /* Parse an operator-function-id.
12976 operator-function-id:
12977 operator operator
12979 Returns an IDENTIFIER_NODE for the operator which is a
12980 human-readable spelling of the identifier, e.g., `operator +'. */
12982 static tree
12984 {
12985 /* Look for the `operator' keyword. */
12988 /* And then the name of the operator itself. */
12990 }
12992 /* Return an identifier node for a user-defined literal operator.
12993 The suffix identifier is chained to the operator name identifier. */
12995 static tree
12997 {
12998 tree identifier;
13005 }
13007 /* Parse an operator.
13009 operator:
13010 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13011 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13012 || ++ -- , ->* -> () []
13014 GNU Extensions:
13016 operator:
13017 <? >? <?= >?=
13019 Returns an IDENTIFIER_NODE for the operator which is a
13020 human-readable spelling of the identifier, e.g., `operator +'. */
13022 static tree
13024 {
13029 /* Peek at the next token. */
13031 /* Figure out which operator we have. */
13033 {
13035 {
13038 /* The keyword should be either `new' or `delete'. */
13043 else
13046 /* Consume the `new' or `delete' token. */
13049 /* Peek at the next token. */
13051 /* If it's a `[' token then this is the array variant of the
13052 operator. */
13054 {
13055 /* Consume the `[' token. */
13057 /* Look for the `]' token. */
13061 }
13062 /* Otherwise, we have the non-array variant. */
13063 else
13067 }
13214 /* Consume the `('. */
13216 /* Look for the matching `)'. */
13221 /* Consume the `['. */
13223 /* Look for the matching `]'. */
13238 {
13245 /* Consume the string. */
13251 {
13254 }
13255 else
13256 {
13258 /* Look for the suffix identifier. */
13263 {
13267 }
13268 else
13269 {
13272 }
13273 }
13278 {
13281 }
13284 {
13287 }
13289 {
13292 }
13294 }
13297 /* Anything else is an error. */
13299 }
13301 /* If we have selected an identifier, we need to consume the
13302 operator token. */
13305 /* Otherwise, no valid operator name was present. */
13306 else
13307 {
13310 }
13313 }
13315 /* Parse a template-declaration.
13317 template-declaration:
13318 export [opt] template < template-parameter-list > declaration
13320 If MEMBER_P is TRUE, this template-declaration occurs within a
13321 class-specifier.
13323 The grammar rule given by the standard isn't correct. What
13324 is really meant is:
13326 template-declaration:
13327 export [opt] template-parameter-list-seq
13328 decl-specifier-seq [opt] init-declarator [opt] ;
13329 export [opt] template-parameter-list-seq
13330 function-definition
13332 template-parameter-list-seq:
13333 template-parameter-list-seq [opt]
13334 template < template-parameter-list >
13336 Concept Extensions:
13338 template-parameter-list-seq:
13339 template < template-parameter-list > template-requirement [opt]
13341 template-requirement:
13342 requires logical-or-expression
13343 */
13345 static void
13347 {
13348 /* Check for `export'. */
13350 {
13351 /* Consume the `export' token. */
13353 /* Warn that we do not support `export'. */
13355 }
13358 }
13360 /* Parse a template-parameter-list.
13362 template-parameter-list:
13363 template-parameter
13364 template-parameter-list , template-parameter
13366 Returns a TREE_LIST. Each node represents a template parameter.
13367 The nodes are connected via their TREE_CHAINs. */
13369 static tree
13371 {
13376 /* The loop below parses the template parms. We first need to know
13377 the total number of template parms to be able to compute proper
13378 canonical types of each dependent type. So after the loop, when
13379 we know the total number of template parms,
13380 end_template_parm_list computes the proper canonical types and
13381 fixes up the dependent types accordingly. */
13383 {
13384 tree parameter;
13387 location_t parm_loc;
13389 /* Parse the template-parameter. */
13394 /* Add it to the list. */
13397 parm_loc,
13398 parameter,
13399 is_non_type,
13400 is_parameter_pack);
13401 else
13402 {
13405 }
13407 /* If the next token is not a `,', we're done. */
13410 /* Otherwise, consume the `,' token. */
13412 }
13415 }
13417 /* Parse a introduction-list.
13419 introduction-list:
13420 introduced-parameter
13421 introduction-list , introduced-parameter
13423 introduced-parameter:
13424 ...[opt] identifier
13426 Returns a TREE_VEC of INTRODUCED_PARM_DECLs. If the parameter is a pack
13427 then the introduced parm will have INTORDUCED_PACK_P set. In addition, the
13428 INTRODUCED_PARM_DECL will also have DECL_NAME set and token location in
13429 DECL_SOURCE_LOCATION. */
13431 static tree
13433 {
13437 {
13442 // Build placeholder.
13450 // If the next token is not a `,', we're done.
13453 // Otherwise, consume the `,' token.
13455 }
13457 // Convert the vec into a TREE_VEC.
13460 tree parm;
13462 {
13464 }
13468 }
13470 // Given a declarator, get the declarator-id part, or NULL_TREE if this
13471 // is an abstract declarator.
13474 {
13479 }
13481 // Get the unqualified-id from the DECLARATOR or NULL_TREE if this
13482 // is an abstract declarator.
13485 {
13489 else
13491 }
13493 // Returns true if PARM declares a constrained-parameter.
13496 {
13505 }
13508 // Check that the type parameter is only a declarator-id, and that its
13509 // type is not cv-qualified.
13510 bool
13513 {
13518 {
13521 }
13523 // Don't allow cv-qualified type parameters.
13526 {
13529 }
13532 }
13534 // Finish parsing/processing a template type parameter and checking
13535 // various restrictions.
13538 tree id,
13540 {
13543 else
13545 }
13547 // Finish parsing/processing a template template parameter by borrowing
13548 // the template parameter list from the prototype parameter.
13549 static tree
13551 tree proto,
13552 tree id,
13554 {
13558 // FIXME: This should probably be copied, and we may need to adjust
13559 // the template parameter depths.
13569 }
13571 // Create a new non-type template parameter from the given PARM declarator.
13572 static tree
13575 {
13581 }
13583 // Build a constrained template parameter based on the PARMDECL
13584 // declarator. The type of PARMDECL is the constrained type, which
13585 // refers to the prototype template parameter that ultimately
13586 // specifies the type of the declared parameter.
13587 static tree
13592 {
13598 // A template parameter constrained by a variadic concept shall also
13599 // be declared as a template parameter pack.
13604 // Build the parameter. Return an error if the declarator was invalid.
13605 tree parm;
13610 parmdecl);
13611 else
13616 // Finish the parameter decl and create a node attaching the
13617 // default argument and constraint.
13622 }
13624 // Returns the type of the given TYPE may represent the declaration of
13625 // a template type parameter. This is a helper function for the
13626 // cp_declares_type* functions below.
13629 {
13630 return type
13634 }
13636 // Returns true if the parsed type actually represents a type or template
13637 // template parameter.
13640 {
13642 {
13645 }
13647 }
13649 // Returns true if the parsed type actually represents the declaration
13650 // of a type template-parameter.
13653 {
13656 }
13659 // Returns true if the parsed type actually represents the declaration of
13660 // a template template-parameter.
13661 static bool
13663 {
13666 }
13668 // Parse a default argument for a type template-parameter.
13669 //
13670 // Note that diagnostics are handled in cp_parser_template_parameter.
13671 static tree
13673 {
13676 /* Consume the `=' token. */
13679 /* Parse the default-argument. */
13685 }
13687 // Parse a default argument for a template template-parameter.
13688 static tree
13690 {
13695 /* Consume the `='. */
13697 /* Parse the id-expression. */
13699 /* save token before parsing the id-expression, for error
13700 reporting */
13702 tree default_argument
13710 /* If the id-expression was a template-id that refers to
13711 a template-class, we already have the declaration here,
13712 so no further lookup is needed. */
13713 ;
13714 else
13715 /* Look up the name. */
13716 default_argument
13718 none_type,
13724 /* See if the default argument is valid. */
13728 }
13730 /* Parse a template-parameter.
13732 template-parameter:
13733 type-parameter
13734 parameter-declaration
13736 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13737 the parameter. The TREE_PURPOSE is the default value, if any.
13738 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13739 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13740 set to true iff this parameter is a parameter pack. */
13742 static tree
13745 {
13749 tree parm;
13751 /* Assume it is a type parameter or a template parameter. */
13753 /* Assume it not a parameter pack. */
13755 /* Peek at the next token. */
13757 /* If it is `class' or `template', we have a type-parameter. */
13760 /* If it is `class' or `typename' we do not know yet whether it is a
13761 type parameter or a non-type parameter. Consider:
13763 template <typename T, typename T::X X> ...
13765 or:
13767 template <class C, class D*> ...
13769 Here, the first parameter is a type parameter, and the second is
13770 a non-type parameter. We can tell by looking at the token after
13771 the identifier -- if it is a `,', `=', or `>' then we have a type
13772 parameter. */
13774 {
13775 /* Peek at the token after `class' or `typename'. */
13777 /* If it's an ellipsis, we have a template type parameter
13778 pack. */
13781 /* If it's an identifier, skip it. */
13784 /* Now, see if the token looks like the end of a template
13785 parameter. */
13790 }
13792 /* Otherwise, it is a non-type parameter or a constrained parameter.
13794 [temp.param]
13796 When parsing a default template-argument for a non-type
13797 template-parameter, the first non-nested `>' is taken as the end
13798 of the template parameter-list rather than a greater-than
13799 operator. */
13800 parameter_declarator
13807 /* If the parameter declaration is marked as a parameter pack, set
13808 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13809 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13810 grokdeclarator. */
13813 {
13816 }
13820 {
13821 /* Can happen in some cases of erroneous input (c++/34892). */
13823 /* Consume the `...' for better error recovery. */
13825 }
13826 /* If the next token is an ellipsis, and we don't already have it
13827 marked as a parameter pack, then we have a parameter pack (that
13828 has no declarator). */
13831 && (declarator_can_be_parameter_pack
13833 {
13834 /* Consume the `...'. */
13839 }
13840 /* We might end up with a pack expansion as the type of the non-type
13841 template parameter, in which case this is a non-type template
13842 parameter pack. */
13844 {
13848 }
13851 {
13852 /* Parameter packs cannot have default arguments. However, a
13853 user may try to do so, so we'll parse them and give an
13854 appropriate diagnostic here. */
13858 /* Find the name of the parameter pack. */
13867 else
13871 /* Parse the default argument, but throw away the result. */
13876 else
13878 }
13880 // The parameter may have been constrained.
13883 parameter_declarator,
13884 is_non_type,
13885 is_parameter_pack);
13887 // Now we're sure that the parameter is a non-type parameter.
13898 }
13900 /* Parse a type-parameter.
13902 type-parameter:
13903 class identifier [opt]
13904 class identifier [opt] = type-id
13905 typename identifier [opt]
13906 typename identifier [opt] = type-id
13907 template < template-parameter-list > class identifier [opt]
13908 template < template-parameter-list > class identifier [opt]
13909 = id-expression
13911 GNU Extension (variadic templates):
13913 type-parameter:
13914 class ... identifier [opt]
13915 typename ... identifier [opt]
13917 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13918 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13919 the declaration of the parameter.
13921 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13923 static tree
13925 {
13927 tree parameter;
13929 /* Look for a keyword to tell us what kind of parameter this is. */
13935 {
13938 {
13939 tree identifier;
13940 tree default_argument;
13942 /* If the next token is an ellipsis, we have a template
13943 argument pack. */
13945 {
13946 /* Consume the `...' token. */
13951 }
13953 /* If the next token is an identifier, then it names the
13954 parameter. */
13957 else
13960 /* Create the parameter. */
13963 /* If the next token is an `=', we have a default argument. */
13965 {
13966 default_argument
13969 /* Template parameter packs cannot have default
13970 arguments. */
13972 {
13975 "template parameter pack %qD cannot have a "
13977 else
13979 "template parameter packs cannot have "
13982 }
13986 /* ANS: FIXME: This appears to be a stray pop. Check again once
13987 concept introdutions have been disabled. */
13988 // pop_deferring_access_checks ();
13989 }
13990 else
13993 /* Create the combined representation of the parameter and the
13994 default argument. */
13996 }
14000 {
14001 tree identifier;
14002 tree default_argument;
14004 /* Look for the `<'. */
14006 /* Parse the template-parameter-list. */
14008 /* Look for the `>'. */
14011 // If template requirements are present, parse them.
14013 {
14018 }
14020 /* Look for the `class' or 'typename' keywords. */
14022 /* If the next token is an ellipsis, we have a template
14023 argument pack. */
14025 {
14026 /* Consume the `...' token. */
14031 }
14032 /* If the next token is an `=', then there is a
14033 default-argument. If the next token is a `>', we are at
14034 the end of the parameter-list. If the next token is a `,',
14035 then we are at the end of this parameter. */
14039 {
14041 /* Treat invalid names as if the parameter were nameless. */
14044 }
14045 else
14048 /* Create the template parameter. */
14050 identifier);
14052 /* If the next token is an `=', then there is a
14053 default-argument. */
14055 {
14056 default_argument
14059 /* Template parameter packs cannot have default
14060 arguments. */
14062 {
14065 "template parameter pack %qD cannot "
14067 identifier);
14068 else
14072 }
14073 }
14074 else
14077 /* Create the combined representation of the parameter and the
14078 default argument. */
14080 }
14086 }
14089 }
14091 /* Parse a template-id.
14093 template-id:
14094 template-name < template-argument-list [opt] >
14096 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14097 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14098 returned. Otherwise, if the template-name names a function, or set
14099 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14100 names a class, returns a TYPE_DECL for the specialization.
14102 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14103 uninstantiated templates. */
14105 static tree
14111 {
14113 tree templ;
14114 tree arguments;
14115 tree template_id;
14122 /* If the next token corresponds to a template-id, there is no need
14123 to reparse it. */
14126 {
14129 /* Get the stored value. */
14131 /* Perform any access checks that were deferred. */
14134 {
14139 tf_warning_or_error);
14140 }
14141 /* Return the stored value. */
14143 }
14145 /* Avoid performing name lookup if there is no possibility of
14146 finding a template-id. */
14149 && !cp_parser_nth_token_starts_template_argument_list_p
14151 {
14154 }
14156 /* Remember where the template-id starts. */
14162 /* Parse the template-name. */
14165 check_dependency_p,
14166 is_declaration,
14167 tag_type,
14170 {
14173 }
14175 /* If we find the sequence `[:' after a template-name, it's probably
14176 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14177 parse correctly the argument list. */
14184 {
14186 /* Change `:' into `::'. */
14188 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14189 CPP_LESS. */
14192 /* Parse the arguments. */
14195 {
14196 /* If we couldn't parse an argument list, then we revert our changes
14197 and return simply an error. Maybe this is not a template-id
14198 after all. */
14203 }
14204 /* Otherwise, emit an error about the invalid digraph, but continue
14205 parsing because we got our argument list. */
14208 {
14211 "%<<:%> is an alternate spelling for %<[%>."
14214 {
14216 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14219 }
14220 }
14221 }
14222 else
14223 {
14224 /* Look for the `<' that starts the template-argument-list. */
14226 {
14229 }
14230 /* Parse the arguments. */
14232 }
14234 /* Build a representation of the specialization. */
14237 TEMPLATE_ID_EXPR,
14241 {
14243 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14244 template (rather than some instantiation thereof) only if
14245 is not nested within some other construct. For example, in
14246 "template <typename T> void f(T) { A<T>::", A<T> is just an
14247 instantiation of A. */
14250 CPP_SCOPE));
14251 template_id
14253 }
14255 {
14257 }
14258 else
14259 {
14260 /* If it's not a class-template or a template-template, it should be
14261 a function-template. */
14266 // If the template + args designate a concept, then return
14267 // something else.
14272 }
14274 /* If parsing tentatively, replace the sequence of tokens that makes
14275 up the template-id with a CPP_TEMPLATE_ID token. That way,
14276 should we re-parse the token stream, we will not have to repeat
14277 the effort required to do the parse, nor will we issue duplicate
14278 error messages about problems during instantiation of the
14279 template. */
14281 /* Don't do this if we had a parse error in a declarator; re-parsing
14282 might succeed if a name changes meaning (60361). */
14286 {
14289 /* Reset the contents of the START_OF_ID token. */
14291 /* Retrieve any deferred checks. Do not pop this access checks yet
14292 so the memory will not be reclaimed during token replacing below. */
14298 /* Purge all subsequent tokens. */
14301 /* ??? Can we actually assume that, if template_id ==
14302 error_mark_node, we will have issued a diagnostic to the
14303 user, as opposed to simply marking the tentative parse as
14304 failed? */
14307 }
14312 }
14314 /* Parse a template-name.
14316 template-name:
14317 identifier
14319 The standard should actually say:
14321 template-name:
14322 identifier
14323 operator-function-id
14325 A defect report has been filed about this issue.
14327 A conversion-function-id cannot be a template name because they cannot
14328 be part of a template-id. In fact, looking at this code:
14330 a.operator K<int>()
14332 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
14333 It is impossible to call a templated conversion-function-id with an
14334 explicit argument list, since the only allowed template parameter is
14335 the type to which it is converting.
14337 If TEMPLATE_KEYWORD_P is true, then we have just seen the
14338 `template' keyword, in a construction like:
14340 T::template f<3>()
14342 In that case `f' is taken to be a template-name, even though there
14343 is no way of knowing for sure.
14345 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
14346 name refers to a set of overloaded functions, at least one of which
14347 is a template, or an IDENTIFIER_NODE with the name of the template,
14348 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
14349 names are looked up inside uninstantiated templates. */
14351 static tree
14358 {
14359 tree identifier;
14360 tree decl;
14361 tree fns;
14364 /* If the next token is `operator', then we have either an
14365 operator-function-id or a conversion-function-id. */
14367 {
14368 /* We don't know whether we're looking at an
14369 operator-function-id or a conversion-function-id. */
14371 /* Try an operator-function-id. */
14373 /* If that didn't work, try a conversion-function-id. */
14375 {
14378 }
14379 }
14380 /* Look for the identifier. */
14381 else
14384 /* If we didn't find an identifier, we don't have a template-id. */
14388 /* If the name immediately followed the `template' keyword, then it
14389 is a template-name. However, if the next token is not `<', then
14390 we do not treat it as a template-name, since it is not being used
14391 as part of a template-id. This enables us to handle constructs
14392 like:
14394 template <typename T> struct S { S(); };
14395 template <typename T> S<T>::S();
14397 correctly. We would treat `S' as a template -- if it were `S<T>'
14398 -- but we do not if there is no `<'. */
14402 {
14403 /* In a declaration, in a dependent context, we pretend that the
14404 "template" keyword was present in order to improve error
14405 recovery. For example, given:
14407 template <typename T> void f(T::X<int>);
14409 we want to treat "X<int>" as a template-id. */
14411 && !template_keyword_p
14413 && check_dependency_p
14415 /* Do not do this for dtors (or ctors), since they never
14416 need the template keyword before their name. */
14418 {
14421 /* Explain what went wrong. */
14423 identifier);
14426 /* If parsing tentatively, find the location of the "<" token. */
14429 /* Parse the template arguments so that we can issue error
14430 messages about them. */
14433 /* Skip tokens until we find a good place from which to
14434 continue parsing. */
14439 /* If parsing tentatively, permanently remove the
14440 template argument list. That will prevent duplicate
14441 error messages from being issued about the missing
14442 "template" keyword. */
14448 }
14450 /* If the "template" keyword is present, then there is generally
14451 no point in doing name-lookup, so we just return IDENTIFIER.
14452 But, if the qualifying scope is non-dependent then we can
14453 (and must) do name-lookup normally. */
14459 }
14461 /* Look up the name. */
14463 tag_type,
14466 check_dependency_p,
14472 /* If DECL is a template, then the name was a template-name. */
14474 {
14478 }
14479 else
14480 {
14483 /* The standard does not explicitly indicate whether a name that
14484 names a set of overloaded declarations, some of which are
14485 templates, is a template-name. However, such a name should
14486 be a template-name; otherwise, there is no way to form a
14487 template-id for the overloaded templates. */
14495 {
14496 /* The name does not name a template. */
14499 }
14500 }
14502 /* If DECL is dependent, and refers to a function, then just return
14503 its name; we will look it up again during template instantiation. */
14505 {
14509 }
14512 }
14514 /* Parse a template-argument-list.
14516 template-argument-list:
14517 template-argument ... [opt]
14518 template-argument-list , template-argument ... [opt]
14520 Returns a TREE_VEC containing the arguments. */
14522 static tree
14524 {
14529 tree vec;
14536 /* Even if the template-id appears in an integral
14537 constant-expression, the contents of the argument list do
14538 not. */
14544 /* Parse the arguments. */
14545 do
14546 {
14547 tree argument;
14550 /* Consume the comma. */
14553 /* Parse the template-argument. */
14556 /* If the next token is an ellipsis, we're expanding a template
14557 argument pack. */
14559 {
14561 {
14565 }
14566 /* Consume the `...' token. */
14569 /* Make the argument into a TYPE_PACK_EXPANSION or
14570 EXPR_PACK_EXPANSION. */
14572 }
14574 // If we end up with a template decl argument, check if this is actually
14575 // a template template parameter and drop the outer wrapping.
14580 {
14584 {
14587 }
14588 else
14590 }
14592 }
14605 #ifdef ENABLE_CHECKING
14607 #endif
14609 }
14611 /* Parse a template-argument.
14613 template-argument:
14614 assignment-expression
14615 type-id
14616 id-expression
14618 The representation is that of an assignment-expression, type-id, or
14619 id-expression -- except that the qualified id-expression is
14620 evaluated, so that the value returned is either a DECL or an
14621 OVERLOAD.
14623 Although the standard says "assignment-expression", it forbids
14624 throw-expressions or assignments in the template argument.
14625 Therefore, we use "conditional-expression" instead. */
14627 static tree
14629 {
14630 tree argument;
14636 cp_id_kind idk;
14638 /* There's really no way to know what we're looking at, so we just
14639 try each alternative in order.
14641 [temp.arg]
14643 In a template-argument, an ambiguity between a type-id and an
14644 expression is resolved to a type-id, regardless of the form of
14645 the corresponding template-parameter.
14647 Therefore, we try a type-id first. */
14650 /* If there was no error parsing the type-id but the next token is a
14651 '>>', our behavior depends on which dialect of C++ we're
14652 parsing. In C++98, we probably found a typo for '> >'. But there
14653 are type-id which are also valid expressions. For instance:
14655 struct X { int operator >> (int); };
14656 template <int V> struct Foo {};
14657 Foo<X () >> 5> r;
14659 Here 'X()' is a valid type-id of a function type, but the user just
14660 wanted to write the expression "X() >> 5". Thus, we remember that we
14661 found a valid type-id, but we still try to parse the argument as an
14662 expression to see what happens.
14664 In C++0x, the '>>' will be considered two separate '>'
14665 tokens. */
14669 {
14672 }
14673 else
14674 {
14675 /* If the next token isn't a `,' or a `>', then this argument wasn't
14676 really finished. This means that the argument is not a valid
14677 type-id. */
14680 /* If that worked, we're done. */
14683 }
14684 /* We're still not sure what the argument will be. */
14686 /* Try a template. */
14694 /* If the next token isn't a `,' or a `>', then this argument wasn't
14695 really finished. */
14699 {
14700 /* Figure out what is being referred to. If the id-expression
14701 was for a class template specialization, then we will have a
14702 TYPE_DECL at this point. There is no need to do name lookup
14703 at this point in that case. */
14706 none_type,
14715 }
14717 {
14721 }
14722 /* It must be a non-type argument. There permitted cases are given
14723 in [temp.arg.nontype]:
14725 -- an integral constant-expression of integral or enumeration
14726 type; or
14728 -- the name of a non-type template-parameter; or
14730 -- the name of an object or function with external linkage...
14732 -- the address of an object or function with external linkage...
14734 -- a pointer to member... */
14735 /* Look for a non-type template parameter. */
14737 {
14749 }
14751 /* If the next token is "&", the argument must be the address of an
14752 object or function with external linkage. */
14755 {
14758 }
14759 /* See if we might have an id-expression. */
14766 {
14769 address_p,
14776 else
14777 {
14778 tree probe;
14781 {
14782 /* Strip the dereference temporarily. */
14785 }
14787 /* If we're in a template, we represent a qualified-id referring
14788 to a static data member as a SCOPE_REF even if the scope isn't
14789 dependent so that we can check access control later. */
14794 {
14795 /* A variable without external linkage might still be a
14796 valid constant-expression, so no error is issued here
14797 if the external-linkage check fails. */
14800 }
14802 /* All overloaded functions are allowed; if the external
14803 linkage test does not pass, an error will be issued
14804 later. */
14805 ;
14809 /* A pointer-to-member. */
14810 ;
14812 ;
14813 else
14817 {
14820 tf_warning_or_error);
14821 else
14824 }
14825 }
14826 }
14827 /* If the argument started with "&", there are no other valid
14828 alternatives at this point. */
14830 {
14833 }
14835 /* If the argument wasn't successfully parsed as a type-id followed
14836 by '>>', the argument can only be a constant expression now.
14837 Otherwise, we try parsing the constant-expression tentatively,
14838 because the argument could really be a type-id. */
14849 /* We did our best to parse the argument as a non type-id, but that
14850 was the only alternative that matched (albeit with a '>' after
14851 it). We can assume it's just a typo from the user, and a
14852 diagnostic will then be issued. */
14854 }
14856 /* Parse an explicit-instantiation.
14858 explicit-instantiation:
14859 template declaration
14861 Although the standard says `declaration', what it really means is:
14863 explicit-instantiation:
14864 template decl-specifier-seq [opt] declarator [opt] ;
14866 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14867 supposed to be allowed. A defect report has been filed about this
14868 issue.
14870 GNU Extension:
14872 explicit-instantiation:
14873 storage-class-specifier template
14874 decl-specifier-seq [opt] declarator [opt] ;
14875 function-specifier template
14876 decl-specifier-seq [opt] declarator [opt] ; */
14878 static void
14880 {
14882 cp_decl_specifier_seq decl_specifiers;
14887 /* Look for an (optional) storage-class-specifier or
14888 function-specifier. */
14890 {
14891 extension_specifier
14894 extension_specifier
14897 }
14899 /* Look for the `template' keyword. */
14901 /* Let the front end know that we are processing an explicit
14902 instantiation. */
14904 /* [temp.explicit] says that we are supposed to ignore access
14905 control while processing explicit instantiation directives. */
14907 /* Parse a decl-specifier-seq. */
14909 CP_PARSER_FLAGS_OPTIONAL,
14912 /* If there was exactly one decl-specifier, and it declared a class,
14913 and there's no declarator, then we have an explicit type
14914 instantiation. */
14916 {
14917 tree type;
14921 /* Turn access control back on for names used during
14922 template instantiation. */
14927 }
14928 else
14929 {
14931 tree decl;
14933 /* Parse the declarator. */
14934 declarator
14945 {
14948 "explicit instantiation shall not use"
14952 "explicit instantiation shall not use"
14957 /* Turn access control back on for names used during
14958 template instantiation. */
14960 /* Do the explicit instantiation. */
14962 }
14963 else
14964 {
14966 /* Skip the body of the explicit instantiation. */
14968 }
14969 }
14970 /* We're done with the instantiation. */
14976 }
14978 /* Parse an explicit-specialization.
14980 explicit-specialization:
14981 template < > declaration
14983 Although the standard says `declaration', what it really means is:
14985 explicit-specialization:
14986 template <> decl-specifier [opt] init-declarator [opt] ;
14987 template <> function-definition
14988 template <> explicit-specialization
14989 template <> template-declaration */
14991 static void
14993 {
14997 /* Look for the `template' keyword. */
14999 /* Look for the `<'. */
15001 /* Look for the `>'. */
15003 /* We have processed another parameter list. */
15005 /* [temp]
15007 A template ... explicit specialization ... shall not have C
15008 linkage. */
15010 {
15012 /* Give it C++ linkage to avoid confusing other parts of the
15013 front end. */
15016 }
15017 else
15019 /* Let the front end know that we are beginning a specialization. */
15021 {
15024 }
15026 /* If the next keyword is `template', we need to figure out whether
15027 or not we're looking a template-declaration. */
15029 {
15034 else
15036 }
15037 else
15038 /* Parse the dependent declaration. */
15044 /* We're done with the specialization. */
15046 /* For the erroneous case of a template with C linkage, we pushed an
15047 implicit C++ linkage scope; exit that scope now. */
15050 /* We're done with this parameter list. */
15052 }
15054 /* Parse a type-specifier.
15056 type-specifier:
15057 simple-type-specifier
15058 class-specifier
15059 enum-specifier
15060 elaborated-type-specifier
15061 cv-qualifier
15063 GNU Extension:
15065 type-specifier:
15066 __complex__
15068 Returns a representation of the type-specifier. For a
15069 class-specifier, enum-specifier, or elaborated-type-specifier, a
15070 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15072 The parser flags FLAGS is used to control type-specifier parsing.
15074 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15075 in a decl-specifier-seq.
15077 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15078 class-specifier, enum-specifier, or elaborated-type-specifier, then
15079 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15080 if a type is declared; 2 if it is defined. Otherwise, it is set to
15081 zero.
15083 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15084 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15085 is set to FALSE. */
15087 static tree
15089 cp_parser_flags flags,
15094 {
15100 /* Assume this type-specifier does not declare a new type. */
15103 /* And that it does not specify a cv-qualifier. */
15106 /* Peek at the next token. */
15109 /* If we're looking at a keyword, we can use that to guide the
15110 production we choose. */
15113 {
15118 /* Look for the enum-specifier. */
15120 /* If that worked, we're done. */
15122 {
15127 type_spec,
15128 token,
15131 }
15132 else
15135 /* Any of these indicate either a class-specifier, or an
15136 elaborated-type-specifier. */
15143 /* Parse tentatively so that we can back up if we don't find a
15144 class-specifier. */
15146 /* Look for the class-specifier. */
15149 /* If that worked, we're done. */
15151 {
15156 type_spec,
15157 token,
15160 }
15162 /* Fall through. */
15163 elaborated_type_specifier:
15164 /* We're declaring (not defining) a class or enum. */
15168 /* Fall through. */
15170 /* Look for an elaborated-type-specifier. */
15171 type_spec
15172 = (cp_parser_elaborated_type_specifier
15175 is_declaration));
15178 type_spec,
15179 token,
15202 /* The `__complex__' keyword is a GNU extension. */
15208 }
15210 /* Handle simple keywords. */
15212 {
15214 {
15217 }
15219 }
15221 /* If we do not already have a type-specifier, assume we are looking
15222 at a simple-type-specifier. */
15224 decl_specs,
15225 flags);
15227 /* If we didn't find a type-specifier, and a type-specifier was not
15228 optional in this context, issue an error message. */
15230 {
15233 }
15236 }
15238 /* Parse a simple-type-specifier.
15240 simple-type-specifier:
15241 :: [opt] nested-name-specifier [opt] type-name
15242 :: [opt] nested-name-specifier template template-id
15243 char
15244 wchar_t
15245 bool
15246 short
15247 int
15248 long
15249 signed
15250 unsigned
15251 float
15252 double
15253 void
15255 C++0x Extension:
15257 simple-type-specifier:
15258 auto
15259 decltype ( expression )
15260 char16_t
15261 char32_t
15262 __underlying_type ( type-id )
15264 GNU Extension:
15266 simple-type-specifier:
15267 __int128
15268 __typeof__ unary-expression
15269 __typeof__ ( type-id )
15270 __typeof__ ( type-id ) { initializer-list , [opt] }
15272 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15273 appropriately updated. */
15275 static tree
15278 cp_parser_flags flags)
15279 {
15284 /* Peek at the next token. */
15287 /* If we're looking at a keyword, things are easy. */
15289 {
15324 {
15327 }
15356 {
15359 else
15363 {
15366 "use of %<auto%> in lambda parameter declaration "
15367 "only available with "
15369 }
15372 "use of %<auto%> in parameter declaration "
15373 "only available with "
15375 else
15377 "ISO C++ forbids use of %<auto%> in parameter "
15379 }
15380 else
15385 /* Since DR 743, decltype can either be a simple-type-specifier by
15386 itself or begin a nested-name-specifier. Parsing it will replace
15387 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
15388 handling below decide what to do. */
15394 /* Consume the `typeof' token. */
15396 /* Parse the operand to `typeof'. */
15398 /* If it is not already a TYPE, take its type. */
15404 token,
15413 token,
15423 token,
15428 }
15430 /* If token is an already-parsed decltype not followed by ::,
15431 it's a simple-type-specifier. */
15434 {
15437 {
15439 token,
15441 /* Remember that we are handling a decltype in order to
15442 implement the resolution of DR 1510 when the argument
15443 isn't instantiation dependent. */
15445 }
15448 }
15450 /* If the type-specifier was for a built-in type, we're done. */
15452 {
15453 /* Record the type. */
15460 type,
15461 token,
15466 /* Consume the token. */
15472 /* There is no valid C++ program where a non-template type is
15473 followed by a "<". That usually indicates that the user thought
15474 that the type was a template. */
15479 }
15481 /* The type-specifier must be a user-defined type. */
15483 {
15487 /* Don't gobble tokens or issue error messages if this is an
15488 optional type-specifier. */
15492 /* Look for the optional `::' operator. */
15493 global_p
15497 /* Look for the nested-name specifier. */
15498 qualified_p
15506 /* If we have seen a nested-name-specifier, and the next token
15507 is `template', then we are using the template-id production. */
15510 {
15511 /* Look for the template-id. */
15515 none_type,
15517 /* If the template-id did not name a type, we are out of
15518 luck. */
15520 {
15523 }
15524 }
15525 /* Otherwise, look for a type-name. */
15526 else
15529 /* Keep track of all name-lookups performed in class scopes. */
15531 && !global_p
15532 && !qualified_p
15536 /* If it didn't work out, we don't have a TYPE. */
15542 token,
15544 }
15546 /* If we didn't get a type-name, issue an error message. */
15548 {
15551 }
15554 {
15555 /* See if TYPE is an Objective-C type, and if so, parse and
15556 accept any protocol references following it. Do this before
15557 the cp_parser_check_for_invalid_template_id() call, because
15558 Objective-C types can be followed by '<...>' which would
15559 enclose protocol names rather than template arguments, and so
15560 everything is fine. */
15563 {
15567 /* Clobber the "unqualified" type previously entered into
15568 DECL_SPECS with the new, improved protocol-qualified version. */
15573 }
15575 /* There is no valid C++ program where a non-template type is
15576 followed by a "<". That usually indicates that the user
15577 thought that the type was a template. */
15579 none_type,
15581 }
15584 }
15586 /* Parse a type-name.
15588 type-name:
15589 class-name
15590 enum-name
15591 typedef-name
15592 simple-template-id [in c++0x]
15594 enum-name:
15595 identifier
15597 typedef-name:
15598 identifier
15600 Concepts:
15602 type-name:
15603 concept-name
15604 partial-concept-id
15606 concept-name:
15607 identifier
15609 Returns a TYPE_DECL for the type. */
15611 static tree
15613 {
15615 }
15617 /* See above. */
15618 static tree
15620 {
15621 tree type_decl;
15623 /* We can't know yet whether it is a class-name or not. */
15625 /* Try a class-name. */
15627 typename_keyword_p,
15629 none_type,
15634 /* If it's not a class-name, keep looking. */
15636 {
15638 /* It must be a typedef-name or an enum-name. */
15642 /* It is either a simple-template-id representing an
15643 instantiation of an alias template... */
15647 none_type,
15650 /* Note that this must be an instantiation of an alias template
15651 because [temp.names]/6 says:
15653 A template-id that names an alias template specialization
15654 is a type-name.
15656 Whereas [temp.names]/7 says:
15658 A simple-template-id that names a class template
15659 specialization is a class-name.
15661 With concepts, this could also be a partial-concept-id that
15662 declares a non-type template parameter. */
15669 else
15673 /* ... Or a typedef-name or an enum-name. */
15675 }
15678 }
15680 // Returns true if proto is a type parameter, but not a template template
15681 // parameter.
15682 static bool
15684 {
15686 {
15689 }
15691 }
15693 // Returns true if the parser is in a context that allows the
15694 // use of a constrained type specifier.
15697 {
15699 && (processing_template_parmlist
15702 }
15704 // Check if DECL and ARGS can form a constrained-type-specifier. If ARGS
15705 // is non-null, we try to form a concept check of the form DECL<?, ARGS>
15706 // where ? is a placeholder for any kind of template argument. If ARGS
15707 // is NULL, then we try to form a concept check of the form DECL<?>.
15708 static tree
15710 {
15713 // Don't do any heavy lifting if we know we're not in a context
15714 // where it could succeed.
15718 // Try to build a call expression that evaluates the concept. This
15719 // can fail if the overload set refers only to non-templates.
15725 // Deduce the checked constraint and the prototype parameter.
15726 tree fn;
15727 tree proto;
15731 // In template parameter scope, this results in a constrained parameter.
15732 // Return a descriptor of that parm.
15736 // In any other context, a concept must be a type concept.
15740 // In a parameter-declaration-clause, constrained-type specifiers
15741 // result in invented template parameters.
15743 {
15747 }
15749 // A concept-name appearing in a result-type constraint is a
15750 // constrained auto. Meaning that type deduction will be applied
15751 // and the constraint checked.
15752 //
15753 // TODO: Actually bind the constraint to the auto.
15758 }
15761 // If DECL refers to a concept, return a TYPE_DECL representing the result
15762 // of using the constrained type specifier in the current context.
15763 //
15764 // DECL refers to a concept if
15765 // - it is an overload set containing a function concept taking a single
15766 // type argument, or
15767 // - it is a variable concept taking a single type argument
15768 static tree
15770 {
15772 }
15774 // Check if DECL and ARGS forms a partial concept id. Let C be the name
15775 // of the overload set denoted by TMPL, Args the sequence of ARGS, and
15776 // ? denote an unspecified template argument. If the template-id C<?, Args>
15777 // is valid, this denotes a partial-concept-id to be acted on.
15778 tree
15780 {
15782 }
15784 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
15785 or a concept-name.
15787 enum-name:
15788 identifier
15790 typedef-name:
15791 identifier
15793 concept-name:
15794 identifier
15796 Returns a TYPE_DECL for the type. */
15798 static tree
15800 {
15801 tree type_decl;
15802 tree identifier;
15809 /* Look up the type-name. */
15813 // If we found an overload set, then it may refer to a concept-name.
15814 //
15815 // TODO: The name could also refer to an introduction (if followed by '{').
15820 {
15821 // Determine whether the overload refers to a concept.
15824 }
15828 {
15829 /* See if this is an Objective-C type. */
15834 }
15836 /* Issue an error if we did not find a type-name. */
15838 /* In Objective-C, we have the complication that class names are
15839 normally type names and start declarations (eg, the
15840 "NSObject" in "NSObject *object;"), but can be used in an
15841 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15842 is an expression. So, a classname followed by a dot is not a
15843 valid type-name. */
15846 {
15851 }
15852 /* Remember that the name was used in the definition of the
15853 current class so that we can check later to see if the
15854 meaning would have been different after the class was
15855 entirely defined. */
15861 }
15863 /* Parse an elaborated-type-specifier. Note that the grammar given
15864 here incorporates the resolution to DR68.
15866 elaborated-type-specifier:
15867 class-key :: [opt] nested-name-specifier [opt] identifier
15868 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15869 enum-key :: [opt] nested-name-specifier [opt] identifier
15870 typename :: [opt] nested-name-specifier identifier
15871 typename :: [opt] nested-name-specifier template [opt]
15872 template-id
15874 GNU extension:
15876 elaborated-type-specifier:
15877 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15878 class-key attributes :: [opt] nested-name-specifier [opt]
15879 template [opt] template-id
15880 enum attributes :: [opt] nested-name-specifier [opt] identifier
15882 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15883 declared `friend'. If IS_DECLARATION is TRUE, then this
15884 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15885 something is being declared.
15887 Returns the TYPE specified. */
15889 static tree
15893 {
15895 tree identifier;
15898 tree globalscope;
15901 /* See if we're looking at the `enum' keyword. */
15903 {
15904 /* Consume the `enum' token. */
15906 /* Remember that it's an enumeration type. */
15908 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15909 enums) is used here. */
15912 {
15916 /* Consume the `struct' or `class' and parse it anyway. */
15918 }
15919 /* Parse the attributes. */
15921 }
15922 /* Or, it might be `typename'. */
15924 RID_TYPENAME))
15925 {
15926 /* Consume the `typename' token. */
15928 /* Remember that it's a `typename' type. */
15930 }
15931 /* Otherwise it must be a class-key. */
15932 else
15933 {
15937 /* Parse the attributes. */
15939 }
15941 /* Look for the `::' operator. */
15944 /* Look for the nested-name-specifier. */
15946 {
15951 is_declaration))
15953 }
15954 else
15955 /* Even though `typename' is not present, the proposed resolution
15956 to Core Issue 180 says that in `class A<T>::B', `B' should be
15957 considered a type-name, even if `A<T>' is dependent. */
15962 is_declaration);
15963 /* For everything but enumeration types, consider a template-id.
15964 For an enumeration type, consider only a plain identifier. */
15966 {
15968 tree decl;
15970 /* Allow the `template' keyword. */
15972 /* If we didn't see `template', we don't know if there's a
15973 template-id or not. */
15976 /* Parse the template-id. */
15980 tag_type,
15981 is_declaration);
15982 /* If we didn't find a template-id, look for an ordinary
15983 identifier. */
15985 ;
15986 /* We can get here when cp_parser_template_id, called by
15987 cp_parser_class_name with tag_type == none_type, succeeds
15988 and caches a BASELINK. Then, when called again here,
15989 instead of failing and returning an error_mark_node
15990 returns it (see template/typename17.C in C++11).
15991 ??? Could we diagnose this earlier? */
15993 {
15996 }
15997 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15998 in effect, then we must assume that, upon instantiation, the
15999 template will correspond to a class. */
16003 typename_type,
16005 /* If the `typename' keyword is in effect and DECL is not a type
16006 decl, then type is non existent. */
16008 ;
16014 }
16017 {
16022 {
16025 }
16027 /* For a `typename', we needn't call xref_tag. */
16033 /* Template parameter lists apply only if we are not within a
16034 function parameter list. */
16035 bool template_parm_lists_apply
16044 /* Look up a qualified name in the usual way. */
16046 {
16047 tree decl;
16048 tree ambiguous_decls;
16051 tag_type,
16058 /* If the lookup was ambiguous, an error will already have been
16059 issued. */
16063 /* If we are parsing friend declaration, DECL may be a
16064 TEMPLATE_DECL tree node here. However, we need to check
16065 whether this TEMPLATE_DECL results in valid code. Consider
16066 the following example:
16068 namespace N {
16069 template <class T> class C {};
16070 }
16071 class X {
16072 template <class T> friend class N::C; // #1, valid code
16073 };
16074 template <class T> class Y {
16075 friend class N::C; // #2, invalid code
16076 };
16078 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16079 name lookup of `N::C'. We see that friend declaration must
16080 be template for the code to be valid. Note that
16081 processing_template_decl does not work here since it is
16082 always 1 for the above two cases. */
16084 decl = (cp_parser_maybe_treat_template_as_class
16089 {
16091 identifier,
16094 }
16097 {
16101 allow_template);
16105 }
16107 /* Forward declarations of nested types, such as
16109 class C1::C2;
16110 class C1::C2::C3;
16112 are invalid unless all components preceding the final '::'
16113 are complete. If all enclosing types are complete, these
16114 declarations become merely pointless.
16116 Invalid forward declarations of nested types are errors
16117 caught elsewhere in parsing. Those that are pointless arrive
16118 here. */
16125 }
16126 else
16127 {
16128 /* An elaborated-type-specifier sometimes introduces a new type and
16129 sometimes names an existing type. Normally, the rule is that it
16130 introduces a new type only if there is not an existing type of
16131 the same name already in scope. For example, given:
16133 struct S {};
16134 void f() { struct S s; }
16136 the `struct S' in the body of `f' is the same `struct S' as in
16137 the global scope; the existing definition is used. However, if
16138 there were no global declaration, this would introduce a new
16139 local class named `S'.
16141 An exception to this rule applies to the following code:
16143 namespace N { struct S; }
16145 Here, the elaborated-type-specifier names a new type
16146 unconditionally; even if there is already an `S' in the
16147 containing scope this declaration names a new type.
16148 This exception only applies if the elaborated-type-specifier
16149 forms the complete declaration:
16151 [class.name]
16153 A declaration consisting solely of `class-key identifier ;' is
16154 either a redeclaration of the name in the current scope or a
16155 forward declaration of the identifier as a class name. It
16156 introduces the name into the current scope.
16158 We are in this situation precisely when the next token is a `;'.
16160 An exception to the exception is that a `friend' declaration does
16161 *not* name a new type; i.e., given:
16163 struct S { friend struct T; };
16165 `T' is not a new type in the scope of `S'.
16167 Also, `new struct S' or `sizeof (struct S)' never results in the
16168 definition of a new type; a new type can only be declared in a
16169 declaration context. */
16171 tag_scope ts;
16175 /* Friends have special name lookup rules. */
16179 CPP_SEMICOLON))
16180 /* This is a `class-key identifier ;' */
16182 else
16185 template_p =
16186 (template_parm_lists_apply
16189 /* An unqualified name was used to reference this type, so
16190 there were no qualifying templates. */
16198 }
16199 }
16204 /* Allow attributes on forward declarations of classes. */
16206 {
16216 else
16219 }
16222 {
16223 /* Indicate whether this class was declared as a `class' or as a
16224 `struct'. */
16228 }
16230 /* A "<" cannot follow an elaborated type specifier. If that
16231 happens, the user was probably trying to form a template-id. */
16236 }
16238 /* Parse an enum-specifier.
16240 enum-specifier:
16241 enum-head { enumerator-list [opt] }
16242 enum-head { enumerator-list , } [C++0x]
16244 enum-head:
16245 enum-key identifier [opt] enum-base [opt]
16246 enum-key nested-name-specifier identifier enum-base [opt]
16248 enum-key:
16249 enum
16250 enum class [C++0x]
16251 enum struct [C++0x]
16253 enum-base: [C++0x]
16254 : type-specifier-seq
16256 opaque-enum-specifier:
16257 enum-key identifier enum-base [opt] ;
16259 GNU Extensions:
16260 enum-key attributes[opt] identifier [opt] enum-base [opt]
16261 { enumerator-list [opt] }attributes[opt]
16262 enum-key attributes[opt] identifier [opt] enum-base [opt]
16263 { enumerator-list, }attributes[opt] [C++0x]
16265 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16266 if the token stream isn't an enum-specifier after all. */
16268 static tree
16270 {
16271 tree identifier;
16273 tree prev_scope;
16275 tree attributes;
16288 /* Parse tentatively so that we can back up if we don't find a
16289 enum-specifier. */
16292 /* Caller guarantees that the current token is 'enum', an identifier
16293 possibly follows, and the token after that is an opening brace.
16294 If we don't have an identifier, fabricate an anonymous name for
16295 the enumeration being defined. */
16298 /* Parse the "class" or "struct", which indicates a scoped
16299 enumeration type in C++0x. */
16302 {
16306 /* Consume the `struct' or `class' token. */
16310 }
16314 /* Clear the qualification. */
16319 /* Figure out in what scope the declaration is being placed. */
16325 nested_name_specifier
16333 {
16334 tree name;
16338 enum_type,
16343 input_location);
16345 {
16348 {
16349 /* Are template enums allowed in ISO? */
16353 /* ignore a typename reference, for it will be solved by name
16354 in start_enum. */
16356 }
16357 }
16360 else
16363 }
16364 else
16365 {
16368 else
16369 {
16375 }
16376 }
16379 /* Check for the `:' that denotes a specified underlying type in C++0x.
16380 Note that a ':' could also indicate a bitfield width, however. */
16382 {
16383 cp_decl_specifier_seq type_specifiers;
16385 /* Consume the `:'. */
16388 /* Parse the type-specifier-seq. */
16393 /* At this point this is surely not elaborated type specifier. */
16402 /* If that didn't work, stop. */
16404 {
16410 }
16411 }
16413 /* Look for the `{' but don't consume it yet. */
16415 {
16417 {
16420 {
16423 }
16424 }
16425 /* An opaque-enum-specifier must have a ';' here. */
16428 {
16431 {
16434 }
16435 }
16436 }
16442 {
16444 {
16448 }
16450 {
16452 }
16453 }
16455 /* Issue an error message if type-definitions are forbidden here. */
16458 else
16459 /* Create the new type. We do this before consuming the opening
16460 brace so the enum will be recorded as being on the line of its
16461 tag (or the 'enum' keyword, if there is no tag). */
16465 /* If the next token is not '{' it is an opaque-enum-specifier or an
16466 elaborated-type-specifier. */
16468 {
16472 {
16473 /* The following catches invalid code such as:
16474 enum class S<int>::E { A, B, C }; */
16482 {
16486 nested_name_specifier);
16488 }
16489 /* If that scope does not contain the scope in which the
16490 class was originally declared, the program is invalid. */
16492 nested_name_specifier))
16493 {
16496 "declaration of %qD in namespace %qD which does not "
16499 else
16501 "declaration of %qD in %qD which does not "
16505 }
16506 }
16511 /* Consume the opening brace. */
16518 {
16522 }
16523 else
16524 {
16530 }
16534 /* If the next token is not '}', then there are some enumerators. */
16536 {
16540 }
16541 else
16544 /* Consume the final '}'. */
16550 }
16551 else
16552 {
16553 /* If a ';' follows, then it is an opaque-enum-specifier
16554 and additional restrictions apply. */
16556 {
16563 }
16564 }
16566 /* Look for trailing attributes to apply to this enumeration, and
16567 apply them if appropriate. */
16569 {
16573 trailing_attr,
16575 }
16577 /* Finish up the enumeration. */
16579 {
16584 }
16587 {
16589 {
16592 }
16594 {
16596 }
16597 }
16598 out:
16601 }
16603 /* Parse an enumerator-list. The enumerators all have the indicated
16604 TYPE.
16606 enumerator-list:
16607 enumerator-definition
16608 enumerator-list , enumerator-definition */
16610 static void
16612 {
16614 {
16615 /* Parse an enumerator-definition. */
16618 /* If the next token is not a ',', we've reached the end of
16619 the list. */
16622 /* Otherwise, consume the `,' and keep going. */
16624 /* If the next token is a `}', there is a trailing comma. */
16626 {
16631 }
16632 }
16633 }
16635 /* Parse an enumerator-definition. The enumerator has the indicated
16636 TYPE.
16638 enumerator-definition:
16639 enumerator
16640 enumerator = constant-expression
16642 enumerator:
16643 identifier */
16645 static void
16647 {
16648 tree identifier;
16649 tree value;
16650 location_t loc;
16652 /* Save the input location because we are interested in the location
16653 of the identifier and not the location of the explicit value. */
16656 /* Look for the identifier. */
16661 /* If the next token is an '=', then there is an explicit value. */
16663 {
16664 /* Consume the `=' token. */
16666 /* Parse the value. */
16668 }
16669 else
16672 /* If we are processing a template, make sure the initializer of the
16673 enumerator doesn't contain any bare template parameter pack. */
16677 /* Create the enumerator. */
16679 }
16681 /* Parse a namespace-name.
16683 namespace-name:
16684 original-namespace-name
16685 namespace-alias
16687 Returns the NAMESPACE_DECL for the namespace. */
16689 static tree
16691 {
16692 tree identifier;
16693 tree namespace_decl;
16697 /* Get the name of the namespace. */
16702 /* Look up the identifier in the currently active scope. Look only
16703 for namespaces, due to:
16705 [basic.lookup.udir]
16707 When looking up a namespace-name in a using-directive or alias
16708 definition, only namespace names are considered.
16710 And:
16712 [basic.lookup.qual]
16714 During the lookup of a name preceding the :: scope resolution
16715 operator, object, function, and enumerator names are ignored.
16717 (Note that cp_parser_qualifying_entity only calls this
16718 function if the token after the name is the scope resolution
16719 operator.) */
16721 none_type,
16727 /* If it's not a namespace, issue an error. */
16730 {
16735 }
16738 }
16740 /* Parse a namespace-definition.
16742 namespace-definition:
16743 named-namespace-definition
16744 unnamed-namespace-definition
16746 named-namespace-definition:
16747 original-namespace-definition
16748 extension-namespace-definition
16750 original-namespace-definition:
16751 namespace identifier { namespace-body }
16753 extension-namespace-definition:
16754 namespace original-namespace-name { namespace-body }
16756 unnamed-namespace-definition:
16757 namespace { namespace-body } */
16759 static void
16761 {
16768 {
16772 }
16773 else
16776 /* Look for the `namespace' keyword. */
16779 /* Get the name of the namespace. We do not attempt to distinguish
16780 between an original-namespace-definition and an
16781 extension-namespace-definition at this point. The semantic
16782 analysis routines are responsible for that. */
16785 else
16788 /* Parse any specified attributes. */
16791 /* Look for the `{' to start the namespace. */
16793 /* Start the namespace. */
16796 /* "inline namespace" is equivalent to a stub namespace definition
16797 followed by a strong using directive. */
16799 {
16801 /* Set up namespace association. */
16805 /* Import the contents of the inline namespace. */
16809 }
16813 /* Parse the body of the namespace. */
16819 /* Finish the namespace. */
16821 /* Look for the final `}'. */
16823 }
16825 /* Parse a namespace-body.
16827 namespace-body:
16828 declaration-seq [opt] */
16830 static void
16832 {
16834 }
16836 /* Parse a namespace-alias-definition.
16838 namespace-alias-definition:
16839 namespace identifier = qualified-namespace-specifier ; */
16841 static void
16843 {
16844 tree identifier;
16845 tree namespace_specifier;
16849 /* Look for the `namespace' keyword. */
16851 /* Look for the identifier. */
16855 /* Look for the `=' token. */
16858 {
16860 /* Skip the definition. */
16865 }
16867 /* Look for the qualified-namespace-specifier. */
16868 namespace_specifier
16870 /* Look for the `;' token. */
16873 /* Register the alias in the symbol table. */
16875 }
16877 /* Parse a qualified-namespace-specifier.
16879 qualified-namespace-specifier:
16880 :: [opt] nested-name-specifier [opt] namespace-name
16882 Returns a NAMESPACE_DECL corresponding to the specified
16883 namespace. */
16885 static tree
16887 {
16888 /* Look for the optional `::'. */
16892 /* Look for the optional nested-name-specifier. */
16900 }
16902 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16903 access declaration.
16905 using-declaration:
16906 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16907 using :: unqualified-id ;
16909 access-declaration:
16910 qualified-id ;
16912 */
16914 static bool
16917 {
16921 tree decl;
16922 tree identifier;
16923 tree qscope;
16928 {
16931 }
16932 else
16933 {
16934 /* Look for the `using' keyword. */
16937 /* Peek at the next token. */
16939 /* See if it's `typename'. */
16941 {
16942 /* Remember that we've seen it. */
16944 /* Consume the `typename' token. */
16946 }
16947 }
16949 /* Look for the optional global scope qualification. */
16950 global_scope_p
16955 /* If we saw `typename', or didn't see `::', then there must be a
16956 nested-name-specifier present. */
16958 {
16964 {
16967 }
16968 }
16969 /* Otherwise, we could be in either of the two productions. In that
16970 case, treat the nested-name-specifier as optional. */
16971 else
16983 /* Something has already gone wrong; there's no need to parse
16984 further. Since an error has occurred, the return value of
16985 cp_parser_parse_definitely will be false, as required. */
16989 /* Parse the unqualified-id. */
16997 {
17002 }
17004 /* The function we call to handle a using-declaration is different
17005 depending on what scope we are in. */
17007 ;
17010 /* [namespace.udecl]
17012 A using declaration shall not name a template-id. */
17015 else
17016 {
17018 {
17019 /* Create the USING_DECL. */
17026 {
17029 }
17030 else
17031 /* Add it to the list of members in this class. */
17033 }
17034 else
17035 {
17037 identifier,
17044 {
17047 }
17050 else
17052 }
17053 }
17055 /* Look for the final `;'. */
17060 "access declarations are deprecated "
17061 "in favour of using-declarations; "
17065 }
17067 /* Parse an alias-declaration.
17069 alias-declaration:
17070 using identifier attribute-specifier-seq [opt] = type-id */
17072 static tree
17074 {
17076 location_t id_location;
17078 cp_decl_specifier_seq decl_specs;
17082 /* Look for the `using' keyword. */
17083 cp_token *using_token
17105 /* Now we are going to parse the type-id of the declaration. */
17107 /*
17108 [dcl.type]/3 says:
17110 "A type-specifier-seq shall not define a class or enumeration
17111 unless it appears in the type-id of an alias-declaration (7.1.3) that
17112 is not the declaration of a template-declaration."
17114 In other words, if we currently are in an alias template, the
17115 type-id should not define a type.
17117 So let's set parser->type_definition_forbidden_message in that
17118 case; cp_parser_check_type_definition (called by
17119 cp_parser_class_specifier) will then emit an error if a type is
17120 defined in the type-id. */
17122 {
17126 }
17130 /* Restore the error message if need be. */
17136 {
17139 }
17141 /* A typedef-name can also be introduced by an alias-declaration. The
17142 identifier following the using keyword becomes a typedef-name. It has
17143 the same semantics as if it were introduced by the typedef
17144 specifier. In particular, it does not define a new type and it shall
17145 not appear in the type-id. */
17150 {
17153 ds_attribute,
17154 attrs_token);
17155 }
17157 ds_typedef,
17158 using_token);
17160 ds_alias,
17161 using_token);
17170 else
17176 // Attach constraints to the alias declaration.
17178 {
17182 }
17189 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17190 added into the symbol table; otherwise, return the TYPE_DECL. */
17194 {
17198 }
17201 }
17203 /* Parse a using-directive.
17205 using-directive:
17206 using namespace :: [opt] nested-name-specifier [opt]
17207 namespace-name ; */
17209 static void
17211 {
17212 tree namespace_decl;
17213 tree attribs;
17215 /* Look for the `using' keyword. */
17217 /* And the `namespace' keyword. */
17219 /* Look for the optional `::' operator. */
17221 /* And the optional nested-name-specifier. */
17227 /* Get the namespace being used. */
17229 /* And any specified attributes. */
17231 /* Update the symbol table. */
17233 /* Look for the final `;'. */
17235 }
17237 /* Parse an asm-definition.
17239 asm-definition:
17240 asm ( string-literal ) ;
17242 GNU Extension:
17244 asm-definition:
17245 asm volatile [opt] ( string-literal ) ;
17246 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
17247 asm volatile [opt] ( string-literal : asm-operand-list [opt]
17248 : asm-operand-list [opt] ) ;
17249 asm volatile [opt] ( string-literal : asm-operand-list [opt]
17250 : asm-operand-list [opt]
17251 : asm-clobber-list [opt] ) ;
17252 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
17253 : asm-clobber-list [opt]
17254 : asm-goto-list ) ; */
17256 static void
17258 {
17259 tree string;
17264 tree asm_stmt;
17272 /* Look for the `asm' keyword. */
17277 {
17280 }
17282 /* See if the next token is `volatile'. */
17285 {
17286 /* Remember that we saw the `volatile' keyword. */
17288 /* Consume the token. */
17290 }
17294 {
17295 /* Remember that we saw the `goto' keyword. */
17297 /* Consume the token. */
17299 }
17300 /* Look for the opening `('. */
17303 /* Look for the string. */
17306 {
17310 }
17312 /* If we're allowing GNU extensions, check for the extended assembly
17313 syntax. Unfortunately, the `:' tokens need not be separated by
17314 a space in C, and so, for compatibility, we tolerate that here
17315 too. Doing that means that we have to treat the `::' operator as
17316 two `:' tokens. */
17321 {
17326 /* The extended syntax was used. */
17329 /* Look for outputs. */
17331 {
17332 /* Consume the `:'. */
17334 /* Parse the output-operands. */
17336 CPP_COLON)
17338 CPP_SCOPE)
17340 CPP_CLOSE_PAREN)
17346 }
17347 /* If the next token is `::', there are no outputs, and the
17348 next token is the beginning of the inputs. */
17350 /* The inputs are coming next. */
17353 /* Look for inputs. */
17356 {
17357 /* Consume the `:' or `::'. */
17359 /* Parse the output-operands. */
17361 CPP_COLON)
17363 CPP_SCOPE)
17365 CPP_CLOSE_PAREN))
17370 }
17372 /* The clobbers are coming next. */
17375 /* Look for clobbers. */
17378 {
17380 /* Consume the `:' or `::'. */
17382 /* Parse the clobbers. */
17384 CPP_COLON)
17386 CPP_CLOSE_PAREN))
17388 }
17391 /* The labels are coming next. */
17394 /* Look for labels. */
17397 {
17399 /* Consume the `:' or `::'. */
17401 /* Parse the labels. */
17403 }
17407 }
17411 /* Look for the closing `)'. */
17419 {
17420 /* Create the ASM_EXPR. */
17422 {
17425 /* If the extended syntax was not used, mark the ASM_EXPR. */
17427 {
17433 }
17434 }
17435 else
17437 }
17438 }
17440 /* Declarators [gram.dcl.decl] */
17442 /* Parse an init-declarator.
17444 init-declarator:
17445 declarator initializer [opt]
17447 GNU Extension:
17449 init-declarator:
17450 declarator asm-specification [opt] attributes [opt] initializer [opt]
17452 function-definition:
17453 decl-specifier-seq [opt] declarator ctor-initializer [opt]
17454 function-body
17455 decl-specifier-seq [opt] declarator function-try-block
17457 GNU Extension:
17459 function-definition:
17460 __extension__ function-definition
17462 TM Extension:
17464 function-definition:
17465 decl-specifier-seq [opt] declarator function-transaction-block
17467 The DECL_SPECIFIERS apply to this declarator. Returns a
17468 representation of the entity declared. If MEMBER_P is TRUE, then
17469 this declarator appears in a class scope. The new DECL created by
17470 this declarator is returned.
17472 The CHECKS are access checks that should be performed once we know
17473 what entity is being declared (and, therefore, what classes have
17474 befriended it).
17476 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
17477 for a function-definition here as well. If the declarator is a
17478 declarator for a function-definition, *FUNCTION_DEFINITION_P will
17479 be TRUE upon return. By that point, the function-definition will
17480 have been completely parsed.
17482 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
17483 is FALSE.
17485 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
17486 parsed declaration if it is an uninitialized single declarator not followed
17487 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
17488 if present, will not be consumed. If returned, this declarator will be
17489 created with SD_INITIALIZED but will not call cp_finish_decl.
17491 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
17492 and there is an initializer, the pointed location_t is set to the
17493 location of the '=' or `(', or '{' in C++11 token introducing the
17494 initializer. */
17496 static tree
17506 {
17510 tree prefix_attributes;
17512 tree asm_specification;
17513 tree initializer;
17515 tree scope;
17517 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
17518 initialized with "= ..", CPP_OPEN_PAREN if initialized with
17519 "(...)". */
17530 /* Gather the attributes that were provided with the
17531 decl-specifiers. */
17534 /* Assume that this is not the declarator for a function
17535 definition. */
17539 /* Default arguments are only permitted for function parameters. */
17543 /* Defer access checks while parsing the declarator; we cannot know
17544 what names are accessible until we know what is being
17545 declared. */
17548 /* Parse the declarator. */
17550 declarator
17555 /* Gather up the deferred checks. */
17560 /* If the DECLARATOR was erroneous, there's no need to go
17561 further. */
17565 /* Check that the number of template-parameter-lists is OK. */
17575 /* Figure out what scope the entity declared by the DECLARATOR is
17576 located in. `grokdeclarator' sometimes changes the scope, so
17577 we compute it now. */
17580 /* Perform any lookups in the declared type which were thought to be
17581 dependent, but are not in the scope of the declarator. */
17582 decl_specifiers->type
17585 /* If we're allowing GNU extensions, look for an
17586 asm-specification. */
17588 {
17589 /* Look for an asm-specification. */
17592 }
17593 else
17596 /* Look for attributes. */
17600 // Parse an optional trailing requires clause for the parsed declarator.
17602 /* Peek at the next token. */
17608 {
17609 /* Check to see if the token indicates the start of a
17610 function-definition. */
17612 {
17614 {
17615 /* If a function-definition should not appear here, issue an
17616 error message. */
17620 }
17622 location_t func_brace_location
17625 /* Neither attributes nor an asm-specification are allowed
17626 on a function-definition. */
17629 "an asm-specification is not allowed "
17633 "attributes are not allowed "
17635 /* This is a function-definition. */
17638 /* Parse the function definition. */
17641 decl_specifiers,
17642 declarator,
17643 prefix_attributes);
17644 else
17645 decl =
17646 (cp_parser_function_definition_from_specifiers_and_declarator
17650 {
17651 /* This is where the prologue starts... */
17654 }
17657 }
17658 }
17660 {
17661 /* A non-template declaration involving a function parameter list
17662 containing an implicit template parameter will be made into a
17663 template. If the resulting declaration is not going to be an
17664 actual function then finish the template scope here to prevent it.
17665 An error message will be issued once we have a decl to talk about.
17667 FIXME probably we should do type deduction rather than create an
17668 implicit template, but the standard currently doesn't allow it. */
17671 }
17673 /* [dcl.dcl]
17675 Only in function declarations for constructors, destructors, and
17676 type conversions can the decl-specifier-seq be omitted.
17678 We explicitly postpone this check past the point where we handle
17679 function-definitions because we tolerate function-definitions
17680 that are missing their return types in some modes. */
17682 {
17686 }
17688 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17692 {
17703 {
17709 }
17710 }
17711 else
17712 {
17713 /* If the init-declarator isn't initialized and isn't followed by a
17714 `,' or `;', it's not a valid init-declarator. */
17717 {
17720 else
17721 {
17725 }
17726 }
17729 }
17731 /* Because start_decl has side-effects, we should only call it if we
17732 know we're going ahead. By this point, we know that we cannot
17733 possibly be looking at any other construct. */
17736 /* Enter the newly declared entry in the symbol table. If we're
17737 processing a declaration in a class-specifier, we wait until
17738 after processing the initializer. */
17740 {
17747 /* Adjust location of decl if declarator->id_loc is more appropriate:
17748 set, and decl wasn't merged with another decl, in which case its
17749 location would be different from input_location, and more accurate. */
17754 }
17756 /* Enter the SCOPE. That way unqualified names appearing in the
17757 initializer will be looked up in SCOPE. */
17760 /* Perform deferred access control checks, now that we know in which
17761 SCOPE the declared entity resides. */
17763 {
17766 /* If the entity being declared is a function, pretend that we
17767 are in its scope. If it is a `friend', it may have access to
17768 things that would not otherwise be accessible. */
17770 {
17773 }
17775 /* Perform access checks for template parameters. */
17778 /* Perform the access control checks for the declarator and the
17779 decl-specifiers. */
17782 /* Restore the saved value. */
17785 }
17787 /* Parse the initializer. */
17792 {
17794 {
17797 else
17798 {
17799 /* If the declaration was erroneous, we don't really
17800 know what the user intended, so just silently
17801 consume the initializer. */
17808 }
17809 }
17810 else
17811 {
17812 /* We want to record the extra mangling scope for in-class
17813 initializers of class members and initializers of static data
17814 member templates. The former involves deferring
17815 parsing of the initializer until end of class as with default
17816 arguments. So right here we only handle the latter. */
17826 }
17827 }
17829 /* The old parser allows attributes to appear after a parenthesized
17830 initializer. Mark Mitchell proposed removing this functionality
17831 on the GCC mailing lists on 2002-08-13. This parser accepts the
17832 attributes -- but ignores them. */
17839 /* And now complain about a non-function implicit template. */
17844 /* For an in-class declaration, use `grokfield' to create the
17845 declaration. */
17847 {
17849 {
17852 }
17860 }
17862 /* Finish processing the declaration. But, skip member
17863 declarations. */
17865 {
17868 asm_specification,
17869 /* If the initializer is in parentheses, then this is
17870 a direct-initialization, which means that an
17871 `explicit' constructor is OK. Otherwise, an
17872 `explicit' constructor cannot be used. */
17875 }
17878 /* Core issue #226 (C++0x only): A default template-argument
17879 shall not be specified in a friend class template
17880 declaration. */
17889 {
17892 else
17894 }
17897 }
17899 /* Parse a declarator.
17901 declarator:
17902 direct-declarator
17903 ptr-operator declarator
17905 abstract-declarator:
17906 ptr-operator abstract-declarator [opt]
17907 direct-abstract-declarator
17909 GNU Extensions:
17911 declarator:
17912 attributes [opt] direct-declarator
17913 attributes [opt] ptr-operator declarator
17915 abstract-declarator:
17916 attributes [opt] ptr-operator abstract-declarator [opt]
17917 attributes [opt] direct-abstract-declarator
17919 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17920 detect constructor, destructor or conversion operators. It is set
17921 to -1 if the declarator is a name, and +1 if it is a
17922 function. Otherwise it is set to zero. Usually you just want to
17923 test for >0, but internally the negative value is used.
17925 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17926 a decl-specifier-seq unless it declares a constructor, destructor,
17927 or conversion. It might seem that we could check this condition in
17928 semantic analysis, rather than parsing, but that makes it difficult
17929 to handle something like `f()'. We want to notice that there are
17930 no decl-specifiers, and therefore realize that this is an
17931 expression, not a declaration.)
17933 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17934 the declarator is a direct-declarator of the form "(...)".
17936 MEMBER_P is true iff this declarator is a member-declarator.
17938 FRIEND_P is true iff this declarator is a friend. */
17942 cp_parser_declarator_kind dcl_kind,
17946 {
17949 cp_cv_quals cv_quals;
17950 tree class_type;
17953 /* Assume this is not a constructor, destructor, or type-conversion
17954 operator. */
17961 /* Check for the ptr-operator production. */
17963 /* Parse the ptr-operator. */
17969 /* If that worked, then we have a ptr-operator. */
17971 {
17972 /* If a ptr-operator was found, then this declarator was not
17973 parenthesized. */
17976 /* The dependent declarator is optional if we are parsing an
17977 abstract-declarator. */
17981 /* Parse the dependent declarator. */
17986 friend_p);
17988 /* If we are parsing an abstract-declarator, we must handle the
17989 case where the dependent declarator is absent. */
17994 declarator = cp_parser_make_indirect_declarator
17996 }
17997 /* Everything else is a direct-declarator. */
17998 else
17999 {
18002 CPP_OPEN_PAREN);
18004 ctor_dtor_or_conv_p,
18006 }
18012 }
18015 // A declarator may have a trailing requires clause. Because the
18016 // requires clause is part of the declarator the function parameters
18017 // are visibile in that expression.
18018 static tree
18020 {
18023 {
18030 }
18032 }
18034 /* Parse a declarator. See cp_parser_basic_declarator for details.
18036 In concepts, we allow a requires-clause to be parsed at
18037 after a function declarator. The program is ill-formed for
18038 any other kind of declarator.
18040 declarator:
18041 basic-declarator requires-clause [opt]
18043 basic-declarator:
18044 direct-declarator
18045 ptr-operator-declarator */
18049 cp_parser_declarator_kind dcl_kind,
18053 {
18056 ctor_dtor_or_conv_p,
18057 parenthesized_p,
18058 member_p,
18059 friend_p);
18063 // Parse the optional trailing requires clause. Note that
18064 // the requires clause is only valid for function declarators.
18066 {
18068 {
18071 }
18073 {
18076 }
18077 }
18079 }
18083 /* Parse a direct-declarator or direct-abstract-declarator.
18085 direct-declarator:
18086 declarator-id
18087 direct-declarator ( parameter-declaration-clause )
18088 cv-qualifier-seq [opt]
18089 ref-qualifier [opt]
18090 exception-specification [opt]
18091 direct-declarator [ constant-expression [opt] ]
18092 ( declarator )
18094 direct-abstract-declarator:
18095 direct-abstract-declarator [opt]
18096 ( parameter-declaration-clause )
18097 cv-qualifier-seq [opt]
18098 ref-qualifier [opt]
18099 exception-specification [opt]
18100 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18101 ( abstract-declarator )
18103 Returns a representation of the declarator. DCL_KIND is
18104 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18105 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18106 we are parsing a direct-declarator. It is
18107 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18108 of ambiguity we prefer an abstract declarator, as per
18109 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18110 as for cp_parser_declarator. */
18114 cp_parser_declarator_kind dcl_kind,
18117 {
18127 {
18128 /* Peek at the next token. */
18131 {
18132 /* This is either a parameter-declaration-clause, or a
18133 parenthesized declarator. When we know we are parsing a
18134 named declarator, it must be a parenthesized declarator
18135 if FIRST is true. For instance, `(int)' is a
18136 parameter-declaration-clause, with an omitted
18137 direct-abstract-declarator. But `((*))', is a
18138 parenthesized abstract declarator. Finally, when T is a
18139 template parameter `(T)' is a
18140 parameter-declaration-clause, and not a parenthesized
18141 named declarator.
18143 We first try and parse a parameter-declaration-clause,
18144 and then try a nested declarator (if FIRST is true).
18146 It is not an error for it not to be a
18147 parameter-declaration-clause, even when FIRST is
18148 false. Consider,
18150 int i (int);
18151 int i (3);
18153 The first is the declaration of a function while the
18154 second is the definition of a variable, including its
18155 initializer.
18157 Having seen only the parenthesis, we cannot know which of
18158 these two alternatives should be selected. Even more
18159 complex are examples like:
18161 int i (int (a));
18162 int i (int (3));
18164 The former is a function-declaration; the latter is a
18165 variable initialization.
18167 Thus again, we try a parameter-declaration-clause, and if
18168 that fails, we back out and return. */
18171 {
18172 tree params;
18175 /* In a member-declarator, the only valid interpretation
18176 of a parenthesis is the start of a
18177 parameter-declaration-clause. (It is invalid to
18178 initialize a static data member with a parenthesized
18179 initializer; only the "=" form of initialization is
18180 permitted.) */
18184 /* Consume the `('. */
18187 {
18188 /* If this is going to be an abstract declarator, we're
18189 in a declarator and we can't have default args. */
18192 }
18196 /* Parse the parameter-declaration-clause. */
18199 /* Consume the `)'. */
18202 /* If all went well, parse the cv-qualifier-seq,
18203 ref-qualifier and the exception-specification. */
18205 {
18206 cp_cv_quals cv_quals;
18207 cp_virt_specifiers virt_specifiers;
18208 cp_ref_qualifier ref_qual;
18209 tree exception_specification;
18210 tree late_return;
18211 tree attrs;
18221 /* Parse the cv-qualifier-seq. */
18223 /* Parse the ref-qualifier. */
18225 /* And the exception-specification. */
18226 exception_specification
18231 /* In here, we handle cases where attribute is used after
18232 the function declaration. For example:
18233 void func (int x) __attribute__((vector(..))); */
18236 {
18240 CPP_SEMICOLON)
18242 CPP_OPEN_BRACE))
18245 ;
18246 else
18248 }
18249 late_return = (cp_parser_late_return_type_opt
18254 /* Parse the virt-specifier-seq. */
18257 /* Create the function-declarator. */
18259 params,
18260 cv_quals,
18261 virt_specifiers,
18262 ref_qual,
18263 exception_specification,
18264 late_return,
18267 /* Any subsequent parameter lists are to do with
18268 return type, so are not those of the declared
18269 function. */
18271 }
18273 /* Remove the function parms from scope. */
18277 /* Repeat the main loop. */
18279 }
18281 /* If this is the first, we can try a parenthesized
18282 declarator. */
18284 {
18290 /* Consume the `('. */
18292 /* Parse the nested declarator. */
18295 declarator
18301 /* Expect a `)'. */
18308 }
18309 /* Otherwise, we must be done. */
18310 else
18312 }
18316 {
18317 /* Parse an array-declarator. */
18326 /* Consume the `['. */
18328 /* Peek at the next token. */
18330 /* If the next token is `]', then there is no
18331 constant-expression. */
18333 {
18335 bounds
18345 {
18346 /* Normally, the array bound must be an integral constant
18347 expression. However, as an extension, we allow VLAs
18348 in function scopes as long as they aren't part of a
18349 parameter declaration. */
18353 }
18356 {
18357 /* Remember this wasn't a constant-expression. */
18360 }
18361 }
18362 else
18364 /* Look for the closing `]'. */
18366 {
18369 }
18374 }
18376 {
18377 {
18378 tree qualifying_scope;
18379 tree unqualified_name;
18380 tree attrs;
18381 special_function_kind sfk;
18386 /* Parse a declarator-id */
18389 {
18392 /* If we see an ellipsis, we should be looking at a
18393 parameter pack. */
18395 {
18396 /* Consume the `...' */
18400 }
18401 }
18404 unqualified_name
18408 {
18412 {
18413 /* Check whether an error occurred. */
18416 /* We already consumed the ellipsis to mark a
18417 parameter pack, but we have no way to report it,
18418 so abort the tentative parse. We will be exiting
18419 immediately anyway. */
18421 }
18422 else
18428 && (qualifying_scope
18430 {
18433 }
18434 }
18439 {
18444 }
18450 {
18451 /* In the declaration of a member of a template class
18452 outside of the class itself, the SCOPE will sometimes
18453 be a TYPENAME_TYPE. For example, given:
18455 template <typename T>
18456 int S<T>::R::i = 3;
18458 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
18459 this context, we must resolve S<T>::R to an ordinary
18460 type, rather than a typename type.
18462 The reason we normally avoid resolving TYPENAME_TYPEs
18463 is that a specialization of `S' might render
18464 `S<T>::R' not a type. However, if `S' is
18465 specialized, then this `i' will not be used, so there
18466 is no harm in resolving the types here. */
18467 tree type;
18469 /* Resolve the TYPENAME_TYPE. */
18472 /* If that failed, the declarator is invalid. */
18474 {
18477 "cannot define member of dependent typedef "
18479 else
18484 }
18486 }
18491 {
18492 tree class_type;
18497 else
18501 {
18504 {
18507 {
18511 "use %<%T::%D%> instead of %<%T::%D%> to "
18513 class_type,
18518 }
18519 else
18521 }
18522 else
18523 {
18524 /* We do not attempt to print the declarator
18525 here because we do not have enough
18526 information about its original syntactic
18527 form. */
18531 }
18532 }
18535 {
18541 for an anonymous type, even if the type
18542 got a name for linkage purposes. */
18544 /* Handle correctly (c++/19200):
18546 struct S {
18547 struct T{};
18548 friend void S(T);
18549 };
18551 and also:
18553 namespace N {
18554 void S();
18555 }
18557 struct S {
18558 friend void N::S();
18559 }; */
18560 && !(friend_p
18563 class_type))
18564 {
18567 }
18575 }
18576 }
18578 unqualified_name,
18579 sfk);
18586 }
18588 handle_declarator:;
18591 {
18592 /* Any names that appear after the declarator-id for a
18593 member are looked up in the containing scope. */
18595 {
18596 /* But declarations with qualified-ids can't appear in a
18597 function. */
18601 }
18603 }
18607 /* Default args are only allowed on function
18608 declarations. */
18610 else
18614 }
18615 /* We're done. */
18616 else
18618 }
18620 /* For an abstract declarator, we might wind up with nothing at this
18621 point. That's an error; the declarator is not optional. */
18625 /* If we entered a scope, we must exit it now. */
18633 }
18635 /* Parse a ptr-operator.
18637 ptr-operator:
18638 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18639 * cv-qualifier-seq [opt]
18640 &
18641 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18642 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18644 GNU Extension:
18646 ptr-operator:
18647 & cv-qualifier-seq [opt]
18649 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18650 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18651 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18652 filled in with the TYPE containing the member. *CV_QUALS is
18653 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18654 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18655 Note that the tree codes returned by this function have nothing
18656 to do with the types of trees that will be eventually be created
18657 to represent the pointer or reference type being parsed. They are
18658 just constants with suggestive names. */
18659 static enum tree_code
18664 {
18669 /* Assume that it's not a pointer-to-member. */
18671 /* And that there are no cv-qualifiers. */
18674 /* Peek at the next token. */
18677 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18687 {
18688 /* Consume the `*', `&' or `&&'. */
18691 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18692 `&', if we are allowing GNU extensions. (The only qualifier
18693 that can legally appear after `&' is `restrict', but that is
18694 enforced during semantic analysis. */
18702 }
18703 else
18704 {
18705 /* Try the pointer-to-member case. */
18707 /* Look for the optional `::' operator. */
18710 /* Look for the nested-name specifier. */
18717 /* If we found it, and the next token is a `*', then we are
18718 indeed looking at a pointer-to-member operator. */
18721 {
18722 /* Indicate that the `*' operator was used. */
18730 else
18731 {
18732 /* The type of which the member is a member is given by the
18733 current SCOPE. */
18735 /* The next name will not be qualified. */
18739 /* Look for optional c++11 attributes. */
18743 /* Look for the optional cv-qualifier-seq. */
18745 }
18746 }
18747 /* If that didn't work we don't have a ptr-operator. */
18750 }
18753 }
18755 /* Parse an (optional) cv-qualifier-seq.
18757 cv-qualifier-seq:
18758 cv-qualifier cv-qualifier-seq [opt]
18760 cv-qualifier:
18761 const
18762 volatile
18764 GNU Extension:
18766 cv-qualifier:
18767 __restrict__
18769 Returns a bitmask representing the cv-qualifiers. */
18771 static cp_cv_quals
18773 {
18777 {
18779 cp_cv_quals cv_qualifier;
18781 /* Peek at the next token. */
18783 /* See if it's a cv-qualifier. */
18785 {
18801 }
18807 {
18810 }
18811 else
18812 {
18815 }
18816 }
18819 }
18821 /* Parse an (optional) ref-qualifier
18823 ref-qualifier:
18824 &
18825 &&
18827 Returns cp_ref_qualifier representing ref-qualifier. */
18829 static cp_ref_qualifier
18831 {
18834 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18839 {
18844 {
18856 }
18861 {
18864 }
18865 else
18866 {
18869 }
18870 }
18873 }
18875 /* Parse an (optional) virt-specifier-seq.
18877 virt-specifier-seq:
18878 virt-specifier virt-specifier-seq [opt]
18880 virt-specifier:
18881 override
18882 final
18884 Returns a bitmask representing the virt-specifiers. */
18886 static cp_virt_specifiers
18888 {
18892 {
18894 cp_virt_specifiers virt_specifier;
18896 /* Peek at the next token. */
18898 /* See if it's a virt-specifier-qualifier. */
18902 {
18905 }
18907 {
18910 }
18912 {
18914 }
18915 else
18919 {
18922 }
18923 else
18924 {
18927 }
18928 }
18930 }
18932 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18933 is in scope even though it isn't real. */
18935 void
18937 {
18938 tree this_parm;
18941 {
18942 /* We don't clear this between NSDMIs. Is it already what we want? */
18947 }
18950 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18952 current_class_ref
18955 }
18957 /* Return true iff our current scope is a non-static data member
18958 initializer. */
18960 bool
18962 {
18963 /* We recognize NSDMI context by the context-less 'this' pointer set up
18964 by the function above. */
18970 }
18972 /* Parse a late-specified return type, if any. This is not a separate
18973 non-terminal, but part of a function declarator, which looks like
18975 -> trailing-type-specifier-seq abstract-declarator(opt)
18977 Returns the type indicated by the type-id.
18979 In addition to this this parses any queued up omp declare simd
18980 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18982 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18983 function. */
18985 static tree
18987 cp_cv_quals quals)
18988 {
18992 && declarator
18998 /* Peek at the next token. */
19000 /* A late-specified return type is indicated by an initial '->'. */
19007 {
19008 /* DR 1207: 'this' is in scope in the trailing return type. */
19010 }
19013 {
19014 /* Consume the ->. */
19017 }
19020 declarator->std_attributes
19024 declarator->std_attributes
19029 {
19032 }
19035 }
19037 /* Parse a declarator-id.
19039 declarator-id:
19040 id-expression
19041 :: [opt] nested-name-specifier [opt] type-name
19043 In the `id-expression' case, the value returned is as for
19044 cp_parser_id_expression if the id-expression was an unqualified-id.
19045 If the id-expression was a qualified-id, then a SCOPE_REF is
19046 returned. The first operand is the scope (either a NAMESPACE_DECL
19047 or TREE_TYPE), but the second is still just a representation of an
19048 unqualified-id. */
19050 static tree
19052 {
19053 tree id;
19054 /* The expression must be an id-expression. Assume that qualified
19055 names are the names of types so that:
19057 template <class T>
19058 int S<T>::R::i = 3;
19060 will work; we must treat `S<T>::R' as the name of a type.
19061 Similarly, assume that qualified names are templates, where
19062 required, so that:
19064 template <class T>
19065 int S<T>::R<T>::i = 3;
19067 will work, too. */
19073 optional_p);
19077 }
19079 /* Parse a type-id.
19081 type-id:
19082 type-specifier-seq abstract-declarator [opt]
19084 Returns the TYPE specified. */
19086 static tree
19089 {
19090 cp_decl_specifier_seq type_specifier_seq;
19093 /* Parse the type-specifier-seq. */
19095 is_trailing_return,
19100 /* There might or might not be an abstract declarator. */
19102 /* Look for the declarator. */
19103 abstract_declarator
19108 /* Check to see if there really was a declarator. */
19113 /* None of the valid uses of 'auto' in C++14 involve the type-id
19114 nonterminal, but it is valid in a trailing-return-type. */
19117 {
19118 /* A type-id with type 'auto' is only ok if the abstract declarator
19119 is a function declarator with a late-specified return type.
19121 A type-id with 'auto' is also valid in a trailing-return-type
19122 in a compound-requirment. */
19129 else
19130 {
19133 }
19134 }
19137 is_template_arg);
19138 }
19141 {
19143 }
19146 {
19147 tree r;
19149 parser->type_definition_forbidden_message
19154 {
19157 }
19159 }
19162 {
19164 }
19166 /* Parse a type-specifier-seq.
19168 type-specifier-seq:
19169 type-specifier type-specifier-seq [opt]
19171 GNU extension:
19173 type-specifier-seq:
19174 attributes type-specifier-seq [opt]
19176 If IS_DECLARATION is true, we are at the start of a "condition" or
19177 exception-declaration, so we might be followed by a declarator-id.
19179 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19180 i.e. we've just seen "->".
19182 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
19184 static void
19189 {
19194 /* Clear the TYPE_SPECIFIER_SEQ. */
19197 /* In the context of a trailing return type, enum E { } is an
19198 elaborated-type-specifier followed by a function-body, not an
19199 enum-specifier. */
19203 /* Parse the type-specifiers and attributes. */
19205 {
19206 tree type_specifier;
19209 /* Check for attributes first. */
19211 {
19216 }
19218 /* record the token of the beginning of the type specifier seq,
19219 for error reporting purposes*/
19223 /* Look for the type-specifier. */
19225 flags,
19226 type_specifier_seq,
19228 NULL,
19231 {
19232 /* If the first type-specifier could not be found, this is not a
19233 type-specifier-seq at all. */
19235 {
19236 /* Set in_declarator_p to avoid skipping to the semicolon. */
19248 }
19249 /* If subsequent type-specifiers could not be found, the
19250 type-specifier-seq is complete. */
19252 }
19255 /* The standard says that a condition can be:
19257 type-specifier-seq declarator = assignment-expression
19259 However, given:
19261 struct S {};
19262 if (int S = ...)
19264 we should treat the "S" as a declarator, not as a
19265 type-specifier. The standard doesn't say that explicitly for
19266 type-specifier-seq, but it does say that for
19267 decl-specifier-seq in an ordinary declaration. Perhaps it
19268 would be clearer just to allow a decl-specifier-seq here, and
19269 then add a semantic restriction that if any decl-specifiers
19270 that are not type-specifiers appear, the program is invalid. */
19273 }
19274 }
19276 /* Return whether the function currently being declared has an associated
19277 template parameter list. */
19279 static bool
19281 {
19294 }
19296 /* Parse a parameter-declaration-clause.
19298 parameter-declaration-clause:
19299 parameter-declaration-list [opt] ... [opt]
19300 parameter-declaration-list , ...
19302 Returns a representation for the parameter declarations. A return
19303 value of NULL indicates a parameter-declaration-clause consisting
19304 only of an ellipsis. */
19306 static tree
19308 {
19309 tree parameters;
19318 parser->auto_is_implicit_function_template_parm_p
19320 }
19326 && !processing_template_parmlist
19332 /* Peek at the next token. */
19334 /* Check for trivial parameter-declaration-clauses. */
19336 {
19337 /* Consume the `...' token. */
19340 }
19342 /* There are no parameters. */
19343 {
19344 #ifndef NO_IMPLICIT_EXTERN_C
19349 else
19350 #endif
19352 }
19353 /* Check for `(void)', too, which is a special case. */
19357 {
19358 /* Consume the `void' token. */
19360 /* There are no parameters. */
19362 }
19364 /* Parse the parameter-declaration-list. */
19366 /* If a parse error occurred while parsing the
19367 parameter-declaration-list, then the entire
19368 parameter-declaration-clause is erroneous. */
19372 /* Peek at the next token. */
19374 /* If it's a `,', the clause should terminate with an ellipsis. */
19376 {
19377 /* Consume the `,'. */
19379 /* Expect an ellipsis. */
19380 ellipsis_p
19382 }
19383 /* It might also be `...' if the optional trailing `,' was
19384 omitted. */
19386 {
19387 /* Consume the `...' token. */
19389 /* And remember that we saw it. */
19391 }
19392 else
19395 /* Finish the parameter list. */
19400 }
19402 /* Parse a parameter-declaration-list.
19404 parameter-declaration-list:
19405 parameter-declaration
19406 parameter-declaration-list , parameter-declaration
19408 Returns a representation of the parameter-declaration-list, as for
19409 cp_parser_parameter_declaration_clause. However, the
19410 `void_list_node' is never appended to the list. Upon return,
19411 *IS_ERROR will be true iff an error occurred. */
19413 static tree
19415 {
19421 /* Assume all will go well. */
19423 /* The special considerations that apply to a function within an
19424 unbraced linkage specifications do not apply to the parameters
19425 to the function. */
19426 saved_in_unbraced_linkage_specification_p
19430 /* Look for more parameters. */
19432 {
19440 /* Parse the parameter. */
19441 parameter
19446 /* We don't know yet if the enclosing context is deprecated, so wait
19447 and warn in grokparms if appropriate. */
19451 {
19452 /* If a function parameter pack was specified and an implicit template
19453 parameter was introduced during cp_parser_parameter_declaration,
19454 change any implicit parameters introduced into packs. */
19458 {
19466 }
19470 PARM,
19473 }
19477 /* If a parse error occurred parsing the parameter declaration,
19478 then the entire parameter-declaration-list is erroneous. */
19480 {
19484 }
19494 {
19498 }
19500 /* Add the new parameter to the list. */
19504 /* Peek at the next token. */
19507 /* These are for Objective-C++ */
19510 /* The parameter-declaration-list is complete. */
19513 {
19516 /* Peek at the next token. */
19518 /* If it's an ellipsis, then the list is complete. */
19521 /* Otherwise, there must be more parameters. Consume the
19522 `,'. */
19524 /* When parsing something like:
19526 int i(float f, double d)
19528 we can tell after seeing the declaration for "f" that we
19529 are not looking at an initialization of a variable "i",
19530 but rather at the declaration of a function "i".
19532 Due to the fact that the parsing of template arguments
19533 (as specified to a template-id) requires backtracking we
19534 cannot use this technique when inside a template argument
19535 list. */
19539 /* However, a parameter-declaration of the form
19540 "float(f)" (which is a valid declaration of a
19541 parameter "f") can also be interpreted as an
19542 expression (the conversion of "f" to "float"). */
19545 }
19546 else
19547 {
19555 }
19556 }
19558 parser->in_unbraced_linkage_specification_p
19561 /* Reset implicit_template_scope if we are about to leave the function
19562 parameter list that introduced it. Note that for out-of-line member
19563 definitions, there will be one or more class scopes before we get to
19564 the template parameter scope. */
19568 {
19572 {
19575 }
19576 }
19579 }
19581 /* Parse a parameter declaration.
19583 parameter-declaration:
19584 decl-specifier-seq ... [opt] declarator
19585 decl-specifier-seq declarator = assignment-expression
19586 decl-specifier-seq ... [opt] abstract-declarator [opt]
19587 decl-specifier-seq abstract-declarator [opt] = assignment-expression
19589 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
19590 declares a template parameter. (In that case, a non-nested `>'
19591 token encountered during the parsing of the assignment-expression
19592 is not interpreted as a greater-than operator.)
19594 Returns a representation of the parameter, or NULL if an error
19595 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
19596 true iff the declarator is of the form "(p)". */
19602 {
19604 cp_decl_specifier_seq decl_specifiers;
19606 tree default_argument;
19610 /* In a template parameter, `>' is not an operator.
19612 [temp.param]
19614 When parsing a default template-argument for a non-type
19615 template-parameter, the first non-nested `>' is taken as the end
19616 of the template parameter-list rather than a greater-than
19617 operator. */
19619 /* Type definitions may not appear in parameter types. */
19621 parser->type_definition_forbidden_message
19624 /* Parse the declaration-specifiers. */
19626 CP_PARSER_FLAGS_NONE,
19630 /* Complain about missing 'typename' or other invalid type names. */
19635 /* If an error occurred, there's no reason to attempt to parse the
19636 rest of the declaration. */
19638 {
19641 }
19643 /* Peek at the next token. */
19646 /* If the next token is a `)', `,', `=', `>', or `...', then there
19647 is no declarator. However, when variadic templates are enabled,
19648 there may be a declarator following `...'. */
19653 {
19657 }
19658 /* Otherwise, there should be a declarator. */
19659 else
19660 {
19664 /* After seeing a decl-specifier-seq, if the next token is not a
19665 "(", there is no possibility that the code is a valid
19666 expression. Therefore, if parsing tentatively, we commit at
19667 this point. */
19669 /* In an expression context, having seen:
19671 (int((char ...
19673 we cannot be sure whether we are looking at a
19674 function-type (taking a "char" as a parameter) or a cast
19675 of some object of type "char" to "int". */
19681 /* Parse the declarator. */
19684 CP_PARSER_DECLARATOR_EITHER,
19686 parenthesized_p,
19690 /* After the declarator, allow more attributes. */
19691 decl_specifiers.attributes
19694 }
19696 /* If the next token is an ellipsis, and we have not seen a
19697 declarator name, and the type of the declarator contains parameter
19698 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19699 a parameter pack expansion expression. Otherwise, leave the
19700 ellipsis for a C-style variadic function. */
19703 {
19714 {
19715 /* Consume the `...'. */
19719 /* Build a pack expansion type */
19722 else
19724 }
19725 }
19727 /* The restriction on defining new types applies only to the type
19728 of the parameter, not to the default argument. */
19731 /* If the next token is `=', then process a default argument. */
19733 {
19736 /* If we are defining a class, then the tokens that make up the
19737 default argument must be saved and processed later. */
19743 // A constrained-type-specifier may declare a type template-parameter.
19745 default_argument
19748 // A constrained-type-specifier may declare a template-template-parameter.
19750 default_argument
19753 /* Outside of a class definition, we can just parse the
19754 assignment-expression. */
19755 else
19756 default_argument
19760 {
19763 else
19764 {
19766 "default arguments are only "
19769 }
19770 }
19774 {
19775 /* Find the name of the parameter pack. */
19782 template_parm_p
19788 else
19790 template_parm_p
19797 }
19798 }
19799 else
19803 declarator,
19804 default_argument);
19805 }
19807 /* Parse a default argument and return it.
19809 TEMPLATE_PARM_P is true if this is a default argument for a
19810 non-type template parameter. */
19811 static tree
19813 {
19819 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19820 set correctly. */
19823 /* Local variable names (and the `this' keyword) may not
19824 appear in a default argument. */
19827 /* Parse the assignment-expression. */
19832 /* The "this" pointer is not valid in a default argument. */
19834 {
19839 }
19840 default_argument
19842 /* Restore the "this" pointer. */
19844 {
19847 }
19856 }
19858 /* Parse a function-body.
19860 function-body:
19861 compound_statement */
19863 static void
19865 {
19867 }
19869 /* Parse a ctor-initializer-opt followed by a function-body. Return
19870 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19871 is true we are parsing a function-try-block. */
19873 static bool
19876 {
19884 /* Begin the function body. */
19886 /* Parse the optional ctor-initializer. */
19889 /* If we're parsing a constexpr constructor definition, we need
19890 to check that the constructor body is indeed empty. However,
19891 before we get to cp_parser_function_body lot of junk has been
19892 generated, so we can't just check that we have an empty block.
19893 Rather we take a snapshot of the outermost block, and check whether
19894 cp_parser_function_body changed its state. */
19896 {
19900 }
19901 /* Parse the function-body. */
19905 /* Finish the function body. */
19909 }
19911 /* Parse an initializer.
19913 initializer:
19914 = initializer-clause
19915 ( expression-list )
19917 Returns an expression representing the initializer. If no
19918 initializer is present, NULL_TREE is returned.
19920 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19921 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19922 set to TRUE if there is no initializer present. If there is an
19923 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19924 is set to true; otherwise it is set to false. */
19926 static tree
19929 {
19931 tree init;
19933 /* Peek at the next token. */
19936 /* Let our caller know whether or not this initializer was
19937 parenthesized. */
19939 /* Assume that the initializer is constant. */
19943 {
19944 /* Consume the `='. */
19946 /* Parse the initializer-clause. */
19948 }
19950 {
19955 non_constant_p);
19960 }
19962 {
19967 }
19968 else
19969 {
19970 /* Anything else is an error. */
19973 }
19976 }
19978 /* Parse an initializer-clause.
19980 initializer-clause:
19981 assignment-expression
19982 braced-init-list
19984 Returns an expression representing the initializer.
19986 If the `assignment-expression' production is used the value
19987 returned is simply a representation for the expression.
19989 Otherwise, calls cp_parser_braced_list. */
19991 static tree
19993 {
19994 tree initializer;
19996 /* Assume the expression is constant. */
19999 /* If it is not a `{', then we are looking at an
20000 assignment-expression. */
20002 {
20003 initializer
20006 non_constant_p);
20007 }
20008 else
20012 }
20014 /* Parse a brace-enclosed initializer list.
20016 braced-init-list:
20017 { initializer-list , [opt] }
20018 { }
20020 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20021 the elements of the initializer-list (or NULL, if the last
20022 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20023 NULL_TREE. There is no way to detect whether or not the optional
20024 trailing `,' was provided. NON_CONSTANT_P is as for
20025 cp_parser_initializer. */
20027 static tree
20029 {
20030 tree initializer;
20032 /* Consume the `{' token. */
20034 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20036 /* If it's not a `}', then there is a non-trivial initializer. */
20038 {
20039 /* Parse the initializer list. */
20042 /* A trailing `,' token is allowed. */
20045 }
20046 else
20048 /* Now, there should be a trailing `}'. */
20052 }
20054 /* Consume tokens up to, and including, the next non-nested closing `]'.
20055 Returns true iff we found a closing `]'. */
20057 static bool
20059 {
20063 {
20067 {
20070 /* If we've run out of tokens, then there is no closing `]'. */
20079 {
20082 }
20087 }
20089 /* Consume the token. */
20091 }
20092 }
20094 /* Return true if we are looking at an array-designator, false otherwise. */
20096 static bool
20098 {
20099 /* Consume the `['. */
20104 /* Skip tokens until the next token is a closing square bracket.
20105 If we find the closing `]', and the next token is a `=', then
20106 we are looking at an array designator. */
20107 bool array_designator_p
20111 /* Roll back the tokens we skipped. */
20115 }
20117 /* Parse an initializer-list.
20119 initializer-list:
20120 initializer-clause ... [opt]
20121 initializer-list , initializer-clause ... [opt]
20123 GNU Extension:
20125 initializer-list:
20126 designation initializer-clause ...[opt]
20127 initializer-list , designation initializer-clause ...[opt]
20129 designation:
20130 . identifier =
20131 identifier :
20132 [ constant-expression ] =
20134 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20135 for the initializer. If the INDEX of the elt is non-NULL, it is the
20136 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20137 as for cp_parser_initializer. */
20141 {
20144 /* Assume all of the expressions are constant. */
20147 /* Parse the rest of the list. */
20149 {
20151 tree designator;
20152 tree initializer;
20155 /* If the next token is an identifier and the following one is a
20156 colon, we are looking at the GNU designated-initializer
20157 syntax. */
20161 {
20162 /* Warn the user that they are using an extension. */
20165 /* Consume the identifier. */
20167 /* Consume the `:'. */
20169 }
20170 /* Also handle the C99 syntax, '. id ='. */
20175 {
20176 /* Warn the user that they are using an extension. */
20179 /* Consume the `.'. */
20181 /* Consume the identifier. */
20183 /* Consume the `='. */
20185 }
20186 /* Also handle C99 array designators, '[ const ] ='. */
20190 {
20191 /* In C++11, [ could start a lambda-introducer. */
20197 {
20200 }
20201 else
20202 {
20207 }
20213 }
20214 else
20217 /* Parse the initializer. */
20220 /* If any clause is non-constant, so is the entire initializer. */
20224 /* If we have an ellipsis, this is an initializer pack
20225 expansion. */
20227 {
20228 /* Consume the `...'. */
20231 /* Turn the initializer into an initializer expansion. */
20233 }
20235 /* Add it to the vector. */
20238 /* If the next token is not a comma, we have reached the end of
20239 the list. */
20243 /* Peek at the next token. */
20245 /* If the next token is a `}', then we're still done. An
20246 initializer-clause can have a trailing `,' after the
20247 initializer-list and before the closing `}'. */
20251 /* Consume the `,' token. */
20253 }
20256 }
20258 /* Classes [gram.class] */
20260 /* Parse a class-name.
20262 class-name:
20263 identifier
20264 template-id
20266 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
20267 to indicate that names looked up in dependent types should be
20268 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
20269 keyword has been used to indicate that the name that appears next
20270 is a template. TAG_TYPE indicates the explicit tag given before
20271 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
20272 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
20273 is the class being defined in a class-head.
20275 Returns the TYPE_DECL representing the class. */
20277 static tree
20285 {
20286 tree decl;
20287 tree scope;
20292 /* All class-names start with an identifier. */
20295 {
20298 }
20300 /* PARSER->SCOPE can be cleared when parsing the template-arguments
20301 to a template-id, so we save it here. */
20306 /* Any name names a type if we're following the `typename' keyword
20307 in a qualified name where the enclosing scope is type-dependent. */
20310 /* Handle the common case (an identifier, but not a template-id)
20311 efficiently. */
20314 {
20318 /* Look for the identifier. */
20322 /* If the next token isn't an identifier, we are certainly not
20323 looking at a class-name. */
20326 /* If we know this is a type-name, there's no need to look it
20327 up. */
20330 else
20331 {
20332 tree ambiguous_decls;
20333 /* If we already know that this lookup is ambiguous, then
20334 we've already issued an error message; there's no reason
20335 to check again. */
20337 {
20340 }
20341 /* If the next token is a `::', then the name must be a type
20342 name.
20344 [basic.lookup.qual]
20346 During the lookup for a name preceding the :: scope
20347 resolution operator, object, function, and enumerator
20348 names are ignored. */
20351 /* Look up the name. */
20353 tag_type,
20356 check_dependency_p,
20360 {
20364 }
20365 }
20366 }
20367 else
20368 {
20369 /* Try a template-id. */
20371 check_dependency_p,
20372 tag_type,
20373 is_declaration);
20376 }
20380 /* If this is a typename, create a TYPENAME_TYPE. */
20382 {
20387 }
20391 /* Check to see that it is really the name of a class. */
20395 /* Situations like this:
20397 template <typename T> struct A {
20398 typename T::template X<int>::I i;
20399 };
20401 are problematic. Is `T::template X<int>' a class-name? The
20402 standard does not seem to be definitive, but there is no other
20403 valid interpretation of the following `::'. Therefore, those
20404 names are considered class-names. */
20405 {
20409 }
20413 /* In Objective-C 2.0, a classname followed by '.' starts a
20414 dot-syntax expression, and it's not a type-name. */
20426 }
20428 /* Parse a class-specifier.
20430 class-specifier:
20431 class-head { member-specification [opt] }
20433 Returns the TREE_TYPE representing the class. */
20435 static tree
20437 {
20438 tree type;
20452 /* Parse the class-head. */
20456 /* If the class-head was a semantic disaster, skip the entire body
20457 of the class. */
20459 {
20463 }
20465 /* Look for the `{'. */
20467 {
20470 }
20474 /* Issue an error message if type-definitions are forbidden here. */
20476 /* Remember that we are defining one more class. */
20478 /* Inside the class, surrounding template-parameter-lists do not
20479 apply. */
20480 saved_num_template_parameter_lists
20483 /* We are not in a function body. */
20486 /* Or in a loop. */
20489 /* Or in a switch. */
20492 /* We are not immediately inside an extern "lang" block. */
20493 saved_in_unbraced_linkage_specification_p
20497 // Associate constraints with the type.
20501 /* Start the class. */
20503 {
20506 }
20510 /* If the type is erroneous, skip the entire body of the class. */
20512 else
20513 /* Parse the member-specification. */
20516 /* Look for the trailing `}'. */
20518 /* Look for trailing attributes to apply to this class. */
20526 /* We've finished a type definition. Check for the common syntax
20527 error of forgetting a semicolon after the definition. We need to
20528 be careful, as we can't just check for not-a-semicolon and be done
20529 with it; the user might have typed:
20531 class X { } c = ...;
20532 class X { } *p = ...;
20534 and so forth. Instead, enumerate all the possible tokens that
20535 might follow this production; if we don't see one of them, then
20536 complain and silently insert the semicolon. */
20537 {
20542 /* Don't try to parse c++11 attributes here. As per the
20543 grammar, that should be a task for
20544 cp_parser_decl_specifier_seq. */
20548 {
20559 /* While it's legal for type qualifiers and storage class
20560 specifiers to follow type definitions in the grammar, only
20561 compiler testsuites contain code like that. Assume that if
20562 we see such code, then what we're really seeing is a case
20563 like:
20565 class X { }
20566 const <type> var = ...;
20568 or
20570 class Y { }
20571 static <type> func (...) ...
20573 i.e. the qualifier or specifier applies to the next
20574 declaration. To do so, however, we need to look ahead one
20575 more token to see if *that* token is a type specifier.
20577 This code could be improved to handle:
20579 class Z { }
20580 static const <type> var = ...; */
20583 {
20586 /* Handling user-defined types here would be nice, but very
20587 tricky. */
20588 want_semicolon
20591 }
20595 }
20597 /* If we don't have a type, then something is very wrong and we
20598 shouldn't try to do anything clever. Likewise for not seeing the
20599 closing brace. */
20601 {
20602 cp_token_position prev
20613 else
20616 /* Unget one token and smash it to look as though we encountered
20617 a semicolon in the input stream. */
20622 }
20623 }
20625 /* If this class is not itself within the scope of another class,
20626 then we need to parse the bodies of all of the queued function
20627 definitions. Note that the queued functions defined in a class
20628 are not always processed immediately following the
20629 class-specifier for that class. Consider:
20631 struct A {
20632 struct B { void f() { sizeof (A); } };
20633 };
20635 If `f' were processed before the processing of `A' were
20636 completed, there would be no way to compute the size of `A'.
20637 Note that the nesting we are interested in here is lexical --
20638 not the semantic nesting given by TYPE_CONTEXT. In particular,
20639 for:
20641 struct A { struct B; };
20642 struct A::B { void f() { } };
20644 there is no need to delay the parsing of `A::B::f'. */
20646 {
20647 tree decl;
20654 /* In a first pass, parse default arguments to the functions.
20655 Then, in a second pass, parse the bodies of the functions.
20656 This two-phased approach handles cases like:
20658 struct S {
20659 void f() { g(); }
20660 void g(int i = 3);
20661 };
20663 */
20665 {
20667 /* If there are default arguments that have not yet been processed,
20668 take care of them now. */
20670 {
20675 }
20676 /* Make sure that any template parameters are in scope. */
20678 /* Parse the default argument expressions. */
20680 /* Remove any template parameters from the symbol table. */
20682 }
20684 /* Now parse any NSDMIs. */
20688 {
20690 {
20695 }
20698 }
20705 /* Now do some post-NSDMI bookkeeping. */
20711 /* Now parse the body of the functions. */
20713 {
20714 /* OpenMP UDRs need to be parsed before all other functions. */
20721 }
20722 else
20726 }
20727 else
20730 /* Put back any saved access checks. */
20733 /* Restore saved state. */
20737 parser->num_template_parameter_lists
20739 parser->in_unbraced_linkage_specification_p
20743 }
20745 static tree
20747 {
20748 tree ret;
20753 }
20755 /* Parse a class-head.
20757 class-head:
20758 class-key identifier [opt] base-clause [opt]
20759 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20760 class-key nested-name-specifier [opt] template-id
20761 base-clause [opt]
20763 class-virt-specifier:
20764 final
20766 GNU Extensions:
20767 class-key attributes identifier [opt] base-clause [opt]
20768 class-key attributes nested-name-specifier identifier base-clause [opt]
20769 class-key attributes nested-name-specifier [opt] template-id
20770 base-clause [opt]
20772 Upon return BASES is initialized to the list of base classes (or
20773 NULL, if there are none) in the same form returned by
20774 cp_parser_base_clause.
20776 Returns the TYPE of the indicated class. Sets
20777 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20778 involving a nested-name-specifier was used, and FALSE otherwise.
20780 Returns error_mark_node if this is not a class-head.
20782 Returns NULL_TREE if the class-head is syntactically valid, but
20783 semantically invalid in a way that means we should skip the entire
20784 body of the class. */
20786 static tree
20789 {
20790 tree nested_name_specifier;
20794 tree attributes;
20795 tree bases;
20805 /* Assume no nested-name-specifier will be present. */
20807 /* Assume no template parameter lists will be used in defining the
20808 type. */
20812 /* Look for the class-key. */
20817 /* Parse the attributes. */
20820 /* If the next token is `::', that is invalid -- but sometimes
20821 people do try to write:
20823 struct ::S {};
20825 Handle this gracefully by accepting the extra qualifier, and then
20826 issuing an error about it later if this really is a
20827 class-head. If it turns out just to be an elaborated type
20828 specifier, remain silent. */
20834 /* Determine the name of the class. Begin by looking for an
20835 optional nested-name-specifier. */
20837 nested_name_specifier
20843 /* If there was a nested-name-specifier, then there *must* be an
20844 identifier. */
20846 {
20848 /* Although the grammar says `identifier', it really means
20849 `class-name' or `template-name'. You are only allowed to
20850 define a class that has already been declared with this
20851 syntax.
20853 The proposed resolution for Core Issue 180 says that wherever
20854 you see `class T::X' you should treat `X' as a type-name.
20856 It is OK to define an inaccessible class; for example:
20858 class A { class B; };
20859 class A::B {};
20861 We do not know if we will see a class-name, or a
20862 template-name. We look for a class-name first, in case the
20863 class-name is a template-id; if we looked for the
20864 template-name first we would stop after the template-name. */
20869 class_type,
20873 /* If that didn't work, ignore the nested-name-specifier. */
20875 {
20881 }
20882 /* If we could not find a corresponding TYPE, treat this
20883 declaration like an unqualified declaration. */
20886 /* Otherwise, count the number of templates used in TYPE and its
20887 containing scopes. */
20888 else
20889 {
20890 tree scope;
20902 }
20903 }
20904 /* Otherwise, the identifier is optional. */
20905 else
20906 {
20907 /* We don't know whether what comes next is a template-id,
20908 an identifier, or nothing at all. */
20910 /* Check for a template-id. */
20915 class_key,
20917 /* If that didn't work, it could still be an identifier. */
20919 {
20921 {
20924 }
20925 else
20927 }
20928 else
20929 {
20932 }
20933 }
20938 {
20940 class_key,
20942 }
20945 /* If it's not a `:' or a `{' then we can't really be looking at a
20946 class-head, since a class-head only appears as part of a
20947 class-specifier. We have to detect this situation before calling
20948 xref_tag, since that has irreversible side-effects. */
20950 {
20954 }
20956 /* At this point, we're going ahead with the class-specifier, even
20957 if some other problem occurs. */
20960 {
20965 }
20966 /* Issue the error about the overly-qualified name now. */
20968 {
20973 }
20975 {
20980 }
20982 {
20983 tree scope;
20985 /* Reject typedef-names in class heads. */
20987 {
20990 type);
20993 }
20995 /* Figure out in what scope the declaration is being placed. */
20997 /* If that scope does not contain the scope in which the
20998 class was originally declared, the program is invalid. */
21000 {
21003 "declaration of %qD in namespace %qD which does not "
21006 else
21012 }
21013 /* [dcl.meaning]
21015 A declarator-id shall not be qualified except for the
21016 definition of a ... nested class outside of its class
21017 ... [or] the definition or explicit instantiation of a
21018 class member of a namespace outside of its namespace. */
21020 {
21025 }
21026 }
21027 /* An explicit-specialization must be preceded by "template <>". If
21028 it is not, try to recover gracefully. */
21032 {
21036 /* Take the same action that would have been taken by
21037 cp_parser_explicit_specialization. */
21040 }
21041 /* There must be no "return" statements between this point and the
21042 end of this function; set "type "to the correct return value and
21043 use "goto done;" to return. */
21044 /* Make sure that the right number of template parameters were
21045 present. */
21049 {
21050 /* If something went wrong, there is no point in even trying to
21051 process the class-definition. */
21054 }
21056 /* Look up the type. */
21058 {
21062 {
21066 }
21067 else
21068 {
21071 }
21074 }
21076 {
21077 tree class_type;
21079 /* Given:
21081 template <typename T> struct S { struct T };
21082 template <typename T> struct S<T>::T { };
21084 we will get a TYPENAME_TYPE when processing the definition of
21085 `S::T'. We need to resolve it to the actual type before we
21086 try to define it. */
21088 {
21093 else
21094 {
21097 }
21098 }
21102 {
21105 }
21108 /* Enter the scope indicated by the nested-name-specifier. */
21110 /* Get the canonical version of this type. */
21112 /* Call push_template_decl if it seems like we should be defining a
21113 template either from the template headers or the type we're
21114 defining, so that we diagnose both extra and missing headers. */
21118 {
21121 {
21124 }
21125 }
21129 }
21131 {
21132 /* If the class was unnamed, create a dummy name. */
21137 }
21139 /* Indicate whether this class was declared as a `class' or as a
21140 `struct'. */
21145 /* If this type was already complete, and we see another definition,
21146 that's an error. */
21148 {
21150 type);
21152 type);
21155 }
21160 {
21161 /* Apply attributes now, before any use of the class as a template
21162 argument in its base list. */
21165 }
21167 /* We will have entered the scope containing the class; the names of
21168 base classes should be looked up in that context. For example:
21170 struct A { struct B {}; struct C; };
21171 struct A::C : B {};
21173 is valid. */
21175 /* Get the list of base-classes, if there is one. */
21177 {
21178 /* PR59482: enter the class scope so that base-specifiers are looked
21179 up correctly. */
21183 /* PR59482: get out of the previously pushed class scope so that the
21184 subsequent pops pop the right thing. */
21187 }
21188 else
21191 /* If we're really defining a class, process the base classes.
21192 If they're invalid, fail. */
21197 done:
21198 /* Leave the scope given by the nested-name-specifier. We will
21199 enter the class scope itself while processing the members. */
21204 {
21207 }
21213 out:
21216 }
21218 /* Parse a class-key.
21220 class-key:
21221 class
21222 struct
21223 union
21225 Returns the kind of class-key specified, or none_type to indicate
21226 error. */
21228 static enum tag_types
21230 {
21234 /* Look for the class-key. */
21239 /* Check to see if the TOKEN is a class-key. */
21244 }
21246 /* Parse a type-parameter-key.
21248 type-parameter-key:
21249 class
21250 typename
21251 */
21253 static void
21255 {
21256 /* Look for the type-parameter-key. */
21260 {
21263 /* typename is not allowed in a template template parameter
21264 by the standard until C++1Z. */
21266 "ISO C++ forbids typename key in template template parameter;"
21268 }
21269 else
21273 }
21275 /* Parse an (optional) member-specification.
21277 member-specification:
21278 member-declaration member-specification [opt]
21279 access-specifier : member-specification [opt] */
21281 static void
21283 {
21285 {
21289 /* Peek at the next token. */
21291 /* If it's a `}', or EOF then we've seen all the members. */
21297 /* See if this token is a keyword. */
21300 {
21304 /* Consume the access-specifier. */
21306 /* Remember which access-specifier is active. */
21308 /* Look for the `:'. */
21313 /* Accept #pragmas at class scope. */
21315 {
21318 }
21320 /* Otherwise, the next construction must be a
21321 member-declaration. */
21323 }
21324 }
21325 }
21327 /* Parse a member-declaration.
21329 member-declaration:
21330 decl-specifier-seq [opt] member-declarator-list [opt] ;
21331 function-definition ; [opt]
21332 :: [opt] nested-name-specifier template [opt] unqualified-id ;
21333 using-declaration
21334 template-declaration
21335 alias-declaration
21337 member-declarator-list:
21338 member-declarator
21339 member-declarator-list , member-declarator
21341 member-declarator:
21342 declarator pure-specifier [opt]
21343 declarator constant-initializer [opt]
21344 identifier [opt] : constant-expression
21346 GNU Extensions:
21348 member-declaration:
21349 __extension__ member-declaration
21351 member-declarator:
21352 declarator attributes [opt] pure-specifier [opt]
21353 declarator attributes [opt] constant-initializer [opt]
21354 identifier [opt] attributes [opt] : constant-expression
21356 C++0x Extensions:
21358 member-declaration:
21359 static_assert-declaration */
21361 static void
21363 {
21364 cp_decl_specifier_seq decl_specifiers;
21365 tree prefix_attributes;
21366 tree decl;
21375 /* Check for the `__extension__' keyword. */
21377 {
21378 /* Recurse. */
21380 /* Restore the old value of the PEDANTIC flag. */
21384 }
21386 /* Check for a template-declaration. */
21388 {
21389 /* An explicit specialization here is an error condition, and we
21390 expect the specialization handler to detect and report this. */
21394 else
21398 }
21400 /* Check for a using-declaration. */
21402 {
21404 {
21405 /* Parse the using-declaration. */
21409 }
21410 else
21411 {
21412 tree decl;
21416 /* Note that if we actually see the '=' token after the
21417 identifier, cp_parser_alias_declaration commits the
21418 tentative parse. In that case, we really expect an
21419 alias-declaration. Otherwise, we expect a using
21420 declaration. */
21421 alias_decl_expected =
21427 else
21431 }
21432 }
21434 /* Check for @defs. */
21436 {
21441 {
21446 }
21448 }
21450 /* If the next token is `static_assert' we have a static assertion. */
21452 {
21455 }
21457 /* Tentatively parse for a template since we may have a concept
21458 introduction. */
21469 /* Parse the decl-specifier-seq. */
21472 CP_PARSER_FLAGS_OPTIONAL,
21475 /* Check for an invalid type-name. */
21479 /* If there is no declarator, then the decl-specifier-seq should
21480 specify a type. */
21482 {
21483 /* If there was no decl-specifier-seq, and the next token is a
21484 `;', then we have something like:
21486 struct S { ; };
21488 [class.mem]
21490 Each member-declaration shall declare at least one member
21491 name of the class. */
21493 {
21497 }
21498 else
21499 {
21500 tree type;
21502 /* See if this declaration is a friend. */
21504 /* If there were decl-specifiers, check to see if there was
21505 a class-declaration. */
21508 /* Nested classes have already been added to the class, but
21509 a `friend' needs to be explicitly registered. */
21511 {
21512 /* If the `friend' keyword was present, the friend must
21513 be introduced with a class-key. */
21516 "in C++03 a class-key must be used "
21518 /* In this case:
21520 template <typename T> struct A {
21521 friend struct A<T>::B;
21522 };
21524 A<T>::B will be represented by a TYPENAME_TYPE, and
21525 therefore not recognized by check_tag_decl. */
21527 {
21531 }
21534 "friend declaration does not name a class or "
21536 else
21539 }
21540 /* If there is no TYPE, an error message will already have
21541 been issued. */
21543 ;
21544 /* An anonymous aggregate has to be handled specially; such
21545 a declaration really declares a data member (with a
21546 particular type), as opposed to a nested class. */
21548 {
21549 /* C++11 9.5/6. */
21552 "a storage class on an anonymous aggregate "
21555 /* Remove constructors and such from TYPE, now that we
21556 know it is an anonymous aggregate. */
21558 /* And make the corresponding data member. */
21561 /* Add it to the class. */
21563 }
21564 else
21565 cp_parser_check_access_in_redeclaration
21568 }
21569 }
21570 else
21571 {
21574 /* Clear attributes from the decl_specifiers but keep them
21575 around as prefix attributes that apply them to the entity
21576 being declared. */
21580 /* See if these declarations will be friends. */
21583 /* Keep going until we hit the `;' at the end of the
21584 declaration. */
21586 {
21588 tree first_attribute;
21590 /* Peek at the next token. */
21593 /* Check for a bitfield declaration. */
21598 {
21599 tree identifier;
21600 tree width;
21602 /* Get the name of the bitfield. Note that we cannot just
21603 check TOKEN here because it may have been invalidated by
21604 the call to cp_lexer_peek_nth_token above. */
21607 else
21610 /* Consume the `:' token. */
21612 /* Get the width of the bitfield. */
21613 width
21616 /* Look for attributes that apply to the bitfield. */
21618 /* Remember which attributes are prefix attributes and
21619 which are not. */
21621 /* Combine the attributes. */
21624 /* Create the bitfield declaration. */
21627 identifier,
21628 sfk_none)
21631 width,
21632 attributes);
21633 }
21634 else
21635 {
21637 tree initializer;
21638 tree asm_specification;
21641 /* Parse the declarator. */
21642 declarator
21647 friend_p);
21649 /* If something went wrong parsing the declarator, make sure
21650 that we at least consume some tokens. */
21652 {
21653 /* Skip to the end of the statement. */
21655 /* If the next token is not a semicolon, that is
21656 probably because we just skipped over the body of
21657 a function. So, we consume a semicolon if
21658 present, but do not issue an error message if it
21659 is not present. */
21661 CPP_SEMICOLON))
21664 }
21667 cp_parser_check_for_definition_in_return_type
21671 /* Look for an asm-specification. */
21673 /* Look for attributes that apply to the declaration. */
21675 /* Remember which attributes are prefix attributes and
21676 which are not. */
21678 /* Combine the attributes. */
21681 /* If it's an `=', then we have a constant-initializer or a
21682 pure-specifier. It is not correct to parse the
21683 initializer before registering the member declaration
21684 since the member declaration should be in scope while
21685 its initializer is processed. However, the rest of the
21686 front end does not yet provide an interface that allows
21687 us to handle this correctly. */
21689 {
21690 /* In [class.mem]:
21692 A pure-specifier shall be used only in the declaration of
21693 a virtual function.
21695 A member-declarator can contain a constant-initializer
21696 only if it declares a static member of integral or
21697 enumeration type.
21699 Therefore, if the DECLARATOR is for a function, we look
21700 for a pure-specifier; otherwise, we look for a
21701 constant-initializer. When we call `grokfield', it will
21702 perform more stringent semantics checks. */
21714 {
21716 /* Don't require a constant rvalue in C++11, since we
21717 might want a reference constant. We'll enforce
21718 constancy later. */
21720 /* Parse the initializer. */
21723 }
21724 else
21725 /* Parse the initializer. */
21727 }
21730 {
21734 else
21736 }
21737 /* Otherwise, there is no initializer. */
21738 else
21741 /* See if we are probably looking at a function
21742 definition. We are certainly not looking at a
21743 member-declarator. Calling `grokfield' has
21744 side-effects, so we must not do it unless we are sure
21745 that we are looking at a member-declarator. */
21748 {
21749 /* The grammar does not allow a pure-specifier to be
21750 used when a member function is defined. (It is
21751 possible that this fact is an oversight in the
21752 standard, since a pure function may be defined
21753 outside of the class-specifier. */
21759 declarator,
21760 attributes);
21763 /* If the member was not a friend, declare it here. */
21767 /* Peek at the next token. */
21769 /* If the next token is a semicolon, consume it. */
21773 }
21774 else
21777 /* Create the declaration. */
21782 {
21785 else
21787 }
21788 }
21792 /* Reset PREFIX_ATTRIBUTES. */
21798 /* If there is any qualification still in effect, clear it
21799 now; we will be starting fresh with the next declarator. */
21803 /* If it's a `,', then there are more declarators. */
21805 {
21808 {
21812 }
21813 }
21814 /* If the next token isn't a `;', then we have a parse error. */
21816 CPP_SEMICOLON))
21817 {
21818 /* The next token might be a ways away from where the
21819 actual semicolon is missing. Find the previous token
21820 and use that for our error position. */
21825 /* Assume that the user meant to provide a semicolon. If
21826 we were to cp_parser_skip_to_end_of_statement, we might
21827 skip to a semicolon inside a member function definition
21828 and issue nonsensical error messages. */
21830 }
21833 {
21834 /* Add DECL to the list of members. */
21836 /* Explicitly include, eg, NSDMIs, for better error
21837 recovery (c++/58650). */
21846 /* Add DECL to the queue of NSDMI to be parsed later. */
21848 }
21852 }
21853 }
21856 out:
21858 }
21860 /* Parse a pure-specifier.
21862 pure-specifier:
21863 = 0
21865 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21866 Otherwise, ERROR_MARK_NODE is returned. */
21868 static tree
21870 {
21873 /* Look for the `=' token. */
21876 /* Look for the `0' token. */
21885 /* Accept = default or = delete in c++0x mode. */
21888 {
21891 }
21893 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21895 {
21900 }
21902 {
21905 }
21908 }
21910 /* Parse a constant-initializer.
21912 constant-initializer:
21913 = constant-expression
21915 Returns a representation of the constant-expression. */
21917 static tree
21919 {
21920 /* Look for the `=' token. */
21924 /* It is invalid to write:
21926 struct S { static const int i = { 7 }; };
21928 */
21930 {
21933 /* Consume the opening brace. */
21935 /* Skip the initializer. */
21937 /* Look for the trailing `}'. */
21941 }
21944 }
21946 /* Derived classes [gram.class.derived] */
21948 /* Parse a base-clause.
21950 base-clause:
21951 : base-specifier-list
21953 base-specifier-list:
21954 base-specifier ... [opt]
21955 base-specifier-list , base-specifier ... [opt]
21957 Returns a TREE_LIST representing the base-classes, in the order in
21958 which they were declared. The representation of each node is as
21959 described by cp_parser_base_specifier.
21961 In the case that no bases are specified, this function will return
21962 NULL_TREE, not ERROR_MARK_NODE. */
21964 static tree
21966 {
21969 /* Look for the `:' that begins the list. */
21972 /* Scan the base-specifier-list. */
21974 {
21976 tree base;
21979 /* Look for the base-specifier. */
21981 /* Look for the (optional) ellipsis. */
21983 {
21984 /* Consume the `...'. */
21988 }
21990 /* Add BASE to the front of the list. */
21992 {
21994 /* Make this a pack expansion type. */
21998 {
22001 }
22002 }
22003 /* Peek at the next token. */
22005 /* If it's not a comma, then the list is complete. */
22008 /* Consume the `,'. */
22010 }
22012 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22013 base class had a qualified name. However, the next name that
22014 appears is certainly not qualified. */
22020 }
22022 /* Parse a base-specifier.
22024 base-specifier:
22025 :: [opt] nested-name-specifier [opt] class-name
22026 virtual access-specifier [opt] :: [opt] nested-name-specifier
22027 [opt] class-name
22028 access-specifier virtual [opt] :: [opt] nested-name-specifier
22029 [opt] class-name
22031 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22032 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22033 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22034 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22036 static tree
22038 {
22046 tree type;
22048 /* Process the optional `virtual' and `access-specifier'. */
22050 {
22051 /* Peek at the next token. */
22053 /* Process `virtual'. */
22055 {
22057 /* If `virtual' appears more than once, issue an error. */
22059 {
22063 }
22067 /* Consume the `virtual' token. */
22075 /* If more than one access specifier appears, issue an
22076 error. */
22079 {
22083 }
22087 /* Consume the access-specifier. */
22095 }
22096 }
22097 /* It is not uncommon to see programs mechanically, erroneously, use
22098 the 'typename' keyword to denote (dependent) qualified types
22099 as base classes. */
22101 {
22106 else
22108 "keyword %<typename%> not allowed in this context "
22111 }
22113 /* Look for the optional `::' operator. */
22115 /* Look for the nested-name-specifier. The simplest way to
22116 implement:
22118 [temp.res]
22120 The keyword `typename' is not permitted in a base-specifier or
22121 mem-initializer; in these contexts a qualified name that
22122 depends on a template-parameter is implicitly assumed to be a
22123 type name.
22125 is to pretend that we have seen the `typename' keyword at this
22126 point. */
22130 typename_type,
22132 /* If the base class is given by a qualified name, assume that names
22133 we see are type names or templates, as appropriate. */
22139 /* DR 950 allows decltype as a base-specifier. */
22141 else
22142 {
22143 /* Otherwise, look for the class-name. */
22145 class_scope_p,
22146 template_p,
22147 typename_type,
22152 }
22158 }
22160 /* Exception handling [gram.exception] */
22162 /* Parse an (optional) noexcept-specification.
22164 noexcept-specification:
22165 noexcept ( constant-expression ) [opt]
22167 If no noexcept-specification is present, returns NULL_TREE.
22168 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
22169 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
22170 there are no parentheses. CONSUMED_EXPR will be set accordingly.
22171 Otherwise, returns a noexcept specification unless RETURN_COND is true,
22172 in which case a boolean condition is returned instead. */
22174 static tree
22179 {
22183 /* Peek at the next token. */
22186 /* Is it a noexcept-specification? */
22188 {
22189 tree expr;
22193 {
22197 {
22198 /* Types may not be defined in an exception-specification. */
22200 parser->type_definition_forbidden_message
22205 /* Restore the saved message. */
22207 }
22208 else
22209 {
22212 }
22215 }
22216 else
22217 {
22221 }
22223 /* We cannot build a noexcept-spec right away because this will check
22224 that expr is a constexpr. */
22227 else
22229 }
22230 else
22232 }
22234 /* Parse an (optional) exception-specification.
22236 exception-specification:
22237 throw ( type-id-list [opt] )
22239 Returns a TREE_LIST representing the exception-specification. The
22240 TREE_VALUE of each node is a type. */
22242 static tree
22244 {
22246 tree type_id_list;
22249 /* Peek at the next token. */
22252 /* Is it a noexcept-specification? */
22258 /* If it's not `throw', then there's no exception-specification. */
22262 #if 0
22263 /* Enable this once a lot of code has transitioned to noexcept? */
22267 #endif
22269 /* Consume the `throw'. */
22272 /* Look for the `('. */
22275 /* Peek at the next token. */
22277 /* If it's not a `)', then there is a type-id-list. */
22279 {
22280 /* Types may not be defined in an exception-specification. */
22282 parser->type_definition_forbidden_message
22284 /* Parse the type-id-list. */
22286 /* Restore the saved message. */
22288 }
22289 else
22292 /* Look for the `)'. */
22296 }
22298 /* Parse an (optional) type-id-list.
22300 type-id-list:
22301 type-id ... [opt]
22302 type-id-list , type-id ... [opt]
22304 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
22305 in the order that the types were presented. */
22307 static tree
22309 {
22313 {
22315 tree type;
22317 /* Get the next type-id. */
22319 /* Parse the optional ellipsis. */
22321 {
22322 /* Consume the `...'. */
22325 /* Turn the type into a pack expansion expression. */
22327 }
22328 /* Add it to the list. */
22330 /* Peek at the next token. */
22332 /* If it is not a `,', we are done. */
22335 /* Consume the `,'. */
22337 }
22340 }
22342 /* Parse a try-block.
22344 try-block:
22345 try compound-statement handler-seq */
22347 static tree
22349 {
22350 tree try_block;
22364 }
22366 /* Parse a function-try-block.
22368 function-try-block:
22369 try ctor-initializer [opt] function-body handler-seq */
22371 static bool
22373 {
22374 tree compound_stmt;
22375 tree try_block;
22378 /* Look for the `try' keyword. */
22381 /* Let the rest of the front end know where we are. */
22383 /* Parse the function-body. */
22384 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22386 /* We're done with the `try' part. */
22388 /* Parse the handlers. */
22390 /* We're done with the handlers. */
22394 }
22396 /* Parse a handler-seq.
22398 handler-seq:
22399 handler handler-seq [opt] */
22401 static void
22403 {
22405 {
22408 /* Parse the handler. */
22410 /* Peek at the next token. */
22412 /* If it's not `catch' then there are no more handlers. */
22415 }
22416 }
22418 /* Parse a handler.
22420 handler:
22421 catch ( exception-declaration ) compound-statement */
22423 static void
22425 {
22426 tree handler;
22427 tree declaration;
22437 }
22439 /* Parse an exception-declaration.
22441 exception-declaration:
22442 type-specifier-seq declarator
22443 type-specifier-seq abstract-declarator
22444 type-specifier-seq
22445 ...
22447 Returns a VAR_DECL for the declaration, or NULL_TREE if the
22448 ellipsis variant is used. */
22450 static tree
22452 {
22453 cp_decl_specifier_seq type_specifiers;
22457 /* If it's an ellipsis, it's easy to handle. */
22459 {
22460 /* Consume the `...' token. */
22463 }
22465 /* Types may not be defined in exception-declarations. */
22467 parser->type_definition_forbidden_message
22470 /* Parse the type-specifier-seq. */
22474 /* If it's a `)', then there is no declarator. */
22477 else
22484 /* Restore the saved message. */
22491 }
22493 /* Parse a throw-expression.
22495 throw-expression:
22496 throw assignment-expression [opt]
22498 Returns a THROW_EXPR representing the throw-expression. */
22500 static tree
22502 {
22503 tree expression;
22508 /* Figure out whether or not there is an assignment-expression
22509 following the "throw" keyword. */
22517 else
22521 }
22523 /* GNU Extensions */
22525 /* Parse an (optional) asm-specification.
22527 asm-specification:
22528 asm ( string-literal )
22530 If the asm-specification is present, returns a STRING_CST
22531 corresponding to the string-literal. Otherwise, returns
22532 NULL_TREE. */
22534 static tree
22536 {
22538 tree asm_specification;
22540 /* Peek at the next token. */
22542 /* If the next token isn't the `asm' keyword, then there's no
22543 asm-specification. */
22547 /* Consume the `asm' token. */
22549 /* Look for the `('. */
22552 /* Look for the string-literal. */
22555 /* Look for the `)'. */
22559 }
22561 /* Parse an asm-operand-list.
22563 asm-operand-list:
22564 asm-operand
22565 asm-operand-list , asm-operand
22567 asm-operand:
22568 string-literal ( expression )
22569 [ string-literal ] string-literal ( expression )
22571 Returns a TREE_LIST representing the operands. The TREE_VALUE of
22572 each node is the expression. The TREE_PURPOSE is itself a
22573 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
22574 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
22575 is a STRING_CST for the string literal before the parenthesis. Returns
22576 ERROR_MARK_NODE if any of the operands are invalid. */
22578 static tree
22580 {
22585 {
22586 tree string_literal;
22587 tree expression;
22588 tree name;
22591 {
22592 /* Consume the `[' token. */
22594 /* Read the operand name. */
22599 /* Look for the closing `]'. */
22601 }
22602 else
22604 /* Look for the string-literal. */
22607 /* Look for the `('. */
22609 /* Parse the expression. */
22611 /* Look for the `)'. */
22619 /* Add this operand to the list. */
22621 expression,
22622 asm_operands);
22623 /* If the next token is not a `,', there are no more
22624 operands. */
22627 /* Consume the `,'. */
22629 }
22632 }
22634 /* Parse an asm-clobber-list.
22636 asm-clobber-list:
22637 string-literal
22638 asm-clobber-list , string-literal
22640 Returns a TREE_LIST, indicating the clobbers in the order that they
22641 appeared. The TREE_VALUE of each node is a STRING_CST. */
22643 static tree
22645 {
22649 {
22650 tree string_literal;
22652 /* Look for the string literal. */
22654 /* Add it to the list. */
22656 /* If the next token is not a `,', then the list is
22657 complete. */
22660 /* Consume the `,' token. */
22662 }
22665 }
22667 /* Parse an asm-label-list.
22669 asm-label-list:
22670 identifier
22671 asm-label-list , identifier
22673 Returns a TREE_LIST, indicating the labels in the order that they
22674 appeared. The TREE_VALUE of each node is a label. */
22676 static tree
22678 {
22682 {
22685 /* Look for the identifier. */
22688 {
22691 {
22697 }
22698 }
22699 /* If the next token is not a `,', then the list is
22700 complete. */
22703 /* Consume the `,' token. */
22705 }
22708 }
22710 /* Return TRUE iff the next tokens in the stream are possibly the
22711 beginning of a GNU extension attribute. */
22713 static bool
22715 {
22717 }
22719 /* Return TRUE iff the next tokens in the stream are possibly the
22720 beginning of a standard C++-11 attribute specifier. */
22722 static bool
22724 {
22726 }
22728 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22729 beginning of a standard C++-11 attribute specifier. */
22731 static bool
22733 {
22741 }
22743 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22744 beginning of a GNU extension attribute. */
22746 static bool
22748 {
22752 }
22754 /* Return true iff the next tokens can be the beginning of either a
22755 GNU attribute list, or a standard C++11 attribute sequence. */
22757 static bool
22759 {
22762 }
22764 /* Return true iff the next Nth tokens can be the beginning of either
22765 a GNU attribute list, or a standard C++11 attribute sequence. */
22767 static bool
22769 {
22772 }
22774 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22775 of GNU attributes, or return NULL. */
22777 static tree
22779 {
22783 }
22785 #define CILK_SIMD_FN_CLAUSE_MASK \
22786 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22787 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22788 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22789 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22790 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22792 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22793 vector [(<clauses>)] */
22795 static void
22797 {
22801 {
22806 }
22809 {
22812 paren_scope++;
22813 }
22815 {
22818 paren_scope++;
22820 paren_scope--;
22821 /* Do not push the last ')' */
22824 }
22833 }
22835 /* Parse an (optional) series of attributes.
22837 attributes:
22838 attributes attribute
22840 attribute:
22841 __attribute__ (( attribute-list [opt] ))
22843 The return value is as for cp_parser_gnu_attribute_list. */
22845 static tree
22847 {
22851 {
22853 tree attribute_list;
22856 /* Peek at the next token. */
22858 /* If it's not `__attribute__', then we're done. */
22862 /* Consume the `__attribute__' keyword. */
22864 /* Look for the two `(' tokens. */
22868 /* Peek at the next token. */
22871 /* Parse the attribute-list. */
22873 else
22874 /* If the next token is a `)', then there is no attribute
22875 list. */
22878 /* Look for the two `)' tokens. */
22886 /* Add these new attributes to the list. */
22888 }
22891 }
22893 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22894 "__vector" or "__vector__." */
22898 {
22902 }
22904 /* Parse a GNU attribute-list.
22906 attribute-list:
22907 attribute
22908 attribute-list , attribute
22910 attribute:
22911 identifier
22912 identifier ( identifier )
22913 identifier ( identifier , expression-list )
22914 identifier ( expression-list )
22916 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22917 to an attribute. The TREE_PURPOSE of each node is the identifier
22918 indicating which attribute is in use. The TREE_VALUE represents
22919 the arguments, if any. */
22921 static tree
22923 {
22929 {
22931 tree identifier;
22932 tree attribute;
22934 /* Look for the identifier. We also allow keywords here; for
22935 example `__attribute__ ((const))' is legal. */
22939 {
22942 /* Consume the token, but save it since we need it for the
22943 SIMD enabled function parsing. */
22946 /* Save away the identifier that indicates which attribute
22947 this is. */
22949 /* For keywords, use the canonical spelling, not the
22950 parsed identifier. */
22956 /* Peek at the next token. */
22958 /* If it's an `(', then parse the attribute arguments. */
22960 {
22965 {
22968 }
22969 else
22970 vec = cp_parser_parenthesized_expression_list
22976 else
22977 {
22980 }
22981 /* Save the arguments away. */
22983 }
22985 {
22988 }
22991 {
22992 /* Add this attribute to the list. */
22995 }
22998 }
22999 /* Now, look for more attributes. If the next token isn't a
23000 `,', we're done. */
23004 /* Consume the comma and keep going. */
23006 }
23009 /* We built up the list in reverse order. */
23011 }
23013 /* Parse a standard C++11 attribute.
23015 The returned representation is a TREE_LIST which TREE_PURPOSE is
23016 the scoped name of the attribute, and the TREE_VALUE is its
23017 arguments list.
23019 Note that the scoped name of the attribute is itself a TREE_LIST
23020 which TREE_PURPOSE is the namespace of the attribute, and
23021 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23022 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23023 and which TREE_PURPOSE is directly the attribute name.
23025 Clients of the attribute code should use get_attribute_namespace
23026 and get_attribute_name to get the actual namespace and name of
23027 attributes, regardless of their being GNU or C++11 attributes.
23029 attribute:
23030 attribute-token attribute-argument-clause [opt]
23032 attribute-token:
23033 identifier
23034 attribute-scoped-token
23036 attribute-scoped-token:
23037 attribute-namespace :: identifier
23039 attribute-namespace:
23040 identifier
23042 attribute-argument-clause:
23043 ( balanced-token-seq )
23045 balanced-token-seq:
23046 balanced-token [opt]
23047 balanced-token-seq balanced-token
23049 balanced-token:
23050 ( balanced-token-seq )
23051 [ balanced-token-seq ]
23052 { balanced-token-seq }. */
23054 static tree
23056 {
23060 /* First, parse name of the the attribute, a.k.a
23061 attribute-token. */
23078 {
23079 /* We are seeing a scoped attribute token. */
23089 else
23090 {
23094 }
23096 NULL_TREE);
23098 }
23099 else
23100 {
23102 NULL_TREE);
23103 /* C++11 noreturn attribute is equivalent to GNU's. */
23106 /* C++14 deprecated attribute is equivalent to GNU's. */
23108 {
23111 "%<deprecated%> is a C++14 feature;"
23114 }
23115 }
23117 /* Now parse the optional argument clause of the attribute. */
23122 {
23128 /* A GNU attribute that takes an identifier in parameter. */
23131 vec = cp_parser_parenthesized_expression_list
23137 else
23138 {
23141 }
23145 else
23147 }
23150 }
23152 /* Parse a list of standard C++-11 attributes.
23154 attribute-list:
23155 attribute [opt]
23156 attribute-list , attribute[opt]
23157 attribute ...
23158 attribute-list , attribute ...
23159 */
23161 static tree
23163 {
23168 {
23173 {
23176 }
23181 }
23184 }
23186 /* Parse a standard C++-11 attribute specifier.
23188 attribute-specifier:
23189 [ [ attribute-list ] ]
23190 alignment-specifier
23192 alignment-specifier:
23193 alignas ( type-id ... [opt] )
23194 alignas ( alignment-expression ... [opt] ). */
23196 static tree
23198 {
23204 {
23213 else
23214 /* Warn about parsing c++11 attribute in non-c++1 mode, only
23215 when we are sure that we have actually parsed them. */
23217 }
23218 else
23219 {
23220 tree alignas_expr;
23222 /* Look for an alignment-specifier. */
23234 {
23237 }
23243 {
23247 alignas_expr =
23254 }
23257 {
23260 }
23264 /* Build the C++-11 representation of an 'aligned'
23265 attribute. */
23266 attributes =
23270 }
23273 }
23275 /* Parse a standard C++-11 attribute-specifier-seq.
23277 attribute-specifier-seq:
23278 attribute-specifier-seq [opt] attribute-specifier
23279 */
23281 static tree
23283 {
23287 {
23296 }
23300 }
23302 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
23303 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
23304 current value of the PEDANTIC flag, regardless of whether or not
23305 the `__extension__' keyword is present. The caller is responsible
23306 for restoring the value of the PEDANTIC flag. */
23308 static bool
23310 {
23311 /* Save the old value of the PEDANTIC flag. */
23315 {
23316 /* Consume the `__extension__' token. */
23318 /* We're not being pedantic while the `__extension__' keyword is
23319 in effect. */
23323 }
23326 }
23328 /* Parse a label declaration.
23330 label-declaration:
23331 __label__ label-declarator-seq ;
23333 label-declarator-seq:
23334 identifier , label-declarator-seq
23335 identifier */
23337 static void
23339 {
23340 /* Look for the `__label__' keyword. */
23344 {
23345 tree identifier;
23347 /* Look for an identifier. */
23349 /* If we failed, stop. */
23352 /* Declare it as a label. */
23354 /* If the next token is a `;', stop. */
23357 /* Look for the `,' separating the label declarations. */
23359 }
23361 /* Look for the final `;'. */
23363 }
23365 // -------------------------------------------------------------------------- //
23366 // Requires Clause
23368 // Parse a requires clause.
23369 //
23370 // requires-clause:
23371 // 'requires' logical-or-expression
23372 //
23373 // The required logical-or-expression must be a constant expression. Note
23374 // that we don't check that the expression is constepxr here. We defer until
23375 // we analyze constraints and then, we only check atomic constraints.
23376 static tree
23378 {
23379 // Parse the requires clause so that it is not automatically folded.
23381 tree expr =
23385 }
23387 // Optionally parse a requires clause:
23388 //
23389 // requires-clause:
23390 // 'requires' logical-or-expression
23391 //
23392 // The required logical-or-expression must be a constant expression.
23393 static tree
23395 {
23400 }
23403 /*---------------------------------------------------------------------------
23404 Requires expressions
23405 ---------------------------------------------------------------------------*/
23407 /* Parse a requires expression
23409 requirement-expression:
23410 'requires' requirement-parameter-list [opt] requirement-body */
23411 static tree
23413 {
23417 /* A requires-expression shall appear only within a concept
23418 definition or a requires-clause.
23420 TODO: Implement this diagnostic correctly. */
23422 {
23426 }
23428 /* Local parameters are delared as variables within the scope
23429 of the expression. They are not visible past the end of
23430 the expression. */
23431 struct scope_sentinel
23432 {
23434 {
23436 }
23439 {
23441 }
23444 /* Parse the optional parameter list. */
23447 {
23451 }
23453 /* Parse the requirement body. */
23459 }
23461 /* Parse a parameterized requirement.
23463 requirement-parameter-list:
23464 '(' parameter-declaration-clause ')' */
23465 static tree
23467 {
23479 }
23481 /* Parse the body of a requirement.
23483 requirement-body:
23484 '{' requirement-list '}' */
23485 static tree
23487 {
23497 }
23499 /* Parse a list of requirements.
23501 requirement-list:
23502 requirement
23503 requirement-list ';' requirement[opt] */
23504 static tree
23506 {
23509 {
23516 /* If we see a semi-colon, consume it. */
23520 /* Stop processing at the end of the list. */
23523 }
23525 /* Reverse the order of requirements so they are analyzed in
23526 declaration order. */
23528 }
23530 /* Parse a syntactic requirement or type requirement.
23532 requirement:
23533 simple-requirement
23534 compound-requirement
23535 type-requirement
23536 nested-requirement */
23537 static tree
23539 {
23546 else
23548 }
23550 /* Parse a simple requirement.
23552 simple-requirement:
23553 expression ';' */
23554 static tree
23556 {
23565 }
23567 /* Parse a type requirement
23569 type-requirement
23570 nested-name-specifier [opt] type-name ';' */
23571 static tree
23573 {
23591 }
23593 /* Parse a compound requirement
23595 compound-requirement:
23596 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
23597 static tree
23599 {
23600 /* Parse an expression enclosed in '{ }'s. */
23611 /* Parse the optional noexcept. */
23614 {
23617 }
23619 /* Parse the optional trailing return type. */
23622 {
23630 }
23633 }
23635 /* Parse a nested requirement. This is the same as a requires clause.
23637 nested-requirement:
23638 requires-clause */
23639 static tree
23641 {
23647 }
23649 /* Support Functions */
23651 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
23652 NAME should have one of the representations used for an
23653 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
23654 is returned. If PARSER->SCOPE is a dependent type, then a
23655 SCOPE_REF is returned.
23657 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
23658 returned; the name was already resolved when the TEMPLATE_ID_EXPR
23659 was formed. Abstractly, such entities should not be passed to this
23660 function, because they do not need to be looked up, but it is
23661 simpler to check for this special case here, rather than at the
23662 call-sites.
23664 In cases not explicitly covered above, this function returns a
23665 DECL, OVERLOAD, or baselink representing the result of the lookup.
23666 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
23667 is returned.
23669 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
23670 (e.g., "struct") that was used. In that case bindings that do not
23671 refer to types are ignored.
23673 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
23674 ignored.
23676 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
23677 are ignored.
23679 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
23680 types.
23682 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
23683 TREE_LIST of candidates if name-lookup results in an ambiguity, and
23684 NULL_TREE otherwise. */
23686 static tree
23693 location_t name_location)
23694 {
23695 tree decl;
23698 /* Assume that the lookup will be unambiguous. */
23702 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
23703 no longer valid. Note that if we are parsing tentatively, and
23704 the parse fails, OBJECT_TYPE will be automatically restored. */
23710 /* A template-id has already been resolved; there is no lookup to
23711 do. */
23715 {
23719 }
23721 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
23722 it should already have been checked to make sure that the name
23723 used matches the type being destroyed. */
23725 {
23726 tree type;
23728 /* Figure out to which type this destructor applies. */
23733 else
23735 /* If that's not a class type, there is no destructor. */
23742 /* If it was a class type, return the destructor. */
23744 }
23746 /* By this point, the NAME should be an ordinary identifier. If
23747 the id-expression was a qualified name, the qualifying scope is
23748 stored in PARSER->SCOPE at this point. */
23751 /* Perform the lookup. */
23753 {
23759 /* If the SCOPE is dependent, the lookup must be deferred until
23760 the template is instantiated -- unless we are explicitly
23761 looking up names in uninstantiated templates. Even then, we
23762 cannot look up the name if the scope is not a class type; it
23763 might, for example, be a template type parameter. */
23768 /* Defer lookup. */
23770 else
23771 {
23774 /* If PARSER->SCOPE is a dependent type, then it must be a
23775 class type, and we must not be checking dependencies;
23776 otherwise, we would have processed this lookup above. So
23777 that PARSER->SCOPE is not considered a dependent base by
23778 lookup_member, we must enter the scope here. */
23782 /* If the PARSER->SCOPE is a template specialization, it
23783 may be instantiated during name lookup. In that case,
23784 errors may be issued. Even if we rollback the current
23785 tentative parse, those errors are valid. */
23790 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
23791 lookup result and the nested-name-specifier nominates a class C:
23792 * if the name specified after the nested-name-specifier, when
23793 looked up in C, is the injected-class-name of C (Clause 9), or
23794 * if the name specified after the nested-name-specifier is the
23795 same as the identifier or the simple-template-id's template-
23796 name in the last component of the nested-name-specifier,
23797 the name is instead considered to name the constructor of
23798 class C. [ Note: for example, the constructor is not an
23799 acceptable lookup result in an elaborated-type-specifier so
23800 the constructor would not be used in place of the
23801 injected-class-name. --end note ] Such a constructor name
23802 shall be used only in the declarator-id of a declaration that
23803 names a constructor or in a using-declaration. */
23811 /* If we have a single function from a using decl, pull it out. */
23818 }
23820 /* If the scope is a dependent type and either we deferred lookup or
23821 we did lookup but didn't find the name, rememeber the name. */
23824 {
23826 {
23827 tree type;
23829 /* The resolution to Core Issue 180 says that `struct
23830 A::B' should be considered a type-name, even if `A'
23831 is dependent. */
23836 }
23840 CPP_CLOSE_PAREN)))
23844 else
23847 is_template);
23848 }
23851 }
23853 {
23854 /* Look up the name in the scope of the OBJECT_TYPE, unless the
23855 OBJECT_TYPE is not a class. */
23857 /* If the OBJECT_TYPE is a template specialization, it may
23858 be instantiated during name lookup. In that case, errors
23859 may be issued. Even if we rollback the current tentative
23860 parse, those errors are valid. */
23862 name,
23865 tf_warning_or_error);
23866 else
23870 /* Look it up in the enclosing context. */
23876 }
23877 else
23878 {
23884 }
23886 /* If the lookup failed, let our caller know. */
23890 /* Pull out the template from an injected-class-name (or multiple). */
23894 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23896 {
23899 /* The error message we have to print is too complicated for
23900 cp_parser_error, so we incorporate its actions directly. */
23902 {
23904 name);
23906 }
23908 }
23916 /* If we have resolved the name of a member declaration, check to
23917 see if the declaration is accessible. When the name resolves to
23918 set of overloaded functions, accessibility is checked when
23919 overload resolution is done.
23921 During an explicit instantiation, access is not checked at all,
23922 as per [temp.explicit]. */
23929 }
23931 /* Like cp_parser_lookup_name, but for use in the typical case where
23932 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23933 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23935 static tree
23937 {
23939 none_type,
23944 location);
23945 }
23947 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23948 the current context, return the TYPE_DECL. If TAG_NAME_P is
23949 true, the DECL indicates the class being defined in a class-head,
23950 or declared in an elaborated-type-specifier.
23952 Otherwise, return DECL. */
23954 static tree
23956 {
23957 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23958 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23960 struct A {
23961 template <typename T> struct B;
23962 };
23964 template <typename T> struct A::B {};
23966 Similarly, in an elaborated-type-specifier:
23968 namespace N { struct X{}; }
23970 struct A {
23971 template <typename T> friend struct N::X;
23972 };
23974 However, if the DECL refers to a class type, and we are in
23975 the scope of the class, then the name lookup automatically
23976 finds the TYPE_DECL created by build_self_reference rather
23977 than a TEMPLATE_DECL. For example, in:
23979 template <class T> struct S {
23980 S s;
23981 };
23983 there is no need to handle such case. */
23989 }
23991 /* If too many, or too few, template-parameter lists apply to the
23992 declarator, issue an error message. Returns TRUE if all went well,
23993 and FALSE otherwise. */
23995 static bool
23998 location_t declarator_location)
23999 {
24001 {
24003 {
24011 /* If the DECLARATOR has the form `X<y>' then it uses one
24012 additional level of template parameters. */
24015 return cp_parser_check_template_parameters
24017 }
24032 }
24034 }
24036 /* NUM_TEMPLATES were used in the current declaration. If that is
24037 invalid, return FALSE and issue an error messages. Otherwise,
24038 return TRUE. If DECLARATOR is non-NULL, then we are checking a
24039 declarator and we can print more accurate diagnostics. */
24041 static bool
24044 location_t location,
24046 {
24047 /* If there are the same number of template classes and parameter
24048 lists, that's OK. */
24051 /* If there are more, but only one more, then we are referring to a
24052 member template. That's OK too. */
24055 /* If there are more template classes than parameter lists, we have
24056 something like:
24058 template <class T> void S<T>::R<T>::f (); */
24060 {
24070 else
24073 }
24074 /* Otherwise, there are too many template parameter lists. We have
24075 something like:
24077 template <class T> template <class U> void S::f(); */
24080 }
24082 /* Parse an optional `::' token indicating that the following name is
24083 from the global namespace. If so, PARSER->SCOPE is set to the
24084 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
24085 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
24086 Returns the new value of PARSER->SCOPE, if the `::' token is
24087 present, and NULL_TREE otherwise. */
24089 static tree
24091 {
24094 /* Peek at the next token. */
24096 /* If we're looking at a `::' token then we're starting from the
24097 global namespace, not our current location. */
24099 {
24100 /* Consume the `::' token. */
24102 /* Set the SCOPE so that we know where to start the lookup. */
24108 }
24110 {
24114 }
24117 }
24119 /* Returns TRUE if the upcoming token sequence is the start of a
24120 constructor declarator. If FRIEND_P is true, the declarator is
24121 preceded by the `friend' specifier. */
24123 static bool
24125 {
24128 tree nested_name_specifier;
24131 /* The common case is that this is not a constructor declarator, so
24132 try to avoid doing lots of work if at all possible. It's not
24133 valid declare a constructor at function scope. */
24136 /* And only certain tokens can begin a constructor declarator. */
24144 /* Parse tentatively; we are going to roll back all of the tokens
24145 consumed here. */
24147 /* Assume that we are looking at a constructor declarator. */
24150 /* Look for the optional `::' operator. */
24153 /* Look for the nested-name-specifier. */
24154 nested_name_specifier
24165 /* Outside of a class-specifier, there must be a
24166 nested-name-specifier. */
24172 /* If we have a class scope, this is easy; DR 147 says that S::S always
24173 names the constructor, and no other qualified name could. */
24176 {
24186 }
24187 /* If we still think that this might be a constructor-declarator,
24188 look for a class-name. */
24190 {
24191 /* If we have:
24193 template <typename T> struct S {
24194 S();
24195 };
24197 we must recognize that the nested `S' names a class. */
24198 tree type_decl;
24202 none_type,
24206 /* If there was no class-name, then this is not a constructor.
24207 Otherwise, if we are in a class-specifier and we aren't
24208 handling a friend declaration, check that its type matches
24209 current_class_type (c++/38313). Note: error_mark_node
24210 is left alone for error recovery purposes. */
24212 && (outside_class_specifier_p
24217 /* If we're still considering a constructor, we have to see a `(',
24218 to begin the parameter-declaration-clause, followed by either a
24219 `)', an `...', or a decl-specifier. We need to check for a
24220 type-specifier to avoid being fooled into thinking that:
24222 S (f) (int);
24224 is a constructor. (It is actually a function named `f' that
24225 takes one parameter (of type `int') and returns a value of type
24226 `S'. */
24234 /* A parameter declaration begins with a decl-specifier,
24235 which is either the "attribute" keyword, a storage class
24236 specifier, or (usually) a type-specifier. */
24238 {
24239 tree type;
24243 /* Names appearing in the type-specifier should be looked up
24244 in the scope of the class. */
24247 else
24248 {
24251 {
24255 {
24258 }
24259 }
24261 }
24263 /* Inside the constructor parameter list, surrounding
24264 template-parameter-lists do not apply. */
24265 saved_num_template_parameter_lists
24269 /* Look for the type-specifier. */
24271 CP_PARSER_FLAGS_NONE,
24277 parser->num_template_parameter_lists
24280 /* Leave the scope of the class. */
24285 }
24286 }
24288 /* We did not really want to consume any tokens. */
24292 }
24294 /* Parse the definition of the function given by the DECL_SPECIFIERS,
24295 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
24296 they must be performed once we are in the scope of the function.
24298 Returns the function defined. */
24300 static tree
24301 cp_parser_function_definition_from_specifiers_and_declarator
24304 tree attributes,
24306 {
24307 tree fn;
24310 /* Begin the function-definition. */
24313 /* The things we're about to see are not directly qualified by any
24314 template headers we've seen thus far. */
24317 /* If there were names looked up in the decl-specifier-seq that we
24318 did not check, check them now. We must wait until we are in the
24319 scope of the function to perform the checks, since the function
24320 might be a friend. */
24324 {
24327 }
24330 {
24331 /* Skip the entire function. */
24334 }
24336 {
24337 /* Seen already, skip it. An error message has already been output. */
24341 /* If this is a function from a class, pop the nested class. */
24344 }
24345 else
24346 {
24347 timevar_id_t tv;
24350 else
24356 }
24359 }
24361 /* Parse the part of a function-definition that follows the
24362 declarator. INLINE_P is TRUE iff this function is an inline
24363 function defined within a class-specifier.
24365 Returns the function defined. */
24367 static tree
24370 {
24371 tree fn;
24377 bool fully_implicit_function_template_p
24380 tree implicit_template_parms
24383 cp_binding_level* implicit_template_scope
24389 /* If the next token is `return', then the code may be trying to
24390 make use of the "named return value" extension that G++ used to
24391 support. */
24394 {
24395 /* Consume the `return' keyword. */
24397 /* Look for the identifier that indicates what value is to be
24398 returned. */
24400 /* Issue an error message. */
24403 /* Skip tokens until we reach the start of the function body. */
24405 {
24412 }
24413 }
24414 /* The `extern' in `extern "C" void f () { ... }' does not apply to
24415 anything declared inside `f'. */
24416 saved_in_unbraced_linkage_specification_p
24419 /* Inside the function, surrounding template-parameter-lists do not
24420 apply. */
24421 saved_num_template_parameter_lists
24427 /* If the next token is `try', `__transaction_atomic', or
24428 `__transaction_relaxed`, then we are looking at either function-try-block
24429 or function-transaction-block. Note that all of these include the
24430 function-body. */
24433 RID_TRANSACTION_ATOMIC);
24435 RID_TRANSACTION_RELAXED))
24437 RID_TRANSACTION_RELAXED);
24440 else
24441 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24446 /* Finish the function. */
24449 /* Generate code for it, if necessary. */
24451 /* Restore the saved values. */
24452 parser->in_unbraced_linkage_specification_p
24454 parser->num_template_parameter_lists
24458 parser->fully_implicit_function_template_p
24460 parser->implicit_template_parms
24462 parser->implicit_template_scope
24469 }
24471 /* Parse a concept introduction header for a template-declaration. If
24472 successful, returns the template parameters. Otherwise returns
24473 error_mark_node. */
24475 static tree
24477 {
24478 // Look for the optional `::' operator.
24481 // Look for the nested-name-specifier.
24493 // Look for opening brace for introduction
24497 // This must be a concept introduction.
24501 // Build vector of placeholder parameters and grab matching identifiers.
24504 // The introduction-list shall not be empty
24507 {
24510 }
24512 // Look for closing brace for introduction
24516 // Look up the concept for which we will be matching template parameters.
24520 {
24524 }
24526 // Build and associate the constraint.
24533 }
24535 /* Parse a template-declaration, assuming that the `export' (and
24536 `extern') keywords, if present, has already been scanned. MEMBER_P
24537 is as for cp_parser_template_declaration. */
24539 static void
24541 {
24544 tree parameter_list;
24549 /* Look for the `template' keyword. */
24553 {
24558 /* Look for the `<'. */
24562 {
24563 /* 14.5.2.2 [temp.mem]
24565 A local class shall not have member templates. */
24570 }
24571 /* [temp]
24573 A template ... shall not have C linkage. */
24575 {
24577 /* Give it C++ linkage to avoid confusing other parts of the
24578 front end. */
24581 }
24582 else
24585 /* We cannot perform access checks on the template parameter
24586 declarations until we know what is being declared, just as we
24587 cannot check the decl-specifier list. */
24590 /* If the next token is `>', then we have an invalid
24591 specialization. Rather than complain about an invalid template
24592 parameter, issue an error message here. */
24594 {
24598 }
24599 else
24600 {
24601 /* Parse the template parameters. */
24603 }
24605 /* Get the deferred access checks from the parameter list. These
24606 will be checked once we know what is being declared, as for a
24607 member template the checks must be performed in the scope of the
24608 class containing the member. */
24611 /* Look for the `>'. */
24614 /* Manage template requirements */
24616 {
24620 }
24622 }
24623 }
24625 {
24629 // Scope may be changed by a nested-name-specifier.
24637 {
24641 }
24647 }
24648 else
24649 {
24653 }
24655 /* We just processed one more parameter list. */
24658 /* Look for another template. We need to start a tentative parse here as
24659 the next header could be a concept introduction. */
24667 else
24668 {
24669 /* There are no access checks when parsing a template, as we do not
24670 know if a specialization will be a friend. */
24674 checks,
24675 member_p,
24680 /* If this is a member template declaration, let the front
24681 end know. */
24683 {
24688 }
24693 }
24694 /* We are done with the current parameter list. */
24699 /* Finish up. */
24702 /* Check the template arguments for a literal operator template. */
24706 {
24710 else
24711 {
24714 {
24720 }
24722 {
24730 }
24731 else
24733 }
24735 {
24738 " Expected non-type template argument pack <char...>"
24740 decl);
24741 else
24744 decl);
24745 }
24746 }
24748 /* Register member declarations. */
24751 /* For the erroneous case of a template with C linkage, we pushed an
24752 implicit C++ linkage scope; exit that scope now. */
24755 /* If DECL is a function template, we must return to parse it later.
24756 (Even though there is no definition, there might be default
24757 arguments that need handling.) */
24761 }
24763 /* Perform the deferred access checks from a template-parameter-list.
24764 CHECKS is a TREE_LIST of access checks, as returned by
24765 get_deferred_access_checks. */
24767 static void
24768 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
24769 {
24773 }
24775 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
24776 `function-definition' sequence that follows a template header.
24777 If MEMBER_P is true, this declaration appears in a class scope.
24779 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
24780 *FRIEND_P is set to TRUE iff the declaration is a friend. */
24782 static tree
24788 {
24791 cp_decl_specifier_seq decl_specifiers;
24795 /* This function is only used when processing a template
24796 declaration. */
24800 /* Defer access checks until we know what is being declared. */
24803 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
24804 alternative. */
24807 CP_PARSER_FLAGS_OPTIONAL,
24813 /* There are no template typedefs. */
24815 {
24819 }
24821 /* Gather up the access checks that occurred the
24822 decl-specifier-seq. */
24825 /* Check for the declaration of a template class. */
24827 {
24829 {
24830 // If this is a declaration, but not a definition, associate
24831 // any constraints with the type declaration. Constraints
24832 // are associated with definitions in cp_parser_class_specifier.
24838 /* In this case:
24840 struct C {
24841 friend template <typename T> struct A<T>::B;
24842 };
24844 A<T>::B will be represented by a TYPENAME_TYPE, and
24845 therefore not recognized by shadow_tag. */
24847 && !decl
24854 else
24857 /* Perform access checks for template parameters. */
24859 }
24860 }
24862 /* Complain about missing 'typename' or other invalid type names. */
24865 {
24866 /* cp_parser_parse_and_diagnose_invalid_type_name calls
24867 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
24868 the rest of this declaration. */
24871 }
24873 /* If it's not a template class, try for a template function. If
24874 the next token is a `;', then this declaration does not declare
24875 anything. But, if there were errors in the decl-specifiers, then
24876 the error might well have come from an attempted class-specifier.
24877 In that case, there's no need to warn about a missing declarator. */
24881 {
24884 checks,
24886 member_p,
24887 declares_class_or_enum,
24891 /* 7.1.1-1 [dcl.stc]
24893 A storage-class-specifier shall not be specified in an explicit
24894 specialization... */
24896 && explicit_specialization_p
24898 {
24902 }
24906 }
24908 /* Look for a trailing `;' after the declaration. */
24914 out:
24917 /* Clear any current qualification; whatever comes next is the start
24918 of something new. */
24924 }
24926 /* Parse a cast-expression that is not the operand of a unary "&". */
24928 static tree
24930 {
24933 }
24935 /* Parse a functional cast to TYPE. Returns an expression
24936 representing the cast. */
24938 static tree
24940 {
24942 tree expression_list;
24943 tree cast;
24950 {
24958 tf_warning_or_error);
24959 }
24968 else
24969 {
24972 }
24975 tf_warning_or_error);
24976 /* [expr.const]/1: In an integral constant expression "only type
24977 conversions to integral or enumeration type can be used". */
24983 NIC_CONSTRUCTOR))
24986 }
24988 /* Save the tokens that make up the body of a member function defined
24989 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
24990 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
24991 specifiers applied to the declaration. Returns the FUNCTION_DECL
24992 for the member function. */
24994 static tree
24998 tree attributes)
24999 {
25002 tree fn;
25004 /* Create the FUNCTION_DECL. */
25007 /* If something went badly wrong, bail out now. */
25009 {
25010 /* If there's a function-body, skip it. */
25015 }
25017 /* Remember it, if there default args to post process. */
25020 /* Save away the tokens that make up the body of the
25021 function. */
25023 /* Handle function try blocks. */
25026 /* We can have braced-init-list mem-initializers before the fn body. */
25028 {
25031 {
25032 /* cache_group will stop after an un-nested { } pair, too. */
25036 /* variadic mem-inits have ... after the ')'. */
25039 }
25040 }
25042 /* Handle function try blocks. */
25047 /* Save away the inline definition; we will process it when the
25048 class is complete. */
25052 /* We need to know that this was defined in the class, so that
25053 friend templates are handled correctly. */
25056 /* Add FN to the queue of functions to be parsed later. */
25060 }
25062 /* Save the tokens that make up the in-class initializer for a non-static
25063 data member. Returns a DEFAULT_ARG. */
25065 static tree
25067 {
25069 }
25071 /* Parse a template-argument-list, as well as the trailing ">" (but
25072 not the opening "<"). See cp_parser_template_argument_list for the
25073 return value. */
25075 static tree
25077 {
25078 tree arguments;
25079 tree saved_scope;
25080 tree saved_qualifying_scope;
25081 tree saved_object_scope;
25086 /* [temp.names]
25088 When parsing a template-id, the first non-nested `>' is taken as
25089 the end of the template-argument-list rather than a greater-than
25090 operator. */
25091 saved_greater_than_is_operator_p
25094 /* Parsing the argument list may modify SCOPE, so we save it
25095 here. */
25099 /* We need to evaluate the template arguments, even though this
25100 template-id may be nested within a "sizeof". */
25105 /* Parse the template-argument-list itself. */
25109 else
25111 /* Look for the `>' that ends the template-argument-list. If we find
25112 a '>>' instead, it's probably just a typo. */
25114 {
25116 {
25117 /* In C++0x, a `>>' in a template argument list or cast
25118 expression is considered to be two separate `>'
25119 tokens. So, change the current token to a `>', but don't
25120 consume it: it will be consumed later when the outer
25121 template argument list (or cast expression) is parsed.
25122 Note that this replacement of `>' for `>>' is necessary
25123 even if we are parsing tentatively: in the tentative
25124 case, after calling
25125 cp_parser_enclosed_template_argument_list we will always
25126 throw away all of the template arguments and the first
25127 closing `>', either because the template argument list
25128 was erroneous or because we are replacing those tokens
25129 with a CPP_TEMPLATE_ID token. The second `>' (which will
25130 not have been thrown away) is needed either to close an
25131 outer template argument list or to complete a new-style
25132 cast. */
25135 }
25137 {
25138 /* If we're in a nested template argument list, the '>>' has
25139 to be a typo for '> >'. We emit the error message, but we
25140 continue parsing and we push a '>' as next token, so that
25141 the argument list will be parsed correctly. Note that the
25142 global source location is still on the token before the
25143 '>>', so we need to say explicitly where we want it. */
25149 }
25150 else
25151 {
25152 /* If this is not a nested template argument list, the '>>'
25153 is a typo for '>'. Emit an error message and continue.
25154 Same deal about the token location, but here we can get it
25155 right by consuming the '>>' before issuing the diagnostic. */
25158 "spurious %<>>%>, use %<>%> to terminate "
25160 }
25161 }
25162 else
25164 /* The `>' token might be a greater-than operator again now. */
25165 parser->greater_than_is_operator_p
25167 /* Restore the SAVED_SCOPE. */
25175 }
25177 /* MEMBER_FUNCTION is a member function, or a friend. If default
25178 arguments, or the body of the function have not yet been parsed,
25179 parse them now. */
25181 static void
25183 {
25185 /* If this member is a template, get the underlying
25186 FUNCTION_DECL. */
25190 /* There should not be any class definitions in progress at this
25191 point; the bodies of members are only parsed outside of all class
25192 definitions. */
25194 /* While we're parsing the member functions we might encounter more
25195 classes. We want to handle them right away, but we don't want
25196 them getting mixed up with functions that are currently in the
25197 queue. */
25200 /* Make sure that any template parameters are in scope. */
25203 /* If the body of the function has not yet been parsed, parse it
25204 now. */
25206 {
25207 tree function_scope;
25210 /* The function is no longer pending; we are processing it. */
25215 /* If this is a local class, enter the scope of the containing
25216 function. */
25221 /* Push the body of the function onto the lexer stack. */
25224 /* Let the front end know that we going to be defining this
25225 function. */
25229 /* Don't do access checking if it is a templated function. */
25233 /* #pragma omp declare reduction needs special parsing. */
25235 {
25240 }
25241 else
25242 /* Now, parse the body of the function. */
25249 /* Leave the scope of the containing function. */
25253 }
25255 /* Remove any template parameters from the symbol table. */
25258 /* Restore the queue. */
25261 }
25263 /* If DECL contains any default args, remember it on the unparsed
25264 functions queue. */
25266 static void
25268 {
25269 tree probe;
25272 probe;
25275 {
25279 }
25280 }
25282 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
25283 which is either a FIELD_DECL or PARM_DECL. Parse it and return
25284 the result. For a PARM_DECL, PARMTYPE is the corresponding type
25285 from the parameter-type-list. */
25287 static tree
25290 {
25292 tree parsed_arg;
25298 /* Push the saved tokens for the default argument onto the parser's
25299 lexer stack. */
25305 /* Parse the default argument. */
25316 {
25317 /* In a non-template class, check conversions now. In a template,
25318 we'll wait and instantiate these as needed. */
25321 tf_warning_or_error);
25322 else
25324 }
25326 /* If the token stream has not been completely used up, then
25327 there was extra junk after the end of the default
25328 argument. */
25330 {
25333 else
25335 }
25337 /* Revert to the main lexer. */
25341 }
25343 /* FIELD is a non-static data member with an initializer which we saved for
25344 later; parse it now. */
25346 static void
25348 {
25349 tree def;
25356 NULL_TREE);
25362 }
25364 /* FN is a FUNCTION_DECL which may contains a parameter with an
25365 unparsed DEFAULT_ARG. Parse the default args now. This function
25366 assumes that the current scope is the scope in which the default
25367 argument should be processed. */
25369 static void
25371 {
25375 /* While we're parsing the default args, we might (due to the
25376 statement expression extension) encounter more classes. We want
25377 to handle them right away, but we don't want them getting mixed
25378 up with default args that are currently in the queue. */
25381 /* Local variable names (and the `this' keyword) may not appear
25382 in a default argument. */
25393 {
25395 tree parsed_arg;
25397 tree copy;
25404 /* This can happen for a friend declaration for a function
25405 already declared with default arguments. */
25408 parsed_arg
25410 default_arg,
25413 {
25415 }
25419 /* Update any instantiations we've already created. */
25423 }
25427 /* Make sure no default arg is missing. */
25430 /* Restore the state of local_variables_forbidden_p. */
25433 /* Restore the queue. */
25435 }
25437 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
25439 sizeof ... ( identifier )
25441 where the 'sizeof' token has already been consumed. */
25443 static tree
25445 {
25446 /* Consume the `...'. */
25453 else
25461 /* The name is not qualified. */
25479 }
25481 /* Parse the operand of `sizeof' (or a similar operator). Returns
25482 either a TYPE or an expression, depending on the form of the
25483 input. The KEYWORD indicates which kind of expression we have
25484 encountered. */
25486 static tree
25488 {
25495 /* If it's a `...', then we are computing the length of a parameter
25496 pack. */
25501 /* Types cannot be defined in a `sizeof' expression. Save away the
25502 old message. */
25504 /* And create the new one. */
25510 /* The restrictions on constant-expressions do not apply inside
25511 sizeof expressions. */
25512 saved_integral_constant_expression_p
25514 saved_non_integral_constant_expression_p
25518 /* Do not actually evaluate the expression. */
25521 /* If it's a `(', then we might be looking at the type-id
25522 construction. */
25524 {
25527 /* We can't be sure yet whether we're looking at a type-id or an
25528 expression. */
25530 /* Note: as a GNU Extension, compound literals are considered
25531 postfix-expressions as they are in C99, so they are valid
25532 arguments to sizeof. See comment in cp_parser_cast_expression
25533 for details. */
25536 else
25537 {
25540 /* Look for the type-id. */
25542 /* Look for the closing `)'. */
25545 }
25547 /* If all went well, then we're done. */
25549 {
25550 cp_decl_specifier_seq decl_specs;
25552 /* Build a trivial decl-specifier-seq. */
25556 /* Call grokdeclarator to figure out what type this is. */
25559 TYPENAME,
25562 }
25563 }
25565 /* If the type-id production did not work out, then we must be
25566 looking at the unary-expression production. */
25570 /* Go back to evaluating expressions. */
25574 /* Free the message we created. */
25576 /* And restore the old one. */
25578 parser->integral_constant_expression_p
25580 parser->non_integral_constant_expression_p
25584 }
25586 /* If the current declaration has no declarator, return true. */
25588 static bool
25590 {
25591 /* If the next token is a `;' or a `,' then there is no
25592 declarator. */
25595 }
25597 /* Update the DECL_SPECS to reflect the storage class indicated by
25598 KEYWORD. */
25600 static void
25605 {
25606 cp_storage_class storage_class;
25609 {
25613 }
25615 {
25618 }
25623 {
25626 }
25629 {
25647 }
25651 /* A storage class specifier cannot be applied alongside a typedef
25652 specifier. If there is a typedef specifier present then set
25653 conflicting_specifiers_p which will trigger an error later
25654 on in grokdeclarator. */
25657 }
25659 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
25660 is true, the type is a class or enum definition. */
25662 static void
25664 tree type_spec,
25667 {
25670 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
25671 (with, for example, in "typedef int wchar_t;") we remember that
25672 this is what happened. In system headers, we ignore these
25673 declarations so that G++ can work with system headers that are not
25674 C++-safe. */
25676 && !type_definition_p
25686 {
25689 ds_redefined_builtin_type_spec,
25690 token);
25692 {
25696 }
25697 }
25700 else
25701 {
25706 }
25707 }
25709 /* True iff TOKEN is the GNU keyword __thread. */
25711 static bool
25713 {
25716 }
25718 /* Set the location for a declarator specifier and check if it is
25719 duplicated.
25721 DECL_SPECS is the sequence of declarator specifiers onto which to
25722 set the location.
25724 DS is the single declarator specifier to set which location is to
25725 be set onto the existing sequence of declarators.
25727 LOCATION is the location for the declarator specifier to
25728 consider. */
25730 static void
25733 {
25742 {
25746 }
25747 else
25748 {
25750 {
25754 else
25755 {
25758 OPT_Wlong_long,
25760 }
25761 }
25763 {
25768 else
25770 }
25771 else
25772 {
25788 "__complex"
25789 };
25792 }
25793 }
25794 }
25796 /* Return true iff the declarator specifier DS is present in the
25797 sequence of declarator specifiers DECL_SPECS. */
25799 bool
25801 cp_decl_spec ds)
25802 {
25809 }
25811 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
25812 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
25814 static bool
25816 {
25818 }
25820 /* Issue an error message indicating that TOKEN_DESC was expected.
25821 If KEYWORD is true, it indicated this function is called by
25822 cp_parser_require_keword and the required token can only be
25823 a indicated keyword. */
25825 static void
25827 required_token token_desc,
25829 {
25831 {
25900 }
25902 {
25904 {
25983 }
25984 }
25985 else
25987 }
25991 /* If the next token is of the indicated TYPE, consume it. Otherwise,
25992 issue an error message indicating that TOKEN_DESC was expected.
25994 Returns the token consumed, if the token had the appropriate type.
25995 Otherwise, returns NULL. */
26000 required_token token_desc)
26001 {
26004 else
26005 {
26006 /* Output the MESSAGE -- unless we're parsing tentatively. */
26010 }
26011 }
26013 /* An error message is produced if the next token is not '>'.
26014 All further tokens are skipped until the desired token is
26015 found or '{', '}', ';' or an unbalanced ')' or ']'. */
26017 static void
26019 {
26020 /* Current level of '< ... >'. */
26022 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
26025 /* Are we ready, yet? If not, issue error message. */
26029 /* Skip tokens until the desired token is found. */
26031 {
26032 /* Peek at the next token. */
26034 {
26042 /* C++0x views the `>>' operator as two `>' tokens, but
26043 C++98 does not. */
26046 {
26047 /* We've hit a `>>' where the first `>' closes the
26048 template argument list, and the second `>' is
26049 spurious. Just consume the `>>' and stop; we've
26050 already produced at least one error. */
26053 }
26054 /* Fall through for C++0x, so we handle the second `>' in
26055 the `>>'. */
26059 {
26060 /* We've reached the token we want, consume it and stop. */
26063 }
26082 /* The '>' was probably forgotten, don't look further. */
26087 }
26089 /* Consume this token. */
26091 }
26092 }
26094 /* If the next token is the indicated keyword, consume it. Otherwise,
26095 issue an error message indicating that TOKEN_DESC was expected.
26097 Returns the token consumed, if the token had the appropriate type.
26098 Otherwise, returns NULL. */
26103 required_token token_desc)
26104 {
26108 {
26111 }
26114 }
26116 /* Returns TRUE iff TOKEN is a token that can begin the body of a
26117 function-definition. */
26119 static bool
26121 {
26124 /* A ctor-initializer begins with a `:'. */
26126 /* A function-try-block begins with `try'. */
26128 /* A function-transaction-block begins with `__transaction_atomic'
26129 or `__transaction_relaxed'. */
26132 /* The named return value extension begins with `return'. */
26134 }
26136 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
26137 definition. */
26139 static bool
26141 {
26148 }
26150 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
26151 C++0x) ending a template-argument. */
26153 static bool
26155 {
26163 }
26165 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
26166 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
26168 static bool
26171 {
26177 /* Check for the sequence `<::' in the original code. It would be lexed as
26178 `[:', where `[' is a digraph, and there is no whitespace before
26179 `:'. */
26181 {
26186 }
26188 }
26190 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
26191 or none_type otherwise. */
26193 static enum tag_types
26195 {
26197 {
26207 }
26208 }
26210 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
26211 or none_type otherwise or if the token is null. */
26213 static enum tag_types
26215 {
26220 {
26228 }
26229 }
26231 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
26233 static void
26235 {
26239 {
26243 type))
26246 }
26247 }
26249 /* Issue an error message if DECL is redeclared with different
26250 access than its original declaration [class.access.spec/3].
26251 This applies to nested classes and nested class templates.
26252 [class.mem/1]. */
26254 static void
26256 {
26265 }
26267 /* Look for the `template' keyword, as a syntactic disambiguator.
26268 Return TRUE iff it is present, in which case it will be
26269 consumed. */
26271 static bool
26273 {
26275 {
26276 /* In C++98 the `template' keyword can only be used within templates;
26277 outside templates the parser can always figure out what is a
26278 template and what is not. In C++11, per the resolution of DR 468,
26279 `template' is allowed in cases where it is not strictly necessary. */
26282 {
26285 "in C++98 %<template%> (as a disambiguator) is only "
26287 /* If this part of the token stream is rescanned, the same
26288 error message would be generated. So, we purge the token
26289 from the stream. */
26292 }
26293 else
26294 {
26295 /* Consume the `template' keyword. */
26298 }
26299 }
26301 }
26303 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
26304 set PARSER->SCOPE, and perform other related actions. */
26306 static void
26308 {
26314 /* Get the stored value. */
26316 /* Perform any access checks that were deferred. */
26319 {
26324 }
26325 /* Set the scope from the stored value. */
26329 }
26331 /* Consume tokens up through a non-nested END token. Returns TRUE if we
26332 encounter the end of a block before what we were looking for. */
26334 static bool
26338 {
26340 {
26343 /* Abort a parenthesized expression if we encounter a semicolon. */
26347 /* If we've reached the end of the file, stop. */
26353 /* We've hit the end of an enclosing block, so there's been some
26354 kind of syntax error. */
26357 /* Consume the token. */
26359 /* See if it starts a new group. */
26361 {
26363 /* In theory this should probably check end == '}', but
26364 cp_parser_save_member_function_body needs it to exit
26365 after either '}' or ')' when called with ')'. */
26368 }
26370 {
26374 }
26379 }
26380 }
26382 /* Like above, for caching a default argument or NSDMI. Both of these are
26383 terminated by a non-nested comma, but it can be unclear whether or not a
26384 comma is nested in a template argument list unless we do more parsing.
26385 In order to handle this ambiguity, when we encounter a ',' after a '<'
26386 we try to parse what follows as a parameter-declaration-list (in the
26387 case of a default argument) or a member-declarator (in the case of an
26388 NSDMI). If that succeeds, then we stop caching. */
26390 static tree
26392 {
26397 tree default_argument;
26399 /* Add tokens until we have processed the entire default
26400 argument. We add the range [first_token, token). */
26403 {
26404 /* For list-initialization, this is straightforward. */
26407 }
26409 {
26412 /* Peek at the next token. */
26414 /* What we do depends on what token we have. */
26416 {
26417 /* In valid code, a default argument must be
26418 immediately followed by a `,' `)', or `...'. */
26421 {
26422 /* If we've seen a '<', we might be in a
26423 template-argument-list. Until Core issue 325 is
26424 resolved, we don't know how this situation ought
26425 to be handled, so try to DTRT. We check whether
26426 what comes after the comma is a valid parameter
26427 declaration list. If it is, then the comma ends
26428 the default argument; otherwise the default
26429 argument continues. */
26432 /* Set ITALP so cp_parser_parameter_declaration_list
26433 doesn't decide to commit to this parse. */
26441 {
26448 }
26449 else
26450 {
26454 }
26461 }
26464 /* If we run into a non-nested `;', `}', or `]',
26465 then the code is invalid -- but the default
26466 argument is certainly over. */
26471 /* Handle correctly int n = sizeof ... ( p ); */
26474 /* Update DEPTH, if necessary. */
26489 /* This might be the comparison operator, or it might
26490 start a template argument list. */
26497 /* Fall through for C++0x, which treats the `>>'
26498 operator like two `>' tokens in certain
26499 cases. */
26503 {
26504 /* This might be an operator, or it might close a
26505 template argument list. But if a previous '<'
26506 started a template argument list, this will have
26507 closed it, so we can't be in one anymore. */
26511 }
26514 /* If we run out of tokens, issue an error message. */
26523 /* In these cases, we should look for template-ids.
26524 For example, if the default argument is
26525 `X<int, double>()', we need to do name lookup to
26526 figure out whether or not `X' is a template; if
26527 so, the `,' does not end the default argument.
26529 That is not yet done. */
26534 }
26536 /* If we've reached the end, stop. */
26540 /* Add the token to the token block. */
26542 }
26544 /* Create a DEFAULT_ARG to represent the unparsed default
26545 argument. */
26552 }
26554 /* Begin parsing tentatively. We always save tokens while parsing
26555 tentatively so that if the tentative parsing fails we can restore the
26556 tokens. */
26558 static void
26560 {
26561 /* Enter a new parsing context. */
26563 /* Begin saving tokens. */
26565 /* In order to avoid repetitive access control error messages,
26566 access checks are queued up until we are no longer parsing
26567 tentatively. */
26569 }
26571 /* Commit to the currently active tentative parse. */
26573 static void
26575 {
26579 /* Mark all of the levels as committed. */
26582 {
26589 }
26590 }
26592 /* Commit to the topmost currently active tentative parse.
26594 Note that this function shouldn't be called when there are
26595 irreversible side-effects while in a tentative state. For
26596 example, we shouldn't create a permanent entry in the symbol
26597 table, or issue an error message that might not apply if the
26598 tentative parse is aborted. */
26600 static void
26602 {
26607 {
26615 }
26616 }
26618 /* Abort the currently active tentative parse. All consumed tokens
26619 will be rolled back, and no diagnostics will be issued. */
26621 static void
26623 {
26627 /* Now, pretend that we want to see if the construct was
26628 successfully parsed. */
26630 }
26632 /* Stop parsing tentatively. If a parse error has occurred, restore the
26633 token stream. Otherwise, commit to the tokens we have consumed.
26634 Returns true if no error occurred; false otherwise. */
26636 static bool
26638 {
26642 /* Remember whether or not an error occurred, since we are about to
26643 destroy that information. */
26645 /* Remove the topmost context from the stack. */
26648 /* If no parse errors occurred, commit to the tentative parse. */
26650 {
26651 /* Commit to the tokens read tentatively, unless that was
26652 already done. */
26657 }
26658 /* Otherwise, if errors occurred, roll back our state so that things
26659 are just as they were before we began the tentative parse. */
26660 else
26661 {
26664 }
26665 /* Add the context to the front of the free list. */
26670 }
26672 /* Returns true if we are parsing tentatively and are not committed to
26673 this tentative parse. */
26675 static bool
26677 {
26680 }
26682 /* Returns nonzero iff an error has occurred during the most recent
26683 tentative parse. */
26685 static bool
26687 {
26690 }
26692 /* Returns nonzero if GNU extensions are allowed. */
26694 static bool
26696 {
26698 }
26699 \f
26700 /* Objective-C++ Productions */
26703 /* Parse an Objective-C expression, which feeds into a primary-expression
26704 above.
26706 objc-expression:
26707 objc-message-expression
26708 objc-string-literal
26709 objc-encode-expression
26710 objc-protocol-expression
26711 objc-selector-expression
26713 Returns a tree representation of the expression. */
26715 static tree
26717 {
26718 /* Try to figure out what kind of declaration is present. */
26722 {
26732 {
26744 }
26750 }
26753 }
26755 /* Parse an Objective-C message expression.
26757 objc-message-expression:
26758 [ objc-message-receiver objc-message-args ]
26760 Returns a representation of an Objective-C message. */
26762 static tree
26764 {
26773 }
26775 /* Parse an objc-message-receiver.
26777 objc-message-receiver:
26778 expression
26779 simple-type-specifier
26781 Returns a representation of the type or expression. */
26783 static tree
26785 {
26786 tree rcv;
26788 /* An Objective-C message receiver may be either (1) a type
26789 or (2) an expression. */
26793 /* If that worked out, fine. */
26800 CP_PARSER_FLAGS_NONE);
26807 }
26809 /* Parse the arguments and selectors comprising an Objective-C message.
26811 objc-message-args:
26812 objc-selector
26813 objc-selector-args
26814 objc-selector-args , objc-comma-args
26816 objc-selector-args:
26817 objc-selector [opt] : assignment-expression
26818 objc-selector-args objc-selector [opt] : assignment-expression
26820 objc-comma-args:
26821 assignment-expression
26822 objc-comma-args , assignment-expression
26824 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
26825 selector arguments and TREE_VALUE containing a list of comma
26826 arguments. */
26828 static tree
26830 {
26836 {
26842 /* Detect if we have a unary selector. */
26851 sel_args
26856 }
26858 /* Handle non-selector arguments, if any. */
26860 {
26861 tree arg;
26866 addl_args
26871 }
26874 {
26877 }
26880 }
26882 /* Parse an Objective-C encode expression.
26884 objc-encode-expression:
26885 @encode objc-typename
26887 Returns an encoded representation of the type argument. */
26889 static tree
26891 {
26892 tree type;
26902 {
26906 }
26908 /* This happens if we find @encode(T) (where T is a template
26909 typename or something dependent on a template typename) when
26910 parsing a template. In that case, we can't compile it
26911 immediately, but we rather create an AT_ENCODE_EXPR which will
26912 need to be instantiated when the template is used.
26913 */
26915 {
26919 }
26922 }
26924 /* Parse an Objective-C @defs expression. */
26926 static tree
26928 {
26929 tree name;
26937 }
26939 /* Parse an Objective-C protocol expression.
26941 objc-protocol-expression:
26942 @protocol ( identifier )
26944 Returns a representation of the protocol expression. */
26946 static tree
26948 {
26949 tree proto;
26957 }
26959 /* Parse an Objective-C selector expression.
26961 objc-selector-expression:
26962 @selector ( objc-method-signature )
26964 objc-method-signature:
26965 objc-selector
26966 objc-selector-seq
26968 objc-selector-seq:
26969 objc-selector :
26970 objc-selector-seq objc-selector :
26972 Returns a representation of the method selector. */
26974 static tree
26976 {
26988 {
26997 {
26998 /* Detect if we have a unary selector. */
27000 {
27003 }
27004 else
27005 {
27007 }
27008 }
27013 {
27014 sel_seq
27017 sel_seq
27020 }
27021 else
27022 sel_seq
27027 }
27029 finish_selector:
27033 }
27035 /* Parse a list of identifiers.
27037 objc-identifier-list:
27038 identifier
27039 objc-identifier-list , identifier
27041 Returns a TREE_LIST of identifier nodes. */
27043 static tree
27045 {
27046 tree identifier;
27047 tree list;
27058 {
27065 identifier));
27067 }
27070 }
27072 /* Parse an Objective-C alias declaration.
27074 objc-alias-declaration:
27075 @compatibility_alias identifier identifier ;
27077 This function registers the alias mapping with the Objective-C front end.
27078 It returns nothing. */
27080 static void
27082 {
27090 }
27092 /* Parse an Objective-C class forward-declaration.
27094 objc-class-declaration:
27095 @class objc-identifier-list ;
27097 The function registers the forward declarations with the Objective-C
27098 front end. It returns nothing. */
27100 static void
27102 {
27105 {
27106 tree id;
27116 else
27118 }
27120 }
27122 /* Parse a list of Objective-C protocol references.
27124 objc-protocol-refs-opt:
27125 objc-protocol-refs [opt]
27127 objc-protocol-refs:
27128 < objc-identifier-list >
27130 Returns a TREE_LIST of identifiers, if any. */
27132 static tree
27134 {
27138 {
27142 }
27145 }
27147 /* Parse a Objective-C visibility specification. */
27149 static void
27151 {
27155 {
27170 }
27172 /* Eat '@private'/'@protected'/'@public'. */
27174 }
27176 /* Parse an Objective-C method type. Return 'true' if it is a class
27177 (+) method, and 'false' if it is an instance (-) method. */
27181 {
27184 else
27186 }
27188 /* Parse an Objective-C protocol qualifier. */
27190 static tree
27192 {
27205 {
27210 }
27213 }
27215 /* Parse an Objective-C typename. */
27217 static tree
27219 {
27223 {
27229 /* An ObjC type name may consist of just protocol qualifiers, in which
27230 case the type shall default to 'id'. */
27232 {
27235 /* If the type could not be parsed, an error has already
27236 been produced. For error recovery, behave as if it had
27237 not been specified, which will use the default type
27238 'id'. */
27240 {
27242 /* We need to skip to the closing parenthesis as
27243 cp_parser_type_id() does not seem to do it for
27244 us. */
27249 }
27250 }
27254 }
27257 }
27259 /* Check to see if TYPE refers to an Objective-C selector name. */
27261 static bool
27263 {
27269 }
27271 /* Parse an Objective-C selector. */
27273 static tree
27275 {
27279 {
27282 }
27284 /* C++ operator names are allowed to appear in ObjC selectors. */
27286 {
27299 }
27300 }
27302 /* Parse an Objective-C params list. */
27304 static tree
27306 {
27312 {
27322 /* Detect if we have a unary selector. */
27325 {
27328 }
27332 {
27333 /* Something went quite wrong. There should be a colon
27334 here, but there is not. Stop parsing parameters. */
27336 }
27338 /* New ObjC allows attributes on parameters too. */
27343 params
27346 type_name,
27347 identifier,
27348 parm_attr));
27351 }
27354 {
27357 }
27359 /* We allow tail attributes for the method. */
27361 {
27369 }
27372 {
27375 }
27377 }
27379 /* Parse the non-keyword Objective-C params. */
27381 static tree
27384 {
27390 {
27392 tree parm;
27398 {
27403 }
27405 /* TODO: parse attributes for tail parameters. */
27414 }
27416 /* We allow tail attributes for the method. */
27418 {
27420 {
27425 }
27426 else
27427 /* We have an error, but parse the attributes, so that we can
27428 carry on. */
27434 }
27437 }
27439 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
27441 static void
27443 {
27446 /* If the next token is `extern' and the following token is a string
27447 literal, then we have a linkage specification. */
27449 && cp_parser_is_pure_string_literal
27452 /* Handle #pragma, if any. */
27455 /* Allow stray semicolons. */
27458 /* Mark methods as optional or required, when building protocols. */
27460 {
27463 }
27465 {
27468 }
27471 /* Other stray characters must generate errors. */
27473 {
27477 }
27478 /* Finally, try to parse a block-declaration, or a function-definition. */
27479 else
27481 }
27483 /* Parse a method signature. */
27485 static tree
27487 {
27503 }
27505 static bool
27507 {
27508 tree tattr;
27513 /* If the attributes are followed by a method introducer, this is not allowed.
27514 Dump the attributes and flag the situation. */
27519 /* Otherwise, the attributes introduce some interstitial code, possibly so
27520 rewind to allow that check. */
27523 }
27525 /* Parse an Objective-C method prototype list. */
27527 static void
27529 {
27533 {
27535 {
27540 else
27544 {
27548 }
27551 }
27557 OPT_Wattributes,
27559 else
27560 /* Allow for interspersed non-ObjC++ code. */
27564 }
27568 else
27572 }
27574 /* Parse an Objective-C method definition list. */
27576 static void
27578 {
27582 {
27583 tree meth;
27586 {
27592 else
27597 {
27601 }
27603 NULL_TREE);
27605 /* For historical reasons, we accept an optional semicolon. */
27612 {
27619 }
27620 }
27621 /* The following case will be removed once @synthesize is
27622 completely implemented. */
27633 else
27634 /* Allow for interspersed non-ObjC++ code. */
27638 }
27642 else
27646 }
27648 /* Parse Objective-C ivars. */
27650 static void
27652 {
27663 {
27664 cp_decl_specifier_seq declspecs;
27666 tree prefix_attributes;
27674 CP_PARSER_FLAGS_OPTIONAL,
27678 /* auto, register, static, extern, mutable. */
27680 {
27683 }
27685 /* thread_local. */
27687 {
27690 }
27692 /* typedef. */
27694 {
27697 }
27702 /* Keep going until we hit the `;' at the end of the
27703 declaration. */
27705 {
27710 /* Check for a (possibly unnamed) bitfield declaration. */
27718 {
27719 /* Get the name of the bitfield. */
27722 sfk_none);
27724 eat_colon:
27726 /* Get the width of the bitfield. */
27727 width
27729 }
27730 else
27731 {
27732 /* Parse the declarator. */
27733 declarator
27739 }
27741 /* Look for attributes that apply to the ivar. */
27743 /* Remember which attributes are prefix attributes and
27744 which are not. */
27746 /* Combine the attributes. */
27750 /* Create the bitfield declaration. */
27752 width,
27753 attributes);
27754 else
27759 /* Add the instance variable. */
27763 /* Reset PREFIX_ATTRIBUTES. */
27772 {
27775 }
27777 }
27781 }
27786 /* Do not consume the RID_AT_END, so it will be read again as terminating
27787 the @interface of @implementation. */
27791 /* For historical reasons, we accept an optional semicolon. */
27794 }
27796 /* Parse an Objective-C protocol declaration. */
27798 static void
27800 {
27806 {
27811 }
27813 /* See if we have a forward declaration or a definition. */
27816 /* Try a forward declaration first. */
27818 {
27820 {
27821 tree id;
27831 else
27833 }
27835 }
27837 /* Ok, we got a full-fledged definition (or at least should). */
27838 else
27839 {
27844 }
27845 }
27847 /* Parse an Objective-C superclass or category. */
27849 static void
27854 {
27860 {
27863 }
27865 {
27868 /* If there is no category name, and this is an @interface, we
27869 have a class extension. */
27871 {
27874 }
27875 else
27879 }
27880 }
27882 /* Parse an Objective-C class interface. */
27884 static void
27886 {
27893 {
27894 /* It's hard to recover because even if valid @interface stuff
27895 is to follow, we can't compile it (or validate it) if we
27896 don't even know which class it refers to. Let's assume this
27897 was a stray '@interface' token in the stream and skip it.
27898 */
27900 }
27905 /* We have either a class or a category on our hands. */
27908 else
27909 {
27911 /* Handle instance variable declarations, if any. */
27914 }
27917 }
27919 /* Parse an Objective-C class implementation. */
27921 static void
27923 {
27930 {
27931 /* It's hard to recover because even if valid @implementation
27932 stuff is to follow, we can't compile it (or validate it) if
27933 we don't even know which class it refers to. Let's assume
27934 this was a stray '@implementation' token in the stream and
27935 skip it.
27936 */
27938 }
27942 /* We have either a class or a category on our hands. */
27945 else
27946 {
27948 /* Handle instance variable declarations, if any. */
27951 }
27954 }
27956 /* Consume the @end token and finish off the implementation. */
27958 static void
27960 {
27963 }
27965 /* Parse an Objective-C declaration. */
27967 static void
27969 {
27970 /* Try to figure out what kind of declaration is present. */
27975 {
27991 }
27994 {
28017 }
28018 }
28020 /* Parse an Objective-C try-catch-finally statement.
28022 objc-try-catch-finally-stmt:
28023 @try compound-statement objc-catch-clause-seq [opt]
28024 objc-finally-clause [opt]
28026 objc-catch-clause-seq:
28027 objc-catch-clause objc-catch-clause-seq [opt]
28029 objc-catch-clause:
28030 @catch ( objc-exception-declaration ) compound-statement
28032 objc-finally-clause:
28033 @finally compound-statement
28035 objc-exception-declaration:
28036 parameter-declaration
28037 '...'
28039 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
28041 Returns NULL_TREE.
28043 PS: This function is identical to c_parser_objc_try_catch_finally_statement
28044 for C. Keep them in sync. */
28046 static tree
28048 {
28049 location_t location;
28050 tree stmt;
28055 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
28056 node, lest it get absorbed into the surrounding block. */
28062 {
28071 {
28072 /* We have "@catch (...)" (where the '...' are literally
28073 what is in the code). Skip the '...'.
28074 parameter_declaration is set to NULL_TREE, and
28075 objc_being_catch_clauses() knows that that means
28076 '...'. */
28079 }
28080 else
28081 {
28082 /* We have "@catch (NSException *exception)" or something
28083 like that. Parse the parameter declaration. */
28087 else
28092 }
28095 else
28096 {
28097 /* If there was no open parenthesis, we are recovering from
28098 an error, and we are trying to figure out what mistake
28099 the user has made. */
28101 /* If there is an immediate closing parenthesis, the user
28102 probably forgot the opening one (ie, they typed "@catch
28103 NSException *e)". Parse the closing parenthesis and keep
28104 going. */
28108 /* If these is no immediate closing parenthesis, the user
28109 probably doesn't know that parenthesis are required at
28110 all (ie, they typed "@catch NSException *e"). So, just
28111 forget about the closing parenthesis and keep going. */
28112 }
28116 }
28118 {
28121 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
28122 node, lest it get absorbed into the surrounding block. */
28126 }
28129 }
28131 /* Parse an Objective-C synchronized statement.
28133 objc-synchronized-stmt:
28134 @synchronized ( expression ) compound-statement
28136 Returns NULL_TREE. */
28138 static tree
28140 {
28141 location_t location;
28152 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
28153 node, lest it get absorbed into the surrounding block. */
28158 }
28160 /* Parse an Objective-C throw statement.
28162 objc-throw-stmt:
28163 @throw assignment-expression [opt] ;
28165 Returns a constructed '@throw' statement. */
28167 static tree
28169 {
28181 }
28183 /* Parse an Objective-C statement. */
28185 static tree
28187 {
28188 /* Try to figure out what kind of declaration is present. */
28192 {
28203 }
28206 }
28208 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
28209 look ahead to see if an objc keyword follows the attributes. This
28210 is to detect the use of prefix attributes on ObjC @interface and
28211 @protocol. */
28213 static bool
28215 {
28220 {
28223 }
28226 }
28228 /* This routine is a minimal replacement for
28229 c_parser_struct_declaration () used when parsing the list of
28230 types/names or ObjC++ properties. For example, when parsing the
28231 code
28233 @property (readonly) int a, b, c;
28235 this function is responsible for parsing "int a, int b, int c" and
28236 returning the declarations as CHAIN of DECLs.
28238 TODO: Share this code with cp_parser_objc_class_ivars. It's very
28239 similar parsing. */
28240 static tree
28242 {
28244 cp_decl_specifier_seq declspecs;
28246 tree prefix_attributes;
28249 CP_PARSER_FLAGS_NONE,
28256 /* auto, register, static, extern, mutable. */
28258 {
28261 }
28263 /* thread_local. */
28265 {
28268 }
28270 /* typedef. */
28272 {
28275 }
28280 /* Keep going until we hit the `;' at the end of the declaration. */
28282 {
28287 /* Parse the declarator. */
28291 /* Look for attributes that apply to the ivar. */
28293 /* Remember which attributes are prefix attributes and
28294 which are not. */
28296 /* Combine the attributes. */
28306 /* Reset PREFIX_ATTRIBUTES. */
28317 {
28320 }
28321 else
28323 }
28325 }
28327 /* Parse an Objective-C @property declaration. The syntax is:
28329 objc-property-declaration:
28330 '@property' objc-property-attributes[opt] struct-declaration ;
28332 objc-property-attributes:
28333 '(' objc-property-attribute-list ')'
28335 objc-property-attribute-list:
28336 objc-property-attribute
28337 objc-property-attribute-list, objc-property-attribute
28339 objc-property-attribute
28340 'getter' = identifier
28341 'setter' = identifier
28342 'readonly'
28343 'readwrite'
28344 'assign'
28345 'retain'
28346 'copy'
28347 'nonatomic'
28349 For example:
28350 @property NSString *name;
28351 @property (readonly) id object;
28352 @property (retain, nonatomic, getter=getTheName) id name;
28353 @property int a, b, c;
28355 PS: This function is identical to
28356 c_parser_objc_at_property_declaration for C. Keep them in sync. */
28357 static void
28359 {
28360 /* The following variables hold the attributes of the properties as
28361 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
28362 seen. When we see an attribute, we set them to 'true' (if they
28363 are boolean properties) or to the identifier (if they have an
28364 argument, ie, for getter and setter). Note that here we only
28365 parse the list of attributes, check the syntax and accumulate the
28366 attributes that we find. objc_add_property_declaration() will
28367 then process the information. */
28377 /* 'properties' is the list of properties that we read. Usually a
28378 single one, but maybe more (eg, in "@property int a, b, c;" there
28379 are three). */
28380 tree properties;
28381 location_t loc;
28387 /* Parse the optional attribute list... */
28389 {
28390 /* Eat the '('. */
28394 {
28400 {
28403 }
28407 {
28418 {
28422 else
28427 }
28430 {
28434 }
28436 {
28438 {
28441 }
28442 else
28446 else
28448 }
28449 else
28450 {
28452 {
28455 }
28456 else
28458 }
28464 }
28471 else
28473 }
28475 /* FIXME: "@property (setter, assign);" will generate a spurious
28476 "error: expected ‘)’ before ‘,’ token". This is because
28477 cp_parser_require, unlike the C counterpart, will produce an
28478 error even if we are in error recovery. */
28480 {
28485 }
28486 }
28488 /* ... and the property declaration(s). */
28492 {
28494 /* If the next token is now a `;', consume it. */
28498 }
28502 else
28503 {
28504 /* Comma-separated properties are chained together in
28505 reverse order; add them one by one. */
28514 }
28517 }
28519 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
28521 objc-synthesize-declaration:
28522 @synthesize objc-synthesize-identifier-list ;
28524 objc-synthesize-identifier-list:
28525 objc-synthesize-identifier
28526 objc-synthesize-identifier-list, objc-synthesize-identifier
28528 objc-synthesize-identifier
28529 identifier
28530 identifier = identifier
28532 For example:
28533 @synthesize MyProperty;
28534 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
28536 PS: This function is identical to c_parser_objc_at_synthesize_declaration
28537 for C. Keep them in sync.
28538 */
28539 static void
28541 {
28543 location_t loc;
28548 {
28552 {
28555 }
28557 {
28561 {
28564 }
28565 }
28566 else
28571 else
28573 }
28576 }
28578 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
28580 objc-dynamic-declaration:
28581 @dynamic identifier-list ;
28583 For example:
28584 @dynamic MyProperty;
28585 @dynamic MyProperty, AnotherProperty;
28587 PS: This function is identical to c_parser_objc_at_dynamic_declaration
28588 for C. Keep them in sync.
28589 */
28590 static void
28592 {
28594 location_t loc;
28599 {
28600 tree property;
28603 {
28606 }
28610 else
28612 }
28615 }
28617 \f
28618 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
28620 /* Returns name of the next clause.
28621 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
28622 the token is not consumed. Otherwise appropriate pragma_omp_clause is
28623 returned and the token is consumed. */
28625 static pragma_omp_clause
28627 {
28641 {
28646 {
28789 }
28790 }
28796 }
28798 /* Validate that a clause of the given type does not already exist. */
28800 static void
28803 {
28804 tree c;
28808 {
28811 }
28812 }
28814 /* OpenMP 2.5:
28815 variable-list:
28816 identifier
28817 variable-list , identifier
28819 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
28820 colon). An opening parenthesis will have been consumed by the caller.
28822 If KIND is nonzero, create the appropriate node and install the decl
28823 in OMP_CLAUSE_DECL and add the node to the head of the list.
28825 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
28826 return the list created.
28828 COLON can be NULL if only closing parenthesis should end the list,
28829 or pointer to bool which will receive false if the list is terminated
28830 by closing parenthesis or true if the list is terminated by colon. */
28832 static tree
28835 {
28839 {
28842 }
28844 {
28861 {
28863 {
28866 {
28870 }
28871 /* FALL THROUGH. */
28877 {
28885 parser->colon_corrects_to_scope_p
28889 else
28890 {
28891 /* Look for `:'. */
28895 CPP_CLOSE_SQUARE))
28897 }
28898 /* Look for the closing `]'. */
28900 RT_CLOSE_SQUARE))
28904 {
28907 {
28911 }
28915 {
28919 }
28920 }
28923 }
28927 }
28933 }
28934 else
28937 get_comma:
28941 }
28947 {
28951 }
28954 {
28957 /* Try to resync to an unnested comma. Copied from
28958 cp_parser_parenthesized_expression_list. */
28959 skip_comma:
28968 }
28971 }
28973 /* Similarly, but expect leading and trailing parenthesis. This is a very
28974 common case for omp clauses. */
28976 static tree
28978 {
28982 }
28984 /* OpenACC 2.0:
28985 copy ( variable-list )
28986 copyin ( variable-list )
28987 copyout ( variable-list )
28988 create ( variable-list )
28989 delete ( variable-list )
28990 present ( variable-list )
28991 present_or_copy ( variable-list )
28992 pcopy ( variable-list )
28993 present_or_copyin ( variable-list )
28994 pcopyin ( variable-list )
28995 present_or_copyout ( variable-list )
28996 pcopyout ( variable-list )
28997 present_or_create ( variable-list )
28998 pcreate ( variable-list ) */
29000 static tree
29002 tree list)
29003 {
29006 {
29046 }
29054 }
29056 /* OpenACC 2.0:
29057 deviceptr ( variable-list ) */
29059 static tree
29061 {
29065 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
29066 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
29067 variable-list must only allow for pointer variables. */
29070 {
29073 /* FIXME diagnostics: Ideally we should keep individual
29074 locations for all the variables in the var list to make the
29075 following errors more precise. Perhaps
29076 c_parser_omp_var_list_parens should construct a list of
29077 locations to go along with the var list. */
29082 ;
29091 }
29094 }
29096 /* OpenACC:
29097 vector_length ( expression ) */
29099 static tree
29101 {
29111 {
29114 }
29117 {
29122 }
29125 location);
29133 }
29135 /* OpenACC 2.0
29136 Parse wait clause or directive parameters. */
29138 static tree
29140 {
29150 {
29155 }
29162 {
29166 {
29169 else
29170 {
29177 }
29178 }
29179 }
29182 }
29184 /* OpenACC:
29185 wait ( int-expr-list ) */
29187 static tree
29189 {
29198 }
29200 /* OpenMP 3.0:
29201 collapse ( constant-expression ) */
29203 static tree
29205 {
29207 location_t loc;
29208 HOST_WIDE_INT n;
29228 {
29231 }
29239 }
29241 /* OpenMP 2.5:
29242 default ( shared | none ) */
29244 static tree
29246 {
29248 tree c;
29253 {
29258 {
29273 }
29276 }
29277 else
29278 {
29279 invalid_kind:
29281 }
29297 }
29299 /* OpenMP 3.1:
29300 final ( expression ) */
29302 static tree
29304 {
29325 }
29327 /* OpenMP 2.5:
29328 if ( expression ) */
29330 static tree
29332 {
29353 }
29355 /* OpenMP 3.1:
29356 mergeable */
29358 static tree
29361 {
29362 tree c;
29365 location);
29370 }
29372 /* OpenMP 2.5:
29373 nowait */
29375 static tree
29378 {
29379 tree c;
29386 }
29388 /* OpenACC:
29389 num_gangs ( expression ) */
29391 static tree
29393 {
29409 {
29412 }
29422 }
29424 /* OpenMP 2.5:
29425 num_threads ( expression ) */
29427 static tree
29429 location_t location)
29430 {
29452 }
29454 /* OpenACC:
29455 num_workers ( expression ) */
29457 static tree
29459 {
29475 {
29478 }
29481 location);
29489 }
29491 /* OpenMP 2.5:
29492 ordered */
29494 static tree
29497 {
29498 tree c;
29506 }
29508 /* OpenMP 2.5:
29509 reduction ( reduction-operator : variable-list )
29511 reduction-operator:
29512 One of: + * - & ^ | && ||
29514 OpenMP 3.1:
29516 reduction-operator:
29517 One of: + * - & ^ | && || min max
29519 OpenMP 4.0:
29521 reduction-operator:
29522 One of: + * - & ^ | && ||
29523 id-expression */
29525 static tree
29527 {
29535 {
29545 }
29549 else
29550 {
29561 {
29591 }
29592 else
29593 {
29595 resync_fail:
29600 }
29601 }
29607 NULL);
29609 {
29612 }
29615 }
29617 /* OpenMP 2.5:
29618 schedule ( schedule-kind )
29619 schedule ( schedule-kind , expression )
29621 schedule-kind:
29622 static | dynamic | guided | runtime | auto */
29624 static tree
29626 {
29635 {
29640 {
29661 }
29662 }
29667 else
29672 {
29687 else
29692 }
29700 invalid_kind:
29702 resync_fail:
29707 }
29709 /* OpenMP 3.0:
29710 untied */
29712 static tree
29715 {
29716 tree c;
29723 }
29725 /* OpenMP 4.0:
29726 inbranch
29727 notinbranch */
29729 static tree
29732 {
29737 }
29739 /* OpenMP 4.0:
29740 parallel
29741 for
29742 sections
29743 taskgroup */
29745 static tree
29749 {
29753 }
29755 /* OpenMP 4.0:
29756 num_teams ( expression ) */
29758 static tree
29760 location_t location)
29761 {
29783 }
29785 /* OpenMP 4.0:
29786 thread_limit ( expression ) */
29788 static tree
29790 location_t location)
29791 {
29813 }
29815 /* OpenMP 4.0:
29816 aligned ( variable-list )
29817 aligned ( variable-list : constant-expression ) */
29819 static tree
29821 {
29832 {
29842 }
29848 }
29850 /* OpenMP 4.0:
29851 linear ( variable-list )
29852 linear ( variable-list : expression ) */
29854 static tree
29857 {
29868 {
29872 {
29875 }
29883 }
29889 }
29891 /* OpenMP 4.0:
29892 safelen ( constant-expression ) */
29894 static tree
29896 location_t location)
29897 {
29918 }
29920 /* OpenMP 4.0:
29921 simdlen ( constant-expression ) */
29923 static tree
29925 location_t location)
29926 {
29947 }
29949 /* OpenMP 4.0:
29950 depend ( depend-kind : variable-list )
29952 depend-kind:
29953 in | out | inout */
29955 static tree
29957 {
29965 {
29975 else
29977 }
29978 else
29986 NULL);
29993 invalid_kind:
29995 resync_fail:
30000 }
30002 /* OpenMP 4.0:
30003 map ( map-kind : variable-list )
30004 map ( variable-list )
30006 map-kind:
30007 alloc | to | from | tofrom */
30009 static tree
30011 {
30020 {
30032 else
30033 {
30039 }
30042 }
30045 NULL);
30051 }
30053 /* OpenMP 4.0:
30054 device ( expression ) */
30056 static tree
30058 location_t location)
30059 {
30081 }
30083 /* OpenMP 4.0:
30084 dist_schedule ( static )
30085 dist_schedule ( static , expression ) */
30087 static tree
30089 location_t location)
30090 {
30103 {
30114 }
30119 location);
30123 invalid_kind:
30125 resync_fail:
30130 }
30132 /* OpenMP 4.0:
30133 proc_bind ( proc-bind-kind )
30135 proc-bind-kind:
30136 master | close | spread */
30138 static tree
30140 location_t location)
30141 {
30142 tree c;
30149 {
30159 else
30161 }
30162 else
30171 location);
30176 invalid_kind:
30178 resync_fail:
30183 }
30185 /* OpenACC:
30186 async [( int-expr )] */
30188 static tree
30190 {
30197 {
30206 }
30216 }
30218 /* Parse all OpenACC clauses. The set clauses allowed by the directive
30219 is a bitmask in MASK. Return the list of clauses found. */
30221 static tree
30225 {
30230 {
30231 location_t here;
30232 pragma_omp_clause c_kind;
30243 {
30335 }
30340 {
30341 /* Remove the invalid clause(s) from the list to avoid
30342 confusing the rest of the compiler. */
30345 }
30346 }
30348 saw_error:
30355 }
30357 /* Parse all OpenMP clauses. The set clauses allowed by the directive
30358 is a bitmask in MASK. Return the list of clauses found; the result
30359 of clause default goes in *pdefault. */
30361 static tree
30365 {
30372 {
30373 pragma_omp_clause c_kind;
30384 {
30396 clauses);
30410 clauses);
30419 clauses);
30443 clauses);
30457 clauses);
30474 OMP_CLAUSE_NOTINBRANCH,
30483 {
30484 clause_not_first:
30488 }
30513 clauses);
30518 clauses);
30523 clauses);
30586 }
30591 {
30592 /* Remove the invalid clause(s) from the list to avoid
30593 confusing the rest of the compiler. */
30596 }
30597 }
30598 saw_error:
30599 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
30600 no reason to skip to the end. */
30606 }
30608 /* OpenMP 2.5:
30609 structured-block:
30610 statement
30612 In practice, we're also interested in adding the statement to an
30613 outer node. So it is convenient if we work around the fact that
30614 cp_parser_statement calls add_stmt. */
30616 static unsigned
30618 {
30621 /* Only move the values to IN_OMP_BLOCK if they weren't false.
30622 This preserves the "not within loop or switch" style error messages
30623 for nonsense cases like
30624 void foo() {
30625 #pragma omp single
30626 break;
30627 }
30628 */
30633 }
30635 static void
30637 {
30639 }
30641 static tree
30643 {
30651 }
30653 /* OpenMP 2.5:
30654 # pragma omp atomic new-line
30655 expression-stmt
30657 expression-stmt:
30658 x binop= expr | x++ | ++x | x-- | --x
30659 binop:
30660 +, *, -, /, &, ^, |, <<, >>
30662 where x is an lvalue expression with scalar type.
30664 OpenMP 3.1:
30665 # pragma omp atomic new-line
30666 update-stmt
30668 # pragma omp atomic read new-line
30669 read-stmt
30671 # pragma omp atomic write new-line
30672 write-stmt
30674 # pragma omp atomic update new-line
30675 update-stmt
30677 # pragma omp atomic capture new-line
30678 capture-stmt
30680 # pragma omp atomic capture new-line
30681 capture-block
30683 read-stmt:
30684 v = x
30685 write-stmt:
30686 x = expr
30687 update-stmt:
30688 expression-stmt | x = x binop expr
30689 capture-stmt:
30690 v = expression-stmt
30691 capture-block:
30692 { v = x; update-stmt; } | { update-stmt; v = x; }
30694 OpenMP 4.0:
30695 update-stmt:
30696 expression-stmt | x = x binop expr | x = expr binop x
30697 capture-stmt:
30698 v = update-stmt
30699 capture-block:
30700 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
30702 where x and v are lvalue expressions with scalar type. */
30704 static void
30706 {
30714 {
30719 {
30725 }
30726 }
30728 {
30740 else
30744 }
30746 {
30752 {
30757 {
30760 }
30761 }
30762 }
30766 {
30776 else
30781 {
30782 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
30783 opcode. */
30788 }
30792 {
30795 }
30796 else
30797 {
30803 }
30806 }
30808 restart:
30812 {
30819 /* FALLTHROUGH */
30829 /* FALLTHROUGH */
30844 /* Undo effects of boolean_increment for post {in,de}crement. */
30846 /* FALLTHRU */
30850 {
30851 /* Undo effects of boolean_increment. */
30853 {
30854 /* This is pre or post increment. */
30859 && !structured_block
30863 }
30864 }
30865 /* FALLTHRU */
30868 {
30903 {
30907 }
30910 {
30916 {
30921 }
30923 {
30935 {
30937 {
30942 }
30943 else
30945 }
30949 }
30952 {
30959 }
30963 }
30967 {
30970 {
30978 }
30980 {
30985 }
31020 }
31031 /* FALLTHROUGH */
31036 }
31043 }
31044 stmt_done:
31046 {
31057 }
31059 {
31062 }
31063 done:
31069 saw_error:
31072 {
31076 {
31080 }
31081 }
31082 }
31085 /* OpenMP 2.5:
31086 # pragma omp barrier new-line */
31088 static void
31090 {
31093 }
31095 /* OpenMP 2.5:
31096 # pragma omp critical [(name)] new-line
31097 structured-block */
31099 static tree
31101 {
31105 {
31117 }
31122 }
31124 /* OpenMP 2.5:
31125 # pragma omp flush flush-vars[opt] new-line
31127 flush-vars:
31128 ( variable-list ) */
31130 static void
31132 {
31138 }
31140 /* Helper function, to parse omp for increment expression. */
31142 static tree
31144 {
31149 {
31152 }
31155 {
31164 /* Fall through: OpenMP disallows NE_EXPR. */
31167 }
31169 /* If decl is an iterator, preserve LHS and RHS of the relational
31170 expr until finish_omp_for. */
31180 }
31182 /* Helper function, to parse omp for increment expression. */
31184 static tree
31186 {
31190 cp_id_kind idk;
31194 {
31202 }
31210 {
31215 }
31222 {
31226 }
31238 do
31239 {
31246 {
31248 {
31251 else
31253 tf_warning_or_error);
31254 }
31255 else
31258 }
31259 }
31263 {
31267 }
31268 else
31272 }
31274 /* Parse the initialization statement of either an OpenMP for loop or
31275 a Cilk Plus for loop.
31277 Return true if the resulting construct should have an
31278 OMP_CLAUSE_PRIVATE added to it. */
31280 static bool
31288 {
31294 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
31296 init-expr:
31297 var = lb
31298 integer-type var = lb
31299 random-access-iterator-type var = lb
31300 pointer-type var = lb
31301 */
31302 cp_decl_specifier_seq type_specifiers;
31304 /* First, try to parse as an initialized declaration. See
31305 cp_parser_condition, from whence the bulk of this is copied. */
31312 {
31313 /* If parsing a type specifier seq succeeded, then this
31314 MUST be a initialized declaration. */
31319 CP_PARSER_DECLARATOR_NAMED,
31330 else
31331 {
31341 {
31343 CPP_OPEN_PAREN))
31344 {
31348 else
31351 }
31352 else
31353 /* Trigger an error. */
31358 }
31362 {
31370 {
31373 auto_node);
31378 }
31381 asm_specification,
31382 LOOKUP_ONLYCONVERTING);
31384 {
31387 }
31388 else
31391 }
31392 else
31393 {
31394 /* Consume '='. */
31398 non_class:
31401 else
31404 asm_specification,
31405 LOOKUP_ONLYCONVERTING);
31406 }
31410 }
31411 }
31412 else
31413 {
31414 cp_id_kind idk;
31415 /* If parsing a type specifier sequence failed, then
31416 this MUST be a simple expression. */
31424 && decl
31427 {
31428 tree rhs;
31435 rhs,
31436 tf_warning_or_error));
31438 }
31439 else
31440 {
31445 {
31449 }
31450 }
31451 }
31453 }
31455 /* Parse the restricted form of the for statement allowed by OpenMP. */
31457 static tree
31460 {
31464 location_t loc_first;
31483 {
31486 location_t loc;
31490 {
31493 }
31496 {
31499 }
31508 add_private_clause
31515 {
31518 {
31524 }
31525 else
31527 }
31534 {
31539 {
31543 }
31546 {
31547 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
31548 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
31553 {
31556 }
31557 else
31558 {
31561 }
31565 }
31566 else
31567 {
31572 }
31573 }
31576 {
31577 tree c;
31579 {
31588 decl);
31592 decl);
31593 }
31595 {
31600 {
31603 }
31604 }
31605 }
31614 {
31615 /* If decl is an iterator, preserve the operator on decl
31616 until finish_omp_for. */
31618 && ((processing_template_decl
31622 else
31626 }
31641 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
31642 in between the collapsed for loops to be still considered perfectly
31643 nested. Hopefully the final version clarifies this.
31644 For now handle (multiple) {'s and empty statements. */
31646 do
31647 {
31651 {
31653 bracecount++;
31654 }
31658 else
31659 {
31666 }
31667 }
31671 {
31674 }
31675 }
31677 /* Note that we saved the original contents of this flag when we entered
31678 the structured block, and so we don't need to re-save it here. */
31681 else
31684 /* Note that the grammar doesn't call for a structured block here,
31685 though the loop as a whole is a structured block. */
31692 else
31697 {
31699 {
31701 nbraces--;
31702 }
31705 else
31706 {
31708 {
31711 }
31716 }
31717 }
31724 }
31726 /* Helper function for OpenMP parsing, split clauses and call
31727 finish_omp_clauses on each of the set of clauses afterwards. */
31729 static void
31732 {
31738 }
31740 /* OpenMP 4.0:
31741 #pragma omp simd simd-clause[optseq] new-line
31742 for-loop */
31744 #define OMP_SIMD_CLAUSE_MASK \
31745 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
31746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31753 static tree
31756 {
31768 {
31771 }
31782 }
31784 /* OpenMP 2.5:
31785 #pragma omp for for-clause[optseq] new-line
31786 for-loop
31788 OpenMP 4.0:
31789 #pragma omp for simd for-simd-clause[optseq] new-line
31790 for-loop */
31792 #define OMP_FOR_CLAUSE_MASK \
31793 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
31798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
31799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
31800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31802 static tree
31805 {
31816 {
31821 {
31829 cclauses);
31833 cclauses);
31845 }
31846 }
31848 {
31851 }
31856 {
31859 }
31870 }
31872 /* OpenMP 2.5:
31873 # pragma omp master new-line
31874 structured-block */
31876 static tree
31878 {
31882 }
31884 /* OpenMP 2.5:
31885 # pragma omp ordered new-line
31886 structured-block */
31888 static tree
31890 {
31894 }
31896 /* OpenMP 2.5:
31898 section-scope:
31899 { section-sequence }
31901 section-sequence:
31902 section-directive[opt] structured-block
31903 section-sequence section-directive structured-block */
31905 static tree
31907 {
31918 {
31922 }
31925 {
31933 {
31937 }
31939 {
31942 }
31947 }
31958 }
31960 /* OpenMP 2.5:
31961 # pragma omp sections sections-clause[optseq] newline
31962 sections-scope */
31964 #define OMP_SECTIONS_CLAUSE_MASK \
31965 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31971 static tree
31974 {
31986 {
31989 }
31996 }
31998 /* OpenMP 2.5:
31999 # pragma omp parallel parallel-clause[optseq] new-line
32000 structured-block
32001 # pragma omp parallel for parallel-for-clause[optseq] new-line
32002 structured-block
32003 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
32004 structured-block
32006 OpenMP 4.0:
32007 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
32008 structured-block */
32010 #define OMP_PARALLEL_CLAUSE_MASK \
32011 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
32015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
32016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
32017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
32018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
32019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
32021 static tree
32024 {
32033 {
32046 block);
32051 }
32053 {
32057 }
32059 {
32062 }
32064 {
32068 {
32078 block);
32081 }
32082 }
32092 }
32094 /* OpenMP 2.5:
32095 # pragma omp single single-clause[optseq] new-line
32096 structured-block */
32098 #define OMP_SINGLE_CLAUSE_MASK \
32099 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
32102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
32104 static tree
32106 {
32116 }
32118 /* OpenMP 3.0:
32119 # pragma omp task task-clause[optseq] new-line
32120 structured-block */
32122 #define OMP_TASK_CLAUSE_MASK \
32123 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
32125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
32126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
32129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
32130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
32131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
32133 static tree
32135 {
32146 }
32148 /* OpenMP 3.0:
32149 # pragma omp taskwait new-line */
32151 static void
32153 {
32156 }
32158 /* OpenMP 3.1:
32159 # pragma omp taskyield new-line */
32161 static void
32163 {
32166 }
32168 /* OpenMP 4.0:
32169 # pragma omp taskgroup new-line
32170 structured-block */
32172 static tree
32174 {
32178 }
32181 /* OpenMP 2.5:
32182 # pragma omp threadprivate (variable-list) */
32184 static void
32186 {
32187 tree vars;
32193 }
32195 /* OpenMP 4.0:
32196 # pragma omp cancel cancel-clause[optseq] new-line */
32198 #define OMP_CANCEL_CLAUSE_MASK \
32199 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
32200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
32201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
32202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
32203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32205 static void
32207 {
32211 }
32213 /* OpenMP 4.0:
32214 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
32216 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
32217 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
32218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
32219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
32220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
32222 static void
32224 {
32225 tree clauses;
32229 {
32234 {
32237 }
32238 }
32240 {
32244 }
32247 OMP_CANCELLATION_POINT_CLAUSE_MASK,
32249 pragma_tok);
32251 }
32253 /* OpenMP 4.0:
32254 #pragma omp distribute distribute-clause[optseq] new-line
32255 for-loop */
32257 #define OMP_DISTRIBUTE_CLAUSE_MASK \
32258 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
32261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
32263 static tree
32266 {
32275 {
32283 else
32286 {
32292 {
32295 cclauses);
32296 else
32298 cclauses);
32299 }
32304 cclauses);
32305 else
32307 cclauses);
32319 }
32320 }
32322 {
32325 }
32330 {
32333 }
32344 }
32346 /* OpenMP 4.0:
32347 # pragma omp teams teams-clause[optseq] new-line
32348 structured-block */
32350 #define OMP_TEAMS_CLAUSE_MASK \
32351 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
32354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
32355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
32356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
32357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
32359 static tree
32362 {
32371 {
32375 {
32383 cclauses);
32387 cclauses);
32398 }
32399 }
32401 {
32404 }
32409 {
32412 }
32420 }
32422 /* OpenMP 4.0:
32423 # pragma omp target data target-data-clause[optseq] new-line
32424 structured-block */
32426 #define OMP_TARGET_DATA_CLAUSE_MASK \
32427 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32431 static tree
32433 {
32445 }
32447 /* OpenMP 4.0:
32448 # pragma omp target update target-update-clause[optseq] new-line */
32450 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
32451 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
32452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
32453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32456 static bool
32459 {
32461 {
32463 "%<#pragma omp target update%> may only be "
32467 }
32469 tree clauses
32474 {
32476 "%<#pragma omp target update must contain at least one "
32479 }
32487 }
32489 /* OpenMP 4.0:
32490 # pragma omp target target-clause[optseq] new-line
32491 structured-block */
32493 #define OMP_TARGET_CLAUSE_MASK \
32494 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32498 static bool
32501 {
32503 {
32507 }
32510 {
32515 {
32523 {
32525 OMP_TARGET_CLAUSE_MASK,
32526 cclauses);
32528 }
32544 }
32546 {
32549 }
32551 {
32555 }
32557 {
32560 }
32561 }
32575 }
32577 /* OpenACC 2.0:
32578 # pragma acc cache (variable-list) new-line
32579 */
32581 static tree
32583 {
32598 }
32600 /* OpenACC 2.0:
32601 # pragma acc data oacc-data-clause[optseq] new-line
32602 structured-block */
32604 #define OACC_DATA_CLAUSE_MASK \
32605 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32611 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32612 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32613 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32614 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
32617 static tree
32619 {
32632 }
32634 /* OpenACC 2.0:
32635 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
32637 or
32639 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
32641 LOC is the location of the #pragma token.
32642 */
32644 #define OACC_ENTER_DATA_CLAUSE_MASK \
32645 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
32653 #define OACC_EXIT_DATA_CLAUSE_MASK \
32654 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
32658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
32660 static tree
32663 {
32668 {
32674 }
32679 {
32683 }
32690 else
32695 {
32699 }
32705 else
32710 }
32712 /* OpenACC 2.0:
32713 # pragma acc kernels oacc-kernels-clause[optseq] new-line
32714 structured-block */
32716 #define OACC_KERNELS_CLAUSE_MASK \
32717 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32731 static tree
32733 {
32746 }
32748 /* OpenACC 2.0:
32749 # pragma acc loop oacc-loop-clause[optseq] new-line
32750 structured-block */
32752 #define OACC_LOOP_CLAUSE_MASK \
32753 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
32754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
32756 static tree
32758 {
32771 }
32773 /* OpenACC 2.0:
32774 # pragma acc parallel oacc-parallel-clause[optseq] new-line
32775 structured-block */
32777 #define OACC_PARALLEL_CLAUSE_MASK \
32778 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
32786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
32787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
32793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
32794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32796 static tree
32798 {
32811 }
32813 /* OpenACC 2.0:
32814 # pragma acc update oacc-update-clause[optseq] new-line
32815 */
32817 #define OACC_UPDATE_CLAUSE_MASK \
32818 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
32820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
32821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
32823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32825 static tree
32827 {
32834 {
32836 "%<#pragma acc update%> must contain at least one "
32839 }
32847 }
32849 /* OpenACC 2.0:
32850 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
32852 LOC is the location of the #pragma token.
32853 */
32855 #define OACC_WAIT_CLAUSE_MASK \
32856 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
32858 static tree
32860 {
32873 }
32875 /* OpenMP 4.0:
32876 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
32878 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
32879 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
32880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
32881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
32882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
32883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
32884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
32886 static void
32889 {
32891 cp_omp_declare_simd_data data;
32893 {
32898 }
32909 {
32913 {
32926 }
32931 "%<#pragma omp declare simd%> not immediately followed by "
32935 }
32936 }
32938 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
32939 This function is modelled similar to the late parsing of omp declare
32940 simd. */
32942 static tree
32944 {
32950 {
32956 }
32958 {
32962 }
32967 {
32974 NULL);
32988 }
32993 }
32995 /* Finalize #pragma omp declare simd clauses after direct declarator has
32996 been parsed, and put that into "omp declare simd" attribute. */
32998 static tree
33000 {
33006 {
33011 }
33016 {
33034 }
33038 }
33041 /* OpenMP 4.0:
33042 # pragma omp declare target new-line
33043 declarations and definitions
33044 # pragma omp end declare target new-line */
33046 static void
33048 {
33051 }
33053 static void
33055 {
33058 {
33061 }
33063 {
33067 {
33070 }
33073 else
33074 {
33078 }
33079 }
33080 else
33081 {
33085 }
33089 "%<#pragma omp end declare target%> without corresponding "
33091 else
33093 }
33095 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
33096 expression and optional initializer clause of
33097 #pragma omp declare reduction. We store the expression(s) as
33098 either 3, 6 or 7 special statements inside of the artificial function's
33099 body. The first two statements are DECL_EXPRs for the artificial
33100 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
33101 expression that uses those variables.
33102 If there was any INITIALIZER clause, this is followed by further statements,
33103 the fourth and fifth statements are DECL_EXPRs for the artificial
33104 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
33105 constructor variant (first token after open paren is not omp_priv),
33106 then the sixth statement is a statement with the function call expression
33107 that uses the OMP_PRIV and optionally OMP_ORIG variable.
33108 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
33109 to initialize the OMP_PRIV artificial variable and there is seventh
33110 statement, a DECL_EXPR of the OMP_PRIV statement again. */
33112 static bool
33114 {
33126 tree combiner;
33141 {
33144 }
33147 {
33154 {
33157 }
33173 {
33177 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
33181 == CPP_CLOSE_PAREN
33184 {
33188 }
33193 }
33194 else
33195 {
33211 {
33216 }
33218 tree arg;
33231 }
33242 }
33248 }
33250 /* OpenMP 4.0
33251 #pragma omp declare reduction (reduction-id : typename-list : expression) \
33252 initializer-clause[opt] new-line
33254 initializer-clause:
33255 initializer (omp_priv initializer)
33256 initializer (function-name (argument-list)) */
33258 static void
33261 {
33271 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
33278 {
33310 }
33322 /* Types may not be defined in declare reduction type list. */
33325 parser->type_definition_forbidden_message
33331 saved_colon_doesnt_start_class_def_p
33336 {
33340 ;
33361 else
33366 else
33368 }
33370 /* Restore the saved message. */
33373 parser->colon_doesnt_start_class_def_p
33378 {
33379 fail:
33382 }
33388 {
33389 tree fntype
33392 NULL_TREE);
33411 {
33416 }
33418 {
33420 {
33429 }
33436 }
33437 else
33438 {
33441 }
33444 else
33447 {
33450 }
33452 {
33455 else
33460 }
33465 else
33466 {
33475 }
33482 }
33486 done:
33487 /* Free any declarators allocated. */
33489 }
33491 /* OpenMP 4.0
33492 #pragma omp declare simd declare-simd-clauses[optseq] new-line
33493 #pragma omp declare reduction (reduction-id : typename-list : expression) \
33494 initializer-clause[opt] new-line
33495 #pragma omp declare target new-line */
33497 static void
33500 {
33502 {
33507 {
33510 context);
33512 }
33515 {
33518 context);
33520 }
33522 {
33525 }
33527 {
33531 }
33532 }
33536 }
33538 /* Main entry point to OpenMP statement pragmas. */
33540 static void
33542 {
33543 tree stmt;
33548 {
33623 }
33627 }
33628 \f
33629 /* Transactional Memory parsing routines. */
33631 /* Parse a transaction attribute.
33633 txn-attribute:
33634 attribute
33635 [ [ identifier ] ]
33637 ??? Simplify this when C++0x bracket attributes are
33638 implemented properly. */
33640 static tree
33642 {
33657 {
33661 /* For keywords, use the canonical spelling,
33662 not the parsed identifier. */
33666 }
33667 else
33671 error1:
33674 }
33676 /* Parse a __transaction_atomic or __transaction_relaxed statement.
33678 transaction-statement:
33679 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
33680 compound-statement
33681 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
33682 */
33684 static tree
33686 {
33701 else
33702 {
33706 }
33708 /* Parse a noexcept specification. */
33711 /* Keep track if we're in the lexical scope of an outer transaction. */
33723 }
33725 /* Parse a __transaction_atomic or __transaction_relaxed expression.
33727 transaction-expression:
33728 __transaction_atomic txn-noexcept-spec[opt] ( expression )
33729 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
33730 */
33732 static tree
33734 {
33759 /* Set this early. This might mean that we allow transaction_cancel in
33760 an expression that we find out later actually has to be a constexpr.
33761 However, we expect that cxx_constant_value will be able to deal with
33762 this; also, if the noexcept has no constexpr, then what we parse next
33763 really is a transaction's body. */
33766 /* Parse a noexcept specification. */
33772 {
33779 }
33780 else
33781 {
33782 /* The only expression that is available got parsed for the noexcept
33783 already. noexcept is true then. */
33786 }
33795 }
33797 /* Parse a function-transaction-block.
33799 function-transaction-block:
33800 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
33801 function-body
33802 __transaction_atomic txn-attribute[opt] function-try-block
33803 __transaction_relaxed ctor-initializer[opt] function-body
33804 __transaction_relaxed function-try-block
33805 */
33807 static bool
33809 {
33825 else
33826 {
33830 }
33838 else
33839 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
33847 }
33849 /* Parse a __transaction_cancel statement.
33851 cancel-statement:
33852 __transaction_cancel txn-attribute[opt] ;
33853 __transaction_cancel txn-attribute[opt] throw-expression ;
33855 ??? Cancel and throw is not yet implemented. */
33857 static tree
33859 {
33865 RT_TRANSACTION_CANCEL);
33872 /* ??? Parse cancel-and-throw here. */
33877 {
33881 }
33883 {
33887 }
33889 {
33892 {
33898 }
33899 }
33901 {
33905 }
33911 }
33912 \f
33913 /* The parser. */
33917 \f
33918 /* Special handling for the first token or line in the file. The first
33919 thing in the file might be #pragma GCC pch_preprocess, which loads a
33920 PCH file, which is a GC collection point. So we need to handle this
33921 first pragma without benefit of an existing lexer structure.
33923 Always returns one token to the caller in *FIRST_TOKEN. This is
33924 either the true first token of the file, or the first token after
33925 the initial pragma. */
33927 static void
33929 {
33938 {
33945 }
33946 else
33949 /* Skip to the end of the pragma. */
33953 /* Now actually load the PCH file. */
33957 /* Read one more token to return to our caller. We have to do this
33958 after reading the PCH file in, since its pointers have to be
33959 live. */
33961 }
33963 /* Parses the grainsize pragma for the _Cilk_for statement.
33964 Syntax:
33965 #pragma cilk grainsize = <VALUE>. */
33967 static void
33969 {
33971 {
33976 {
33979 }
33981 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
33984 else
33986 "%<#pragma cilk grainsize%> is not followed by "
33989 }
33991 }
33993 /* Normal parsing of a pragma token. Here we can (and must) use the
33994 regular lexer. */
33996 static bool
33998 {
34010 {
34018 {
34028 }
34033 {
34043 }
34048 {
34054 "%<#pragma omp taskwait%> may only be "
34059 }
34064 {
34070 "%<#pragma omp taskyield%> may only be "
34075 }
34080 {
34086 "%<#pragma omp cancel%> may only be "
34091 }
34096 {
34102 "%<#pragma omp cancellation point%> may only be "
34107 }
34154 "%<#pragma omp section%> may only be used in "
34159 {
34161 {
34165 }
34172 {
34175 }
34178 }
34182 {
34186 }
34192 {
34196 }
34198 /* Ignore the pragma if Cilk Plus is not enabled. */
34200 {
34203 }
34204 else
34205 {
34209 }
34216 bad_stmt:
34219 }
34223 }
34225 /* The interface the pragma parsers have to the lexer. */
34227 enum cpp_ttype
34229 {
34242 else
34243 {
34247 }
34250 }
34252 \f
34253 /* External interface. */
34255 /* Parse one entire translation unit. */
34257 void
34259 {
34272 }
34274 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
34275 vectorlength clause:
34276 Syntax:
34277 vectorlength ( constant-expression ) */
34279 static tree
34282 {
34284 tree expr;
34285 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
34286 safelen clause. Thus, vectorlength is represented as OMP 4.0
34287 safelen. For SIMD-enabled function it is represented by OMP 4.0
34288 simdlen. */
34291 loc);
34292 else
34294 loc);
34302 /* If expr == error_mark_node, then don't emit any errors nor
34303 create a clause. if any of the above functions returns
34304 error mark node then they would have emitted an error message. */
34306 ;
34314 else
34315 {
34316 tree c;
34318 {
34323 }
34324 else
34325 {
34330 }
34331 }
34336 }
34338 /* Handles the Cilk Plus #pragma simd linear clause.
34339 Syntax:
34340 linear ( simd-linear-variable-list )
34342 simd-linear-variable-list:
34343 simd-linear-variable
34344 simd-linear-variable-list , simd-linear-variable
34346 simd-linear-variable:
34347 id-expression
34348 id-expression : simd-linear-step
34350 simd-linear-step:
34351 conditional-expression */
34353 static tree
34355 {
34361 {
34365 }
34370 {
34373 {
34377 }
34384 {
34388 }
34389 else
34390 {
34394 /* If present, parse the linear step. Otherwise, assume the default
34395 value of 1. */
34397 {
34404 {
34405 /* If an error has occurred, then the whole pragma is
34406 considered ill-formed. Thus, no reason to keep
34407 parsing. */
34410 }
34418 else
34420 "step size must be an integer constant "
34422 }
34424 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
34430 }
34435 else
34436 {
34441 }
34442 }
34446 }
34448 /* Returns the name of the next clause. If the clause is not
34449 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
34450 token is not consumed. Otherwise, the appropriate enum from the
34451 pragma_simd_clause is returned and the token is consumed. */
34453 static pragma_omp_clause
34455 {
34456 pragma_omp_clause clause_type;
34473 else
34478 }
34480 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
34482 static tree
34484 {
34489 {
34490 pragma_omp_clause c_kind;
34497 /* Use the OpenMP 4.0 equivalent function. */
34500 /* Use the OpenMP 4.0 equivalent function. */
34502 clauses);
34504 /* Use the OMP 4.0 equivalent function. */
34506 clauses);
34508 /* Use the OMP 4.0 equivalent function. */
34510 else
34511 {
34515 }
34516 }
34522 else
34524 }
34526 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
34528 static void
34530 {
34537 {
34541 }
34550 }
34552 /* Main entry-point for parsing Cilk Plus _Cilk_for
34553 loops. The return value is error_mark_node
34554 when errors happen and CILK_FOR tree on success. */
34556 static tree
34558 {
34573 else
34579 }
34581 /* Create an identifier for a generic parameter type (a synthesized
34582 template parameter implied by `auto' or a concept identifier). */
34585 static tree
34587 {
34591 }
34593 /* Predicate that behaves as is_auto_or_concept but matches the parent
34594 node of the generic type rather than the generic type itself. This
34595 allows for type transformation in add_implicit_template_parms. */
34599 {
34601 }
34603 /* Returns the template declaration being called or evaluated as
34604 part of the constraint check. Note that T must be a predicate
34605 constraint (it can't be any other kind of constraint). */
34606 static tree
34608 {
34615 else
34616 {
34621 }
34622 }
34624 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
34625 (creating a new template parameter list if necessary). Returns the newly
34626 created template type parm. */
34628 tree
34630 {
34633 // Before committing to modifying any scope, if we're in an implicit
34634 // template scope, and we're trying to synthesize a constrained
34635 // parameter, try to find a previous parameter with the same name.
34637 {
34640 {
34645 }
34646 }
34648 /* We are either continuing a function template that already contains implicit
34649 template parameters, creating a new fully-implicit function template, or
34650 extending an existing explicit function template with implicit template
34651 parameters. */
34659 {
34663 }
34664 else
34665 {
34666 /* Roll back to the existing template parameter scope (in the case of
34667 extending an explicit function template) or introduce a new template
34668 parameter scope ahead of the function parameter scope (or class scope
34669 in the case of out-of-line member definitions). The function scope is
34670 added back after template parameter synthesis below. */
34675 {
34678 }
34680 {
34681 /* If not defining a class, then any class scope is a scope level in
34682 an out-of-line member definition. In this case simply wind back
34683 beyond the first such scope to inject the template parameter list.
34684 Otherwise wind back to the class being defined. The latter can
34685 occur in class member friend declarations such as:
34687 class A {
34688 void foo (auto);
34689 };
34690 class B {
34691 friend void A::foo (auto);
34692 };
34694 The template parameter list synthesized for the friend declaration
34695 must be injected in the scope of 'B'. This can also occur in
34696 erroneous cases such as:
34698 struct A {
34699 struct B {
34700 void foo (auto);
34701 };
34702 void B::foo (auto) {}
34703 };
34705 Here the attempted definition of 'B::foo' within 'A' is ill-formed
34706 but, nevertheless, the template parameter list synthesized for the
34707 declarator should be injected into the scope of 'A' as if the
34708 ill-formed template was specified explicitly. */
34711 {
34714 }
34715 }
34721 {
34722 /* Introduce a new template parameter list for implicit template
34723 parameters. */
34726 parser->implicit_template_scope
34733 }
34734 else
34735 {
34736 /* Synthesize implicit template parameters at the end of the explicit
34737 template parameter list. */
34744 parser->implicit_template_parms
34746 }
34747 }
34749 /* Synthesize a new template parameter and track the current template
34750 parameter chain with implicit_template_parms. */
34754 synth_id);
34756 // Attach the constraint to the parm before processing.
34759 tree new_parm
34761 input_location,
34762 node,
34766 // Chain the new parameter to the list of implicit parameters.
34768 parser->implicit_template_parms
34770 else
34775 /* If creating a fully implicit function template, start the new implicit
34776 template parameter list with this synthesized type, otherwise grow the
34777 current template parameter list. */
34780 {
34787 }
34788 else
34789 {
34794 }
34796 // If the new parameter was constrained, we need to add that to the
34797 // constraints in the tmeplate parameter list.
34799 {
34803 }
34808 }
34810 /* Finish the declaration of a fully implicit function template. Such a
34811 template has no explicit template parameter list so has not been through the
34812 normal template head and tail processing. synthesize_implicit_template_parm
34813 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
34814 provided if the declaration is a class member such that its template
34815 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
34816 form is returned. Otherwise NULL_TREE is returned. */
34818 tree
34820 {
34825 {
34829 }
34839 }