| blob | f3abae716fe2f4579f5776a5dd029b8ca8c1daa7 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2023 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/>. */
22 #define INCLUDE_MEMORY
53 \f
54 /* The lexer. */
56 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
57 and c-lex.cc) and the C++ parser. */
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
186 RT_CO_YIELD /* co_yield */
187 };
189 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
190 reverting it on destruction. */
192 class type_id_in_expr_sentinel
193 {
203 };
205 /* Prototypes. */
211 static void cp_lexer_destroy
213 static int cp_lexer_saving_tokens
217 static void cp_lexer_get_preprocessor_token
225 static bool cp_lexer_next_token_is_not
227 static bool cp_lexer_next_token_is_keyword
231 static void cp_lexer_purge_token
233 static void cp_lexer_purge_tokens_after
235 static void cp_lexer_save_tokens
237 static void cp_lexer_commit_tokens
239 static void cp_lexer_rollback_tokens
241 static void cp_lexer_print_token
245 static void cp_lexer_start_debugging
247 static void cp_lexer_stop_debugging
252 static tree cp_parser_late_noexcept_specifier
254 static void noexcept_override_late_checks
257 static void cp_parser_initial_pragma
260 static bool cp_parser_omp_declare_reduction_exprs
262 static void cp_finalize_oacc_routine
265 static void check_omp_intervening_code
269 /* Manifest constants. */
270 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
271 #define CP_SAVED_TOKEN_STACK 5
273 /* Variables. */
275 /* The stream to which debugging output should be written. */
278 /* Nonzero if we are parsing an unevaluated operand: an operand to
279 sizeof, typeof, or alignof. */
282 /* Dump up to NUM tokens in BUFFER to FILE starting with token
283 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
284 first token in BUFFER. If NUM is 0, dump all the tokens. If
285 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
286 highlighted by surrounding it in [[ ]]. */
288 static void
292 {
309 {
312 }
317 {
324 nprinted++;
334 {
344 }
345 }
348 {
351 }
354 }
357 /* Dump all tokens in BUFFER to stderr. */
359 void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
369 }
371 DEBUG_FUNCTION void
373 {
376 else
378 }
381 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
382 description for T. */
384 static void
386 {
388 {
391 }
392 }
395 /* Dump parser context C to FILE. */
397 static void
399 {
404 }
407 /* Print the stack of parsing contexts to FILE starting with FIRST. */
409 static void
411 {
417 {
420 }
421 }
424 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
426 static void
428 {
431 }
434 /* Print an unparsed function entry UF to FILE. */
436 static void
438 {
441 tree fn;
446 i++)
447 {
453 }
458 {
461 }
467 {
470 }
472 }
475 /* Print the stack of unparsed member functions S to FILE. */
477 static void
480 {
486 {
489 }
490 }
493 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
494 the given PARSER. If FILE is NULL, the output is printed on stderr. */
496 static void
498 {
510 next_token);
511 }
514 /* Dump debugging information for the given PARSER. If FILE is NULL,
515 the output is printed on stderr. */
517 void
519 {
522 expanded_location eloc;
587 parser->type_definition_forbidden_message_arg
603 }
605 DEBUG_FUNCTION void
607 {
609 }
611 DEBUG_FUNCTION void
613 {
616 else
618 }
620 /* Allocate memory for a new lexer object and return it. */
624 {
625 /* Allocate the memory. */
628 /* Initially we are not debugging. */
633 /* Create the buffer. */
637 }
639 /* Return TRUE if token is the start of a module declaration that will be
640 terminated by a CPP_PRAGMA_EOL token. */
643 {
647 }
649 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
650 PRAGMA_NONE. */
652 static enum pragma_kind
654 {
657 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
659 }
661 /* Handle early pragmas such as #pragma GCC diagnostic, which needs to be done
662 during preprocessing for the case of preprocessing-related diagnostics. This
663 is called immediately after pushing the CPP_PRAGMA_EOL token onto
664 lexer->buffer. */
666 static void
668 {
672 /* Back up to the start of the pragma so pragma_lex () can parse it when
673 c-pragma lib asks it to. */
677 {
682 }
688 /* Dispatch it. */
689 const unsigned int id
694 /* Reset to normal state. */
696 }
698 /* The parser. */
702 /* Create a new main C++ lexer, the lexer that gets tokens from the
703 preprocessor, and also create the main parser. */
707 {
708 cp_token token;
710 /* It's possible that parsing the first pragma will load a PCH file,
711 which is a GC collection point. So we have to do that before
712 allocating any memory. */
718 /* Put the first token in the buffer. */
725 /* Create the parser now, so we can use it to handle early pragmas. */
729 /* Get the remaining tokens from the preprocessor. */
731 {
733 /* Process the previous token. */
737 /* Check for early pragmas that need to be handled now. */
743 }
751 {
752 /* Set the EOF token's location to be the just after the previous
753 token's range. That way 'at-eof' diagnostics point at something
754 meaninful. */
758 }
763 /* Subsequent preprocessor diagnostics should use compiler
764 diagnostic functions to get the compiler source location. */
771 }
773 /* Create a lexer and parser to be used during preprocess-only mode.
774 This will be filled with tokens to parse when needed by pragma_lex (). */
775 void
777 {
780 }
782 /* Create a new lexer whose token stream is primed with the tokens in
783 CACHE. When these tokens are exhausted, no new tokens will be read. */
787 {
792 /* We do not own the buffer. */
795 /* Insert an EOF token. */
806 /* Initially we are not debugging. */
812 }
814 /* Frees all resources associated with LEXER. */
816 static void
818 {
821 else
822 {
823 /* Restore the token we overwrite with EOF. */
826 }
829 }
831 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
832 be used. The point of this flag is to help the compiler to fold away calls
833 to cp_lexer_debugging_p within this source file at compile time, when the
834 lexer is not being debugged. */
836 #define LEXER_DEBUGGING_ENABLED_P false
838 /* Returns nonzero if debugging information should be output. */
842 {
847 }
852 {
854 }
858 {
860 }
864 {
866 }
870 {
872 }
876 {
879 /* Skip past purged tokens. */
881 {
883 tp--;
884 }
887 }
889 /* Same as above, but return NULL when the lexer doesn't own the token
890 buffer or if the next_token is at the start of the token
891 vector or if all previous tokens are purged. */
895 {
898 {
901 /* Skip past purged tokens. */
903 {
906 tp--;
907 }
909 }
912 }
914 /* Overload for make_location, taking the lexer to mean the location of the
915 previous token. */
919 {
922 }
924 /* Overload for make_location taking tokens instead of locations. */
928 {
930 }
932 /* nonzero if we are presently saving tokens. */
936 {
938 }
940 /* Store the next token from the preprocessor in *TOKEN. Return true
941 if we reach EOF. If LEXER is NULL, assume we are handling an
942 initial #pragma pch_preprocess, and thus want the lexer to return
943 processed strings.
945 Diagnostics issued from this function must have their controlling option (if
946 any) in c.opt annotated as a libcpp option via the CppReason property. */
948 static void
950 {
953 /* Get a new token from the preprocessor. */
954 token->type
956 flags);
961 /* Usually never see a zero, but just in case ... */
964 /* On some systems, some header files are surrounded by an
965 implicit extern "C" block. Set a flag in the token if it
966 comes from such a header. */
971 /* Check to see if this token is a keyword. */
973 {
975 {
976 /* Mark this token as a keyword. */
978 /* Record which keyword. */
980 }
981 else
982 {
986 /* These are outside the CXX11 range. */
990 {
991 /* Warn about the C++11 keyword (but still treat it as
992 an identifier). */
997 /* Clear out the C_RID_CODE so we don't warn about this
998 particular identifier-turned-keyword again. */
1000 }
1004 {
1005 /* Warn about the C++20 keyword (but still treat it as
1006 an identifier). */
1011 /* Clear out the C_RID_CODE so we don't warn about this
1012 particular identifier-turned-keyword again. */
1014 }
1017 }
1018 }
1020 {
1021 /* This only happens in Objective-C++; it must be a keyword. */
1024 {
1025 /* Replace 'class' with '@class', 'private' with '@private',
1026 etc. This prevents confusion with the C++ keyword
1027 'class', and makes the tokens consistent with other
1028 Objective-C 'AT' keywords. For example '@class' is
1029 reported as RID_AT_CLASS which is consistent with
1030 '@synchronized', which is reported as
1031 RID_AT_SYNCHRONIZED.
1032 */
1042 }
1043 }
1044 }
1046 /* Update the globals input_location and the input file stack from TOKEN. */
1049 {
1051 }
1053 /* Update the globals input_location and the input file stack from LEXER. */
1056 {
1059 }
1061 /* Return a pointer to the next token in the token stream, but do not
1062 consume it. */
1066 {
1068 {
1072 }
1074 }
1076 /* Return true if the next token has the indicated TYPE. */
1080 {
1082 }
1084 /* Return true if the next token does not have the indicated TYPE. */
1088 {
1090 }
1092 /* Return true if the next token is the indicated KEYWORD. */
1096 {
1098 }
1102 {
1104 }
1108 {
1110 }
1112 /* Return true if KEYWORD can start a decl-specifier. */
1114 bool
1116 {
1118 {
1119 /* auto specifier: storage-class-specifier in C++,
1120 simple-type-specifier in C++0x. */
1122 /* Storage classes. */
1128 /* Elaborated type specifiers. */
1134 /* Simple type specifiers. */
1148 CASE_RID_FLOATN_NX:
1150 /* CV qualifiers. */
1153 /* Function specifiers. */
1156 /* friend/typdef/inline specifiers. */
1160 /* GNU extensions. */
1162 /* C++11 extensions. */
1165 /* C++20 extensions. */
1170 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
1171 case RID_##CODE:
1173 #undef DEFTRAIT_TYPE
1182 }
1183 }
1185 /* Return true if the next token is a keyword for a decl-specifier. */
1187 static bool
1189 {
1194 }
1196 /* Returns TRUE iff the token T begins a decltype type. */
1198 static bool
1200 {
1203 }
1205 /* Returns TRUE iff the next token begins a decltype type. */
1207 static bool
1209 {
1212 }
1214 /* Called when processing a token with tree_check_value; perform or defer the
1215 associated checks and return the value. */
1217 static tree
1219 {
1220 /* Perform any access checks that were deferred. */
1225 {
1231 }
1232 /* Return the stored value. */
1234 }
1236 /* Return a pointer to the Nth token in the token stream. If N is 1,
1237 then this is precisely equivalent to cp_lexer_peek_token (except
1238 that it is not inline). One would like to disallow that case, but
1239 there is one case (cp_parser_nth_token_starts_template_id) where
1240 the caller passes a variable for N and it might be 1. */
1244 {
1247 /* N is 1-based, not zero-based. */
1257 {
1261 }
1264 {
1267 }
1270 }
1272 /* Return the next token, and advance the lexer's next_token pointer
1273 to point to the next non-purged token. */
1277 {
1280 do
1281 {
1284 }
1289 /* Provide debugging output. */
1291 {
1295 }
1298 }
1300 /* Permanently remove the next token from the token stream, and
1301 advance the next_token pointer to refer to the next non-purged
1302 token. */
1304 static void
1306 {
1315 do
1316 tok++;
1319 }
1321 /* Permanently remove all tokens after TOK, up to, but not
1322 including, the token that will be returned next by
1323 cp_lexer_peek_token. */
1325 static void
1327 {
1333 {
1338 }
1339 }
1341 /* Begin saving tokens. All tokens consumed after this point will be
1342 preserved. */
1344 static void
1346 {
1347 /* Provide debugging output. */
1352 }
1354 /* Commit to the portion of the token stream most recently saved. */
1356 static void
1358 {
1359 /* Provide debugging output. */
1364 }
1366 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1367 to the token stream. Stop saving tokens. */
1369 static void
1371 {
1372 /* Provide debugging output. */
1377 }
1379 /* Determines what saved_token_sentinel does when going out of scope. */
1382 STS_COMMIT,
1383 STS_ROLLBACK,
1384 STS_DONOTHING
1385 };
1387 /* RAII wrapper around the above functions, with sanity checking (the token
1388 stream should be the same at the point of instantiation as it is at the
1389 point of destruction).
1391 Creating a variable saves tokens. MODE determines what happens when the
1392 object is destroyed. STS_COMMIT commits tokens (default),
1393 STS_ROLLBACK rolls-back and STS_DONOTHING does nothing. Calling
1394 rollback() will immediately roll-back tokens and set MODE to
1395 STS_DONOTHING. */
1397 struct saved_token_sentinel
1398 {
1401 saved_token_sentinel_mode mode;
1405 {
1408 }
1410 {
1412 cp_lexer_set_source_position_from_token
1415 }
1417 {
1424 }
1425 };
1427 /* Print a representation of the TOKEN on the STREAM. */
1429 static void
1431 {
1432 /* We don't use cpp_type2name here because the parser defines
1433 a few tokens of its own. */
1435 /* cpplib-defined token types */
1436 #define OP(e, s) #e,
1437 #define TK(e, s) #e,
1438 TTYPE_TABLE
1439 #undef OP
1440 #undef TK
1441 /* C++ parser token types - see "Manifest constants", above. */
1445 };
1447 /* For some tokens, print the associated data. */
1449 {
1451 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1452 For example, `struct' is mapped to an INTEGER_CST. */
1455 /* fall through */
1473 /* If we have a name for the token, print it out. Otherwise, we
1474 simply give the numeric code. */
1477 else
1480 }
1481 }
1483 DEBUG_FUNCTION void
1485 {
1488 }
1490 DEBUG_FUNCTION void
1492 {
1495 else
1497 }
1500 /* Start emitting debugging information. */
1502 static void
1504 {
1511 }
1513 /* Stop emitting debugging information. */
1515 static void
1517 {
1524 }
1526 /* Create a new cp_token_cache, representing a range of tokens. */
1530 {
1535 }
1537 /* Diagnose if #pragma omp declare simd isn't followed immediately
1538 by function declaration or definition. */
1542 {
1544 {
1549 }
1550 }
1552 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1553 and put that into "omp declare simd" attribute. */
1557 {
1559 {
1561 {
1564 }
1566 {
1569 }
1570 }
1571 }
1573 /* Similarly, but for use in declaration parsing functions
1574 which call cp_parser_handle_directive_omp_attributes. */
1578 {
1585 "%<declare %s%> directive not immediately followed by "
1589 }
1591 /* Diagnose if #pragma acc routine isn't followed immediately by function
1592 declaration or definition. */
1596 {
1598 {
1600 "%<#pragma acc routine%> not immediately followed by "
1603 }
1604 }
1605 \f
1606 /* Decl-specifiers. */
1608 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1610 static void
1612 {
1614 }
1616 /* Declarators. */
1618 /* Nothing other than the parser should be creating declarators;
1619 declarators are a semi-syntactic representation of C++ entities.
1620 Other parts of the front end that need to create entities (like
1621 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1635 /* An erroneous declarator. */
1638 /* The obstack on which declarators and related data structures are
1639 allocated. */
1642 /* Alloc BYTES from the declarator memory pool. */
1646 {
1648 }
1650 /* Allocate a declarator of the indicated KIND. Clear fields that are
1651 common to all declarators. */
1655 {
1669 }
1671 /* Make a declarator for a generalized identifier. If
1672 QUALIFYING_SCOPE is non-NULL, the identifier is
1673 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1674 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1675 is, if any. */
1680 {
1683 /* It is valid to write:
1685 class C { void f(); };
1686 typedef C D;
1687 void D::f();
1689 The standard is not clear about whether `typedef const C D' is
1690 legal; as of 2002-09-15 the committee is considering that
1691 question. EDG 3.0 allows that syntax. Therefore, we do as
1692 well. */
1707 }
1709 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1710 of modifiers such as const or volatile to apply to the pointer
1711 type, represented as identifiers. ATTRIBUTES represent the attributes that
1712 appertain to the pointer or reference. */
1714 cp_declarator *
1716 tree attributes)
1717 {
1725 {
1729 }
1730 else
1736 }
1738 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1739 represent the attributes that appertain to the pointer or
1740 reference. */
1742 cp_declarator *
1745 {
1753 {
1757 }
1758 else
1764 }
1766 /* Like make_pointer_declarator -- but for a pointer to a non-static
1767 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1768 appertain to the pointer or reference. */
1770 cp_declarator *
1773 tree attributes)
1774 {
1783 {
1786 }
1787 else
1793 }
1795 /* Make a declarator for the function given by TARGET, with the
1796 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1797 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1798 indicates what exceptions can be thrown. STD_ATTRS contains
1799 attributes that appertain to the function type. */
1801 cp_declarator *
1803 tree parms,
1804 cp_cv_quals cv_qualifiers,
1805 cp_virt_specifiers virt_specifiers,
1806 cp_ref_qualifier ref_qualifier,
1807 tree tx_qualifier,
1808 tree exception_specification,
1809 tree late_return_type,
1810 tree requires_clause,
1811 tree std_attrs,
1812 location_t parens_loc)
1813 {
1828 {
1832 }
1833 else
1839 }
1841 /* Make a declarator for an array of BOUNDS elements, each of which is
1842 defined by ELEMENT. */
1844 cp_declarator *
1846 {
1853 {
1857 }
1858 else
1862 }
1864 /* Determine whether the declarator we've seen so far can be a
1865 parameter pack, when followed by an ellipsis. */
1866 static bool
1868 {
1870 /* We already saw an ellipsis. */
1873 /* Search for a declarator name, or any other declarator that goes
1874 after the point where the ellipsis could appear in a parameter
1875 pack. If we find any of these, then this declarator cannot be
1876 made into a parameter pack. */
1879 {
1881 {
1894 }
1895 }
1898 }
1902 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1903 DECLARATOR and DEFAULT_ARGUMENT. */
1905 cp_parameter_declarator *
1908 tree default_argument,
1909 location_t loc,
1911 {
1919 else
1927 }
1929 /* Returns true iff DECLARATOR is a declaration for a function. */
1931 static bool
1933 {
1935 {
1944 }
1946 }
1948 /* The parser. */
1950 /* Overview
1951 --------
1953 A cp_parser parses the token stream as specified by the C++
1954 grammar. Its job is purely parsing, not semantic analysis. For
1955 example, the parser breaks the token stream into declarators,
1956 expressions, statements, and other similar syntactic constructs.
1957 It does not check that the types of the expressions on either side
1958 of an assignment-statement are compatible, or that a function is
1959 not declared with a parameter of type `void'.
1961 The parser invokes routines elsewhere in the compiler to perform
1962 semantic analysis and to build up the abstract syntax tree for the
1963 code processed.
1965 The parser (and the template instantiation code, which is, in a
1966 way, a close relative of parsing) are the only parts of the
1967 compiler that should be calling push_scope and pop_scope, or
1968 related functions. The parser (and template instantiation code)
1969 keeps track of what scope is presently active; everything else
1970 should simply honor that. (The code that generates static
1971 initializers may also need to set the scope, in order to check
1972 access control correctly when emitting the initializers.)
1974 Methodology
1975 -----------
1977 The parser is of the standard recursive-descent variety. Upcoming
1978 tokens in the token stream are examined in order to determine which
1979 production to use when parsing a non-terminal. Some C++ constructs
1980 require arbitrary look ahead to disambiguate. For example, it is
1981 impossible, in the general case, to tell whether a statement is an
1982 expression or declaration without scanning the entire statement.
1983 Therefore, the parser is capable of "parsing tentatively." When the
1984 parser is not sure what construct comes next, it enters this mode.
1985 Then, while we attempt to parse the construct, the parser queues up
1986 error messages, rather than issuing them immediately, and saves the
1987 tokens it consumes. If the construct is parsed successfully, the
1988 parser "commits", i.e., it issues any queued error messages and
1989 the tokens that were being preserved are permanently discarded.
1990 If, however, the construct is not parsed successfully, the parser
1991 rolls back its state completely so that it can resume parsing using
1992 a different alternative.
1994 Future Improvements
1995 -------------------
1997 The performance of the parser could probably be improved substantially.
1998 We could often eliminate the need to parse tentatively by looking ahead
1999 a little bit. In some places, this approach might not entirely eliminate
2000 the need to parse tentatively, but it might still speed up the average
2001 case. */
2003 /* Flags that are passed to some parsing functions. These values can
2004 be bitwise-ored together. */
2006 enum
2007 {
2008 /* No flags. */
2010 /* The construct is optional. If it is not present, then no error
2011 should be issued. */
2013 /* When parsing a type-specifier, treat user-defined type-names
2014 as non-type identifiers. */
2016 /* When parsing a type-specifier, do not try to parse a class-specifier
2017 or enum-specifier. */
2019 /* When parsing a decl-specifier-seq, only allow type-specifier or
2020 constexpr. */
2022 /* When parsing a decl-specifier-seq, only allow mutable, constexpr or
2023 for C++20 consteval or for C++23 static. */
2025 /* When parsing a decl-specifier-seq, allow missing typename. */
2027 /* When parsing of the noexcept-specifier should be delayed. */
2029 /* When parsing a consteval declarator. */
2031 };
2033 /* This type is used for parameters and variables which hold
2034 combinations of the above flags. */
2037 /* The different kinds of declarators we want to parse. */
2039 enum cp_parser_declarator_kind
2040 {
2041 /* We want an abstract declarator. */
2042 CP_PARSER_DECLARATOR_ABSTRACT,
2043 /* We want a named declarator. */
2044 CP_PARSER_DECLARATOR_NAMED,
2045 /* We don't mind, but the name must be an unqualified-id. */
2046 CP_PARSER_DECLARATOR_EITHER
2047 };
2049 /* The precedence values used to parse binary expressions. The minimum value
2050 of PREC must be 1, because zero is reserved to quickly discriminate
2051 binary operators from other tokens. */
2053 enum cp_parser_prec
2054 {
2055 PREC_NOT_OPERATOR,
2056 PREC_LOGICAL_OR_EXPRESSION,
2057 PREC_LOGICAL_AND_EXPRESSION,
2058 PREC_INCLUSIVE_OR_EXPRESSION,
2059 PREC_EXCLUSIVE_OR_EXPRESSION,
2060 PREC_AND_EXPRESSION,
2061 PREC_EQUALITY_EXPRESSION,
2062 PREC_RELATIONAL_EXPRESSION,
2063 PREC_SPACESHIP_EXPRESSION,
2064 PREC_SHIFT_EXPRESSION,
2065 PREC_ADDITIVE_EXPRESSION,
2066 PREC_MULTIPLICATIVE_EXPRESSION,
2067 PREC_PM_EXPRESSION,
2068 NUM_PREC_VALUES = PREC_PM_EXPRESSION
2069 };
2071 /* A mapping from a token type to a corresponding tree node type, with a
2072 precedence value. */
2074 struct cp_parser_binary_operations_map_node
2075 {
2076 /* The token type. */
2078 /* The corresponding tree code. */
2080 /* The precedence of this operator. */
2082 };
2084 struct cp_parser_expression_stack_entry
2085 {
2086 /* Left hand side of the binary operation we are currently
2087 parsing. */
2088 cp_expr lhs;
2089 /* Original tree code for left hand side, if it was a binary
2090 expression itself (used for -Wparentheses). */
2092 /* Tree code for the binary operation we are parsing. */
2094 /* Precedence of the binary operation we are parsing. */
2096 /* Location of the binary operation we are parsing. */
2097 location_t loc;
2098 /* Flags from the operator token. */
2100 };
2102 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
2103 entries because precedence levels on the stack are monotonically
2104 increasing. */
2108 /* Used for parsing OMP for loops.
2110 Some notes on flags used for context:
2111 parser->omp_for_parse_state is non-null anywhere inside the OMP FOR
2112 construct, except for the final-loop-body.
2113 The want_nested_loop flag is true if inside a {} sequence where
2114 a loop-nest (or another {} sequence containing a loop-nest) is expected,
2115 but has not yet been seen. It's false when parsing intervening code
2116 statements or their substatements that cannot contain a loop-nest.
2117 The in_intervening_code flag is true when parsing any intervening code,
2118 including substatements, and whether or not want_nested_loop is true.
2120 And, about error handling:
2121 The saw_intervening_code flag is set if the loop is not perfectly
2122 nested, even in the usual case where this is not an error.
2123 perfect_nesting_fail is set if an error has been diagnosed because an
2124 imperfectly-nested loop was found where a perfectly-nested one is
2125 required (we diagnose this only once).
2126 fail is set if any kind of structural error in the loop nest
2127 has been found and diagnosed.
2128 */
2132 tree pre_body;
2133 tree orig_declv;
2137 location_t for_loc;
2138 releasing_vec init_blockv;
2139 releasing_vec body_blockv;
2140 releasing_vec init_placeholderv;
2141 releasing_vec body_placeholderv;
2149 tree clauses;
2151 tree ordered_cl;
2152 };
2154 /* Prototypes. */
2156 /* Constructors and destructors. */
2161 /* Class variables. */
2165 /* The operator-precedence table used by cp_parser_binary_expression.
2166 Transformed into an associative array (binops_by_token) by
2167 cp_parser_new. */
2202 };
2204 /* The same as binops, but initialized by cp_parser_new so that
2205 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
2206 for speed. */
2209 /* Constructors and destructors. */
2211 /* Construct a new context. The context below this one on the stack
2212 is given by NEXT. */
2216 {
2219 /* Allocate the storage. */
2221 {
2222 /* Pull the first entry from the free list. */
2226 }
2227 else
2230 /* No errors have occurred yet in this context. */
2232 /* If this is not the bottommost context, copy information that we
2233 need from the previous context. */
2235 {
2236 /* If, in the NEXT context, we are parsing an `x->' or `x.'
2237 expression, then we are parsing one in this context, too. */
2239 /* Thread the stack. */
2241 }
2244 }
2246 /* Managing the unparsed function queues. */
2248 #define unparsed_funs_with_default_args \
2249 parser->unparsed_queues->last ().funs_with_default_args
2250 #define unparsed_funs_with_definitions \
2251 parser->unparsed_queues->last ().funs_with_definitions
2252 #define unparsed_nsdmis \
2253 parser->unparsed_queues->last ().nsdmis
2254 #define unparsed_noexcepts \
2255 parser->unparsed_queues->last ().noexcepts
2256 #define unparsed_contracts \
2257 parser->unparsed_queues->last ().contracts
2259 static void
2261 {
2262 cp_unparsed_functions_entry e
2265 }
2267 static void
2269 {
2272 }
2274 /* Prototypes. */
2276 /* Routines to parse various constructs.
2278 Those that return `tree' will return the error_mark_node (rather
2279 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2280 Sometimes, they will return an ordinary node if error-recovery was
2281 attempted, even though a parse error occurred. So, to check
2282 whether or not a parse error occurred, you should always use
2283 cp_parser_error_occurred. If the construct is optional (indicated
2284 either by an `_opt' in the name of the function that does the
2285 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2286 the construct is not present. */
2288 /* Lexical conventions [gram.lex] */
2290 static tree finish_userdef_string_literal
2293 /* Basic concepts [gram.basic] */
2297 /* Expressions [gram.expr] */
2299 static cp_expr cp_parser_primary_expression
2301 static cp_expr cp_parser_id_expression
2303 static cp_expr cp_parser_unqualified_id
2305 static tree cp_parser_nested_name_specifier_opt
2307 static tree cp_parser_nested_name_specifier
2309 static tree cp_parser_qualifying_entity
2311 static cp_expr cp_parser_postfix_expression
2313 static tree cp_parser_postfix_open_square_expression
2315 static tree cp_parser_postfix_dot_deref_expression
2320 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2322 static void cp_parser_pseudo_destructor_name
2324 static cp_expr cp_parser_unary_expression
2326 static enum tree_code cp_parser_unary_operator
2328 static tree cp_parser_has_attribute_expression
2330 static tree cp_parser_new_expression
2334 static tree cp_parser_new_type_id
2342 static tree cp_parser_delete_expression
2344 static cp_expr cp_parser_cast_expression
2346 static cp_expr cp_parser_binary_expression
2348 static tree cp_parser_question_colon_clause
2351 static cp_expr cp_parser_assignment_expression
2353 static enum tree_code cp_parser_assignment_operator_opt
2355 static cp_expr cp_parser_expression
2357 static cp_expr cp_parser_constant_expression
2359 static cp_expr cp_parser_builtin_offsetof
2361 static cp_expr cp_parser_lambda_expression
2363 static void cp_parser_lambda_introducer
2365 static bool cp_parser_lambda_declarator_opt
2367 static void cp_parser_lambda_body
2370 /* Statements [gram.stmt.stmt] */
2372 static void cp_parser_statement
2374 static void cp_parser_label_for_labeled_statement
2376 static tree cp_parser_expression_statement
2378 static tree cp_parser_compound_statement
2380 static void cp_parser_statement_seq_opt
2382 static tree cp_parser_selection_statement
2384 static tree cp_parser_condition
2386 static tree cp_parser_iteration_statement
2388 static bool cp_parser_init_statement
2390 static tree cp_parser_for
2392 static tree cp_parser_c_for
2394 static tree cp_parser_range_for
2396 static void do_range_for_auto_deduction
2398 static tree cp_parser_perform_range_for_lookup
2400 static tree cp_parser_range_for_member_function
2402 static tree cp_parser_jump_statement
2404 static void cp_parser_declaration_statement
2407 static tree cp_parser_implicitly_scoped_statement
2409 static void cp_parser_already_scoped_statement
2412 /* State of module-declaration parsing. */
2413 enum module_parse
2414 {
2417 _MP_UNUSED,
2427 };
2429 static module_parse cp_parser_module_declaration
2431 static void cp_parser_import_declaration
2434 /* Declarations [gram.dcl.dcl] */
2436 static void cp_parser_declaration_seq_opt
2438 static void cp_parser_declaration
2440 static void cp_parser_toplevel_declaration
2442 static void cp_parser_block_declaration
2444 static void cp_parser_simple_declaration
2446 static void cp_parser_decl_specifier_seq
2448 static tree cp_parser_storage_class_specifier_opt
2450 static tree cp_parser_function_specifier_opt
2452 static tree cp_parser_type_specifier
2455 static tree cp_parser_simple_type_specifier
2457 static tree cp_parser_placeholder_type_specifier
2459 static tree cp_parser_type_name
2461 static tree cp_parser_nonclass_name
2463 static tree cp_parser_elaborated_type_specifier
2465 static tree cp_parser_enum_specifier
2467 static void cp_parser_enumerator_list
2469 static void cp_parser_enumerator_definition
2471 static tree cp_parser_namespace_name
2473 static void cp_parser_namespace_definition
2475 static void cp_parser_namespace_body
2477 static tree cp_parser_qualified_namespace_specifier
2479 static void cp_parser_namespace_alias_definition
2481 static bool cp_parser_using_declaration
2483 static void cp_parser_using_directive
2485 static void cp_parser_using_enum
2487 static tree cp_parser_alias_declaration
2489 static void cp_parser_asm_definition
2491 static void cp_parser_linkage_specification
2493 static void cp_parser_static_assert
2495 static tree cp_parser_decltype
2497 static tree cp_parser_decomposition_declaration
2500 /* Declarators [gram.dcl.decl] */
2502 static tree cp_parser_init_declarator
2512 static enum tree_code cp_parser_ptr_operator
2514 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2516 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2518 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2520 static tree cp_parser_tx_qualifier_opt
2522 static tree cp_parser_late_return_type_opt
2524 static tree cp_parser_declarator_id
2526 static tree cp_parser_type_id
2528 static tree cp_parser_template_type_arg
2531 static tree cp_parser_type_id_1
2533 static void cp_parser_type_specifier_seq
2535 static tree cp_parser_parameter_declaration_clause
2537 static tree cp_parser_parameter_declaration_list
2541 static tree cp_parser_default_argument
2543 static void cp_parser_function_body
2545 static tree cp_parser_initializer
2547 static cp_expr cp_parser_initializer_clause
2549 static cp_expr cp_parser_braced_list
2554 static void cp_parser_ctor_initializer_opt_and_function_body
2557 static tree cp_parser_late_parsing_omp_declare_simd
2560 static tree cp_parser_late_parsing_oacc_routine
2563 static tree synthesize_implicit_template_parm
2565 static tree finish_fully_implicit_template
2567 static void abort_fully_implicit_template
2570 /* Classes [gram.class] */
2572 static tree cp_parser_class_name
2574 static tree cp_parser_class_specifier
2576 static tree cp_parser_class_head
2578 static enum tag_types cp_parser_class_key
2580 static void cp_parser_type_parameter_key
2582 static void cp_parser_member_specification_opt
2584 static void cp_parser_member_declaration
2586 static tree cp_parser_pure_specifier
2588 static tree cp_parser_constant_initializer
2591 /* Derived classes [gram.class.derived] */
2593 static tree cp_parser_base_clause
2595 static tree cp_parser_base_specifier
2598 /* Special member functions [gram.special] */
2600 static tree cp_parser_conversion_function_id
2602 static tree cp_parser_conversion_type_id
2606 static void cp_parser_ctor_initializer_opt
2608 static void cp_parser_mem_initializer_list
2610 static tree cp_parser_mem_initializer
2612 static tree cp_parser_mem_initializer_id
2615 /* Overloading [gram.over] */
2617 static cp_expr cp_parser_operator_function_id
2619 static cp_expr cp_parser_operator
2622 /* Templates [gram.temp] */
2624 static void cp_parser_template_declaration
2626 static tree cp_parser_template_parameter_list
2628 static tree cp_parser_template_parameter
2630 static tree cp_parser_type_parameter
2632 static tree cp_parser_template_id
2634 static tree cp_parser_template_id_expr
2636 static tree cp_parser_template_name
2638 static tree cp_parser_template_argument_list
2640 static tree cp_parser_template_argument
2642 static void cp_parser_explicit_instantiation
2644 static void cp_parser_explicit_specialization
2647 /* Exception handling [gram.except] */
2649 static tree cp_parser_try_block
2651 static void cp_parser_function_try_block
2653 static void cp_parser_handler_seq
2655 static void cp_parser_handler
2657 static tree cp_parser_exception_declaration
2659 static tree cp_parser_throw_expression
2661 static tree cp_parser_exception_specification_opt
2663 static tree cp_parser_type_id_list
2665 static tree cp_parser_noexcept_specification_opt
2668 /* GNU Extensions */
2670 static tree cp_parser_asm_specification_opt
2672 static tree cp_parser_asm_operand_list
2674 static tree cp_parser_asm_clobber_list
2676 static tree cp_parser_asm_label_list
2678 static bool cp_next_tokens_can_be_attribute_p
2680 static bool cp_next_tokens_can_be_gnu_attribute_p
2682 static bool cp_next_tokens_can_be_std_attribute_p
2684 static bool cp_nth_tokens_can_be_std_attribute_p
2686 static bool cp_nth_tokens_can_be_gnu_attribute_p
2688 static bool cp_nth_tokens_can_be_attribute_p
2690 static tree cp_parser_attributes_opt
2692 static tree cp_parser_gnu_attributes_opt
2694 static tree cp_parser_gnu_attribute_list
2696 static tree cp_parser_std_attribute
2698 static tree cp_parser_std_attribute_spec
2700 static tree cp_parser_std_attribute_spec_seq
2702 static size_t cp_parser_skip_std_attribute_spec_seq
2704 static size_t cp_parser_skip_attributes_opt
2706 static bool cp_parser_extension_opt
2708 static void cp_parser_label_declaration
2711 /* Concept Extensions */
2713 static tree cp_parser_concept_definition
2715 static tree cp_parser_constraint_expression
2717 static tree cp_parser_requires_clause_opt
2719 static tree cp_parser_requires_expression
2721 static tree cp_parser_requirement_parameter_list
2723 static tree cp_parser_requirement_body
2725 static tree cp_parser_requirement_seq
2727 static tree cp_parser_requirement
2729 static tree cp_parser_simple_requirement
2731 static tree cp_parser_compound_requirement
2733 static tree cp_parser_type_requirement
2735 static tree cp_parser_nested_requirement
2738 /* Transactional Memory Extensions */
2740 static tree cp_parser_transaction
2742 static tree cp_parser_transaction_expression
2744 static void cp_parser_function_transaction
2746 static tree cp_parser_transaction_cancel
2749 /* Coroutine extensions. */
2751 static tree cp_parser_yield_expression
2754 /* Contracts */
2756 static void cp_parser_late_contract_condition
2760 pragma_external,
2761 pragma_member,
2762 pragma_objc_icode,
2763 pragma_stmt,
2764 pragma_compound
2765 };
2766 static bool cp_parser_pragma
2769 /* Objective-C++ Productions */
2771 static tree cp_parser_objc_message_receiver
2773 static tree cp_parser_objc_message_args
2775 static tree cp_parser_objc_message_expression
2777 static cp_expr cp_parser_objc_encode_expression
2779 static tree cp_parser_objc_defs_expression
2781 static tree cp_parser_objc_protocol_expression
2783 static tree cp_parser_objc_selector_expression
2785 static cp_expr cp_parser_objc_expression
2787 static bool cp_parser_objc_selector_p
2789 static tree cp_parser_objc_selector
2791 static tree cp_parser_objc_protocol_refs_opt
2793 static void cp_parser_objc_declaration
2795 static tree cp_parser_objc_statement
2797 static bool cp_parser_objc_valid_prefix_attributes
2799 static void cp_parser_objc_at_property_declaration
2801 static void cp_parser_objc_at_synthesize_declaration
2803 static void cp_parser_objc_at_dynamic_declaration
2805 static tree cp_parser_objc_struct_declaration
2808 /* Utility Routines */
2810 static cp_expr cp_parser_lookup_name
2812 static tree cp_parser_lookup_name_simple
2814 static tree cp_parser_maybe_treat_template_as_class
2816 static bool cp_parser_check_declarator_template_parameters
2818 static bool cp_parser_check_template_parameters
2820 static cp_expr cp_parser_simple_cast_expression
2822 static tree cp_parser_global_scope_opt
2824 static bool cp_parser_constructor_declarator_p
2826 static tree cp_parser_function_definition_from_specifiers_and_declarator
2828 static tree cp_parser_function_definition_after_declarator
2830 static bool cp_parser_template_declaration_after_export
2832 static void cp_parser_perform_template_parameter_access_checks
2834 static tree cp_parser_single_declaration
2836 static cp_expr cp_parser_functional_cast
2838 static tree cp_parser_save_member_function_body
2840 static tree cp_parser_save_nsdmi
2842 static tree cp_parser_enclosed_template_argument_list
2844 static void cp_parser_save_default_args
2846 static void cp_parser_late_parsing_for_member
2848 static tree cp_parser_late_parse_one_default_arg
2850 static void cp_parser_late_parsing_nsdmi
2852 static void cp_parser_late_parsing_default_args
2854 static tree cp_parser_sizeof_operand
2856 static cp_expr cp_parser_trait
2858 static bool cp_parser_declares_only_class_p
2860 static void cp_parser_set_storage_class
2862 static void cp_parser_set_decl_spec_type
2864 static void set_and_check_decl_spec_loc
2867 static bool cp_parser_friend_p
2869 static void cp_parser_required_error
2875 static bool cp_parser_token_starts_function_definition_p
2877 static bool cp_parser_next_token_starts_class_definition_p
2879 static bool cp_parser_next_token_ends_template_argument_p
2881 static bool cp_parser_nth_token_starts_template_argument_list_p
2883 static enum tag_types cp_parser_token_is_class_key
2885 static enum tag_types cp_parser_token_is_type_parameter_key
2888 static void cp_parser_check_class_key
2890 static void cp_parser_check_access_in_redeclaration
2892 static bool cp_parser_optional_template_keyword
2894 static void cp_parser_pre_parsed_nested_name_specifier
2896 static bool cp_parser_cache_group
2898 static tree cp_parser_cache_defarg
2900 static void cp_parser_parse_tentatively
2902 static void cp_parser_commit_to_tentative_parse
2904 static void cp_parser_commit_to_topmost_tentative_parse
2906 static void cp_parser_abort_tentative_parse
2908 static bool cp_parser_parse_definitely
2912 static bool cp_parser_uncommitted_to_tentative_parse_p
2914 static void cp_parser_error
2916 static void cp_parser_name_lookup_error
2918 static bool cp_parser_simulate_error
2920 static bool cp_parser_check_type_definition
2922 static void cp_parser_check_for_definition_in_return_type
2924 static void cp_parser_check_for_invalid_template_id
2926 static bool cp_parser_non_integral_constant_expression
2928 static void cp_parser_diagnose_invalid_type_name
2930 static bool cp_parser_parse_and_diagnose_invalid_type_name
2932 static int cp_parser_skip_to_closing_parenthesis
2934 static void cp_parser_skip_to_end_of_statement
2936 static void cp_parser_consume_semicolon_at_end_of_statement
2938 static void cp_parser_skip_to_end_of_block_or_statement
2940 static bool cp_parser_skip_to_closing_brace
2942 static bool cp_parser_skip_entire_template_parameter_list
2944 static void cp_parser_require_end_of_template_parameter_list
2946 static bool cp_parser_skip_to_end_of_template_parameter_list
2948 static void cp_parser_skip_to_pragma_eol
2950 static bool cp_parser_error_occurred
2952 static bool cp_parser_allow_gnu_extensions_p
2954 static bool cp_parser_is_pure_string_literal
2956 static bool cp_parser_is_string_literal
2958 static bool cp_parser_is_keyword
2960 static tree cp_parser_make_typename_type
2964 static bool cp_parser_compound_literal_p
2966 static bool cp_parser_array_designator_p
2968 static bool cp_parser_init_statement_p
2970 static bool cp_parser_skip_up_to_closing_square_bracket
2972 static bool cp_parser_skip_to_closing_square_bracket
2977 // -------------------------------------------------------------------------- //
2978 // Unevaluated Operand Guard
2979 //
2980 // Implementation of an RAII helper for unevaluated operand parsing.
2982 {
2985 }
2988 {
2991 }
2993 // -------------------------------------------------------------------------- //
2994 // Tentative Parsing
2996 /* Returns nonzero if we are parsing tentatively. */
3000 {
3002 }
3004 /* Returns nonzero if TOKEN is a string literal. */
3006 static bool
3008 {
3014 }
3016 /* Returns nonzero if TOKEN is a string literal
3017 of a user-defined string literal. */
3019 static bool
3021 {
3028 }
3030 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
3032 static bool
3034 {
3036 }
3038 /* Helper function for cp_parser_error.
3039 Having peeked a token of kind TOK1_KIND that might signify
3040 a conflict marker, peek successor tokens to determine
3041 if we actually do have a conflict marker.
3042 Specifically, we consider a run of 7 '<', '=' or '>' characters
3043 at the start of a line as a conflict marker.
3044 These come through the lexer as three pairs and a single,
3045 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
3046 If it returns true, *OUT_LOC is written to with the location/range
3047 of the marker. */
3049 static bool
3052 {
3063 /* It must be at the start of the line. */
3068 /* We have a conflict marker. Construct a location of the form:
3069 <<<<<<<
3070 ^~~~~~~
3071 with start == caret, finishing at the end of the marker. */
3076 }
3078 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
3079 RT_CLOSE_PAREN. */
3083 {
3085 {
3093 }
3094 }
3096 /* Attempt to convert TOKEN_DESC from a required_token to an
3097 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
3099 static enum cpp_ttype
3101 {
3103 {
3124 /* Use CPP_EOF as a "no completions possible" code. */
3126 }
3127 }
3130 /* Subroutine of cp_parser_error and cp_parser_required_error.
3132 Issue a diagnostic of the form
3133 FILE:LINE: MESSAGE before TOKEN
3134 where TOKEN is the next token in the input stream. MESSAGE
3135 (specified by the caller) is usually of the form "expected
3136 OTHER-TOKEN".
3138 This bypasses the check for tentative passing, and potentially
3139 adds material needed by cp_parser_required_error.
3141 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
3142 suggesting insertion of the missing token.
3144 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
3145 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
3146 location. */
3148 static void
3150 required_token missing_token_desc,
3151 location_t matching_location)
3152 {
3154 /* This diagnostic makes more sense if it is tagged to the line
3155 of the token we just peeked at. */
3159 {
3164 }
3166 /* If this is actually a conflict marker, report it as such. */
3170 {
3171 location_t loc;
3173 {
3176 /* Consume tokens until the end of the source line. */
3178 {
3192 }
3194 }
3195 }
3197 auto_diagnostic_group d;
3204 {
3205 /* Potentially supply a fix-it hint, suggesting to add the
3206 missing token immediately after the *previous* token.
3207 This may move the primary location within richloc. */
3211 prev_token_loc);
3213 /* If matching_location != UNKNOWN_LOCATION, highlight it.
3214 Attempt to consolidate diagnostics by printing it as a
3215 secondary range within the main diagnostic. */
3217 added_matching_location
3219 }
3221 /* If we were parsing a string-literal and there is an unknown name
3222 token right after, then check to see if that could also have been
3223 a literal string by checking the name against a list of known
3224 standard string literal constants defined in header files. If
3225 there is one, then add that as an hint to the error message. */
3226 name_hint h;
3230 {
3237 token_name,
3238 header_hint));
3239 }
3241 /* Actually emit the error. */
3243 /* Because c_parser_error does not understand
3244 CPP_KEYWORD, keywords are treated like
3245 identifiers. */
3250 {
3251 /* If we weren't able to consolidate matching_location, then
3252 print it as a secondary diagnostic. */
3257 }
3258 }
3260 /* If not parsing tentatively, issue a diagnostic of the form
3261 FILE:LINE: MESSAGE before TOKEN
3262 where TOKEN is the next token in the input stream. MESSAGE
3263 (specified by the caller) is usually of the form "expected
3264 OTHER-TOKEN". */
3266 static void
3268 {
3271 }
3273 /* Issue an error about name-lookup failing. NAME is the
3274 IDENTIFIER_NODE DECL is the result of
3275 the lookup (as returned from cp_parser_lookup_name). DESIRED is
3276 the thing that we hoped to find. */
3278 static void
3280 tree name,
3281 tree decl,
3282 name_lookup_error desired,
3283 location_t location)
3284 {
3285 /* If name lookup completely failed, tell the user that NAME was not
3286 declared. */
3288 {
3301 else
3303 }
3305 {
3307 {
3324 }
3325 }
3327 {
3329 {
3339 name);
3343 }
3344 }
3345 else
3346 {
3348 {
3361 }
3362 }
3363 }
3365 /* If we are parsing tentatively, remember that an error has occurred
3366 during this tentative parse. Returns true if the error was
3367 simulated; false if a message should be issued by the caller. */
3369 static bool
3371 {
3373 {
3376 }
3378 }
3380 /* This function is called when a type is defined. If type
3381 definitions are forbidden at this point, an error message is
3382 issued. */
3384 static bool
3386 {
3387 /* If types are forbidden here, issue a message. */
3389 {
3390 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3391 or %qs in the message need to be interpreted. */
3395 }
3397 }
3399 /* This function is called when the DECLARATOR is processed. The TYPE
3400 was a type defined in the decl-specifiers. If it is invalid to
3401 define a type in the decl-specifiers for DECLARATOR, an error is
3402 issued. TYPE_LOCATION is the location of TYPE and is used
3403 for error reporting. */
3405 static void
3408 {
3409 /* [dcl.fct] forbids type definitions in return types.
3410 Unfortunately, it's not easy to know whether or not we are
3411 processing a return type until after the fact. */
3419 {
3424 type);
3425 }
3426 }
3428 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3429 "<" in any valid C++ program. If the next token is indeed "<",
3430 issue a message warning the user about what appears to be an
3431 invalid attempt to form a template-id. LOCATION is the location
3432 of the type-specifier (TYPE) */
3434 static void
3436 tree type,
3438 location_t location)
3439 {
3443 {
3449 {
3452 else
3454 }
3455 else
3457 /* Remember the location of the invalid "<". */
3460 /* Consume the "<". */
3462 /* Parse the template arguments. */
3464 /* Permanently remove the invalid template arguments so that
3465 this error message is not issued again. */
3468 }
3469 }
3471 /* If parsing an integral constant-expression, issue an error message
3472 about the fact that THING appeared and return true. Otherwise,
3473 return false. In either case, set
3474 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3476 static bool
3478 non_integral_constant thing)
3479 {
3482 {
3484 {
3487 {
3490 "ISO C++ forbids using a floating-point literal "
3495 "enumeration type cannot appear in a "
3586 }
3590 }
3591 }
3593 }
3595 /* Emit a diagnostic for an invalid type name. This function commits
3596 to the current active tentative parse, if any. (Otherwise, the
3597 problematic construct might be encountered again later, resulting
3598 in duplicate error messages.) LOCATION is the location of ID. */
3600 static void
3602 location_t location)
3603 {
3606 /* Try to lookup the identifier. */
3613 /* If the lookup was ambiguous, an error will already have
3614 been issued. */
3616 /* If the lookup found a template-name, it means that the user forgot
3617 to specify an argument list. Emit a useful error message. */
3619 {
3620 auto_diagnostic_group d;
3623 decl);
3628 }
3632 /* Something like 'unsigned A a;' */
3635 {
3636 /* Issue an error message. */
3637 auto_diagnostic_group d;
3638 name_hint hint;
3642 {
3648 }
3649 else
3651 /* If we're in a template class, it's possible that the user was
3652 referring to a type from a base class. For example:
3654 template <typename T> struct A { typedef T X; };
3655 template <typename T> struct B : public A<T> { X x; };
3657 The user should have said "typename A<T>::X". */
3666 {
3669 id);
3672 id);
3673 else
3676 }
3693 {
3696 {
3700 {
3701 /* Go from a particular instantiation of the
3702 template (which will have an empty TYPE_FIELDs),
3703 to the main version. */
3709 {
3714 }
3715 }
3716 }
3717 found:;
3718 }
3719 }
3720 /* Here we diagnose qualified-ids where the scope is actually correct,
3721 but the identifier does not resolve to a valid type name. */
3723 {
3725 {
3726 auto_diagnostic_group d;
3727 name_hint hint;
3736 {
3739 "%qE in namespace %qE does not name a template"
3742 else
3746 }
3748 {
3751 "%qE in namespace %qE does not name a template"
3754 else
3756 "%qE in namespace %qE does not name a template"
3759 }
3760 else
3761 {
3764 "%qE in namespace %qE does not name a type"
3767 else
3771 }
3774 }
3777 {
3778 /* A<T>::A<T>() */
3779 auto_diagnostic_group d;
3785 }
3788 {
3793 "need %<typename%> before %<%T::%D::%E%> because "
3797 id,
3800 else
3804 }
3806 {
3807 auto_diagnostic_group d;
3819 else
3825 }
3826 else
3828 }
3829 }
3831 /* Check for a common situation where a type-name should be present,
3832 but is not, and issue a sensible error message. Returns true if an
3833 invalid type-name was detected.
3835 The situation handled by this function are variable declarations of the
3836 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3837 Usually, `ID' should name a type, but if we got here it means that it
3838 does not. We try to emit the best possible error message depending on
3839 how exactly the id-expression looks like. */
3841 static bool
3843 {
3844 tree id;
3847 /* Avoid duplicate error about ambiguous lookup. */
3849 {
3853 }
3862 /* If the next token is a (, this is a function with no explicit return
3863 type, i.e. constructor, destructor or conversion op. */
3866 {
3869 }
3873 /* Emit a diagnostic for the invalid type. */
3875 out:
3876 /* If we aren't in the middle of a declarator (i.e. in a
3877 parameter-declaration-clause), skip to the end of the declaration;
3878 there's no point in trying to process it. */
3882 }
3884 /* Consume tokens up to, and including, the next non-nested closing `)'.
3885 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3886 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3887 found an unnested token of that type. */
3889 static int
3892 cpp_ttype or_ttype,
3894 {
3905 {
3908 /* Have we found what we're looking for before the closing paren? */
3914 {
3918 /* FALLTHRU */
3920 /* If we've run out of tokens, then there is no closing `)'. */
3923 /* This is good for lambda expression capture-lists. */
3933 /* This matches the processing in skip_to_end_of_statement. */
3953 {
3957 }
3967 condop_depth--;
3973 /* FALLTHROUGH */
3976 /* We fell into a pragma. Skip it, and continue. */
3982 }
3984 /* Consume the token. */
3986 }
3987 }
3989 /* Consume tokens up to, and including, the next non-nested closing `)'.
3990 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3991 are doing error recovery. Returns -1 if OR_COMMA is true and we
3992 found an unnested token of that type. */
3994 static int
3999 {
4003 }
4005 /* Consume tokens until we reach the end of the current statement.
4006 Normally, that will be just before consuming a `;'. However, if a
4007 non-nested `}' comes first, then we stop before consuming that. */
4009 static void
4011 {
4014 /* Unwind generic function template scope if necessary. */
4019 {
4023 {
4027 /* FALLTHRU */
4029 /* If we've run out of tokens, stop. */
4033 /* If the next token is a `;', we have reached the end of the
4034 statement. */
4040 /* If this is a non-nested '}', stop before consuming it.
4041 That way, when confronted with something like:
4043 { 3 + }
4045 we stop before consuming the closing '}', even though we
4046 have not yet reached a `;'. */
4050 /* If it is the closing '}' for a block that we have
4051 scanned, stop -- but only after consuming the token.
4052 That way given:
4054 void f g () { ... }
4055 typedef int I;
4057 we will stop after the body of the erroneously declared
4058 function, but before consuming the following `typedef'
4059 declaration. */
4061 {
4064 }
4074 /* FALLTHROUGH */
4077 /* We fell into a pragma. Skip it, and continue or return. */
4085 }
4087 /* Consume the token. */
4089 }
4090 }
4092 /* This function is called at the end of a statement or declaration.
4093 If the next token is a semicolon, it is consumed; otherwise, error
4094 recovery is attempted. */
4096 static void
4098 {
4099 /* Look for the trailing `;'. */
4101 {
4102 /* If there is additional (erroneous) input, skip to the end of
4103 the statement. */
4105 /* If the next token is now a `;', consume it. */
4108 }
4109 }
4111 /* Skip tokens until we have consumed an entire block, or until we
4112 have consumed a non-nested `;'. */
4114 static void
4116 {
4119 /* Unwind generic function template scope if necessary. */
4124 {
4128 {
4132 /* FALLTHRU */
4134 /* If we've run out of tokens, stop. */
4138 /* Stop if this is an unnested ';'. */
4144 /* Stop if this is an unnested '}', or closes the outermost
4145 nesting level. */
4146 nesting_depth--;
4154 /* Nest. */
4155 nesting_depth++;
4161 /* FALLTHROUGH */
4164 /* Skip it, and continue or return. */
4172 }
4174 /* Consume the token. */
4176 }
4177 }
4179 /* Skip tokens until a non-nested closing curly brace is the next
4180 token, or there are no more tokens. Return true in the first case,
4181 false otherwise. */
4183 static bool
4185 {
4189 {
4193 {
4197 /* FALLTHRU */
4199 /* If we've run out of tokens, stop. */
4203 /* If the next token is a non-nested `}', then we have reached
4204 the end of the current block. */
4210 /* If it the next token is a `{', then we are entering a new
4211 block. Consume the entire block. */
4217 }
4219 /* Consume the token. */
4221 }
4222 }
4224 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
4225 parameter is the PRAGMA token, allowing us to purge the entire pragma
4226 sequence. PRAGMA_TOK can be NULL, if we're speculatively scanning
4227 forwards (not error recovery). */
4229 static void
4231 {
4234 do
4235 {
4236 /* The preprocessor makes sure that a PRAGMA_EOL token appears
4237 before an EOF token, even when the EOF is on the pragma line.
4238 We should never get here without being inside a deferred
4239 pragma. */
4242 }
4246 {
4250 {
4252 /* Put the current source position back where it was before this
4253 lexer was pushed. */
4255 }
4256 }
4257 }
4259 /* Require pragma end of line, resyncing with it as necessary. The
4260 arguments are as for cp_parser_skip_to_pragma_eol. */
4262 static void
4264 {
4270 {
4272 /* Put the current source position back where it was before this
4273 lexer was pushed. */
4275 }
4276 }
4278 /* This is a simple wrapper around make_typename_type. When the id is
4279 an unresolved identifier node, we can provide a superior diagnostic
4280 using cp_parser_diagnose_invalid_type_name. */
4282 static tree
4284 location_t id_location)
4285 {
4286 tree result;
4288 {
4294 }
4296 }
4298 /* This is a wrapper around the
4299 make_{pointer,ptrmem,reference}_declarator functions that decides
4300 which one to call based on the CODE and CLASS_TYPE arguments. The
4301 CODE argument should be one of the values returned by
4302 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
4303 appertain to the pointer or reference. */
4307 cp_cv_quals cv_qualifiers,
4309 tree attributes)
4310 {
4317 else
4327 }
4329 /* Create a new C++ parser. */
4333 {
4334 /* Initialize the binops_by_token so that we can get the tree
4335 directly from the token. */
4343 /* For now, we always accept GNU extensions. */
4346 /* The `>' token is a greater-than operator, not the end of a
4347 template-id. */
4352 /* We are not parsing a constant-expression. */
4357 /* Local variable names are not forbidden. */
4360 /* We are not processing an `extern "C"' declaration. */
4363 /* We are not processing a declarator. */
4366 /* We are not processing a template-argument-list. */
4369 /* We are not in an iteration statement. */
4372 /* We are not in a switch statement. */
4375 /* We are not parsing a type-id inside an expression. */
4378 /* String literals should be translated to the execution character set. */
4381 /* We are not parsing a function body. */
4384 /* We can correct until told otherwise. */
4387 /* The unparsed function queue is empty. */
4390 /* There are no classes being defined. */
4393 /* No template parameters apply. */
4396 /* Special parsing data structures. */
4400 /* Not declaring an implicit function template. */
4406 /* Allow constrained-type-specifiers. */
4409 /* We haven't yet seen an 'extern "C"'. */
4413 }
4415 /* Create a cp_lexer structure which will emit the tokens in CACHE
4416 and push it onto the parser's lexer stack. This is used for delayed
4417 parsing of in-class method bodies and default arguments, and should
4418 not be confused with tentative parsing. */
4419 static void
4421 {
4426 /* Move the current source position to that of the first token in the
4427 new lexer. */
4429 }
4431 /* Pop the top lexer off the parser stack. This is never used for the
4432 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4433 static void
4435 {
4440 /* Put the current source position back where it was before this
4441 lexer was pushed. */
4443 }
4445 /* Lexical conventions [gram.lex] */
4447 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4448 identifier. */
4450 static cp_expr
4452 {
4455 /* Look for the identifier. */
4457 /* Return the value. */
4460 else
4462 }
4464 /* Worker for cp_parser_string_literal and cp_parser_userdef_string_literal.
4465 Do not call this directly; use either of the above.
4467 Parse a sequence of adjacent string constants. Return a
4468 TREE_STRING representing the combined, nul-terminated string
4469 constant. If TRANSLATE is true, translate the string to the
4470 execution character set. If WIDE_OK is true, a wide string is
4471 valid here. If UDL_OK is true, a string literal with user-defined
4472 suffix can be used in this context.
4474 C++98 [lex.string] says that if a narrow string literal token is
4475 adjacent to a wide string literal token, the behavior is undefined.
4476 However, C99 6.4.5p4 says that this results in a wide string literal.
4477 We follow C99 here, for consistency with the C front end.
4479 This code is largely lifted from lex_string() in c-lex.cc.
4481 FUTURE: ObjC++ will need to handle @-strings here. */
4483 static cp_expr
4487 {
4488 tree value;
4496 tree string_tree;
4502 {
4505 }
4510 {
4512 {
4516 }
4520 }
4521 else
4522 {
4525 }
4528 /* Try to avoid the overhead of creating and destroying an obstack
4529 for the common case of just one string. */
4532 {
4540 {
4544 }
4545 else
4549 }
4550 else
4551 {
4557 do
4558 {
4560 count++;
4565 {
4568 {
4571 }
4574 {
4579 }
4581 }
4582 else
4586 {
4590 {
4594 "concatenation of string literals with "
4596 }
4597 }
4606 {
4608 {
4612 }
4616 }
4617 else
4618 {
4622 }
4623 }
4626 /* A string literal built by concatenation has its caret=start at
4627 the start of the initial string, and its finish at the finish of
4628 the final string literal. */
4632 }
4635 {
4638 }
4642 {
4646 {
4650 }
4653 {
4661 else
4673 }
4678 {
4683 else
4685 }
4686 }
4687 else
4688 /* cpp_interpret_string has issued an error. */
4692 {
4695 }
4698 }
4700 /* Parse a sequence of adjacent string constants. Return a TREE_STRING
4701 representing the combined, nul-terminated string constant. If
4702 TRANSLATE is true, translate the string to the execution character set.
4703 If WIDE_OK is true, a wide string is valid here.
4705 This function issues an error if a user defined string literal is
4706 encountered; use cp_parser_userdef_string_literal if UDLs are allowed. */
4710 {
4714 }
4716 /* Parse a string literal or user defined string literal.
4718 user-defined-string-literal :
4719 string-literal ud-suffix
4721 If LOOKUP_UDLIT, perform a lookup for a suitable template function. */
4725 {
4728 lookup_udlit);
4729 }
4731 /* Look up a literal operator with the name and the exact arguments. */
4733 static tree
4735 {
4741 {
4745 {
4752 {
4762 }
4766 /* May be this should be sufficient_parms_p instead,
4767 depending on how exactly should user-defined literals
4768 work in presence of default arguments on the literal
4769 operator parameters. */
4772 }
4773 }
4776 }
4778 /* Parse a user-defined char constant. Returns a call to a user-defined
4779 literal operator taking the character as an argument. */
4781 static cp_expr
4783 {
4791 /* Build up a call to the user-defined operator */
4792 /* Lookup the name we got back from the id-expression. */
4793 releasing_vec args;
4797 {
4801 }
4804 }
4806 /* A subroutine of cp_parser_userdef_numeric_literal to
4807 create a char... template parameter pack from a string node. */
4809 static tree
4811 {
4812 tree charvec;
4819 /* Fill in CHARVEC with all of the parameters. */
4822 {
4831 }
4833 /* Build the argument packs. */
4839 }
4841 /* A subroutine of cp_parser_userdef_numeric_literal to
4842 create a char... template parameter pack from a string node. */
4844 static tree
4846 {
4847 tree charvec;
4858 /* First template parm is character type. */
4861 /* Fill in CHARVEC with all of the parameters. */
4868 /* Build the argument packs. */
4874 }
4876 /* Parse a user-defined numeric constant. returns a call to a user-defined
4877 literal operator. */
4879 static cp_expr
4881 {
4891 /* Look for a literal operator taking the exact type of numeric argument
4892 as the literal value. */
4893 releasing_vec args;
4897 {
4899 tf_warning_or_error);
4902 {
4905 long_long_unsigned_type_node);
4906 }
4907 else
4908 {
4912 long_double_type_node);
4916 }
4919 }
4921 /* If the numeric argument didn't work, look for a raw literal
4922 operator taking a const char* argument consisting of the number
4923 in string format. */
4928 {
4930 tf_warning_or_error);
4932 }
4934 /* If the raw literal didn't work, look for a non-type template
4935 function with parameter pack char.... Call the function with
4936 template parameter characters representing the number. */
4940 {
4943 {
4945 num_string);
4947 }
4950 tf_warning_or_error);
4952 }
4954 /* In C++14 the standard library defines complex number suffixes that
4955 conflict with GNU extensions. Prefer them if <complex> is #included. */
4965 {
4969 {
4970 /* No <complex>, so pedwarn and use GNU semantics. */
4973 }
4974 }
4976 bool complained
4983 {
4985 "(from %<<complex>%>) to enable the C++14 user-defined literal "
4990 }
4997 else
4998 {
4999 /* Use the built-in semantics. */
5000 tree type;
5002 {
5005 else
5007 }
5015 }
5018 /* Avoid repeated diagnostics. */
5021 }
5023 /* Parse a user-defined string constant. Returns a call to a user-defined
5024 literal operator taking a character pointer and the length of the string
5025 as arguments. */
5027 static tree
5029 {
5035 tree decl;
5037 /* Build up a call to the user-defined operator. */
5038 /* Lookup the name we got back from the id-expression. */
5039 releasing_vec args;
5046 tf_warning_or_error);
5048 /* Look for a suitable template function, either (C++20) with a single
5049 parameter of class type, or (N3599) with typename parameter CharT and
5050 parameter pack CharT... */
5054 {
5055 /* Use resolve_nondeduced_context to try to choose one form of template
5056 or the other. */
5063 else
5064 {
5069 }
5073 tf_warning_or_error);
5074 }
5079 }
5082 /* Basic concepts [gram.basic] */
5084 /* Parse a translation-unit.
5086 translation-unit:
5087 declaration-seq [opt] */
5089 static void
5091 {
5094 /* Create the declarator obstack. */
5096 /* Create the error declarator. */
5098 /* Create the empty parameter list. */
5100 UNKNOWN_LOCATION);
5101 /* Remember where the base of the declarator obstack lies. */
5113 /* Parse until EOF. */
5115 {
5118 /* If we're entering or exiting a region that's implicitly
5119 extern "C", modify the lang context appropriately. This is
5120 so horrible. Please die. */
5123 {
5127 else
5129 }
5135 {
5136 /* Top-level module declarations are ok, and change the
5137 portion of file we're in. Top-level import declarations
5138 are significant for the import portions. */
5143 {
5146 }
5148 {
5149 mp_state
5152 }
5154 {
5159 }
5160 else
5164 {
5167 {
5170 "global module fragment contents must be"
5172 }
5173 }
5174 }
5176 /* This relies on the ordering of module_parse values. */
5178 /* We're no longer in the import portion of a named module. */
5184 {
5187 /* If the next token is now a `;', consume it. */
5190 }
5191 else
5193 }
5195 /* Get rid of the token array; we don't need it any more. */
5199 /* The EOF should have reset this. */
5202 /* Make sure the declarator obstack was fully cleaned up. */
5205 }
5207 /* Return the appropriate tsubst flags for parsing, possibly in N3276
5208 decltype context. */
5212 {
5217 }
5219 /* We're about to parse a collection of statements. If we're currently
5220 parsing tentatively, set up a firewall so that any nested
5221 cp_parser_commit_to_tentative_parse won't affect the current context. */
5223 static cp_token_position
5225 {
5232 }
5234 /* We've finished parsing the collection of statements. Wrap up the
5235 firewall and replace the relevant tokens with the parsed form. */
5237 static void
5239 tree expr)
5240 {
5244 /* Finish the firewall level. */
5246 /* And remember the result of the parse for when we try again. */
5252 }
5254 /* Like the above functions, but let the user modify the tokens. Used by
5255 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
5256 later parses, so it makes sense to localize the effects of
5257 cp_parser_commit_to_tentative_parse. */
5259 struct tentative_firewall
5260 {
5265 {
5266 /* If we're currently parsing tentatively, start a committed level as a
5267 firewall and then an inner tentative parse. */
5269 {
5273 }
5274 }
5277 {
5279 {
5280 /* Finish the inner tentative parse and the firewall, propagating any
5281 uncommitted error state to the outer tentative parse. */
5287 }
5288 }
5289 };
5291 /* Some tokens naturally come in pairs e.g.'(' and ')'.
5292 This class is for tracking such a matching pair of symbols.
5293 In particular, it tracks the location of the first token,
5294 so that if the second token is missing, we can highlight the
5295 location of the first token when notifying the user about the
5296 problem. */
5299 class token_pair
5300 {
5302 /* token_pair's ctor. */
5305 /* If the next token is the opening symbol for this pair, consume it and
5306 return true.
5307 Otherwise, issue an error and return false.
5308 In either case, record the location of the opening token. */
5311 {
5315 }
5317 /* Consume the next token from PARSER, recording its location as
5318 that of the opening token within the pair. */
5321 {
5326 }
5328 /* If the next token is the closing symbol for this pair, consume it
5329 and return it.
5330 Otherwise, issue an error, highlighting the location of the
5331 corresponding opening token, and return NULL. */
5334 {
5337 m_open_loc);
5338 }
5343 location_t m_open_loc;
5344 };
5346 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
5348 struct matching_paren_traits
5349 {
5354 };
5356 /* "matching_parens" is a token_pair<T> class for tracking matching
5357 pairs of parentheses. */
5361 /* Traits for token_pair<T> for tracking matching pairs of braces. */
5363 struct matching_brace_traits
5364 {
5369 };
5371 /* "matching_braces" is a token_pair<T> class for tracking matching
5372 pairs of braces. */
5377 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
5378 enclosing parentheses. */
5380 static cp_expr
5382 {
5385 /* Consume the '('. */
5387 matching_parens parens;
5389 /* Start the statement-expression. */
5391 /* Parse the compound-statement. */
5393 /* Finish up. */
5395 /* Consume the ')'. */
5403 }
5405 /* Expressions [gram.expr] */
5407 /* Parse a fold-operator.
5409 fold-operator:
5410 - * / % ^ & | = < > << >>
5411 = -= *= /= %= ^= &= |= <<= >>=
5412 == != <= >= && || , .* ->*
5414 This returns the tree code corresponding to the matched operator
5415 as an int. When the current token matches a compound assignment
5416 operator, the resulting tree code is the negative value of the
5417 non-assignment operator. */
5419 static int
5421 {
5423 {
5463 }
5464 }
5466 /* Returns true if CODE indicates a binary expression, which is not allowed in
5467 the LHS of a fold-expression. More codes will need to be added to use this
5468 function in other contexts. */
5470 static bool
5472 {
5474 {
5507 }
5508 }
5510 /* If the next token is a suitable fold operator, consume it and return as
5511 the function above. */
5513 static int
5515 {
5521 }
5523 /* Parse a fold-expression.
5525 fold-expression:
5526 ( ... folding-operator cast-expression)
5527 ( cast-expression folding-operator ... )
5528 ( cast-expression folding operator ... folding-operator cast-expression)
5530 Note that the '(' and ')' are matched in primary expression. */
5532 static cp_expr
5534 {
5535 cp_id_kind pidk;
5537 // Left fold.
5539 {
5545 {
5548 }
5555 }
5560 {
5563 }
5566 {
5569 }
5572 /* The operands of a fold-expression are cast-expressions, so binary or
5573 conditional expressions are not allowed. We check this here to avoid
5574 tentative parsing. */
5586 // Right fold.
5591 {
5594 }
5597 // Binary left or right fold.
5602 }
5604 /* Parse a primary-expression.
5606 primary-expression:
5607 literal
5608 this
5609 ( expression )
5610 id-expression
5611 lambda-expression (C++11)
5613 GNU Extensions:
5615 primary-expression:
5616 ( compound-statement )
5617 __builtin_va_arg ( assignment-expression , type-id )
5618 __builtin_offsetof ( type-id , offsetof-expression )
5620 C++ Extensions:
5621 __has_nothrow_assign ( type-id )
5622 __has_nothrow_constructor ( type-id )
5623 __has_nothrow_copy ( type-id )
5624 __has_trivial_assign ( type-id )
5625 __has_trivial_constructor ( type-id )
5626 __has_trivial_copy ( type-id )
5627 __has_trivial_destructor ( type-id )
5628 __has_virtual_destructor ( type-id )
5629 __is_abstract ( type-id )
5630 __is_base_of ( type-id , type-id )
5631 __is_class ( type-id )
5632 __is_empty ( type-id )
5633 __is_enum ( type-id )
5634 __is_final ( type-id )
5635 __is_literal_type ( type-id )
5636 __is_pod ( type-id )
5637 __is_polymorphic ( type-id )
5638 __is_std_layout ( type-id )
5639 __is_trivial ( type-id )
5640 __is_union ( type-id )
5642 Objective-C++ Extension:
5644 primary-expression:
5645 objc-expression
5647 literal:
5648 __null
5650 ADDRESS_P is true iff this expression was immediately preceded by
5651 "&" and therefore might denote a pointer-to-member. CAST_P is true
5652 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5653 true iff this expression is a template argument.
5655 Returns a representation of the expression. Upon return, *IDK
5656 indicates what kind of id-expression (if any) was present. */
5658 static cp_expr
5665 {
5668 /* Assume the primary expression is not an id-expression. */
5671 /* Peek at the next token. */
5674 {
5675 /* literal:
5676 integer-literal
5677 character-literal
5678 floating-literal
5679 string-literal
5680 boolean-literal
5681 pointer-literal
5682 user-defined-literal */
5694 {
5698 }
5699 /* Floating-point literals are only allowed in an integral
5700 constant expression if they are cast to an integral or
5701 enumeration type. */
5707 {
5708 /* CAST_P will be set even in invalid code like "int(2.7 +
5709 ...)". Therefore, we have to check that the next token
5710 is sure to end the cast. */
5712 {
5717 enumerator-definition. */
5719 /* The curly brace at the end of an enum-specifier. */
5721 /* The end of a statement. */
5723 /* The end of the cast-expression. */
5725 /* The end of an array bound. */
5727 /* The closing ">" in a template-argument-list. */
5730 /* C++0x only: A ">>" treated like two ">" tokens,
5731 in a template-argument-list. */
5736 }
5738 /* If we are within a cast, then the constraint that the
5739 cast is to an integral or enumeration type will be
5740 checked at that point. If we are not within a cast, then
5741 this code is invalid. */
5744 }
5765 /* ??? Should wide strings be allowed when parser->translate_strings_p
5766 is false (i.e. in attributes)? If not, we can kill the third
5767 argument to cp_parser_string_literal. */
5772 else
5779 /* If we see `( { ' then we are looking at the beginning of
5780 a GNU statement-expression. */
5783 {
5784 /* Statement-expressions are not allowed by the standard. */
5788 /* And they're not allowed outside of a function-body; you
5789 cannot, for example, write:
5791 int i = ({ int j = 3; j + 1; });
5793 at class or namespace scope. */
5796 {
5798 "statement-expressions are not allowed outside "
5804 }
5805 else
5807 }
5808 /* Otherwise it's a normal parenthesized expression. */
5809 {
5810 cp_expr expr;
5815 /* Consume the `('. */
5816 matching_parens parens;
5818 /* Within a parenthesized expression, a `>' token is always
5819 the greater-than operator. */
5820 saved_greater_than_is_operator_p
5825 /* Left fold expression. */
5827 else
5828 /* Parse the parenthesized expression. */
5833 {
5838 "fold-expressions only available with %<-std=c++17%> "
5840 }
5841 else
5842 /* Let the front end know that this expression was
5843 enclosed in parentheses. This matters in case, for
5844 example, the expression is of the form `A::B', since
5845 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5846 not. */
5849 /* DR 705: Wrapping an unqualified name in parentheses
5850 suppresses arg-dependent lookup. We want to pass back
5851 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5852 (c++/37862), but none of the others. */
5856 /* The `>' token might be the end of a template-id or
5857 template-parameter-list now. */
5858 parser->greater_than_is_operator_p
5861 /* Consume the `)'. */
5873 }
5876 {
5878 {
5879 /* We might have an Objective-C++ message. */
5882 /* If that works out, we're done ... */
5885 /* ... else, fall though to see if it's a lambda. */
5886 }
5888 /* Don't warn about a failed tentative parse. */
5893 }
5897 /* We have an Objective-C++ string literal. */
5904 {
5905 /* These two are the boolean literals. */
5913 /* The `__null' literal. */
5918 /* The `nullptr' literal. */
5923 /* Recognize the `this' keyword. */
5927 {
5931 }
5932 /* Pointers cannot appear in constant-expressions. */
5937 /* The `operator' keyword can be the beginning of an
5938 id-expression. */
5945 {
5946 non_integral_constant name;
5948 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5949 __func__ are the names of variables -- but they are
5950 treated specially. Therefore, they are handled here,
5951 rather than relying on the generic id-expression logic
5952 below. Grammatically, these names are id-expressions.
5954 Consume the token. */
5958 {
5970 }
5975 /* Look up the name. */
5977 }
5980 {
5981 tree expression;
5982 tree type;
5983 location_t type_location;
5984 location_t start_loc
5986 /* The `__builtin_va_arg' construct is used to handle
5987 `va_arg'. Consume the `__builtin_va_arg' token. */
5989 /* Look for the opening `('. */
5990 matching_parens parens;
5992 /* Now, parse the assignment-expression. */
5994 /* Look for the `,'. */
5997 /* Parse the type-id. */
5998 {
6001 }
6002 /* Look for the closing `)'. */
6003 location_t finish_loc
6006 /* Using `va_arg' in a constant-expression is not
6007 allowed. */
6009 NIC_VA_ARG))
6011 /* Construct a location of the form:
6012 __builtin_va_arg (v, int)
6013 ~~~~~~~~~~~~~~~~~~~~~^~~~
6014 with the caret at the type, ranging from the start of the
6015 "__builtin_va_arg" token to the close paren. */
6016 location_t combined_loc
6019 }
6024 #define DEFTRAIT_EXPR(CODE, NAME, ARITY) \
6025 case RID_##CODE:
6027 #undef DEFTRAIT_EXPR
6030 // C++ concepts
6034 /* Objective-C++ expressions. */
6044 "%<omp_all_memory%> may only be used in OpenMP "
6052 {
6057 }
6058 /* FALLTHRU */
6062 }
6064 /* An id-expression can start with either an identifier, a
6065 `::' as the beginning of a qualified-id, or the "operator"
6066 keyword. */
6071 {
6072 id_expression:
6073 cp_expr id_expression;
6074 cp_expr decl;
6080 /* Parse the id-expression. */
6081 id_expression
6098 /* If we have a template-id, then no further lookup is
6099 required. If the template-id was for a template-class, we
6100 will sometimes have a TYPE_DECL at this point. */
6104 /* Look up the name. */
6105 else
6106 {
6107 tree ambiguous_decls;
6109 /* If we already know that this lookup is ambiguous, then
6110 we've already issued an error message; there's no reason
6111 to check again. */
6114 {
6117 }
6120 none_type,
6121 template_p,
6126 /* If the lookup was ambiguous, an error will already have
6127 been issued. */
6131 /* In Objective-C++, we may have an Objective-C 2.0
6132 dot-syntax for classes here. */
6137 {
6138 tree component;
6145 component);
6146 /* Build a location of the form:
6147 expr.component
6148 ~~~~~^~~~~~~~~
6149 with caret at the start of the component name (at
6150 input_location), ranging from the start of the id_expression
6151 to the end of the component name. */
6152 location_t combined_loc
6157 }
6159 /* In Objective-C++, an instance variable (ivar) may be preferred
6160 to whatever cp_parser_lookup_name() found.
6161 Call objc_lookup_ivar. To avoid exposing cp_expr to the
6162 rest of c-family, we have to do a little extra work to preserve
6163 any location information in cp_expr "decl". Given that
6164 objc_lookup_ivar is implemented in "c-family" and "objc", we
6165 have a trip through the pure "tree" type, rather than cp_expr.
6166 Naively copying it back to "decl" would implicitly give the
6167 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
6168 store an EXPR_LOCATION. Hence we only update "decl" (and
6169 hence its location_t) if we get back a different tree node. */
6171 id_expression);
6175 /* If name lookup gives us a SCOPE_REF, then the
6176 qualifying scope was dependent. */
6178 {
6179 /* At this point, we do not know if DECL is a valid
6180 integral constant expression. We assume that it is
6181 in fact such an expression, so that code like:
6183 template <int N> struct A {
6184 int a[B<N>::i];
6185 };
6187 is accepted. At template-instantiation time, we
6188 will check that B<N>::i is actually a constant. */
6190 }
6191 /* Check to see if DECL is a local variable in a context
6192 where that is forbidden. */
6195 /* DR 2082 permits local variables in unevaluated contexts
6196 within a default argument. */
6198 {
6206 }
6207 }
6209 decl = (finish_id_expression
6211 idk,
6216 template_arg_p,
6221 /* Build a location for an id-expression of the form:
6222 ::ns::id
6223 ~~~~~~^~
6224 or:
6225 id
6226 ^~
6227 i.e. from the start of the first token to the end of the final
6228 token, with the caret at the start of the unqualified-id. */
6232 location_t combined_loc
6237 }
6239 /* Anything else is an error. */
6243 }
6244 }
6252 {
6255 }
6257 /* Complain about missing template keyword when naming a dependent
6258 member template. */
6260 static void
6262 {
6269 "expected %qs keyword before dependent "
6272 }
6274 /* Parse an id-expression.
6276 id-expression:
6277 unqualified-id
6278 qualified-id
6280 qualified-id:
6281 :: [opt] nested-name-specifier template [opt] unqualified-id
6282 :: identifier
6283 :: operator-function-id
6284 :: template-id
6286 Return a representation of the unqualified portion of the
6287 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
6288 a `::' or nested-name-specifier.
6290 Often, if the id-expression was a qualified-id, the caller will
6291 want to make a SCOPE_REF to represent the qualified-id. This
6292 function does not do this in order to avoid wastefully creating
6293 SCOPE_REFs when they are not required.
6295 If TEMPLATE_KEYWORD_P is true, then we have just seen the
6296 `template' keyword.
6298 If CHECK_DEPENDENCY_P is false, then names are looked up inside
6299 uninstantiated templates.
6301 If *TEMPLATE_P is non-NULL, it is set to true iff the
6302 `template' keyword is used to explicitly indicate that the entity
6303 named is a template.
6305 If DECLARATOR_P is true, the id-expression is appearing as part of
6306 a declarator, rather than as part of an expression. */
6308 static cp_expr
6315 {
6319 /* Assume the `template' keyword was not used. */
6323 /* Look for the optional `::' operator. */
6324 global_scope_p
6325 = (!template_keyword_p
6330 /* Look for the optional nested-name-specifier. */
6331 nested_name_specifier_p
6334 check_dependency_p,
6336 declarator_p,
6337 template_keyword_p)
6343 /* Peek at the next token. */
6346 /* If there is a nested-name-specifier, then we are looking at
6347 the first qualified-id production. */
6349 {
6350 tree saved_object_scope;
6351 tree saved_qualifying_scope;
6353 /* See if the next token is the `template' keyword. */
6357 /* Name lookup we do during the processing of the
6358 unqualified-id might obliterate SCOPE. */
6361 /* Process the final unqualified-id. */
6363 check_dependency_p,
6364 declarator_p,
6366 /* Restore the SAVED_SCOPE for our caller. */
6370 }
6371 /* Otherwise, if we are in global scope, then we are looking at one
6372 of the other qualified-id productions. */
6374 {
6375 /* If it's an identifier, and the next token is not a "<", then
6376 we can avoid the template-id case. This is an optimization
6377 for this common case. */
6379 && !cp_parser_nth_token_starts_template_argument_list_p
6384 /* Try a template-id. */
6388 declarator_p);
6389 /* If that worked, we're done. */
6393 /* Peek at the next token. (Changes in the token buffer may
6394 have invalidated the pointer obtained above.) */
6398 {
6405 {
6408 }
6409 /* Fall through. */
6414 }
6415 }
6416 else
6417 {
6422 declarator_p,
6423 optional_p);
6424 }
6427 && warn_missing_template_keyword
6428 && !template_keyword_p
6429 /* Don't warn if we're looking inside templates. */
6430 && check_dependency_p
6431 /* In a template argument list a > could be closing
6432 the enclosing targs. */
6435 /* Don't confuse an ill-formed constructor declarator for a missing
6436 template keyword in a return type. */
6440 OPT_Wmissing_template_keyword))
6441 {
6444 /* An operator after the > suggests that the > ends a
6445 template-id; a name or literal suggests that the > is an
6446 operator. */
6450 }
6453 }
6455 /* Parse an unqualified-id.
6457 unqualified-id:
6458 identifier
6459 operator-function-id
6460 conversion-function-id
6461 ~ class-name
6462 template-id
6464 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
6465 keyword, in a construct like `A::template ...'.
6467 Returns a representation of unqualified-id. For the `identifier'
6468 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
6469 production a BIT_NOT_EXPR is returned; the operand of the
6470 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
6471 other productions, see the documentation accompanying the
6472 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
6473 names are looked up in uninstantiated templates. If DECLARATOR_P
6474 is true, the unqualified-id is appearing as part of a declarator,
6475 rather than as part of an expression. */
6477 static cp_expr
6483 {
6486 /* Peek at the next token. */
6490 {
6492 {
6493 tree id;
6495 /* We don't know yet whether or not this will be a
6496 template-id. */
6498 /* Try a template-id. */
6500 check_dependency_p,
6501 declarator_p);
6502 /* If it worked, we're done. */
6505 /* Otherwise, it's an ordinary identifier. */
6507 }
6511 check_dependency_p,
6512 declarator_p);
6515 {
6516 tree type_decl;
6517 tree qualifying_scope;
6518 tree object_scope;
6519 tree scope;
6523 /* Consume the `~' token. */
6525 /* Parse the class-name. The standard, as written, seems to
6526 say that:
6528 template <typename T> struct S { ~S (); };
6529 template <typename T> S<T>::~S() {}
6531 is invalid, since `~' must be followed by a class-name, but
6532 `S<T>' is dependent, and so not known to be a class.
6533 That's not right; we need to look in uninstantiated
6534 templates. A further complication arises from:
6536 template <typename T> void f(T t) {
6537 t.T::~T();
6538 }
6540 Here, it is not possible to look up `T' in the scope of `T'
6541 itself. We must look in both the current scope, and the
6542 scope of the containing complete expression.
6544 Yet another issue is:
6546 struct S {
6547 int S;
6548 ~S();
6549 };
6551 S::~S() {}
6553 The standard does not seem to say that the `S' in `~S'
6554 should refer to the type `S' and not the data member
6555 `S::S'. */
6557 /* DR 244 says that we look up the name after the "~" in the
6558 same scope as we looked up the qualifying name. That idea
6559 isn't fully worked out; it's more complicated than that. */
6564 /* Check for invalid scopes. */
6566 {
6570 }
6572 {
6576 scope);
6581 }
6583 {
6589 }
6595 /* Create a location with caret == start at the tilde,
6596 finishing at the end of the peeked token, e.g:
6597 ~token
6598 ^~~~~~. */
6599 location_t loc
6602 /* If the name is of the form "X::~X" it's OK even if X is a
6603 typedef. */
6612 {
6615 }
6617 /* ~auto means the destructor of whatever the object is. */
6619 {
6622 "%<~auto%> only available with "
6626 }
6628 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
6629 declarator-id of a constructor or destructor. */
6632 {
6636 }
6638 /* If there was an explicit qualification (S::~T), first look
6639 in the scope given by the qualification (i.e., S).
6641 Note: in the calls to cp_parser_class_name below we pass
6642 typename_type so that lookup finds the injected-class-name
6643 rather than the constructor. */
6647 {
6652 typename_type,
6655 declarator_p);
6658 }
6659 /* In "N::S::~S", look in "N" as well. */
6661 {
6666 type_decl
6670 typename_type,
6673 declarator_p);
6676 }
6677 /* In "p->S::~T", look in the scope given by "*p" as well. */
6679 {
6684 type_decl
6688 typename_type,
6691 declarator_p);
6694 }
6695 /* Look in the surrounding context. */
6697 {
6703 type_decl
6707 typename_type,
6710 declarator_p);
6713 {
6714 /* We couldn't find a type with this name. If we're parsing
6715 tentatively, fail and try something else. */
6717 {
6720 }
6721 /* Otherwise, accept it and check for a match at instantiation
6722 time. */
6727 }
6728 }
6729 /* If an error occurred, assume that the name of the
6730 destructor is the same as the name of the qualifying
6731 class. That allows us to keep parsing after running
6732 into ill-formed destructor names. */
6738 /* Check that destructor name and scope match. */
6740 {
6747 }
6749 /* [class.dtor]
6751 A typedef-name that names a class shall not be used as the
6752 identifier in the declarator for a destructor declaration. */
6759 type_decl);
6762 }
6766 {
6767 cp_expr id;
6769 /* This could be a template-id, so we try that first. */
6771 /* Try a template-id. */
6774 declarator_p);
6775 /* If that worked, we're done. */
6778 /* We still don't know whether we're looking at an
6779 operator-function-id or a conversion-function-id. */
6781 /* Try an operator-function-id. */
6783 /* If that didn't work, try a conversion-function-id. */
6788 }
6789 /* Fall through. */
6796 }
6797 }
6799 /* Check [temp.names]/5: A name prefixed by the keyword template shall
6800 be a template-id or the name shall refer to a class template or an
6801 alias template. */
6803 static void
6805 {
6815 /* Alias templates are also OK. */
6822 name);
6823 }
6825 /* Parse an (optional) nested-name-specifier.
6827 nested-name-specifier: [C++98]
6828 class-or-namespace-name :: nested-name-specifier [opt]
6829 class-or-namespace-name :: template nested-name-specifier [opt]
6831 nested-name-specifier: [C++0x]
6832 type-name ::
6833 namespace-name ::
6834 nested-name-specifier identifier ::
6835 nested-name-specifier template [opt] simple-template-id ::
6837 PARSER->SCOPE should be set appropriately before this function is
6838 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6839 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6840 in name lookups.
6842 Sets PARSER->SCOPE to the class (TYPE) or namespace
6843 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6844 it unchanged if there is no nested-name-specifier. Returns the new
6845 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6847 If CHECK_DEPENDENCY_P is FALSE, names are looked up in dependent scopes.
6849 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6850 part of a declaration and/or decl-specifier. */
6852 static tree
6859 {
6864 /* Remember where the nested-name-specifier starts. */
6867 {
6870 }
6873 {
6874 tree new_scope;
6875 tree old_scope;
6876 tree saved_qualifying_scope;
6878 /* Spot cases that cannot be the beginning of a
6879 nested-name-specifier. */
6882 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6883 the already parsed nested-name-specifier. */
6885 {
6886 /* Grab the nested-name-specifier and continue the loop. */
6888 /* If we originally encountered this nested-name-specifier
6889 with CHECK_DEPENDENCY_P set to true, we will not have
6890 resolved TYPENAME_TYPEs, so we must do so here. */
6892 && !check_dependency_p
6894 {
6899 }
6902 }
6904 /* Spot cases that cannot be the beginning of a
6905 nested-name-specifier. On the second and subsequent times
6906 through the loop, we look for the `template' keyword. */
6908 ;
6909 /* A template-id can start a nested-name-specifier. */
6911 ;
6912 /* DR 743: decltype can be used in a nested-name-specifier. */
6914 ;
6915 else
6916 {
6917 /* If the next token is not an identifier, then it is
6918 definitely not a type-name or namespace-name. */
6921 /* If the following token is neither a `<' (to begin a
6922 template-id), nor a `::', then we are not looking at a
6923 nested-name-specifier. */
6929 /* name:name is a valid sequence in an Objective C message. */
6931 {
6935 "found %<:%> in nested-name-specifier, "
6938 }
6941 && !cp_parser_nth_token_starts_template_argument_list_p
6944 }
6946 /* The nested-name-specifier is optional, so we parse
6947 tentatively. */
6950 /* Look for the optional `template' keyword, if this isn't the
6951 first time through the loop. */
6953 {
6955 /* DR1710: "In a qualified-id used as the name in
6956 a typename-specifier, elaborated-type-specifier, using-declaration,
6957 or class-or-decltype, an optional keyword template appearing at
6958 the top level is ignored." */
6960 && typename_keyword_p
6963 }
6965 /* Save the old scope since the name lookup we are about to do
6966 might destroy it. */
6969 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6970 look up names in "X<T>::I" in order to determine that "Y" is
6971 a template. So, if we have a typename at this point, we make
6972 an effort to look through it. */
6974 && !check_dependency_p
6975 && !typename_keyword_p
6980 /* Parse the qualifying entity. */
6981 new_scope
6983 typename_keyword_p,
6984 template_keyword_p,
6985 check_dependency_p,
6986 type_p,
6987 is_declaration);
6988 /* Look for the `::' token. */
6991 /* If we found what we wanted, we keep going; otherwise, we're
6992 done. */
6994 {
6997 /* Restore the OLD_SCOPE since it was valid before the
6998 failed attempt at finding the last
6999 class-or-namespace-name. */
7003 /* If the next token is a decltype, and the one after that is a
7004 `::', then the decltype has failed to resolve to a class or
7005 enumeration type. Give this error even when parsing
7006 tentatively since it can't possibly be valid--and we're going
7007 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
7008 won't get another chance.*/
7012 {
7018 dtype);
7021 /* As below. */
7024 }
7028 {
7029 /* If we have a non-type template-id followed by ::, it can't
7030 possibly be valid. */
7035 {
7038 {
7045 else
7048 }
7049 else
7050 {
7056 else
7057 {
7058 /* Variable template. */
7062 }
7063 }
7070 /* As below. */
7074 }
7075 }
7079 /* If the next token is an identifier, and the one after
7080 that is a `::', then any valid interpretation would have
7081 found a class-or-namespace-name. */
7087 {
7090 {
7092 {
7093 tree decl;
7094 tree ambiguous_decls;
7097 none_type,
7106 decl);
7108 {
7109 // cp_parser_lookup_name has the same diagnostic,
7110 // thus make sure to emit it at most once.
7113 {
7118 }
7120 }
7121 else
7122 {
7124 cp_parser_name_lookup_error
7127 else
7128 cp_parser_name_lookup_error
7131 }
7132 }
7135 /* Treat this as a successful nested-name-specifier
7136 due to:
7138 [basic.lookup.qual]
7140 If the name found is not a class-name (clause
7141 _class_) or namespace-name (_namespace.def_), the
7142 program is ill-formed. */
7144 }
7146 }
7148 }
7149 /* We've found one valid nested-name-specifier. */
7151 /* Name lookup always gives us a DECL. */
7154 /* Uses of "template" must be followed by actual templates. */
7157 /* If it is a class scope, try to complete it; we are about to
7158 be looking up names inside the class. */
7160 /* Since checking types for dependency can be expensive,
7161 avoid doing it if the type is already complete. */
7163 /* Do not try to complete dependent types. */
7165 {
7167 /* If it is a typedef to current class, use the current
7168 class instead, as the typedef won't have any names inside
7169 it yet. */
7173 }
7174 /* Make sure we look in the right scope the next time through
7175 the loop. */
7177 }
7179 /* If parsing tentatively, replace the sequence of tokens that makes
7180 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
7181 token. That way, should we re-parse the token stream, we will
7182 not have to repeat the effort required to do the parse, nor will
7183 we issue duplicate error messages. */
7185 {
7189 /* Reset the contents of the START token. */
7191 /* Retrieve any deferred checks. Do not pop this access checks yet
7192 so the memory will not be reclaimed during token replacing below. */
7201 /* Purge all subsequent tokens. */
7203 }
7209 }
7211 /* Parse a nested-name-specifier. See
7212 cp_parser_nested_name_specifier_opt for details. This function
7213 behaves identically, except that it will an issue an error if no
7214 nested-name-specifier is present. */
7216 static tree
7222 {
7223 tree scope;
7225 /* Look for the nested-name-specifier. */
7227 typename_keyword_p,
7228 check_dependency_p,
7229 type_p,
7230 is_declaration);
7231 /* If it was not present, issue an error message. */
7233 {
7236 }
7239 }
7241 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
7242 this is either a class-name or a namespace-name (which corresponds
7243 to the class-or-namespace-name production in the grammar). For
7244 C++0x, it can also be a type-name that refers to an enumeration
7245 type or a simple-template-id.
7247 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
7248 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
7249 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
7250 TYPE_P is TRUE iff the next name should be taken as a class-name,
7251 even the same name is declared to be another entity in the same
7252 scope.
7254 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
7255 specified by the class-or-namespace-name. If neither is found the
7256 ERROR_MARK_NODE is returned. */
7258 static tree
7265 {
7266 tree saved_scope;
7267 tree saved_qualifying_scope;
7268 tree saved_object_scope;
7269 tree scope;
7273 /* DR 743: decltype can appear in a nested-name-specifier. */
7275 {
7279 {
7282 }
7286 }
7288 /* Before we try to parse the class-name, we must save away the
7289 current PARSER->SCOPE since cp_parser_class_name will destroy
7290 it. */
7294 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
7295 there is no need to look for a namespace-name. */
7296 only_class_p = template_keyword_p
7301 typename_keyword_p,
7302 template_keyword_p,
7304 check_dependency_p,
7306 is_declaration,
7309 /* If that didn't work, try for a namespace-name. */
7311 {
7312 /* Restore the saved scope. */
7316 /* If we are not looking at an identifier followed by the scope
7317 resolution operator, then this is not part of a
7318 nested-name-specifier. (Note that this function is only used
7319 to parse the components of a nested-name-specifier.) */
7324 }
7327 }
7329 /* Return true if we are looking at a compound-literal, false otherwise. */
7331 static bool
7333 {
7336 /* Skip tokens until the next token is a closing parenthesis.
7337 If we find the closing `)', and the next token is a `{', then
7338 we are looking at a compound-literal. */
7339 bool compound_literal_p
7344 /* Roll back the tokens we skipped. */
7348 }
7350 /* Return true if EXPR is the integer constant zero or a complex constant
7351 of zero, without any folding, but ignoring location wrappers. */
7353 bool
7355 {
7358 }
7360 /* Parse a postfix-expression.
7362 postfix-expression:
7363 primary-expression
7364 postfix-expression [ expression ]
7365 postfix-expression ( expression-list [opt] )
7366 simple-type-specifier ( expression-list [opt] )
7367 typename :: [opt] nested-name-specifier identifier
7368 ( expression-list [opt] )
7369 typename :: [opt] nested-name-specifier template [opt] template-id
7370 ( expression-list [opt] )
7371 postfix-expression . template [opt] id-expression
7372 postfix-expression -> template [opt] id-expression
7373 postfix-expression . pseudo-destructor-name
7374 postfix-expression -> pseudo-destructor-name
7375 postfix-expression ++
7376 postfix-expression --
7377 dynamic_cast < type-id > ( expression )
7378 static_cast < type-id > ( expression )
7379 reinterpret_cast < type-id > ( expression )
7380 const_cast < type-id > ( expression )
7381 typeid ( expression )
7382 typeid ( type-id )
7384 GNU Extension:
7386 postfix-expression:
7387 ( type-id ) { initializer-list , [opt] }
7389 This extension is a GNU version of the C99 compound-literal
7390 construct. (The C99 grammar uses `type-name' instead of `type-id',
7391 but they are essentially the same concept.)
7393 If ADDRESS_P is true, the postfix expression is the operand of the
7394 `&' operator. CAST_P is true if this expression is the target of a
7395 cast.
7397 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
7398 class member access expressions [expr.ref].
7400 Returns a representation of the expression. */
7402 static cp_expr
7406 {
7408 location_t loc;
7414 /* Peek at the next token. */
7419 /* Some of the productions are determined by keywords. */
7422 {
7427 {
7428 tree type;
7429 cp_expr expression;
7433 /* All of these can be handled in the same way from the point
7434 of view of parsing. Begin by consuming the token
7435 identifying the cast. */
7438 /* New types cannot be defined in the cast. */
7440 parser->type_definition_forbidden_message
7443 /* Look for the opening `<'. */
7445 /* Parse the type to which we are casting. */
7449 NULL);
7451 /* Look for the closing `>'. */
7453 /* Restore the old message. */
7456 bool saved_greater_than_is_operator_p
7460 /* And the expression which is being cast. */
7461 matching_parens parens;
7465 RT_CLOSE_PAREN);
7469 parser->greater_than_is_operator_p
7472 /* Only type conversions to integral or enumeration types
7473 can be used in constant-expressions. */
7476 {
7479 }
7481 /* Construct a location e.g. :
7482 reinterpret_cast <int *> (expr)
7483 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
7484 ranging from the start of the "*_cast" token to the final closing
7485 paren, with the caret at the start. */
7489 {
7491 postfix_expression
7493 tf_warning_or_error);
7496 postfix_expression
7498 tf_warning_or_error);
7501 postfix_expression
7503 tf_warning_or_error);
7506 postfix_expression
7508 tf_warning_or_error);
7512 }
7513 }
7517 {
7518 tree type;
7522 /* Consume the `typeid' token. */
7524 /* Look for the `(' token. */
7525 matching_parens parens;
7527 /* Types cannot be defined in a `typeid' expression. */
7529 parser->type_definition_forbidden_message
7531 /* We can't be sure yet whether we're looking at a type-id or an
7532 expression. */
7534 /* Try a type-id first. */
7539 /* Look for the `)' token. Otherwise, we can't be sure that
7540 we're not looking at an expression: consider `typeid (int
7541 (3))', for example. */
7543 /* If all went well, simply lookup the type-id. */
7546 /* Otherwise, fall back to the expression variant. */
7547 else
7548 {
7549 tree expression;
7551 /* Look for an expression. */
7553 /* Compute its typeid. */
7555 /* Look for the `)' token. */
7557 }
7558 /* Restore the saved message. */
7560 /* `typeid' may not appear in an integral constant expression. */
7564 /* Construct a location e.g. :
7565 typeid (expr)
7566 ^~~~~~~~~~~~~
7567 ranging from the start of the "typeid" token to the final closing
7568 paren, with the caret at the start. */
7570 {
7571 location_t typeid_loc
7575 }
7576 }
7580 {
7581 tree type;
7582 /* The syntax permitted here is the same permitted for an
7583 elaborated-type-specifier. */
7590 }
7598 {
7606 {
7609 }
7615 {
7618 postfix_expression
7620 else
7621 {
7625 }
7631 tf_warning_or_error);
7632 else
7633 {
7637 }
7645 else
7646 {
7650 }
7655 postfix_expression
7659 postfix_expression
7662 else
7663 {
7667 }
7672 {
7676 }
7677 else
7678 {
7679 postfix_expression
7681 }
7686 }
7688 }
7691 {
7692 tree expression;
7693 tree type;
7694 /* Consume the `__builtin_convertvector' token. */
7696 /* Look for the opening `('. */
7697 matching_parens parens;
7699 /* Now, parse the assignment-expression. */
7701 /* Look for the `,'. */
7703 location_t type_location
7705 /* Parse the type-id. */
7706 {
7709 }
7710 /* Look for the closing `)'. */
7712 postfix_expression
7714 tf_warning_or_error);
7716 }
7719 {
7720 tree expression;
7721 tree type;
7722 /* Consume the `__builtin_bit_cast' token. */
7724 /* Look for the opening `('. */
7725 matching_parens parens;
7727 location_t type_location
7729 /* Parse the type-id. */
7730 {
7733 }
7734 /* Look for the `,'. */
7736 /* Now, parse the assignment-expression. */
7738 /* Look for the closing `)'. */
7740 postfix_expression
7742 tf_warning_or_error);
7744 }
7747 {
7748 tree type;
7750 /* If the next thing is a simple-type-specifier, we may be
7751 looking at a functional cast. We could also be looking at
7752 an id-expression. So, we try the functional cast, and if
7753 that doesn't work we fall back to the primary-expression. */
7755 /* Look for the simple-type-specifier. */
7759 CP_PARSER_FLAGS_NONE);
7761 /* Parse the cast itself. */
7763 postfix_expression
7765 /* If that worked, we're done. */
7769 /* If the functional-cast didn't work out, try a
7770 compound-literal. */
7773 {
7778 matching_parens parens;
7781 /* Avoid calling cp_parser_type_id pointlessly, see comment
7782 in cp_parser_cast_expression about c++/29234. */
7785 else
7786 {
7787 /* Parse the type. */
7793 }
7795 /* If things aren't going well, there's no need to
7796 keep going. */
7798 /* Parse the brace-enclosed initializer list. */
7800 /* If that worked, we're definitely looking at a
7801 compound-literal expression. */
7803 {
7804 /* Warn the user that a compound literal is not
7805 allowed in standard C++. */
7808 /* For simplicity, we disallow compound literals in
7809 constant-expressions. We could
7810 allow compound literals of integer type, whose
7811 initializer was a constant, in constant
7812 expressions. Permitting that usage, as a further
7813 extension, would not change the meaning of any
7814 currently accepted programs. (Of course, as
7815 compound literals are not part of ISO C++, the
7816 standard has nothing to say.) */
7818 NIC_NCC))
7819 {
7822 }
7823 /* Form the representation of the compound-literal. */
7824 postfix_expression
7829 }
7830 }
7832 /* It must be a primary-expression. */
7833 postfix_expression
7836 decltype_p,
7838 }
7840 }
7842 /* Note that we don't need to worry about calling build_cplus_new on a
7843 class-valued CALL_EXPR in decltype when it isn't the end of the
7844 postfix-expression; unary_complex_lvalue will take care of that for
7845 all these cases. */
7847 /* Keep looping until the postfix-expression is complete. */
7849 {
7853 /* It is not a Koenig lookup function call. */
7854 postfix_expression
7857 /* Peek at the next token. */
7861 {
7864 {
7866 "two consecutive %<[%> shall "
7869 }
7870 postfix_expression
7872 postfix_expression,
7874 decltype_p);
7883 /* postfix-expression ( expression-list [opt] ) */
7884 {
7896 tree stripped_expression
7898 is_builtin_constant_p
7901 {
7902 /* The whole point of __builtin_constant_p is to allow
7903 non-constant expressions to appear as arguments. */
7904 saved_integral_constant_expression_p
7906 saved_non_integral_constant_expression_p
7909 }
7912 BUILT_IN_CLASSIFY_TYPE))
7913 {
7914 /* __builtin_classify_type (type) */
7921 NULL);
7924 cp_unevaluated uev;
7926 matching_parens parens;
7931 {
7933 {
7941 }
7942 else
7943 {
7944 postfix_expression
7947 }
7949 }
7950 }
7951 args = (cp_parser_parenthesized_expression_list
7958 {
7959 parser->integral_constant_expression_p
7961 parser->non_integral_constant_expression_p
7963 }
7966 {
7969 }
7971 /* Function calls are not permitted in
7972 constant-expressions. */
7975 NIC_FUNC_CALL))
7976 {
7980 }
7985 {
7987 /* In C++20, we may need to perform ADL for a template
7988 name. */
7991 {
7993 {
7996 postfix_expression
7998 complain);
7999 }
8000 else
8001 postfix_expression
8003 }
8004 /* We do not perform argument-dependent lookup if
8005 normal lookup finds a non-function, in accordance
8006 with the expected resolution of DR 218. */
8009 {
8010 /* Do not do argument dependent lookup if regular
8011 lookup finds a member function or a block-scope
8012 function declaration. [basic.lookup.argdep]/3 */
8016 {
8022 {
8025 }
8026 }
8029 {
8032 postfix_expression
8034 complain);
8035 }
8036 }
8037 }
8039 /* Temporarily set input_location to the combined location
8040 with call expression range, as e.g. build_out_target_exprs
8041 called from convert_default_arg relies on input_location,
8042 so updating it only when the call is fully built results
8043 in inconsistencies between location handling in templates
8044 and outside of templates. */
8047 close_paren_loc);
8051 {
8061 {
8063 postfix_expression
8065 }
8067 {
8068 postfix_expression
8069 = (build_new_method_call
8075 complain));
8076 }
8077 else
8078 postfix_expression
8082 complain);
8083 }
8087 postfix_expression = (build_offset_ref_call_from_tree
8089 complain));
8091 /* A call to a static class member, or a namespace-scope
8092 function. */
8093 postfix_expression
8096 koenig_p,
8097 complain);
8098 else
8099 /* All other function calls. */
8100 {
8105 {
8109 }
8110 postfix_expression
8113 koenig_p,
8114 complain);
8115 }
8119 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
8123 }
8128 /* postfix-expression . template [opt] id-expression
8129 postfix-expression . pseudo-destructor-name
8130 postfix-expression -> template [opt] id-expression
8131 postfix-expression -> pseudo-destructor-name */
8133 /* Consume the `.' or `->' operator. */
8136 postfix_expression
8138 postfix_expression,
8145 /* postfix-expression ++ */
8146 /* Consume the `++' token. */
8148 /* Generate a representation for the complete expression. */
8149 postfix_expression
8151 POSTINCREMENT_EXPR);
8152 /* Increments may not appear in constant-expressions. */
8160 /* postfix-expression -- */
8161 /* Consume the `--' token. */
8163 /* Generate a representation for the complete expression. */
8164 postfix_expression
8166 POSTDECREMENT_EXPR);
8167 /* Decrements may not appear in constant-expressions. */
8178 return is_member_access
8179 ? postfix_expression
8181 else
8183 }
8184 }
8185 }
8187 /* Helper function for cp_parser_parenthesized_expression_list and
8188 cp_parser_postfix_open_square_expression. Parse a single element
8189 of parenthesized expression list. */
8191 static cp_expr
8195 {
8199 /* Parse the next assignment-expression. */
8201 {
8202 /* A braced-init-list. */
8207 ? &expr_non_constant_p
8211 }
8213 {
8219 }
8220 else
8223 /* If we have an ellipsis, then this is an expression expansion. */
8226 {
8227 /* Consume the `...'. */
8230 /* Build the argument pack. */
8232 }
8234 }
8236 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8237 by cp_parser_builtin_offsetof. We're looking for
8239 postfix-expression [ expression ]
8240 postfix-expression [ braced-init-list ] (C++11)
8241 postfix-expression [ expression-list[opt] ] (C++23)
8243 FOR_OFFSETOF is set if we're being called in that context, which
8244 changes how we deal with integer constant expressions. */
8246 static tree
8248 tree postfix_expression,
8251 {
8257 /* Consume the `[' token. */
8263 /* Parse the index expression. */
8264 /* ??? For offsetof, there is a question of what to allow here. If
8265 offsetof is not being used in an integral constant expression context,
8266 then we *could* get the right answer by computing the value at runtime.
8267 If we are in an integral constant expression context, then we might
8268 could accept any constant expression; hard to say without analysis.
8269 Rather than open the barn door too wide right away, allow only integer
8270 constant expressions here. */
8273 else
8274 {
8279 {
8281 {
8282 cp_expr expr
8284 /*cast_p=*/
8286 /*allow_exp_p=*/
8288 /*non_cst_p=*/
8289 NULL);
8296 else
8299 /* If the next token isn't a `,', then we are done. */
8304 {
8307 }
8309 /* Otherwise, consume the `,' and keep going. */
8311 }
8314 }
8316 {
8320 }
8321 else
8325 }
8329 /* Look for the closing `]'. */
8332 /* Build the ARRAY_REF. */
8335 tf_warning_or_error
8338 /* When not doing offsetof, array references are not permitted in
8339 constant-expressions. */
8345 }
8347 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
8348 dereference of incomplete type, returns true if error_mark_node should
8349 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
8350 and *DEPENDENT_P. */
8352 bool
8355 {
8356 /* In a template, be permissive by treating an object expression
8357 of incomplete type as dependent (after a pedwarn). */
8358 diagnostic_t kind = (processing_template_decl
8362 {
8374 /* Don't emit any diagnostic for OVERLOADs. */
8378 /* Avoid clobbering e.g. DECLs. */
8382 }
8394 {
8397 }
8399 }
8401 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8402 by cp_parser_builtin_offsetof. We're looking for
8404 postfix-expression . template [opt] id-expression
8405 postfix-expression . pseudo-destructor-name
8406 postfix-expression -> template [opt] id-expression
8407 postfix-expression -> pseudo-destructor-name
8409 FOR_OFFSETOF is set if we're being called in that context. That sorta
8410 limits what of the above we'll actually accept, but nevermind.
8411 TOKEN_TYPE is the "." or "->" token, which will already have been
8412 removed from the stream. */
8414 static tree
8417 cp_expr postfix_expression,
8419 location_t location)
8420 {
8421 tree name;
8427 /* If this is a `->' operator, dereference the pointer. */
8430 tf_warning_or_error);
8431 /* Check to see whether or not the expression is type-dependent and
8432 not the current instantiation. */
8434 /* The identifier following the `->' or `.' is not qualified. */
8440 /* Enter the scope corresponding to the type of the object
8441 given by the POSTFIX_EXPRESSION. */
8443 {
8445 /* According to the standard, no expression should ever have
8446 reference type. Unfortunately, we do not currently match
8447 the standard in this respect in that our internal representation
8448 of an expression may have reference type even when the standard
8449 says it does not. Therefore, we have to manually obtain the
8450 underlying type here. */
8452 /* The type of the POSTFIX_EXPRESSION must be complete. */
8453 /* Unlike the object expression in other contexts, *this is not
8454 required to be of complete type for purposes of class member
8455 access (5.2.5) outside the member function body. */
8459 {
8465 }
8468 {
8469 /* Let the name lookup machinery know that we are processing a
8470 class member access expression. */
8472 /* If something went wrong, we want to be able to discern that case,
8473 as opposed to the case where there was no SCOPE due to the type
8474 of expression being dependent. */
8477 /* If the SCOPE was erroneous, make the various semantic analysis
8478 functions exit quickly -- and without issuing additional error
8479 messages. */
8482 }
8483 }
8486 {
8488 /* If we don't have a (type-dependent) object of class type, use
8489 typeof to figure out the type of the object. */
8493 }
8495 /* Assume this expression is not a pseudo-destructor access. */
8498 /* If the SCOPE is a scalar type, then, if this is a valid program,
8499 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
8500 is type dependent, it can be pseudo-destructor-name or something else.
8501 Try to parse it as pseudo-destructor-name first. */
8503 {
8504 tree s;
8505 tree type;
8508 /* Parse the pseudo-destructor-name. */
8517 {
8519 postfix_expression
8522 }
8523 }
8526 {
8527 /* If the SCOPE is not a scalar type, we are looking at an
8528 ordinary class member access expression, rather than a
8529 pseudo-destructor-name. */
8532 /* Parse the id-expression. */
8533 name = (cp_parser_id_expression
8540 /* In general, build a SCOPE_REF if the member name is qualified.
8541 However, if the name was not dependent and has already been
8542 resolved; there is no need to build the SCOPE_REF. For example;
8544 struct X { void f(); };
8545 template <typename T> void f(T* t) { t->X::f(); }
8547 Even though "t" is dependent, "X::f" is not and has been resolved
8548 to a BASELINK; there is no need to include scope information. */
8550 /* But we do need to remember that there was an explicit scope for
8551 virtual function calls. */
8555 /* If the name is a template-id that names a type, we will get a
8556 TYPE_DECL here. That is invalid code. */
8558 {
8561 }
8562 else
8563 {
8565 {
8567 {
8571 }
8572 else
8575 name,
8576 template_p);
8580 }
8582 adjust_result_of_qualified_name_lookup
8584 postfix_expression
8586 template_p,
8587 tf_warning_or_error);
8588 /* Build a location e.g.:
8589 ptr->access_expr
8590 ~~~^~~~~~~~~~~~~
8591 where the caret is at the deref token, ranging from
8592 the start of postfix_expression to the end of the access expr. */
8593 location_t combined_loc
8596 }
8597 }
8599 /* We no longer need to look up names in the scope of the object on
8600 the left-hand side of the `.' or `->' operator. */
8603 /* Outside of offsetof, these operators may not appear in
8604 constant-expressions. */
8606 && (cp_parser_non_integral_constant_expression
8611 }
8613 /* Parse a parenthesized expression-list.
8615 expression-list:
8616 assignment-expression
8617 expression-list, assignment-expression
8619 attribute-list:
8620 expression-list
8621 identifier
8622 identifier, expression-list
8624 CAST_P is true if this expression is the target of a cast.
8626 ALLOW_EXPANSION_P is true if this expression allows expansion of an
8627 argument pack.
8629 WRAP_LOCATIONS_P is true if expressions within this list for which
8630 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
8631 their source locations.
8633 Returns a vector of trees. Each element is a representation of an
8634 assignment-expression. NULL is returned if the ( and or ) are
8635 missing. An empty, but allocated, vector is returned on no
8636 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
8637 if we are parsing an attribute list for an attribute that wants a
8638 plain identifier argument, normal_attr for an attribute that wants
8639 an expression, or non_attr if we aren't parsing an attribute list. If
8640 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
8641 not all of the expressions in the list were constant.
8642 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
8643 will be written to with the location of the closing parenthesis. If
8644 an error occurs, it may or may not be written to. */
8654 {
8658 /* Assume all the expressions will be constant. */
8662 matching_parens parens;
8668 /* Within a parenthesized expression, a `>' token is always
8669 the greater-than operator. */
8670 saved_greater_than_is_operator_p
8676 /* Consume expressions until there are no more. */
8679 {
8680 /* At the beginning of attribute lists, check to see if the
8681 next token is an identifier. */
8687 else
8688 expr
8690 allow_expansion_p,
8691 non_constant_p);
8696 /* Add it to the list. We add error_mark_node
8697 expressions to the list, so that we can still tell if
8698 the correct form for a parenthesized expression-list
8699 is found. That gives better errors. */
8705 /* After the first item, attribute lists look the same as
8706 expression lists. */
8709 get_comma:;
8710 /* If the next token isn't a `,', then we are done. */
8714 /* Otherwise, consume the `,' and keep going. */
8716 }
8722 {
8725 skip_comma:;
8726 /* We try and resync to an unnested comma, as that will give the
8727 user better diagnostics. */
8735 {
8736 parser->greater_than_is_operator_p
8739 }
8740 }
8742 parser->greater_than_is_operator_p
8746 }
8748 /* Parse a pseudo-destructor-name.
8750 pseudo-destructor-name:
8751 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
8752 :: [opt] nested-name-specifier template template-id :: ~ type-name
8753 :: [opt] nested-name-specifier [opt] ~ type-name
8755 If either of the first two productions is used, sets *SCOPE to the
8756 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
8757 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
8758 or ERROR_MARK_NODE if the parse fails. */
8760 static void
8762 tree object,
8765 {
8768 /* Handle ~auto. */
8772 {
8775 "%<~auto%> only available with "
8782 }
8784 /* Assume that things will not work out. */
8787 /* Look for the optional `::' operator. */
8789 /* Look for the optional nested-name-specifier. */
8790 nested_name_specifier_p
8797 /* Now, if we saw a nested-name-specifier, we might be doing the
8798 second production. */
8801 {
8802 /* Consume the `template' keyword. */
8804 /* Parse the template-id. */
8808 class_type,
8810 /* Look for the `::' token. */
8812 }
8813 /* If the next token is not a `~', then there might be some
8814 additional qualification. */
8816 {
8817 /* At this point, we're looking for "type-name :: ~". The type-name
8818 must not be a class-name, since this is a pseudo-destructor. So,
8819 it must be either an enum-name, or a typedef-name -- both of which
8820 are just identifiers. So, we peek ahead to check that the "::"
8821 and "~" tokens are present; if they are not, then we can avoid
8822 calling type_name. */
8826 {
8829 }
8831 /* Look for the type-name. */
8836 /* Look for the `::' token. */
8838 }
8839 else
8842 /* Look for the `~'. */
8845 /* Once we see the ~, this has to be a pseudo-destructor. */
8849 /* Look for the type-name again. We are not responsible for
8850 checking that it matches the first type-name. */
8852 }
8854 /* Parse a unary-expression.
8856 unary-expression:
8857 postfix-expression
8858 ++ cast-expression
8859 -- cast-expression
8860 await-expression
8861 unary-operator cast-expression
8862 sizeof unary-expression
8863 sizeof ( type-id )
8864 alignof ( type-id ) [C++0x]
8865 new-expression
8866 delete-expression
8868 GNU Extensions:
8870 unary-expression:
8871 __extension__ cast-expression
8872 __alignof__ unary-expression
8873 __alignof__ ( type-id )
8874 alignof unary-expression [C++0x]
8875 __real__ cast-expression
8876 __imag__ cast-expression
8877 && identifier
8878 sizeof ( type-id ) { initializer-list , [opt] }
8879 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8880 __alignof__ ( type-id ) { initializer-list , [opt] }
8882 ADDRESS_P is true iff the unary-expression is appearing as the
8883 operand of the `&' operator. CAST_P is true if this expression is
8884 the target of a cast.
8886 Returns a representation of the expression. */
8888 static cp_expr
8891 {
8895 /* Peek at the next token. */
8897 /* Some keywords give away the kind of expression. */
8899 {
8903 {
8906 {
8914 /* Consume the token. */
8916 /* Parse the operand. */
8919 /* Construct a location e.g. :
8920 alignof (expr)
8921 ^~~~~~~~~~~~~~
8922 with start == caret at the start of the "alignof"/"sizeof"
8923 token, with the endpoint at the final closing paren. */
8924 location_t compound_loc
8930 else
8931 {
8932 /* ISO C++ defines alignof only with types, not with
8933 expressions. So pedwarn if alignof is used with a non-
8934 type expression. However, __alignof__ is ok. */
8937 "ISO C++ does not allow %<alignof%> "
8942 }
8943 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8944 SIZEOF_EXPR with the original operand. */
8946 {
8948 {
8950 {
8953 error_mark_node));
8955 }
8956 else
8961 }
8962 }
8967 }
8979 {
8980 /* The saved value of the PEDANTIC flag. */
8982 tree expr;
8984 /* Save away the PEDANTIC flag. */
8986 /* Parse the cast-expression. */
8988 /* Restore the PEDANTIC flag. */
8992 }
8996 {
8997 tree expression;
8999 /* Consume the `__real__' or `__imag__' token. */
9001 /* Parse the cast-expression. */
9003 /* Create the complete representation. */
9008 tf_warning_or_error);
9009 }
9017 {
9018 tree expr;
9027 matching_parens parens;
9031 parser->type_definition_forbidden_message
9034 saved_integral_constant_expression_p
9036 saved_non_integral_constant_expression_p
9040 saved_greater_than_is_operator_p
9052 parser->greater_than_is_operator_p
9055 parser->integral_constant_expression_p
9057 parser->non_integral_constant_expression_p
9064 /* Construct a location of the form:
9065 noexcept (expr)
9066 ^~~~~~~~~~~~~~~
9067 with start == caret, finishing at the close-paren. */
9068 location_t noexcept_loc
9072 noexcept_loc);
9073 }
9076 {
9077 tree expr;
9080 /* Consume the `co_await' token. */
9082 /* Parse its cast-expression. */
9087 /* Handle [expr.await]. */
9089 }
9093 }
9094 }
9096 /* Look for the `:: new' and `:: delete', which also signal the
9097 beginning of a new-expression, or delete-expression,
9098 respectively. If the next token is `::', then it might be one of
9099 these. */
9101 {
9104 /* See if the token after the `::' is one of the keywords in
9105 which we're interested. */
9107 /* If it's `new', we have a new-expression. */
9110 /* Similarly, for `delete'. */
9113 }
9115 /* Look for a unary operator. */
9117 /* The `++' and `--' operators can be handled similarly, even though
9118 they are not technically unary-operators in the grammar. */
9120 {
9125 /* Handle the GNU address-of-label extension. */
9128 {
9129 tree identifier;
9130 tree expression;
9133 /* Consume the '&&' token. */
9135 /* Look for the identifier. */
9137 /* Construct a location of the form:
9138 &&label
9139 ^~~~~~~
9140 with caret==start at the "&&", finish at the end of the label. */
9141 location_t combined_loc
9143 /* Create an expression representing the address. */
9146 NIC_ADDR_LABEL))
9149 }
9150 }
9152 {
9153 cp_expr cast_expression;
9159 /* Consume the operator token. */
9163 /* Parse the cast-expression. */
9164 cast_expression
9169 pidk);
9171 /* Make a location:
9172 OP_TOKEN CAST_EXPRESSION
9173 ^~~~~~~~~~~~~~~~~~~~~~~~~
9174 with start==caret at the operator token, and
9175 extending to the end of the cast_expression. */
9178 /* Now, build an appropriate representation. */
9180 {
9185 complain);
9186 /* TODO: build_x_indirect_ref does not always honor the
9187 location, so ensure it is set. */
9193 /* Fall through. */
9196 cast_expression,
9198 /* TODO: build_x_unary_op does not always honor the location,
9199 so ensure it is set. */
9207 /* Fall through. */
9209 /* Immediately fold negation of a constant, unless the constant is 0
9210 (since -0 == 0) or it would overflow. */
9212 {
9213 tree stripped_expr
9218 {
9221 stripped_expr);
9223 {
9226 }
9227 }
9228 }
9229 /* Fall through. */
9238 }
9242 non_constant_p))
9246 }
9250 decltype_p,
9251 pidk);
9252 }
9254 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
9255 unary-operator, the corresponding tree code is returned. */
9257 static enum tree_code
9259 {
9261 {
9282 }
9283 }
9285 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
9286 Returns a representation of the expression. */
9288 static tree
9290 {
9293 /* Consume the __builtin_has_attribute token. */
9296 matching_parens parens;
9300 /* Types cannot be defined in a `sizeof' expression. Save away the
9301 old message. */
9305 parser->type_definition_forbidden_message
9307 parser->type_definition_forbidden_message_arg
9310 /* The restrictions on constant-expressions do not apply inside
9311 sizeof expressions. */
9312 bool saved_integral_constant_expression_p
9314 bool saved_non_integral_constant_expression_p
9318 /* Do not actually evaluate the expression. */
9324 /* We can't be sure yet whether we're looking at a type-id or an
9325 expression. */
9330 /* Look for the type-id. */
9336 /* If the type-id production did not work out, then we must be
9337 looking at an expression. */
9343 /* Go back to evaluating expressions. */
9347 /* And restore the old one. */
9350 parser->integral_constant_expression_p
9352 parser->non_integral_constant_expression_p
9355 /* Consume the comma if it's there. */
9357 {
9361 }
9363 /* Parse the attribute specification. */
9367 {
9373 else
9374 {
9375 /* Fold constant expressions used in attributes first. */
9378 /* Finally, see if OPER has been declared with ATTR. */
9380 }
9383 }
9384 else
9385 {
9388 }
9390 /* Construct a location e.g. :
9391 __builtin_has_attribute (oper, attr)
9392 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
9393 with start == caret at the start of the built-in token,
9394 and with the endpoint at the final closing paren. */
9395 location_t compound_loc
9402 }
9404 /* Parse a new-expression.
9406 new-expression:
9407 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
9408 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
9410 Returns a representation of the expression. */
9412 static tree
9414 {
9417 tree type;
9420 tree ret;
9424 /* Look for the optional `::' operator. */
9425 global_scope_p
9429 /* Look for the `new' operator. */
9431 /* There's no easy way to tell a new-placement from the
9432 `( type-id )' construct. */
9434 /* Look for a new-placement. */
9436 /* If that didn't work out, there's no new-placement. */
9438 {
9442 }
9444 /* If the next token is a `(', then we have a parenthesized
9445 type-id. */
9447 {
9451 /* Consume the `('. */
9452 matching_parens parens;
9455 /* Parse the type-id. */
9456 parser->type_definition_forbidden_message
9458 {
9461 }
9464 /* Look for the closing `)'. */
9467 /* There should not be a direct-new-declarator in this production,
9468 but GCC used to allowed this, so we check and emit a sensible error
9469 message for this case. */
9471 {
9477 }
9478 }
9479 /* Otherwise, there must be a new-type-id. */
9480 else
9483 /* If the next token is a `(' or '{', then we have a new-initializer. */
9488 else
9491 /* A new-expression may not appear in an integral constant
9492 expression. */
9495 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
9496 of a new-type-id or type-id of a new-expression, the new-expression shall
9497 contain a new-initializer of the form ( assignment-expression )".
9498 Additionally, consistently with the spirit of DR 1467, we want to accept
9499 'new auto { 2 }' too. */
9505 {
9507 "initialization of new-expression for type %<auto%> "
9510 }
9511 else
9512 {
9513 /* Construct a location e.g.:
9514 ptr = new int[100]
9515 ^~~~~~~~~~~~
9516 with caret == start at the start of the "new" token, and the end
9517 at the end of the final token we consumed. */
9520 /* Create a representation of the new-expression. */
9523 }
9531 }
9533 /* Parse a new-placement.
9535 new-placement:
9536 ( expression-list )
9538 Returns the same representation as for an expression-list. */
9542 {
9545 /* Parse the expression-list. */
9546 expression_list = (cp_parser_parenthesized_expression_list
9555 }
9557 /* Parse a new-type-id.
9559 new-type-id:
9560 type-specifier-seq new-declarator [opt]
9562 Returns the TYPE allocated. If the new-type-id indicates an array
9563 type, *NELTS is set to the number of elements in the last array
9564 bound; the TYPE will not include the last array bound. */
9566 static tree
9568 {
9569 cp_decl_specifier_seq type_specifier_seq;
9575 /* The type-specifier sequence must not contain type definitions.
9576 (It cannot contain declarations of new types either, but if they
9577 are not definitions we will catch that because they are not
9578 complete.) */
9580 parser->type_definition_forbidden_message
9582 /* Parse the type-specifier-seq. */
9587 /* Restore the old message. */
9593 /* Parse the new-declarator. */
9596 /* Determine the number of elements in the last array dimension, if
9597 any. */
9599 /* Skip down to the last array dimension. */
9604 {
9607 }
9612 {
9615 }
9618 {
9627 else
9629 }
9632 }
9634 /* Parse an (optional) new-declarator.
9636 new-declarator:
9637 ptr-operator new-declarator [opt]
9638 direct-new-declarator
9640 Returns the declarator. */
9644 {
9647 cp_cv_quals cv_quals;
9649 /* We don't know if there's a ptr-operator next, or not. */
9651 /* Look for a ptr-operator. */
9653 /* If that worked, look for more new-declarators. */
9655 {
9658 /* Parse another optional declarator. */
9661 declarator = cp_parser_make_indirect_declarator
9665 }
9667 /* If the next token is a `[', there is a direct-new-declarator. */
9672 }
9674 /* Parse a direct-new-declarator.
9676 direct-new-declarator:
9677 [ expression ]
9678 direct-new-declarator [constant-expression]
9680 */
9684 {
9689 {
9690 tree expression;
9693 /* Look for the opening `['. */
9699 else
9701 /* The standard requires that the expression have integral
9702 type. DR 74 adds enumeration types. We believe that the
9703 real intent is that these expressions be handled like the
9704 expression in a `switch' condition, which also allows
9705 classes with a single conversion to integral or
9706 enumeration type. */
9708 {
9709 expression
9711 expression,
9714 {
9716 "expression in new-declarator must have integral "
9719 }
9720 }
9722 /* Look for the closing `]'. */
9725 /* Add this bound to the declarator. */
9728 /* If the next token is not a `[', then there are no more
9729 bounds. */
9733 }
9736 }
9738 /* Parse a new-initializer.
9740 new-initializer:
9741 ( expression-list [opt] )
9742 braced-init-list
9744 Returns a representation of the expression-list. */
9748 {
9752 {
9758 }
9759 else
9760 expression_list = (cp_parser_parenthesized_expression_list
9766 }
9768 /* Parse a delete-expression.
9770 delete-expression:
9771 :: [opt] delete cast-expression
9772 :: [opt] delete [ ] cast-expression
9774 Returns a representation of the expression. */
9776 static tree
9778 {
9781 tree expression;
9784 /* Look for the optional `::' operator. */
9785 global_scope_p
9789 /* Look for the `delete' keyword. */
9791 /* See if the array syntax is in use. */
9793 {
9794 /* Consume the `[' token. */
9796 /* Look for the `]' token. */
9798 /* Remember that this is the `[]' construct. */
9800 }
9801 else
9804 /* Parse the cast-expression. */
9807 /* A delete-expression may not appear in an integral constant
9808 expression. */
9812 /* Construct a location e.g.:
9813 delete [ ] ptr
9814 ^~~~~~~~~~~~~~
9815 with caret == start at the start of the "delete" token, and
9816 the end at the end of the final token we consumed. */
9823 }
9825 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
9826 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
9827 0 otherwise. */
9829 static int
9831 {
9834 {
9876 /* In ((type ()) () the last () isn't a valid cast-expression,
9877 so the whole must be parsed as postfix-expression. */
9882 /* '[' may start a primary-expression in obj-c++ and in C++11,
9883 as a lambda-expression, eg, '(void)[]{}'. */
9890 /* '++' and '--' may or may not start a cast-expression:
9892 struct T { void operator++(int); };
9893 void f() { (T())++; }
9895 vs
9897 int a;
9898 (int)++a; */
9903 }
9904 }
9906 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
9907 in the order: const_cast, static_cast, reinterpret_cast.
9909 Don't suggest dynamic_cast.
9911 Return the first legal cast kind found, or NULL otherwise. */
9915 {
9916 tree trial;
9918 /* Reuse the parser logic by attempting to build the various kinds of
9919 cast, with "complain" disabled.
9920 Identify the first such cast that is valid. */
9922 /* Don't attempt to run such logic within template processing. */
9926 /* First try const_cast. */
9931 /* If that fails, try static_cast. */
9936 /* Finally, try reinterpret_cast. */
9938 tf_none);
9942 /* No such cast possible. */
9944 }
9946 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
9947 suggesting how to convert a C-style cast of the form:
9949 (DST_TYPE)ORIG_EXPR
9951 to a C++-style cast.
9953 The primary range of RICHLOC is asssumed to be that of the original
9954 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
9955 of the parens in the C-style cast. */
9957 static void
9960 tree dst_type)
9961 {
9962 /* This function is non-trivial, so bail out now if the warning isn't
9963 going to be emitted. */
9967 /* Try to find a legal C++ cast, trying them in order:
9968 const_cast, static_cast, reinterpret_cast. */
9973 /* Replace the open paren with "CAST_SUGGESTION<". */
9974 pretty_printer pp;
9979 /* Replace the close paren with "> (". */
9982 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
9984 }
9987 /* Parse a cast-expression.
9989 cast-expression:
9990 unary-expression
9991 ( type-id ) cast-expression
9993 ADDRESS_P is true iff the unary-expression is appearing as the
9994 operand of the `&' operator. CAST_P is true if this expression is
9995 the target of a cast.
9997 Returns a representation of the expression. */
9999 static cp_expr
10002 {
10003 /* If it's a `(', then we might be looking at a cast. */
10005 {
10011 /* There's no way to know yet whether or not this is a cast.
10012 For example, `(int (3))' is a unary-expression, while `(int)
10013 3' is a cast. So, we resort to parsing tentatively. */
10015 /* Types may not be defined in a cast. */
10017 parser->type_definition_forbidden_message
10019 /* Consume the `('. */
10020 matching_parens parens;
10025 /* A very tricky bit is that `(struct S) { 3 }' is a
10026 compound-literal (which we permit in C++ as an extension).
10027 But, that construct is not a cast-expression -- it is a
10028 postfix-expression. (The reason is that `(struct S) { 3 }.i'
10029 is legal; if the compound-literal were a cast-expression,
10030 you'd need an extra set of parentheses.) But, if we parse
10031 the type-id, and it happens to be a class-specifier, then we
10032 will commit to the parse at that point, because we cannot
10033 undo the action that is done when creating a new class. So,
10034 then we cannot back up and do a postfix-expression.
10036 Another tricky case is the following (c++/29234):
10038 struct S { void operator () (); };
10040 void foo ()
10041 {
10042 ( S()() );
10043 }
10045 As a type-id we parse the parenthesized S()() as a function
10046 returning a function, groktypename complains and we cannot
10047 back up in this case either.
10049 Therefore, we scan ahead to the closing `)', and check to see
10050 if the tokens after the `)' can start a cast-expression. Otherwise
10051 we are dealing with an unary-expression, a postfix-expression
10052 or something else.
10054 Yet another tricky case, in C++11, is the following (c++/54891):
10056 (void)[]{};
10058 The issue is that usually, besides the case of lambda-expressions,
10059 the parenthesized type-id cannot be followed by '[', and, eg, we
10060 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
10061 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
10062 we don't commit, we try a cast-expression, then an unary-expression.
10064 Save tokens so that we can put them back. */
10067 /* We may be looking at a cast-expression. */
10070 cast_expression
10073 /* Roll back the tokens we skipped. */
10075 /* If we aren't looking at a cast-expression, simulate an error so
10076 that the call to cp_parser_error_occurred below returns true. */
10079 else
10080 {
10083 /* Look for the type-id. */
10085 /* Look for the closing `)'. */
10090 }
10092 /* Restore the saved message. */
10095 /* At this point this can only be either a cast or a
10096 parenthesized ctor such as `(T ())' that looks like a cast to
10097 function returning T. */
10099 {
10100 /* Only commit if the cast-expression doesn't start with
10101 '++', '--', or '[' in C++11. */
10109 pidk);
10112 {
10113 /* Warn about old-style casts, if so requested. */
10118 {
10124 }
10126 /* Only type conversions to integral or enumeration types
10127 can be used in constant-expressions. */
10130 NIC_CAST))
10133 /* Perform the cast. */
10134 /* Make a location:
10135 (TYPE) EXPR
10136 ^~~~~~~~~~~
10137 with start==caret at the open paren, extending to the
10138 end of "expr". */
10140 open_paren_loc,
10144 }
10145 }
10146 else
10148 }
10150 /* If we get here, then it's not a cast, so it must be a
10151 unary-expression. */
10154 }
10156 /* Parse a binary expression of the general form:
10158 pm-expression:
10159 cast-expression
10160 pm-expression .* cast-expression
10161 pm-expression ->* cast-expression
10163 multiplicative-expression:
10164 pm-expression
10165 multiplicative-expression * pm-expression
10166 multiplicative-expression / pm-expression
10167 multiplicative-expression % pm-expression
10169 additive-expression:
10170 multiplicative-expression
10171 additive-expression + multiplicative-expression
10172 additive-expression - multiplicative-expression
10174 shift-expression:
10175 additive-expression
10176 shift-expression << additive-expression
10177 shift-expression >> additive-expression
10179 relational-expression:
10180 shift-expression
10181 relational-expression < shift-expression
10182 relational-expression > shift-expression
10183 relational-expression <= shift-expression
10184 relational-expression >= shift-expression
10186 GNU Extension:
10188 relational-expression:
10189 relational-expression <? shift-expression
10190 relational-expression >? shift-expression
10192 equality-expression:
10193 relational-expression
10194 equality-expression == relational-expression
10195 equality-expression != relational-expression
10197 and-expression:
10198 equality-expression
10199 and-expression & equality-expression
10201 exclusive-or-expression:
10202 and-expression
10203 exclusive-or-expression ^ and-expression
10205 inclusive-or-expression:
10206 exclusive-or-expression
10207 inclusive-or-expression | exclusive-or-expression
10209 logical-and-expression:
10210 inclusive-or-expression
10211 logical-and-expression && inclusive-or-expression
10213 logical-or-expression:
10214 logical-and-expression
10215 logical-or-expression || logical-and-expression
10217 All these are implemented with a single function like:
10219 binary-expression:
10220 simple-cast-expression
10221 binary-expression <token> binary-expression
10223 CAST_P is true if this expression is the target of a cast.
10225 The binops_by_token map is used to get the tree codes for each <token> type.
10226 binary-expressions are associated according to a precedence table. */
10228 #define TOKEN_PRECEDENCE(token) \
10229 (((token->type == CPP_GREATER \
10230 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
10231 && !parser->greater_than_is_operator_p) \
10232 ? PREC_NOT_OPERATOR \
10233 : binops_by_token[token->type].prec)
10235 static cp_expr
10241 {
10242 cp_parser_expression_stack stack;
10245 cp_parser_expression_stack_entry current;
10246 cp_expr rhs;
10250 tree overload;
10252 /* Parse the first expression. */
10263 {
10264 /* Get an operator token. */
10270 {
10272 "%<>>%> operator is treated"
10276 }
10281 /* This is a fold-expression; handle it later. */
10284 /* Popping an entry off the stack means we completed a subexpression:
10285 - either we found a token which is not an operator (`>' where it is not
10286 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
10287 will happen repeatedly;
10288 - or, we found an operator which has lower priority. This is the case
10289 where the recursive descent *ascends*, as in `3 * 4 + 5' after
10290 parsing `3 * 4'. */
10292 {
10295 else
10297 }
10299 get_rhs:
10304 /* We used the operator token. */
10307 /* For "false && x" or "true || x", x will never be executed;
10308 disable warnings while evaluating it. */
10313 {
10316 }
10318 /* Extract another operand. It may be the RHS of this expression
10319 or the LHS of a new, higher priority expression. */
10324 /* Get another operator token. Look up its precedence to avoid
10325 building a useless (immediately popped) stack entry for common
10326 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
10333 {
10334 /* ... and prepare to parse the RHS of the new, higher priority
10335 expression. Since precedence levels on the stack are
10336 monotonically increasing, we do not have to care about
10337 stack overflows. */
10346 pop:
10348 /* If the stack is not empty, we have parsed into LHS the right side
10349 (`4' in the example above) of an expression we had suspended.
10350 We can use the information on the stack to recover the LHS (`3')
10351 from the stack together with the tree code (`MULT_EXPR'), and
10352 the precedence of the higher level subexpression
10353 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
10354 which will be used to actually build the additive expression. */
10359 }
10361 /* Undo the disabling of warnings done above. */
10363 {
10366 }
10371 /* Avoid warning for !!x == y. */
10376 /* Avoid warning for !b == y where b is boolean. */
10380 /* Avoid warning for !!b == y where b is boolean. */
10392 /* Don't warn for named "xor" (as opposed to '^'). */
10396 check_for_xor_used_as_pow
10409 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
10410 ERROR_MARK for everything that is not a binary expression.
10411 This makes warn_about_parentheses miss some warnings that
10412 involve unary operators. For unary expressions we should
10413 pass the correct tree_code unless the unary expression was
10414 surrounded by parentheses.
10415 */
10419 {
10422 else
10423 {
10426 current.lhs
10429 == tcc_comparison
10433 }
10434 }
10435 else
10436 {
10442 /* TODO: build_x_binary_op doesn't always honor the location. */
10444 }
10447 /* If the binary operator required the use of an overloaded operator,
10448 then this expression cannot be an integral constant-expression.
10449 An overloaded operator can be used even if both operands are
10450 otherwise permissible in an integral constant-expression if at
10451 least one of the operands is of enumeration type. */
10455 NIC_OVERLOADED))
10457 }
10460 }
10462 static cp_expr
10467 {
10470 }
10472 /* Parse the `? expression : assignment-expression' part of a
10473 conditional-expression. The LOGICAL_OR_EXPR is the
10474 logical-or-expression that started the conditional-expression.
10475 Returns a representation of the entire conditional-expression.
10477 This routine is used by cp_parser_assignment_expression
10478 and cp_parser_conditional_expression.
10480 ? expression : assignment-expression
10482 GNU Extensions:
10484 ? : assignment-expression */
10486 static tree
10488 {
10490 cp_expr assignment_expr;
10494 /* Consume the `?' token. */
10499 {
10502 /* Implicit true clause. */
10504 c_inhibit_evaluation_warnings +=
10507 }
10508 else
10509 {
10512 /* Parse the expression. */
10513 c_inhibit_evaluation_warnings +=
10516 c_inhibit_evaluation_warnings +=
10520 }
10522 /* The next token should be a `:'. */
10524 /* Parse the assignment-expression. */
10526 c_inhibit_evaluation_warnings -=
10529 /* Make a location:
10530 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
10531 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
10532 with the caret at the "?", ranging from the start of
10533 the logical_or_expr to the end of the assignment_expr. */
10538 /* Build the conditional-expression. */
10540 expr,
10541 assignment_expr,
10542 tf_warning_or_error);
10543 }
10545 /* Parse a conditional-expression.
10547 conditional-expression:
10548 logical-or-expression
10549 logical-or-expression ? expression : assignment-expression
10551 GNU Extensions:
10553 logical-or-expression ? : assignment-expression */
10555 static cp_expr
10557 {
10560 /* If the next token is a `?' then we're actually looking at
10561 a conditional-expression; otherwise we're done. */
10565 }
10567 /* Parse an assignment-expression.
10569 assignment-expression:
10570 conditional-expression
10571 logical-or-expression assignment-operator assignment_expression
10572 throw-expression
10573 yield-expression
10575 CAST_P is true if this expression is the target of a cast.
10576 DECLTYPE_P is true if this expression is the operand of decltype.
10578 Returns a representation for the expression. */
10580 static cp_expr
10583 {
10584 cp_expr expr;
10586 /* If the next token is the `throw' keyword, then we're looking at
10587 a throw-expression. */
10590 /* If the next token is the `co_yield' keyword, then we're looking at
10591 a yield-expression. */
10594 /* Otherwise, it must be that we are looking at a
10595 logical-or-expression. */
10596 else
10597 {
10598 /* Parse the binary expressions (logical-or-expression). */
10600 decltype_p,
10602 /* If the next token is a `?' then we're actually looking at a
10603 conditional-expression. */
10606 else
10607 {
10610 /* If it's an assignment-operator, we're using the second
10611 production. */
10612 enum tree_code assignment_operator
10615 {
10616 /* Parse the right-hand side of the assignment. */
10622 /* An assignment may not appear in a
10623 constant-expression. */
10625 NIC_ASSIGNMENT))
10627 /* Build the assignment expression. Its default
10628 location:
10629 LHS = RHS
10630 ~~~~^~~~~
10631 is the location of the '=' token as the
10632 caret, ranging from the start of the lhs to the
10633 end of the rhs. */
10638 assignment_operator,
10641 /* TODO: build_x_modify_expr doesn't honor the location,
10642 so we must set it here. */
10644 }
10645 }
10646 }
10649 }
10651 /* Parse an (optional) assignment-operator.
10653 assignment-operator: one of
10654 = *= /= %= += -= >>= <<= &= ^= |=
10656 GNU Extension:
10658 assignment-operator: one of
10659 <?= >?=
10661 If the next token is an assignment operator, the corresponding tree
10662 code is returned, and the token is consumed. For example, for
10663 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
10664 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
10665 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
10666 operator, ERROR_MARK is returned. */
10668 static enum tree_code
10670 {
10674 /* Peek at the next token. */
10678 {
10724 /* Nothing else is an assignment operator. */
10726 }
10728 /* An operator followed by ... is a fold-expression, handled elsewhere. */
10733 /* If it was an assignment operator, consume it. */
10738 }
10740 /* Parse an expression.
10742 expression:
10743 assignment-expression
10744 expression , assignment-expression
10746 CAST_P is true if this expression is the target of a cast.
10747 DECLTYPE_P is true if this expression is the immediate operand of decltype,
10748 except possibly parenthesized or on the RHS of a comma (N3276).
10749 WARN_COMMA_P is true if a comma should be diagnosed.
10751 Returns a representation of the expression. */
10753 static cp_expr
10756 {
10761 {
10762 cp_expr assignment_expression;
10764 /* Parse the next assignment-expression. */
10765 assignment_expression
10768 /* We don't create a temporary for a call that is the immediate operand
10769 of decltype or on the RHS of a comma. But when we see a comma, we
10770 need to create a temporary for a call on the LHS. */
10775 assignment_expression
10779 /* If this is the first assignment-expression, we can just
10780 save it away. */
10783 else
10784 {
10785 /* Create a location with caret at the comma, ranging
10786 from the start of the LHS to the end of the RHS. */
10794 }
10795 /* If the next token is not a comma, or we're in a fold-expression, then
10796 we are done with the expression. */
10800 /* Consume the `,'. */
10803 {
10804 /* [depr.comma.subscript]: A comma expression appearing as
10805 the expr-or-braced-init-list of a subscripting expression
10806 is deprecated. A parenthesized comma expression is not
10807 deprecated. */
10809 "top-level comma expression in array subscript "
10812 }
10814 /* A comma operator cannot appear in a constant-expression. */
10817 }
10820 }
10822 /* Parse a constant-expression.
10824 constant-expression:
10825 conditional-expression
10827 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
10828 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
10829 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
10830 is false, NON_CONSTANT_P should be NULL. If ALLOW_NON_CONSTANT_P is
10831 greater than 1, this isn't really a constant-expression, only a
10832 potentially constant-evaluated expression. If STRICT_P is true,
10833 only parse a conditional-expression, otherwise parse an
10834 assignment-expression. See below for rationale. */
10836 static cp_expr
10841 {
10842 /* It might seem that we could simply parse the
10843 conditional-expression, and then check to see if it were
10844 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
10845 one that the compiler can figure out is constant, possibly after
10846 doing some simplifications or optimizations. The standard has a
10847 precise definition of constant-expression, and we must honor
10848 that, even though it is somewhat more restrictive.
10850 For example:
10852 int i[(2, 3)];
10854 is not a legal declaration, because `(2, 3)' is not a
10855 constant-expression. The `,' operator is forbidden in a
10856 constant-expression. However, GCC's constant-folding machinery
10857 will fold this operation to an INTEGER_CST for `3'. */
10859 /* Save the old settings. */
10860 bool saved_integral_constant_expression_p
10862 bool saved_allow_non_integral_constant_expression_p
10864 bool saved_non_integral_constant_expression_p
10866 /* We are now parsing a constant-expression. */
10868 parser->allow_non_integral_constant_expression_p
10872 /* A manifestly constant-evaluated expression is evaluated even in an
10873 unevaluated operand. */
10876 /* Although the grammar says "conditional-expression", when not STRICT_P,
10877 we parse an "assignment-expression", which also permits
10878 "throw-expression" and the use of assignment operators. In the case
10879 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
10880 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
10881 actually essential that we look for an assignment-expression.
10882 For example, cp_parser_initializer_clauses uses this function to
10883 determine whether a particular assignment-expression is in fact
10884 constant. */
10885 cp_expr expression;
10888 else
10890 /* Restore the old settings. */
10891 parser->integral_constant_expression_p
10893 parser->allow_non_integral_constant_expression_p
10897 {
10898 /* Require an rvalue constant expression here; that's what our
10899 callers expect. Reference constant expressions are handled
10900 separately in e.g. cp_parser_template_argument. */
10909 }
10912 parser->non_integral_constant_expression_p
10916 }
10918 /* Parse __builtin_offsetof.
10920 offsetof-expression:
10921 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
10923 offsetof-member-designator:
10924 id-expression
10925 | offsetof-member-designator "." id-expression
10926 | offsetof-member-designator "[" expression "]"
10927 | offsetof-member-designator "->" id-expression */
10929 static cp_expr
10931 {
10933 tree type;
10934 cp_expr expr;
10935 cp_id_kind dummy;
10937 location_t finish_loc;
10939 /* We're about to accept non-integral-constant things, but will
10940 definitely yield an integral constant expression. Save and
10941 restore these values around our local parsing. */
10947 /* Consume the "__builtin_offsetof" token. */
10949 /* Consume the opening `('. */
10950 matching_parens parens;
10952 /* Parse the type-id. */
10954 {
10956 parser->type_definition_forbidden_message
10960 }
10961 /* Look for the `,'. */
10965 /* Build the (type *)null that begins the traditional offsetof macro. */
10966 tree object_ptr
10970 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
10974 {
10977 {
10979 /* offsetof-member-designator "[" expression "]" */
10985 /* offsetof-member-designator "->" identifier */
10988 /* FALLTHRU */
10991 /* offsetof-member-designator "." identifier */
10999 /* Consume the ")" token. */
11005 /* Error. We know the following require will fail, but
11006 that gives the proper error message. */
11011 }
11012 }
11014 success:
11015 /* Make a location of the form:
11016 __builtin_offsetof (struct s, f)
11017 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
11018 with caret at the type-id, ranging from the start of the
11019 "_builtin_offsetof" token to the close paren. */
11021 /* The result will be an INTEGER_CST, so we need to explicitly
11022 preserve the location. */
11025 failure:
11031 }
11033 /* Parse a builtin trait expression or type. */
11035 static cp_expr
11037 {
11038 cp_trait_kind kind;
11045 {
11046 #define DEFTRAIT(TCC, CODE, NAME, ARITY) \
11047 case RID_##CODE: \
11048 kind = CPTK_##CODE; \
11049 binary = (ARITY == 2); \
11050 variadic = (ARITY == -1); \
11051 type = (TCC == tcc_type); \
11052 break;
11054 #undef DEFTRAIT
11057 }
11059 /* Get location of initial token. */
11062 /* Consume the token. */
11065 matching_parens parens;
11068 else
11072 {
11081 }
11083 /* __type_pack_element takes an expression as its first argument and uses
11084 template-id syntax instead of function call syntax (for consistency
11085 with Clang). We special case these properties of __type_pack_element
11086 here and elsewhere. */
11088 else
11089 {
11092 }
11098 {
11102 {
11104 {
11106 "trailing argument to %<__type_pack_element%> "
11109 }
11110 }
11112 }
11114 {
11117 {
11120 }
11124 }
11126 {
11129 {
11133 {
11136 }
11140 }
11144 }
11148 /* cp_parser_enclosed_template_argument_list above already took care
11150 else
11153 /* Construct a location of the form:
11154 __is_trivially_copyable(_Tp)
11155 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
11156 with start == caret, finishing at the close-paren. */
11159 /* Complete the trait expression, which may mean either processing
11160 the trait expr now or saving it for template instantiation. */
11162 {
11170 else
11172 }
11173 }
11175 /* Parse a lambda expression.
11177 lambda-expression:
11178 lambda-introducer lambda-declarator [opt] compound-statement
11179 lambda-introducer < template-parameter-list > requires-clause [opt]
11180 lambda-declarator [opt] compound-statement
11182 Returns a representation of the expression. */
11184 static cp_expr
11186 {
11188 tree type;
11196 {
11197 /* C++20 allows lambdas in unevaluated context, but one in the type of a
11198 non-type parameter is nonsensical.
11200 Distinguish a lambda in the parameter type from a lambda in the
11201 default argument by looking at local_variables_forbidden_p, which is
11202 only set in default arguments. */
11204 {
11209 }
11210 }
11212 {
11214 {
11216 "lambda-expression in unevaluated context"
11219 }
11221 }
11223 {
11225 {
11229 }
11231 }
11233 /* We may be in the middle of deferred access check. Disable
11234 it now. */
11248 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
11251 /* Now that we've started the type, add the capture fields for any
11252 explicit captures. */
11255 {
11256 /* Inside the class, surrounding template-parameter-lists do not apply. */
11257 unsigned int saved_num_template_parameter_lists
11261 bool fully_implicit_function_template_p
11265 bool auto_is_implicit_function_template_parm_p
11276 /* The body of a lambda in a discarded statement is not discarded. */
11280 /* Similarly the body of a lambda in immediate function context is not
11281 in immediate function context. */
11285 /* By virtue of defining a local class, a lambda expression has access to
11286 the private variables of enclosing classes. */
11299 {
11302 }
11304 /* The capture list was built up in reverse order; fix that now. */
11319 parser->fully_implicit_function_template_p
11323 parser->auto_is_implicit_function_template_parm_p
11325 }
11327 /* This field is only used during parsing of the lambda. */
11330 /* This lambda shouldn't have any proxies left at this point. */
11332 /* And now that we're done, push proxies for an enclosing lambda. */
11335 /* Update the lambda expression to a range. */
11342 else
11350 }
11352 /* Parse the beginning of a lambda expression.
11354 lambda-introducer:
11355 [ lambda-capture [opt] ]
11357 LAMBDA_EXPR is the current representation of the lambda expression. */
11359 static void
11361 {
11362 /* Need commas after the first capture. */
11365 /* Eat the leading `['. */
11368 /* Record default capture mode. "[&" "[=" "[&," "[=," */
11378 {
11384 }
11389 {
11391 tree capture_id;
11392 tree capture_init_expr;
11396 enum capture_kind_type
11397 {
11398 BY_COPY,
11399 BY_REFERENCE
11400 };
11404 {
11407 }
11411 else
11414 /* Possibly capture `this'. */
11416 {
11421 "explicit by-copy capture of %<this%> "
11422 "with by-copy capture default only available with "
11428 this_identifier);
11429 else
11434 }
11436 /* Possibly capture `*this'. */
11439 {
11443 "%<*this%> capture only available with "
11450 this_identifier);
11451 else
11456 }
11458 /* But reject `&this'. */
11461 {
11467 }
11469 /* Remember whether we want to capture as a reference or not. */
11471 {
11474 }
11479 {
11483 "pack init-capture only available with "
11487 }
11489 /* Early C++20 drafts had ...& instead of &...; be forgiving. */
11492 {
11497 }
11499 /* Get the identifier. */
11504 /* Would be nice to have a cp_parser_skip_to_closing_x for general
11505 delimiters, but I modified this to stop on unnested ']' as well. It
11506 was already changed to stop on unnested '}', so the
11507 "closing_parenthesis" name is no more misleading with my change. */
11508 {
11514 }
11516 /* Find the initializer for this capture. */
11520 {
11521 /* An explicit initializer exists. */
11524 "lambda capture initializers "
11532 {
11535 }
11538 }
11539 else
11540 {
11543 /* Turn the identifier into an id-expression. */
11544 capture_init_expr
11549 {
11552 }
11555 {
11558 capture_init_expr);
11563 }
11566 {
11569 capture_init_expr))
11573 }
11575 capture_init_expr
11576 = finish_id_expression
11578 capture_init_expr,
11592 {
11597 {
11598 /* If what follows is an initializer, the second '...' is
11599 invalid. But for cases like [...xs...], the first one
11600 is invalid. */
11607 }
11608 }
11609 }
11613 {
11618 capture_id);
11622 "capture of %qD redundant with by-reference capture "
11624 }
11626 /* Check for duplicates.
11627 Optimize for the zero or one explicit captures cases and only create
11628 the hash_set after adding second capture. */
11636 else
11637 {
11640 }
11644 else
11647 explicit_init_p);
11649 /* If there is any qualification still in effect, clear it
11650 now; we will be starting fresh with the next capture. */
11654 }
11657 }
11659 /* Parse the (optional) middle of a lambda expression.
11661 lambda-declarator:
11662 ( parameter-declaration-clause ) lambda-specifiers requires-clause [opt]
11663 lambda-specifiers (C++23)
11665 lambda-specifiers:
11666 decl-specifier-seq [opt] noexcept-specifier [opt]
11667 attribute-specifier-seq [opt] trailing-return-type [opt]
11669 LAMBDA_EXPR is the current representation of the lambda expression. */
11671 static bool
11673 {
11674 /* 5.1.1.4 of the standard says:
11675 If a lambda-expression does not include a lambda-declarator, it is as if
11676 the lambda-declarator were ().
11677 This means an empty parameter list, no attributes, and no exception
11678 specification. */
11689 cp_decl_specifier_seq lambda_specs;
11691 /* A lambda op() is const unless explicitly 'mutable'. */
11694 /* The template-parameter-list is optional, but must begin with
11695 an opening angle if present. */
11697 {
11701 "lambda templates are only available with "
11709 /* We may have a constrained generic lambda; parse the requires-clause
11710 immediately after the template-parameter-list and combine with any
11711 shorthand constraints present. */
11714 {
11719 }
11721 /* We just processed one more parameter list. */
11723 }
11725 /* Committee discussion supports allowing attributes here. */
11728 /* The parameter-declaration-clause is optional (unless
11729 template-parameter-list was given), but must begin with an
11730 opening parenthesis if present. */
11732 {
11733 matching_parens parens;
11738 /* Parse parameters. */
11739 param_list
11740 = cp_parser_parameter_declaration_clause
11743 /* Default arguments shall not be specified in the
11744 parameter-declaration-clause of a lambda-declarator. */
11749 OPT_Wc__14_extensions,
11754 }
11758 /* In the decl-specifier-seq of the lambda-declarator, each
11759 decl-specifier shall either be mutable or constexpr. */
11763 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
11767 {
11769 "parameter declaration before lambda declaration "
11770 "specifiers only optional with %<-std=c++2b%> or "
11773 }
11776 {
11779 }
11781 {
11786 else
11787 {
11790 }
11791 }
11795 {
11797 "parameter declaration before lambda transaction "
11798 "qualifier only optional with %<-std=c++2b%> or "
11801 }
11803 /* Parse optional exception specification. */
11804 exception_spec
11808 {
11810 "parameter declaration before lambda exception "
11811 "specification only optional with %<-std=c++2b%> or "
11814 }
11816 /* GCC 8 accepted attributes here, and this is the place for standard C++11
11817 attributes that appertain to the function type. */
11820 else
11823 /* Parse optional trailing return type. */
11825 {
11828 "parameter declaration before lambda trailing "
11829 "return type only optional with %<-std=c++2b%> or "
11833 }
11835 /* Also allow GNU attributes at the very end of the declaration, the usual
11836 place for GNU attributes. */
11841 {
11842 /* Parse optional trailing requires clause. */
11845 /* The function parameters must be in scope all the way until after the
11846 trailing-return-type in case of decltype. */
11848 }
11850 /* Create the function call operator.
11852 Messing with declarators like this is no uglier than building up the
11853 FUNCTION_DECL by hand, and this is less likely to get out of sync with
11854 other code. */
11855 {
11856 cp_decl_specifier_seq return_type_specs;
11858 tree fco;
11865 {
11869 else
11871 "lambda only available with %<-std=c++17%> or "
11873 }
11878 {
11882 }
11890 VIRT_SPEC_UNSPECIFIED,
11891 REF_QUAL_NONE,
11892 tx_qual,
11893 exception_spec,
11894 return_type,
11895 trailing_requires_clause,
11896 std_attrs,
11897 UNKNOWN_LOCATION);
11900 declarator,
11903 {
11907 /* Give the object parameter a different name. */
11910 }
11912 {
11916 }
11926 }
11927 }
11929 /* Parse the body of a lambda expression, which is simply
11931 compound-statement
11933 but which requires special handling.
11934 LAMBDA_EXPR is the current representation of the lambda expression. */
11936 static void
11938 {
11940 unsigned char local_variables_forbidden_p
11944 /* The body of a lambda-expression is not a subexpression of the enclosing
11945 expression. */
11946 cp_evaluated ev;
11950 else
11951 /* Still increment function_depth so that we don't GC in the
11952 middle of an expression. */
11960 /* Clear this in case we're in the middle of a default argument. */
11964 {
11969 /* Originally C++11 required us to peek for 'return expr'; and
11970 process it specially here to deduce the return type. N3638
11971 removed the need for that. */
11975 }
11982 else
11984 }
11986 /* Statements [gram.stmt.stmt] */
11988 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
11990 static void
11992 {
11996 /* A concept is never expanded normally. */
12002 }
12004 struct cp_omp_attribute_data
12005 {
12008 c_omp_directive_kind kind;
12009 };
12011 /* Handle omp::directive and omp::sequence attributes in ATTRS
12012 (if any) at the start of a statement or in attribute-declaration. */
12014 static tree
12016 {
12027 {
12028 cnt++;
12030 {
12036 {
12038 "mixing OpenMP directives with attribute and pragma "
12042 }
12044 {
12048 }
12051 {
12059 else
12062 }
12068 {
12070 "unknown OpenMP directive name in %qs attribute "
12074 }
12077 {
12078 /* ordered is C_OMP_DIR_CONSTRUCT only if it doesn't contain
12079 depend/doacross clause. */
12092 }
12094 {
12095 /* error with at(execution) clause is C_OMP_DIR_STANDALONE. */
12099 paren_depth++;
12101 paren_depth--;
12112 {
12115 }
12116 }
12121 }
12122 cp_omp_attribute_data v = {};
12125 }
12126 else
12139 {
12144 }
12145 else
12146 {
12148 {
12151 }
12152 }
12155 {
12157 "OpenMP construct among %<omp::directive%> attributes"
12158 " requires all %<omp::directive%> attributes on the"
12161 }
12163 {
12165 "multiple OpenMP standalone directives among"
12166 " %<omp::directive%> attributes must be all within the"
12169 }
12175 {
12177 "standalone OpenMP directives in %<omp::directive%> attribute"
12180 }
12182 {
12186 {
12188 "mixing OpenMP directives with attribute and pragma "
12191 }
12192 }
12196 tokens++;
12201 {
12208 cp_token tok = {};
12216 tok = {};
12221 }
12222 cp_token tok = {};
12234 /* Move the current source position to that of the first token in the
12235 new lexer. */
12238 }
12240 /* True if and only if the name is one of the contract types. */
12242 static bool
12244 {
12248 }
12250 /* Handle omp::directive and omp::sequence attributes in *PATTRS
12251 (if any) at the start or after declaration-id of a declaration. */
12253 static void
12257 {
12268 {
12270 {
12277 {
12285 else
12288 }
12298 {
12300 {
12303 }
12305 {
12307 "mixing OpenMP directives with attribute and "
12310 }
12311 }
12312 }
12313 }
12316 {
12321 else
12324 }
12329 {
12338 }
12340 }
12342 /* Parse a statement.
12344 statement:
12345 labeled-statement
12346 expression-statement
12347 compound-statement
12348 selection-statement
12349 iteration-statement
12350 jump-statement
12351 declaration-statement
12352 try-block
12354 C++11:
12356 statement:
12357 labeled-statement
12358 attribute-specifier-seq (opt) expression-statement
12359 attribute-specifier-seq (opt) compound-statement
12360 attribute-specifier-seq (opt) selection-statement
12361 attribute-specifier-seq (opt) iteration-statement
12362 attribute-specifier-seq (opt) jump-statement
12363 declaration-statement
12364 attribute-specifier-seq (opt) try-block
12366 init-statement:
12367 expression-statement
12368 simple-declaration
12369 alias-declaration
12371 TM Extension:
12373 statement:
12374 atomic-statement
12376 IN_COMPOUND is true when the statement is nested inside a
12377 cp_parser_compound_statement.
12379 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12380 is a (possibly labeled) if statement which is not enclosed in braces
12381 and has an else clause. This is used to implement -Wparentheses.
12383 CHAIN is a vector of if-else-if conditions.
12385 Note that this version of parsing restricts assertions to be attached to
12386 empty statements. */
12388 static void
12392 {
12398 /* A copy of IN_COMPOUND which is set to false after seeing a label.
12399 This matters for certain pragmas. */
12402 restart:
12405 /* There is no statement yet. */
12412 /* In obj-c++, seeing '[[' might be the either the beginning of
12413 c++11 attributes, or a nested objc-message-expression. So
12414 let's parse the c++11 attributes tentatively. */
12420 {
12423 }
12426 /* Peek at the next token. */
12429 /* If we have contracts, check that they're valid in this context. */
12431 {
12439 /* Check that assertions are null statements. */
12443 }
12449 {
12453 {
12480 }
12486 {
12488 std_attrs);
12490 }
12491 }
12494 /* Remember the location of the first token in the statement. */
12498 /* If this is a keyword, then that will often determine what kind of
12499 statement we have. */
12501 {
12505 {
12508 /* Looks like a labeled-statement with a case label.
12509 Parse the label, and then use tail recursion to parse
12510 the statement. */
12539 /* Objective-C++ exception-handling constructs. */
12555 /* This must be a namespace alias definition. */
12557 {
12558 /* Attributes should be parsed as part of the
12559 declaration, so let's un-parse them. */
12562 }
12580 /* It might be a keyword like `int' that can start a
12581 declaration-statement. */
12583 }
12584 }
12586 {
12587 /* If the next token is a `:', then we are looking at a
12588 labeled-statement. */
12591 {
12592 /* Looks like a labeled-statement with an ordinary label.
12593 Parse the label, and then use tail recursion to parse
12594 the statement. */
12598 /* If there's no statement, it's not a labeled-statement, just
12599 a label. That's allowed in C++23, but only if we're at the
12600 end of a compound-statement. */
12603 {
12607 "label at end of compound statement only available "
12610 }
12614 }
12615 }
12616 /* Anything that starts with a `{' must be a compound-statement. */
12618 {
12621 }
12622 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
12623 a statement all its own. */
12625 {
12626 do_pragma:;
12629 /* Only certain OpenMP pragmas are attached to statements, and thus
12630 are considered statements themselves. All others are not. In
12631 the context of a compound, accept the pragma as a "statement" and
12632 return so that we can check for a close brace. Otherwise we
12633 require a real statement and must go back and read one. */
12635 {
12639 }
12647 {
12649 {
12656 }
12659 }
12667 }
12669 {
12672 }
12674 /* Everything else must be a declaration-statement or an
12675 expression-statement. Try for the declaration-statement
12676 first, unless we are looking at a `;', in which case we know that
12677 we have an expression-statement. */
12679 {
12681 {
12683 /* Attributes should be parsed as part of the declaration,
12684 so let's un-parse them. */
12689 /* Try to parse the declaration-statement. */
12692 /* If that worked, we're done. */
12695 /* It didn't work, restore the post-attribute position. */
12697 {
12700 {
12705 i++;
12707 {
12713 /* Don't handle OpenMP attribs on keywords that
12714 always start a declaration statement but don't
12715 accept attribute before it and therefore
12716 the tentative cp_parser_declaration_statement
12717 fails to parse because of that. */
12722 }
12725 {
12727 std_attrs
12728 = cp_parser_handle_statement_omp_attributes
12734 }
12735 }
12736 }
12737 }
12738 /* All preceding labels have been parsed at this point. */
12744 /* Look for an expression-statement instead. */
12748 attrs_loc);
12750 /* Handle [[fallthrough]];. */
12752 {
12753 /* The next token after the fallthrough attribute is ';'. */
12755 {
12756 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12758 IFN_FALLTHROUGH,
12761 }
12762 else
12766 }
12768 /* Handle [[assert: ...]]; */
12770 {
12771 /* Add the assertion as a statement in the current block. */
12775 }
12776 }
12778 /* Set the line number for the statement. */
12782 /* Allow "[[fallthrough]];" or "[[assume(cond)]];", but warn otherwise. */
12785 OPT_Wattributes,
12787 }
12789 /* Append ATTR to attribute list ATTRS. */
12791 tree
12793 {
12799 }
12801 /* Parse the label for a labeled-statement, i.e.
12803 label:
12804 attribute-specifier-seq[opt] identifier :
12805 attribute-specifier-seq[opt] case constant-expression :
12806 attribute-specifier-seq[opt] default :
12808 labeled-statement:
12809 label statement
12811 GNU Extension:
12812 case constant-expression ... constant-expression : statement
12814 When a label is parsed without errors, the label is added to the
12815 parse tree by the finish_* functions, so this function doesn't
12816 have to return the label. */
12818 static void
12820 {
12825 /* The next token should be an identifier. */
12829 {
12832 }
12834 /* Remember whether this case or a user-defined label is allowed to fall
12835 through to. */
12840 {
12842 {
12846 /* Consume the `case' token. */
12848 /* Parse the constant-expression. */
12855 {
12856 /* Consume the `...' token. */
12862 /* We don't need to emit warnings here, as the common code
12863 will do this for us. */
12864 }
12865 else
12869 {
12872 {
12875 }
12876 }
12877 else
12880 expr);
12881 }
12885 /* Consume the `default' token. */
12889 {
12892 {
12895 }
12896 }
12897 else
12902 /* Anything else must be an ordinary label. */
12907 }
12909 /* Require the `:' token. */
12912 /* An ordinary label may optionally be followed by attributes.
12913 However, this is only permitted if the attributes are then
12914 followed by a semicolon. This is because, for backward
12915 compatibility, when parsing
12916 lab: __attribute__ ((unused)) int i;
12917 we want the attribute to attach to "i", not "lab". */
12920 {
12921 tree attrs;
12925 /* And fallthrough always binds to the expression-statement. */
12930 ;
12931 else
12933 }
12939 }
12941 /* Parse an expression-statement.
12943 expression-statement:
12944 expression [opt] ;
12946 Returns the new EXPR_STMT -- or NULL_TREE if the expression
12947 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
12948 indicates whether this expression-statement is part of an
12949 expression statement. */
12951 static tree
12953 {
12958 /* There might be attribute fallthrough. */
12961 /* If the next token is a ';', then there is no expression
12962 statement. */
12964 {
12968 {
12971 }
12972 }
12976 /* Handle [[fallthrough]];. */
12978 {
12979 /* The next token after the fallthrough attribute is ';'. */
12981 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12984 else
12988 }
12990 /* Allow "[[fallthrough]];", but warn otherwise. */
12995 /* Give a helpful message for "A<T>::type t;" and the like. */
12998 {
13005 {
13006 /* A::A a; */
13011 }
13012 }
13014 /* Consume the final `;'. */
13019 /* This is the final expression statement of a statement
13020 expression. */
13026 }
13028 /* Parse a compound-statement.
13030 compound-statement:
13031 { statement-seq [opt] label-seq [opt] }
13033 label-seq:
13034 label
13035 label-seq label
13037 GNU extension:
13039 compound-statement:
13040 { label-declaration-seq [opt] statement-seq [opt] }
13042 label-declaration-seq:
13043 label-declaration
13044 label-declaration-seq label-declaration
13046 Returns a tree representing the statement. */
13048 static tree
13051 {
13052 tree compound_stmt;
13053 matching_braces braces;
13055 /* Consume the `{'. */
13062 /* Begin the compound-statement. */
13064 /* If the next keyword is `__label__' we have a label declaration. */
13067 /* Parse an (optional) statement-seq. */
13070 /* Consume the `}'. */
13073 /* Finish the compound-statement. */
13077 }
13079 /* Diagnose errors related to imperfectly nested loops in an OMP
13080 loop construct. This function is called when such code is seen.
13081 Only issue one such diagnostic no matter how much invalid
13082 intervening code there is in the loop.
13083 FIXME: maybe the location associated with the diagnostic should
13084 be the current parser token instead of the location of the outer loop
13085 nest. */
13087 static void
13089 {
13098 /* Only diagnose errors related to perfect nesting once. */
13100 {
13102 {
13104 "inner loops must be perfectly nested in "
13107 }
13109 {
13111 "inner loops must be perfectly nested with "
13114 }
13116 {
13118 "inner loops must be perfectly nested with "
13121 }
13122 /* TODO: Also reject loops with TILE directive. */
13125 }
13126 }
13128 /* Parse an (optional) statement-seq.
13130 statement-seq:
13131 statement
13132 statement-seq [opt] statement */
13134 static void
13136 {
13139 bool in_omp_loop_block
13142 /* Scan statements until there aren't any more. */
13144 {
13147 /* If we are looking at a `}', then we have run out of
13148 statements; the same is true if we have reached the end
13149 of file, or have stumbled upon a stray '@end'. */
13156 /* If we are in a compound statement and find 'else' then
13157 something went wrong. */
13159 {
13162 else
13163 {
13166 }
13167 }
13169 /* Handle special cases for OMP FOR canonical loop syntax. */
13171 {
13175 {
13176 /* Found the nested loop. */
13180 }
13182 {
13183 /* Prior to implementing the OpenMP 5.1 syntax for canonical
13184 loop form, GCC used to accept an empty statements as not
13185 being intervening code. Continue to do that, as an
13186 extension. */
13187 /* FIXME: Maybe issue a warning or something here? */
13189 }
13191 /* The nested compound statement may contain the next loop, or
13192 it might just be intervening code. */
13193 {
13197 }
13198 else
13199 {
13200 /* This must be intervening code. */
13202 /* Defer calling check_omp_intervening_code on pragmas until
13203 cp_parser_statement, because we can't know until we parse
13204 it whether or not the pragma is a statement. */
13209 }
13211 }
13213 /* Parse the statement. */
13215 }
13216 }
13218 /* Return true if this is the C++20 version of range-based-for with
13219 init-statement. */
13221 static bool
13223 {
13226 /* Save tokens so that we can put them back. */
13229 /* There has to be an unnested ; followed by an unnested :. */
13232 CPP_SEMICOLON,
13236 /* We found the semicolon, eat it now. */
13239 /* Now look for ':' that is not nested in () or {}. */
13242 CPP_COLON,
13245 out:
13246 /* Roll back the tokens we skipped. */
13250 }
13252 /* Return true if we're looking at (init; cond), false otherwise. */
13254 static bool
13256 {
13257 /* Save tokens so that we can put them back. */
13260 /* Look for ';' that is not nested in () or {}. */
13263 CPP_SEMICOLON,
13266 /* Roll back the tokens we skipped. */
13270 }
13272 /* Parse a selection-statement.
13274 selection-statement:
13275 if ( init-statement [opt] condition ) statement
13276 if ( init-statement [opt] condition ) statement else statement
13277 switch ( init-statement [opt] condition ) statement
13279 Returns the new IF_STMT or SWITCH_STMT.
13281 If IF_P is not NULL, *IF_P is set to indicate whether the statement
13282 is a (possibly labeled) if statement which is not enclosed in
13283 braces and has an else clause. This is used to implement
13284 -Wparentheses.
13286 CHAIN is a vector of if-else-if conditions. This is used to implement
13287 -Wduplicated-cond. */
13289 static tree
13292 {
13295 token_indent_info guard_tinfo;
13300 /* Peek at the next token. */
13304 /* See what kind of keyword it is. */
13307 {
13310 {
13311 tree statement;
13312 tree condition;
13317 RID_CONSTEXPR))
13318 {
13323 "%<if constexpr%> only available with "
13325 }
13328 {
13330 RID_CONSTEVAL))
13334 RID_CONSTEVAL))
13335 {
13338 }
13339 }
13341 {
13345 "%<if consteval%> only available with "
13356 {
13359 }
13365 {
13366 location_t before_loc
13372 }
13376 /* If the next token is `else', parse the else-clause. */
13378 RID_ELSE))
13379 {
13383 /* Consume the `else' keyword. */
13389 {
13393 }
13397 guard_tinfo);
13400 {
13401 location_t before_loc
13406 }
13409 }
13413 {
13417 }
13421 }
13423 /* Look for the `('. */
13424 matching_parens parens;
13426 {
13429 }
13431 /* Begin the selection-statement. */
13433 {
13436 }
13437 else
13440 /* Parse the optional init-statement. */
13442 {
13443 tree decl;
13446 OPT_Wc__17_extensions,
13447 "init-statement in selection statements only available "
13450 /* A non-empty init-statement can have arbitrary side
13451 effects. */
13454 }
13456 /* Parse the condition. */
13458 /* Look for the `)'. */
13464 {
13468 /* Add the condition. */
13475 /* Parse the then-clause. */
13479 /* Outside a template, the non-selected branch of a constexpr
13480 if is a 'discarded statement', i.e. unevaluated. */
13485 {
13488 }
13491 guard_tinfo);
13498 {
13502 }
13504 /* If the next token is `else', parse the else-clause. */
13506 RID_ELSE))
13507 {
13511 {
13514 }
13516 guard_tinfo
13518 /* Consume the `else' keyword. */
13521 {
13523 RID_IF)
13525 {
13526 /* We've got "if (COND) else if (COND2)". Start
13527 the condition chain and add COND as the first
13528 element. */
13532 {
13533 /* Wrap it in a NOP_EXPR so that we can set the
13534 location of the condition. */
13536 condition);
13539 }
13540 }
13542 RID_IF))
13543 /* This is if-else without subsequent if. Zap the
13544 condition chain; we would have already warned at
13545 this point. */
13547 }
13549 /* Parse the else-clause. */
13555 /* If we are currently parsing a then-clause, then
13556 IF_P will not be NULL. We set it to true to
13557 indicate that this if statement has an else clause.
13558 This may trigger the Wparentheses warning below
13559 when we get back up to the parent if statement. */
13564 {
13568 }
13569 }
13570 else
13571 {
13572 /* This if statement does not have an else clause. If
13573 NESTED_IF is true, then the then-clause has an if
13574 statement which does have an else clause. We warn
13575 about the potential ambiguity. */
13578 "suggest explicit braces to avoid ambiguous"
13581 /* We don't need the condition chain anymore. */
13583 }
13585 /* Now we're all done with the if-statement. */
13587 }
13588 else
13589 {
13593 /* Add the condition. */
13596 /* Parse the body of the switch-statement. */
13602 guard_tinfo);
13606 /* Now we're all done with the switch-statement. */
13608 }
13611 }
13617 }
13618 }
13620 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
13621 If we have seen at least one decl-specifier, and the next token is not
13622 a parenthesis (after "int (" we might be looking at a functional cast)
13623 neither we are dealing with a concept-check expression then we must be
13624 looking at a declaration. */
13626 static void
13629 {
13638 }
13640 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
13641 The declarator shall not specify a function or an array. Returns
13642 TRUE if the declarator is valid, FALSE otherwise. */
13644 static bool
13647 location_t loc)
13648 {
13652 {
13657 else
13665 }
13666 else
13668 }
13670 /* Parse a condition.
13672 condition:
13673 expression
13674 type-specifier-seq declarator = initializer-clause
13675 type-specifier-seq declarator braced-init-list
13677 GNU Extension:
13679 condition:
13680 type-specifier-seq declarator asm-specification [opt]
13681 attributes [opt] = assignment-expression
13683 Returns the expression that should be tested. */
13685 static tree
13687 {
13688 cp_decl_specifier_seq type_specifiers;
13692 /* Try the declaration first. */
13694 /* New types are not allowed in the type-specifier-seq for a
13695 condition. */
13697 parser->type_definition_forbidden_message
13699 /* Parse the type-specifier-seq. */
13701 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
13704 /* Restore the saved message. */
13707 /* Gather the attributes that were provided with the
13708 decl-specifiers. */
13713 /* If all is well, we might be looking at a declaration. */
13715 {
13716 tree decl;
13717 tree asm_specification;
13718 tree attributes;
13723 /* Parse the declarator. */
13725 CP_PARSER_FLAGS_NONE,
13731 /* Parse the attributes. */
13733 /* Parse the asm-specification. */
13735 /* If the next token is not an `=' or '{', then we might still be
13736 looking at an expression. For example:
13738 if (A(a).x)
13740 looks like a decl-specifier-seq and a declarator -- but then
13741 there is no `=', so this is an expression. */
13746 /* If we did see an `=' or '{', then we are looking at a declaration
13747 for sure. */
13749 {
13750 tree pushed_scope;
13757 /* Create the declaration. */
13764 /* Parse the initializer. */
13766 {
13770 }
13772 {
13773 /* Consume the `='. */
13777 }
13778 else
13779 {
13782 }
13786 /* Process the initializer. */
13789 asm_specification,
13790 flags);
13796 }
13797 }
13798 /* If we didn't even get past the declarator successfully, we are
13799 definitely not looking at a declaration. */
13800 else
13803 /* Otherwise, we are looking at an expression. */
13805 }
13807 /* Parses a for-statement or range-for-statement until the closing ')',
13808 not included. */
13810 static tree
13813 {
13817 /* Begin the for-statement. */
13820 /* Maybe parse the optional init-statement in a range-based for loop. */
13822 /* Checked for diagnostic purposes only. */
13824 {
13825 tree dummy;
13828 {
13830 OPT_Wc__20_extensions,
13831 "range-based %<for%> loops with initializer only "
13834 }
13835 }
13837 /* Parse the initialization. */
13843 else
13845 }
13847 static tree
13850 {
13851 /* Normal for loop */
13854 tree stmt;
13857 /* The init-statement has already been parsed in
13858 cp_parser_init_statement, so no work is needed here. */
13861 /* If there's a condition, process it. */
13865 {
13869 }
13871 {
13875 }
13877 /* Look for the `;'. */
13880 /* If there's an expression, process it. */
13886 }
13888 /* Tries to parse a range-based for-statement:
13890 range-based-for:
13891 decl-specifier-seq declarator : expression
13893 The decl-specifier-seq declarator and the `:' are already parsed by
13894 cp_parser_init_statement. If processing_template_decl it returns a
13895 newly created RANGE_FOR_STMT; if not, it is converted to a
13896 regular FOR_STMT. */
13898 static tree
13902 {
13908 /* Get the range declaration momentarily out of the way so that
13909 the range expression doesn't clash with it. */
13911 {
13913 {
13915 /* For decomposition declaration get all of the corresponding
13916 declarations out of the way. */
13920 {
13928 {
13934 }
13935 }
13936 }
13938 {
13943 }
13944 }
13948 else
13951 /* Put the range declaration(s) back into scope. */
13953 {
13957 }
13959 /* finish_omp_for has its own code for the following, so just
13960 return the range_expr instead. */
13964 /* If in template, STMT is converted to a normal for-statement
13965 at instantiation. If not, it is done just ahead. */
13967 {
13979 /* do_auto_deduction doesn't mess with template init-lists. */
13982 }
13983 else
13984 {
13988 }
13990 }
13992 /* Subroutine of cp_convert_range_for: given the initializer expression,
13993 builds up the range temporary. */
13995 static tree
13997 {
13998 /* Find out the type deduced by the declaration
13999 `auto &&__range = range_expr'. */
14004 /* Create the __range variable. */
14011 }
14013 /* Used by cp_parser_range_for in template context: we aren't going to
14014 do a full conversion yet, but we still need to resolve auto in the
14015 type of the for-range-declaration if present. This is basically
14016 a shortcut version of cp_convert_range_for. */
14018 static void
14020 {
14023 {
14026 iter_type = (cp_parser_perform_range_for_lookup
14029 {
14031 iter_type);
14034 tf_warning_or_error);
14037 tf_warning_or_error,
14038 adc_variable_type);
14041 }
14042 }
14043 }
14045 /* Warns when the loop variable should be changed to a reference type to
14046 avoid unnecessary copying. I.e., from
14048 for (const auto x : range)
14050 where range returns a reference, to
14052 for (const auto &x : range)
14054 if this version doesn't make a copy.
14056 This function also warns when the loop variable is initialized with
14057 a value of a different type resulting in a copy:
14059 int arr[10];
14060 for (const double &x : arr)
14062 DECL is the RANGE_DECL; EXPR is the *__for_begin expression.
14063 This function is never called when processing_template_decl is on. */
14065 static void
14067 {
14079 {
14082 {
14083 auto_diagnostic_group d;
14085 "loop variable %qD of type %qT binds to a temporary "
14088 {
14090 TYPE_QUAL_CONST);
14095 }
14096 }
14098 }
14102 /* Since small trivially copyable types are cheap to copy, we suppress the
14103 warning for them. 64B is a common size of a cache line. */
14109 /* If we can initialize a reference directly, suggest that to avoid the
14110 copy. */
14113 {
14114 auto_diagnostic_group d;
14118 {
14122 }
14123 }
14124 }
14126 /* Converts a range-based for-statement into a normal
14127 for-statement, as per the definition.
14129 for (RANGE_DECL : RANGE_EXPR)
14130 BLOCK
14132 should be equivalent to:
14134 {
14135 auto &&__range = RANGE_EXPR;
14136 for (auto __begin = BEGIN_EXPR, __end = END_EXPR;
14137 __begin != __end;
14138 ++__begin)
14139 {
14140 RANGE_DECL = *__begin;
14141 BLOCK
14142 }
14143 }
14145 If RANGE_EXPR is an array:
14146 BEGIN_EXPR = __range
14147 END_EXPR = __range + ARRAY_SIZE(__range)
14148 Else if RANGE_EXPR has a member 'begin' or 'end':
14149 BEGIN_EXPR = __range.begin()
14150 END_EXPR = __range.end()
14151 Else:
14152 BEGIN_EXPR = begin(__range)
14153 END_EXPR = end(__range);
14155 If __range has a member 'begin' but not 'end', or vice versa, we must
14156 still use the second alternative (it will surely fail, however).
14157 When calling begin()/end() in the third alternative we must use
14158 argument dependent lookup, but always considering 'std' as an associated
14159 namespace. */
14161 tree
14165 {
14173 /* If an error happened previously do nothing or else a lot of
14174 unhelpful errors would be issued. */
14176 else
14177 {
14178 tree range_temp;
14182 /* Can't bind a reference to an array of runtime bound. */
14184 else
14185 {
14190 LOOKUP_ONLYCONVERTING);
14192 }
14195 }
14197 /* The new for initialization statement. */
14199 iter_type);
14205 LOOKUP_ONLYCONVERTING);
14215 LOOKUP_ONLYCONVERTING);
14219 /* The new for condition. */
14226 /* The new increment expression. */
14229 tf_warning_or_error);
14232 /* The declaration is initialized with *__begin inside the loop body. */
14244 }
14246 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
14247 We need to solve both at the same time because the method used
14248 depends on the existence of members begin or end.
14249 Returns the type deduced for the iterator expression. */
14251 static tree
14253 {
14255 {
14258 }
14261 {
14266 }
14268 {
14269 /* If RANGE is an array, we will use pointer arithmetic. */
14272 range,
14276 }
14277 else
14278 {
14279 /* If it is not an array, we must do a bit of magic. */
14289 tf_warning_or_error);
14292 tf_warning_or_error);
14295 {
14296 /* Use the member functions. */
14299 }
14300 else
14301 {
14302 /* Use global functions with ADL. */
14303 releasing_vec vec;
14308 tf_warning_or_error);
14310 tf_warning_or_error);
14312 tf_warning_or_error);
14314 tf_warning_or_error);
14315 }
14317 /* Last common checks. */
14319 {
14320 /* If one of the expressions is an error do no more checks. */
14323 }
14326 /* Can happen, when, eg, in a template context, Koenig lookup
14327 can't resolve begin/end (c++/58503). */
14329 else
14330 {
14332 /* The unqualified type of the __begin and __end temporaries should
14333 be the same, as required by the multiple auto declaration. */
14335 {
14342 /* P0184R0 allows __begin and __end to have different types,
14343 but make sure they are comparable so we can give a better
14345 else
14349 }
14351 }
14352 }
14353 }
14355 /* Helper function for cp_parser_perform_range_for_lookup.
14356 Builds a tree for RANGE.IDENTIFIER(). */
14358 static tree
14360 {
14368 releasing_vec vec;
14372 tf_warning_or_error);
14374 }
14376 /* Parse an iteration-statement.
14378 iteration-statement:
14379 while ( condition ) statement
14380 do statement while ( expression ) ;
14381 for ( init-statement condition [opt] ; expression [opt] )
14382 statement
14384 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
14386 static tree
14389 {
14392 tree statement;
14394 token_indent_info guard_tinfo;
14396 /* Peek at the next token. */
14403 /* Remember whether or not we are already within an iteration
14404 statement. */
14407 /* Special case for OMP loop intervening code. Parsing of permitted
14408 collapsed loop nests is handled elsewhere. */
14410 {
14414 }
14416 /* See what kind of keyword it is. */
14419 {
14421 {
14422 tree condition;
14424 /* Begin the while-statement. */
14426 /* Look for the `('. */
14427 matching_parens parens;
14429 /* Parse the condition. */
14432 /* Look for the `)'. */
14434 /* Parse the dependent statement. */
14440 /* We're done with the while-statement. */
14442 }
14446 {
14447 tree expression;
14449 /* Begin the do-statement. */
14451 /* Parse the body of the do-statement. */
14458 /* Look for the `while' keyword. */
14460 /* Look for the `('. */
14461 matching_parens parens;
14463 /* Parse the expression. */
14465 /* We're done with the do-statement. */
14467 /* Look for the `)'. */
14469 /* Look for the `;'. */
14471 }
14475 {
14476 /* Look for the `('. */
14477 matching_parens parens;
14482 /* Look for the `)'. */
14485 /* Parse the body of the for-statement. */
14492 /* We're done with the for-statement. */
14494 }
14501 }
14504 }
14506 /* Parse an init-statement or the declarator of a range-based-for.
14507 Returns true if a range-based-for declaration is seen.
14509 init-statement:
14510 expression-statement
14511 simple-declaration
14512 alias-declaration */
14514 static bool
14516 {
14517 /* If the next token is a `;', then we have an empty
14518 expression-statement. Grammatically, this is also a
14519 simple-declaration, but an invalid one, because it does not
14520 declare anything. Therefore, if we did not handle this case
14521 specially, we would issue an error message about an invalid
14522 declaration. */
14524 {
14528 /* A colon is used in range-based for. */
14531 /* We're going to speculatively look for a declaration, falling back
14532 to an expression, if necessary. */
14536 {
14542 OPT_Wc__23_extensions,
14543 "alias-declaration in init-statement only "
14545 }
14546 else
14547 /* Parse the declaration. */
14550 decl);
14553 {
14554 /* It is a range-for, consume the ':'. */
14559 OPT_Wc__11_extensions,
14560 "range-based %<for%> loops only available with "
14562 }
14564 /* The ';' is not consumed yet because we told
14565 cp_parser_simple_declaration not to. */
14570 /* If the tentative parse failed, then we shall need to look for an
14571 expression-statement. */
14572 }
14573 /* If we are here, it is an expression-statement. */
14576 }
14578 /* Parse a jump-statement.
14580 jump-statement:
14581 break ;
14582 continue ;
14583 return expression [opt] ;
14584 return braced-init-list ;
14585 coroutine-return-statement;
14586 goto identifier ;
14588 GNU extension:
14590 jump-statement:
14591 goto * expression ;
14593 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
14595 static tree
14597 {
14603 /* Peek at the next token. */
14608 /* See what kind of keyword it is. */
14611 {
14615 {
14632 }
14638 {
14642 /* Fall through. */
14652 }
14658 {
14659 tree expr;
14662 {
14666 }
14669 else
14670 /* If the next token is a `;', then there is no
14671 expression. */
14673 /* Build the return-statement, check co-return first, since type
14674 deduction is not valid there. */
14679 else
14681 /* Look for the final `;'. */
14683 }
14690 {
14694 }
14696 /* Create the goto-statement. */
14698 {
14699 /* Issue a warning about this use of a GNU extension. */
14701 /* Consume the '*' token. */
14703 /* Parse the dependent expression. */
14705 }
14706 else
14708 /* Look for the final `;'. */
14715 }
14718 }
14720 /* Parse a declaration-statement.
14722 declaration-statement:
14723 block-declaration */
14725 static void
14727 {
14730 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14733 /* Parse the block-declaration. */
14736 /* Free any declarators allocated. */
14738 }
14740 /* Some dependent statements (like `if (cond) statement'), are
14741 implicitly in their own scope. In other words, if the statement is
14742 a single statement (as opposed to a compound-statement), it is
14743 none-the-less treated as if it were enclosed in braces. Any
14744 declarations appearing in the dependent statement are out of scope
14745 after control passes that point. This function parses a statement,
14746 but ensures that is in its own scope, even if it is not a
14747 compound-statement.
14749 If IF_P is not NULL, *IF_P is set to indicate whether the statement
14750 is a (possibly labeled) if statement which is not enclosed in
14751 braces and has an else clause. This is used to implement
14752 -Wparentheses.
14754 CHAIN is a vector of if-else-if conditions. This is used to implement
14755 -Wduplicated-cond.
14757 Returns the new statement. */
14759 static tree
14763 {
14764 tree statement;
14767 token_indent_info body_tinfo
14773 /* Mark if () ; with a special NOP_EXPR. */
14775 {
14786 }
14787 /* if a compound is opened, we simply parse the statement directly. */
14790 /* If the token is not a `{', then we must take special action. */
14791 else
14792 {
14793 /* Create a compound-statement. */
14795 /* Parse the dependent-statement. */
14798 /* Finish the dummy compound-statement. */
14800 }
14802 token_indent_info next_tinfo
14811 /* Return the statement. */
14813 }
14815 /* For some dependent statements (like `while (cond) statement'), we
14816 have already created a scope. Therefore, even if the dependent
14817 statement is a compound-statement, we do not want to create another
14818 scope. */
14820 static void
14823 {
14824 /* If the token is a `{', then we must take special action. */
14826 {
14827 token_indent_info body_tinfo
14833 token_indent_info next_tinfo
14842 }
14843 else
14844 {
14845 /* Avoid calling cp_parser_compound_statement, so that we
14846 don't create a new scope. Do everything else by hand. */
14847 matching_braces braces;
14849 /* If the next keyword is `__label__' we have a label declaration. */
14852 /* Parse an (optional) statement-seq. */
14855 }
14856 }
14858 /* Modules */
14860 /* Parse a module-name,
14861 identifier
14862 module-name . identifier
14863 header-name
14865 Returns a pointer to module object, NULL. */
14869 {
14872 {
14876 }
14881 {
14884 }
14887 {
14889 {
14892 }
14903 }
14906 }
14908 /* Named module-declaration
14909 __module ; PRAGMA_EOL
14910 __module private ; PRAGMA_EOL (unimplemented)
14911 [__export] __module module-name attr-spec-seq-opt ; PRAGMA_EOL
14912 */
14914 static module_parse
14917 {
14918 /* We're a pseudo pragma. */
14923 {
14927 }
14930 {
14931 /* Start global module fragment. */
14936 }
14941 {
14949 {
14952 }
14953 else
14955 "private module fragment only permitted in purview"
14957 }
14959 {
14960 /* Neither the first declaration, nor in a GMF. */
14963 skip_eol:
14965 }
14966 else
14967 {
14977 }
14980 }
14982 /* Import-declaration
14983 [__export] __import module-name attr-spec-seq-opt ; PRAGMA_EOL */
14985 static void
14988 {
14989 /* We're a pseudo pragma. */
14994 {
14997 note_lexer:
14999 " disambiguation, to prevent this being considered a"
15001 skip_eol:
15003 }
15005 {
15008 }
15009 else
15010 {
15023 {
15024 /* Module-purview imports must not be from source inclusion
15025 [cpp.import]/7 */
15034 }
15037 }
15038 }
15040 /* export-declaration.
15042 export declaration
15043 export { declaration-seq-opt } */
15045 static void
15047 {
15066 {
15073 }
15074 else
15075 {
15076 /* Explicitly check if the next tokens might be a
15077 module-directive line, so we can give a clearer error message
15078 about why the directive will be rejected. */
15085 }
15088 }
15090 /* Declarations [gram.dcl.dcl] */
15092 /* Parse an optional declaration-sequence. TOP_LEVEL is true, if this
15093 is the top-level declaration sequence. That affects whether we
15094 deal with module-preamble.
15096 declaration-seq:
15097 declaration
15098 declaration-seq declaration */
15100 static void
15102 {
15104 {
15110 else
15112 }
15113 }
15115 /* Parse a declaration.
15117 declaration:
15118 block-declaration
15119 function-definition
15120 template-declaration
15121 explicit-instantiation
15122 explicit-specialization
15123 linkage-specification
15124 namespace-definition
15126 C++17:
15127 deduction-guide
15129 modules:
15130 (all these are only allowed at the outermost level, check
15131 that semantically, for better diagnostics)
15132 module-declaration
15133 module-export-declaration
15134 module-import-declaration
15135 export-declaration
15137 GNU extension:
15139 declaration:
15140 __extension__ declaration */
15142 static void
15144 {
15147 /* Check for the `__extension__' keyword. */
15149 {
15150 /* Parse the qualified declaration. */
15152 /* Restore the PEDANTIC flag. */
15156 }
15158 /* Try to figure out what kind of declaration is present. */
15164 {
15166 /* A declaration consisting of a single semicolon is invalid
15167 * before C++11. Allow it unless we're being pedantic. */
15171 }
15175 CPP_SEMICOLON))
15176 {
15181 {
15184 std_attrs);
15186 {
15189 {
15191 CPP_PRAGMA));
15193 }
15195 }
15196 }
15204 }
15206 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
15211 /* Conditionally, allow attributes to precede a linkage specification. */
15213 {
15221 {
15223 /* We might have already been here. */
15225 {
15233 }
15236 }
15237 else
15238 {
15241 }
15242 }
15243 /* If we already had some attributes, and we've added more, then prepend.
15244 Otherwise attributes just contains any that we just read. */
15246 {
15250 }
15252 /* If the next token is `extern' and the following token is a string
15253 literal, then we have a linkage specification. */
15257 /* If the next token is `template', then we have either a template
15258 declaration, an explicit instantiation, or an explicit
15259 specialization. */
15261 {
15262 /* `template <>' indicates a template specialization. */
15266 /* `template <' indicates a template declaration. */
15269 /* Anything else must be an explicit instantiation. */
15270 else
15272 }
15273 /* If the next token is `export', it's new-style modules or
15274 old-style template. */
15276 {
15279 else
15281 }
15283 {
15288 // In module purview this will be ill-formed.
15294 else
15296 }
15297 /* If the next token is `extern', 'static' or 'inline' and the one
15298 after that is `template', we have a GNU extended explicit
15299 instantiation directive. */
15306 /* If the next token is `namespace', check for a named or unnamed
15307 namespace definition. */
15316 /* An unnamed namespace definition. */
15320 /* An inline (associated) namespace definition. */
15324 /* Objective-C++ declaration/definition. */
15331 /* At this point we may have a template declared by a concept
15332 introduction. */
15337 else
15338 /* Try to parse a block-declaration, or a function-definition. */
15341 /* Free any declarators allocated. */
15343 }
15345 /* Parse a namespace-scope declaration. */
15347 static void
15349 {
15353 /* A top-level declaration can consist solely of a #pragma. A
15354 nested declaration cannot, so this is done here and not in
15355 cp_parser_declaration. (A #pragma at block scope is
15356 handled in cp_parser_statement.) */
15358 else
15359 /* Parse the declaration itself. */
15361 }
15363 /* Parse a block-declaration.
15365 block-declaration:
15366 simple-declaration
15367 asm-definition
15368 namespace-alias-definition
15369 using-declaration
15370 using-directive
15372 GNU Extension:
15374 block-declaration:
15375 __extension__ block-declaration
15377 C++0x Extension:
15379 block-declaration:
15380 static_assert-declaration
15382 If STATEMENT_P is TRUE, then this block-declaration is occurring as
15383 part of a declaration-statement. */
15385 static void
15388 {
15391 /* Check for the `__extension__' keyword. */
15393 {
15394 /* Parse the qualified declaration. */
15396 /* Restore the PEDANTIC flag. */
15400 }
15402 /* Peek at the next token to figure out which kind of declaration is
15403 present. */
15407 /* If the next keyword is `asm', we have an asm-definition. */
15409 {
15413 }
15414 /* If the next keyword is `namespace', we have a
15415 namespace-alias-definition. */
15418 /* If the next keyword is `using', we have a
15419 using-declaration, a using-directive, or an alias-declaration. */
15421 {
15426 /* If the token after `using' is `namespace', then we have a
15427 using-directive. */
15433 /* If the second token after 'using' is '=', then we have an
15434 alias-declaration. */
15440 /* Otherwise, it's a using-declaration. */
15441 else
15444 }
15445 /* If the next keyword is `__label__' we have a misplaced label
15446 declaration. */
15448 {
15452 /* If the next token is now a `;', consume it. */
15455 }
15456 /* If the next token is `static_assert' we have a static assertion. */
15459 /* If the next tokens after attributes is `using namespace', then we have
15460 a using-directive. */
15463 RID_USING)
15465 RID_NAMESPACE))
15466 {
15470 }
15471 /* Anything else must be a simple-declaration. */
15472 else
15475 }
15477 /* Parse a simple-declaration.
15479 simple-declaration:
15480 decl-specifier-seq [opt] init-declarator-list [opt] ;
15481 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15482 brace-or-equal-initializer ;
15484 init-declarator-list:
15485 init-declarator
15486 init-declarator-list , init-declarator
15488 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
15489 function-definition as a simple-declaration.
15491 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15492 parsed declaration if it is an uninitialized single declarator not followed
15493 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15494 if present, will not be consumed. */
15496 static void
15500 {
15501 cp_decl_specifier_seq decl_specifiers;
15510 /* Defer access checks until we know what is being declared; the
15511 checks for names appearing in the decl-specifier-seq should be
15512 done as if we were in the scope of the thing being declared. */
15515 /* Parse the decl-specifier-seq. We have to keep track of whether
15516 or not the decl-specifier-seq declares a named class or
15517 enumeration type, since that is the only case in which the
15518 init-declarator-list is allowed to be empty.
15520 [dcl.dcl]
15522 In a simple-declaration, the optional init-declarator-list can be
15523 omitted only when declaring a class or enumeration, that is when
15524 the decl-specifier-seq contains either a class-specifier, an
15525 elaborated-type-specifier, or an enum-specifier. */
15527 CP_PARSER_FLAGS_OPTIONAL,
15530 /* We no longer need to defer access checks. */
15533 cp_omp_declare_simd_data odsd;
15539 /* In a block scope, a valid declaration must always have a
15540 decl-specifier-seq. By not trying to parse declarators, we can
15541 resolve the declaration/expression ambiguity more quickly. */
15544 {
15547 }
15549 /* If the next two tokens are both identifiers, the code is
15550 erroneous. The usual cause of this situation is code like:
15552 T t;
15554 where "T" should name a type -- but does not. */
15557 {
15558 /* If parsing tentatively, we should commit; we really are
15559 looking at a declaration. */
15561 /* Give up. */
15563 }
15567 /* Look for C++17 decomposition declaration. */
15575 {
15576 tree decl
15578 maybe_range_for_decl,
15581 /* The next token should be either a `,' or a `;'. */
15583 /* If it's a `;', we are done. */
15587 {
15591 }
15592 /* Anything else is an error. */
15593 else
15594 {
15595 /* If we have already issued an error message we don't need
15596 to issue another one. */
15601 /* Skip tokens until we reach the end of the statement. */
15603 /* If the next token is now a `;', consume it. */
15607 }
15608 }
15609 else
15612 tree last_type;
15614 /* NULL_TREE if both variable and function declaration are allowed,
15615 error_mark_node if function declaration are not allowed and
15616 a FUNCTION_DECL that should be diagnosed if it is followed by
15617 variable declarations. */
15618 tree auto_function_declaration;
15621 auto_specifier_p
15625 /* Keep going until we hit the `;' at the end of the simple
15626 declaration. */
15629 CPP_SEMICOLON))
15630 {
15633 tree decl;
15637 {
15638 /* If we are processing next declarator, comma is expected */
15643 {
15647 }
15648 }
15649 else
15652 /* Parse the init-declarator. */
15654 CP_PARSER_FLAGS_NONE,
15657 function_definition_allowed_p,
15659 declares_class_or_enum,
15661 maybe_range_for_decl,
15664 /* If an error occurred while parsing tentatively, exit quickly.
15665 (That usually happens when in the body of a function; each
15666 statement is treated as a declaration-statement until proven
15667 otherwise.) */
15672 {
15673 /* If the init-declarator-list contains more than one
15674 init-declarator, they shall all form declarations of
15675 variables. */
15677 auto_function_declaration
15681 {
15683 "non-variable %qD in declaration with more than one "
15688 }
15689 }
15693 {
15697 {
15698 /* If the list of declarators contains more than one declarator,
15699 the type of each declared variable is determined as described
15700 above. If the type deduced for the template parameter U is not
15701 the same in each deduction, the program is ill-formed. */
15706 }
15707 else
15709 }
15711 /* Handle function definitions specially. */
15713 {
15714 /* If the next token is a `,', then we are probably
15715 processing something like:
15717 void f() {}, *p;
15719 which is erroneous. */
15721 {
15724 "mixing"
15726 }
15727 /* Otherwise, we're done with the list of declarators. */
15728 else
15729 {
15733 }
15734 }
15737 /* The next token should be either a `,' or a `;'. */
15739 /* If it's a `,', there are more declarators to come. */
15742 /* If it's a `;', we are done. */
15746 {
15751 }
15752 /* Anything else is an error. */
15753 else
15754 {
15755 /* If we have already issued an error message we don't need
15756 to issue another one. */
15761 /* Skip tokens until we reach the end of the statement. */
15763 /* If the next token is now a `;', consume it. */
15767 }
15768 /* After the first time around, a function-definition is not
15769 allowed -- even if it was OK at first. For example:
15771 int i, f() {}
15773 is not valid. */
15775 }
15777 /* Issue an error message if no declarators are present, and the
15778 decl-specifier-seq does not itself declare a class or
15779 enumeration: [dcl.dcl]/3. */
15781 {
15783 {
15787 /* Ensure an error is issued anyway when finish_decltype_type,
15788 called via cp_parser_decl_specifier_seq, returns a class or
15789 an enumeration (c++/51786). */
15792 }
15793 /* Perform any deferred access checks. */
15795 }
15797 /* Consume the `;'. */
15798 finish:
15802 {
15808 }
15810 done:
15813 }
15815 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
15816 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15817 initializer ; */
15819 static tree
15824 {
15829 /* Parse the identifier-list. */
15833 {
15841 }
15845 {
15851 else
15852 {
15855 }
15856 }
15860 "structured bindings only available with "
15863 tree pushed_scope;
15870 NULL_TREE);
15877 cp_expr e;
15878 cp_decl_specifier_seq decl_specs;
15883 {
15887 else
15888 {
15891 }
15892 tree elt_pushed_scope;
15898 {
15899 /* Ensure we've diagnosed redeclaration if we aren't creating
15900 a new VAR_DECL. */
15903 }
15904 else
15908 }
15911 {
15914 }
15918 {
15926 || (is_direct_init
15929 {
15933 }
15936 {
15942 }
15943 }
15945 {
15948 /* Ensure DECL_VALUE_EXPR is created for all the decls but
15949 the underlying DECL. */
15951 }
15957 {
15960 }
15963 }
15965 /* Names of storage classes. */
15968 cp_storage_class_name[] = {
15970 };
15972 /* Parse a decl-specifier-seq.
15974 decl-specifier-seq:
15975 decl-specifier-seq [opt] decl-specifier
15976 decl-specifier attribute-specifier-seq [opt] (C++11)
15978 decl-specifier:
15979 storage-class-specifier
15980 type-specifier
15981 function-specifier
15982 friend
15983 typedef
15985 GNU Extension:
15987 decl-specifier:
15988 attributes
15990 Concepts Extension:
15992 decl-specifier:
15993 concept
15995 Set *DECL_SPECS to a representation of the decl-specifier-seq.
15997 The parser flags FLAGS is used to control type-specifier parsing.
15999 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
16000 flags:
16002 1: one of the decl-specifiers is an elaborated-type-specifier
16003 (i.e., a type declaration)
16004 2: one of the decl-specifiers is an enum-specifier or a
16005 class-specifier (i.e., a type definition)
16007 */
16009 static void
16011 cp_parser_flags flags,
16014 {
16018 cp_decl_spec ds;
16020 /* Clear DECL_SPECS. */
16023 /* Assume no class or enumeration type is declared. */
16026 /* Keep reading specifiers until there are no more to read. */
16028 {
16033 /* Peek at the next token. */
16036 /* Save the first token of the decl spec list for error
16037 reporting. */
16040 /* Handle attributes. */
16043 {
16044 /* Parse the attributes. */
16047 /* In a sequence of declaration specifiers, c++11 attributes
16048 appertain to the type that precede them. In that case
16049 [dcl.spec]/1 says:
16051 The attribute-specifier-seq affects the type only for
16052 the declaration it appears in, not other declarations
16053 involving the same type.
16055 But for now let's force the user to position the
16056 attribute either at the beginning of the declaration or
16057 after the declarator-id, which would clearly mean that it
16058 applies to the declarator. */
16060 {
16062 /* The c++11 attribute is at the beginning of the
16063 declaration. It appertains to the entity being
16065 else
16066 {
16068 {
16071 }
16073 {
16074 /* This is an attribute following a
16075 class-specifier. */
16080 }
16081 else
16082 {
16083 decl_specs->std_attributes
16087 }
16089 }
16090 }
16092 decl_specs->attributes
16097 }
16098 /* Assume we will find a decl-specifier keyword. */
16100 /* If the next token is an appropriate keyword, we can simply
16101 add it to the list. */
16103 {
16104 /* decl-specifier:
16105 friend
16106 constexpr
16107 constinit */
16110 {
16115 }
16116 else
16117 {
16119 /* Consume the token. */
16121 }
16146 /* Warn for concept as a decl-specifier. We'll rewrite these as
16147 concept declarations later. */
16149 {
16154 else
16157 }
16159 /* In C++20 a concept definition is just 'concept name = expr;'
16160 Support that syntax as a TS extension by pretending we've seen
16161 the 'bool' specifier. */
16165 {
16169 }
16172 /* function-specifier:
16173 inline
16174 virtual
16175 explicit */
16182 /* decl-specifier:
16183 typedef */
16186 /* Consume the token. */
16192 /* A constructor declarator cannot appear in a typedef. */
16194 /* The "typedef" keyword can only occur in a declaration; we
16195 may as well commit at this point. */
16199 {
16209 }
16212 /* storage-class-specifier:
16213 auto
16214 register
16215 static
16216 extern
16217 mutable
16219 GNU Extension:
16220 thread */
16223 {
16224 /* Consume the token. */
16227 /* Complain about `auto' as a storage specifier, if
16228 we're complaining about C++0x compatibility. */
16232 "%<auto%> changes meaning in C++11; "
16235 /* Set the storage class anyway. */
16237 token);
16238 }
16239 else
16240 /* C++0x auto type-specifier. */
16248 /* Consume the token. */
16251 token);
16254 /* Consume the token. */
16260 /* We did not yet find a decl-specifier yet. */
16263 }
16275 {
16281 "%qD only valid in lambda with %<-std=c++23%> or "
16283 }
16288 /* Constructors are a special case. The `S' in `S()' is not a
16289 decl-specifier; it is the beginning of the declarator. */
16290 constructor_p
16291 = (!found_decl_spec
16292 && constructor_possible_p
16293 && (cp_parser_constructor_declarator_p
16295 ds_friend))));
16297 /* If we don't have a DECL_SPEC yet, then we must be looking at
16298 a type-specifier. */
16300 {
16303 tree type_spec;
16308 type_spec
16310 decl_specs,
16316 /* If this type-specifier referenced a user-defined type
16317 (a typedef, class-name, etc.), then we can't allow any
16318 more such type-specifiers henceforth.
16320 [dcl.spec]
16322 The longest sequence of decl-specifiers that could
16323 possibly be a type name is taken as the
16324 decl-specifier-seq of a declaration. The sequence shall
16325 be self-consistent as described below.
16327 [dcl.type]
16329 As a general rule, at most one type-specifier is allowed
16330 in the complete decl-specifier-seq of a declaration. The
16331 only exceptions are the following:
16333 -- const or volatile can be combined with any other
16334 type-specifier.
16336 -- signed or unsigned can be combined with char, long,
16337 short, or int.
16339 -- ..
16341 Example:
16343 typedef char* Pc;
16344 void g (const int Pc);
16346 Here, Pc is *not* part of the decl-specifier seq; it's
16347 the declarator. Therefore, once we see a type-specifier
16348 (other than a cv-qualifier), we forbid any additional
16349 user-defined types. We *do* still allow things like `int
16350 int' to be considered a decl-specifier-seq, and issue the
16351 error message later. */
16354 /* A constructor declarator cannot follow a type-specifier. */
16356 {
16364 }
16365 }
16367 /* If we still do not have a DECL_SPEC, then there are no more
16368 decl-specifiers. */
16373 {
16377 "standard attributes must precede the decl-specifiers to "
16378 "apply to the declaration, or follow them to apply to "
16380 }
16383 /* After we see one decl-specifier, further decl-specifiers are
16384 always optional. */
16386 }
16388 /* Don't allow a friend specifier with a class definition. */
16393 }
16395 /* Parse an (optional) storage-class-specifier.
16397 storage-class-specifier:
16398 auto
16399 register
16400 static
16401 extern
16402 mutable
16404 GNU Extension:
16406 storage-class-specifier:
16407 thread
16409 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
16411 static tree
16413 {
16415 {
16419 /* Fall through for C++98. */
16427 /* Consume the token. */
16432 }
16433 }
16435 /* Parse an (optional) function-specifier.
16437 function-specifier:
16438 inline
16439 virtual
16440 explicit
16442 C++20 Extension:
16443 explicit(constant-expression)
16445 Returns an IDENTIFIER_NODE corresponding to the keyword used.
16446 Updates DECL_SPECS, if it is non-NULL. */
16448 static tree
16451 {
16454 {
16460 /* 14.5.2.3 [temp.mem]
16462 A member function template shall not be virtual. */
16466 else
16471 {
16473 /* If we see '(', it's C++20 explicit(bool). */
16474 tree expr;
16476 {
16477 matching_parens parens;
16480 /* New types are not allowed in an explicit-specifier. */
16483 parser->type_definition_forbidden_message
16488 "%<explicit(bool)%> only available with %<-std=c++20%> "
16491 /* Parse the constant-expression. */
16494 /* Restore the saved message. */
16497 }
16498 else
16499 /* The explicit-specifier explicit without a constant-expression is
16500 equivalent to the explicit-specifier explicit(true). */
16503 /* [dcl.fct.spec]
16504 "the constant-expression, if supplied, shall be a contextually
16505 converted constant expression of type bool." */
16507 /* We could evaluate it -- mark the decl as appropriate. */
16513 /* The expression was value-dependent. Remember it so that we can
16514 substitute it later. */
16517 }
16521 }
16523 /* Consume the token. */
16525 }
16527 /* Parse a linkage-specification.
16529 linkage-specification:
16530 extern string-literal { declaration-seq [opt] }
16531 extern string-literal declaration */
16533 static void
16535 {
16536 /* Look for the `extern' keyword. */
16537 cp_token *extern_token
16540 /* Look for the string-literal. */
16545 /* Transform the literal into an identifier. If the literal is a
16546 wide-character string, or contains embedded NULs, then we can't
16547 handle it as the user wants. */
16551 {
16553 /* Assume C++ linkage. */
16555 }
16556 else
16559 /* We're now using the new linkage. */
16564 /* Preserve the location of the innermost linkage specification,
16565 tracking the locations of nested specifications via a local. */
16566 location_t saved_location
16568 /* Construct a location ranging from the start of the "extern" to
16569 the end of the string-literal, with the caret at the start, e.g.:
16570 extern "C" {
16571 ^~~~~~~~~~
16572 */
16573 parser->innermost_linkage_specification_location
16578 /* If the next token is a `{', then we're using the first
16579 production. */
16581 {
16585 /* Consume the `{' token. */
16586 matching_braces braces;
16588 /* Parse the declarations. */
16590 /* Look for the closing `}'. */
16592 }
16593 /* Otherwise, there's just one declaration. */
16594 else
16595 {
16598 saved_in_unbraced_linkage_specification_p
16602 parser->in_unbraced_linkage_specification_p
16604 }
16606 /* We're done with the linkage-specification. */
16610 /* Restore location of parent linkage specification, if any. */
16612 }
16614 /* Parse a static_assert-declaration.
16616 static_assert-declaration:
16617 static_assert ( constant-expression , string-literal ) ;
16618 static_assert ( constant-expression ) ; (C++17)
16620 If MEMBER_P, this static_assert is a class member. */
16622 static void
16624 {
16625 cp_expr condition;
16626 location_t token_loc;
16627 tree message;
16629 /* Peek at the `static_assert' token so we can keep track of exactly
16630 where the static assertion started. */
16633 /* Look for the `static_assert' keyword. */
16635 RT_STATIC_ASSERT))
16638 /* We know we are in a static assertion; commit to any tentative
16639 parse. */
16643 /* Parse the `(' starting the static assertion condition. */
16644 matching_parens parens;
16647 /* Parse the constant-expression. Allow a non-constant expression
16648 here in order to give better diagnostics in finish_static_assert. */
16649 condition =
16655 {
16658 "%<static_assert%> without a message "
16660 /* Eat the ')' */
16665 }
16666 else
16667 {
16668 /* Parse the separating `,'. */
16671 /* Parse the string-literal message. */
16675 /* A `)' completes the static assertion. */
16681 }
16683 /* A semicolon terminates the declaration. */
16686 /* Get the location for the static assertion. Use that of the
16687 condition if available, otherwise, use that of the "static_assert"
16688 token. */
16693 /* Complete the static assertion, which may mean either processing
16694 the static assert now or saving it for template instantiation. */
16697 }
16699 /* Parse the expression in decltype ( expression ). */
16701 static tree
16704 {
16706 tree expr;
16708 /* First, try parsing an id-expression. */
16719 {
16722 cp_id_kind idk;
16726 /* Lookup the name we got back from the id-expression. */
16736 {
16737 /* Complete lookup of the id-expression. */
16738 expr = (finish_id_expression
16751 {
16752 /* We found an id-expression, but it was something that we
16753 should not have found. This is an error, not something
16754 we can recover from, so report the error we found and
16755 we'll recover as gracefully as possible. */
16760 }
16761 }
16766 /* We have an id-expression. */
16768 }
16771 {
16772 /* Abort the id-expression parse. */
16775 /* Parsing tentatively, again. */
16778 /* Parse a class member access. */
16786 /* We have an id-expression. */
16788 }
16791 /* We have parsed the complete id-expression or member access. */
16793 else
16794 {
16795 /* Abort our attempt to parse an id-expression or member access
16796 expression. */
16799 /* Parse a full expression. */
16802 }
16805 }
16807 /* Parse a `decltype' type. Returns the type.
16809 decltype-specifier:
16810 decltype ( expression )
16811 C++14:
16812 decltype ( auto ) */
16814 static tree
16816 {
16821 {
16822 /* Already parsed. */
16825 }
16827 /* Look for the `decltype' token. */
16831 /* Parse the opening `('. */
16832 matching_parens parens;
16836 /* Since we're going to preserve any side-effects from this parse, set up a
16837 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16838 in the expression. */
16841 /* If in_declarator_p, a reparse as an expression might succeed (60361).
16842 Otherwise, commit now for better diagnostics. */
16853 {
16854 /* decltype (auto) */
16857 {
16859 "%<decltype(auto)%> type specifier only available with "
16862 }
16863 }
16864 else
16865 {
16866 /* decltype (expression) */
16868 /* Types cannot be defined in a `decltype' expression. Save away the
16869 old message and set the new one. */
16871 parser->type_definition_forbidden_message
16874 /* The restrictions on constant-expressions do not apply inside
16875 decltype expressions. */
16876 bool saved_integral_constant_expression_p
16878 bool saved_non_integral_constant_expression_p
16882 /* Within a parenthesized expression, a `>' token is always
16883 the greater-than operator. */
16884 bool saved_greater_than_is_operator_p
16888 /* Don't synthesize an implicit template type parameter here. This
16889 could happen with C++23 code like
16891 void f(decltype(new auto{0}));
16893 where we want to deduce the auto right away so that the parameter
16894 is of type 'int *'. */
16898 /* Do not actually evaluate the expression. */
16901 /* Do not warn about problems with the expression. */
16907 /* Go back to evaluating expressions. */
16911 /* The `>' token might be the end of a template-id or
16912 template-parameter-list now. */
16913 parser->greater_than_is_operator_p
16916 /* Restore the old message and the integral constant expression
16917 flags. */
16919 parser->integral_constant_expression_p
16921 parser->non_integral_constant_expression_p
16923 }
16925 /* Parse to the closing `)'. */
16927 {
16931 }
16933 /* If we got a parse error while tentative, bail out now. */
16935 {
16938 }
16941 /* Build auto. */
16943 else
16945 tf_warning_or_error);
16947 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
16948 it again. */
16965 }
16967 /* Special member functions [gram.special] */
16969 /* Parse a conversion-function-id.
16971 conversion-function-id:
16972 operator conversion-type-id
16974 Returns an IDENTIFIER_NODE representing the operator. */
16976 static tree
16978 {
16979 tree type;
16980 tree saved_scope;
16981 tree saved_qualifying_scope;
16982 tree saved_object_scope;
16985 /* Look for the `operator' token. */
16988 /* When we parse the conversion-type-id, the current scope will be
16989 reset. However, we need that information in able to look up the
16990 conversion function later, so we save it here. */
16994 /* We must enter the scope of the class so that the names of
16995 entities declared within the class are available in the
16996 conversion-type-id. For example, consider:
16998 struct S {
16999 typedef int I;
17000 operator I();
17001 };
17003 S::operator I() { ... }
17005 In order to see that `I' is a type-name in the definition, we
17006 must be in the scope of `S'. */
17009 /* Parse the conversion-type-id. */
17011 /* Leave the scope of the class, if any. */
17014 /* Restore the saved scope. */
17018 /* If the TYPE is invalid, indicate failure. */
17022 }
17024 /* Parse a conversion-type-id:
17026 conversion-type-id:
17027 type-specifier-seq conversion-declarator [opt]
17029 Returns the TYPE specified. */
17031 static tree
17033 {
17034 tree attributes;
17035 cp_decl_specifier_seq type_specifiers;
17037 tree type_specified;
17040 /* Parse the attributes. */
17044 parser->type_definition_forbidden_message
17047 /* Parse the type-specifiers. DR 2413 clarifies that `typename' is
17048 optional in conversion-type-id. */
17056 /* If that didn't work, stop. */
17059 /* Parse the conversion-declarator. */
17067 /* Don't give this error when parsing tentatively. This happens to
17068 work because we always parse this definitively once. */
17071 {
17073 {
17076 }
17080 }
17083 }
17085 /* Parse an (optional) conversion-declarator.
17087 conversion-declarator:
17088 ptr-operator conversion-declarator [opt]
17090 */
17094 {
17097 cp_cv_quals cv_quals;
17099 /* We don't know if there's a ptr-operator next, or not. */
17101 /* Try the ptr-operator. */
17104 /* If it worked, look for more conversion-declarators. */
17106 {
17109 /* Parse another optional declarator. */
17112 declarator = cp_parser_make_indirect_declarator
17116 }
17119 }
17121 /* Parse an (optional) ctor-initializer.
17123 ctor-initializer:
17124 : mem-initializer-list */
17126 static void
17128 {
17129 /* If the next token is not a `:', then there is no
17130 ctor-initializer. */
17132 {
17133 /* Do default initialization of any bases and members. */
17137 }
17139 /* Consume the `:' token. */
17141 /* And the mem-initializer-list. */
17143 }
17145 /* Parse a mem-initializer-list.
17147 mem-initializer-list:
17148 mem-initializer ... [opt]
17149 mem-initializer ... [opt] , mem-initializer-list */
17151 static void
17153 {
17158 /* Let the semantic analysis code know that we are starting the
17159 mem-initializer-list. */
17164 /* Loop through the list. */
17166 {
17167 tree mem_initializer;
17170 /* Parse the mem-initializer. */
17172 /* If the next token is a `...', we're expanding member initializers. */
17178 {
17179 /* Consume the `...'. */
17183 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
17184 can be expanded but members cannot. */
17187 {
17192 }
17194 /* Construct the pack expansion type. */
17197 }
17200 {
17204 }
17205 /* Look for a target constructor. */
17209 {
17212 {
17216 }
17218 }
17219 /* Add it to the list, unless it was erroneous. */
17221 {
17224 }
17225 /* If the next token is not a `,', we're done. */
17228 /* Consume the `,' token. */
17230 }
17232 /* Perform semantic analysis. */
17235 }
17237 /* Parse a mem-initializer.
17239 mem-initializer:
17240 mem-initializer-id ( expression-list [opt] )
17241 mem-initializer-id braced-init-list
17243 GNU extension:
17245 mem-initializer:
17246 ( expression-list [opt] )
17248 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
17249 class) or FIELD_DECL (for a non-static data member) to initialize;
17250 the TREE_VALUE is the expression-list. An empty initialization
17251 list is represented by void_list_node. */
17253 static tree
17255 {
17256 tree mem_initializer_id;
17257 tree expression_list;
17258 tree member;
17261 /* Find out what is being initialized. */
17263 {
17267 }
17268 else
17269 {
17273 }
17279 {
17285 }
17286 else
17287 {
17299 }
17312 /* We can't attach the source location of this initializer directly to
17313 the list node, so we instead attach it to a dummy EMPTY_CLASS_EXPR
17314 within the TREE_TYPE of the list node. */
17315 location_t loc
17322 }
17324 /* Parse a mem-initializer-id.
17326 mem-initializer-id:
17327 :: [opt] nested-name-specifier [opt] class-name
17328 decltype-specifier (C++11)
17329 identifier
17331 Returns a TYPE indicating the class to be initialized for the first
17332 production (and the second in C++11). Returns an IDENTIFIER_NODE
17333 indicating the data member to be initialized for the last production. */
17335 static tree
17337 {
17341 tree id;
17345 /* `typename' is not allowed in this context ([temp.res]). */
17347 {
17349 "keyword %<typename%> not allowed in this context (a qualified "
17352 }
17353 /* Look for the optional `::' operator. */
17354 global_scope_p
17358 /* Look for the optional nested-name-specifier. The simplest way to
17359 implement:
17361 [temp.res]
17363 The keyword `typename' is not permitted in a base-specifier or
17364 mem-initializer; in these contexts a qualified name that
17365 depends on a template-parameter is implicitly assumed to be a
17366 type name.
17368 is to assume that we have seen the `typename' keyword at this
17369 point. */
17370 nested_name_specifier_p
17379 /* If there is a `::' operator or a nested-name-specifier, then we
17380 are definitely looking for a class-name. */
17385 typename_type,
17389 /* Otherwise, we could also be looking for an ordinary identifier. */
17392 /* Try a decltype-specifier. */
17394 else
17395 /* Otherwise, try a class-name. */
17399 none_type,
17403 /* If we found one, we're done. */
17406 /* Otherwise, look for an ordinary identifier. */
17408 }
17410 /* Overloading [gram.over] */
17412 /* Parse an operator-function-id.
17414 operator-function-id:
17415 operator operator
17417 Returns an IDENTIFIER_NODE for the operator which is a
17418 human-readable spelling of the identifier, e.g., `operator +'. */
17420 static cp_expr
17422 {
17424 /* Look for the `operator' keyword. */
17427 /* And then the name of the operator itself. */
17429 }
17431 /* Return an identifier node for a user-defined literal operator.
17432 The suffix identifier is chained to the operator name identifier. */
17434 tree
17436 {
17437 tree identifier;
17445 }
17447 /* Parse an operator.
17449 operator:
17450 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
17451 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
17452 || ++ -- , ->* -> () []
17454 GNU Extensions:
17456 operator:
17457 <? >? <?= >?=
17459 Returns an IDENTIFIER_NODE for the operator which is a
17460 human-readable spelling of the identifier, e.g., `operator +'. */
17462 static cp_expr
17464 {
17469 /* Peek at the next token. */
17474 /* Figure out which operator we have. */
17479 {
17481 {
17482 /* The keyword should be either `new', `delete' or `co_await'. */
17489 else
17492 /* Consume the `new', `delete' or co_await token. */
17495 /* Peek at the next token. */
17497 /* If it's a `[' token then this is the array variant of the
17498 operator. */
17501 {
17502 /* Consume the `[' token. */
17504 /* Look for the `]' token. */
17509 }
17512 }
17675 /* Consume the `?'. */
17677 /* Look for the matching `:'. */
17683 {
17684 /* Consume the `('. */
17685 matching_parens parens;
17687 /* Look for the matching `)'. */
17694 }
17697 /* Consume the `['. */
17699 /* Look for the matching `]'. */
17710 /* FALLTHRU */
17719 {
17720 tree string_tree;
17726 /* Consume the string. */
17732 {
17736 }
17737 else
17738 {
17740 /* Look for the suffix identifier. */
17743 {
17746 }
17748 {
17752 }
17753 else
17754 {
17757 }
17758 }
17763 {
17766 }
17769 {
17772 }
17774 {
17777 }
17778 /* Generate a location of the form:
17779 "" _suffix_identifier
17780 ^~~~~~~~~~~~~~~~~~~~~
17781 with caret == start at the start token, finish at the end of the
17782 suffix identifier. */
17783 location_t combined_loc
17786 }
17789 /* Anything else is an error. */
17791 }
17793 /* If we have selected an identifier, we need to consume the
17794 operator token. */
17796 {
17800 }
17801 /* Otherwise, no valid operator name was present. */
17802 else
17803 {
17806 }
17810 }
17812 /* Parse a template-declaration.
17814 template-declaration:
17815 export [opt] template < template-parameter-list > declaration
17817 If MEMBER_P is TRUE, this template-declaration occurs within a
17818 class-specifier.
17820 The grammar rule given by the standard isn't correct. What
17821 is really meant is:
17823 template-declaration:
17824 export [opt] template-parameter-list-seq
17825 decl-specifier-seq [opt] init-declarator [opt] ;
17826 export [opt] template-parameter-list-seq
17827 function-definition
17829 template-parameter-list-seq:
17830 template-parameter-list-seq [opt]
17831 template < template-parameter-list >
17833 Concept Extensions:
17835 template-parameter-list-seq:
17836 template < template-parameter-list > requires-clause [opt]
17838 requires-clause:
17839 requires logical-or-expression */
17841 static void
17843 {
17844 /* Check for `export'. */
17846 {
17847 /* Consume the `export' token. */
17849 /* Warn that this use of export is deprecated. */
17854 else
17856 }
17859 }
17861 /* Parse a template-parameter-list.
17863 template-parameter-list:
17864 template-parameter
17865 template-parameter-list , template-parameter
17867 Returns a TREE_LIST. Each node represents a template parameter.
17868 The nodes are connected via their TREE_CHAINs. */
17870 static tree
17872 {
17875 /* Don't create wrapper nodes within a template-parameter-list,
17876 since we don't want to have different types based on the
17877 spelling location of constants and decls within them. */
17878 auto_suppress_location_wrappers sentinel;
17882 /* The loop below parses the template parms. We first need to know
17883 the total number of template parms to be able to compute proper
17884 canonical types of each dependent type. So after the loop, when
17885 we know the total number of template parms,
17886 end_template_parm_list computes the proper canonical types and
17887 fixes up the dependent types accordingly. */
17889 {
17890 tree parameter;
17893 location_t parm_loc;
17895 /* Parse the template-parameter. */
17900 /* Add it to the list. */
17903 parm_loc,
17904 parameter,
17905 is_non_type,
17906 is_parameter_pack);
17907 else
17908 {
17911 }
17913 /* If the next token is not a `,', we're done. */
17916 /* Otherwise, consume the `,' token. */
17918 }
17921 }
17923 /* Parse a introduction-list.
17925 introduction-list:
17926 introduced-parameter
17927 introduction-list , introduced-parameter
17929 introduced-parameter:
17930 ...[opt] identifier
17932 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
17933 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
17934 WILDCARD_DECL will also have DECL_NAME set and token location in
17935 DECL_SOURCE_LOCATION. */
17937 static tree
17939 {
17943 {
17952 /* Build placeholder. */
17960 /* If the next token is not a `,', we're done. */
17963 /* Otherwise, consume the `,' token. */
17965 }
17967 /* Convert the vec into a TREE_VEC. */
17970 tree parm;
17976 }
17978 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
17979 is an abstract declarator. */
17983 {
17988 }
17990 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
17991 is an abstract declarator. */
17995 {
17999 else
18001 }
18003 /* Returns true if TYPE would declare a constrained constrained-parameter. */
18007 {
18012 }
18014 /* Returns true if PARM declares a constrained-parameter. */
18018 {
18020 }
18022 /* Check that the type parameter is only a declarator-id, and that its
18023 type is not cv-qualified. */
18025 bool
18028 {
18033 {
18036 }
18038 /* Don't allow cv-qualified type parameters. */
18041 {
18044 }
18047 }
18049 /* Finish parsing/processing a template type parameter and checking
18050 various restrictions. */
18054 tree id,
18056 {
18059 else
18061 }
18063 static tree
18065 {
18066 /* FIXME: This should probably be copied, and we may need to adjust
18067 the template parameter depths. */
18077 }
18079 /* Finish parsing/processing a template template parameter by borrowing
18080 the template parameter list from the prototype parameter. */
18082 static tree
18084 tree proto,
18085 tree id,
18087 {
18091 }
18093 /* Create a new non-type template parameter from the given PARM
18094 declarator. */
18096 static tree
18099 {
18105 }
18107 /* Build a constrained template parameter based on the PARMDECL
18108 declarator. The type of PARMDECL is the constrained type, which
18109 refers to the prototype template parameter that ultimately
18110 specifies the type of the declared parameter. */
18112 static tree
18116 {
18122 /* Build the parameter. Return an error if the declarator was invalid. */
18123 tree parm;
18128 parmdecl);
18129 else
18134 /* Finish the parameter decl and create a node attaching the
18135 default argument and constraint. */
18140 }
18142 /* Returns true if the parsed type actually represents the declaration
18143 of a type template-parameter. */
18145 static bool
18147 {
18150 }
18152 /* Returns true if the parsed type actually represents the declaration of
18153 a template template-parameter. */
18155 static bool
18157 {
18160 }
18162 /* Parse a default argument for a type template-parameter.
18163 Note that diagnostics are handled in cp_parser_template_parameter. */
18165 static tree
18167 {
18170 /* Consume the `=' token. */
18175 /* Tell cp_parser_lambda_expression this is a default argument. */
18179 /* Parse the default-argument. */
18182 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18183 NULL);
18187 {
18191 }
18194 }
18196 /* Parse a default argument for a template template-parameter. */
18198 static tree
18200 {
18205 /* Consume the `='. */
18207 /* Parse the id-expression. */
18209 /* save token before parsing the id-expression, for error
18210 reporting */
18212 tree default_argument
18220 /* If the id-expression was a template-id that refers to
18221 a template-class, we already have the declaration here,
18222 so no further lookup is needed. */
18223 ;
18224 else
18225 /* Look up the name. */
18226 default_argument
18228 none_type,
18234 /* See if the default argument is valid. */
18238 }
18240 /* Parse a template-parameter.
18242 template-parameter:
18243 type-parameter
18244 parameter-declaration
18246 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
18247 the parameter. The TREE_PURPOSE is the default value, if any.
18248 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
18249 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
18250 set to true iff this parameter is a parameter pack. */
18252 static tree
18255 {
18258 tree parm;
18260 /* Assume it is a type parameter or a template parameter. */
18262 /* Assume it not a parameter pack. */
18264 /* Peek at the next token. */
18266 /* If it is `template', we have a type-parameter. */
18269 /* If it is `class' or `typename' we do not know yet whether it is a
18270 type parameter or a non-type parameter. Consider:
18272 template <typename T, typename T::X X> ...
18274 or:
18276 template <class C, class D*> ...
18278 Here, the first parameter is a type parameter, and the second is
18279 a non-type parameter. We can tell by looking at the token after
18280 the identifier -- if it is a `,', `=', or `>' then we have a type
18281 parameter. */
18283 {
18284 /* Peek at the token after `class' or `typename'. */
18286 /* If it's an ellipsis, we have a template type parameter
18287 pack. */
18290 /* If it's an identifier, skip it. */
18293 /* Now, see if the token looks like the end of a template
18294 parameter. */
18299 }
18301 /* Otherwise, it is a non-type parameter or a constrained parameter.
18303 [temp.param]
18305 When parsing a default template-argument for a non-type
18306 template-parameter, the first non-nested `>' is taken as the end
18307 of the template parameter-list rather than a greater-than
18308 operator. */
18309 parameter_declarator
18311 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18318 /* If the parameter declaration is marked as a parameter pack, set
18319 *IS_PARAMETER_PACK to notify the caller. */
18324 {
18325 /* Can happen in some cases of erroneous input (c++/34892). */
18327 /* Consume the `...' for better error recovery. */
18329 }
18331 /* The parameter may have been constrained type parameter. */
18334 parameter_declarator,
18335 is_non_type);
18337 // Now we're sure that the parameter is a non-type parameter.
18348 }
18350 /* Parse a type-parameter.
18352 type-parameter:
18353 class identifier [opt]
18354 class identifier [opt] = type-id
18355 typename identifier [opt]
18356 typename identifier [opt] = type-id
18357 template < template-parameter-list > class identifier [opt]
18358 template < template-parameter-list > class identifier [opt]
18359 = id-expression
18361 GNU Extension (variadic templates):
18363 type-parameter:
18364 class ... identifier [opt]
18365 typename ... identifier [opt]
18367 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
18368 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
18369 the declaration of the parameter.
18371 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
18373 static tree
18375 {
18377 tree parameter;
18379 /* Look for a keyword to tell us what kind of parameter this is. */
18385 {
18388 {
18389 tree identifier;
18390 tree default_argument;
18392 /* If the next token is an ellipsis, we have a template
18393 argument pack. */
18395 {
18396 /* Consume the `...' token. */
18401 }
18403 /* If the next token is an identifier, then it names the
18404 parameter. */
18407 else
18410 /* Create the parameter. */
18413 /* If the next token is an `=', we have a default argument. */
18415 {
18416 default_argument
18419 /* Template parameter packs cannot have default
18420 arguments. */
18422 {
18425 "template parameter pack %qD cannot have a "
18427 else
18429 "template parameter packs cannot have "
18432 }
18435 }
18436 else
18439 /* Create the combined representation of the parameter and the
18440 default argument. */
18442 }
18446 {
18447 tree identifier;
18448 tree default_argument;
18450 /* Look for the `<'. */
18452 /* Parse the template-parameter-list. */
18454 /* Look for the `>'. */
18457 /* If template requirements are present, parse them. */
18459 {
18464 }
18466 /* Look for the `class' or 'typename' keywords. */
18468 /* If the next token is an ellipsis, we have a template
18469 argument pack. */
18471 {
18472 /* Consume the `...' token. */
18477 }
18478 /* If the next token is an `=', then there is a
18479 default-argument. If the next token is a `>', we are at
18480 the end of the parameter-list. If the next token is a `,',
18481 then we are at the end of this parameter. */
18485 {
18487 /* Treat invalid names as if the parameter were nameless. */
18490 }
18491 else
18494 /* Create the template parameter. */
18496 identifier);
18498 /* If the next token is an `=', then there is a
18499 default-argument. */
18501 {
18502 default_argument
18505 /* Template parameter packs cannot have default
18506 arguments. */
18508 {
18511 "template parameter pack %qD cannot "
18513 identifier);
18514 else
18518 }
18519 }
18520 else
18523 /* Create the combined representation of the parameter and the
18524 default argument. */
18526 }
18532 }
18535 }
18537 /* Parse a template-id.
18539 template-id:
18540 template-name < template-argument-list [opt] >
18542 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
18543 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
18544 returned. Otherwise, if the template-name names a function, or set
18545 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
18546 names a class, returns a TYPE_DECL for the specialization.
18548 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
18549 uninstantiated templates. */
18551 static tree
18557 {
18558 tree templ;
18559 tree arguments;
18560 tree template_id;
18565 /* If the next token corresponds to a template-id, there is no need
18566 to reparse it. */
18570 {
18573 }
18575 /* Avoid performing name lookup if there is no possibility of
18576 finding a template-id. */
18579 && !cp_parser_nth_token_starts_template_argument_list_p
18581 {
18584 }
18586 /* Remember where the template-id starts. */
18592 /* Parse the template-name. */
18595 check_dependency_p,
18596 is_declaration,
18597 tag_type,
18600 /* Push any access checks inside the firewall we're about to create. */
18606 /* Since we're going to preserve any side-effects from this parse, set up a
18607 firewall to protect our callers from cp_parser_commit_to_tentative_parse
18608 in the template arguments. */
18612 /* If we find the sequence `[:' after a template-name, it's probably
18613 a digraph-typo for `< ::'. Substitute the tokens and check if we can
18614 parse correctly the argument list. */
18621 {
18623 /* Change `:' into `::'. */
18625 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
18626 CPP_LESS. */
18629 /* Parse the arguments. */
18632 {
18633 /* If we couldn't parse an argument list, then we revert our changes
18634 and return simply an error. Maybe this is not a template-id
18635 after all. */
18640 }
18641 /* Otherwise, emit an error about the invalid digraph, but continue
18642 parsing because we got our argument list. */
18645 {
18648 "%<<:%> is an alternate spelling for %<[%>."
18651 {
18653 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
18656 }
18657 }
18658 }
18659 else
18660 {
18661 /* Look for the `<' that starts the template-argument-list. */
18663 {
18666 }
18667 /* Parse the arguments. */
18672 && !template_keyword_p
18675 {
18676 /* This didn't go well. */
18678 {
18679 /* C++20 says that "function-name < a;" is now ill-formed. */
18681 {
18684 "operand of %<<%> is ill-formed in C++20; wrap the "
18686 }
18687 else
18688 /* We expect "f<targs>" to be followed by "(args)". */
18692 /* Purge all subsequent tokens. */
18694 }
18695 else
18699 }
18700 }
18702 /* Set the location to be of the form:
18703 template-name < template-argument-list [opt] >
18704 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
18705 with caret == start at the start of the template-name,
18706 ranging until the closing '>'. */
18707 location_t combined_loc
18710 /* Check for concepts autos where they don't belong. We could
18711 identify types in some cases of identifier TEMPL, looking ahead
18712 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
18713 types. We reject them in functions, but if what we have is an
18714 identifier, even with none_type we can't conclude it's NOT a
18715 type, we have to wait for template substitution. */
18718 /* Build a representation of the specialization. */
18721 TEMPLATE_ID_EXPR,
18725 {
18726 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
18727 template (rather than some instantiation thereof) only if
18728 is not nested within some other construct. For example, in
18729 "template <typename T> void f(T) { A<T>::", A<T> is just an
18730 instantiation of A. */
18731 bool entering_scope
18734 template_id
18736 }
18738 {
18739 /* The caller will decide whether this is a concept check or type
18740 constraint. */
18743 }
18745 {
18749 }
18752 {
18753 /* Some type template in dependent scope. */
18756 TEMPLATE_ID_EXPR,
18759 }
18760 else
18761 {
18762 /* If it's not a class-template or a template-template, it should be
18763 a function-template. */
18769 }
18771 /* If parsing tentatively, replace the sequence of tokens that makes
18772 up the template-id with a CPP_TEMPLATE_ID token. That way,
18773 should we re-parse the token stream, we will not have to repeat
18774 the effort required to do the parse, nor will we issue duplicate
18775 error messages about problems during instantiation of the
18776 template. */
18778 /* Don't do this if we had a parse error in a declarator; re-parsing
18779 might succeed if a name changes meaning (60361). */
18783 {
18784 /* Reset the contents of the START_OF_ID token. */
18788 /* Retrieve any deferred checks. Do not pop this access checks yet
18789 so the memory will not be reclaimed during token replacing below. */
18796 /* Purge all subsequent tokens. */
18799 /* ??? Can we actually assume that, if template_id ==
18800 error_mark_node, we will have issued a diagnostic to the
18801 user, as opposed to simply marking the tentative parse as
18802 failed? */
18805 }
18809 }
18811 /* Like cp_parser_template_id, called in non-type context. */
18813 static tree
18818 {
18823 /* We didn't check the arguments in cp_parser_template_id; do that now. */
18826 }
18828 /* Parse a template-name.
18830 template-name:
18831 identifier
18833 The standard should actually say:
18835 template-name:
18836 identifier
18837 operator-function-id
18839 A defect report has been filed about this issue.
18841 A conversion-function-id cannot be a template name because they cannot
18842 be part of a template-id. In fact, looking at this code:
18844 a.operator K<int>()
18846 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
18847 It is impossible to call a templated conversion-function-id with an
18848 explicit argument list, since the only allowed template parameter is
18849 the type to which it is converting.
18851 If TEMPLATE_KEYWORD_P is true, then we have just seen the
18852 `template' keyword, in a construction like:
18854 T::template f<3>()
18856 In that case `f' is taken to be a template-name, even though there
18857 is no way of knowing for sure.
18859 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
18860 name refers to a set of overloaded functions, at least one of which
18861 is a template, or an IDENTIFIER_NODE with the name of the template,
18862 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
18863 names are looked up inside uninstantiated templates. */
18865 static tree
18872 {
18873 tree identifier;
18874 tree decl;
18877 /* If the next token is `operator', then we have either an
18878 operator-function-id or a conversion-function-id. */
18880 {
18881 /* We don't know whether we're looking at an
18882 operator-function-id or a conversion-function-id. */
18884 /* Try an operator-function-id. */
18886 /* If that didn't work, try a conversion-function-id. */
18888 {
18891 }
18892 }
18893 /* Look for the identifier. */
18894 else
18897 /* If we didn't find an identifier, we don't have a template-id. */
18901 /* If the name immediately followed the `template' keyword, then it
18902 is a template-name. However, if the next token is not `<', then
18903 we do not treat it as a template-name, since it is not being used
18904 as part of a template-id. This enables us to handle constructs
18905 like:
18907 template <typename T> struct S { S(); };
18908 template <typename T> S<T>::S();
18910 correctly. We would treat `S' as a template -- if it were `S<T>'
18911 -- but we do not if there is no `<'. */
18915 {
18916 /* In a declaration, in a dependent context, we pretend that the
18917 "template" keyword was present in order to improve error
18918 recovery. For example, given:
18920 template <typename T> void f(T::X<int>);
18922 we want to treat "X<int>" as a template-id. */
18924 && !template_keyword_p
18926 && check_dependency_p
18928 /* Do not do this for dtors (or ctors), since they never
18929 need the template keyword before their name. */
18931 {
18934 /* Explain what went wrong. */
18936 identifier);
18939 /* If parsing tentatively, find the location of the "<" token. */
18942 /* Parse the template arguments so that we can issue error
18943 messages about them. */
18946 /* Skip tokens until we find a good place from which to
18947 continue parsing. */
18952 /* If parsing tentatively, permanently remove the
18953 template argument list. That will prevent duplicate
18954 error messages from being issued about the missing
18955 "template" keyword. */
18962 }
18964 /* If the "template" keyword is present, then there is generally
18965 no point in doing name-lookup, so we just return IDENTIFIER.
18966 But, if the qualifying scope is non-dependent then we can
18967 (and must) do name-lookup normally. */
18969 {
18975 {
18976 /* We're optimizing away the call to cp_parser_lookup_name, but
18977 we still need to do this. */
18981 }
18982 }
18983 }
18985 /* cp_parser_lookup_name clears OBJECT_TYPE. */
18989 /* Look up the name. */
18991 tag_type,
18994 check_dependency_p,
19000 /* 13.3 [temp.names] A < is interpreted as the delimiter of a
19001 template-argument-list if it follows a name that is not a
19002 conversion-function-id and
19003 - that follows the keyword template or a ~ after a nested-name-specifier or
19004 in a class member access expression, or
19005 - for which name lookup finds the injected-class-name of a class template
19006 or finds any declaration of a template, or
19007 - that is an unqualified name for which name lookup either finds one or
19008 more functions or finds nothing, or
19009 - that is a terminal name in a using-declarator (9.9), in a declarator-id
19010 (9.3.4), or in a type-only context other than a nested-name-specifier
19011 (13.8). */
19013 /* Handle injected-class-name. */
19016 /* If DECL is a template, then the name was a template-name. */
19018 {
19021 {
19023 tree attr;
19026 else
19029 {
19032 }
19035 {
19038 }
19039 }
19040 }
19041 else
19042 {
19043 /* Look through an overload set for any templates. */
19051 /* "an unqualified name for which name lookup either finds one or more
19052 functions or finds nothing". */
19055 && !scope
19058 {
19059 /* The "more functions" case. Just use the OVERLOAD as normally.
19060 We don't use is_overloaded_fn here to avoid considering
19061 BASELINKs. */
19063 /* Name lookup found one function. */
19065 /* Name lookup found nothing. */
19068 }
19070 /* "that follows the keyword template"..."in a type-only context" */
19078 {
19079 /* The name does not name a template. */
19082 }
19085 /* cp_parser_template_id can only handle some TYPE_DECLs. */
19088 /* Repeat the lookup at instantiation time. */
19090 }
19093 }
19095 /* Parse a template-argument-list.
19097 template-argument-list:
19098 template-argument ... [opt]
19099 template-argument-list , template-argument ... [opt]
19101 Returns a TREE_VEC containing the arguments. */
19103 static tree
19105 {
19110 /* Don't create location wrapper nodes within a template-argument-list. */
19111 auto_suppress_location_wrappers sentinel;
19115 /* Even if the template-id appears in an integral
19116 constant-expression, the contents of the argument list do
19117 not. */
19123 /* Parse the arguments. */
19125 do
19126 {
19128 /* Consume the comma. */
19131 /* Parse the template-argument. */
19134 /* If the next token is an ellipsis, we're expanding a template
19135 argument pack. */
19137 {
19139 {
19143 }
19144 /* Consume the `...' token. */
19147 /* Make the argument into a TYPE_PACK_EXPANSION or
19148 EXPR_PACK_EXPANSION. */
19150 }
19153 }
19168 }
19170 /* Parse a template-argument.
19172 template-argument:
19173 assignment-expression
19174 type-id
19175 id-expression
19177 The representation is that of an assignment-expression, type-id, or
19178 id-expression -- except that the qualified id-expression is
19179 evaluated, so that the value returned is either a DECL or an
19180 OVERLOAD.
19182 Although the standard says "assignment-expression", it forbids
19183 throw-expressions or assignments in the template argument.
19184 Therefore, we use "conditional-expression" instead. */
19186 static tree
19188 {
19189 tree argument;
19195 cp_id_kind idk;
19197 /* There's really no way to know what we're looking at, so we just
19198 try each alternative in order.
19200 [temp.arg]
19202 In a template-argument, an ambiguity between a type-id and an
19203 expression is resolved to a type-id, regardless of the form of
19204 the corresponding template-parameter.
19206 Therefore, we try a type-id first. */
19209 /* If there was no error parsing the type-id but the next token is a
19210 '>>', our behavior depends on which dialect of C++ we're
19211 parsing. In C++98, we probably found a typo for '> >'. But there
19212 are type-id which are also valid expressions. For instance:
19214 struct X { int operator >> (int); };
19215 template <int V> struct Foo {};
19216 Foo<X () >> 5> r;
19218 Here 'X()' is a valid type-id of a function type, but the user just
19219 wanted to write the expression "X() >> 5". Thus, we remember that we
19220 found a valid type-id, but we still try to parse the argument as an
19221 expression to see what happens.
19223 In C++0x, the '>>' will be considered two separate '>'
19224 tokens. */
19228 /* Similarly for >= which
19229 cp_parser_next_token_ends_template_argument_p treats for
19230 diagnostics purposes as mistyped > =, but can be valid
19231 after a type-id. */
19233 {
19236 }
19237 else
19238 {
19239 /* If the next token isn't a `,' or a `>', then this argument wasn't
19240 really finished. This means that the argument is not a valid
19241 type-id. */
19244 /* If that worked, we're done. */
19247 }
19248 /* We're still not sure what the argument will be. */
19250 /* Try a template. */
19258 /* If the next token isn't a `,' or a `>', then this argument wasn't
19259 really finished. */
19263 {
19264 /* Figure out what is being referred to. If the id-expression
19265 was for a class template specialization, then we will have a
19266 TYPE_DECL at this point. There is no need to do name lookup
19267 at this point in that case. */
19270 none_type,
19279 }
19281 {
19287 }
19288 /* It must be a non-type argument. In C++17 any constant-expression is
19289 allowed. */
19293 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
19295 -- an integral constant-expression of integral or enumeration
19296 type; or
19298 -- the name of a non-type template-parameter; or
19300 -- the name of an object or function with external linkage...
19302 -- the address of an object or function with external linkage...
19304 -- a pointer to member... */
19305 /* Look for a non-type template parameter. */
19307 {
19319 }
19321 /* If the next token is "&", the argument must be the address of an
19322 object or function with external linkage. */
19325 {
19328 }
19329 /* See if we might have an id-expression. */
19336 {
19339 address_p,
19346 else
19347 {
19348 tree probe;
19351 {
19352 /* Strip the dereference temporarily. */
19355 }
19357 /* If we're in a template, we represent a qualified-id referring
19358 to a static data member as a SCOPE_REF even if the scope isn't
19359 dependent so that we can check access control later. */
19364 {
19365 /* A variable without external linkage might still be a
19366 valid constant-expression, so no error is issued here
19367 if the external-linkage check fails. */
19370 }
19372 /* All overloaded functions are allowed; if the external
19373 linkage test does not pass, an error will be issued
19374 later. */
19375 ;
19379 /* A pointer-to-member. */
19380 ;
19382 ;
19383 else
19387 {
19391 else
19394 }
19395 }
19396 }
19397 /* If the argument started with "&", there are no other valid
19398 alternatives at this point. */
19400 {
19403 }
19405 general_expr:
19406 /* If the argument wasn't successfully parsed as a type-id followed
19407 by '>>', the argument can only be a constant expression now.
19408 Otherwise, we try parsing the constant-expression tentatively,
19409 because the argument could really be a type-id. */
19415 else
19416 {
19417 /* In C++20, we can encounter a braced-init-list. */
19422 /* With C++17 generalized non-type template arguments we need to handle
19423 lvalue constant expressions, too. */
19426 }
19434 /* We did our best to parse the argument as a non type-id, but that
19435 was the only alternative that matched (albeit with a '>' after
19436 it). We can assume it's just a typo from the user, and a
19437 diagnostic will then be issued. */
19439 }
19441 /* Parse an explicit-instantiation.
19443 explicit-instantiation:
19444 template declaration
19446 Although the standard says `declaration', what it really means is:
19448 explicit-instantiation:
19449 template decl-specifier-seq [opt] declarator [opt] ;
19451 Things like `template int S<int>::i = 5, int S<double>::j;' are not
19452 supposed to be allowed. A defect report has been filed about this
19453 issue.
19455 GNU Extension:
19457 explicit-instantiation:
19458 storage-class-specifier template
19459 decl-specifier-seq [opt] declarator [opt] ;
19460 function-specifier template
19461 decl-specifier-seq [opt] declarator [opt] ; */
19463 static void
19465 {
19467 cp_decl_specifier_seq decl_specifiers;
19472 /* Look for an (optional) storage-class-specifier or
19473 function-specifier. */
19475 {
19476 extension_specifier
19479 extension_specifier
19482 }
19484 /* Look for the `template' keyword. */
19486 /* Let the front end know that we are processing an explicit
19487 instantiation. */
19489 /* [temp.explicit] says that we are supposed to ignore access
19490 control while processing explicit instantiation directives. */
19492 /* Parse a decl-specifier-seq. */
19494 CP_PARSER_FLAGS_OPTIONAL,
19498 cp_omp_declare_simd_data odsd;
19504 /* If there was exactly one decl-specifier, and it declared a class,
19505 and there's no declarator, then we have an explicit type
19506 instantiation. */
19508 {
19511 /* Turn access control back on for names used during
19512 template instantiation. */
19517 }
19518 else
19519 {
19521 tree decl;
19523 /* Parse the declarator. */
19524 declarator
19526 CP_PARSER_FLAGS_NONE,
19537 {
19540 "explicit instantiation shall not use"
19544 "explicit instantiation shall not use"
19548 "explicit instantiation shall not use"
19553 /* Turn access control back on for names used during
19554 template instantiation. */
19556 /* Do the explicit instantiation. */
19558 }
19559 else
19560 {
19562 /* Skip the body of the explicit instantiation. */
19564 }
19565 }
19566 /* We're done with the instantiation. */
19572 }
19574 /* Parse an explicit-specialization.
19576 explicit-specialization:
19577 template < > declaration
19579 Although the standard says `declaration', what it really means is:
19581 explicit-specialization:
19582 template <> decl-specifier [opt] init-declarator [opt] ;
19583 template <> function-definition
19584 template <> explicit-specialization
19585 template <> template-declaration */
19587 static void
19589 {
19592 /* Look for the `template' keyword. */
19594 /* Look for the `<'. */
19596 /* Look for the `>'. */
19598 /* We have processed another parameter list. */
19601 /* [temp]
19603 A template ... explicit specialization ... shall not have C
19604 linkage. */
19607 {
19611 /* Give it C++ linkage to avoid confusing other parts of the
19612 front end. */
19614 }
19616 /* Let the front end know that we are beginning a specialization. */
19618 {
19619 /* If the next keyword is `template', we need to figure out
19620 whether or not we're looking a template-declaration. */
19622 {
19627 else
19629 }
19630 else
19631 /* Parse the dependent declaration. */
19637 }
19639 /* We're done with the specialization. */
19642 /* For the erroneous case of a template with C linkage, we pushed an
19643 implicit C++ linkage scope; exit that scope now. */
19647 /* We're done with this parameter list. */
19649 }
19651 /* Preserve the attributes across a garbage collect (by making it a GC
19652 root), which can occur when parsing a member function. */
19656 /* Parse a type-specifier.
19658 type-specifier:
19659 simple-type-specifier
19660 class-specifier
19661 enum-specifier
19662 elaborated-type-specifier
19663 cv-qualifier
19665 GNU Extension:
19667 type-specifier:
19668 __complex__
19670 Returns a representation of the type-specifier. For a
19671 class-specifier, enum-specifier, or elaborated-type-specifier, a
19672 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
19674 The parser flags FLAGS is used to control type-specifier parsing.
19676 If IS_DECLARATION is TRUE, then this type-specifier is appearing
19677 in a decl-specifier-seq.
19679 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
19680 class-specifier, enum-specifier, or elaborated-type-specifier, then
19681 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
19682 if a type is declared; 2 if it is defined. Otherwise, it is set to
19683 zero.
19685 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
19686 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
19687 is set to FALSE. */
19689 static tree
19691 cp_parser_flags flags,
19696 {
19702 /* Assume this type-specifier does not declare a new type. */
19705 /* And that it does not specify a cv-qualifier. */
19708 /* Peek at the next token. */
19711 /* If we're looking at a keyword, we can use that to guide the
19712 production we choose. */
19715 {
19720 /* Look for the enum-specifier. */
19722 /* If that worked, we're done. */
19724 {
19729 type_spec,
19730 token,
19733 }
19734 else
19737 /* Any of these indicate either a class-specifier, or an
19738 elaborated-type-specifier. */
19745 /* Parse tentatively so that we can back up if we don't find a
19746 class-specifier. */
19750 /* Look for the class-specifier. */
19755 /* If that worked, we're done. */
19757 {
19762 type_spec,
19763 token,
19766 }
19768 /* Fall through. */
19769 elaborated_type_specifier:
19770 /* We're declaring (not defining) a class or enum. */
19774 /* Fall through. */
19776 /* Look for an elaborated-type-specifier. */
19777 type_spec
19778 = (cp_parser_elaborated_type_specifier
19781 is_declaration));
19784 type_spec,
19785 token,
19808 /* The `__complex__' keyword is a GNU extension. */
19814 }
19816 /* Handle simple keywords. */
19818 {
19820 {
19823 }
19825 }
19827 /* If we do not already have a type-specifier, assume we are looking
19828 at a simple-type-specifier. */
19830 decl_specs,
19831 flags);
19833 /* If we didn't find a type-specifier, and a type-specifier was not
19834 optional in this context, issue an error message. */
19836 {
19839 }
19842 }
19844 /* Parse a simple-type-specifier.
19846 simple-type-specifier:
19847 :: [opt] nested-name-specifier [opt] type-name
19848 :: [opt] nested-name-specifier template template-id
19849 char
19850 wchar_t
19851 bool
19852 short
19853 int
19854 long
19855 signed
19856 unsigned
19857 float
19858 double
19859 void
19861 C++11 Extension:
19863 simple-type-specifier:
19864 auto
19865 decltype ( expression )
19866 char16_t
19867 char32_t
19868 __underlying_type ( type-id )
19870 C++17 extension:
19872 nested-name-specifier(opt) template-name
19874 GNU Extension:
19876 simple-type-specifier:
19877 __int128
19878 __typeof__ unary-expression
19879 __typeof__ ( type-id )
19880 __typeof__ ( type-id ) { initializer-list , [opt] }
19882 Concepts Extension:
19884 simple-type-specifier:
19885 constrained-type-specifier
19887 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
19888 appropriately updated. */
19890 static tree
19893 cp_parser_flags flags)
19894 {
19899 /* Peek at the next token. */
19902 /* If we're looking at a keyword, things are easy. */
19904 {
19942 {
19945 /* Check if the alternate "__intN__" form has been used instead of
19946 "__intN". */
19950 }
19972 CASE_RID_FLOATN_NX:
19987 {
19988 /* The 'auto' might be the placeholder return type for a function decl
19989 with trailing return type. */
19998 {
20000 {
20007 }
20010 {
20013 }
20016 }
20020 {
20023 }
20026 {
20029 }
20030 else
20034 {
20037 "use of %<auto%> in lambda parameter declaration "
20038 "only available with "
20040 }
20043 "use of %<auto%> in template argument "
20047 "use of %<auto%> in parameter declaration "
20051 "use of %<auto%> in parameter declaration "
20052 "only available with "
20054 }
20055 else
20060 /* Since DR 743, decltype can either be a simple-type-specifier by
20061 itself or begin a nested-name-specifier. Parsing it will replace
20062 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
20063 handling below decide what to do. */
20069 /* Consume the `typeof' token. */
20071 /* Parse the operand to `typeof'. */
20073 /* If it is not already a TYPE, take its type. */
20079 token,
20084 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
20085 case RID_##CODE:
20087 #undef DEFTRAIT_TYPE
20091 token,
20098 }
20100 /* If token is an already-parsed decltype not followed by ::,
20101 it's a simple-type-specifier. */
20104 {
20107 {
20109 token,
20111 /* Remember that we are handling a decltype in order to
20112 implement the resolution of DR 1510 when the argument
20113 isn't instantiation dependent. */
20115 }
20118 }
20120 /* If the type-specifier was for a built-in type, we're done. */
20122 {
20123 /* Record the type. */
20130 type,
20131 token,
20136 /* Consume the token. */
20142 /* There is no valid C++ program where a non-template type is
20143 followed by a "<". That usually indicates that the user thought
20144 that the type was a template. */
20149 }
20151 /* The type-specifier must be a user-defined type. */
20153 {
20159 /* Don't gobble tokens or issue error messages if this is an
20160 optional type-specifier. */
20164 /* Remember current tentative parsing state -- if we know we need
20165 a type, we can give better diagnostics here. */
20170 /* Look for the optional `::' operator. */
20171 global_p
20175 /* Look for the nested-name specifier. */
20176 qualified_p
20183 /* If we have seen a nested-name-specifier, and the next token
20184 is `template', then we are using the template-id production. */
20187 {
20188 /* Look for the template-id. */
20192 none_type,
20194 /* If the template-id did not name a type, we are out of
20195 luck. */
20197 {
20198 /* ...unless we pretend we have seen 'typename'. */
20202 else
20203 {
20206 }
20207 }
20208 }
20209 /* DR 1812: A < following a qualified-id in a typename-specifier
20210 could safely be assumed to begin a template argument list, so
20211 the template keyword should be optional. */
20213 && qualified_p
20214 && typename_p
20216 {
20222 none_type,
20224 /* This is handled below, so back off. */
20235 }
20237 /* Otherwise, look for a type-name. */
20239 {
20248 }
20251 {
20252 /* Try for a type-constraint with template arguments. We check
20253 decl_specs here to avoid trying this for a functional cast. */
20260 none_type,
20263 {
20268 /* Perhaps it's a concept-check expression. */
20270 }
20271 else
20276 }
20279 {
20280 /* Try class template argument deduction or type-constraint without
20281 template arguments. */
20285 {
20286 location_t loc
20289 none_type,
20301 else
20302 {
20307 }
20308 }
20309 else
20311 }
20313 /* If it didn't work out, we don't have a TYPE. */
20318 /* Keep track of all name-lookups performed in class scopes. */
20320 && !global_p
20321 && !qualified_p
20328 token,
20330 }
20332 /* If we didn't get a type-name, issue an error message. */
20334 {
20337 }
20340 {
20341 /* See if TYPE is an Objective-C type, and if so, parse and
20342 accept any protocol references following it. Do this before
20343 the cp_parser_check_for_invalid_template_id() call, because
20344 Objective-C types can be followed by '<...>' which would
20345 enclose protocol names rather than template arguments, and so
20346 everything is fine. */
20349 {
20353 /* Clobber the "unqualified" type previously entered into
20354 DECL_SPECS with the new, improved protocol-qualified version. */
20359 }
20361 /* There is no valid C++ program where a non-template type is
20362 followed by a "<". That usually indicates that the user
20363 thought that the type was a template. */
20365 none_type,
20367 }
20370 }
20372 /* Parse the remainder of a placholder-type-specifier.
20374 placeholder-type-specifier:
20375 type-constraint_opt auto
20376 type-constraint_opt decltype(auto)
20378 The raw form of the constraint is parsed in cp_parser_simple_type_specifier
20379 and passed as TMPL. This function converts TMPL to an actual type-constraint,
20380 parses the placeholder type, and performs some contextual syntactic analysis.
20382 LOC provides the location of the template name.
20384 TENTATIVE is true if the type-specifier parsing is tentative; in that case,
20385 don't give an error if TMPL isn't a valid type-constraint, as the template-id
20386 might actually be a concept-check,
20388 Note that the Concepts TS allows the auto or decltype(auto) to be
20389 omitted in a constrained-type-specifier. */
20391 static tree
20394 {
20400 /* Get the arguments as written for subsequent analysis. */
20403 {
20406 }
20407 else
20408 /* A concept-name with no arguments can't be an expression. */
20413 /* Get the concept and prototype parameter for the constraint. */
20420 /* As per the standard, require auto or decltype(auto), except in some
20421 cases (template parameter lists, -fconcepts-ts enabled). */
20424 {
20428 {
20430 matching_parens parens;
20434 }
20435 }
20437 /* A type constraint constrains a contextually determined type or type
20438 parameter pack. However, the Concepts TS does allow concepts
20439 to introduce non-type and template template parameters. */
20441 {
20444 {
20446 {
20449 }
20451 }
20452 }
20454 /* In a template parameter list, a type-parameter can be introduced
20455 by type-constraints alone. */
20457 {
20458 /* In a default argument we may not be creating new parameters. */
20460 {
20461 /* If this assert turns out to be false, do error() instead. */
20464 }
20466 }
20468 /* Diagnose issues placeholder issues. */
20472 {
20474 /* Perhaps it's a concept-check expression (c++/91073). */
20481 /* Fall through. This is an error of omission. */
20482 }
20484 {
20485 /* A trailing return type only allows type-constraints. */
20488 }
20490 /* In a parameter-declaration-clause, a placeholder-type-specifier
20491 results in an invented template parameter. */
20493 {
20495 {
20501 }
20504 }
20506 /* Determine if the type should be deduced using template argument
20507 deduction or decltype deduction. Note that the latter is always
20508 used for type-constraints in trailing return types. */
20513 /* Otherwise, this is the type of a variable or return type. */
20516 else
20518 }
20520 /* Parse a type-name.
20522 type-name:
20523 class-name
20524 enum-name
20525 typedef-name
20526 simple-template-id [in c++0x]
20528 enum-name:
20529 identifier
20531 typedef-name:
20532 identifier
20534 Concepts:
20536 type-name:
20537 concept-name
20538 partial-concept-id
20540 concept-name:
20541 identifier
20543 Returns a TYPE_DECL for the type. */
20545 static tree
20547 {
20548 tree type_decl;
20550 /* We can't know yet whether it is a class-name or not. */
20552 /* Try a class-name. */
20554 typename_keyword_p,
20556 none_type,
20560 /* If it's not a class-name, keep looking. */
20562 {
20564 /* It must be a typedef-name or an enum-name. */
20568 /* It is either a simple-template-id representing an
20569 instantiation of an alias template... */
20573 none_type,
20575 /* Note that this must be an instantiation of an alias template
20576 because [temp.names]/6 says:
20578 A template-id that names an alias template specialization
20579 is a type-name.
20581 Whereas [temp.names]/7 says:
20583 A simple-template-id that names a class template
20584 specialization is a class-name.
20586 With concepts, this could also be a partial-concept-id that
20587 declares a non-type template parameter. */
20592 else
20596 /* ... Or a typedef-name or an enum-name. */
20598 }
20601 }
20603 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
20604 or a concept-name.
20606 enum-name:
20607 identifier
20609 typedef-name:
20610 identifier
20612 concept-name:
20613 identifier
20615 Returns a TYPE_DECL for the type. */
20617 static tree
20619 {
20620 tree type_decl;
20621 tree identifier;
20628 /* Look up the type-name. */
20635 {
20636 /* See if this is an Objective-C type. */
20641 }
20643 /* Issue an error if we did not find a type-name. */
20645 /* In Objective-C, we have the complication that class names are
20646 normally type names and start declarations (eg, the
20647 "NSObject" in "NSObject *object;"), but can be used in an
20648 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
20649 is an expression. So, a classname followed by a dot is not a
20650 valid type-name. */
20653 {
20658 }
20659 /* Remember that the name was used in the definition of the
20660 current class so that we can check later to see if the
20661 meaning would have been different after the class was
20662 entirely defined. */
20668 }
20670 /* Parse an elaborated-type-specifier. Note that the grammar given
20671 here incorporates the resolution to DR68.
20673 elaborated-type-specifier:
20674 class-key :: [opt] nested-name-specifier [opt] identifier
20675 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
20676 enum-key :: [opt] nested-name-specifier [opt] identifier
20677 typename :: [opt] nested-name-specifier identifier
20678 typename :: [opt] nested-name-specifier template [opt]
20679 template-id
20681 GNU extension:
20683 elaborated-type-specifier:
20684 class-key attributes :: [opt] nested-name-specifier [opt] identifier
20685 class-key attributes :: [opt] nested-name-specifier [opt]
20686 template [opt] template-id
20687 enum attributes :: [opt] nested-name-specifier [opt] identifier
20689 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
20690 declared `friend'. If IS_DECLARATION is TRUE, then this
20691 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
20692 something is being declared.
20694 Returns the TYPE specified. */
20696 static tree
20700 {
20702 tree identifier;
20705 tree globalscope;
20708 /* For class and enum types the location of the class-key or enum-key. */
20710 /* For a scoped enum, the 'class' or 'struct' keyword id. */
20713 /* See if we're looking at the `enum' keyword. */
20715 {
20716 /* Consume the `enum' token. */
20718 /* Remember that it's an enumeration type. */
20720 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
20721 enums) is used here. */
20725 {
20733 /* Consume the `struct' or `class' and parse it anyway. */
20735 /* Create a combined location for the whole scoped-enum-key. */
20737 }
20738 else
20741 /* Parse the attributes. */
20743 }
20744 /* Or, it might be `typename'. */
20746 RID_TYPENAME))
20747 {
20748 /* Consume the `typename' token. */
20750 /* Remember that it's a `typename' type. */
20752 }
20753 /* Otherwise it must be a class-key. */
20754 else
20755 {
20760 /* Parse the attributes. */
20762 }
20764 /* Look for the `::' operator. */
20767 /* Look for the nested-name-specifier. */
20768 tree nested_name_specifier;
20770 {
20771 nested_name_specifier
20776 is_declaration);
20779 }
20780 else
20781 /* Even though `typename' is not present, the proposed resolution
20782 to Core Issue 180 says that in `class A<T>::B', `B' should be
20783 considered a type-name, even if `A<T>' is dependent. */
20784 nested_name_specifier
20789 is_declaration);
20790 /* For everything but enumeration types, consider a template-id.
20791 For an enumeration type, consider only a plain identifier. */
20793 {
20795 tree decl;
20797 /* Allow the `template' keyword. */
20799 /* If we didn't see `template', we don't know if there's a
20800 template-id or not. */
20803 /* The `template' keyword must follow a nested-name-specifier. */
20805 {
20809 }
20811 /* Parse the template-id. */
20815 tag_type,
20816 is_declaration);
20817 /* If we didn't find a template-id, look for an ordinary
20818 identifier. */
20820 ;
20821 /* We can get here when cp_parser_template_id, called by
20822 cp_parser_class_name with tag_type == none_type, succeeds
20823 and caches a BASELINK. Then, when called again here,
20824 instead of failing and returning an error_mark_node
20825 returns it (see template/typename17.C in C++11).
20826 ??? Could we diagnose this earlier? */
20828 {
20831 }
20832 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
20833 in effect, then we must assume that, upon instantiation, the
20834 template will correspond to a class. */
20838 typename_type,
20840 /* If the `typename' keyword is in effect and DECL is not a type
20841 decl, then type is non existent. */
20843 ;
20845 {
20849 /* If the next token is a semicolon, this must be a specialization,
20850 instantiation, or friend declaration. Check the scope while we
20851 still know whether or not we had a nested-name-specifier. */
20856 }
20859 }
20862 {
20867 {
20870 }
20872 /* For a `typename', we needn't call xref_tag. */
20878 /* Template parameter lists apply only if we are not within a
20879 function parameter list. */
20880 bool template_parm_lists_apply
20889 /* Look up a qualified name in the usual way. */
20891 {
20892 tree decl;
20893 tree ambiguous_decls;
20896 tag_type,
20903 /* If the lookup was ambiguous, an error will already have been
20904 issued. */
20908 /* If we are parsing friend declaration, DECL may be a
20909 TEMPLATE_DECL tree node here. However, we need to check
20910 whether this TEMPLATE_DECL results in valid code. Consider
20911 the following example:
20913 namespace N {
20914 template <class T> class C {};
20915 }
20916 class X {
20917 template <class T> friend class N::C; // #1, valid code
20918 };
20919 template <class T> class Y {
20920 friend class N::C; // #2, invalid code
20921 };
20923 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
20924 name lookup of `N::C'. We see that friend declaration must
20925 be template for the code to be valid. Note that
20926 processing_template_decl does not work here since it is
20927 always 1 for the above two cases. */
20929 decl = (cp_parser_maybe_treat_template_as_class
20934 {
20936 identifier,
20939 }
20942 {
20946 allow_template);
20950 }
20952 /* Forward declarations of nested types, such as
20954 class C1::C2;
20955 class C1::C2::C3;
20957 are invalid unless all components preceding the final '::'
20958 are complete. If all enclosing types are complete, these
20959 declarations become merely pointless.
20961 Invalid forward declarations of nested types are errors
20962 caught elsewhere in parsing. Those that are pointless arrive
20963 here. */
20971 }
20972 else
20973 {
20974 /* An elaborated-type-specifier sometimes introduces a new type and
20975 sometimes names an existing type. Normally, the rule is that it
20976 introduces a new type only if there is not an existing type of
20977 the same name already in scope. For example, given:
20979 struct S {};
20980 void f() { struct S s; }
20982 the `struct S' in the body of `f' is the same `struct S' as in
20983 the global scope; the existing definition is used. However, if
20984 there were no global declaration, this would introduce a new
20985 local class named `S'.
20987 An exception to this rule applies to the following code:
20989 namespace N { struct S; }
20991 Here, the elaborated-type-specifier names a new type
20992 unconditionally; even if there is already an `S' in the
20993 containing scope this declaration names a new type.
20994 This exception only applies if the elaborated-type-specifier
20995 forms the complete declaration:
20997 [class.name]
20999 A declaration consisting solely of `class-key identifier ;' is
21000 either a redeclaration of the name in the current scope or a
21001 forward declaration of the identifier as a class name. It
21002 introduces the name into the current scope.
21004 We are in this situation precisely when the next token is a `;'.
21006 An exception to the exception is that a `friend' declaration does
21007 *not* name a new type; i.e., given:
21009 struct S { friend struct T; };
21011 `T' is not a new type in the scope of `S'.
21013 Also, `new struct S' or `sizeof (struct S)' never results in the
21014 definition of a new type; a new type can only be declared in a
21015 declaration context. */
21017 TAG_how how;
21020 /* Friends have special name lookup rules. */
21024 CPP_SEMICOLON))
21025 /* This is a `class-key identifier ;' */
21027 else
21031 (template_parm_lists_apply
21034 /* An unqualified name was used to reference this type, so
21035 there were no qualifying templates. */
21045 }
21046 }
21051 /* Allow attributes on forward declarations of classes. */
21053 {
21064 {
21068 }
21071 else
21073 "attributes ignored on elaborated-type-specifier that is "
21075 }
21079 else
21080 {
21081 /* Diagnose class/struct/union mismatches. IS_DECLARATION is false
21082 for alias definition. */
21086 decl_class);
21088 /* Indicate whether this class was declared as a `class' or as a
21089 `struct'. */
21092 }
21094 /* A "<" cannot follow an elaborated type specifier. If that
21095 happens, the user was probably trying to form a template-id. */
21100 }
21102 /* Parse an enum-specifier.
21104 enum-specifier:
21105 enum-head { enumerator-list [opt] }
21106 enum-head { enumerator-list , } [C++0x]
21108 enum-head:
21109 enum-key identifier [opt] enum-base [opt]
21110 enum-key nested-name-specifier identifier enum-base [opt]
21112 enum-key:
21113 enum
21114 enum class [C++0x]
21115 enum struct [C++0x]
21117 enum-base: [C++0x]
21118 : type-specifier-seq
21120 opaque-enum-specifier:
21121 enum-key identifier enum-base [opt] ;
21123 GNU Extensions:
21124 enum-key attributes[opt] identifier [opt] enum-base [opt]
21125 { enumerator-list [opt] }attributes[opt]
21126 enum-key attributes[opt] identifier [opt] enum-base [opt]
21127 { enumerator-list, }attributes[opt] [C++0x]
21129 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
21130 if the token stream isn't an enum-specifier after all. */
21132 static tree
21134 {
21135 tree identifier;
21137 tree prev_scope;
21139 tree attributes;
21150 /* Parse tentatively so that we can back up if we don't find a
21151 enum-specifier. */
21154 /* Caller guarantees that the current token is 'enum', an identifier
21155 possibly follows, and the token after that is an opening brace.
21156 If we don't have an identifier, fabricate an anonymous name for
21157 the enumeration being defined. */
21160 /* Parse the "class" or "struct", which indicates a scoped
21161 enumeration type in C++0x. */
21164 {
21168 /* Consume the `struct' or `class' token. */
21172 }
21176 /* Clear the qualification. */
21181 /* Figure out in what scope the declaration is being placed. */
21187 nested_name_specifier
21195 {
21196 tree name;
21200 enum_type,
21205 input_location);
21207 {
21210 {
21211 /* Are template enums allowed in ISO? */
21215 /* ignore a typename reference, for it will be solved by name
21216 in start_enum. */
21218 }
21219 }
21222 else
21223 {
21228 }
21229 }
21230 else
21231 {
21234 else
21235 {
21241 }
21242 }
21245 /* Check for the `:' that denotes a specified underlying type in C++0x.
21246 Note that a ':' could also indicate a bitfield width, however. */
21249 {
21250 cp_decl_specifier_seq type_specifiers;
21252 /* Consume the `:'. */
21256 auto tdf
21260 /* Parse the type-specifier-seq. */
21266 /* At this point this is surely not elaborated type specifier. */
21275 /* If that didn't work, stop. */
21277 {
21283 }
21284 }
21286 /* Look for the `{' but don't consume it yet. */
21288 {
21290 {
21296 }
21297 /* An opaque-enum-specifier must have a ';' here. */
21300 {
21303 OPT_Welaborated_enum_base,
21304 "declaration of enumeration with "
21305 "fixed underlying type and no enumerator list is "
21307 else
21309 }
21310 }
21316 {
21318 {
21322 }
21325 }
21327 /* Issue an error message if type-definitions are forbidden here. */
21330 else
21331 /* Create the new type. We do this before consuming the opening
21332 brace so the enum will be recorded as being on the line of its
21333 tag (or the 'enum' keyword, if there is no tag). */
21337 /* If the next token is not '{' it is an opaque-enum-specifier or an
21338 elaborated-type-specifier. */
21340 {
21345 {
21346 /* The following catches invalid code such as:
21347 enum class S<int>::E { A, B, C }; */
21355 {
21359 nested_name_specifier);
21361 }
21364 {
21366 "%qT for enum declaration does not name a class "
21369 }
21370 /* If that scope does not contain the scope in which the
21371 class was originally declared, the program is invalid. */
21373 nested_name_specifier))
21374 {
21377 "declaration of %qD in namespace %qD which does not "
21380 else
21382 "declaration of %qD in %qD which does not "
21386 }
21387 /* If that scope is the scope where the declaration is being placed
21388 the program is invalid. */
21392 {
21396 }
21397 }
21402 /* Consume the opening brace. */
21403 matching_braces braces;
21410 {
21414 }
21415 else
21416 {
21422 }
21426 /* If the next token is not '}', then there are some enumerators. */
21428 {
21430 /* Don't warn for enum {} a; here. */
21434 }
21435 else
21436 {
21437 /* We've seen a '{' so we know we're in an enum-specifier.
21438 Commit to any tentative parse to get syntax errors. */
21441 }
21443 /* Consume the final '}'. */
21448 }
21449 else
21450 {
21451 /* If a ';' follows, then it is an opaque-enum-specifier
21452 and additional restrictions apply. */
21454 {
21461 }
21462 }
21464 /* Look for trailing attributes to apply to this enumeration, and
21465 apply them if appropriate. */
21467 {
21470 trailing_attr,
21472 }
21474 /* Finish up the enumeration. */
21476 {
21481 }
21484 {
21486 {
21489 }
21492 }
21494 }
21496 /* Parse an enumerator-list. The enumerators all have the indicated
21497 TYPE.
21499 enumerator-list:
21500 enumerator-definition
21501 enumerator-list , enumerator-definition */
21503 static void
21505 {
21507 {
21508 /* Parse an enumerator-definition. */
21511 /* If the next token is not a ',', we've reached the end of
21512 the list. */
21515 /* Otherwise, consume the `,' and keep going. */
21517 /* If the next token is a `}', there is a trailing comma. */
21519 {
21524 }
21525 }
21526 }
21528 /* Parse an enumerator-definition. The enumerator has the indicated
21529 TYPE.
21531 enumerator-definition:
21532 enumerator
21533 enumerator = constant-expression
21535 enumerator:
21536 identifier
21538 GNU Extensions:
21540 enumerator-definition:
21541 enumerator attributes [opt]
21542 enumerator attributes [opt] = constant-expression */
21544 static void
21546 {
21547 tree identifier;
21548 tree value;
21549 location_t loc;
21551 /* Save the input location because we are interested in the location
21552 of the identifier and not the location of the explicit value. */
21555 /* Look for the identifier. */
21560 /* Parse any specified attributes. */
21563 /* If the next token is an '=', then there is an explicit value. */
21565 {
21566 /* Consume the `=' token. */
21568 /* Parse the value. */
21570 }
21571 else
21574 /* If we are processing a template, make sure the initializer of the
21575 enumerator doesn't contain any bare template parameter pack. */
21577 {
21578 /* In a lambda it should work, but doesn't currently. */
21580 {
21583 }
21584 }
21588 /* Create the enumerator. */
21590 }
21592 /* Parse a namespace-name.
21594 namespace-name:
21595 original-namespace-name
21596 namespace-alias
21598 Returns the NAMESPACE_DECL for the namespace. */
21600 static tree
21602 {
21603 tree identifier;
21604 tree namespace_decl;
21608 /* Get the name of the namespace. */
21613 /* Look up the identifier in the currently active scope. Look only
21614 for namespaces, due to:
21616 [basic.lookup.udir]
21618 When looking up a namespace-name in a using-directive or alias
21619 definition, only namespace names are considered.
21621 And:
21623 [basic.lookup.qual]
21625 During the lookup of a name preceding the :: scope resolution
21626 operator, object, function, and enumerator names are ignored.
21628 (Note that cp_parser_qualifying_entity only calls this
21629 function if the token after the name is the scope resolution
21630 operator.) */
21632 none_type,
21638 /* If it's not a namespace, issue an error. */
21641 {
21643 {
21644 auto_diagnostic_group d;
21645 name_hint hint;
21649 identifier,
21652 {
21658 }
21659 else
21661 identifier);
21662 }
21663 else
21666 }
21669 }
21671 /* Parse a namespace-definition.
21673 namespace-definition:
21674 named-namespace-definition
21675 unnamed-namespace-definition
21677 named-namespace-definition:
21678 original-namespace-definition
21679 extension-namespace-definition
21681 original-namespace-definition:
21682 namespace identifier { namespace-body }
21684 extension-namespace-definition:
21685 namespace original-namespace-name { namespace-body }
21687 unnamed-namespace-definition:
21688 namespace { namespace-body } */
21690 static void
21692 {
21693 tree identifier;
21703 {
21706 }
21708 /* Look for the `namespace' keyword. */
21709 cp_token* token
21712 /* Parse any specified attributes before the identifier. */
21716 {
21720 RID_INLINE);
21722 {
21726 "definitions only available with %<-std=c++20%> or "
21729 }
21732 {
21737 "standard attributes on namespaces must precede "
21740 /* Parse any attributes specified after the identifier. */
21742 }
21745 {
21746 /* Don't forget that the innermost namespace might have been
21747 marked as inline. Use |= because we cannot overwrite
21748 IS_INLINE in case the outermost namespace is inline, but
21749 there are no nested inlines. */
21752 }
21756 "nested namespace definitions only available with "
21759 /* Nested namespace names can create new namespaces (unlike
21760 other qualified-ids). */
21765 else
21768 }
21780 /* Start the namespace. */
21787 /* Look for the `{' to validate starting the namespace. */
21788 matching_braces braces;
21790 {
21791 /* Parse the body of the namespace. */
21794 /* Look for the final `}'. */
21796 }
21801 /* Pop the nested namespace definitions. */
21804 }
21806 /* Parse a namespace-body.
21808 namespace-body:
21809 declaration-seq [opt] */
21811 static void
21813 {
21815 }
21817 /* Parse a namespace-alias-definition.
21819 namespace-alias-definition:
21820 namespace identifier = qualified-namespace-specifier ; */
21822 static void
21824 {
21825 tree identifier;
21826 tree namespace_specifier;
21830 /* Look for the `namespace' keyword. */
21832 /* Look for the identifier. */
21836 /* Look for the `=' token. */
21839 {
21841 /* Skip the definition. */
21846 }
21848 /* Look for the qualified-namespace-specifier. */
21849 namespace_specifier
21852 /* Look for the `;' token. */
21855 /* Register the alias in the symbol table. */
21857 }
21859 /* Parse a qualified-namespace-specifier.
21861 qualified-namespace-specifier:
21862 :: [opt] nested-name-specifier [opt] namespace-name
21864 Returns a NAMESPACE_DECL corresponding to the specified
21865 namespace. */
21867 static tree
21869 {
21870 /* Look for the optional `::'. */
21874 /* Look for the optional nested-name-specifier. */
21882 }
21884 /* Subroutine of cp_parser_using_declaration. */
21886 static tree
21888 {
21891 {
21892 /* Create the USING_DECL. */
21901 /* Add it to the list of members in this class. */
21903 }
21904 else
21907 }
21909 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
21910 access declaration.
21912 using-declaration:
21913 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
21914 using :: unqualified-id ;
21916 access-declaration:
21917 qualified-id ;
21919 */
21921 static bool
21924 {
21928 tree identifier;
21929 tree qscope;
21934 {
21937 }
21938 else
21939 {
21940 /* Look for the `using' keyword. */
21943 again:
21944 /* Peek at the next token. */
21946 /* See if it's `typename'. */
21948 {
21949 /* Remember that we've seen it. */
21951 /* Consume the `typename' token. */
21953 }
21954 }
21956 /* Look for the optional global scope qualification. */
21957 global_scope_p
21962 /* If we saw `typename', or didn't see `::', then there must be a
21963 nested-name-specifier present. */
21965 {
21971 {
21974 }
21975 }
21976 /* Otherwise, we could be in either of the two productions. In that
21977 case, treat the nested-name-specifier as optional. */
21978 else
21992 /* If the qualifying scope of an access-declaration isn't a class
21993 or enumeration type then it can't be valid. */
21997 /* Something has already gone wrong; there's no need to parse
21998 further. Since an error has occurred, the return value of
21999 cp_parser_parse_definitely will be false, as required. */
22003 /* Parse the unqualified-id. */
22011 {
22016 }
22018 {
22022 "pack expansion in using-declaration only available "
22025 /* A parameter pack can appear in the qualifying scope, and/or in the
22026 terminal name (if naming a conversion function). Logically they're
22027 part of a single pack expansion of the overall USING_DECL, but we
22028 express them as separate pack expansions within the USING_DECL since
22029 we can't create a pack expansion over a USING_DECL. */
22032 {
22035 }
22039 {
22043 }
22045 {
22046 /* Issue an error in terms using a SCOPE_REF that includes both
22047 components. */
22048 tree name
22053 }
22054 }
22056 /* The function we call to handle a using-declaration is different
22057 depending on what scope we are in. */
22059 ;
22062 /* [namespace.udecl]
22064 A using declaration shall not name a template-id. */
22067 else
22068 {
22072 {
22075 }
22076 }
22080 {
22084 "comma-separated list in using-declaration only available "
22087 }
22089 /* Look for the final `;'. */
22094 "access declarations are deprecated "
22095 "in favour of using-declarations; "
22099 }
22101 /* C++20 using enum declaration.
22103 using-enum-declaration :
22104 using elaborated-enum-specifier ; */
22106 static void
22108 {
22111 /* Using cp_parser_elaborated_type_specifier rejects typedef-names, which
22112 breaks one of the motivating examples in using-enum-5.C.
22113 cp_parser_simple_type_specifier seems to be closer to what we actually
22114 want, though that hasn't been properly specified yet. */
22116 /* Consume 'enum'. */
22122 tree type = (cp_parser_simple_type_specifier
22129 {
22132 }
22136 /* The elaborated-enum-specifier shall not name a dependent type and the type
22137 shall have a reachable enum-specifier. */
22151 {
22153 auto_diagnostic_group g;
22157 ;
22160 else
22162 }
22164 /* A using-enum-declaration introduces the enumerator names of the named
22165 enumeration as if by a using-declaration for each enumerator. */
22169 }
22171 /* Parse an alias-declaration.
22173 alias-declaration:
22174 using identifier attribute-specifier-seq [opt] = type-id */
22176 static tree
22178 {
22182 cp_decl_specifier_seq decl_specs;
22186 /* Look for the `using' keyword. */
22187 cp_token *using_token
22209 /* Now we are going to parse the type-id of the declaration. */
22211 /*
22212 [dcl.type]/3 says:
22214 "A type-specifier-seq shall not define a class or enumeration
22215 unless it appears in the type-id of an alias-declaration (7.1.3) that
22216 is not the declaration of a template-declaration."
22218 In other words, if we currently are in an alias template, the
22219 type-id should not define a type.
22221 So let's set parser->type_definition_forbidden_message in that
22222 case; cp_parser_check_type_definition (called by
22223 cp_parser_class_specifier) will then emit an error if a type is
22224 defined in the type-id. */
22226 {
22230 }
22235 /* Restore the error message if need be. */
22241 {
22244 }
22246 /* A typedef-name can also be introduced by an alias-declaration. The
22247 identifier following the using keyword becomes a typedef-name. It has
22248 the same semantics as if it were introduced by the typedef
22249 specifier. In particular, it does not define a new type and it shall
22250 not appear in the type-id. */
22255 {
22258 ds_attribute,
22259 attrs_token);
22260 }
22262 ds_typedef,
22263 using_token);
22265 ds_alias,
22266 using_token);
22273 id_location,
22283 else
22294 /* If decl is a template, return its TEMPLATE_DECL so that it gets
22295 added into the symbol table; otherwise, return the TYPE_DECL. */
22299 {
22303 }
22306 }
22308 /* Parse a using-directive.
22310 using-directive:
22311 attribute-specifier-seq [opt] using namespace :: [opt]
22312 nested-name-specifier [opt] namespace-name ; */
22314 static void
22316 {
22317 tree namespace_decl;
22320 {
22321 /* Error during attribute parsing that resulted in skipping
22322 to next semicolon. */
22325 }
22327 /* Look for the `using' keyword. */
22329 /* And the `namespace' keyword. */
22331 /* Look for the optional `::' operator. */
22333 /* And the optional nested-name-specifier. */
22339 /* Get the namespace being used. */
22342 /* And any specified GNU attributes. */
22346 /* Update the symbol table. */
22349 /* Look for the final `;'. */
22351 }
22353 /* Parse an asm-definition.
22355 asm-qualifier:
22356 volatile
22357 inline
22358 goto
22360 asm-qualifier-list:
22361 asm-qualifier
22362 asm-qualifier-list asm-qualifier
22364 asm-definition:
22365 asm ( string-literal ) ;
22367 GNU Extension:
22369 asm-definition:
22370 asm asm-qualifier-list [opt] ( string-literal ) ;
22371 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt] ) ;
22372 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22373 : asm-operand-list [opt] ) ;
22374 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22375 : asm-operand-list [opt]
22376 : asm-clobber-list [opt] ) ;
22377 asm asm-qualifier-list [opt] ( string-literal : : asm-operand-list [opt]
22378 : asm-clobber-list [opt]
22379 : asm-goto-list ) ;
22381 The form with asm-goto-list is valid if and only if the asm-qualifier-list
22382 contains goto, and is the only allowed form in that case. No duplicates are
22383 allowed in an asm-qualifier-list. */
22385 static void
22387 {
22392 tree asm_stmt;
22399 /* Look for the `asm' keyword. */
22402 /* In C++20, unevaluated inline assembly is permitted in constexpr
22403 functions. */
22408 "function only available with %<-std=c++20%> or "
22411 /* Handle the asm-qualifier-list. */
22419 {
22423 {
22426 {
22430 }
22431 else
22432 {
22437 }
22443 {
22447 }
22448 else
22457 {
22461 }
22462 else
22477 }
22479 }
22486 {
22489 }
22491 /* Look for the opening `('. */
22494 /* Look for the string. */
22498 {
22502 }
22504 /* If we're allowing GNU extensions, check for the extended assembly
22505 syntax. Unfortunately, the `:' tokens need not be separated by
22506 a space in C, and so, for compatibility, we tolerate that here
22507 too. Doing that means that we have to treat the `::' operator as
22508 two `:' tokens. */
22513 {
22518 /* The extended syntax was used. */
22521 /* Look for outputs. */
22523 {
22524 /* Consume the `:'. */
22526 /* Parse the output-operands. */
22528 CPP_COLON)
22530 CPP_SCOPE)
22532 CPP_CLOSE_PAREN))
22533 {
22537 }
22538 }
22539 /* If the next token is `::', there are no outputs, and the
22540 next token is the beginning of the inputs. */
22542 /* The inputs are coming next. */
22545 /* Look for inputs. */
22548 {
22549 /* Consume the `:' or `::'. */
22551 /* Parse the output-operands. */
22553 CPP_COLON)
22555 CPP_SCOPE)
22557 CPP_CLOSE_PAREN))
22558 {
22562 }
22563 }
22565 /* The clobbers are coming next. */
22568 /* Look for clobbers. */
22571 {
22573 /* Consume the `:' or `::'. */
22575 /* Parse the clobbers. */
22577 CPP_COLON)
22579 CPP_CLOSE_PAREN))
22581 }
22583 /* The labels are coming next. */
22586 /* Look for labels. */
22589 {
22591 /* Consume the `:' or `::'. */
22593 /* Parse the labels. */
22595 }
22599 }
22603 /* Look for the closing `)'. */
22611 {
22612 /* Create the ASM_EXPR. */
22614 {
22617 /* If the extended syntax was not used, mark the ASM_EXPR. */
22619 {
22625 }
22626 }
22627 else
22629 }
22630 }
22632 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
22633 type that comes from the decl-specifier-seq. */
22635 static tree
22637 {
22640 {
22653 }
22656 }
22658 /* Warn about the most vexing parse syntactic ambiguity, i.e., warn when
22659 a construct looks like a variable definition but is actually a function
22660 declaration. DECL_SPECIFIERS is the decl-specifier-seq and DECLARATOR
22661 is the declarator for this function declaration. */
22663 static void
22666 {
22667 /* Only warn if we are declaring a function at block scope. */
22671 /* And only if there is no storage class specified. */
22683 /* Don't warn when the whole declarator (not just the declarator-id!)
22684 was parenthesized. That is, don't warn for int(n()) but do warn
22685 for int(f)(). */
22689 tree type;
22691 {
22696 /* If the return type is void there is no ambiguity. */
22699 }
22701 /* Code like long f(); will have null ->type. If we have any
22702 type-specifiers, pretend we've seen int. */
22704 else
22707 auto_diagnostic_group d;
22712 /* The T t() case. */
22714 {
22716 "empty parentheses were disambiguated as a function "
22718 {
22719 /* () means value-initialization (C++03 and up); {} (C++11 and up)
22720 means value-initialization or aggregate-initialization, nothing
22721 means default-initialization. We can only suggest removing the
22722 parentheses/adding {} if T has a default constructor. */
22724 {
22730 {
22734 else
22737 }
22738 }
22739 }
22741 }
22743 /* If we had (...) or the parameter-list wasn't parenthesized,
22744 we're done. */
22748 /* The T t(X()) case. */
22750 {
22752 "parentheses were disambiguated as a function "
22754 {
22756 /* {}-initialization means that we can use an initializer-list
22757 constructor if no default constructor is available, so don't
22758 suggest using {} for classes that have an initializer_list
22759 constructor. */
22761 {
22766 }
22767 else
22768 {
22772 }
22773 }
22774 }
22775 /* The T t(X(), X()) case. */
22777 "parentheses were disambiguated as a function "
22779 {
22782 {
22787 }
22788 }
22789 }
22791 /* If DECLARATOR with DECL_SPECS is a function declarator that has
22792 the form of a deduction guide, tag it as such. CTOR_DTOR_OR_CONV_P
22793 has the same meaning as in cp_parser_declarator. */
22795 static void
22800 {
22806 {
22814 {
22818 }
22819 }
22820 }
22822 /* Declarators [gram.dcl.decl] */
22824 /* Parse an init-declarator.
22826 init-declarator:
22827 declarator initializer [opt]
22829 GNU Extension:
22831 init-declarator:
22832 declarator asm-specification [opt] attributes [opt] initializer [opt]
22834 function-definition:
22835 decl-specifier-seq [opt] declarator ctor-initializer [opt]
22836 function-body
22837 decl-specifier-seq [opt] declarator function-try-block
22839 GNU Extension:
22841 function-definition:
22842 __extension__ function-definition
22844 TM Extension:
22846 function-definition:
22847 decl-specifier-seq [opt] declarator function-transaction-block
22849 The parser flags FLAGS is used to control type-specifier parsing.
22851 The DECL_SPECIFIERS apply to this declarator. Returns a
22852 representation of the entity declared. If MEMBER_P is TRUE, then
22853 this declarator appears in a class scope. The new DECL created by
22854 this declarator is returned.
22856 The CHECKS are access checks that should be performed once we know
22857 what entity is being declared (and, therefore, what classes have
22858 befriended it).
22860 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
22861 for a function-definition here as well. If the declarator is a
22862 declarator for a function-definition, *FUNCTION_DEFINITION_P will
22863 be TRUE upon return. By that point, the function-definition will
22864 have been completely parsed.
22866 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
22867 is FALSE.
22869 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
22870 parsed declaration if it is an uninitialized single declarator not followed
22871 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
22872 if present, will not be consumed. If returned, this declarator will be
22873 created with SD_INITIALIZED but will not call cp_finish_decl.
22875 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
22876 and there is an initializer, the pointed location_t is set to the
22877 location of the '=' or `(', or '{' in C++11 token introducing the
22878 initializer. */
22880 static tree
22882 cp_parser_flags flags,
22892 {
22896 tree prefix_attributes;
22898 tree asm_specification;
22899 tree initializer;
22901 tree scope;
22903 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
22904 initialized with "= ..", CPP_OPEN_PAREN if initialized with
22905 "(...)". */
22920 /* Assume that this is not the declarator for a function
22921 definition. */
22925 /* Default arguments are only permitted for function parameters. */
22929 /* Defer access checks while parsing the declarator; we cannot know
22930 what names are accessible until we know what is being
22931 declared. */
22936 /* Parse the declarator. */
22937 declarator
22942 /* Gather up the deferred checks. */
22947 /* If the DECLARATOR was erroneous, there's no need to go
22948 further. */
22952 /* Check that the number of template-parameter-lists is OK. */
22962 /* Figure out what scope the entity declared by the DECLARATOR is
22963 located in. `grokdeclarator' sometimes changes the scope, so
22964 we compute it now. */
22967 /* Perform any lookups in the declared type which were thought to be
22968 dependent, but are not in the scope of the declarator. */
22969 decl_specifiers->type
22972 /* If we're allowing GNU extensions, look for an
22973 asm-specification. */
22975 {
22976 /* Look for an asm-specification. */
22979 }
22980 else
22983 /* Gather the attributes that were provided with the
22984 decl-specifiers. */
22987 /* Look for attributes. */
22991 /* Peek at the next token. */
22997 {
22998 /* Handle C++17 deduction guides. Note that class-scope
22999 non-template deduction guides are instead handled in
23000 cp_parser_member_declaration. */
23002 decl_specifiers,
23003 declarator,
23009 /* Check to see if the token indicates the start of a
23010 function-definition. */
23012 {
23014 {
23015 /* If a function-definition should not appear here, issue an
23016 error message. */
23020 }
23022 location_t func_brace_location
23025 /* Neither attributes nor an asm-specification are allowed
23026 on a function-definition. */
23029 "an %<asm%> specification is not allowed "
23033 "attributes are not allowed "
23035 /* This is a function-definition. */
23038 /* Parse the function definition. */
23041 decl_specifiers,
23042 declarator,
23043 prefix_attributes);
23044 else
23045 decl =
23046 (cp_parser_function_definition_from_specifiers_and_declarator
23050 {
23051 /* This is where the prologue starts... */
23054 }
23057 }
23058 }
23060 {
23061 /* A non-template declaration involving a function parameter list
23062 containing an implicit template parameter will be made into a
23063 template. If the resulting declaration is not going to be an
23064 actual function then finish the template scope here to prevent it.
23065 An error message will be issued once we have a decl to talk about.
23067 FIXME probably we should do type deduction rather than create an
23068 implicit template, but the standard currently doesn't allow it. */
23071 }
23073 /* [dcl.dcl]
23075 Only in function declarations for constructors, destructors, type
23076 conversions, and deduction guides can the decl-specifier-seq be omitted.
23078 We explicitly postpone this check past the point where we handle
23079 function-definitions because we tolerate function-definitions
23080 that are missing their return types in some modes. */
23082 {
23086 }
23088 /* An `=' or an '{' in C++11, indicate an initializer. An '(' may indicate
23089 an initializer as well. */
23093 {
23094 /* Don't get fooled into thinking that F(i)(1)(2) is an initializer.
23095 It isn't; it's an expression. (Here '(i)' would have already been
23096 parsed as a declarator.) */
23099 {
23106 /* If this is an initializer, only a ',' or ';' can follow: either
23107 we have another init-declarator, or we're at the end of an
23108 init-declarator-list which can only be followed by a ';'. */
23113 /* Not an init-declarator. */
23115 }
23127 {
23133 }
23134 }
23135 else
23136 {
23137 /* If the init-declarator isn't initialized and isn't followed by a
23138 `,' or `;', it's not a valid init-declarator. */
23141 {
23144 else
23145 {
23149 }
23150 }
23153 }
23155 /* Because start_decl has side-effects, we should only call it if we
23156 know we're going ahead. By this point, we know that we cannot
23157 possibly be looking at any other construct. */
23160 /* Enter the newly declared entry in the symbol table. If we're
23161 processing a declaration in a class-specifier, we wait until
23162 after processing the initializer. */
23164 {
23172 /* Adjust location of decl if declarator->id_loc is more appropriate:
23173 set, and decl wasn't merged with another decl, in which case its
23174 location would be different from input_location, and more accurate. */
23179 }
23181 /* Enter the SCOPE. That way unqualified names appearing in the
23182 initializer will be looked up in SCOPE. */
23185 /* Perform deferred access control checks, now that we know in which
23186 SCOPE the declared entity resides. */
23188 {
23191 /* If the entity being declared is a function, pretend that we
23192 are in its scope. If it is a `friend', it may have access to
23193 things that would not otherwise be accessible. */
23195 {
23198 }
23200 /* Perform access checks for template parameters. */
23203 /* Perform the access control checks for the declarator and the
23204 decl-specifiers. */
23207 /* Restore the saved value. */
23210 }
23212 /* Parse the initializer. */
23217 {
23219 {
23222 else
23223 {
23224 /* If the declaration was erroneous, we don't really
23225 know what the user intended, so just silently
23226 consume the initializer. */
23233 }
23234 }
23235 else
23236 {
23237 /* We want to record the extra mangling scope for in-class
23238 initializers of class members and initializers of static
23239 data member templates and namespace-scope initializers.
23240 The former involves deferring parsing of the initializer
23241 until end of class as with default arguments. So right
23242 here we only handle the latter two. */
23246 && !member_p
23259 }
23260 }
23262 /* The old parser allows attributes to appear after a parenthesized
23263 initializer. Mark Mitchell proposed removing this functionality
23264 on the GCC mailing lists on 2002-08-13. This parser accepts the
23265 attributes -- but ignores them. Made a permerror in GCC 8. */
23271 {
23274 {
23278 }
23279 }
23281 /* And now complain about a non-function implicit template. */
23286 /* For an in-class declaration, use `grokfield' to create the
23287 declaration. */
23289 {
23291 {
23294 }
23303 }
23305 /* Finish processing the declaration. But, skip member
23306 declarations. */
23308 {
23311 asm_specification,
23312 /* If the initializer is in parentheses, then this is
23313 a direct-initialization, which means that an
23314 `explicit' constructor is OK. Otherwise, an
23315 `explicit' constructor cannot be used. */
23318 }
23321 /* Core issue #226 (C++0x only): A default template-argument
23322 shall not be specified in a friend class template
23323 declaration. */
23332 {
23335 else
23337 }
23344 }
23346 /* Parse a declarator.
23348 declarator:
23349 direct-declarator
23350 ptr-operator declarator
23352 abstract-declarator:
23353 ptr-operator abstract-declarator [opt]
23354 direct-abstract-declarator
23356 GNU Extensions:
23358 declarator:
23359 attributes [opt] direct-declarator
23360 attributes [opt] ptr-operator declarator
23362 abstract-declarator:
23363 attributes [opt] ptr-operator abstract-declarator [opt]
23364 attributes [opt] direct-abstract-declarator
23366 The parser flags FLAGS is used to control type-specifier parsing.
23368 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
23369 detect constructors, destructors, deduction guides, or conversion operators.
23370 It is set to -1 if the declarator is a name, and +1 if it is a
23371 function. Otherwise it is set to zero. Usually you just want to
23372 test for >0, but internally the negative value is used.
23374 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
23375 a decl-specifier-seq unless it declares a constructor, destructor,
23376 or conversion. It might seem that we could check this condition in
23377 semantic analysis, rather than parsing, but that makes it difficult
23378 to handle something like `f()'. We want to notice that there are
23379 no decl-specifiers, and therefore realize that this is an
23380 expression, not a declaration.)
23382 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
23383 the declarator is a direct-declarator of the form "(...)".
23385 MEMBER_P is true iff this declarator is a member-declarator.
23387 FRIEND_P is true iff this declarator is a friend.
23389 STATIC_P is true iff the keyword static was seen. */
23393 cp_parser_declarator_kind dcl_kind,
23394 cp_parser_flags flags,
23398 {
23401 cp_cv_quals cv_quals;
23402 tree class_type;
23405 /* Assume this is not a constructor, destructor, or type-conversion
23406 operator. */
23413 /* Check for the ptr-operator production. */
23415 /* Parse the ptr-operator. */
23421 /* If that worked, then we have a ptr-operator. */
23423 {
23424 /* If a ptr-operator was found, then this declarator was not
23425 parenthesized. */
23428 /* The dependent declarator is optional if we are parsing an
23429 abstract-declarator. */
23433 /* Parse the dependent declarator. */
23439 /* If we are parsing an abstract-declarator, we must handle the
23440 case where the dependent declarator is absent. */
23445 declarator = cp_parser_make_indirect_declarator
23447 }
23448 /* Everything else is a direct-declarator. */
23449 else
23450 {
23453 CPP_OPEN_PAREN);
23457 }
23462 }
23464 /* Parse a direct-declarator or direct-abstract-declarator.
23466 direct-declarator:
23467 declarator-id
23468 direct-declarator ( parameter-declaration-clause )
23469 cv-qualifier-seq [opt]
23470 ref-qualifier [opt]
23471 exception-specification [opt]
23472 direct-declarator [ constant-expression [opt] ]
23473 ( declarator )
23475 direct-abstract-declarator:
23476 direct-abstract-declarator [opt]
23477 ( parameter-declaration-clause )
23478 cv-qualifier-seq [opt]
23479 ref-qualifier [opt]
23480 exception-specification [opt]
23481 direct-abstract-declarator [opt] [ constant-expression [opt] ]
23482 ( abstract-declarator )
23484 Returns a representation of the declarator. DCL_KIND is
23485 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
23486 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
23487 we are parsing a direct-declarator. It is
23488 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
23489 of ambiguity we prefer an abstract declarator, as per
23490 [dcl.ambig.res].
23491 The parser flags FLAGS is used to control type-specifier parsing.
23492 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
23493 as for cp_parser_declarator. */
23497 cp_parser_declarator_kind dcl_kind,
23498 cp_parser_flags flags,
23501 {
23512 {
23513 /* Peek at the next token. */
23516 {
23517 /* This is either a parameter-declaration-clause, or a
23518 parenthesized declarator. When we know we are parsing a
23519 named declarator, it must be a parenthesized declarator
23520 if FIRST is true. For instance, `(int)' is a
23521 parameter-declaration-clause, with an omitted
23522 direct-abstract-declarator. But `((*))', is a
23523 parenthesized abstract declarator. Finally, when T is a
23524 template parameter `(T)' is a
23525 parameter-declaration-clause, and not a parenthesized
23526 named declarator.
23528 We first try and parse a parameter-declaration-clause,
23529 and then try a nested declarator (if FIRST is true).
23531 It is not an error for it not to be a
23532 parameter-declaration-clause, even when FIRST is
23533 false. Consider,
23535 int i (int);
23536 int i (3);
23538 The first is the declaration of a function while the
23539 second is the definition of a variable, including its
23540 initializer.
23542 Having seen only the parenthesis, we cannot know which of
23543 these two alternatives should be selected. Even more
23544 complex are examples like:
23546 int i (int (a));
23547 int i (int (3));
23549 The former is a function-declaration; the latter is a
23550 variable initialization.
23552 Thus again, we try a parameter-declaration-clause, and if
23553 that fails, we back out and return. */
23556 {
23557 tree params;
23562 /* In a member-declarator, the only valid interpretation
23563 of a parenthesis is the start of a
23564 parameter-declaration-clause. (It is invalid to
23565 initialize a static data member with a parenthesized
23566 initializer; only the "=" form of initialization is
23567 permitted.) */
23571 /* Consume the `('. */
23573 matching_parens parens;
23576 {
23577 /* If this is going to be an abstract declarator, we're
23578 in a declarator and we can't have default args. */
23581 }
23585 /* Parse the parameter-declaration-clause. */
23586 params
23588 const location_t parens_end
23591 /* Consume the `)'. */
23594 /* If all went well, parse the cv-qualifier-seq,
23595 ref-qualifier and the exception-specification. */
23597 {
23598 cp_cv_quals cv_quals;
23599 cp_virt_specifiers virt_specifiers;
23600 cp_ref_qualifier ref_qual;
23601 tree exception_specification;
23602 tree late_return;
23603 tree attrs;
23606 unsigned char local_variables_forbidden_p
23608 /* 'this' is not allowed in static member functions. */
23618 /* Parse the cv-qualifier-seq. */
23620 /* Parse the ref-qualifier. */
23622 /* Parse the tx-qualifier. */
23628 /* DR 1207: 'this' is in scope after the cv-quals. */
23631 /* If it turned out that this is e.g. a pointer to a
23632 function, we don't want to delay noexcept parsing. */
23636 /* Parse the exception-specification. */
23637 exception_specification
23639 flags);
23643 cp_omp_declare_simd_data odsd;
23645 && declarator
23648 {
23652 }
23654 /* In here, we handle cases where attribute is used after
23655 the function declaration. For example:
23656 void func (int x) __attribute__((vector(..))); */
23659 late_return
23661 requires_clause);
23665 /* Parse the virt-specifier-seq. */
23669 parens_start,
23670 parens_end);
23671 /* Create the function-declarator. */
23673 params,
23674 cv_quals,
23675 virt_specifiers,
23676 ref_qual,
23677 tx_qual,
23678 exception_specification,
23679 late_return,
23680 requires_clause,
23681 attrs,
23682 parens_loc);
23684 /* Any subsequent parameter lists are to do with
23685 return type, so are not those of the declared
23686 function. */
23692 /* Restore the state of local_variables_forbidden_p. */
23693 parser->local_variables_forbidden_p
23695 }
23697 /* Remove the function parms from scope. */
23701 /* Repeat the main loop. */
23703 }
23705 /* If this is the first, we can try a parenthesized
23706 declarator. */
23708 {
23715 /* Consume the `('. */
23716 matching_parens parens;
23718 /* Parse the nested declarator. */
23721 declarator
23723 ctor_dtor_or_conv_p,
23729 /* Expect a `)'. */
23737 }
23738 /* Otherwise, we must be done. */
23739 else
23741 }
23745 {
23746 /* Parse an array-declarator. */
23756 /* Consume the `['. */
23758 /* Peek at the next token. */
23760 /* If the next token is `]', then there is no
23761 constant-expression. */
23763 {
23765 bounds
23777 {
23778 /* Normally, the array bound must be an integral constant
23779 expression. However, as an extension, we allow VLAs
23780 in function scopes as long as they aren't part of a
23781 parameter declaration. */
23785 }
23788 {
23789 /* Remember this wasn't a constant-expression. */
23792 }
23793 }
23794 else
23796 /* Look for the closing `]'. */
23798 {
23801 }
23806 }
23808 {
23809 {
23810 tree qualifying_scope;
23811 tree unqualified_name;
23812 tree attrs;
23813 special_function_kind sfk;
23818 /* Parse a declarator-id */
23821 {
23824 /* If we see an ellipsis, we should be looking at a
23825 parameter pack. */
23827 {
23828 /* Consume the `...' */
23832 }
23833 }
23836 unqualified_name
23840 {
23844 {
23845 /* Check whether an error occurred. */
23848 /* We already consumed the ellipsis to mark a
23849 parameter pack, but we have no way to report it,
23850 so abort the tentative parse. We will be exiting
23851 immediately anyway. */
23853 }
23854 else
23860 && (qualifying_scope
23862 {
23865 }
23866 }
23871 {
23876 }
23882 {
23883 /* In the declaration of a member of a template class
23884 outside of the class itself, the SCOPE will sometimes
23885 be a TYPENAME_TYPE. For example, given:
23887 template <typename T>
23888 int S<T>::R::i = 3;
23890 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
23891 this context, we must resolve S<T>::R to an ordinary
23892 type, rather than a typename type.
23894 The reason we normally avoid resolving TYPENAME_TYPEs
23895 is that a specialization of `S' might render
23896 `S<T>::R' not a type. However, if `S' is
23897 specialized, then this `i' will not be used, so there
23898 is no harm in resolving the types here. */
23899 tree type;
23901 /* Resolve the TYPENAME_TYPE. */
23904 /* If that failed, the declarator is invalid. */
23906 {
23909 "cannot define member of dependent typedef "
23911 else
23916 }
23918 }
23923 {
23924 tree class_type;
23929 else
23933 {
23937 {
23938 /* We do not attempt to print the declarator
23939 here because we do not have enough
23940 information about its original syntactic
23941 form. */
23945 }
23948 {
23952 "use %<%T::%D%> instead of %<%T::%D%> to "
23954 class_type,
23959 }
23961 }
23964 {
23971 for an unnamed type, even if the type
23972 got a name for linkage purposes. */
23974 /* Handle correctly (c++/19200):
23976 struct S {
23977 struct T{};
23978 friend void S(T);
23979 };
23981 and also:
23983 namespace N {
23984 void S();
23985 }
23987 struct S {
23988 friend void N::S();
23989 }; */
23992 class_type))
24001 }
24002 }
24004 unqualified_name,
24012 /* We're looking for this case in [temp.res]:
24013 A qualified-id is assumed to name a type if [...]
24014 - it is a decl-specifier of the decl-specifier-seq of a
24015 parameter-declaration in a declarator of a function or
24016 function template declaration, ... */
24022 {
24023 /* ...whose declarator-id is qualified. If it isn't, never
24024 assume the parameters to refer to types. */
24027 else
24028 {
24029 /* Now we have something like
24030 template <typename T> int C::x(S::p);
24031 which can be a function template declaration or a
24032 variable template definition. If name lookup for
24033 the declarator-id C::x finds one or more function
24034 templates, assume S::p to name a type. Otherwise,
24035 don't. */
24036 tree decl
24038 none_type,
24046 /* Allow
24047 template<typename T>
24048 A<T>::A(T::type) { } */
24051 qualifying_scope)))
24053 }
24054 }
24055 }
24057 handle_declarator:;
24060 {
24061 /* Any names that appear after the declarator-id for a
24062 member are looked up in the containing scope. */
24064 {
24065 /* But declarations with qualified-ids can't appear in a
24066 function. */
24070 }
24072 }
24076 /* Default args are only allowed on function
24077 declarations. */
24079 else
24083 }
24084 /* We're done. */
24085 else
24087 }
24089 /* For an abstract declarator, we might wind up with nothing at this
24090 point. That's an error; the declarator is not optional. */
24094 {
24095 /* Record overly parenthesized declarator so we can give a
24096 diagnostic about confusing decl/expr disambiguation. */
24098 {
24099 /* If the open and close parens are on different lines, this
24100 is probably a formatting thing, so ignore. */
24105 }
24110 }
24112 /* If we entered a scope, we must exit it now. */
24120 }
24122 /* Parse a ptr-operator.
24124 ptr-operator:
24125 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24126 * cv-qualifier-seq [opt]
24127 &
24128 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
24129 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24131 GNU Extension:
24133 ptr-operator:
24134 & cv-qualifier-seq [opt]
24136 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
24137 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
24138 an rvalue reference. In the case of a pointer-to-member, *TYPE is
24139 filled in with the TYPE containing the member. *CV_QUALS is
24140 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
24141 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
24142 Note that the tree codes returned by this function have nothing
24143 to do with the types of trees that will be eventually be created
24144 to represent the pointer or reference type being parsed. They are
24145 just constants with suggestive names. */
24146 static enum tree_code
24151 {
24156 /* Assume that it's not a pointer-to-member. */
24158 /* And that there are no cv-qualifiers. */
24161 /* Peek at the next token. */
24164 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
24174 {
24175 /* Consume the `*', `&' or `&&'. */
24178 /* A `*' can be followed by a cv-qualifier-seq, and so can a
24179 `&', if we are allowing GNU extensions. (The only qualifier
24180 that can legally appear after `&' is `restrict', but that is
24181 enforced during semantic analysis. */
24189 }
24190 else
24191 {
24192 /* Try the pointer-to-member case. */
24194 /* Look for the optional `::' operator. */
24197 /* Look for the nested-name specifier. */
24204 /* If we found it, and the next token is a `*', then we are
24205 indeed looking at a pointer-to-member operator. */
24208 {
24209 /* Indicate that the `*' operator was used. */
24217 else
24218 {
24219 /* The type of which the member is a member is given by the
24220 current SCOPE. */
24222 /* The next name will not be qualified. */
24226 /* Look for optional c++11 attributes. */
24230 /* Look for the optional cv-qualifier-seq. */
24232 }
24233 }
24234 /* If that didn't work we don't have a ptr-operator. */
24237 }
24240 }
24242 /* Parse an (optional) cv-qualifier-seq.
24244 cv-qualifier-seq:
24245 cv-qualifier cv-qualifier-seq [opt]
24247 cv-qualifier:
24248 const
24249 volatile
24251 GNU Extension:
24253 cv-qualifier:
24254 __restrict__
24256 Returns a bitmask representing the cv-qualifiers. */
24258 static cp_cv_quals
24260 {
24264 {
24266 cp_cv_quals cv_qualifier;
24268 /* Peek at the next token. */
24270 /* See if it's a cv-qualifier. */
24272 {
24288 }
24294 {
24299 }
24300 else
24301 {
24304 }
24305 }
24308 }
24310 /* Parse an (optional) ref-qualifier
24312 ref-qualifier:
24313 &
24314 &&
24316 Returns cp_ref_qualifier representing ref-qualifier. */
24318 static cp_ref_qualifier
24320 {
24323 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
24328 {
24333 {
24345 }
24350 {
24353 }
24354 else
24355 {
24358 }
24359 }
24362 }
24364 /* Parse an optional tx-qualifier.
24366 tx-qualifier:
24367 transaction_safe
24368 transaction_safe_dynamic */
24370 static tree
24372 {
24375 {
24380 {
24384 {
24387 {
24390 }
24391 else
24393 }
24394 }
24395 }
24397 }
24399 /* Parse an (optional) virt-specifier-seq.
24401 virt-specifier-seq:
24402 virt-specifier virt-specifier-seq [opt]
24404 virt-specifier:
24405 override
24406 final
24408 Returns a bitmask representing the virt-specifiers. */
24410 static cp_virt_specifiers
24412 {
24416 {
24418 cp_virt_specifiers virt_specifier;
24420 /* Peek at the next token. */
24422 /* See if it's a virt-specifier-qualifier. */
24426 {
24429 }
24431 {
24434 }
24436 {
24438 }
24439 else
24443 {
24448 }
24449 else
24450 {
24453 }
24454 }
24456 }
24458 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
24459 is in scope even though it isn't real. */
24461 void
24463 {
24464 tree this_parm;
24467 {
24468 /* We don't clear this between NSDMIs. Is it already what we want? */
24475 }
24478 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
24480 current_class_ref
24483 }
24485 /* Return true iff our current scope is a non-static data member
24486 initializer. */
24488 bool
24490 {
24491 /* We recognize NSDMI context by the context-less 'this' pointer set up
24492 by the function above. */
24498 }
24500 /* True if we're parsing a function declarator. */
24502 bool
24504 {
24505 /* this_entity is NULL for a function parameter scope while parsing the
24506 declarator; it is set when parsing the body of the function. */
24509 }
24511 /* Parse a late-specified return type, if any. This is not a separate
24512 non-terminal, but part of a function declarator, which looks like
24514 -> trailing-type-specifier-seq abstract-declarator(opt)
24516 Returns the type indicated by the type-id.
24518 In addition to this, parse any queued up #pragma omp declare simd
24519 clauses, and #pragma acc routine clauses.
24521 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
24522 function. */
24524 static tree
24527 {
24531 && declarator
24535 && declarator
24538 /* Peek at the next token. */
24540 /* A late-specified return type is indicated by an initial '->'. */
24549 {
24550 /* Consume the ->. */
24554 }
24556 /* Function declarations may be followed by a trailing
24557 requires-clause. */
24561 declarator->attributes
24565 declarator->attributes
24570 }
24572 /* Parse a declarator-id.
24574 declarator-id:
24575 id-expression
24576 :: [opt] nested-name-specifier [opt] type-name
24578 In the `id-expression' case, the value returned is as for
24579 cp_parser_id_expression if the id-expression was an unqualified-id.
24580 If the id-expression was a qualified-id, then a SCOPE_REF is
24581 returned. The first operand is the scope (either a NAMESPACE_DECL
24582 or TREE_TYPE), but the second is still just a representation of an
24583 unqualified-id. */
24585 static tree
24587 {
24588 tree id;
24589 /* The expression must be an id-expression. Assume that qualified
24590 names are the names of types so that:
24592 template <class T>
24593 int S<T>::R::i = 3;
24595 will work; we must treat `S<T>::R' as the name of a type.
24596 Similarly, assume that qualified names are templates, where
24597 required, so that:
24599 template <class T>
24600 int S<T>::R<T>::i = 3;
24602 will work, too. */
24608 optional_p);
24612 }
24614 /* Parse a type-id.
24616 type-id:
24617 type-specifier-seq abstract-declarator [opt]
24619 The parser flags FLAGS is used to control type-specifier parsing.
24621 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
24623 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24624 i.e. we've just seen "->".
24626 Returns the TYPE specified. */
24628 static tree
24632 {
24633 cp_decl_specifier_seq type_specifier_seq;
24636 /* Parse the type-specifier-seq. */
24639 is_trailing_return,
24647 /* A bare template name as a template argument is a template template
24648 argument, not a placeholder, so fail parsing it as a type argument. */
24649 {
24653 }
24657 /* There might or might not be an abstract declarator. */
24659 /* Look for the declarator. */
24660 abstract_declarator
24667 /* Check to see if there really was a declarator. */
24672 /* The concepts TS allows 'auto' as a type-id. */
24675 /* DR 625 prohibits use of auto as a template-argument. We allow 'auto'
24676 outside the template-argument-list context here only for the sake of
24677 diagnostic: grokdeclarator then can emit a better error message for
24678 e.g. using T = auto. */
24684 && !auto_typeid_ok
24685 /* None of the valid uses of 'auto' in C++14 involve the type-id
24686 nonterminal, but it is valid in a trailing-return-type. */
24689 {
24690 /* A type-id with type 'auto' is only ok if the abstract declarator
24691 is a function declarator with a late-specified return type.
24693 A type-id with 'auto' is also valid in a trailing-return-type
24694 in a compound-requirement. */
24701 else
24702 {
24704 {
24707 {
24708 auto_diagnostic_group g;
24712 tmpl);
24714 tmpl);
24715 }
24718 auto_node);
24719 else
24721 }
24723 }
24724 }
24727 is_template_arg);
24728 }
24730 /* Wrapper for cp_parser_type_id_1. */
24732 static tree
24735 {
24737 }
24739 /* Wrapper for cp_parser_type_id_1. */
24741 static tree
24743 {
24744 tree r;
24746 parser->type_definition_forbidden_message
24751 }
24753 /* Wrapper for cp_parser_type_id_1. */
24755 static tree
24757 {
24760 }
24762 /* Parse a type-specifier-seq.
24764 type-specifier-seq:
24765 type-specifier type-specifier-seq [opt]
24767 GNU extension:
24769 type-specifier-seq:
24770 attributes type-specifier-seq [opt]
24772 The parser flags FLAGS is used to control type-specifier parsing.
24774 If IS_DECLARATION is true, we are at the start of a "condition" or
24775 exception-declaration, so we might be followed by a declarator-id.
24777 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24778 i.e. we've just seen "->".
24780 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
24782 static void
24784 cp_parser_flags flags,
24788 {
24792 /* Clear the TYPE_SPECIFIER_SEQ. */
24796 /* In the context of a trailing return type, enum E { } is an
24797 elaborated-type-specifier followed by a function-body, not an
24798 enum-specifier. */
24802 /* Parse the type-specifiers and attributes. */
24804 {
24805 tree type_specifier;
24808 /* Check for attributes first. */
24810 {
24811 /* GNU attributes at the end of a declaration apply to the
24812 declaration as a whole, not to the trailing return type. So look
24813 ahead to see if these attributes are at the end. */
24816 {
24822 }
24823 type_specifier_seq->attributes
24827 }
24829 /* record the token of the beginning of the type specifier seq,
24830 for error reporting purposes*/
24834 /* Look for the type-specifier. */
24836 flags,
24837 type_specifier_seq,
24839 NULL,
24842 {
24843 /* If the first type-specifier could not be found, this is not a
24844 type-specifier-seq at all. */
24846 {
24847 /* Set in_declarator_p to avoid skipping to the semicolon. */
24859 }
24860 /* If subsequent type-specifiers could not be found, the
24861 type-specifier-seq is complete. */
24863 }
24866 /* The standard says that a condition can be:
24868 type-specifier-seq declarator = assignment-expression
24870 However, given:
24872 struct S {};
24873 if (int S = ...)
24875 we should treat the "S" as a declarator, not as a
24876 type-specifier. The standard doesn't say that explicitly for
24877 type-specifier-seq, but it does say that for
24878 decl-specifier-seq in an ordinary declaration. Perhaps it
24879 would be clearer just to allow a decl-specifier-seq here, and
24880 then add a semantic restriction that if any decl-specifiers
24881 that are not type-specifiers appear, the program is invalid. */
24884 }
24885 }
24887 /* Return whether the function currently being declared has an associated
24888 template parameter list. */
24890 static bool
24892 {
24905 }
24907 /* Parse a parameter-declaration-clause.
24909 parameter-declaration-clause:
24910 parameter-declaration-list [opt] ... [opt]
24911 parameter-declaration-list , ...
24913 The parser flags FLAGS is used to control type-specifier parsing.
24915 Returns a representation for the parameter declarations. A return
24916 value of NULL indicates a parameter-declaration-clause consisting
24917 only of an ellipsis. */
24919 static tree
24921 cp_parser_flags flags)
24922 {
24923 tree parameters;
24931 && !processing_template_parmlist
24932 && !processing_explicit_instantiation
24933 /* default_arg_ok_p tracks whether this is a parameter-clause for an
24934 actual function or a random abstract declarator. */
24940 /* Peek at the next token. */
24942 /* Check for trivial parameter-declaration-clauses. */
24944 {
24945 /* Consume the `...' token. */
24948 }
24950 /* There are no parameters. */
24952 /* Check for `(void)', too, which is a special case. */
24956 {
24957 /* Consume the `void' token. */
24959 /* There are no parameters. */
24961 }
24963 /* A vector of parameters that haven't been pushed yet. */
24966 /* Parse the parameter-declaration-list. */
24969 /* If a parse error occurred while parsing the
24970 parameter-declaration-list, then the entire
24971 parameter-declaration-clause is erroneous. */
24975 /* Peek at the next token. */
24977 /* If it's a `,', the clause should terminate with an ellipsis. */
24979 {
24980 /* Consume the `,'. */
24982 /* Expect an ellipsis. */
24983 ellipsis_p
24985 }
24986 /* It might also be `...' if the optional trailing `,' was
24987 omitted. */
24989 {
24990 /* Consume the `...' token. */
24992 /* And remember that we saw it. */
24994 }
24995 else
24998 /* A valid parameter-declaration-clause can only be followed by a ')'.
24999 So it's time to push all the parameters we have seen now that we
25000 know we have a valid declaration. Note that here we may not have
25001 committed yet, nor should we. Pushing here will detect the error
25002 of redefining a parameter. */
25007 /* Finish the parameter list. */
25012 }
25014 /* Parse a parameter-declaration-list.
25016 parameter-declaration-list:
25017 parameter-declaration
25018 parameter-declaration-list , parameter-declaration
25020 The parser flags FLAGS is used to control type-specifier parsing.
25021 PENDING_DECLS is a vector of parameters that haven't been pushed yet.
25023 Returns a representation of the parameter-declaration-list, as for
25024 cp_parser_parameter_declaration_clause. However, the
25025 `void_list_node' is never appended to the list. */
25027 static tree
25029 cp_parser_flags flags,
25031 {
25037 /* The special considerations that apply to a function within an
25038 unbraced linkage specifications do not apply to the parameters
25039 to the function. */
25040 saved_in_unbraced_linkage_specification_p
25044 /* Look for more parameters. */
25046 {
25051 /* Parse the parameter. */
25052 parameter
25057 /* We don't know yet if the enclosing context is unavailable or deprecated,
25058 so wait and deal with it in grokparms if appropriate. */
25062 {
25065 PARM,
25070 }
25074 /* If a parse error occurred parsing the parameter declaration,
25075 then the entire parameter-declaration-list is erroneous. */
25077 {
25080 }
25087 {
25088 /* We cannot always pushdecl while parsing tentatively because
25089 it may have side effects and we can't be sure yet if we're
25090 parsing a declaration, e.g.:
25092 S foo(int(x), int(x), int{x});
25094 where it's not clear if we're dealing with a constructor call
25095 or a function declaration until we've seen the last argument
25096 which breaks it up.
25097 It's safe to pushdecl so long as it doesn't result in a clash
25098 with an already-pushed parameter. But we don't delay pushing
25099 different parameters to handle
25101 S foo(int(i), decltype(i) j = 42);
25103 which is valid. */
25106 /* See if PARAMETERS already contains a parameter with the same
25107 DECL_NAME as DECL. */
25113 }())
25115 else
25117 }
25120 {
25124 }
25126 /* Add the new parameter to the list. */
25130 /* If the parameters were parenthesized, it's the case of
25131 T foo(X(x)) which looks like a variable definition but
25132 is a function declaration. */
25136 /* Peek at the next token. */
25139 /* These are for Objective-C++ */
25142 /* The parameter-declaration-list is complete. */
25145 {
25148 /* Peek at the next token. */
25150 /* If it's an ellipsis, then the list is complete. */
25153 /* Otherwise, there must be more parameters. Consume the
25154 `,'. */
25156 /* When parsing something like:
25158 int i(float f, double d)
25160 we can tell after seeing the declaration for "f" that we
25161 are not looking at an initialization of a variable "i",
25162 but rather at the declaration of a function "i".
25164 Due to the fact that the parsing of template arguments
25165 (as specified to a template-id) requires backtracking we
25166 cannot use this technique when inside a template argument
25167 list. */
25171 /* However, a parameter-declaration of the form
25172 "float(f)" (which is a valid declaration of a
25173 parameter "f") can also be interpreted as an
25174 expression (the conversion of "f" to "float"). */
25177 }
25178 else
25179 {
25187 }
25188 }
25190 parser->in_unbraced_linkage_specification_p
25193 /* Reset implicit_template_scope if we are about to leave the function
25194 parameter list that introduced it. Note that for out-of-line member
25195 definitions, there will be one or more class scopes before we get to
25196 the template parameter scope. */
25200 {
25204 {
25207 }
25208 }
25211 }
25213 /* Parse a parameter declaration.
25215 parameter-declaration:
25216 decl-specifier-seq ... [opt] declarator
25217 decl-specifier-seq declarator = assignment-expression
25218 decl-specifier-seq ... [opt] abstract-declarator [opt]
25219 decl-specifier-seq abstract-declarator [opt] = assignment-expression
25221 The parser flags FLAGS is used to control type-specifier parsing.
25223 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
25224 declares a template parameter. (In that case, a non-nested `>'
25225 token encountered during the parsing of the assignment-expression
25226 is not interpreted as a greater-than operator.)
25228 Returns a representation of the parameter, or NULL if an error
25229 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
25230 true iff the declarator is of the form "(p)". */
25234 cp_parser_flags flags,
25237 {
25239 cp_decl_specifier_seq decl_specifiers;
25241 tree default_argument;
25246 /* In a template parameter, `>' is not an operator.
25248 [temp.param]
25250 When parsing a default template-argument for a non-type
25251 template-parameter, the first non-nested `>' is taken as the end
25252 of the template parameter-list rather than a greater-than
25253 operator. */
25255 /* Type definitions may not appear in parameter types. */
25257 parser->type_definition_forbidden_message
25264 /* Parse the declaration-specifiers. */
25267 flags,
25271 /* [dcl.spec.auto.general]: "A placeholder-type-specifier of the form
25272 type-constraint opt auto can be used as a decl-specifier of the
25273 decl-specifier-seq of a parameter-declaration of a function declaration
25274 or lambda-expression..." but we must not synthesize an implicit template
25275 type parameter in its declarator. That is, in "void f(auto[auto{10}]);"
25276 we want to synthesize only the first auto. */
25280 /* Complain about missing 'typename' or other invalid type names. */
25285 /* If an error occurred, there's no reason to attempt to parse the
25286 rest of the declaration. */
25288 {
25291 }
25293 /* Peek at the next token. */
25296 /* If the next token is a `)', `,', `=', `>', or `...', then there
25297 is no declarator. However, when variadic templates are enabled,
25298 there may be a declarator following `...'. */
25303 {
25307 }
25308 /* Otherwise, there should be a declarator. */
25309 else
25310 {
25314 /* After seeing a decl-specifier-seq, if the next token is not a
25315 "(" or "{", there is no possibility that the code is a valid
25316 expression. Therefore, if parsing tentatively, we commit at
25317 this point. */
25319 /* In an expression context, having seen:
25321 (int((char ...
25323 we cannot be sure whether we are looking at a
25324 function-type (taking a "char" as a parameter) or a cast
25325 of some object of type "char" to "int". */
25329 {
25331 {
25334 /* This is a CTAD expression, not a parameter declaration. */
25336 }
25337 else
25339 }
25340 /* Parse the declarator. */
25343 CP_PARSER_DECLARATOR_EITHER,
25344 CP_PARSER_FLAGS_NONE,
25346 parenthesized_p,
25351 /* After the declarator, allow more attributes. */
25352 decl_specifiers.attributes
25356 /* If the declarator is a template parameter pack, remember that and
25357 clear the flag in the declarator itself so we don't get errors
25358 from grokdeclarator. */
25360 {
25363 }
25364 }
25366 /* If the next token is an ellipsis, and we have not seen a declarator
25367 name, and if either the type of the declarator contains parameter
25368 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
25369 for, eg, abbreviated integral type names), then we actually have a
25370 parameter pack expansion expression. Otherwise, leave the ellipsis
25371 for a C-style variadic function. */
25374 /* If a function parameter pack was specified and an implicit template
25375 parameter was introduced during cp_parser_parameter_declaration,
25376 change any implicit parameters introduced into packs. */
25381 {
25389 }
25392 {
25403 {
25404 /* Consume the `...'. */
25408 /* Build a pack expansion type */
25413 else
25415 }
25416 }
25418 /* The restriction on defining new types applies only to the type
25419 of the parameter, not to the default argument. */
25422 /* If the next token is `=', then process a default argument. */
25424 {
25429 /* If we are defining a class, then the tokens that make up the
25430 default argument must be saved and processed later. */
25436 /* A constrained-type-specifier may declare a type
25437 template-parameter. */
25439 default_argument
25442 /* A constrained-type-specifier may declare a
25443 template-template-parameter. */
25445 default_argument
25448 /* Outside of a class definition, we can just parse the
25449 assignment-expression. */
25450 else
25451 default_argument
25455 {
25457 "default arguments are only "
25459 }
25461 || template_parameter_pack_p
25464 {
25465 /* Find the name of the parameter pack. */
25472 template_parm_p
25478 else
25480 template_parm_p
25487 }
25488 }
25489 else
25495 /* Generate a location for the parameter, ranging from the start of the
25496 initial token to the end of the final token (using input_location for
25497 the latter, set up by cp_lexer_set_source_position_from_token when
25498 consuming tokens).
25500 If we have a identifier, then use it for the caret location, e.g.
25502 extern int callee (int one, int (*two)(int, int), float three);
25503 ~~~~~~^~~~~~~~~~~~~~
25505 otherwise, reuse the start location for the caret location e.g.:
25507 extern int callee (int one, int (*)(int, int), float three);
25508 ^~~~~~~~~~~~~~~~~
25510 */
25516 input_location);
25519 declarator,
25520 default_argument,
25521 param_loc,
25522 template_parameter_pack_p);
25523 }
25525 /* Parse a default argument and return it.
25527 TEMPLATE_PARM_P is true if this is a default argument for a
25528 non-type template parameter. */
25529 static tree
25531 {
25536 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
25537 set correctly. */
25544 /* Local variable names (and the `this' keyword) may not
25545 appear in a default argument. */
25548 /* Parse the assignment-expression. */
25553 /* The "this" pointer is not valid in a default argument. */
25555 {
25560 }
25562 /* Restore the "this" pointer. */
25564 {
25567 }
25576 }
25578 /* Parse a function-body.
25580 function-body:
25581 compound_statement */
25583 static void
25585 {
25589 }
25591 /* Parse a ctor-initializer-opt followed by a function-body. Return
25592 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
25593 is true we are parsing a function-try-block. */
25595 static void
25598 {
25600 const bool check_body_p
25608 {
25611 "function-try-block body of %<constexpr%> constructor only "
25613 else
25615 "function-try-block body of %<constexpr%> function only "
25617 }
25619 /* Begin the function body. */
25621 /* Parse the optional ctor-initializer. */
25624 /* If we're parsing a constexpr constructor definition, we need
25625 to check that the constructor body is indeed empty. However,
25626 before we get to cp_parser_function_body lot of junk has been
25627 generated, so we can't just check that we have an empty block.
25628 Rather we take a snapshot of the outermost block, and check whether
25629 cp_parser_function_body changed its state. */
25631 {
25635 }
25636 /* Parse the function-body. */
25640 /* Finish the function body. */
25642 }
25644 /* Parse an initializer.
25646 initializer:
25647 = initializer-clause
25648 ( expression-list )
25650 Returns an expression representing the initializer. If no
25651 initializer is present, NULL_TREE is returned.
25653 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
25654 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
25655 set to TRUE if there is no initializer present. If there is an
25656 initializer, and it is not a constant-expression, *NON_CONSTANT_P
25657 is set to true; otherwise it is set to false. */
25659 static tree
25662 {
25664 tree init;
25666 /* Peek at the next token. */
25669 /* Let our caller know whether or not this initializer was
25670 parenthesized. */
25673 /* Assume that the initializer is constant. */
25678 {
25679 /* Consume the `='. */
25681 /* Parse the initializer-clause. */
25683 }
25685 {
25690 non_constant_p);
25695 }
25697 {
25702 }
25703 else
25704 {
25705 /* Anything else is an error. */
25708 }
25714 }
25716 /* Parse an initializer-clause.
25718 initializer-clause:
25719 assignment-expression
25720 braced-init-list
25722 Returns an expression representing the initializer.
25724 If the `assignment-expression' production is used the value
25725 returned is simply a representation for the expression.
25727 Otherwise, calls cp_parser_braced_list. */
25729 static cp_expr
25731 {
25732 cp_expr initializer;
25734 /* Assume the expression is constant. */
25738 /* If it is not a `{', then we are looking at an
25739 assignment-expression. */
25741 {
25742 initializer
25745 non_constant_p);
25746 }
25747 else
25751 }
25753 /* Parse a brace-enclosed initializer list.
25755 braced-init-list:
25756 { initializer-list , [opt] }
25757 { designated-initializer-list , [opt] }
25758 { }
25760 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
25761 the elements of the initializer-list (or NULL, if the last
25762 production is used). The TREE_TYPE for the CONSTRUCTOR will be
25763 NULL_TREE. There is no way to detect whether or not the optional
25764 trailing `,' was provided. NON_CONSTANT_P is as for
25765 cp_parser_initializer. */
25767 static cp_expr
25769 {
25770 tree initializer;
25773 /* Consume the `{' token. */
25774 matching_braces braces;
25776 /* Create a CONSTRUCTOR to represent the braced-initializer. */
25778 /* If it's not a `}', then there is a non-trivial initializer. */
25780 {
25782 /* Parse the initializer list. */
25786 /* A trailing `,' token is allowed. */
25789 }
25792 /* Now, there should be a trailing `}'. */
25799 /* Build a location of the form:
25800 { ... }
25801 ^~~~~~~
25802 with caret==start at the open brace, finish at the close brace. */
25806 }
25808 /* Consume tokens up to, but not including, the next non-nested closing `]'.
25809 Returns true iff we found a closing `]'. */
25811 static bool
25813 {
25817 {
25821 {
25825 /* FALLTHRU */
25828 /* If we've run out of tokens, then there is no closing `]'. */
25842 }
25844 /* Consume the current token, skipping it. */
25846 }
25847 }
25849 /* Consume tokens up to, and including, the next non-nested closing `]'.
25850 Returns true iff we found a closing `]'. */
25852 static bool
25854 {
25859 }
25861 /* Return true if we are looking at an array-designator, false otherwise. */
25863 static bool
25865 {
25866 /* Consume the `['. */
25871 /* Skip tokens until the next token is a closing square bracket.
25872 If we find the closing `]', and the next token is a `=', then
25873 we are looking at an array designator. */
25874 bool array_designator_p
25878 /* Roll back the tokens we skipped. */
25882 }
25884 /* Parse an initializer-list.
25886 initializer-list:
25887 initializer-clause ... [opt]
25888 initializer-list , initializer-clause ... [opt]
25890 C++20 Extension:
25892 designated-initializer-list:
25893 designated-initializer-clause
25894 designated-initializer-list , designated-initializer-clause
25896 designated-initializer-clause:
25897 designator brace-or-equal-initializer
25899 designator:
25900 . identifier
25902 GNU Extension:
25904 initializer-list:
25905 designation initializer-clause ...[opt]
25906 initializer-list , designation initializer-clause ...[opt]
25908 designation:
25909 . identifier =
25910 identifier :
25911 [ constant-expression ] =
25913 Returns a vec of constructor_elt. The VALUE of each elt is an expression
25914 for the initializer. If the INDEX of the elt is non-NULL, it is the
25915 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
25916 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
25917 are any designators. */
25922 {
25927 /* Assume all of the expressions are constant. */
25934 /* Parse the rest of the list. */
25936 {
25938 tree designator;
25939 tree initializer;
25944 /* Handle the C++20 syntax, '. id ='. */
25952 {
25955 "C++ designated initializers only available with "
25957 /* Consume the `.'. */
25959 /* Consume the identifier. */
25962 /* Consume the `='. */
25964 else
25966 }
25967 /* Also, if the next token is an identifier and the following one is a
25968 colon, we are looking at the GNU designated-initializer
25969 syntax. */
25974 {
25975 /* Warn the user that they are using an extension. */
25978 /* Consume the identifier. */
25980 /* Consume the `:'. */
25982 }
25983 /* Also handle C99 array designators, '[ const ] ='. */
25987 {
25988 /* In C++11, [ could start a lambda-introducer. */
25994 {
25997 }
25998 else
25999 {
26004 }
26009 && (!require_potential_rvalue_constant_expression
26013 /* Warn the user that they are using an extension. */
26016 }
26017 else
26021 {
26024 }
26028 {
26032 }
26036 /* Parse the initializer. */
26039 ? &clause_non_constant_p
26041 /* If any clause is non-constant, so is the entire initializer. */
26046 /* This uses |= rather than = because C_I_D_I could have been set in
26047 cp_parser_functional_cast so we must be careful not to clear the
26048 flag. */
26051 /* If we have an ellipsis, this is an initializer pack
26052 expansion. */
26054 {
26057 /* Consume the `...'. */
26064 /* Turn the initializer into an initializer expansion. */
26066 }
26068 /* Add it to the vector. */
26071 /* If the next token is not a comma, we have reached the end of
26072 the list. */
26076 /* Peek at the next token. */
26078 /* If the next token is a `}', then we're still done. An
26079 initializer-clause can have a trailing `,' after the
26080 initializer-list and before the closing `}'. */
26084 /* Suppress location wrappers in a long initializer to save memory
26085 (14179). The cutoff is chosen arbitrarily. */
26089 /* Look one level down because it's easy. Looking deeper would require
26090 passing down a nelts pointer, and I don't think multi-level massive
26091 initializers are common enough to justify this. */
26097 /* Consume the `,' token. */
26099 }
26101 /* The same identifier shall not appear in multiple designators
26102 of a designated-initializer-list. */
26104 {
26109 {
26111 {
26113 "%<.%s%> designator used multiple times in "
26117 }
26118 else
26120 }
26124 }
26130 }
26132 /* Classes [gram.class] */
26134 /* Parse a class-name.
26136 class-name:
26137 identifier
26138 template-id
26140 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
26141 to indicate that names looked up in dependent types should be
26142 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
26143 keyword has been used to indicate that the name that appears next
26144 is a template. TAG_TYPE indicates the explicit tag given before
26145 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
26146 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
26147 is the class being defined in a class-head. If ENUM_OK is TRUE,
26148 enum-names are also accepted.
26150 Returns the TYPE_DECL representing the class. */
26152 static tree
26161 {
26162 tree decl;
26165 /* All class-names start with an identifier. */
26168 {
26171 }
26173 /* PARSER->SCOPE can be cleared when parsing the template-arguments
26174 to a template-id, so we save it here. Consider object scope too,
26175 so that make_typename_type below can use it (cp_parser_template_name
26176 considers object scope also). This may happen with code like
26178 p->template A<T>::a()
26180 where we first want to look up A<T>::a in the class of the object
26181 expression, as per [basic.lookup.classref]. */
26183 /* This only checks parser->scope to avoid duplicate errors; if
26184 ->object_type is erroneous, go on to give a parse error. */
26188 /* Any name names a type if we're following the `typename' keyword
26189 in a qualified name where the enclosing scope is type-dependent. */
26194 /* Handle the common case (an identifier, but not a template-id)
26195 efficiently. */
26198 {
26202 /* Look for the identifier. */
26206 /* If the next token isn't an identifier, we are certainly not
26207 looking at a class-name. */
26210 /* If we know this is a type-name, there's no need to look it
26211 up. */
26214 else
26215 {
26216 tree ambiguous_decls;
26217 /* If we already know that this lookup is ambiguous, then
26218 we've already issued an error message; there's no reason
26219 to check again. */
26221 {
26224 }
26225 /* If the next token is a `::', then the name must be a type
26226 name.
26228 [basic.lookup.qual]
26230 During the lookup for a name preceding the :: scope
26231 resolution operator, object, function, and enumerator
26232 names are ignored. */
26235 /* Look up the name. */
26237 tag_type,
26240 check_dependency_p,
26244 {
26248 }
26249 }
26250 }
26251 else
26252 {
26253 /* Try a template-id. */
26255 check_dependency_p,
26256 tag_type,
26257 is_declaration);
26260 }
26264 /* If this is a typename, create a TYPENAME_TYPE. */
26266 {
26271 }
26275 /* Check to see that it is really the name of a class. */
26279 /* Situations like this:
26281 template <typename T> struct A {
26282 typename T::template X<int>::I i;
26283 };
26285 are problematic. Is `T::template X<int>' a class-name? The
26286 standard does not seem to be definitive, but there is no other
26287 valid interpretation of the following `::'. Therefore, those
26288 names are considered class-names. */
26289 {
26293 }
26298 /* In Objective-C 2.0, a classname followed by '.' starts a
26299 dot-syntax expression, and it's not a type-name. */
26311 }
26313 /* Make sure that any member-function parameters are in scope.
26314 For instance, a function's noexcept-specifier can use the function's
26315 parameters:
26317 struct S {
26318 void fn (int p) noexcept(noexcept(p));
26319 };
26321 so we need to make sure name lookup can find them. This is used
26322 when we delay parsing of the noexcept-specifier. */
26324 static void
26326 {
26333 {
26337 }
26338 }
26340 /* Undo the effects of inject_parm_decls. */
26342 static void
26344 {
26347 }
26349 /* Parse a class-specifier.
26351 class-specifier:
26352 class-head { member-specification [opt] }
26354 Returns the TREE_TYPE representing the class. */
26356 tree
26358 {
26361 tree type;
26375 /* Parse the class-head. */
26378 /* If the class-head was a semantic disaster, skip the entire body
26379 of the class. */
26381 {
26385 }
26387 /* Look for the `{'. */
26388 matching_braces braces;
26390 {
26393 }
26398 /* Issue an error message if type-definitions are forbidden here. */
26400 /* Remember that we are defining one more class. */
26402 /* Inside the class, surrounding template-parameter-lists do not
26403 apply. */
26404 saved_num_template_parameter_lists
26407 /* We are not in a function body. */
26410 /* Or in a loop. */
26413 /* Or in a switch. */
26416 /* We are not immediately inside an extern "lang" block. */
26417 saved_in_unbraced_linkage_specification_p
26420 /* 'this' from an enclosing non-static member function is unavailable. */
26426 /* Start the class. */
26428 {
26430 /* SCOPE must be a scope nested inside current scope. */
26434 else
26436 }
26440 /* If the type is erroneous, skip the entire body of the class. */
26442 else
26443 /* Parse the member-specification. */
26446 /* Look for the trailing `}'. */
26448 /* Look for trailing attributes to apply to this class. */
26456 /* We've finished a type definition. Check for the common syntax
26457 error of forgetting a semicolon after the definition. We need to
26458 be careful, as we can't just check for not-a-semicolon and be done
26459 with it; the user might have typed:
26461 class X { } c = ...;
26462 class X { } *p = ...;
26464 and so forth. Instead, enumerate all the possible tokens that
26465 might follow this production; if we don't see one of them, then
26466 complain and silently insert the semicolon. */
26467 {
26472 /* Don't try to parse c++11 attributes here. As per the
26473 grammar, that should be a task for
26474 cp_parser_decl_specifier_seq. */
26478 {
26490 /* While it's legal for type qualifiers and storage class
26491 specifiers to follow type definitions in the grammar, only
26492 compiler testsuites contain code like that. Assume that if
26493 we see such code, then what we're really seeing is a case
26494 like:
26496 class X { }
26497 const <type> var = ...;
26499 or
26501 class Y { }
26502 static <type> func (...) ...
26504 i.e. the qualifier or specifier applies to the next
26505 declaration. To do so, however, we need to look ahead one
26506 more token to see if *that* token is a type specifier.
26508 This code could be improved to handle:
26510 class Z { }
26511 static const <type> var = ...; */
26514 {
26517 /* Handling user-defined types here would be nice, but very
26518 tricky. */
26519 want_semicolon
26522 }
26526 }
26528 /* If we don't have a type, then something is very wrong and we
26529 shouldn't try to do anything clever. Likewise for not seeing the
26530 closing brace. */
26532 {
26533 /* Locate the closing brace. */
26534 cp_token_position prev
26539 /* We want to suggest insertion of a ';' immediately *after* the
26540 closing brace, so, if we can, offset the location by 1 column. */
26547 /* If we successfully offset the location, suggest the fix-it. */
26560 else
26563 /* Unget one token and smash it to look as though we encountered
26564 a semicolon in the input stream. */
26569 }
26570 }
26572 /* If this class is not itself within the scope of another class,
26573 then we need to parse the bodies of all of the queued function
26574 definitions. Note that the queued functions defined in a class
26575 are not always processed immediately following the
26576 class-specifier for that class. Consider:
26578 struct A {
26579 struct B { void f() { sizeof (A); } };
26580 };
26582 If `f' were processed before the processing of `A' were
26583 completed, there would be no way to compute the size of `A'.
26584 Note that the nesting we are interested in here is lexical --
26585 not the semantic nesting given by TYPE_CONTEXT. In particular,
26586 for:
26588 struct A { struct B; };
26589 struct A::B { void f() { } };
26591 there is no need to delay the parsing of `A::B::f'. */
26593 {
26594 tree decl;
26601 {
26602 /* Skip default arguments, NSDMIs, etc, in order to improve
26603 error recovery (c++/71169, c++/71832). */
26607 }
26609 /* In a first pass, parse default arguments to the functions.
26610 Then, in a second pass, parse the bodies of the functions.
26611 This two-phased approach handles cases like:
26613 struct S {
26614 void f() { g(); }
26615 void g(int i = 3);
26616 };
26618 */
26620 {
26622 /* If there are default arguments that have not yet been processed,
26623 take care of them now. */
26625 {
26630 }
26631 /* Make sure that any template parameters are in scope. */
26633 /* Parse the default argument expressions. */
26635 /* Remove any template parameters from the symbol table. */
26637 }
26640 /* If there are noexcept-specifiers that have not yet been processed,
26641 take care of them now. Do this before processing NSDMIs as they
26642 may depend on noexcept-specifiers already having been processed. */
26644 {
26647 {
26652 }
26657 /* Make sure that any template parameters are in scope. */
26660 /* Make sure that any member-function parameters are in scope.
26661 This function doesn't expect ccp to be set. */
26665 /* 'this' is not allowed in static member functions. */
26666 unsigned char local_variables_forbidden_p
26671 /* Now we can parse the noexcept-specifier. */
26677 /* Update the fn's type directly -- it might have escaped
26678 beyond this decl :( */
26680 /* Update any instantiations we've already created. We must
26681 keep the new noexcept-specifier wrapped in a DEFERRED_NOEXCEPT
26682 so that maybe_instantiate_noexcept can tsubst the NOEXCEPT_EXPR
26683 in the pattern. */
26688 /* Restore the state of local_variables_forbidden_p. */
26691 /* The finish_struct call above performed various override checking,
26692 but it skipped unparsed noexcept-specifier operands. Now that we
26693 have resolved them, check again. */
26696 /* Remove any member-function parameters from the symbol table. */
26699 /* Remove any template parameters from the symbol table. */
26701 }
26704 /* Now parse any NSDMIs. */
26706 {
26709 {
26714 }
26717 }
26720 /* Now contract attributes. */
26722 {
26725 {
26730 }
26734 /* Make sure that any template parameters are in scope. */
26737 /* Make sure that any member-function parameters are in scope.
26738 This function doesn't expect ccp to be set. */
26742 /* 'this' is not allowed in static member functions. */
26743 unsigned char local_variables_forbidden_p
26748 /* Now we can parse contract conditions. */
26750 {
26753 }
26755 /* Restore the state of local_variables_forbidden_p. */
26758 /* Remove any member-function parameters from the symbol table. */
26761 /* Remove any template parameters from the symbol table. */
26764 /* Perform any deferred contract matching. */
26766 }
26774 /* Now parse the body of the functions. */
26776 {
26777 /* OpenMP UDRs need to be parsed before all other functions. */
26784 }
26785 else
26789 }
26791 /* Put back any saved access checks. */
26794 /* Restore saved state. */
26798 parser->num_template_parameter_lists
26800 parser->in_unbraced_linkage_specification_p
26806 }
26808 /* Parse a class-head.
26810 class-head:
26811 class-key identifier [opt] base-clause [opt]
26812 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
26813 class-key nested-name-specifier [opt] template-id
26814 base-clause [opt]
26816 class-virt-specifier:
26817 final
26819 GNU Extensions:
26820 class-key attributes identifier [opt] base-clause [opt]
26821 class-key attributes nested-name-specifier identifier base-clause [opt]
26822 class-key attributes nested-name-specifier [opt] template-id
26823 base-clause [opt]
26825 Upon return BASES is initialized to the list of base classes (or
26826 NULL, if there are none) in the same form returned by
26827 cp_parser_base_clause.
26829 Returns the TYPE of the indicated class. Sets
26830 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
26831 involving a nested-name-specifier was used, and FALSE otherwise.
26833 Returns error_mark_node if this is not a class-head.
26835 Returns NULL_TREE if the class-head is syntactically valid, but
26836 semantically invalid in a way that means we should skip the entire
26837 body of the class. */
26839 static tree
26842 {
26843 tree nested_name_specifier;
26847 tree attributes;
26848 tree bases;
26858 /* Assume no nested-name-specifier will be present. */
26860 /* Assume no template parameter lists will be used in defining the
26861 type. */
26865 /* Look for the class-key. */
26872 /* Parse the attributes. */
26877 /* If the next token is `::', that is invalid -- but sometimes
26878 people do try to write:
26880 struct ::S {};
26882 Handle this gracefully by accepting the extra qualifier, and then
26883 issuing an error about it later if this really is a
26884 class-head. If it turns out just to be an elaborated type
26885 specifier, remain silent. */
26889 /* It is OK to define an inaccessible class; for example:
26891 class A { class B; };
26892 class A::B {};
26894 So we want to ignore access when parsing the class name.
26895 However, we might be tentatively parsing what is really an
26896 elaborated-type-specifier naming a template-id, e.g.
26898 struct C<&D::m> c;
26900 In this case the tentative parse as a class-head will fail, but not
26901 before cp_parser_template_id splices in a CPP_TEMPLATE_ID token.
26902 Since dk_no_check is sticky, we must instead use dk_deferred so that
26903 any such CPP_TEMPLATE_ID token created during this tentative parse
26904 will correctly capture the access checks imposed by the template-id . */
26907 /* Determine the name of the class. Begin by looking for an
26908 optional nested-name-specifier. */
26910 nested_name_specifier
26916 /* If there was a nested-name-specifier, then there *must* be an
26917 identifier. */
26922 {
26924 /* Although the grammar says `identifier', it really means
26925 `class-name' or `template-name'. You are only allowed to
26926 define a class that has already been declared with this
26927 syntax.
26929 The proposed resolution for Core Issue 180 says that wherever
26930 you see `class T::X' you should treat `X' as a type-name.
26932 We do not know if we will see a class-name, or a
26933 template-name. We look for a class-name first, in case the
26934 class-name is a template-id; if we looked for the
26935 template-name first we would stop after the template-name. */
26942 class_type,
26946 /* If that didn't work, ignore the nested-name-specifier. */
26948 {
26954 }
26955 /* If we could not find a corresponding TYPE, treat this
26956 declaration like an unqualified declaration. */
26959 /* Otherwise, count the number of templates used in TYPE and its
26960 containing scopes. */
26961 else
26963 }
26964 /* Otherwise, the identifier is optional. */
26965 else
26966 {
26967 /* We don't know whether what comes next is a template-id,
26968 an identifier, or nothing at all. */
26970 /* Check for a template-id. */
26975 class_key,
26977 /* If that didn't work, it could still be an identifier. */
26979 {
26981 {
26984 }
26985 else
26987 }
26988 else
26989 {
26992 }
26993 }
26998 {
27000 class_key,
27002 }
27005 /* If it's not a `:' or a `{' then we can't really be looking at a
27006 class-head, since a class-head only appears as part of a
27007 class-specifier. We have to detect this situation before calling
27008 xref_tag, since that has irreversible side-effects. */
27010 {
27014 }
27016 /* At this point, we're going ahead with the class-specifier, even
27017 if some other problem occurs. */
27020 {
27025 }
27026 /* Issue the error about the overly-qualified name now. */
27028 {
27033 }
27035 {
27040 }
27042 {
27043 tree scope;
27046 /* [temp.names]: in a qualified-id formed by a class-head-name, the
27047 keyword template shall not appear at the top level. */
27051 /* Reject typedef-names in class heads. */
27053 {
27056 type);
27059 }
27061 /* Figure out in what scope the declaration is being placed. */
27063 /* If that scope does not contain the scope in which the
27064 class was originally declared, the program is invalid. */
27066 {
27069 "declaration of %qD in namespace %qD which does not "
27072 else
27078 }
27079 /* [dcl.meaning]
27081 A declarator-id shall not be qualified except for the
27082 definition of a ... nested class outside of its class
27083 ... [or] the definition or explicit instantiation of a
27084 class member of a namespace outside of its namespace. */
27088 }
27089 /* An explicit-specialization must be preceded by "template <>". If
27090 it is not, try to recover gracefully. */
27093 && !processing_template_parmlist
27095 {
27096 /* Build a location of this form:
27097 struct typename <ARGS>
27098 ^~~~~~~~~~~~~~~~~~~~~~
27099 with caret==start at the start token, and
27100 finishing at the end of the type. */
27101 location_t reported_loc
27103 class_head_start_location,
27109 "an explicit specialization must be preceded by"
27112 /* Take the same action that would have been taken by
27113 cp_parser_explicit_specialization. */
27116 }
27117 /* There must be no "return" statements between this point and the
27118 end of this function; set "type "to the correct return value and
27119 use "goto done;" to return. */
27120 /* Make sure that the right number of template parameters were
27121 present. */
27123 template_id_p,
27126 {
27127 /* If something went wrong, there is no point in even trying to
27128 process the class-definition. */
27131 }
27133 /* Look up the type. */
27135 {
27139 {
27143 }
27144 else
27145 {
27149 /* Check the scope while we still know whether or not we had a
27150 nested-name-specifier. */
27153 }
27156 }
27158 {
27161 /* Given:
27163 template <typename T> struct S { struct T };
27164 template <typename T> struct S<T>::T { };
27166 we will get a TYPENAME_TYPE when processing the definition of
27167 `S::T'. We need to resolve it to the actual type before we
27168 try to define it. */
27170 {
27173 {
27176 }
27177 }
27181 {
27184 }
27186 /* Enter the scope indicated by the nested-name-specifier. */
27188 /* Get the canonical version of this type. */
27190 /* Call push_template_decl if it seems like we should be defining a
27191 template either from the template headers or the type we're
27192 defining, so that we diagnose both extra and missing headers. */
27196 {
27199 {
27202 }
27203 }
27207 }
27209 {
27210 /* If the class was unnamed, create a dummy name. */
27218 }
27220 /* Diagnose class/struct/union mismatches. */
27224 /* Indicate whether this class was declared as a `class' or as a
27225 `struct'. */
27229 /* If this type was already complete, and we see another definition,
27230 that's an error. Likewise if the type is already being defined:
27231 this can happen, eg, when it's defined from within an expression
27232 (c++/84605). */
27235 {
27237 type);
27239 type);
27242 }
27247 {
27250 {
27251 /* In a lambda this should work, but doesn't currently. */
27254 }
27256 /* Apply attributes now, before any use of the class as a template
27257 argument in its base list. */
27260 }
27262 /* Associate constraints with the type. */
27266 /* We will have entered the scope containing the class; the names of
27267 base classes should be looked up in that context. For example:
27269 struct A { struct B {}; struct C; };
27270 struct A::C : B {};
27272 is valid. */
27274 /* Get the list of base-classes, if there is one. Defer access checking
27275 until the entire list has been seen, as per [class.access.general]. */
27278 {
27284 }
27285 else
27288 /* If we're really defining a class, process the base classes.
27289 If they're invalid, fail. */
27293 /* Now that all bases have been seen and attached to the class, check
27294 accessibility of the types named in the base-clause. This must be
27295 done relative to the class scope, so that we accept e.g.
27297 struct A { protected: struct B {}; };
27298 struct C : A::B, A {}; // OK: A::B is accessible via base A
27300 as per [class.access.general]. */
27307 done:
27308 /* Leave the scope given by the nested-name-specifier. We will
27309 enter the class scope itself while processing the members. */
27314 {
27317 }
27323 out:
27326 }
27328 /* Parse a class-key.
27330 class-key:
27331 class
27332 struct
27333 union
27335 Returns the kind of class-key specified, or none_type to indicate
27336 error. */
27338 static enum tag_types
27340 {
27344 /* Look for the class-key. */
27349 /* Check to see if the TOKEN is a class-key. */
27354 }
27356 /* Parse a type-parameter-key.
27358 type-parameter-key:
27359 class
27360 typename
27361 */
27363 static void
27365 {
27366 /* Look for the type-parameter-key. */
27370 {
27374 /* typename is not allowed in a template template parameter
27375 by the standard until C++17. */
27377 "ISO C++ forbids typename key in template template parameter;"
27379 }
27380 else
27384 }
27386 /* Parse an (optional) member-specification.
27388 member-specification:
27389 member-declaration member-specification [opt]
27390 access-specifier : member-specification [opt] */
27392 static void
27394 {
27396 {
27400 /* Peek at the next token. */
27402 /* If it's a `}', or EOF then we've seen all the members. */
27408 /* See if this token is a keyword. */
27411 {
27415 /* Consume the access-specifier. */
27417 /* Remember which access-specifier is active. */
27419 /* Look for the `:'. */
27424 /* Accept #pragmas at class scope. */
27426 {
27429 }
27431 /* Otherwise, the next construction must be a
27432 member-declaration. */
27434 }
27435 }
27436 }
27438 /* Parse a member-declaration.
27440 member-declaration:
27441 decl-specifier-seq [opt] member-declarator-list [opt] ;
27442 function-definition ; [opt]
27443 :: [opt] nested-name-specifier template [opt] unqualified-id ;
27444 using-declaration
27445 template-declaration
27446 alias-declaration
27448 member-declarator-list:
27449 member-declarator
27450 member-declarator-list , member-declarator
27452 member-declarator:
27453 declarator pure-specifier [opt]
27454 declarator constant-initializer [opt]
27455 identifier [opt] : constant-expression
27457 GNU Extensions:
27459 member-declaration:
27460 __extension__ member-declaration
27462 member-declarator:
27463 declarator attributes [opt] pure-specifier [opt]
27464 declarator attributes [opt] constant-initializer [opt]
27465 identifier [opt] attributes [opt] : constant-expression
27467 C++0x Extensions:
27469 member-declaration:
27470 static_assert-declaration */
27472 static void
27474 {
27475 cp_decl_specifier_seq decl_specifiers;
27476 tree prefix_attributes;
27477 tree decl;
27486 /* Check for the `__extension__' keyword. */
27488 {
27489 /* Recurse. */
27491 /* Restore the old value of the PEDANTIC flag. */
27495 }
27497 /* Check for a template-declaration. */
27499 {
27500 /* An explicit specialization here is an error condition, and we
27501 expect the specialization handler to detect and report this. */
27505 else
27509 }
27510 /* Check for a template introduction. */
27514 /* Check for a using-declaration. */
27516 {
27518 /* Parse the using-declaration. */
27522 else
27523 {
27524 tree decl;
27528 /* Note that if we actually see the '=' token after the
27529 identifier, cp_parser_alias_declaration commits the
27530 tentative parse. In that case, we really expect an
27531 alias-declaration. Otherwise, we expect a using
27532 declaration. */
27533 alias_decl_expected =
27539 else
27542 }
27544 }
27546 /* Check for @defs. */
27548 {
27553 {
27558 }
27560 }
27562 /* If the next token is `static_assert' we have a static assertion. */
27564 {
27567 }
27571 cp_omp_declare_simd_data odsd;
27575 /* Parse the decl-specifier-seq. */
27578 (CP_PARSER_FLAGS_OPTIONAL
27588 /* Check for an invalid type-name. */
27592 /* If there is no declarator, then the decl-specifier-seq should
27593 specify a type. */
27595 {
27596 /* If there was no decl-specifier-seq, and the next token is a
27597 `;', then we have something like:
27599 struct S { ; };
27601 [class.mem]
27603 Each member-declaration shall declare at least one member
27604 name of the class. */
27606 {
27609 {
27613 }
27614 }
27615 else
27616 {
27617 /* See if this declaration is a friend. */
27619 /* If there were decl-specifiers, check to see if there was
27620 a class-declaration. */
27623 /* Nested classes have already been added to the class, but
27624 a `friend' needs to be explicitly registered. */
27626 {
27627 /* If the `friend' keyword was present, the friend must
27628 be introduced with a class-key. */
27631 "in C++03 a class-key must be used "
27633 /* In this case:
27635 template <typename T> struct A {
27636 friend struct A<T>::B;
27637 };
27639 A<T>::B will be represented by a TYPENAME_TYPE, and
27640 therefore not recognized by check_tag_decl. */
27642 {
27646 }
27647 /* Warn if an attribute cannot appear here, as per
27648 [dcl.attr.grammar]/5. But not when declares_class_or_enum:
27649 we ignore attributes in elaborated-type-specifiers. */
27652 {
27657 "that appertains to a friend declaration that "
27659 }
27662 "friend declaration does not name a class or "
27664 else
27667 }
27668 /* If there is no TYPE, an error message will already have
27669 been issued. */
27671 ;
27672 /* An anonymous aggregate has to be handled specially; such
27673 a declaration really declares a data member (with a
27674 particular type), as opposed to a nested class. */
27676 {
27677 /* C++11 9.5/6. */
27680 "a storage class on an anonymous aggregate "
27683 /* Remove constructors and such from TYPE, now that we
27684 know it is an anonymous aggregate. */
27686 /* And make the corresponding data member. */
27689 /* Add it to the class. */
27691 }
27692 else
27693 cp_parser_check_access_in_redeclaration
27696 }
27697 }
27698 else
27699 {
27702 /* Clear attributes from the decl_specifiers but keep them
27703 around as prefix attributes that apply them to the entity
27704 being declared. */
27712 /* See if these declarations will be friends. */
27715 /* Keep going until we hit the `;' at the end of the
27716 declaration. */
27718 {
27720 tree first_attribute;
27721 tree initializer;
27724 /* Peek at the next token. */
27727 /* The following code wants to know early if it is a bit-field
27728 or some other declaration. Attributes can appear before
27729 the `:' token. Skip over them without consuming any tokens
27730 to peek if they are followed by `:'. */
27735 {
27736 size_t n
27739 }
27741 /* Check for a bitfield declaration. */
27747 {
27748 tree identifier;
27749 tree width;
27751 location_t id_location
27756 else
27759 /* Look for attributes that apply to the bitfield. */
27762 /* Consume the `:' token. */
27765 /* Get the width of the bitfield. */
27769 /* In C++20 and as extension for C++11 and above we allow
27770 default member initializers for bit-fields. */
27775 CPP_OPEN_BRACE)))
27776 {
27777 location_t loc
27782 "default member initializers for bit-fields "
27783 "only available with %<-std=c++20%> or "
27788 {
27792 }
27793 }
27794 else
27795 {
27796 /* Look for attributes that apply to the bitfield after
27797 the `:' token and width. This is where GCC used to
27798 parse attributes in the past, pedwarn if there is
27799 a std attribute. */
27802 "ISO C++ allows bit-field attributes only "
27806 }
27810 /* Remember which attributes are prefix attributes and
27811 which are not. */
27813 /* Combine the attributes. */
27816 /* Create the bitfield declaration. */
27819 identifier,
27820 sfk_none,
27821 id_location)
27825 attributes);
27826 }
27827 else
27828 {
27830 tree asm_specification;
27834 /* We can't delay parsing for friends,
27835 alias-declarations, and typedefs, even though the
27836 standard seems to require it. */
27841 /* Parse the declarator. */
27842 declarator
27844 flags,
27850 /* If something went wrong parsing the declarator, make sure
27851 that we at least consume some tokens. */
27853 {
27854 /* Skip to the end of the statement. */
27856 /* If the next token is not a semicolon, that is
27857 probably because we just skipped over the body of
27858 a function. So, we consume a semicolon if
27859 present, but do not issue an error message if it
27860 is not present. */
27862 CPP_SEMICOLON))
27865 }
27867 /* Handle class-scope non-template C++17 deduction guides. */
27870 declarator,
27874 cp_parser_check_for_definition_in_return_type
27878 /* Look for an asm-specification. */
27880 /* Look for attributes that apply to the declaration. */
27882 /* Remember which attributes are prefix attributes and
27883 which are not. */
27885 /* Combine the attributes. */
27888 /* If it's an `=', then we have a constant-initializer or a
27889 pure-specifier. It is not correct to parse the
27890 initializer before registering the member declaration
27891 since the member declaration should be in scope while
27892 its initializer is processed. However, the rest of the
27893 front end does not yet provide an interface that allows
27894 us to handle this correctly. */
27896 {
27897 /* In [class.mem]:
27899 A pure-specifier shall be used only in the declaration of
27900 a virtual function.
27902 A member-declarator can contain a constant-initializer
27903 only if it declares a static member of integral or
27904 enumeration type.
27906 Therefore, if the DECLARATOR is for a function, we look
27907 for a pure-specifier; otherwise, we look for a
27908 constant-initializer. When we call `grokfield', it will
27909 perform more stringent semantics checks. */
27922 {
27923 /* Don't require a constant rvalue in C++11, since we
27924 might want a reference constant. We'll enforce
27925 constancy later. */
27927 /* Parse the initializer. */
27929 }
27930 else
27931 /* Parse the initializer. */
27933 }
27936 {
27937 declarator->init_loc
27941 else
27943 }
27944 /* Detect invalid bit-field cases such as
27946 int *p : 4;
27947 int &&r : 3;
27949 and similar. */
27951 /* If there were no type specifiers, it was a
27952 constructor. */
27954 {
27955 /* This is called for a decent diagnostic only. */
27964 /* Avoid "extra ;" pedwarns. */
27966 CPP_SEMICOLON))
27969 }
27970 /* Otherwise, there is no initializer. */
27971 else
27974 /* See if we are probably looking at a function
27975 definition. We are certainly not looking at a
27976 member-declarator. Calling `grokfield' has
27977 side-effects, so we must not do it unless we are sure
27978 that we are looking at a member-declarator. */
27981 {
27982 /* The grammar does not allow a pure-specifier to be
27983 used when a member function is defined. (It is
27984 possible that this fact is an oversight in the
27985 standard, since a pure function may be defined
27986 outside of the class-specifier. */
27992 declarator,
27993 attributes);
27997 /* If the member was not a friend, declare it here. */
28000 /* Peek at the next token. */
28002 /* If the next token is a semicolon, consume it. */
28004 {
28005 location_t semicolon_loc
28010 "extra %<;%> after in-class "
28012 }
28014 }
28015 else
28019 /* Create the declaration. */
28025 {
28028 else
28030 }
28031 }
28036 /* Reset PREFIX_ATTRIBUTES. */
28038 {
28043 }
28045 /* If there is any qualification still in effect, clear it
28046 now; we will be starting fresh with the next declarator. */
28050 /* If it's a `,', then there are more declarators. */
28052 {
28055 {
28061 }
28062 }
28063 /* If the next token isn't a `;', then we have a parse error. */
28065 CPP_SEMICOLON))
28066 {
28067 /* The next token might be a ways away from where the
28068 actual semicolon is missing. Find the previous token
28069 and use that for our error position. */
28076 /* Assume that the user meant to provide a semicolon. If
28077 we were to cp_parser_skip_to_end_of_statement, we might
28078 skip to a semicolon inside a member function definition
28079 and issue nonsensical error messages. */
28081 }
28084 {
28085 /* Add DECL to the list of members. */
28087 /* Explicitly include, eg, NSDMIs, for better error
28088 recovery (c++/58650). */
28096 /* Add DECL to the queue of NSDMI to be parsed later. */
28098 }
28102 }
28103 }
28106 out:
28109 }
28111 /* Parse a pure-specifier.
28113 pure-specifier:
28114 = 0
28116 Returns INTEGER_ZERO_NODE if a pure specifier is found.
28117 Otherwise, ERROR_MARK_NODE is returned. */
28119 static tree
28121 {
28124 /* Look for the `=' token. */
28127 /* Look for the `0' token. */
28136 /* Accept = default or = delete in c++0x mode. */
28139 {
28142 }
28144 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
28146 {
28151 }
28153 {
28156 }
28159 }
28161 /* Parse a constant-initializer.
28163 constant-initializer:
28164 = constant-expression
28166 Returns a representation of the constant-expression. */
28168 static tree
28170 {
28171 /* Look for the `=' token. */
28175 /* It is invalid to write:
28177 struct S { static const int i = { 7 }; };
28179 */
28181 {
28184 /* Consume the opening brace. */
28185 matching_braces braces;
28187 /* Skip the initializer. */
28189 /* Look for the trailing `}'. */
28193 }
28196 }
28198 /* Derived classes [gram.class.derived] */
28200 /* Parse a base-clause.
28202 base-clause:
28203 : base-specifier-list
28205 base-specifier-list:
28206 base-specifier ... [opt]
28207 base-specifier-list , base-specifier ... [opt]
28209 Returns a TREE_LIST representing the base-classes, in the order in
28210 which they were declared. The representation of each node is as
28211 described by cp_parser_base_specifier.
28213 In the case that no bases are specified, this function will return
28214 NULL_TREE, not ERROR_MARK_NODE. */
28216 static tree
28218 {
28221 /* Look for the `:' that begins the list. */
28224 /* Scan the base-specifier-list. */
28226 {
28228 tree base;
28231 /* Look for the base-specifier. */
28233 /* Look for the (optional) ellipsis. */
28235 {
28236 /* Consume the `...'. */
28240 }
28242 /* Add BASE to the front of the list. */
28244 {
28246 /* Make this a pack expansion type. */
28250 {
28253 }
28254 }
28255 /* Peek at the next token. */
28257 /* If it's not a comma, then the list is complete. */
28260 /* Consume the `,'. */
28262 }
28264 /* PARSER->SCOPE may still be non-NULL at this point, if the last
28265 base class had a qualified name. However, the next name that
28266 appears is certainly not qualified. */
28272 }
28274 /* Parse a base-specifier.
28276 base-specifier:
28277 :: [opt] nested-name-specifier [opt] class-name
28278 virtual access-specifier [opt] :: [opt] nested-name-specifier
28279 [opt] class-name
28280 access-specifier virtual [opt] :: [opt] nested-name-specifier
28281 [opt] class-name
28283 Returns a TREE_LIST. The TREE_PURPOSE will be one of
28284 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
28285 indicate the specifiers provided. The TREE_VALUE will be a TYPE
28286 (or the ERROR_MARK_NODE) indicating the type that was specified. */
28288 static tree
28290 {
28298 tree type;
28300 /* Process the optional `virtual' and `access-specifier'. */
28302 {
28303 /* Peek at the next token. */
28305 /* Process `virtual'. */
28307 {
28309 /* If `virtual' appears more than once, issue an error. */
28311 {
28315 }
28319 /* Consume the `virtual' token. */
28327 /* If more than one access specifier appears, issue an
28328 error. */
28331 {
28335 }
28339 /* Consume the access-specifier. */
28347 }
28348 }
28349 /* It is not uncommon to see programs mechanically, erroneously, use
28350 the 'typename' keyword to denote (dependent) qualified types
28351 as base classes. */
28353 {
28358 else
28360 "keyword %<typename%> not allowed in this context "
28363 }
28365 /* Look for the optional `::' operator. */
28367 /* Look for the nested-name-specifier. The simplest way to
28368 implement:
28370 [temp.res]
28372 The keyword `typename' is not permitted in a base-specifier or
28373 mem-initializer; in these contexts a qualified name that
28374 depends on a template-parameter is implicitly assumed to be a
28375 type name.
28377 is to pretend that we have seen the `typename' keyword at this
28378 point. */
28384 /* If the base class is given by a qualified name, assume that names
28385 we see are type names or templates, as appropriate. */
28391 /* DR 950 allows decltype as a base-specifier. */
28393 else
28394 {
28395 /* Otherwise, look for the class-name. */
28397 class_scope_p,
28398 template_p,
28399 typename_type,
28404 }
28410 }
28412 /* Exception handling [gram.exception] */
28414 /* Save the tokens that make up the noexcept-specifier for a member-function.
28415 Returns a DEFERRED_PARSE. */
28417 static tree
28419 {
28421 /* We want everything up to, including, the final ')'. */
28425 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
28426 to carry the information we will need. */
28428 /* Save away the noexcept-specifier; we will process it when the
28429 class is complete. */
28434 }
28436 /* Used for late processing of noexcept-specifiers of member-functions.
28437 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
28438 we saved for later; parse it now. DECL is the declaration of the
28439 member function. */
28441 static tree
28443 {
28444 /* Make sure we've gotten something that hasn't been parsed yet. */
28449 /* Push the saved tokens for the noexcept-specifier onto the parser's
28450 lexer stack. */
28454 /* Parse the cached noexcept-specifier. */
28455 tree parsed_arg
28457 CP_PARSER_FLAGS_NONE,
28462 /* Revert to the main lexer. */
28465 /* Restore the queue. */
28468 /* And we're done. */
28470 }
28472 /* Perform late checking of overriding function with respect to their
28473 noexcept-specifiers. FNDECL is the member function that potentially
28474 overrides some virtual function with the same signature. */
28476 static void
28478 {
28480 tree base_binfo;
28486 {
28495 }
28496 }
28498 /* Parse an (optional) noexcept-specification.
28500 noexcept-specification:
28501 noexcept ( constant-expression ) [opt]
28503 If no noexcept-specification is present, returns NULL_TREE.
28504 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
28505 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
28506 there are no parentheses. CONSUMED_EXPR will be set accordingly.
28507 Otherwise, returns a noexcept specification unless RETURN_COND is true,
28508 in which case a boolean condition is returned instead. The parser flags
28509 FLAGS is used to control parsing. QUALS are qualifiers indicating whether
28510 the (member) function is `const'. */
28512 static tree
28514 cp_parser_flags flags,
28518 {
28522 /* Peek at the next token. */
28525 /* Is it a noexcept-specification? */
28527 {
28528 tree expr;
28530 /* [class.mem]/6 says that a noexcept-specifer (within the
28531 member-specification of the class) is a complete-class context of
28532 a class. So, if the noexcept-specifier has the optional expression,
28533 just save the tokens, and reparse this after we're done with the
28534 class. */
28538 /* No need to delay parsing for a number literal or true/false. */
28550 {
28551 matching_parens parens;
28555 {
28556 /* Types may not be defined in an exception-specification. */
28558 parser->type_definition_forbidden_message
28562 expr
28568 {
28571 }
28573 /* Restore the saved message. */
28575 }
28576 else
28577 {
28580 }
28583 }
28584 else
28585 {
28589 }
28591 /* We cannot build a noexcept-spec right away because this will check
28592 that expr is a constexpr. */
28595 else
28597 }
28598 else
28600 }
28602 /* Parse an (optional) exception-specification.
28604 exception-specification:
28605 throw ( type-id-list [opt] )
28607 Returns a TREE_LIST representing the exception-specification. The
28608 TREE_VALUE of each node is a type. The parser flags FLAGS is used to
28609 control parsing. QUALS are qualifiers indicating whether the (member)
28610 function is `const'. */
28612 static tree
28614 cp_parser_flags flags)
28615 {
28617 tree type_id_list;
28620 /* Peek at the next token. */
28623 /* Is it a noexcept-specification? */
28624 type_id_list
28632 /* If it's not `throw', then there's no exception-specification. */
28638 /* Consume the `throw'. */
28641 /* Look for the `('. */
28642 matching_parens parens;
28645 /* Peek at the next token. */
28647 /* If it's not a `)', then there is a type-id-list. */
28649 {
28650 /* Types may not be defined in an exception-specification. */
28652 parser->type_definition_forbidden_message
28654 /* Parse the type-id-list. */
28656 /* Restore the saved message. */
28660 {
28664 }
28667 "dynamic exception specifications are deprecated in "
28669 }
28670 /* In C++17, throw() is equivalent to noexcept (true). throw()
28671 is deprecated in C++11 and above as well, but is still widely used,
28672 so don't warn about it yet. */
28675 else
28678 /* Look for the `)'. */
28682 }
28684 /* Parse an (optional) type-id-list.
28686 type-id-list:
28687 type-id ... [opt]
28688 type-id-list , type-id ... [opt]
28690 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
28691 in the order that the types were presented. */
28693 static tree
28695 {
28699 {
28701 tree type;
28705 /* Get the next type-id. */
28707 /* Check for invalid 'auto'. */
28709 {
28713 }
28714 /* Parse the optional ellipsis. */
28716 {
28717 /* Consume the `...'. */
28720 /* Turn the type into a pack expansion expression. */
28722 }
28723 /* Add it to the list. */
28725 /* Peek at the next token. */
28727 /* If it is not a `,', we are done. */
28730 /* Consume the `,'. */
28732 }
28735 }
28737 /* Parse a try-block.
28739 try-block:
28740 try compound-statement handler-seq */
28742 static tree
28744 {
28745 tree try_block;
28752 "%<try%> in %<constexpr%> function only "
28762 }
28764 /* Parse a function-try-block.
28766 function-try-block:
28767 try ctor-initializer [opt] function-body handler-seq */
28769 static void
28771 {
28772 tree compound_stmt;
28773 tree try_block;
28775 /* Look for the `try' keyword. */
28778 /* Let the rest of the front end know where we are. */
28780 /* Parse the function-body. */
28781 cp_parser_ctor_initializer_opt_and_function_body
28783 /* We're done with the `try' part. */
28785 /* Parse the handlers. */
28787 /* We're done with the handlers. */
28789 }
28791 /* Parse a handler-seq.
28793 handler-seq:
28794 handler handler-seq [opt] */
28796 static void
28798 {
28800 {
28803 /* Parse the handler. */
28805 /* Peek at the next token. */
28807 /* If it's not `catch' then there are no more handlers. */
28810 }
28811 }
28813 /* Parse a handler.
28815 handler:
28816 catch ( exception-declaration ) compound-statement */
28818 static void
28820 {
28821 tree handler;
28822 tree declaration;
28826 matching_parens parens;
28833 }
28835 /* Parse an exception-declaration.
28837 exception-declaration:
28838 type-specifier-seq declarator
28839 type-specifier-seq abstract-declarator
28840 type-specifier-seq
28841 ...
28843 Returns a VAR_DECL for the declaration, or NULL_TREE if the
28844 ellipsis variant is used. */
28846 static tree
28848 {
28849 cp_decl_specifier_seq type_specifiers;
28853 /* If it's an ellipsis, it's easy to handle. */
28855 {
28856 /* Consume the `...' token. */
28859 }
28861 /* Types may not be defined in exception-declarations. */
28863 parser->type_definition_forbidden_message
28866 /* Parse the type-specifier-seq. */
28871 /* If it's a `)', then there is no declarator. */
28874 else
28876 CP_PARSER_FLAGS_NONE,
28883 /* Restore the saved message. */
28890 }
28892 /* Parse a throw-expression.
28894 throw-expression:
28895 throw assignment-expression [opt]
28897 Returns a THROW_EXPR representing the throw-expression. */
28899 static tree
28901 {
28902 tree expression;
28908 /* Figure out whether or not there is an assignment-expression
28909 following the "throw" keyword. */
28917 else
28920 /* Construct a location e.g.:
28921 throw x
28922 ^~~~~~~
28923 with caret == start at the start of the "throw" token, and
28924 the end at the end of the final token we consumed. */
28930 }
28932 /* Parse a yield-expression.
28934 yield-expression:
28935 co_yield assignment-expression
28936 co_yield braced-init-list
28938 Returns a CO_YIELD_EXPR representing the yield-expression. */
28940 static tree
28942 {
28943 tree expr;
28951 {
28953 /* ??? : probably a moot point? */
28956 }
28957 else
28964 }
28966 /* GNU Extensions */
28968 /* Parse an (optional) asm-specification.
28970 asm-specification:
28971 asm ( string-literal )
28973 If the asm-specification is present, returns a STRING_CST
28974 corresponding to the string-literal. Otherwise, returns
28975 NULL_TREE. */
28977 static tree
28979 {
28980 /* Peek at the next token. */
28982 /* If the next token isn't the `asm' keyword, then there's no
28983 asm-specification. */
28987 /* Consume the `asm' token. */
28989 /* Look for the `('. */
28990 matching_parens parens;
28993 /* Look for the string-literal. */
28998 /* Look for the `)'. */
29002 }
29004 /* Parse an asm-operand-list.
29006 asm-operand-list:
29007 asm-operand
29008 asm-operand-list , asm-operand
29010 asm-operand:
29011 string-literal ( expression )
29012 [ string-literal ] string-literal ( expression )
29014 Returns a TREE_LIST representing the operands. The TREE_VALUE of
29015 each node is the expression. The TREE_PURPOSE is itself a
29016 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
29017 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
29018 is a STRING_CST for the string literal before the parenthesis. Returns
29019 ERROR_MARK_NODE if any of the operands are invalid. */
29021 static tree
29023 {
29028 {
29029 tree name;
29032 {
29033 /* Consume the `[' token. */
29035 /* Read the operand name. */
29040 /* Look for the closing `]'. */
29042 }
29043 else
29045 /* Look for the string-literal. */
29050 /* Look for the `('. */
29051 matching_parens parens;
29053 /* Parse the expression. */
29055 /* Look for the `)'. */
29063 /* Add this operand to the list. */
29065 expression,
29066 asm_operands);
29067 /* If the next token is not a `,', there are no more
29068 operands. */
29071 /* Consume the `,'. */
29073 }
29076 }
29078 /* Parse an asm-clobber-list.
29080 asm-clobber-list:
29081 string-literal
29082 asm-clobber-list , string-literal
29084 Returns a TREE_LIST, indicating the clobbers in the order that they
29085 appeared. The TREE_VALUE of each node is a STRING_CST. */
29087 static tree
29089 {
29093 {
29094 /* Look for the string literal. */
29098 /* Add it to the list. */
29100 /* If the next token is not a `,', then the list is
29101 complete. */
29104 /* Consume the `,' token. */
29106 }
29109 }
29111 /* Parse an asm-label-list.
29113 asm-label-list:
29114 identifier
29115 asm-label-list , identifier
29117 Returns a TREE_LIST, indicating the labels in the order that they
29118 appeared. The TREE_VALUE of each node is a label. */
29120 static tree
29122 {
29126 {
29129 /* Look for the identifier. */
29132 {
29135 {
29141 }
29142 }
29143 /* If the next token is not a `,', then the list is
29144 complete. */
29147 /* Consume the `,' token. */
29149 }
29152 }
29154 /* Return TRUE iff the next tokens in the stream are possibly the
29155 beginning of a GNU extension attribute. */
29157 static bool
29159 {
29161 }
29163 /* Return TRUE iff the next tokens in the stream are possibly the
29164 beginning of a standard C++-11 attribute specifier. */
29166 static bool
29168 {
29170 }
29172 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29173 beginning of a standard C++-11 attribute specifier. */
29175 static bool
29177 {
29185 }
29187 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29188 beginning of a GNU extension attribute. */
29190 static bool
29192 {
29196 }
29198 /* Return true iff the next tokens can be the beginning of either a
29199 GNU attribute list, or a standard C++11 attribute sequence. */
29201 static bool
29203 {
29206 }
29208 /* Return true iff the next Nth tokens can be the beginning of either
29209 a GNU attribute list, or a standard C++11 attribute sequence. */
29211 static bool
29213 {
29216 }
29218 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
29219 of GNU attributes, or return NULL. */
29221 static tree
29223 {
29226 {
29231 else
29233 }
29235 }
29237 /* Parse an (optional) series of attributes.
29239 attributes:
29240 attributes attribute
29242 attribute:
29243 __attribute__ (( attribute-list [opt] ))
29245 The return value is as for cp_parser_gnu_attribute_list. */
29247 static tree
29249 {
29256 {
29258 tree attribute_list;
29261 /* Peek at the next token. */
29263 /* If it's not `__attribute__', then we're done. */
29267 /* Consume the `__attribute__' keyword. */
29269 /* Look for the two `(' tokens. */
29270 matching_parens outer_parens;
29273 matching_parens inner_parens;
29277 /* Peek at the next token. */
29280 /* Parse the attribute-list. */
29282 else
29283 /* If the next token is a `)', then there is no attribute
29284 list. */
29287 /* Look for the two `)' tokens. */
29295 /* Add these new attributes to the list. */
29297 }
29300 }
29302 /* Parse a GNU attribute-list.
29304 attribute-list:
29305 attribute
29306 attribute-list , attribute
29308 attribute:
29309 identifier
29310 identifier ( identifier )
29311 identifier ( identifier , expression-list )
29312 identifier ( expression-list )
29314 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
29315 to an attribute. The TREE_PURPOSE of each node is the identifier
29316 indicating which attribute is in use. The TREE_VALUE represents
29317 the arguments, if any. */
29319 static tree
29321 {
29325 /* Don't create wrapper nodes within attributes: the
29326 handlers don't know how to handle them. */
29327 auto_suppress_location_wrappers sentinel;
29331 {
29333 tree identifier;
29334 tree attribute;
29336 /* Look for the identifier. We also allow keywords here; for
29337 example `__attribute__ ((const))' is legal. */
29341 {
29344 /* Consume the token, but save it since we need it for the
29345 SIMD enabled function parsing. */
29348 /* Save away the identifier that indicates which attribute
29349 this is. */
29351 /* For keywords, use the canonical spelling, not the
29352 parsed identifier. */
29359 /* Peek at the next token. */
29361 /* If it's an `(', then parse the attribute arguments. */
29363 {
29369 vec = cp_parser_parenthesized_expression_list
29375 else
29376 {
29379 }
29380 /* Save the arguments away. */
29382 }
29385 {
29386 /* Add this attribute to the list. */
29389 }
29392 }
29393 /* Unless EXACTLY_ONE is set look for more attributes.
29394 If the next token isn't a `,', we're done. */
29398 /* Consume the comma and keep going. */
29400 }
29403 /* We built up the list in reverse order. */
29405 }
29407 /* Parse arguments of omp::directive attribute.
29409 ( directive-name ,[opt] clause-list[opt] )
29411 For directive just remember the first/last tokens for subsequent
29412 parsing. */
29414 static void
29416 {
29419 {
29425 }
29428 {
29434 }
29445 }
29447 /* Parse arguments of omp::sequence attribute.
29449 ( omp::[opt] directive-attr [ , omp::[opt] directive-attr ]... ) */
29451 static void
29453 {
29454 matching_parens parens;
29456 do
29457 {
29462 {
29466 }
29471 else
29476 {
29485 }
29489 UNKNOWN_LOCATION);
29492 else
29497 }
29502 }
29504 /* Parse a standard C++11 attribute.
29506 The returned representation is a TREE_LIST which TREE_PURPOSE is
29507 the scoped name of the attribute, and the TREE_VALUE is its
29508 arguments list.
29510 Note that the scoped name of the attribute is itself a TREE_LIST
29511 which TREE_PURPOSE is the namespace of the attribute, and
29512 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
29513 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
29514 and which TREE_PURPOSE is directly the attribute name.
29516 Clients of the attribute code should use get_attribute_namespace
29517 and get_attribute_name to get the actual namespace and name of
29518 attributes, regardless of their being GNU or C++11 attributes.
29520 attribute:
29521 attribute-token attribute-argument-clause [opt]
29523 attribute-token:
29524 identifier
29525 attribute-scoped-token
29527 attribute-scoped-token:
29528 attribute-namespace :: identifier
29530 attribute-namespace:
29531 identifier
29533 attribute-argument-clause:
29534 ( balanced-token-seq )
29536 balanced-token-seq:
29537 balanced-token [opt]
29538 balanced-token-seq balanced-token
29540 balanced-token:
29541 ( balanced-token-seq )
29542 [ balanced-token-seq ]
29543 { balanced-token-seq }. */
29545 static tree
29547 {
29554 /* First, parse name of the attribute, a.k.a attribute-token. */
29571 {
29572 /* We are seeing a scoped attribute token. */
29587 else
29588 {
29592 }
29598 NULL_TREE);
29600 }
29602 {
29606 NULL_TREE);
29607 }
29608 else
29609 {
29612 NULL_TREE);
29614 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
29615 but no longer: we have to be able to tell [[noreturn]] and
29616 __attribute__((noreturn)) apart. */
29617 /* C++14 deprecated attribute is equivalent to GNU's. */
29620 /* C++17 fallthrough attribute is equivalent to GNU's. */
29623 /* C++23 assume attribute is equivalent to GNU's. */
29626 /* Transactional Memory TS optimize_for_synchronized attribute is
29627 equivalent to GNU transaction_callable. */
29631 /* Transactional Memory attributes are GNU attributes. */
29634 }
29636 /* Now parse the optional argument clause of the attribute. */
29639 {
29645 {
29647 attr_id);
29649 }
29651 }
29653 {
29657 /* Maybe we don't expect to see any arguments for this attribute. */
29661 {
29663 attr_id);
29669 }
29673 /* The assume attribute needs special handling of the argument. */
29677 /* A GNU attribute that takes an identifier in parameter. */
29680 /* If this is a fake attribute created to handle -Wno-attributes,
29681 we must skip parsing the arguments. */
29683 {
29685 {
29687 {
29690 }
29692 {
29697 }
29699 {
29705 }
29706 }
29708 /* For unknown attributes, just skip balanced tokens instead of
29709 trying to parse the arguments. Set TREE_VALUE (attribute) to
29710 error_mark_node to distinguish skipped arguments from attributes
29711 with no arguments. */
29716 }
29718 vec = cp_parser_parenthesized_expression_list
29724 else
29725 {
29727 /* e.g. [[attr()]]. */
29730 attr_id);
29733 }
29737 else
29739 }
29742 }
29744 /* Warn if the attribute ATTRIBUTE appears more than once in the
29745 attribute-list ATTRIBUTES. This used to be enforced for certain
29746 attributes, but the restriction was removed in P2156.
29747 LOC is the location of ATTRIBUTE. Returns true if ATTRIBUTE was not
29748 found in ATTRIBUTES. */
29750 static bool
29752 {
29761 {
29766 }
29768 }
29770 /* Parse a list of standard C++-11 attributes.
29772 attribute-list:
29773 attribute [opt]
29774 attribute-list , attribute[opt]
29775 attribute ...
29776 attribute-list , attribute ...
29777 */
29779 static tree
29781 {
29786 {
29792 {
29794 {
29797 }
29798 }
29801 {
29807 {
29811 }
29813 {
29818 }
29820 }
29824 }
29827 }
29829 /* Optionally parse a C++20 contract role. A NULL return means that no
29830 contract role was specified.
29832 contract-role:
29833 % default
29834 % identifier
29836 If the identifier does not name a known contract role, it will
29837 be assumed to be default. Returns the identifier for the role
29838 token. */
29840 static tree
29842 {
29852 else
29853 {
29856 }
29859 /* FIXME: Warn about invalid/unknown roles? */
29861 }
29863 /* Parse an optional contract mode.
29865 contract-mode:
29866 contract-semantic
29867 [contract-level] [contract-role]
29869 contract-semantic:
29870 check_never_continue
29871 check_maybe_continue
29872 check_always_continue
29874 contract-level:
29875 default
29876 audit
29877 axiom
29879 contract-role:
29880 default
29881 identifier
29883 This grammar is taken from P1332R0. During parsing, this sets options
29884 on the MODE object to determine the configuration of the contract.
29886 Returns a tree containing the identifiers used in the configuration.
29887 This is either an IDENTIFIER with the literal semantic or a TREE_LIST
29888 whose TREE_VALUE is the contract-level and whose TREE_PURPOSE is the
29889 contract-role, if any. NULL_TREE is returned if no information is
29890 given (i.e., all defaults selected). */
29892 static tree
29895 {
29896 /* The mode is empty; the level and role are default. */
29900 /* There is only a role; the level is default. */
29902 {
29905 }
29907 /* Otherwise, match semantic or level. */
29911 tree config_id;
29913 {
29916 /* Either a named level, a concrete semantic, or an identifier
29917 for a postcondition. */
29922 /* The identifier is the return value for a postcondition. */
29926 }
29928 {
29931 }
29932 else
29933 {
29934 /* We got some other token other than a ':'. */
29937 }
29939 /* Consume the literal semantic or level token. */
29943 {
29945 "expected contract level: "
29948 }
29950 /* We matched an explicit semantic. */
29952 {
29954 {
29958 }
29960 }
29962 /* We matched a level, there may be a role; otherwise this is default. */
29964 {
29967 }
29970 }
29972 static tree
29974 {
29978 }
29980 static bool
29982 {
29984 }
29986 /* Parse a standard C++20 contract attribute specifier.
29988 contract-attribute-specifier:
29989 [ [ assert contract-level [opt] : conditional-expression ] ]
29990 [ [ pre contract-level [opt] : conditional-expression ] ]
29991 [ [ post contract-level [opt] identifier [opt] : conditional-expression ] ]
29993 For free functions, we cannot determine the type of the postcondition
29994 identifier because the we haven't called grokdeclarator yet. In those
29995 cases we parse the postcondition as if the identifier was declared as
29996 'auto <identifier>'. We then instantiate the postcondition once the
29997 return type is known.
29999 For member functions, contracts are in the complete-class context, so the
30000 parse is deferred. We also have the return type avaialable (unless it's
30001 deduced), so we don't need to parse the postcondition in terms of a
30002 placeholder. */
30004 static tree
30006 {
30014 /* Parse the optional mode. */
30017 /* Check for postcondition identifiers. */
30018 cp_expr identifier;
30026 /* Defer the parsing of pre/post contracts inside class definitions. */
30027 tree contract;
30029 current_class_type &&
30031 {
30032 /* Skip until we reach an unenclose ']'. If we ran into an unnested ']'
30033 that doesn't close the attribute, return an error and let the attribute
30034 handling code emit an error for missing ']]'. */
30038 CPP_CLOSE_SQUARE,
30045 /* Build a deferred-parse node. */
30050 /* And its corresponding contract. */
30052 }
30053 else
30054 {
30055 /* Enable location wrappers when parsing contracts. */
30058 /* Build a fake variable for the result identifier. */
30061 {
30065 }
30067 /* Parse the condition, ensuring that parameters or the return variable
30068 aren't flagged for use outside the body of a function. */
30073 /* Try to recover from errors by scanning up to the end of the
30074 attribute. Sometimes we get partially parsed expressions, so
30075 we need to search the condition for errors. */
30079 /* Build the contract. */
30082 /* Leave our temporary scope for the postcondition result. */
30084 {
30087 }
30088 }
30091 {
30094 }
30097 }
30099 /* Parse a contract condition for a deferred contract. */
30102 tree fn,
30103 tree attribute)
30104 {
30107 /* Make sure we've gotten something that hasn't been parsed yet or that
30108 we're not parsing an invalid contract. */
30117 /* Build a fake variable for the result identifier. */
30120 {
30121 /* TODO: Can we guarantee that the identifier has a location? */
30125 {
30128 }
30133 }
30135 /* 'this' is not allowed in preconditions of constructors or in postconditions
30136 of destructors. Note that the previous value of this variable is
30137 established by the calling function, so we need to save it here. */
30142 {
30145 }
30149 /* Push the saved tokens onto the parser's lexer stack. */
30153 /* Parse the condition, ensuring that parameters or the return variable
30154 aren't flagged for use outside the body of a function. */
30159 /* Revert to the main lexer. */
30162 /* Restore the queue. */
30168 /* Commit to changes. */
30171 /* Leave our temporary scope for the postcondition result. */
30173 {
30176 }
30177 }
30179 /* Parse a standard C++-11 attribute specifier.
30181 attribute-specifier:
30182 [ [ attribute-using-prefix [opt] attribute-list ] ]
30183 contract-attribute-specifier
30184 alignment-specifier
30186 attribute-using-prefix:
30187 using attribute-namespace :
30189 alignment-specifier:
30190 alignas ( type-id ... [opt] )
30191 alignas ( alignment-expression ... [opt] ).
30193 Extensions for contracts:
30195 contract-attribute-specifier:
30196 [ [ assert : contract-mode [opt] : conditional-expression ] ]
30197 [ [ pre : contract-mode [opt] : conditional-expression ] ]
30198 [ [ post : contract-mode [opt] identifier [opt] :
30199 conditional-expression ] ] */
30201 static tree
30203 {
30209 {
30218 {
30221 }
30223 /* Handle contract-attribute-specs specially. */
30225 {
30230 }
30233 {
30244 {
30247 "attribute using prefix only available "
30253 }
30254 else
30256 }
30260 finish_attrs:
30264 else
30265 /* Warn about parsing c++11 attribute in non-c++11 mode, only
30266 when we are sure that we have actually parsed them. */
30268 }
30269 else
30270 {
30271 tree alignas_expr;
30273 /* Look for an alignment-specifier. */
30284 matching_parens parens;
30292 {
30299 }
30304 /* Handle alignas (pack...). */
30306 {
30309 }
30311 /* Something went wrong, so don't build the attribute. */
30315 /* Missing ')' means the code cannot possibly be valid; go ahead
30316 and commit to make sure we issue a hard error. */
30324 /* Build the C++-11 representation of an 'aligned'
30325 attribute. */
30326 attributes
30329 }
30332 }
30334 /* Parse a standard C++-11 attribute-specifier-seq.
30336 attribute-specifier-seq:
30337 attribute-specifier-seq [opt] attribute-specifier */
30339 static tree
30341 {
30345 /* Don't create wrapper nodes within attributes: the
30346 handlers don't know how to handle them. */
30347 auto_suppress_location_wrappers sentinel;
30350 {
30359 else
30362 }
30365 }
30367 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
30368 return index of the first token after balanced-token, or N on failure. */
30370 static size_t
30372 {
30375 do
30377 {
30381 /* FALLTHRU */
30383 /* Ran out of tokens. */
30405 }
30408 }
30410 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
30411 return index of the first token after the GNU attribute tokens, or N on
30412 failure. */
30414 static size_t
30416 {
30418 {
30430 }
30432 }
30434 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
30435 next token), return index of the first token after the standard C++11
30436 attribute tokens, or N on failure. */
30438 static size_t
30440 {
30442 {
30445 {
30452 }
30455 {
30460 }
30461 else
30463 }
30465 }
30467 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
30468 as the next token), return index of the first token after the attribute
30469 tokens, or N on failure. */
30471 static size_t
30473 {
30477 }
30479 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
30480 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
30481 current value of the PEDANTIC flag, regardless of whether or not
30482 the `__extension__' keyword is present. The caller is responsible
30483 for restoring the value of the PEDANTIC flag. */
30485 static bool
30487 {
30488 /* Save the old value of the PEDANTIC flag. */
30492 {
30493 /* Consume the `__extension__' token. */
30495 /* We're not being pedantic while the `__extension__' keyword is
30496 in effect. */
30500 }
30503 }
30505 /* Parse a label declaration.
30507 label-declaration:
30508 __label__ label-declarator-seq ;
30510 label-declarator-seq:
30511 identifier , label-declarator-seq
30512 identifier */
30514 static void
30516 {
30517 /* Look for the `__label__' keyword. */
30521 {
30522 tree identifier;
30524 /* Look for an identifier. */
30526 /* If we failed, stop. */
30529 /* Declare it as a label. */
30531 /* If the next token is a `;', stop. */
30534 /* Look for the `,' separating the label declarations. */
30536 }
30538 /* Look for the final `;'. */
30540 }
30542 // -------------------------------------------------------------------------- //
30543 // Concept definitions
30545 static tree
30547 {
30548 /* A concept definition is an unevaluated context. */
30549 cp_unevaluated u;
30556 {
30560 }
30565 {
30569 }
30571 processing_constraint_expression_sentinel parsing_constraint;
30576 /* Consume the trailing ';'. Diagnose the problem if it isn't there,
30577 but continue as if it were. */
30581 }
30583 // -------------------------------------------------------------------------- //
30584 // Requires Clause
30586 /* Diagnose an expression that should appear in ()'s within a requires-clause
30587 and suggest where to place those parentheses. */
30589 static void
30591 {
30593 }
30595 static void
30597 {
30602 }
30604 /* Characterizes the likely kind of expression intended by a mis-written
30605 primary constraint. */
30606 enum primary_constraint_error
30607 {
30608 pce_ok,
30609 pce_maybe_operator,
30610 pce_maybe_postfix
30611 };
30613 /* Returns true if the token(s) following a primary-expression in a
30614 constraint-logical-* expression would require parentheses. */
30616 static primary_constraint_error
30618 {
30621 {
30626 {
30627 /* An equal sign may be part of the definition of a function,
30628 and not an assignment operator, when parsing the expression
30629 for a trailing requires-clause. For example:
30631 template<typename T>
30632 struct S {
30633 S() requires C<T> = default;
30634 };
30636 Don't try to reparse this a binary operator. */
30642 }
30644 /* Arithmetic operators. */
30650 /* Bitwise operators. */
30656 /* Relational operators. */
30664 /* Pointer-to-member. */
30667 /* Assignment operators. */
30678 /* Conditional operator */
30680 /* Unenclosed binary or conditional operator. */
30684 {
30685 /* A primary constraint that precedes the parameter-list of a
30686 lambda expression is followed by an open paren.
30688 []<typename T> requires C (T a, T b) { ... }
30690 Don't try to re-parse this as a postfix expression. */
30695 }
30697 {
30698 /* A primary-constraint-expression followed by a '[[' is not a
30699 postfix expression. */
30704 }
30708 /* Unenclosed postfix operator. */
30712 /* A primary constraint that precedes the lambda-declarator of a
30713 lambda expression is followed by trailing return type.
30715 []<typename T> requires C -> void {}
30717 Don't try to re-parse this as a postfix expression in
30718 C++23 and later. In C++20 ( needs to come in between but we
30719 allow it to be omitted with pedwarn. */
30722 /* Unenclosed postfix operator. */
30724 }
30725 }
30727 /* Returns true if the next token begins a unary expression, preceded by
30728 an operator or keyword. */
30730 static bool
30732 {
30735 {
30746 {
30748 {
30764 }
30765 }
30769 }
30772 }
30774 /* Parse a primary expression within a constraint. */
30776 static cp_expr
30778 {
30779 /* If this looks like a unary expression, parse it as such, but diagnose
30780 it as ill-formed; it requires parens. */
30782 {
30786 }
30789 cp_id_kind idk;
30800 {
30801 /* The primary-expression could be part of an unenclosed non-logical
30802 compound expression. */
30804 }
30806 {
30809 }
30811 /* Retry the parse at a lower precedence. If that succeeds, diagnose the
30812 error, but return the expression as if it were valid. */
30817 else
30820 {
30823 }
30825 /* Otherwise, something has gone very wrong, and we can't generate a more
30826 meaningful diagnostic or recover. */
30829 }
30831 /* Parse a constraint-logical-and-expression.
30833 constraint-logical-and-expression:
30834 primary-expression
30835 constraint-logical-and-expression '&&' primary-expression */
30837 static cp_expr
30839 {
30842 {
30846 }
30848 }
30850 /* Parse a constraint-logical-or-expression.
30852 constraint-logical-or-expression:
30853 constraint-logical-and-expression
30854 constraint-logical-or-expression '||' constraint-logical-and-expression */
30856 static cp_expr
30858 {
30861 {
30865 }
30867 }
30869 /* Parse the expression after a requires-clause. This has a different grammar
30870 than that in the concepts TS. */
30872 static tree
30874 {
30875 processing_constraint_expression_sentinel parsing_constraint;
30882 }
30884 /* Parse a expression after a requires clause.
30886 constraint-expression:
30887 logical-or-expression
30889 The required logical-or-expression must be a constant expression. Note
30890 that we don't check that the expression is constepxr here. We defer until
30891 we analyze constraints and then, we only check atomic constraints. */
30893 static tree
30895 {
30896 processing_constraint_expression_sentinel parsing_constraint;
30905 }
30907 /* Optionally parse a requires clause:
30909 requires-clause:
30910 `requires` constraint-logical-or-expression.
30911 [ConceptsTS]
30912 `requires constraint-expression.
30914 LAMBDA_P is true when the requires-clause is parsed before the
30915 parameter-list of a lambda-declarator. */
30917 static tree
30919 {
30920 /* A requires clause is an unevaluated context. */
30921 cp_unevaluated u;
30925 {
30928 {
30930 "%<requires%> only available with "
30932 /* Parse and discard the requires-clause. */
30935 }
30937 }
30941 {
30942 /* An opening brace following the start of a requires-clause is
30943 ill-formed; the user likely forgot the second `requires' that
30944 would start a requires-expression. */
30949 /* Don't consume the `requires', so that it's reused as the start of a
30950 requires-expression. */
30951 }
30952 else
30957 else
30959 }
30961 /*---------------------------------------------------------------------------
30962 Requires expressions
30963 ---------------------------------------------------------------------------*/
30965 /* Parse a requires expression
30967 requirement-expression:
30968 'requires' requirement-parameter-list [opt] requirement-body */
30970 static tree
30972 {
30976 /* Avoid committing to outer tentative parse. */
30979 /* This is definitely a requires-expression. */
30983 {
30984 /* Local parameters are delared as variables within the scope
30985 of the expression. They are not visible past the end of
30986 the expression. Expressions within the requires-expression
30987 are unevaluated. */
30988 struct scope_sentinel
30989 {
30991 {
30995 }
30998 {
31001 }
31004 /* Parse the optional parameter list. */
31006 {
31010 }
31011 else
31014 /* Parse the requirement body. */
31020 }
31022 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
31023 the parm chain. */
31028 {
31029 /* Perform semantic processing now to diagnose any invalid types and
31030 expressions. */
31035 }
31037 }
31039 /* Parse a parameterized requirement.
31041 requirement-parameter-list:
31042 '(' parameter-declaration-clause ')' */
31044 static tree
31046 {
31047 matching_parens parens;
31051 tree parms = (cp_parser_parameter_declaration_clause
31057 /* Modify the declared parameters by removing their context
31058 so they don't refer to the enclosing scope and explicitly
31059 indicating that they are constraint variables. */
31061 {
31066 {
31069 }
31070 }
31073 }
31075 /* Parse the body of a requirement.
31077 requirement-body:
31078 '{' requirement-list '}' */
31079 static tree
31081 {
31082 matching_braces braces;
31092 }
31094 /* Parse a sequence of requirements.
31096 requirement-seq:
31097 requirement
31098 requirement-seq requirement */
31100 static tree
31102 {
31104 do
31105 {
31109 }
31113 /* If there are no valid requirements, this is not a valid expression. */
31117 /* Reverse the order of requirements so they are analyzed in order. */
31119 }
31121 /* Parse a syntactic requirement or type requirement.
31123 requirement:
31124 simple-requirement
31125 compound-requirement
31126 type-requirement
31127 nested-requirement */
31129 static tree
31131 {
31135 {
31136 /* It's probably a type-requirement. */
31141 /* No, maybe it's something like typename T::type(); */
31146 /* Non-tentative for the error. */
31148 }
31151 else
31153 }
31155 /* Parse a simple requirement.
31157 simple-requirement:
31158 expression ';' */
31160 static tree
31162 {
31173 /* Sometimes we don't get locations, so use the cached token location
31174 as a reasonable approximation. */
31179 {
31182 {
31185 }
31187 {
31191 "if a concept-id is a valid expression; add "
31193 }
31195 }
31198 }
31200 /* Parse a type requirement
31202 type-requirement
31203 nested-name-specifier [opt] required-type-name ';'
31205 required-type-name:
31206 type-name
31207 'template' [opt] simple-template-id */
31209 static tree
31211 {
31215 // Save the scope before parsing name specifiers.
31226 tree type;
31228 {
31237 }
31238 else
31258 }
31260 /* Parse a compound requirement
31262 compound-requirement:
31263 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
31265 static tree
31267 {
31268 /* Parse an expression enclosed in '{ }'s. */
31269 matching_braces braces;
31280 {
31284 }
31286 /* If the expression was invalid, skip the remainder of the requirement. */
31288 {
31292 }
31294 /* Parse the optional noexcept. */
31297 {
31300 }
31302 /* Parse the optional trailing return type. */
31305 {
31311 /* C++20 allows either a type-id or a type-constraint. Parsing
31312 a type-id will subsume the parsing for a type-constraint but
31313 allow for more syntactic forms (e.g., const C<T>*). */
31322 /* Check that we haven't written something like 'const C<T>*'. */
31324 {
31326 {
31331 }
31332 }
31334 /* P1452R2 removed the trailing-return-type option. */
31337 }
31349 }
31351 /* Parse a nested requirement. This is the same as a requires clause.
31353 nested-requirement:
31354 requires-clause */
31356 static tree
31358 {
31370 }
31372 /* Support Functions */
31374 /* Return the appropriate prefer_type argument for lookup_name based on
31375 tag_type. */
31379 {
31381 {
31385 }
31386 }
31388 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
31389 NAME should have one of the representations used for an
31390 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
31391 is returned. If PARSER->SCOPE is a dependent type, then a
31392 SCOPE_REF is returned.
31394 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
31395 returned; the name was already resolved when the TEMPLATE_ID_EXPR
31396 was formed. Abstractly, such entities should not be passed to this
31397 function, because they do not need to be looked up, but it is
31398 simpler to check for this special case here, rather than at the
31399 call-sites.
31401 In cases not explicitly covered above, this function returns a
31402 DECL, OVERLOAD, or baselink representing the result of the lookup.
31403 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
31404 is returned.
31406 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
31407 (e.g., "struct") that was used. In that case bindings that do not
31408 refer to types are ignored.
31410 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
31411 ignored. If IS_TEMPLATE IS 2, the 'template' keyword was specified.
31413 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
31414 are ignored.
31416 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
31417 types.
31419 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
31420 TREE_LIST of candidates if name-lookup results in an ambiguity, and
31421 NULL_TREE otherwise. */
31423 static cp_expr
31430 location_t name_location)
31431 {
31432 tree decl;
31435 /* Assume that the lookup will be unambiguous. */
31439 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
31440 no longer valid. Note that if we are parsing tentatively, and
31441 the parse fails, OBJECT_TYPE will be automatically restored. */
31447 /* A template-id has already been resolved; there is no lookup to
31448 do. */
31452 {
31456 }
31458 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
31459 it should already have been checked to make sure that the name
31460 used matches the type being destroyed. */
31462 {
31463 tree type;
31465 /* Figure out to which type this destructor applies. */
31470 else
31472 /* If that's not a class type, there is no destructor. */
31476 /* In a non-static member function, check implicit this->. */
31479 tf_warning_or_error);
31488 }
31490 /* By this point, the NAME should be an ordinary identifier. If
31491 the id-expression was a qualified name, the qualifying scope is
31492 stored in PARSER->SCOPE at this point. */
31495 /* Perform the lookup. */
31497 {
31503 /* If the SCOPE is dependent, the lookup must be deferred until
31504 the template is instantiated -- unless we are explicitly
31505 looking up names in uninstantiated templates. Even then, we
31506 cannot look up the name if the scope is not a class type; it
31507 might, for example, be a template type parameter. */
31512 /* Defer lookup. */
31514 else
31515 {
31518 /* If PARSER->SCOPE is a dependent type, then it must be a
31519 class type, and we must not be checking dependencies;
31520 otherwise, we would have processed this lookup above. So
31521 that PARSER->SCOPE is not considered a dependent base by
31522 lookup_member, we must enter the scope here. */
31526 /* If the PARSER->SCOPE is a template specialization, it
31527 may be instantiated during name lookup. In that case,
31528 errors may be issued. Even if we rollback the current
31529 tentative parse, those errors are valid. */
31534 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
31535 lookup result and the nested-name-specifier nominates a class C:
31536 * if the name specified after the nested-name-specifier, when
31537 looked up in C, is the injected-class-name of C (Clause 9), or
31538 * if the name specified after the nested-name-specifier is the
31539 same as the identifier or the simple-template-id's template-
31540 name in the last component of the nested-name-specifier,
31541 the name is instead considered to name the constructor of
31542 class C. [ Note: for example, the constructor is not an
31543 acceptable lookup result in an elaborated-type-specifier so
31544 the constructor would not be used in place of the
31545 injected-class-name. --end note ] Such a constructor name
31546 shall be used only in the declarator-id of a declaration that
31547 names a constructor or in a using-declaration. */
31557 }
31559 /* If the scope is a dependent type and either we deferred lookup or
31560 we did lookup but didn't find the name, rememeber the name. */
31563 {
31565 {
31566 tree type;
31568 /* The resolution to Core Issue 180 says that `struct
31569 A::B' should be considered a type-name, even if `A'
31570 is dependent. */
31575 }
31579 CPP_CLOSE_PAREN)))
31583 else
31586 is_template);
31587 }
31590 }
31592 {
31595 /* Look up the name in the scope of the OBJECT_TYPE, unless the
31596 OBJECT_TYPE is not a class. */
31598 /* If the OBJECT_TYPE is a template specialization, it may
31599 be instantiated during name lookup. In that case, errors
31600 may be issued. Even if we rollback the current tentative
31601 parse, those errors are valid. */
31603 name,
31606 tf_warning_or_error);
31607 else
31610 /* If we didn't find a member and have dependent bases, the member lookup
31611 is now dependent. */
31618 /* Look it up in the enclosing context. DR 141: When looking for a
31619 template-name after -> or ., only consider class templates. */
31621 /* DR 141: When looking in the
31622 current enclosing context for a
31623 template-name after -> or ., only
31624 consider class templates. */
31628 /* If we did unqualified lookup of a dependent member-qualified name and
31629 found something, do we want to use it? P1787 clarified that we need
31630 to look in the object scope first even if it's dependent, but for now
31631 let's still use it in some cases.
31632 FIXME remember unqualified lookup result to use if member lookup fails
31633 at instantiation time. */
31635 {
31637 /* Only use the unqualified class template lookup if we're actually
31638 looking at a template arg list. */
31641 }
31643 /* If we know we're looking for a type (e.g. A in p->A::x),
31644 mock up a typename. */
31646 {
31648 typename_type);
31650 }
31654 }
31655 else
31656 {
31661 }
31663 /* If the lookup failed, let our caller know. */
31667 /* If we have resolved the name of a member declaration, check to
31668 see if the declaration is accessible. When the name resolves to
31669 set of overloaded functions, accessibility is checked when
31670 overload resolution is done. If we have a TREE_LIST, then the lookup
31671 is either ambiguous or it found multiple injected-class-names, the
31672 accessibility of which is trivially satisfied.
31674 During an explicit instantiation, access is not checked at all,
31675 as per [temp.explicit]. */
31678 tf_warning_or_error);
31680 /* Pull out the template from an injected-class-name (or multiple). */
31684 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
31686 {
31689 /* The error message we have to print is too complicated for
31690 cp_parser_error, so we incorporate its actions directly. */
31692 {
31694 name);
31696 }
31698 }
31709 }
31711 /* Like cp_parser_lookup_name, but for use in the typical case where
31712 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
31713 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
31715 static tree
31717 {
31719 none_type,
31724 location);
31725 }
31727 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
31728 the current context, return the TYPE_DECL. If TAG_NAME_P is
31729 true, the DECL indicates the class being defined in a class-head,
31730 or declared in an elaborated-type-specifier.
31732 Otherwise, return DECL. */
31734 static tree
31736 {
31737 /* If the TEMPLATE_DECL is being declared as part of a class-head,
31738 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
31740 struct A {
31741 template <typename T> struct B;
31742 };
31744 template <typename T> struct A::B {};
31746 Similarly, in an elaborated-type-specifier:
31748 namespace N { struct X{}; }
31750 struct A {
31751 template <typename T> friend struct N::X;
31752 };
31754 However, if the DECL refers to a class type, and we are in
31755 the scope of the class, then the name lookup automatically
31756 finds the TYPE_DECL created by build_self_reference rather
31757 than a TEMPLATE_DECL. For example, in:
31759 template <class T> struct S {
31760 S s;
31761 };
31763 there is no need to handle such case. */
31769 }
31771 /* If too many, or too few, template-parameter lists apply to the
31772 declarator, issue an error message. Returns TRUE if all went well,
31773 and FALSE otherwise. */
31775 static bool
31778 location_t declarator_location)
31779 {
31781 {
31783 {
31792 {
31793 /* If the DECLARATOR has the form `X<y>' then it uses one
31794 additional level of template parameters. */
31797 }
31799 return cp_parser_check_template_parameters
31801 declarator);
31802 }
31818 }
31820 }
31822 /* NUM_TEMPLATES were used in the current declaration. If that is
31823 invalid, return FALSE and issue an error messages. Otherwise,
31824 return TRUE. If DECLARATOR is non-NULL, then we are checking a
31825 declarator and we can print more accurate diagnostics. */
31827 static bool
31831 location_t location,
31833 {
31834 /* If there are the same number of template classes and parameter
31835 lists, that's OK. */
31838 /* If there are more, but only one more, and the name ends in an identifier,
31839 then we are declaring a primary template. That's OK too. */
31847 /* If there are more template classes than parameter lists, we have
31848 something like:
31850 template <class T> void S<T>::R<T>::f (); */
31852 {
31862 else
31865 }
31866 /* Otherwise, there are too many template parameter lists. We have
31867 something like:
31869 template <class T> template <class U> void S::f(); */
31872 }
31874 /* Parse an optional `::' token indicating that the following name is
31875 from the global namespace. If so, PARSER->SCOPE is set to the
31876 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
31877 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
31878 Returns the new value of PARSER->SCOPE, if the `::' token is
31879 present, and NULL_TREE otherwise. */
31881 static tree
31883 {
31886 /* Peek at the next token. */
31888 /* If we're looking at a `::' token then we're starting from the
31889 global namespace, not our current location. */
31891 {
31892 /* Consume the `::' token. */
31894 /* Set the SCOPE so that we know where to start the lookup. */
31900 }
31902 {
31906 }
31909 }
31911 /* Returns TRUE if the upcoming token sequence is the start of a
31912 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
31913 declarator is preceded by the `friend' specifier. The parser flags FLAGS
31914 is used to control type-specifier parsing. */
31916 static bool
31919 {
31922 tree nested_name_specifier;
31925 /* The common case is that this is not a constructor declarator, so
31926 try to avoid doing lots of work if at all possible. It's not
31927 valid declare a constructor at function scope. */
31930 /* And only certain tokens can begin a constructor declarator. */
31935 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
31936 declarator-id of a constructor or destructor. */
31940 /* Parse tentatively; we are going to roll back all of the tokens
31941 consumed here. */
31943 /* Assume that we are looking at a constructor declarator. */
31946 /* Look for the optional `::' operator. */
31949 /* Look for the nested-name-specifier. */
31950 nested_name_specifier
31957 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
31960 {
31965 }
31971 /* Outside of a class-specifier, there must be a
31972 nested-name-specifier. Except in C++17 mode, where we
31973 might be declaring a guiding declaration. */
31980 /* If we have a class scope, this is easy; DR 147 says that S::S always
31981 names the constructor, and no other qualified name could. */
31984 {
31994 }
31995 /* If we still think that this might be a constructor-declarator,
31996 look for a class-name. */
31998 {
31999 /* If we have:
32001 template <typename T> struct S {
32002 S();
32003 };
32005 we must recognize that the nested `S' names a class. */
32009 tree type_decl;
32013 none_type,
32020 {
32026 none_type,
32031 else
32033 }
32035 /* If there was no class-name, then this is not a constructor.
32036 Otherwise, if we are in a class-specifier and we aren't
32037 handling a friend declaration, check that its type matches
32038 current_class_type (c++/38313). Note: error_mark_node
32039 is left alone for error recovery purposes. */
32041 && (outside_class_specifier_p
32047 /* If we're still considering a constructor, we have to see a `(',
32048 to begin the parameter-declaration-clause, followed by either a
32049 `)', an `...', or a decl-specifier. We need to check for a
32050 type-specifier to avoid being fooled into thinking that:
32052 S (f) (int);
32054 is a constructor. (It is actually a function named `f' that
32055 takes one parameter (of type `int') and returns a value of type
32056 `S'. */
32064 /* A parameter declaration begins with a decl-specifier,
32065 which is either the "attribute" keyword, a storage class
32066 specifier, or (usually) a type-specifier. */
32068 /* GNU attributes can actually appear both at the start of
32069 a parameter and parenthesized declarator.
32070 S (__attribute__((unused)) int);
32071 is a constructor, but
32072 S (__attribute__((unused)) foo) (int);
32073 is a function declaration. [[attribute]] can appear in the
32074 first form too, but not in the second form. */
32076 {
32077 tree type;
32083 {
32087 }
32089 /* Names appearing in the type-specifier should be looked up
32090 in the scope of the class. */
32094 {
32097 {
32101 {
32104 }
32105 }
32107 }
32109 /* Inside the constructor parameter list, surrounding
32110 template-parameter-lists do not apply. */
32111 saved_num_template_parameter_lists
32115 /* Look for the type-specifier. It's not optional, but its typename
32116 might be. Unless this is a friend declaration; we don't want to
32117 treat
32119 friend S (T::fn)(int);
32121 as a constructor, but with P0634, we might assume a type when
32122 looking for the type-specifier. It is actually a function named
32123 `T::fn' that takes one parameter (of type `int') and returns a
32124 value of type `S'. Constructors can be friends, but they must
32125 use a qualified name.
32127 Parse with an empty set of declaration specifiers since we're
32128 trying to match a decl-specifier-seq of the first parameter.
32129 This must be non-null so that cp_parser_simple_type_specifier
32130 will recognize a constrained placeholder type such as:
32131 'C<int> auto' where C is a type concept. */
32132 cp_decl_specifier_seq ctor_specs;
32142 parser->num_template_parameter_lists
32145 /* Leave the scope of the class. */
32150 }
32151 }
32153 /* We did not really want to consume any tokens. */
32157 }
32159 /* Parse the definition of the function given by the DECL_SPECIFIERS,
32160 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
32161 they must be performed once we are in the scope of the function.
32163 Returns the function defined. */
32165 static tree
32166 cp_parser_function_definition_from_specifiers_and_declarator
32169 tree attributes,
32171 {
32172 tree fn;
32175 /* Begin the function-definition. */
32178 /* The things we're about to see are not directly qualified by any
32179 template headers we've seen thus far. */
32182 /* If there were names looked up in the decl-specifier-seq that we
32183 did not check, check them now. We must wait until we are in the
32184 scope of the function to perform the checks, since the function
32185 might be a friend. */
32189 {
32194 }
32197 {
32198 /* Skip the entire function. */
32201 }
32203 {
32204 /* Seen already, skip it. An error message has already been output. */
32208 /* If this is a function from a class, pop the nested class. */
32211 }
32212 else
32213 {
32218 }
32221 }
32223 /* Parse the part of a function-definition that follows the
32224 declarator. INLINE_P is TRUE iff this function is an inline
32225 function defined within a class-specifier.
32227 Returns the function defined. */
32229 static tree
32232 {
32233 tree fn;
32238 bool fully_implicit_function_template_p
32241 tree implicit_template_parms
32244 cp_binding_level* implicit_template_scope
32250 /* If the next token is `return', then the code may be trying to
32251 make use of the "named return value" extension that G++ used to
32252 support. */
32255 {
32256 /* Consume the `return' keyword. */
32258 /* Look for the identifier that indicates what value is to be
32259 returned. */
32261 /* Issue an error message. */
32264 /* Skip tokens until we reach the start of the function body. */
32266 {
32273 }
32274 }
32275 /* The `extern' in `extern "C" void f () { ... }' does not apply to
32276 anything declared inside `f'. */
32277 saved_in_unbraced_linkage_specification_p
32280 /* Inside the function, surrounding template-parameter-lists do not
32281 apply. */
32282 saved_num_template_parameter_lists
32286 /* If the next token is `try', `__transaction_atomic', or
32287 `__transaction_relaxed`, then we are looking at either function-try-block
32288 or function-transaction-block. Note that all of these include the
32289 function-body. */
32293 RID_TRANSACTION_RELAXED))
32297 else
32298 cp_parser_ctor_initializer_opt_and_function_body
32301 /* Finish the function. */
32305 && !inline_p
32311 /* Generate code for it, if necessary. */
32314 /* Restore the saved values. */
32315 parser->in_unbraced_linkage_specification_p
32317 parser->num_template_parameter_lists
32321 parser->fully_implicit_function_template_p
32323 parser->implicit_template_parms
32325 parser->implicit_template_scope
32332 }
32334 /* Parse a template-declaration body (following argument list). */
32336 static void
32338 tree parameter_list,
32340 {
32344 /* We just processed one more parameter list. */
32347 /* Get the deferred access checks from the parameter list. These
32348 will be checked once we know what is being declared, as for a
32349 member template the checks must be performed in the scope of the
32350 class containing the member. */
32353 /* Tentatively parse for a new template parameter list, which can either be
32354 the template keyword or a template introduction. */
32363 /* -fconcept-ts 'concept bool' syntax is handled below, in
32364 cp_parser_single_declaration. */
32366 else
32367 {
32370 checks,
32371 member_p,
32375 /* If this is a member template declaration, let the front
32376 end know. */
32378 {
32383 }
32388 }
32389 /* We are done with the current parameter list. */
32394 /* Finish up. */
32397 /* Check the template arguments for a literal operator template. */
32401 {
32405 else
32406 {
32409 {
32416 /* OK, C++20 string literal operator template. We don't need
32417 to warn in lower dialects here because we will have already
32422 }
32424 {
32433 else
32434 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
32436 "ISO C++ did not adopt string literal operator templa"
32438 }
32439 else
32441 }
32443 {
32446 "template %qD has invalid parameter list; expected "
32447 "non-type template parameter pack %<<char...>%> or "
32449 decl);
32450 else
32452 "template %qD has invalid parameter list; expected "
32454 decl);
32455 }
32456 }
32458 /* Register member declarations. */
32461 /* If DECL is a function template, we must return to parse it later.
32462 (Even though there is no definition, there might be default
32463 arguments that need handling.) */
32467 }
32469 /* Parse a template introduction header for a template-declaration. Returns
32470 false if tentative parse fails. */
32472 static bool
32474 {
32484 /* In classes don't parse valid unnamed bitfields as invalid
32485 template introductions. */
32489 /* Look for the optional `::' operator. */
32492 /* Look for the nested-name-specifier. */
32502 /* Look up the concept for which we will be matching
32503 template parameters. */
32515 /* Look for opening brace for introduction. */
32516 matching_braces braces;
32525 /* Build vector of placeholder parameters and grab
32526 matching identifiers. */
32529 /* Look for closing brace for introduction. */
32533 /* The introduction-list shall not be empty. */
32536 {
32537 /* In cp_parser_introduction_list we have already issued an error. */
32539 }
32542 {
32546 }
32548 /* Build and associate the constraint. */
32553 introduction_list,
32554 introduction_loc);
32556 {
32563 member_p);
32565 }
32571 }
32573 /* Parse a normal template-declaration following the template keyword. */
32575 static void
32577 {
32578 tree parameter_list;
32582 /* Look for the `<' token. */
32586 {
32587 /* 14.5.2.2 [temp.mem]
32589 A local class shall not have member templates. */
32594 }
32595 /* [temp]
32597 A template ... shall not have C linkage. */
32599 {
32602 /* Give it C++ linkage to avoid confusing other parts of the
32603 front end. */
32606 }
32607 else
32610 /* We cannot perform access checks on the template parameter
32611 declarations until we know what is being declared, just as we
32612 cannot check the decl-specifier list. */
32615 /* If the next token is `>', then we have an invalid
32616 specialization. Rather than complain about an invalid template
32617 parameter, issue an error message here. */
32619 {
32623 }
32624 else
32625 {
32626 /* Parse the template parameters. */
32628 }
32630 /* Look for the `>'. */
32633 /* Manage template requirements */
32635 {
32640 }
32643 member_p);
32645 /* For the erroneous case of a template with C linkage, we pushed an
32646 implicit C++ linkage scope; exit that scope now. */
32649 }
32651 /* Parse a template-declaration, assuming that the `export' (and
32652 `extern') keywords, if present, has already been scanned. MEMBER_P
32653 is as for cp_parser_template_declaration. */
32655 static bool
32657 {
32659 {
32663 }
32668 }
32670 /* Perform the deferred access checks from a template-parameter-list.
32671 CHECKS is a TREE_LIST of access checks, as returned by
32672 get_deferred_access_checks. */
32674 static void
32675 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
32676 {
32680 }
32682 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
32683 `function-definition' sequence that follows a template header.
32684 If MEMBER_P is true, this declaration appears in a class scope.
32686 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
32687 *FRIEND_P is set to TRUE iff the declaration is a friend. */
32689 static tree
32695 {
32698 cp_decl_specifier_seq decl_specifiers;
32702 /* This function is only used when processing a template
32703 declaration. */
32707 /* Defer access checks until we know what is being declared. */
32710 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
32711 alternative. */
32714 (CP_PARSER_FLAGS_OPTIONAL
32719 cp_omp_declare_simd_data odsd;
32728 /* There are no template typedefs. */
32730 {
32734 }
32736 /* Gather up the access checks that occurred the
32737 decl-specifier-seq. */
32740 /* Check for the declaration of a template class. */
32742 {
32745 {
32748 /* In this case:
32750 struct C {
32751 friend template <typename T> struct A<T>::B;
32752 };
32754 A<T>::B will be represented by a TYPENAME_TYPE, and
32755 therefore not recognized by shadow_tag. */
32757 && !decl
32764 else
32767 /* If this is a declaration, but not a definition, associate
32768 any constraints with the type declaration. Constraints
32769 are associated with definitions in cp_parser_class_specifier. */
32773 /* Perform access checks for template parameters. */
32776 /* Give a helpful diagnostic for
32777 template <class T> struct A { } a;
32778 if we aren't already recovering from an error. */
32781 {
32783 "a class template declaration must not declare "
32787 }
32788 }
32789 }
32791 /* Complain about missing 'typename' or other invalid type names. */
32794 {
32795 /* cp_parser_parse_and_diagnose_invalid_type_name calls
32796 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
32797 the rest of this declaration. */
32800 }
32802 /* If it's not a template class, try for a template function. If
32803 the next token is a `;', then this declaration does not declare
32804 anything. But, if there were errors in the decl-specifiers, then
32805 the error might well have come from an attempted class-specifier.
32806 In that case, there's no need to warn about a missing declarator. */
32810 {
32812 /* We don't delay parsing for friends, though CWG 2510 may change
32813 that. */
32817 flags,
32819 checks,
32821 member_p,
32822 declares_class_or_enum,
32826 /* 7.1.1-1 [dcl.stc]
32828 A storage-class-specifier shall not be specified in an explicit
32829 specialization... */
32831 && explicit_specialization_p
32833 {
32837 }
32841 }
32843 /* Look for a trailing `;' after the declaration. */
32849 out:
32852 /* Clear any current qualification; whatever comes next is the start
32853 of something new. */
32861 }
32863 /* Parse a cast-expression that is not the operand of a unary "&". */
32865 static cp_expr
32867 {
32870 }
32872 /* Parse a functional cast to TYPE. Returns an expression
32873 representing the cast. */
32875 static cp_expr
32877 {
32879 tree expression_list;
32880 cp_expr cast;
32888 {
32898 /* Create a location of the form:
32899 type_name{i, f}
32900 ^~~~~~~~~~~~~~~
32901 with caret == start at the start of the type name,
32902 finishing at the closing brace. */
32907 }
32916 else
32917 {
32920 }
32922 /* Create a location of the form:
32923 float(i)
32924 ^~~~~~~~
32925 with caret == start at the start of the type name,
32926 finishing at the closing paren. */
32930 tf_warning_or_error);
32932 /* [expr.const]/1: In an integral constant expression "only type
32933 conversions to integral or enumeration type can be used". */
32939 NIC_CONSTRUCTOR))
32943 }
32945 /* Save the tokens that make up the body of a member function defined
32946 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
32947 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
32948 specifiers applied to the declaration. Returns the FUNCTION_DECL
32949 for the member function. */
32951 static tree
32955 tree attributes)
32956 {
32959 tree fn;
32962 /* Create the FUNCTION_DECL. */
32966 /* If something went badly wrong, bail out now. */
32968 {
32969 /* If there's a function-body, skip it. */
32974 }
32976 /* Remember it, if there are default args to post process. */
32979 /* Save away the tokens that make up the body of the
32980 function. */
32986 RID_TRANSACTION_ATOMIC))
32987 {
32989 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
32996 {
33002 }
33003 else
33006 {
33010 }
33011 }
33013 /* Handle function try blocks. */
33015 {
33018 }
33019 /* We can have braced-init-list mem-initializers before the fn body. */
33021 {
33024 {
33025 /* cache_group will stop after an un-nested { } pair, too. */
33029 /* variadic mem-inits have ... after the ')'. */
33032 }
33033 }
33035 /* Handle function try blocks. */
33041 /* Save away the inline definition; we will process it when the
33042 class is complete. */
33046 /* We need to know that this was defined in the class, so that
33047 friend templates are handled correctly. */
33050 /* Add FN to the queue of functions to be parsed later. */
33054 }
33056 /* Save the tokens that make up the in-class initializer for a non-static
33057 data member. Returns a DEFERRED_PARSE. */
33059 static tree
33061 {
33063 }
33065 /* Parse a template-argument-list, as well as the trailing ">" (but
33066 not the opening "<"). See cp_parser_template_argument_list for the
33067 return value. */
33069 static tree
33071 {
33072 tree arguments;
33073 tree saved_scope;
33074 tree saved_qualifying_scope;
33075 tree saved_object_scope;
33078 /* [temp.names]
33080 When parsing a template-id, the first non-nested `>' is taken as
33081 the end of the template-argument-list rather than a greater-than
33082 operator. */
33083 saved_greater_than_is_operator_p
33086 /* Parsing the argument list may modify SCOPE, so we save it
33087 here. */
33091 /* We need to evaluate the template arguments, even though this
33092 template-id may be nested within a "sizeof". */
33093 cp_evaluated ev;
33094 /* Parse the template-argument-list itself. */
33099 {
33102 }
33103 else
33105 /* Look for the `>' that ends the template-argument-list. If we find
33106 a '>>' instead, it's probably just a typo. */
33108 {
33110 {
33111 /* In C++0x, a `>>' in a template argument list or cast
33112 expression is considered to be two separate `>'
33113 tokens. So, change the current token to a `>', but don't
33114 consume it: it will be consumed later when the outer
33115 template argument list (or cast expression) is parsed.
33116 Note that this replacement of `>' for `>>' is necessary
33117 even if we are parsing tentatively: in the tentative
33118 case, after calling
33119 cp_parser_enclosed_template_argument_list we will always
33120 throw away all of the template arguments and the first
33121 closing `>', either because the template argument list
33122 was erroneous or because we are replacing those tokens
33123 with a CPP_TEMPLATE_ID token. The second `>' (which will
33124 not have been thrown away) is needed either to close an
33125 outer template argument list or to complete a new-style
33126 cast. */
33129 }
33131 {
33132 /* If we're in a nested template argument list, the '>>' has
33133 to be a typo for '> >'. We emit the error message, but we
33134 continue parsing and we push a '>' as next token, so that
33135 the argument list will be parsed correctly. Note that the
33136 global source location is still on the token before the
33137 '>>', so we need to say explicitly where we want it. */
33145 }
33146 else
33147 {
33148 /* If this is not a nested template argument list, the '>>'
33149 is a typo for '>'. Emit an error message and continue.
33150 Same deal about the token location, but here we can get it
33151 right by consuming the '>>' before issuing the diagnostic. */
33154 "spurious %<>>%>, use %<>%> to terminate "
33156 }
33157 }
33158 /* Similarly for >>= and >=. */
33161 {
33167 {
33170 }
33172 {
33175 else
33178 }
33179 else
33180 {
33183 }
33189 }
33190 else
33192 /* The `>' token might be a greater-than operator again now. */
33193 parser->greater_than_is_operator_p
33195 /* Restore the SAVED_SCOPE. */
33201 }
33203 /* MEMBER_FUNCTION is a member function, or a friend. If default
33204 arguments, or the body of the function have not yet been parsed,
33205 parse them now. */
33207 static void
33209 {
33212 /* If this member is a template, get the underlying
33213 FUNCTION_DECL. */
33217 /* There should not be any class definitions in progress at this
33218 point; the bodies of members are only parsed outside of all class
33219 definitions. */
33221 /* While we're parsing the member functions we might encounter more
33222 classes. We want to handle them right away, but we don't want
33223 them getting mixed up with functions that are currently in the
33224 queue. */
33227 /* Make sure that any template parameters are in scope. */
33230 /* If the body of the function has not yet been parsed, parse it
33231 now. Except if the tokens have been purged (PR c++/39751). */
33234 {
33235 tree function_scope;
33238 /* The function is no longer pending; we are processing it. */
33243 /* If this is a local class, enter the scope of the containing
33244 function. */
33249 /* Push the body of the function onto the lexer stack. */
33252 /* Let the front end know that we going to be defining this
33253 function. */
33257 /* #pragma omp declare reduction needs special parsing. */
33259 {
33264 }
33265 else
33266 /* Now, parse the body of the function. */
33270 /* Leave the scope of the containing function. */
33274 }
33276 /* Remove any template parameters from the symbol table. */
33279 /* Restore the queue. */
33281 }
33283 /* If DECL contains any default args, remember it on the unparsed
33284 functions queue. */
33286 static void
33288 {
33289 tree probe;
33292 probe;
33295 {
33299 }
33301 /* Remember if there is a noexcept-specifier to post process. */
33306 /* Contracts are deferred. */
33309 {
33312 }
33313 }
33315 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
33316 which is either a FIELD_DECL or PARM_DECL. Parse it and return
33317 the result. For a PARM_DECL, PARMTYPE is the corresponding type
33318 from the parameter-type-list. */
33320 static tree
33323 {
33325 tree parsed_arg;
33330 /* Push the saved tokens for the default argument onto the parser's
33331 lexer stack. */
33337 /* Parse the default argument. */
33348 {
33349 /* In a non-template class, check conversions now. In a template,
33350 we'll wait and instantiate these as needed. */
33353 tf_warning_or_error);
33356 else
33358 }
33360 /* If the token stream has not been completely used up, then
33361 there was extra junk after the end of the default
33362 argument. */
33364 {
33367 else
33369 }
33371 /* Revert to the main lexer. */
33375 }
33377 /* FIELD is a non-static data member with an initializer which we saved for
33378 later; parse it now. */
33380 static void
33382 {
33383 tree def;
33390 NULL_TREE);
33396 }
33398 /* FN is a FUNCTION_DECL which may contains a parameter with an
33399 unparsed DEFERRED_PARSE. Parse the default args now. This function
33400 assumes that the current scope is the scope in which the default
33401 argument should be processed. */
33403 static void
33405 {
33408 /* While we're parsing the default args, we might (due to the
33409 statement expression extension) encounter more classes. We want
33410 to handle them right away, but we don't want them getting mixed
33411 up with default args that are currently in the queue. */
33414 /* Local variable names (and the `this' keyword) may not appear
33415 in a default argument. */
33423 /* Gather the PARM_DECLs into a vec so we can keep track of them when
33424 pushdecl clears DECL_CHAIN. */
33425 releasing_vec parms;
33435 {
33437 tree parsed_arg;
33446 /* This can happen for a friend declaration for a function
33447 already declared with default arguments. */
33450 parsed_arg
33452 default_arg,
33456 /* Update any instantiations we've already created. */
33459 }
33463 /* Restore DECL_CHAINs after clobbering by pushdecl. */
33466 {
33469 }
33473 /* Make sure no default arg is missing. */
33476 /* Restore the state of local_variables_forbidden_p. */
33479 /* Restore the queue. */
33481 }
33483 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
33485 sizeof ... ( identifier )
33487 where the 'sizeof' token has already been consumed. */
33489 static tree
33491 {
33492 /* Consume the `...'. */
33496 matching_parens parens;
33500 else
33508 /* The name is not qualified. */
33528 }
33530 /* Parse the operand of `sizeof' (or a similar operator). Returns
33531 either a TYPE or an expression, depending on the form of the
33532 input. The KEYWORD indicates which kind of expression we have
33533 encountered. */
33535 static tree
33537 {
33544 /* If it's a `...', then we are computing the length of a parameter
33545 pack. */
33550 /* Types cannot be defined in a `sizeof' expression. Save away the
33551 old message. */
33554 parser->type_definition_forbidden_message
33556 parser->type_definition_forbidden_message_arg
33559 /* The restrictions on constant-expressions do not apply inside
33560 sizeof expressions. */
33561 saved_integral_constant_expression_p
33563 saved_non_integral_constant_expression_p
33570 /* Do not actually evaluate the expression. */
33573 /* If it's a `(', then we might be looking at the type-id
33574 construction. */
33576 {
33581 /* We can't be sure yet whether we're looking at a type-id or an
33582 expression. */
33585 matching_parens parens;
33588 /* Note: as a GNU Extension, compound literals are considered
33589 postfix-expressions as they are in C99, so they are valid
33590 arguments to sizeof. See comment in cp_parser_cast_expression
33591 for details. */
33594 else
33595 {
33598 /* Look for the type-id. */
33600 /* Look for the closing `)'. */
33603 }
33605 /* If all went well, then we're done. */
33608 else
33609 {
33610 /* Commit to the tentative_firewall so we get syntax errors. */
33614 }
33615 }
33616 else
33619 /* Go back to evaluating expressions. */
33623 /* And restore the old one. */
33626 parser->integral_constant_expression_p
33628 parser->non_integral_constant_expression_p
33632 }
33634 /* If the current declaration has no declarator, return true. */
33636 static bool
33638 {
33639 /* If the next token is a `;' or a `,' then there is no
33640 declarator. */
33643 }
33645 /* Update the DECL_SPECS to reflect the storage class indicated by
33646 KEYWORD. */
33648 static void
33653 {
33654 cp_storage_class storage_class;
33657 {
33675 }
33678 {
33682 }
33684 {
33691 else
33698 }
33703 {
33706 }
33711 /* A storage class specifier cannot be applied alongside a typedef
33712 specifier. If there is a typedef specifier present then set
33713 conflicting_specifiers_p which will trigger an error later
33714 on in grokdeclarator. */
33717 {
33724 }
33725 }
33727 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
33728 is true, the type is a class or enum definition. */
33730 static void
33732 tree type_spec,
33735 {
33738 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
33739 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
33740 this is what happened. In system headers, we ignore these
33741 declarations so that G++ can work with system headers that are not
33742 C++-safe. */
33744 && !type_definition_p
33757 {
33760 ds_redefined_builtin_type_spec,
33761 token);
33763 {
33767 }
33768 }
33771 else
33772 {
33777 }
33778 }
33780 /* True iff TOKEN is the GNU keyword __thread. */
33782 static bool
33784 {
33787 }
33789 /* Set the location for a declarator specifier and check if it is
33790 duplicated.
33792 DECL_SPECS is the sequence of declarator specifiers onto which to
33793 set the location.
33795 DS is the single declarator specifier to set which location is to
33796 be set onto the existing sequence of declarators.
33798 LOCATION is the location for the declarator specifier to
33799 consider. */
33801 static void
33804 {
33813 {
33817 }
33818 else
33819 {
33821 {
33825 else
33826 {
33829 OPT_Wlong_long,
33831 }
33832 }
33834 {
33838 {
33842 }
33843 else
33844 {
33847 }
33848 }
33849 else
33850 {
33868 "consteval"
33869 };
33873 }
33874 }
33875 }
33877 /* Return true iff the declarator specifier DS is present in the
33878 sequence of declarator specifiers DECL_SPECS. */
33880 bool
33882 cp_decl_spec ds)
33883 {
33890 }
33892 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
33893 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
33895 static bool
33897 {
33899 }
33901 /* Issue an error message indicating that TOKEN_DESC was expected.
33902 If KEYWORD is true, it indicated this function is called by
33903 cp_parser_require_keword and the required token can only be
33904 a indicated keyword.
33906 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33907 within any error as the location of an "opening" token matching
33908 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33909 RT_CLOSE_PAREN). */
33911 static void
33913 required_token token_desc,
33915 location_t matching_location)
33916 {
33922 {
33997 }
34000 {
34002 {
34080 }
34081 }
34085 }
34088 /* If the next token is of the indicated TYPE, consume it. Otherwise,
34089 issue an error message indicating that TOKEN_DESC was expected.
34091 Returns the token consumed, if the token had the appropriate type.
34092 Otherwise, returns NULL.
34094 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
34095 within any error as the location of an "opening" token matching
34096 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
34097 RT_CLOSE_PAREN). */
34102 required_token token_desc,
34103 location_t matching_location)
34104 {
34107 else
34108 {
34109 /* Output the MESSAGE -- unless we're parsing tentatively. */
34112 matching_location);
34114 }
34115 }
34117 /* Skip an entire parameter list from start to finish. The next token must
34118 be the initial "<" of the parameter list. Returns true on success and
34119 false otherwise. */
34121 static bool
34123 {
34124 /* Consume the "<" because cp_parser_skip_to_end_of_template_parameter_list
34125 requires it. */
34128 }
34130 /* Ensure we are at the end of a template parameter list. If we are, return.
34131 If we are not, something has gone wrong, in which case issue an error and
34132 skip to end of the parameter list. */
34134 static void
34136 {
34137 /* Are we ready, yet? If not, issue error message. */
34142 }
34144 /* You should only call this function from inside a template parameter list
34145 (i.e. the current token should at least be the initial "<" of the
34146 parameter list). If you are skipping the entire list, it may be better to
34147 use cp_parser_skip_entire_template_parameter_list.
34149 Tokens are skipped until the final ">" is found, or if we see
34150 '{', '}', ';', or if we find an unbalanced ')' or ']'.
34152 Returns true if we successfully reached the end, and false if
34153 something unexpected happened (e.g. end of file). */
34155 static bool
34157 {
34158 /* Current level of '< ... >'. */
34160 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
34163 /* Skip tokens until the desired token is found. */
34165 {
34166 /* Peek at the next token. */
34168 {
34176 /* C++0x views the `>>' operator as two `>' tokens, but
34177 C++98 does not. */
34180 {
34181 /* We've hit a `>>' where the first `>' closes the
34182 template argument list, and the second `>' is
34183 spurious. Just consume the `>>' and stop; we've
34184 already produced at least one error. */
34187 }
34188 /* Fall through for C++0x, so we handle the second `>' in
34189 the `>>'. */
34194 {
34195 /* We've reached the token we want, consume it and stop. */
34198 }
34217 /* The '>' was probably forgotten, don't look further. */
34222 }
34224 /* Consume this token. */
34226 }
34227 }
34229 /* If the next token is the indicated keyword, consume it. Otherwise,
34230 issue an error message indicating that TOKEN_DESC was expected.
34232 Returns the token consumed, if the token had the appropriate type.
34233 Otherwise, returns NULL. */
34238 required_token token_desc)
34239 {
34243 {
34245 UNKNOWN_LOCATION);
34247 }
34250 }
34252 /* Returns TRUE iff TOKEN is a token that can begin the body of a
34253 function-definition. */
34255 static bool
34257 {
34260 /* A ctor-initializer begins with a `:'. */
34262 /* A function-try-block begins with `try'. */
34264 /* A function-transaction-block begins with `__transaction_atomic'
34265 or `__transaction_relaxed'. */
34268 /* The named return value extension begins with `return'. */
34270 }
34272 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
34273 definition. */
34275 static bool
34277 {
34284 }
34286 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
34287 C++0x) ending a template-argument. */
34289 static bool
34291 {
34299 /* For better diagnostics, treat >>= like that too, that
34300 shouldn't appear non-nested in template arguments. */
34302 }
34304 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
34305 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
34307 static bool
34310 {
34316 /* Check for the sequence `<::' in the original code. It would be lexed as
34317 `[:', where `[' is a digraph, and there is no whitespace before
34318 `:'. */
34320 {
34325 }
34327 }
34329 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
34330 or none_type otherwise. */
34332 static enum tag_types
34334 {
34336 {
34346 }
34347 }
34349 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
34350 or none_type otherwise or if the token is null. */
34352 static enum tag_types
34354 {
34359 {
34367 }
34368 }
34370 /* Diagnose redundant enum-keys. */
34372 static void
34375 {
34381 /* Look up the NAME to see if it unambiguously refers to the TYPE. */
34386 /* The enum-key is redundant for uses of the TYPE that are not
34387 declarations and for which name lookup returns just the type
34388 itself. */
34396 {
34397 /* Avoid issuing the diagnostic for apparently redundant (unscoped)
34398 enum tag in shared C/C++ code in files (such as headers) included
34399 in the main source file. */
34402 LRK_MACRO_DEFINITION_LOCATION,
34406 }
34414 }
34416 /* Describes the set of declarations of a struct, class, or class template
34417 or its specializations. Used for -Wmismatched-tags. */
34419 class class_decl_loc_t
34420 {
34425 {
34427 }
34429 /* Constructs an object for a single declaration of a class with
34430 CLASS_KEY at the current location in the current function (or
34431 at another scope). KEY_REDUNDANT is true if the class-key may
34432 be omitted in the current context without an ambiguity with
34433 another symbol with the same name.
34434 DEF_P is true for a class declaration that is a definition.
34435 CURLOC is the associated location. */
34439 {
34442 key_redundant);
34444 }
34446 /* Copy, assign, and destroy the object. Necessary because LOCVEC
34447 isn't safely copyable and assignable and doesn't release storage
34448 on its own. */
34452 { }
34455 {
34463 }
34466 {
34468 }
34470 /* Issues -Wmismatched-tags for a single class. */
34473 /* Issues -Wmismatched-tags for all classes. */
34476 /* Adds TYPE_DECL to the collection of class decls and diagnoses
34477 redundant tags (if -Wredundant-tags is enabled). */
34480 /* Either adds this decl to the collection of class decls
34481 or diagnoses it, whichever is appropriate. */
34487 {
34489 }
34492 {
34494 }
34497 {
34499 }
34502 {
34504 }
34506 /* True if a definition for the class has been seen. */
34508 {
34510 }
34512 /* The location of a single mention of a class type with the given
34513 class-key. */
34514 struct class_key_loc_t
34515 {
34518 { }
34520 /* The function the type is mentioned in. */
34521 tree func;
34522 /* The exact location. */
34523 location_t loc;
34524 /* The class-key used in the mention of the type. */
34525 tag_types class_key;
34526 /* True when the class-key could be omitted at this location
34527 without an ambiguity with another symbol of the same name. */
34529 };
34530 /* Avoid using auto_vec here since it's not safe to copy due to pr90904. */
34532 /* LOCVEC index of the definition or UINT_MAX if none exists. */
34534 /* The class-key the class was last declared with or none_type when
34535 it has been declared with a mismatched key. */
34536 tag_types def_class_key;
34538 /* A mapping between a TYPE_DECL for a class and the class_decl_loc_t
34539 description above. */
34542 };
34546 /* Issue an error message if the CLASS_KEY does not match the TYPE.
34547 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34548 is set for a declaration of class TYPE and clear for a reference to
34549 it that is not a declaration of it. */
34551 static void
34555 {
34561 {
34565 type))
34569 }
34574 /* Only consider the true class-keys below and ignore typename_type,
34575 etc. that are not C++ class-keys. */
34582 }
34584 /* Returns the template or specialization of one to which the RECORD_TYPE
34585 TYPE corresponds. */
34587 static tree
34589 {
34592 /* Determine the template or its partial specialization to which TYPE
34593 corresponds. */
34602 }
34605 /* Adds the class TYPE to the collection of class decls and diagnoses
34606 redundant tags (if -Wredundant-tags is enabled).
34607 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34608 is set for a (likely, based on syntactic context) declaration of class
34609 TYPE and clear for a reference to it that is not a declaration of it. */
34611 void
34614 {
34617 /* Look up the NAME to see if it unambiguously refers to the TYPE
34618 and set KEY_REDUNDANT if so. */
34623 /* The class-key is redundant for uses of the CLASS_TYPE that are
34624 neither definitions of it nor declarations, and for which name
34625 lookup returns just the type itself. */
34636 {
34637 /* Avoid issuing the diagnostic for apparently redundant struct
34638 and union class-keys in shared C/C++ code in files (such as
34639 headers) included in the main source file. */
34642 LRK_MACRO_DEFINITION_LOCATION,
34646 }
34648 /* Set if a declaration of TYPE has previously been seen or if it must
34649 exist in a precompiled header. */
34653 {
34656 {
34657 /* TYPE_DECL is the first declaration or definition of the type
34658 (outside precompiled headers -- see below). Just create
34659 a new entry for it and return unless it's a declaration
34660 involving a template that may need to be diagnosed by
34661 -Wredundant-tags. */
34665 }
34666 else
34667 {
34668 /* TYPE was previously defined in some unknown precompiled header.
34669 Simply add a record of its definition at an unknown location and
34670 proceed below to add a reference to it at the current location.
34671 (Declarations in precompiled headers that are not definitions
34672 are ignored.) */
34673 tag_types def_key
34678 }
34679 }
34681 /* A prior declaration of TYPE_DECL has been seen. */
34684 {
34691 type);
34692 }
34695 /* Do nothing if this is the first declaration of the type. */
34699 /* Do nothing if the class-key in this declaration matches
34700 the definition. */
34704 def_p);
34705 }
34707 /* Either adds this DECL corresponding to the TYPE_DECL to the collection
34708 of class decls or diagnoses it, whichever is appropriate. */
34710 void
34712 tag_types class_key,
34715 {
34716 /* Reset the CLASS_KEY associated with this type on mismatch.
34717 This is an optimization that lets the diagnostic code skip
34718 over classes that use the same class-key in all declarations. */
34722 /* Set IDXDEF to the index of the vector corresponding to
34723 the definition. */
34727 /* Append a record of this declaration to the vector. */
34729 redundant);
34735 /* As a space optimization diagnose declarations of a class
34736 whose definition has been seen and purge the LOCVEC of
34737 all entries except the definition. */
34740 {
34746 }
34747 else
34748 /* Pop the entry pushed above for this declaration. */
34750 }
34752 /* Issues -Wmismatched-tags for a single class. */
34754 void
34756 {
34760 /* Number of uses of the class. */
34763 /* The class (or template) declaration guiding the decisions about
34764 the diagnostic. For ordinary classes it's the same as THIS. For
34765 uses of instantiations of templates other than their declarations
34766 it points to the record for the declaration of the corresponding
34767 primary template or partial specialization. */
34772 {
34773 /* For implicit instantiations of a primary template look up
34774 the primary or partial specialization and use it as
34775 the expected class-key rather than using the class-key of
34776 the first reference to the instantiation. The primary must
34777 be (and inevitably is) at index zero. */
34780 /* It's possible that we didn't find SPEC. Consider:
34782 template<typename T> struct A {
34783 template<typename U> struct W { };
34784 };
34785 struct A<int>::W<int> w; // #1
34787 where while parsing A and #1 we've stashed
34788 A<T>
34789 A<T>::W<U>
34790 A<int>::W<int>
34791 into CLASS2LOC. If TYPE is A<int>::W<int>, specialization_of
34792 will yield A<int>::W<U> which may be in CLASS2LOC if we had
34793 an A<int> class specialization, but otherwise won't be in it.
34794 So try to look up A<T>::W<U>. */
34796 {
34799 }
34800 /* Now we really should have found something. */
34802 }
34803 /* Skip declarations that consistently use the same class-key. */
34807 /* Set if a definition for the class has been seen. */
34810 /* The index of the declaration whose class-key this declaration
34811 is expected to match. It's either the class-key of the class
34812 definition if one exists or the first declaration otherwise. */
34815 /* The class-key the class is expected to be declared with: it's
34816 either the key used in its definition or the first declaration
34817 if no definition has been provided.
34818 For implicit instantiations of a primary template it's
34819 the class-key used to declare the primary with. The primary
34820 must be at index zero. */
34824 /* Advance IDX to the first declaration that either is not
34825 a definition or that doesn't match the first declaration
34826 if no definition is provided. */
34831 /* Save the current function before changing it below. */
34833 /* Set the function declaration to print in diagnostic context. */
34841 auto_diagnostic_group d;
34842 /* Issue a warning for the first mismatched declaration.
34843 Avoid using "%#qT" since the class-key for the same type will
34844 be the same regardless of which one was used in the declaraion. */
34848 {
34849 /* Suggest how to avoid the warning for each instance since
34850 the guidance may be different depending on context. */
34852 (key_redundant_p
34855 xpectkstr);
34857 /* Also point to the first declaration or definition that guided
34858 the decision to issue the warning above. */
34860 (def_p
34864 }
34866 /* Issue warnings for the remaining inconsistent declarations. */
34868 {
34870 /* Skip over the declarations that match either the definition
34871 if one was provided or the first declaration. */
34877 /* Set the function declaration to print in diagnostic context. */
34882 /* Suggest how to avoid the warning for each instance since
34883 the guidance may be different depending on context. */
34885 (key_redundant_p
34888 xpectkstr);
34889 }
34891 /* Restore the current function in case it was replaced above. */
34893 }
34895 /* Issues -Wmismatched-tags for all classes. Called at the end
34896 of processing a translation unit, after declarations of all class
34897 types and their uses have been recorded. */
34899 void
34901 {
34902 /* CLASS2LOC should be empty if both -Wmismatched-tags and
34903 -Wredundant-tags are disabled. */
34905 || warn_redundant_tags
34908 /* Save the current function before changing on return. It should
34909 be null at this point. */
34913 {
34914 /* Iterate over the collected class/struct/template declarations. */
34917 {
34921 }
34922 }
34925 }
34927 /* Issue an error message if DECL is redeclared with different
34928 access than its original declaration [class.access.spec/3].
34929 This applies to nested classes, nested class templates and
34930 enumerations [class.mem/1]. */
34932 static void
34934 {
34945 }
34947 /* Look for the `template' keyword, as a syntactic disambiguator.
34948 Return TRUE iff it is present, in which case it will be
34949 consumed. */
34951 static bool
34953 {
34955 {
34956 /* In C++98 the `template' keyword can only be used within templates;
34957 outside templates the parser can always figure out what is a
34958 template and what is not. In C++11, per the resolution of DR 468,
34959 `template' is allowed in cases where it is not strictly necessary. */
34962 {
34965 "in C++98 %<template%> (as a disambiguator) is only "
34967 /* If this part of the token stream is rescanned, the same
34968 error message would be generated. So, we purge the token
34969 from the stream. */
34972 }
34973 else
34974 {
34975 /* Consume the `template' keyword. */
34978 }
34979 }
34981 }
34983 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
34984 set PARSER->SCOPE, and perform other related actions. */
34986 static void
34988 {
34991 /* Get the stored value. */
34993 /* Set the scope from the stored value. */
34998 }
35000 /* Consume tokens up through a non-nested END token. Returns TRUE if we
35001 encounter the end of a block before what we were looking for. */
35003 static bool
35007 {
35009 {
35012 /* Abort a parenthesized expression if we encounter a semicolon. */
35016 /* If we've reached the end of the file, stop. */
35022 /* We've hit the end of an enclosing block, so there's been some
35023 kind of syntax error. */
35026 /* Consume the token. */
35028 /* See if it starts a new group. */
35030 {
35032 /* In theory this should probably check end == '}', but
35033 cp_parser_save_member_function_body needs it to exit
35034 after either '}' or ')' when called with ')'. */
35037 }
35039 {
35043 }
35048 }
35049 }
35051 /* Like above, for caching a default argument or NSDMI. Both of these are
35052 terminated by a non-nested comma, but it can be unclear whether or not a
35053 comma is nested in a template argument list unless we do more parsing.
35054 In order to handle this ambiguity, when we encounter a ',' after a '<'
35055 we try to parse what follows as a parameter-declaration-list (in the
35056 case of a default argument) or a member-declarator (in the case of an
35057 NSDMI). If that succeeds, then we stop caching. */
35059 static tree
35061 {
35066 tree default_argument;
35068 /* Add tokens until we have processed the entire default
35069 argument. We add the range [first_token, token). */
35072 {
35073 /* For list-initialization, this is straightforward. */
35076 }
35078 {
35081 /* Peek at the next token. */
35083 /* What we do depends on what token we have. */
35085 {
35086 /* In valid code, a default argument must be
35087 immediately followed by a `,' `)', or `...'. */
35090 {
35091 /* If we've seen a '<', we might be in a
35092 template-argument-list. Until Core issue 325 is
35093 resolved, we don't know how this situation ought
35094 to be handled, so try to DTRT. We check whether
35095 what comes after the comma is a valid parameter
35096 declaration list. If it is, then the comma ends
35097 the default argument; otherwise the default
35098 argument continues. */
35102 /* Set ITALP so cp_parser_parameter_declaration_list
35103 doesn't decide to commit to this parse. */
35110 {
35111 /* Parse declarators until we reach a non-comma or
35112 somthing that cannot be an initializer.
35113 Just checking whether we're looking at a single
35114 declarator is insufficient. Consider:
35115 int var = tuple<T,U>::x;
35116 The template parameter 'U' looks exactly like a
35117 declarator. */
35118 do
35119 {
35123 CP_PARSER_FLAGS_NONE,
35132 }
35134 /* If we met an '=' or ';' then the original comma
35135 was the end of the NSDMI. Otherwise assume
35136 we're still in the NSDMI. */
35139 }
35140 else
35141 {
35144 tree t = cp_parser_parameter_declaration_list
35150 }
35157 }
35158 /* FALLTHRU */
35161 /* If we run into a non-nested `;', `}', or `]',
35162 then the code is invalid -- but the default
35163 argument is certainly over. */
35168 /* Handle correctly int n = sizeof ... ( p ); */
35171 /* Update DEPTH, if necessary. */
35186 /* This might be the comparison operator, or it might
35187 start a template argument list. */
35194 /* Fall through for C++0x, which treats the `>>'
35195 operator like two `>' tokens in certain
35196 cases. */
35201 {
35202 /* This might be an operator, or it might close a
35203 template argument list. But if a previous '<'
35204 started a template argument list, this will have
35205 closed it, so we can't be in one anymore. */
35209 }
35212 /* If we run out of tokens, issue an error message. */
35220 /* In these cases, we should look for template-ids.
35221 For example, if the default argument is
35222 `X<int, double>()', we need to do name lookup to
35223 figure out whether or not `X' is a template; if
35224 so, the `,' does not end the default argument.
35226 That is not yet done. */
35231 }
35233 /* If we've reached the end, stop. */
35237 /* Add the token to the token block. */
35239 }
35241 /* Create a DEFERRED_PARSE to represent the unparsed default
35242 argument. */
35249 }
35251 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
35253 location_t
35255 {
35260 }
35262 /* Begin parsing tentatively. We always save tokens while parsing
35263 tentatively so that if the tentative parsing fails we can restore the
35264 tokens. */
35266 static void
35268 {
35269 /* Enter a new parsing context. */
35271 /* Begin saving tokens. */
35273 /* In order to avoid repetitive access control error messages,
35274 access checks are queued up until we are no longer parsing
35275 tentatively. */
35277 }
35279 /* Commit to the currently active tentative parse. */
35281 static void
35283 {
35287 /* Mark all of the levels as committed. */
35290 {
35297 }
35298 }
35300 /* Commit to the topmost currently active tentative parse.
35302 Note that this function shouldn't be called when there are
35303 irreversible side-effects while in a tentative state. For
35304 example, we shouldn't create a permanent entry in the symbol
35305 table, or issue an error message that might not apply if the
35306 tentative parse is aborted. */
35308 static void
35310 {
35315 {
35323 }
35324 }
35326 /* Abort the currently active tentative parse. All consumed tokens
35327 will be rolled back, and no diagnostics will be issued. */
35329 static void
35331 {
35335 /* Now, pretend that we want to see if the construct was
35336 successfully parsed. */
35338 }
35340 /* Stop parsing tentatively. If a parse error has occurred, restore the
35341 token stream. Otherwise, commit to the tokens we have consumed.
35342 Returns true if no error occurred; false otherwise. */
35344 static bool
35346 {
35350 /* Remember whether or not an error occurred, since we are about to
35351 destroy that information. */
35353 /* Remove the topmost context from the stack. */
35356 /* If no parse errors occurred, commit to the tentative parse. */
35358 {
35359 /* Commit to the tokens read tentatively, unless that was
35360 already done. */
35365 }
35366 /* Otherwise, if errors occurred, roll back our state so that things
35367 are just as they were before we began the tentative parse. */
35368 else
35369 {
35372 }
35373 /* Add the context to the front of the free list. */
35378 }
35380 /* Returns true if we are parsing tentatively and are not committed to
35381 this tentative parse. */
35383 static bool
35385 {
35388 }
35390 /* Returns nonzero iff an error has occurred during the most recent
35391 tentative parse. */
35393 static bool
35395 {
35398 }
35400 /* Returns nonzero if GNU extensions are allowed. */
35402 static bool
35404 {
35406 }
35407 \f
35408 /* Objective-C++ Productions */
35411 /* Parse an Objective-C expression, which feeds into a primary-expression
35412 above.
35414 objc-expression:
35415 objc-message-expression
35416 objc-string-literal
35417 objc-encode-expression
35418 objc-protocol-expression
35419 objc-selector-expression
35421 Returns a tree representation of the expression. */
35423 static cp_expr
35425 {
35426 /* Try to figure out what kind of declaration is present. */
35430 {
35440 {
35452 }
35453 /* FALLTHRU */
35459 }
35462 }
35464 /* Parse an Objective-C message expression.
35466 objc-message-expression:
35467 [ objc-message-receiver objc-message-args ]
35469 Returns a representation of an Objective-C message. */
35471 static tree
35473 {
35486 /* Construct a location e.g.
35487 [self func1:5]
35488 ^~~~~~~~~~~~~~
35489 ranging from the '[' to the ']', with the caret at the start. */
35495 }
35497 /* Parse an objc-message-receiver.
35499 objc-message-receiver:
35500 expression
35501 simple-type-specifier
35503 Returns a representation of the type or expression. */
35505 static tree
35507 {
35508 tree rcv;
35510 /* An Objective-C message receiver may be either (1) a type
35511 or (2) an expression. */
35515 /* If that worked out, fine. */
35522 CP_PARSER_FLAGS_NONE);
35529 }
35531 /* Parse the arguments and selectors comprising an Objective-C message.
35533 objc-message-args:
35534 objc-selector
35535 objc-selector-args
35536 objc-selector-args , objc-comma-args
35538 objc-selector-args:
35539 objc-selector [opt] : assignment-expression
35540 objc-selector-args objc-selector [opt] : assignment-expression
35542 objc-comma-args:
35543 assignment-expression
35544 objc-comma-args , assignment-expression
35546 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
35547 selector arguments and TREE_VALUE containing a list of comma
35548 arguments. */
35550 static tree
35552 {
35558 {
35564 /* Detect if we have a unary selector. */
35573 sel_args
35578 }
35580 /* Handle non-selector arguments, if any. */
35582 {
35583 tree arg;
35588 addl_args
35593 }
35596 {
35599 }
35602 }
35604 /* Parse an Objective-C encode expression.
35606 objc-encode-expression:
35607 @encode objc-typename
35609 Returns an encoded representation of the type argument. */
35611 static cp_expr
35613 {
35614 tree type;
35619 matching_parens parens;
35626 {
35630 }
35632 /* This happens if we find @encode(T) (where T is a template
35633 typename or something dependent on a template typename) when
35634 parsing a template. In that case, we can't compile it
35635 immediately, but we rather create an AT_ENCODE_EXPR which will
35636 need to be instantiated when the template is used.
35637 */
35639 {
35643 }
35646 /* Build a location of the form:
35647 @encode(int)
35648 ^~~~~~~~~~~~
35649 with caret==start at the @ token, finishing at the close paren. */
35653 }
35655 /* Parse an Objective-C @defs expression. */
35657 static tree
35659 {
35660 tree name;
35663 matching_parens parens;
35669 }
35671 /* Parse an Objective-C protocol expression.
35673 objc-protocol-expression:
35674 @protocol ( identifier )
35676 Returns a representation of the protocol expression. */
35678 static tree
35680 {
35681 tree proto;
35685 matching_parens parens;
35690 /* Build a location of the form:
35691 @protocol(prot)
35692 ^~~~~~~~~~~~~~~
35693 with caret==start at the @ token, finishing at the close paren. */
35698 }
35700 /* Parse an Objective-C selector expression.
35702 objc-selector-expression:
35703 @selector ( objc-method-signature )
35705 objc-method-signature:
35706 objc-selector
35707 objc-selector-seq
35709 objc-selector-seq:
35710 objc-selector :
35711 objc-selector-seq objc-selector :
35713 Returns a representation of the method selector. */
35715 static tree
35717 {
35724 matching_parens parens;
35730 {
35739 {
35740 /* Detect if we have a unary selector. */
35742 {
35745 }
35746 else
35747 {
35749 }
35750 }
35755 {
35756 sel_seq
35759 sel_seq
35762 }
35763 else
35764 sel_seq
35769 }
35771 finish_selector:
35775 /* Build a location of the form:
35776 @selector(func)
35777 ^~~~~~~~~~~~~~~
35778 with caret==start at the @ token, finishing at the close paren. */
35781 /* TODO: objc_build_selector_expr doesn't always honor the location. */
35784 }
35786 /* Parse a list of identifiers.
35788 objc-identifier-list:
35789 identifier
35790 objc-identifier-list , identifier
35792 Returns a TREE_LIST of identifier nodes. */
35794 static tree
35796 {
35797 tree identifier;
35798 tree list;
35809 {
35816 identifier));
35818 }
35821 }
35823 /* Parse an Objective-C alias declaration.
35825 objc-alias-declaration:
35826 @compatibility_alias identifier identifier ;
35828 This function registers the alias mapping with the Objective-C front end.
35829 It returns nothing. */
35831 static void
35833 {
35841 }
35843 /* Parse an Objective-C class forward-declaration.
35845 objc-class-declaration:
35846 @class objc-identifier-list ;
35848 The function registers the forward declarations with the Objective-C
35849 front end. It returns nothing. */
35851 static void
35853 {
35856 {
35857 tree id;
35867 else
35869 }
35871 }
35873 /* Parse a list of Objective-C protocol references.
35875 objc-protocol-refs-opt:
35876 objc-protocol-refs [opt]
35878 objc-protocol-refs:
35879 < objc-identifier-list >
35881 Returns a TREE_LIST of identifiers, if any. */
35883 static tree
35885 {
35889 {
35893 }
35896 }
35898 /* Parse a Objective-C visibility specification. */
35900 static void
35902 {
35906 {
35921 }
35923 /* Eat '@private'/'@protected'/'@public'. */
35925 }
35927 /* Parse an Objective-C method type. Return 'true' if it is a class
35928 (+) method, and 'false' if it is an instance (-) method. */
35932 {
35935 else
35937 }
35939 /* Parse an Objective-C protocol qualifier. */
35941 static tree
35943 {
35956 {
35961 }
35964 }
35966 /* Parse an Objective-C typename. */
35968 static tree
35970 {
35974 {
35977 matching_parens parens;
35981 /* An ObjC type name may consist of just protocol qualifiers, in which
35982 case the type shall default to 'id'. */
35984 {
35987 /* If the type could not be parsed, an error has already
35988 been produced. For error recovery, behave as if it had
35989 not been specified, which will use the default type
35990 'id'. */
35992 {
35994 /* We need to skip to the closing parenthesis as
35995 cp_parser_type_id() does not seem to do it for
35996 us. */
36001 }
36002 }
36006 }
36009 }
36011 /* Check to see if TYPE refers to an Objective-C selector name. */
36013 static bool
36015 {
36021 }
36023 /* Parse an Objective-C selector. */
36025 static tree
36027 {
36031 {
36034 }
36036 /* C++ operator names are allowed to appear in ObjC selectors. */
36038 {
36051 }
36052 }
36054 /* Parse an Objective-C params list. */
36056 static tree
36058 {
36064 {
36074 /* Detect if we have a unary selector. */
36077 {
36080 }
36084 {
36085 /* Something went quite wrong. There should be a colon
36086 here, but there is not. Stop parsing parameters. */
36088 }
36090 /* New ObjC allows attributes on parameters too. */
36095 params
36098 type_name,
36099 identifier,
36100 parm_attr));
36103 }
36106 {
36109 }
36111 /* We allow tail attributes for the method. */
36113 {
36121 }
36124 {
36127 }
36129 }
36131 /* Parse the non-keyword Objective-C params. */
36133 static tree
36136 {
36142 {
36144 tree parm;
36150 {
36155 }
36157 /* TODO: parse attributes for tail parameters. */
36167 }
36169 /* We allow tail attributes for the method. */
36171 {
36173 {
36178 }
36179 else
36180 /* We have an error, but parse the attributes, so that we can
36181 carry on. */
36187 }
36190 }
36192 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
36194 static void
36196 {
36199 /* If the next token is `extern' and the following token is a string
36200 literal, then we have a linkage specification. */
36202 && cp_parser_is_pure_string_literal
36205 /* Handle #pragma, if any. */
36208 /* Allow stray semicolons. */
36211 /* Mark methods as optional or required, when building protocols. */
36213 {
36216 }
36218 {
36221 }
36224 /* Other stray characters must generate errors. */
36226 {
36230 }
36231 /* Finally, try to parse a block-declaration, or a function-definition. */
36232 else
36234 }
36236 /* Parse a method signature. */
36238 static tree
36240 {
36256 }
36258 static bool
36260 {
36261 tree tattr;
36266 /* If the attributes are followed by a method introducer, this is not allowed.
36267 Dump the attributes and flag the situation. */
36272 /* Otherwise, the attributes introduce some interstitial code, possibly so
36273 rewind to allow that check. */
36276 }
36278 /* Parse an Objective-C method prototype list. */
36280 static void
36282 {
36286 {
36288 {
36293 else
36297 {
36301 }
36304 }
36310 OPT_Wattributes,
36312 else
36313 /* Allow for interspersed non-ObjC++ code. */
36317 }
36321 else
36325 }
36327 /* Parse an Objective-C method definition list. */
36329 static void
36331 {
36333 {
36337 {
36340 }
36342 {
36345 }
36347 {
36351 tree attribute;
36355 else
36356 {
36360 /* For historical reasons, we accept an optional semicolon. */
36366 tree meth
36370 }
36371 }
36372 /* The following case will be removed once @synthesize is
36373 completely implemented. */
36384 else
36385 /* Allow for interspersed non-ObjC++ code. */
36387 }
36390 }
36392 /* Parse Objective-C ivars. */
36394 static void
36396 {
36407 {
36408 cp_decl_specifier_seq declspecs;
36410 tree prefix_attributes;
36418 CP_PARSER_FLAGS_OPTIONAL,
36422 /* auto, register, static, extern, mutable. */
36424 {
36427 }
36429 /* thread_local. */
36431 {
36434 }
36436 /* typedef. */
36438 {
36441 }
36446 /* Keep going until we hit the `;' at the end of the
36447 declaration. */
36449 {
36454 /* Check for a (possibly unnamed) bitfield declaration. */
36462 {
36463 /* Get the name of the bitfield. */
36468 eat_colon:
36470 /* Get the width of the bitfield. */
36471 width
36473 }
36474 else
36475 {
36476 /* Parse the declarator. */
36477 declarator
36479 CP_PARSER_FLAGS_NONE,
36485 }
36487 /* Look for attributes that apply to the ivar. */
36489 /* Remember which attributes are prefix attributes and
36490 which are not. */
36492 /* Combine the attributes. */
36496 /* Create the bitfield declaration. */
36499 else
36504 /* Add the instance variable. */
36508 /* Reset PREFIX_ATTRIBUTES. */
36510 {
36515 }
36520 {
36523 }
36525 }
36529 }
36534 /* Do not consume the RID_AT_END, so it will be read again as terminating
36535 the @interface of @implementation. */
36539 /* For historical reasons, we accept an optional semicolon. */
36542 }
36544 /* Parse an Objective-C protocol declaration. */
36546 static void
36548 {
36554 {
36559 }
36561 /* See if we have a forward declaration or a definition. */
36564 /* Try a forward declaration first. */
36566 {
36568 {
36569 tree id;
36579 else
36581 }
36583 }
36585 /* Ok, we got a full-fledged definition (or at least should). */
36586 else
36587 {
36592 }
36593 }
36595 /* Parse an Objective-C superclass or category. */
36597 static void
36602 {
36608 {
36611 }
36613 {
36614 matching_parens parens;
36617 /* If there is no category name, and this is an @interface, we
36618 have a class extension. */
36620 {
36623 }
36624 else
36628 }
36629 }
36631 /* Parse an Objective-C class interface. */
36633 static void
36635 {
36643 {
36644 /* It's hard to recover because even if valid @interface stuff
36645 is to follow, we can't compile it (or validate it) if we
36646 don't even know which class it refers to. Let's assume this
36647 was a stray '@interface' token in the stream and skip it.
36648 */
36650 }
36655 /* We have either a class or a category on our hands. */
36658 else
36659 {
36661 /* Handle instance variable declarations, if any. */
36664 }
36667 }
36669 /* Parse an Objective-C class implementation. */
36671 static void
36673 {
36680 {
36681 /* It's hard to recover because even if valid @implementation
36682 stuff is to follow, we can't compile it (or validate it) if
36683 we don't even know which class it refers to. Let's assume
36684 this was a stray '@implementation' token in the stream and
36685 skip it.
36686 */
36688 }
36692 /* We have either a class or a category on our hands. */
36695 else
36696 {
36698 /* Handle instance variable declarations, if any. */
36701 }
36704 }
36706 /* Consume the @end token and finish off the implementation. */
36708 static void
36710 {
36713 }
36715 /* Parse an Objective-C declaration. */
36717 static void
36719 {
36720 /* Try to figure out what kind of declaration is present. */
36725 {
36741 }
36744 {
36767 }
36768 }
36770 /* Parse an Objective-C try-catch-finally statement.
36772 objc-try-catch-finally-stmt:
36773 @try compound-statement objc-catch-clause-seq [opt]
36774 objc-finally-clause [opt]
36776 objc-catch-clause-seq:
36777 objc-catch-clause objc-catch-clause-seq [opt]
36779 objc-catch-clause:
36780 @catch ( objc-exception-declaration ) compound-statement
36782 objc-finally-clause:
36783 @finally compound-statement
36785 objc-exception-declaration:
36786 parameter-declaration
36787 '...'
36789 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
36791 Returns NULL_TREE.
36793 PS: This function is identical to c_parser_objc_try_catch_finally_statement
36794 for C. Keep them in sync. */
36796 static tree
36798 {
36799 location_t location;
36800 tree stmt;
36805 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
36806 node, lest it get absorbed into the surrounding block. */
36812 {
36816 matching_parens parens;
36822 {
36823 /* We have "@catch (...)" (where the '...' are literally
36824 what is in the code). Skip the '...'.
36825 parameter_declaration is set to NULL_TREE, and
36826 objc_being_catch_clauses() knows that that means
36827 '...'. */
36830 }
36831 else
36832 {
36833 /* We have "@catch (NSException *exception)" or something
36834 like that. Parse the parameter declaration. */
36839 else
36844 }
36847 else
36848 {
36849 /* If there was no open parenthesis, we are recovering from
36850 an error, and we are trying to figure out what mistake
36851 the user has made. */
36853 /* If there is an immediate closing parenthesis, the user
36854 probably forgot the opening one (ie, they typed "@catch
36855 NSException *e)". Parse the closing parenthesis and keep
36856 going. */
36860 /* If these is no immediate closing parenthesis, the user
36861 probably doesn't know that parenthesis are required at
36862 all (ie, they typed "@catch NSException *e"). So, just
36863 forget about the closing parenthesis and keep going. */
36864 }
36868 }
36870 {
36873 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
36874 node, lest it get absorbed into the surrounding block. */
36878 }
36881 }
36883 /* Parse an Objective-C synchronized statement.
36885 objc-synchronized-stmt:
36886 @synchronized ( expression ) compound-statement
36888 Returns NULL_TREE. */
36890 static tree
36892 {
36893 location_t location;
36900 matching_parens parens;
36905 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
36906 node, lest it get absorbed into the surrounding block. */
36911 }
36913 /* Parse an Objective-C throw statement.
36915 objc-throw-stmt:
36916 @throw assignment-expression [opt] ;
36918 Returns a constructed '@throw' statement. */
36920 static tree
36922 {
36934 }
36936 /* Parse an Objective-C statement. */
36938 static tree
36940 {
36941 /* Try to figure out what kind of declaration is present. */
36945 {
36956 }
36959 }
36961 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
36962 look ahead to see if an objc keyword follows the attributes. This
36963 is to detect the use of prefix attributes on ObjC @interface and
36964 @protocol. */
36966 static bool
36968 {
36973 {
36977 else
36980 }
36983 }
36985 /* This routine is a minimal replacement for
36986 c_parser_struct_declaration () used when parsing the list of
36987 types/names or ObjC++ properties. For example, when parsing the
36988 code
36990 @property (readonly) int a, b, c;
36992 this function is responsible for parsing "int a, int b, int c" and
36993 returning the declarations as CHAIN of DECLs.
36995 TODO: Share this code with cp_parser_objc_class_ivars. It's very
36996 similar parsing. */
36997 static tree
36999 {
37001 cp_decl_specifier_seq declspecs;
37003 tree prefix_attributes;
37006 CP_PARSER_FLAGS_NONE,
37013 /* auto, register, static, extern, mutable. */
37015 {
37018 }
37020 /* thread_local. */
37022 {
37025 }
37027 /* typedef. */
37029 {
37032 }
37037 /* Keep going until we hit the `;' at the end of the declaration. */
37039 {
37044 /* Parse the declarator. */
37046 CP_PARSER_FLAGS_NONE,
37049 /* Look for attributes that apply to the ivar. */
37051 /* Remember which attributes are prefix attributes and
37052 which are not. */
37054 /* Combine the attributes. */
37064 /* Reset PREFIX_ATTRIBUTES. */
37066 {
37071 }
37078 {
37081 }
37082 else
37084 }
37086 }
37088 /* Parse an Objective-C @property declaration. The syntax is:
37090 objc-property-declaration:
37091 '@property' objc-property-attributes[opt] struct-declaration ;
37093 objc-property-attributes:
37094 '(' objc-property-attribute-list ')'
37096 objc-property-attribute-list:
37097 objc-property-attribute
37098 objc-property-attribute-list, objc-property-attribute
37100 objc-property-attribute
37101 'getter' = identifier
37102 'setter' = identifier
37103 'readonly'
37104 'readwrite'
37105 'assign'
37106 'retain'
37107 'copy'
37108 'nonatomic'
37110 For example:
37111 @property NSString *name;
37112 @property (readonly) id object;
37113 @property (retain, nonatomic, getter=getTheName) id name;
37114 @property int a, b, c;
37116 PS: This function is identical to
37117 c_parser_objc_at_property_declaration for C. Keep them in sync. */
37118 static void
37120 {
37121 /* Parse the optional attribute list.
37123 A list of parsed, but not verified, attributes. */
37129 /* Parse the optional attribute list... */
37131 {
37132 /* Eat the '('. */
37133 matching_parens parens;
37138 /* Allow empty @property attribute lists, but with a warning. */
37140 location_t attr_comb;
37142 {
37146 }
37147 else
37149 {
37156 {
37163 }
37174 /* Account for accepting the 'class' keyword in this context. */
37176 else
37180 enum objc_property_attribute_kind prop_kind
37182 property_attribute_info *prop
37186 tree meth_name;
37188 {
37193 attr_name);
37194 else
37202 {
37205 attr_name);
37208 }
37216 {
37219 attr_name);
37222 }
37224 /* Get the end of the method name, and consume the name. */
37227 /* Because method names may contain C++ keywords, we have a
37228 routine to fetch them (this also consumes the token). */
37232 {
37234 {
37236 attr_end);
37240 }
37241 else
37242 {
37246 }
37248 attr_end);
37249 }
37250 else
37252 attr_end);
37254 /* Updated location including all that was successfully
37255 parsed. */
37258 }
37260 /* If we see a comma here, then keep going - even if we already
37261 saw a syntax error. For simple mistakes e.g. (asign, getter=x)
37262 this makes a more useful output and avoid spurious warnings
37263 about missing attributes that are, in fact, specified after the
37264 one with the syntax error. */
37267 else
37269 }
37275 }
37277 /* 'properties' is the list of properties that we read. Usually a
37278 single one, but maybe more (eg, in "@property int a, b, c;" there
37279 are three).
37280 TODO: Update this parsing so that it accepts (erroneous) bitfields so
37281 that we can issue a meaningful and consistent (between C/C++) error
37282 message from objc_add_property_declaration (). */
37289 else
37290 {
37291 /* Comma-separated properties are chained together in reverse order;
37292 add them one by one. */
37296 prop_attr_list);
37297 }
37300 }
37302 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
37304 objc-synthesize-declaration:
37305 @synthesize objc-synthesize-identifier-list ;
37307 objc-synthesize-identifier-list:
37308 objc-synthesize-identifier
37309 objc-synthesize-identifier-list, objc-synthesize-identifier
37311 objc-synthesize-identifier
37312 identifier
37313 identifier = identifier
37315 For example:
37316 @synthesize MyProperty;
37317 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
37319 PS: This function is identical to c_parser_objc_at_synthesize_declaration
37320 for C. Keep them in sync.
37321 */
37322 static void
37324 {
37326 location_t loc;
37331 {
37335 {
37338 }
37340 {
37344 {
37347 }
37348 }
37349 else
37354 else
37356 }
37359 }
37361 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
37363 objc-dynamic-declaration:
37364 @dynamic identifier-list ;
37366 For example:
37367 @dynamic MyProperty;
37368 @dynamic MyProperty, AnotherProperty;
37370 PS: This function is identical to c_parser_objc_at_dynamic_declaration
37371 for C. Keep them in sync.
37372 */
37373 static void
37375 {
37377 location_t loc;
37382 {
37383 tree property;
37386 {
37389 }
37393 else
37395 }
37398 }
37400 \f
37401 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
37403 /* Returns name of the next clause.
37404 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
37405 the token is not consumed. Otherwise appropriate pragma_omp_clause is
37406 returned and the token is consumed. */
37408 static pragma_omp_clause
37410 {
37426 {
37431 {
37650 }
37651 }
37657 }
37659 /* Validate that a clause of the given type does not already exist. */
37661 static void
37664 {
37667 }
37669 /* OpenMP 2.5:
37670 variable-list:
37671 identifier
37672 variable-list , identifier
37674 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
37675 colon). An opening parenthesis will have been consumed by the caller.
37677 If KIND is nonzero, create the appropriate node and install the decl
37678 in OMP_CLAUSE_DECL and add the node to the head of the list.
37680 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
37681 return the list created.
37683 COLON can be NULL if only closing parenthesis should end the list,
37684 or pointer to bool which will receive false if the list is terminated
37685 by closing parenthesis or true if the list is terminated by colon.
37687 The optional ALLOW_DEREF argument is true if list items can use the deref
37688 (->) operator. */
37690 struct omp_dim
37691 {
37693 location_t loc;
37697 };
37699 static tree
37703 {
37709 {
37712 }
37714 {
37722 {
37728 }
37732 {
37733 cp_id_kind idk;
37736 }
37741 CPP_CLOSE_PAREN)))
37742 {
37745 }
37746 else
37747 {
37754 {
37759 }
37763 else
37766 {
37772 }
37773 }
37777 ;
37779 {
37781 {
37783 /* The OpenACC cache directive explicitly only allows "array
37784 elements or subarrays". */
37786 {
37790 }
37791 /* FALLTHROUGH. */
37795 start_component_ref:
37797 || (allow_deref
37799 {
37800 cpp_ttype ttype
37803 location_t loc
37808 decl = (cp_parser_postfix_dot_deref_expression
37811 }
37812 /* FALLTHROUGH. */
37822 {
37830 {
37833 /* Later handling is not prepared to see through these. */
37835 }
37837 parser->colon_corrects_to_scope_p
37840 {
37843 }
37844 else
37845 {
37846 /* Look for `:'. */
37848 {
37853 }
37856 else
37859 CPP_CLOSE_SQUARE))
37860 {
37862 /* Later handling is not prepared to see through these. */
37864 }
37865 }
37866 /* Look for the closing `]'. */
37868 RT_CLOSE_SQUARE))
37869 {
37874 }
37877 }
37882 && !array_section_p
37884 || (allow_deref
37886 CPP_DEREF))))
37887 {
37889 {
37893 }
37895 }
37896 else
37903 }
37906 {
37910 {
37911 depend_lvalue:
37915 }
37916 else
37918 }
37924 }
37925 else
37928 get_comma:
37932 }
37938 {
37942 }
37945 {
37948 /* Try to resync to an unnested comma. Copied from
37949 cp_parser_parenthesized_expression_list. */
37950 skip_comma:
37959 }
37962 }
37964 /* Similarly, but expect leading and trailing parenthesis. This is a very
37965 common case for omp clauses. */
37967 static tree
37970 {
37972 {
37974 {
37980 }
37981 else
37983 list);
37984 }
37988 allow_deref);
37990 }
37992 /* OpenACC 2.0:
37993 copy ( variable-list )
37994 copyin ( variable-list )
37995 copyout ( variable-list )
37996 create ( variable-list )
37997 delete ( variable-list )
37998 present ( variable-list )
38000 OpenACC 2.6:
38001 no_create ( variable-list )
38002 attach ( variable-list )
38003 detach ( variable-list ) */
38005 static tree
38007 tree list)
38008 {
38011 {
38053 }
38061 }
38063 /* OpenACC 2.0:
38064 deviceptr ( variable-list ) */
38066 static tree
38068 {
38072 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
38073 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
38074 variable-list must only allow for pointer variables. */
38077 {
38084 }
38087 }
38089 /* OpenACC 2.5:
38090 auto
38091 finalize
38092 independent
38093 nohost
38094 seq */
38096 static tree
38098 tree list)
38099 {
38106 }
38108 /* OpenACC:
38109 num_gangs ( expression )
38110 num_workers ( expression )
38111 vector_length ( expression ) */
38113 static tree
38116 {
38119 matching_parens parens;
38127 {
38132 }
38140 }
38142 /* OpenACC:
38144 gang [( gang-arg-list )]
38145 worker [( [num:] int-expr )]
38146 vector [( [length:] int-expr )]
38148 where gang-arg is one of:
38150 [num:] int-expr
38151 static: size-expr
38153 and size-expr may be:
38155 *
38156 int-expr
38157 */
38159 static tree
38161 omp_clause_code kind,
38163 {
38172 {
38173 matching_parens parens;
38176 do
38177 {
38181 /* Gang static argument. */
38184 {
38192 {
38195 }
38197 /* Check for the '*' argument. */
38201 CPP_CLOSE_PAREN)))
38202 {
38207 {
38210 }
38212 }
38213 }
38214 /* Worker num: argument and vector length: arguments. */
38218 {
38221 }
38223 /* Now collect the actual argument. */
38225 {
38228 }
38240 {
38243 }
38245 }
38250 }
38264 cleanup_error:
38267 }
38269 /* OpenACC 2.0:
38270 tile ( size-expr-list ) */
38272 static tree
38274 {
38278 /* Collapse and tile are mutually exclusive. (The spec doesn't say
38279 so, but the spec authors never considered such a case and have
38280 differing opinions on what it might mean, including 'not
38281 allowed'.) */
38284 clause_loc);
38289 do
38290 {
38297 {
38300 }
38301 else
38305 }
38308 /* Consume the trailing ')'. */
38316 }
38318 /* OpenACC 2.0
38319 Parse wait clause or directive parameters. */
38321 static tree
38323 {
38333 {
38335 {
38338 }
38340 }
38347 {
38351 {
38354 else
38355 {
38362 }
38363 }
38364 }
38367 }
38369 /* OpenACC:
38370 wait [( int-expr-list )] */
38372 static tree
38374 {
38379 else
38380 {
38386 }
38389 }
38391 /* OpenMP 3.0:
38392 collapse ( constant-expression ) */
38394 static tree
38396 {
38398 location_t loc;
38399 HOST_WIDE_INT n;
38402 matching_parens parens;
38420 {
38423 }
38432 }
38434 /* OpenMP 2.5:
38435 default ( none | shared )
38437 OpenMP 5.1:
38438 default ( private | firstprivate )
38440 OpenACC:
38441 default ( none | present ) */
38443 static tree
38446 {
38448 tree c;
38450 matching_parens parens;
38454 {
38457 }
38459 {
38464 {
38491 }
38494 }
38495 else
38496 {
38497 invalid_kind:
38500 else
38503 }
38520 }
38522 /* OpenMP 3.1:
38523 final ( expression ) */
38525 static tree
38527 {
38530 matching_parens parens;
38549 }
38551 /* OpenMP 2.5:
38552 if ( expression )
38554 OpenMP 4.5:
38555 if ( directive-name-modifier : expression )
38557 directive-name-modifier:
38558 parallel | task | taskloop | target data | target | target update
38559 | target enter data | target exit data
38561 OpenMP 5.0:
38562 directive-name-modifier:
38563 ... | simd | cancel */
38565 static tree
38568 {
38572 matching_parens parens;
38577 {
38593 {
38596 {
38609 else
38610 {
38611 location_t loc
38616 }
38619 {
38621 {
38626 }
38628 {
38629 location_t loc
38633 }
38634 }
38635 }
38636 }
38638 {
38640 {
38643 }
38644 else
38645 {
38647 {
38648 location_t loc
38651 }
38653 }
38654 }
38655 }
38667 {
38670 {
38673 {
38685 }
38687 p);
38689 }
38691 {
38694 else
38697 }
38700 {
38704 }
38705 }
38713 }
38715 /* OpenMP 3.1:
38716 mergeable */
38718 static tree
38721 {
38722 tree c;
38725 location);
38730 }
38732 /* OpenMP 2.5:
38733 nowait */
38735 static tree
38738 {
38739 tree c;
38746 }
38748 /* OpenMP 2.5:
38749 num_threads ( expression ) */
38751 static tree
38753 location_t location)
38754 {
38757 matching_parens parens;
38777 }
38779 /* OpenMP 4.5:
38780 num_tasks ( expression )
38782 OpenMP 5.1:
38783 num_tasks ( strict : expression ) */
38785 static tree
38787 location_t location)
38788 {
38791 matching_parens parens;
38798 {
38801 {
38805 }
38806 }
38825 }
38827 /* OpenMP 4.5:
38828 grainsize ( expression )
38830 OpenMP 5.1:
38831 grainsize ( strict : expression ) */
38833 static tree
38835 location_t location)
38836 {
38839 matching_parens parens;
38846 {
38849 {
38853 }
38854 }
38873 }
38875 /* OpenMP 4.5:
38876 priority ( expression ) */
38878 static tree
38880 location_t location)
38881 {
38884 matching_parens parens;
38904 }
38906 /* OpenMP 4.5:
38907 hint ( expression ) */
38909 static tree
38911 {
38914 matching_parens parens;
38921 {
38929 }
38942 }
38944 /* OpenMP 5.1:
38945 filter ( integer-expression ) */
38947 static tree
38949 {
38952 matching_parens parens;
38970 }
38972 /* OpenMP 4.5:
38973 defaultmap ( tofrom : scalar )
38975 OpenMP 5.0:
38976 defaultmap ( implicit-behavior [ : variable-category ] ) */
38978 static tree
38980 location_t location)
38981 {
38985 enum omp_clause_defaultmap_kind category
38988 matching_parens parens;
38995 {
38996 invalid_behavior:
38998 "%<tofrom%>, %<firstprivate%>, %<none%> "
39001 }
39002 else
39003 {
39006 }
39009 {
39013 else
39020 else
39029 else
39036 else
39043 else
39052 else
39058 }
39062 {
39067 {
39068 invalid_category:
39072 }
39077 {
39083 else
39090 else
39097 else
39103 }
39106 }
39119 {
39129 {
39147 }
39150 p);
39151 else
39155 }
39162 out_err:
39167 }
39169 /* OpenMP 5.0:
39170 order ( concurrent )
39172 OpenMP 5.1:
39173 order ( order-modifier : concurrent )
39175 order-modifier:
39176 reproducible
39177 unconstrained */
39179 static tree
39181 {
39187 matching_parens parens;
39193 {
39200 else
39201 {
39205 }
39208 }
39210 {
39213 }
39214 else
39215 {
39218 }
39220 {
39223 }
39235 out_err:
39240 }
39242 /* OpenMP 5.0:
39243 bind ( teams | parallel | thread ) */
39245 static tree
39247 location_t location)
39248 {
39249 tree c;
39253 matching_parens parens;
39258 {
39259 invalid:
39263 }
39264 else
39265 {
39268 }
39279 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
39285 out_err:
39290 }
39292 /* OpenMP 2.5:
39293 ordered
39295 OpenMP 4.5:
39296 ordered ( constant-expression ) */
39298 static tree
39301 {
39303 HOST_WIDE_INT n;
39309 {
39310 matching_parens parens;
39327 {
39329 "ordered argument needs positive constant integer "
39332 }
39333 }
39339 }
39341 /* OpenMP 2.5:
39342 reduction ( reduction-operator : variable-list )
39344 reduction-operator:
39345 One of: + * - & ^ | && ||
39347 OpenMP 3.1:
39349 reduction-operator:
39350 One of: + * - & ^ | && || min max
39352 OpenMP 4.0:
39354 reduction-operator:
39355 One of: + * - & ^ | && ||
39356 id-expression
39358 OpenMP 5.0:
39359 reduction ( reduction-modifier, reduction-operator : variable-list )
39360 in_reduction ( reduction-operator : variable-list )
39361 task_reduction ( reduction-operator : variable-list ) */
39363 static tree
39366 {
39376 {
39379 {
39382 }
39385 {
39393 {
39396 }
39397 }
39398 }
39401 {
39411 }
39415 else
39416 {
39427 {
39457 }
39458 else
39459 {
39461 resync_fail:
39466 }
39467 }
39473 NULL);
39475 {
39482 }
39485 }
39487 /* OpenMP 2.5:
39488 schedule ( schedule-kind )
39489 schedule ( schedule-kind , expression )
39491 schedule-kind:
39492 static | dynamic | guided | runtime | auto
39494 OpenMP 4.5:
39495 schedule ( schedule-modifier : schedule-kind )
39496 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
39498 schedule-modifier:
39499 simd
39500 monotonic
39501 nonmonotonic */
39503 static tree
39505 {
39509 matching_parens parens;
39517 {
39526 else
39532 {
39535 }
39536 else
39537 {
39540 }
39541 }
39546 {
39551 {
39572 }
39573 }
39578 else
39584 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
39586 {
39590 }
39593 {
39608 else
39613 }
39625 invalid_kind:
39627 resync_fail:
39632 }
39634 /* OpenMP 3.0:
39635 untied */
39637 static tree
39640 {
39641 tree c;
39648 }
39650 /* OpenMP 4.0:
39651 inbranch
39652 notinbranch */
39654 static tree
39657 {
39662 }
39664 /* OpenMP 4.0:
39665 parallel
39666 for
39667 sections
39668 taskgroup */
39670 static tree
39674 {
39678 }
39680 /* OpenMP 4.5:
39681 nogroup */
39683 static tree
39686 {
39691 }
39693 /* OpenMP 4.5:
39694 simd
39695 threads */
39697 static tree
39701 {
39706 }
39708 /* OpenMP 4.0:
39709 num_teams ( expression )
39711 OpenMP 5.1:
39712 num_teams ( expression : expression ) */
39714 static tree
39716 location_t location)
39717 {
39720 matching_parens parens;
39731 {
39735 }
39752 }
39754 /* OpenMP 4.0:
39755 thread_limit ( expression ) */
39757 static tree
39759 location_t location)
39760 {
39763 matching_parens parens;
39783 }
39785 /* OpenMP 4.0:
39786 aligned ( variable-list )
39787 aligned ( variable-list : constant-expression ) */
39789 static tree
39791 {
39795 matching_parens parens;
39803 {
39813 }
39819 }
39821 /* OpenMP 5.0:
39822 allocate ( variable-list )
39823 allocate ( expression : variable-list )
39825 OpenMP 5.1:
39826 allocate ( allocator-modifier : variable-list )
39827 allocate ( allocator-modifier , allocator-modifier : variable-list )
39829 allocator-modifier:
39830 allocator ( expression )
39831 align ( expression ) */
39833 static tree
39835 {
39839 matching_parens parens;
39849 {
39855 matching_parens parens2;
39859 {
39863 }
39864 else
39865 {
39869 }
39873 {
39876 }
39880 }
39881 else
39884 {
39890 }
39893 {
39900 }
39901 else
39902 {
39906 }
39913 {
39916 }
39919 }
39921 /* OpenMP 2.5:
39922 lastprivate ( variable-list )
39924 OpenMP 5.0:
39925 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
39927 static tree
39929 {
39937 {
39942 {
39946 }
39947 }
39956 }
39958 /* OpenMP 4.0:
39959 linear ( variable-list )
39960 linear ( variable-list : expression )
39962 OpenMP 4.5:
39963 linear ( modifier ( variable-list ) )
39964 linear ( modifier ( variable-list ) : expression )
39966 modifier:
39967 val
39968 ref
39969 uval
39971 OpenMP 5.2:
39972 linear ( variable-list : modifiers-list )
39974 modifiers:
39975 val
39976 ref
39977 uval
39978 step ( expression ) */
39980 static tree
39983 {
39989 matching_parens parens;
39994 {
40005 {
40008 }
40009 else
40011 }
40016 else
40017 {
40026 }
40029 {
40033 {
40043 {
40047 }
40051 CPP_CLOSE_PAREN)))
40053 }
40057 {
40059 {
40070 {
40076 }
40078 {
40079 location_t step_loc
40082 matching_parens parens2;
40084 {
40090 CPP_CLOSE_PAREN))
40091 {
40092 cp_token *token
40100 tok_loc);
40102 {
40105 }
40108 }
40114 }
40115 else
40117 }
40118 else
40121 {
40124 }
40126 }
40129 }
40133 {
40144 {
40147 }
40150 }
40161 }
40164 {
40168 }
40171 }
40173 /* OpenMP 4.0:
40174 safelen ( constant-expression ) */
40176 static tree
40178 location_t location)
40179 {
40182 matching_parens parens;
40201 }
40203 /* OpenMP 4.0:
40204 simdlen ( constant-expression ) */
40206 static tree
40208 location_t location)
40209 {
40212 matching_parens parens;
40231 }
40233 /* OpenMP 4.5:
40234 vec:
40235 identifier [+/- integer]
40236 vec , identifier [+/- integer]
40237 */
40239 static tree
40242 {
40246 {
40249 }
40252 {
40258 {
40261 {
40269 }
40270 }
40271 }
40274 {
40281 else
40282 {
40283 t = cp_parser_lookup_name_simple
40288 id_loc);
40289 }
40295 {
40298 }
40302 {
40305 }
40309 {
40312 }
40315 add_to_vector:
40317 {
40321 }
40328 }
40331 {
40338 }
40340 }
40342 /* OpenMP 5.0:
40343 detach ( event-handle ) */
40345 static tree
40347 {
40348 matching_parens parens;
40364 else
40365 {
40368 else
40373 }
40386 }
40388 /* OpenMP 5.0:
40389 iterators ( iterators-definition )
40391 iterators-definition:
40392 iterator-specifier
40393 iterator-specifier , iterators-definition
40395 iterator-specifier:
40396 identifier = range-specification
40397 iterator-type identifier = range-specification
40399 range-specification:
40400 begin : end
40401 begin : end : step */
40403 static tree
40405 {
40409 matching_parens parens;
40413 bool saved_colon_corrects_to_scope_p
40415 bool saved_colon_doesnt_start_class_def_p
40418 do
40419 {
40420 tree iter_type;
40424 else
40425 {
40428 parser->type_definition_forbidden_message
40434 }
40438 {
40441 }
40461 {
40464 }
40479 {
40482 }
40484 }
40488 parser->colon_doesnt_start_class_def_p
40498 }
40500 /* OpenMP 5.0:
40501 affinity ( [aff-modifier :] variable-list )
40502 aff-modifier:
40503 iterator ( iterators-definition ) */
40505 static tree
40507 {
40510 matching_parens parens;
40515 {
40520 CPP_OPEN_PAREN)));
40522 {
40525 }
40527 {
40531 {
40539 }
40540 }
40541 }
40545 {
40548 {
40553 }
40554 }
40556 }
40558 /* OpenMP 4.0:
40559 depend ( depend-kind : variable-list )
40561 depend-kind:
40562 in | out | inout
40564 OpenMP 4.5:
40565 depend ( source )
40567 depend ( sink : vec )
40569 OpenMP 5.0:
40570 depend ( depend-modifier , depend-kind: variable-list )
40572 depend-kind:
40573 in | out | inout | mutexinoutset | depobj
40575 depend-modifier:
40576 iterator ( iterators-definition ) */
40578 static tree
40580 {
40585 matching_parens parens;
40589 do
40590 {
40598 {
40603 }
40620 else
40623 }
40631 {
40636 }
40639 {
40650 }
40656 {
40662 }
40663 else
40664 {
40669 {
40673 else
40675 }
40678 {
40683 }
40684 }
40687 invalid_kind:
40689 resync_fail:
40696 }
40698 /* OpenMP 5.2:
40699 doacross ( source : )
40700 doacross ( source : omp_cur_iteration )
40702 doacross ( sink : vec )
40703 doacross ( sink : omp_cur_iteration - logical_iteration ) */
40705 static tree
40707 {
40708 tree nlist;
40711 matching_parens parens;
40716 {
40717 invalid_kind:
40719 resync_fail:
40724 }
40733 else
40742 {
40744 {
40749 }
40754 }
40755 else
40763 }
40765 /* OpenMP 4.0:
40766 from ( variable-list )
40767 to ( variable-list )
40769 OpenMP 5.1:
40770 from ( [present :] variable-list )
40771 to ( [present :] variable-list ) */
40773 static tree
40775 tree list)
40776 {
40786 {
40790 }
40798 }
40800 /* OpenMP 4.0:
40801 map ( map-kind : variable-list )
40802 map ( variable-list )
40804 map-kind:
40805 alloc | to | from | tofrom
40807 OpenMP 4.5:
40808 map-kind:
40809 alloc | to | from | tofrom | release | delete
40811 map ( always [,] map-kind: variable-list )
40813 OpenMP 5.0:
40814 map ( [map-type-modifier[,] ...] map-kind: variable-list )
40816 map-type-modifier:
40817 always | close */
40819 static tree
40821 {
40832 {
40834 {
40837 }
40840 pos++;
40841 pos++;
40842 }
40848 {
40851 {
40854 }
40858 {
40860 {
40867 }
40869 }
40871 {
40873 {
40880 }
40882 }
40884 {
40886 {
40893 }
40895 }
40896 else
40897 {
40905 }
40908 }
40912 {
40936 else
40937 {
40943 }
40946 }
40949 {
40953 }
40962 }
40964 /* OpenMP 4.0:
40965 device ( expression )
40967 OpenMP 5.0:
40968 device ( [device-modifier :] integer-expression )
40970 device-modifier:
40971 ancestor | device_num */
40973 static tree
40975 location_t location)
40976 {
40980 matching_parens parens;
40986 {
40990 {
40993 /* A requires directive with the reverse_offload clause must be
40994 specified. */
40996 {
40998 "preceded by %<requires%> directive "
41002 }
41003 }
41005 ;
41006 else
41007 {
41011 }
41014 }
41033 }
41035 /* OpenMP 4.0:
41036 dist_schedule ( static )
41037 dist_schedule ( static , expression ) */
41039 static tree
41041 location_t location)
41042 {
41045 matching_parens parens;
41056 {
41067 }
41071 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
41072 "dist_schedule", location); */
41078 invalid_kind:
41080 resync_fail:
41085 }
41087 /* OpenMP 4.0:
41088 proc_bind ( proc-bind-kind )
41090 proc-bind-kind:
41091 primary | master | close | spread
41092 where OpenMP 5.1 added 'primary' and deprecated the alias 'master'. */
41094 static tree
41096 location_t location)
41097 {
41098 tree c;
41105 {
41117 else
41119 }
41120 else
41129 location);
41134 invalid_kind:
41136 resync_fail:
41141 }
41143 /* OpenMP 5.0:
41144 device_type ( host | nohost | any ) */
41146 static tree
41148 location_t location)
41149 {
41150 tree c;
41157 {
41167 else
41169 }
41170 else
41179 location);
41184 invalid_kind:
41186 resync_fail:
41191 }
41193 /* OpenACC:
41194 async [( int-expr )] */
41196 static tree
41198 {
41205 {
41206 matching_parens parens;
41215 }
41225 }
41227 /* Parse all OpenACC clauses. The set clauses allowed by the directive
41228 is a bitmask in MASK. Return the list of clauses found. */
41230 static tree
41234 {
41238 /* Don't create location wrapper nodes within OpenACC clauses. */
41239 auto_suppress_location_wrappers sentinel;
41242 {
41243 location_t here;
41244 pragma_omp_clause c_kind;
41245 omp_clause_code code;
41256 {
41263 clauses);
41316 clauses);
41321 clauses);
41339 clauses);
41344 clauses);
41357 clauses);
41364 clauses);
41370 clauses);
41378 clauses);
41382 clauses
41389 clauses);
41398 clauses);
41404 OMP_CLAUSE_VECTOR,
41411 clauses);
41420 OMP_CLAUSE_WORKER,
41426 }
41431 {
41432 /* Remove the invalid clause(s) from the list to avoid
41433 confusing the rest of the compiler. */
41436 }
41437 }
41439 saw_error:
41446 }
41448 /* Parse all OpenMP clauses. The set clauses allowed by the directive
41449 is a bitmask in MASK. Return the list of clauses found.
41450 FINISH_P set if finish_omp_clauses should be called.
41451 NESTED non-zero if clauses should be terminated by closing paren instead
41452 of end of pragma. If it is 2, additionally commas are required in between
41453 the clauses. */
41455 static tree
41459 {
41464 /* Don't create location wrapper nodes within OpenMP clauses. */
41465 auto_suppress_location_wrappers sentinel;
41468 {
41469 pragma_omp_clause c_kind;
41477 {
41482 "clauses in %<simd%> trait should be separated "
41484 }
41490 {
41507 clauses);
41526 clauses);
41546 clauses);
41551 clauses);
41556 clauses);
41561 clauses);
41570 clauses
41616 clauses);
41620 clauses
41632 clauses);
41636 clauses
41638 OMP_CLAUSE_TASK_REDUCTION,
41654 clauses);
41659 OMP_CLAUSE_NOTINBRANCH,
41668 {
41669 clause_not_first:
41673 }
41702 {
41704 clauses);
41708 }
41709 else
41711 clauses);
41716 clauses);
41721 clauses);
41743 {
41748 }
41809 clauses
41815 clauses
41822 clauses);
41828 }
41833 {
41834 /* Remove the invalid clause(s) from the list to avoid
41835 confusing the rest of the compiler. */
41838 }
41839 }
41840 saw_error:
41844 {
41847 else
41849 }
41851 }
41853 /* OpenMP 2.5:
41854 structured-block:
41855 statement
41857 In practice, we're also interested in adding the statement to an
41858 outer node. So it is convenient if we work around the fact that
41859 cp_parser_statement calls add_stmt. */
41861 static unsigned
41863 {
41866 /* Only move the values to IN_OMP_BLOCK if they weren't false.
41867 This preserves the "not within loop or switch" style error messages
41868 for nonsense cases like
41869 void foo() {
41870 #pragma omp single
41871 break;
41872 }
41873 */
41878 }
41880 static void
41882 {
41884 }
41886 static tree
41888 {
41897 }
41899 /* OpenMP 5.x:
41900 # pragma omp allocate (list) clauses
41902 OpenMP 5.0 clause:
41903 allocator (omp_allocator_handle_t expression)
41905 OpenMP 5.1 additional clause:
41906 align (constant-expression)] */
41908 static void
41910 {
41916 do
41917 {
41924 matching_parens parens;
41930 {
41933 }
41938 {
41941 }
41943 {
41946 /* FIXME: Remove when adding check to semantics.cc; cf FIXME below. */
41950 {
41952 "positive constant power of two integer "
41955 }
41957 {
41960 {
41965 {
41967 "positive constant power of two integer "
41970 }
41971 }
41972 }
41973 }
41975 {
41978 }
41979 else
41980 {
41983 }
41990 {
41993 }
41995 /* FIXME: When implementing properly, delete the align/allocate expr error
41996 check above and add one in semantics.cc (to properly handle templates).
41997 Base this on the allocator/align modifiers check for the 'allocate' clause
41998 in semantics.cc's finish_omp_clauses. */
42000 }
42002 /* OpenMP 2.5:
42003 # pragma omp atomic new-line
42004 expression-stmt
42006 expression-stmt:
42007 x binop= expr | x++ | ++x | x-- | --x
42008 binop:
42009 +, *, -, /, &, ^, |, <<, >>
42011 where x is an lvalue expression with scalar type.
42013 OpenMP 3.1:
42014 # pragma omp atomic new-line
42015 update-stmt
42017 # pragma omp atomic read new-line
42018 read-stmt
42020 # pragma omp atomic write new-line
42021 write-stmt
42023 # pragma omp atomic update new-line
42024 update-stmt
42026 # pragma omp atomic capture new-line
42027 capture-stmt
42029 # pragma omp atomic capture new-line
42030 capture-block
42032 read-stmt:
42033 v = x
42034 write-stmt:
42035 x = expr
42036 update-stmt:
42037 expression-stmt | x = x binop expr
42038 capture-stmt:
42039 v = expression-stmt
42040 capture-block:
42041 { v = x; update-stmt; } | { update-stmt; v = x; }
42043 OpenMP 4.0:
42044 update-stmt:
42045 expression-stmt | x = x binop expr | x = expr binop x
42046 capture-stmt:
42047 v = update-stmt
42048 capture-block:
42049 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
42051 OpenMP 5.1:
42052 # pragma omp atomic compare new-line
42053 conditional-update-atomic
42055 # pragma omp atomic compare capture new-line
42056 conditional-update-capture-atomic
42058 conditional-update-atomic:
42059 cond-expr-stmt | cond-update-stmt
42060 cond-expr-stmt:
42061 x = expr ordop x ? expr : x;
42062 x = x ordop expr ? expr : x;
42063 x = x == e ? d : x;
42064 cond-update-stmt:
42065 if (expr ordop x) { x = expr; }
42066 if (x ordop expr) { x = expr; }
42067 if (x == e) { x = d; }
42068 ordop:
42069 <, >
42070 conditional-update-capture-atomic:
42071 v = cond-expr-stmt
42072 { v = x; cond-expr-stmt }
42073 { cond-expr-stmt v = x; }
42074 { v = x; cond-update-stmt }
42075 { cond-update-stmt v = x; }
42076 if (x == e) { x = d; } else { v = x; }
42077 { r = x == e; if (r) { x = d; } }
42078 { r = x == e; if (r) { x = d; } else { v = x; } }
42080 where x, r and v are lvalue expressions with scalar type,
42081 expr, e and d are expressions with scalar type and e might be
42082 the same as v. */
42084 static void
42086 {
42102 {
42108 {
42113 enum omp_memory_order new_memory_order
42129 {
42133 }
42141 {
42142 matching_parens parens;
42149 {
42159 }
42162 {
42166 else
42168 }
42169 else
42179 }
42191 {
42195 }
42196 else
42197 {
42200 "%<capture%>, %<compare%>, %<weak%>, %<fail%>, "
42201 "%<seq_cst%>, %<acq_rel%>, %<release%>, "
42203 }
42205 {
42207 {
42208 /* OpenACC permits 'update capture'. */
42215 else
42217 }
42219 {
42222 else
42224 }
42226 {
42229 else
42231 }
42233 {
42236 else
42238 }
42240 {
42243 else
42245 }
42248 }
42249 }
42251 }
42257 {
42261 else
42263 }
42265 {
42269 }
42271 {
42274 }
42276 {
42279 }
42283 {
42284 omp_requires_mask
42289 {
42299 {
42309 }
42313 }
42314 }
42315 else
42317 {
42320 {
42324 }
42330 {
42334 }
42340 }
42342 memory_order
42347 {
42357 else
42362 {
42363 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
42364 opcode. */
42369 }
42373 {
42376 }
42380 else
42381 {
42389 {
42393 }
42394 }
42397 }
42399 restart:
42401 {
42404 matching_parens parens;
42408 tree cmp_expr;
42411 else
42419 {
42425 }
42427 ;
42429 {
42433 }
42436 {
42438 "expected %<==%>, %<<%> or %<>%> comparison in %<if%> "
42441 }
42452 {
42455 }
42460 else
42473 {
42475 {
42478 }
42480 {
42485 }
42486 else
42488 }
42493 {
42498 }
42499 else
42500 {
42501 bad_if:
42505 }
42508 {
42512 {
42516 }
42544 /* Signal to c_finish_omp_atomic that in
42545 if (x == e) { x = d; } else { v = x; }
42546 case the store to v should be conditional. */
42548 }
42550 {
42553 }
42559 }
42563 {
42570 /* FALLTHROUGH */
42582 /* FALLTHROUGH */
42599 /* Undo effects of boolean_increment for post {in,de}crement. */
42601 /* FALLTHRU */
42605 {
42606 /* Undo effects of boolean_increment. */
42608 {
42609 /* This is pre or post increment. */
42614 && !structured_block
42620 }
42621 }
42622 /* FALLTHRU */
42625 {
42628 }
42630 {
42665 {
42669 }
42674 {
42680 {
42685 }
42687 {
42701 {
42703 {
42708 }
42709 else
42711 }
42716 || !structured_block
42717 || v
42723 {
42725 {
42731 }
42732 }
42740 {
42744 cond_expr:
42746 bool saved_colon_corrects_to_scope_p
42750 parser->colon_corrects_to_scope_p
42755 {
42757 {
42759 {
42763 }
42765 {
42766 opcode
42770 }
42771 }
42772 else
42773 {
42776 {
42777 opcode
42782 }
42783 }
42784 }
42786 "invalid form of "
42789 }
42793 }
42798 {
42805 }
42809 }
42813 {
42816 {
42824 }
42826 {
42831 }
42875 }
42878 {
42880 "invalid form of "
42883 }
42894 {
42896 {
42898 "invalid form of "
42901 }
42903 }
42909 }
42916 }
42917 stmt_done:
42919 {
42932 }
42934 {
42938 }
42939 done:
42941 {
42944 }
42952 invalid_compare:
42954 /* FALLTHRU */
42955 saw_error:
42960 {
42964 {
42968 }
42969 }
42970 }
42973 /* OpenMP 2.5:
42974 # pragma omp barrier new-line */
42976 static void
42978 {
42981 }
42983 /* OpenMP 2.5:
42984 # pragma omp critical [(name)] new-line
42985 structured-block
42987 OpenMP 4.5:
42988 # pragma omp critical [(name) [hint(expression)]] new-line
42989 structured-block */
42991 #define OMP_CRITICAL_CLAUSE_MASK \
42992 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
42994 static tree
42996 {
43000 {
43001 matching_parens parens;
43017 }
43024 }
43026 /* OpenMP 5.0:
43027 # pragma omp depobj ( depobj ) depobj-clause new-line
43029 depobj-clause:
43030 depend (dependence-type : locator)
43031 destroy
43032 update (dependence-type)
43034 dependence-type:
43035 in
43036 out
43037 inout
43038 mutexinout */
43040 static void
43042 {
43044 matching_parens parens;
43046 {
43049 }
43064 {
43070 {
43071 /* Don't create location wrapper nodes within the depend clause. */
43072 auto_suppress_location_wrappers sentinel;
43078 }
43082 {
43083 matching_parens c_parens;
43085 {
43086 location_t c2_loc
43089 {
43104 }
43106 {
43110 }
43116 }
43117 else
43119 }
43120 }
43122 {
43125 }
43129 }
43132 /* OpenMP 2.5:
43133 # pragma omp flush flush-vars[opt] new-line
43135 flush-vars:
43136 ( variable-list )
43138 OpenMP 5.0:
43139 # pragma omp flush memory-order-clause new-line */
43141 static void
43143 {
43149 {
43160 else
43162 "expected %<seq_cst%>, %<acq_rel%>, %<release%> or "
43165 }
43167 {
43170 "%<flush%> list specified together with memory order "
43173 }
43177 }
43179 /* Helper function, to parse omp for increment expression. */
43181 static tree
43183 {
43188 {
43191 }
43194 {
43206 }
43208 /* If decl is an iterator, preserve LHS and RHS of the relational
43209 expr until finish_omp_for. */
43220 }
43222 /* Helper function, to parse omp for increment expression. */
43224 static tree
43226 {
43230 cp_id_kind idk;
43234 {
43243 }
43252 {
43257 }
43264 {
43268 }
43281 do
43282 {
43289 {
43291 {
43294 else
43297 }
43298 else
43303 }
43304 }
43308 {
43314 }
43315 else
43319 }
43321 /* Parse the initialization statement of an OpenMP for loop. Range-for
43322 is handled separately in cp_convert_omp_range_for.
43324 On entry SL is the current statement list. Parsing of some forms
43325 of initialization pops this list and stores its contents in either INIT
43326 or THIS_PRE_BODY, and sets SL to null. Initialization for class
43327 iterators is added directly to SL and it is not popped until later.
43329 On return, DECL is set if the initialization is by binding the
43330 iteration variable. If the initialization is by assignment, REAL_DECL
43331 is set to point to a variable in an outer scope. ORIG_INIT is set
43332 if the iteration variable is of class type; this is a copy saved for
43333 error checking in finish_omp_for.
43335 Return true if the resulting construct should have an
43336 OMP_CLAUSE_PRIVATE added to it. */
43338 static tree
43346 {
43352 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
43354 init-expr:
43355 var = lb
43356 integer-type var = lb
43357 random-access-iterator-type var = lb
43358 pointer-type var = lb
43359 */
43360 cp_decl_specifier_seq type_specifiers;
43362 /* First, try to parse as an initialized declaration. See
43363 cp_parser_condition, from whence the bulk of this is copied. */
43371 {
43372 /* If parsing a type specifier seq succeeded, then this
43373 MUST be a initialized declaration. */
43378 CP_PARSER_DECLARATOR_NAMED,
43379 CP_PARSER_FLAGS_NONE,
43391 else
43392 {
43402 {
43404 CPP_OPEN_PAREN))
43407 else
43408 /* Trigger an error. */
43413 }
43417 {
43425 {
43428 auto_node);
43433 }
43436 asm_specification,
43437 LOOKUP_ONLYCONVERTING);
43440 /* In the case of a class iterator, do not pop sl here.
43441 Both class initialization and finalization must happen in
43442 the enclosing init block scope. For now set the init
43443 expression to null; it'll be filled in properly in
43444 finish_omp_for before stuffing it in the OMP_FOR. */
43448 {
43452 {
43454 /* Move lambda DECL_EXPRs to the enclosing block. */
43456 {
43460 {
43464 }
43466 }
43468 {
43473 }
43474 }
43475 }
43476 }
43477 else
43478 /* This is an initialized declaration of non-class,
43479 non-parameterized type iteration variable. */
43480 {
43481 /* Consume '='. */
43485 non_class:
43488 else
43491 asm_specification,
43492 LOOKUP_ONLYCONVERTING);
43495 }
43499 }
43500 }
43501 else
43502 {
43503 cp_id_kind idk;
43504 /* If parsing a type specifier sequence failed, then
43505 this MUST be a simple expression. */
43511 && decl
43514 {
43525 {
43530 }
43535 }
43537 && decl
43540 {
43541 tree rhs;
43550 tf_warning_or_error));
43553 }
43554 else
43555 {
43560 {
43564 }
43565 }
43568 }
43570 }
43572 /* Helper for cp_parser_omp_loop_nest, handle one range-for loop
43573 including introducing new temporaries for the range start and end,
43574 doing auto deduction, and processing decomposition variables.
43576 This function is also called from pt.cc during template instantiation.
43577 In that case SL is NULL_TREE, otherwise it is the current statement
43578 list. */
43579 void
43583 {
43589 {
43593 /* do_auto_deduction doesn't mess with template init-lists. */
43595 {
43599 {
43604 {
43609 }
43610 }
43612 }
43617 {
43620 }
43622 }
43627 /* If an error happened previously do nothing or else a lot of
43628 unhelpful errors would be issued. */
43630 else
43631 {
43632 tree range_temp;
43636 /* Can't bind a reference to an array of runtime bound. */
43638 else
43639 {
43645 LOOKUP_ONLYCONVERTING);
43648 }
43651 }
43662 LOOKUP_ONLYCONVERTING);
43664 /* The new for initialization statement. */
43672 else
43673 {
43676 }
43679 LOOKUP_ONLYCONVERTING);
43681 /* The new for condition. */
43684 else
43690 /* The new increment expression. */
43693 else
43696 tf_warning_or_error);
43700 /* Defer popping sl here. */
43704 {
43709 {
43715 }
43716 }
43720 {
43724 {
43728 {
43734 }
43735 }
43736 }
43738 /* The output ORIG_DECL is not a decl. Instead, it is a tree structure
43739 that holds decls for variables implementing the iterator, represented
43740 as a TREE_LIST whose TREE_CHAIN is a vector. The first two elements
43741 of the vector are decls of scratch variables for the range start and
43742 end that will eventually be bound in the implicit scope surrounding
43743 the whole loop nest. The remaining elements are decls of derived
43744 decomposition variables that are bound inside the loop body. This
43745 structure is further mangled by finish_omp_for into the form required
43746 for the OMP_FOR_ORIG_DECLS field of the OMP_FOR tree node. */\
43755 {
43757 {
43758 /* If cp_finish_decomp was called with processing_template_decl
43759 temporarily set to 1, then decomp names will have deduced
43760 name but the DECL_VALUE_EXPR will be dependent. Hide those
43761 from folding of other loop initializers e.g. for warning
43762 purposes until cp_finish_omp_range_for. */
43767 }
43770 }
43772 }
43774 /* Helper for cp_parser_omp_for_loop, finalize part of range for
43775 inside of the collapsed body. */
43777 void
43779 {
43786 {
43791 {
43792 /* Undo temporary clearing of DECL_HAS_VALUE_EXPR_P done
43793 by cp_convert_omp_range_for above. */
43797 {
43801 }
43802 }
43803 }
43805 /* The declaration is initialized with *__begin inside the loop body. */
43813 }
43815 /* Return true if next tokens contain a standard attribute that contains
43816 omp::directive (DIRECTIVE). */
43818 static bool
43821 {
43829 {
43836 }
43841 location_t last_loc
43850 {
43852 {
43856 cnt++;
43860 {
43864 }
43865 }
43866 }
43868 {
43871 }
43873 {
43875 "%<[[omp::directive(%s)]]%> must be the only specified "
43879 }
43884 }
43886 /* Parse an OpenMP structured block sequence. KIND is the corresponding
43887 separating directive. */
43889 static tree
43892 {
43898 {
43911 kind == PRAGMA_OMP_SCAN
43916 }
43920 }
43923 /* OpenMP 5.0:
43925 scan-loop-body:
43926 { structured-block scan-directive structured-block } */
43928 static void
43930 {
43934 matching_braces braces;
43941 else
43942 {
43946 }
43952 {
43962 {
43969 }
43971 {
43974 }
43975 else
43980 }
43981 else
43987 else
43988 {
43993 }
43995 clauses);
43999 }
44002 /* This function parses a single level of a loop nest, invoking itself
44003 recursively if necessary.
44005 loop-nest :: for (...) loop-body
44006 loop-body :: loop-nest
44007 | { [intervening-code] loop-body [intervening-code] }
44008 | final-loop-body
44009 intervening-code :: structured-block-sequence
44010 final-loop-body :: structured-block
44012 For a collapsed loop nest, only a single OMP_FOR is built, pulling out
44013 all the iterator information from the inner loops into vectors in the
44014 parser->omp_for_parse_state structure.
44016 In the "range for" case, it is transformed into a regular "for" iterator
44017 by introducing some temporary variables for the begin/end,
44018 as well as bindings of the actual iteration variables which are
44019 injected into the body of the loop.
44021 Initialization code for iterator variables may end up either in the
44022 init vector (simple assignments), in omp_for_parse_state->pre_body
44023 (decl_exprs for iterators bound in the for statement), or in the
44024 scope surrounding this level of loop initialization.
44026 The scopes of class iterator variables and their finalizers need to
44027 be adjusted after parsing so that all of the initialization happens
44028 in a scope surrounding all of the intervening and body code. For
44029 this reason we separately store the initialization and body blocks
44030 for each level of loops in the omp_for_parse_state structure and
44031 reassemble/reorder them in cp_parser_omp_for. See additional
44032 comments there about the use of placeholders, etc. */
44034 static tree
44036 {
44041 tree init_scope;
44046 location_t loc;
44054 /* We have already matched the FOR token but not consumed it yet. */
44058 /* Forbid break/continue in the loop initializer, condition, and
44059 increment expressions. */
44063 /* We are not in intervening code now. */
44066 /* Don't create location wrapper nodes within an OpenMP "for"
44067 statement. */
44068 auto_suppress_location_wrappers sentinel;
44070 matching_parens parens;
44077 integer_zero_node);
44080 /* The init_block acts as a container for this level of loop goo. */
44084 /* Wrap a scope around this entire level of loop to hold bindings
44085 of loop iteration variables. We can't insert them directly
44086 in the containing scope because that would cause their visibility to
44087 be incorrect with respect to intervening code after this loop.
44088 We will combine the nested init_scopes in postprocessing after the
44089 entire loop is parsed. */
44092 /* Now we need another level of statement list container to capture the
44093 initialization (and possible finalization) bits. In some cases this
44094 container may be popped off during initializer parsing to store code in
44095 INIT or THIS_PRE_BODY, depending on the form of initialization. If
44096 we have a class iterator we will pop it at the end of parsing this
44097 level, so the cleanups are handled correctly. */
44101 {
44102 /* Save tokens so that we can put them back. */
44105 /* Look for ':' that is not nested in () or {}. */
44106 is_range_for
44109 CPP_COLON,
44110 /*consume_paren=*/
44113 /* Roll back the tokens we skipped. */
44117 {
44118 bool saved_colon_corrects_to_scope_p
44121 /* A colon is used in range-based for. */
44124 /* Parse the declaration. */
44126 /*function_definition_allowed_p=*/
44128 parser->colon_corrects_to_scope_p
44142 "%<ordered%> clause with parameter on "
44146 }
44147 }
44149 add_private_clause
44155 /* If the iteration variable was introduced via a declaration in the
44156 for statement, DECL points at it. Otherwise DECL is null and
44157 REAL_DECL is a variable previously declared in an outer scope.
44158 Make REAL_DECL point at the iteration variable no matter where it
44159 was introduced. */
44163 /* Some clauses treat iterator variables specially. */
44168 {
44174 {
44178 }
44181 {
44182 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
44186 {
44190 }
44191 else
44192 {
44195 }
44197 }
44198 else
44199 {
44204 }
44205 }
44208 {
44209 tree c;
44211 {
44220 decl);
44225 decl);
44226 }
44228 {
44235 else
44240 {
44243 /* For linear, signal that we need to fill up
44244 the so far unknown linear step. */
44247 }
44248 }
44249 }
44258 {
44259 /* If decl is an iterator, preserve the operator on decl
44260 until finish_omp_for. */
44262 && ((processing_template_decl
44267 else
44270 }
44272 parse_close_paren:
44278 /* We've parsed all the for (...) stuff now. Store the bits. */
44284 {
44287 }
44289 {
44291 omp_for_parse_state->orig_declv
44294 }
44301 /* Start a nested block for the loop body. */
44303 integer_zero_node);
44311 {
44315 }
44318 {
44319 /* This is the open brace in the loop-body grammar production. Rather
44320 than trying to special-case braces, just parse it as a compound
44321 statement and handle the nested loop-body case there. Note that
44322 when we see a further open brace inside the compound statement
44323 loop-body, we don't know whether it is the start of intervening
44324 code that is a compound statement, or a level of braces
44325 surrounding a nested loop-body. Use the WANT_NESTED_LOOP state
44326 bit to ensure we have only one nested loop at each level. */
44333 {
44334 /* We have already parsed the whole loop body and not found a
44335 nested loop. */
44339 }
44341 }
44342 else
44343 {
44344 /* This is the final-loop-body case in the grammar: we have something
44345 that is not a FOR and not an open brace. */
44347 {
44348 /* If we were expecting a nested loop, give an error and mark
44349 that parsing has failed, and try to recover by parsing the
44350 body as regular code without further collapsing. */
44354 }
44357 /* Generate the parts of range for that belong in the loop body,
44358 to be executed on every iteration. This includes setting the
44359 user-declared decomposition variables from the compiler-generated
44360 temporaries that are the real iteration variables for OMP_FOR.
44361 FIXME: Not sure if this is correct with respect to visibility
44362 of the variables from intervening code. However, putting this
44363 code in each level of loop instead of all around the innermost
44364 body also makes the decomposition variables visible to the
44365 inner for init/bound/step exressions, which is not supposed to
44366 happen and causes test failures. */
44369 {
44374 }
44376 /* Now parse the final-loop-body for the innermost loop. */
44380 else
44383 }
44388 /* Pop and remember the body block. Add the body placeholder
44389 to the surrounding statement list instead. This is just a unique
44390 token that will be replaced when we reassemble the generated
44391 code for the entire omp for statement. */
44396 /* Pop and remember the init block. */
44403 /* Return the init placeholder rather than the remembered init block.
44404 Again, this is just a unique cookie that will be used to reassemble
44405 code pieces when the entire omp for statement has been parsed. */
44407 }
44409 /* Worker for find_structured_blocks. *TP points to a STATEMENT_LIST
44410 and ITER is the element that is or contains a nested loop. This
44411 function moves the statements before and after ITER into
44412 OMP_STRUCTURED_BLOCKs and modifies *TP. */
44413 static void
44415 {
44419 {
44424 TSI_SAME_STMT);
44425 i++;
44427 }
44428 else
44429 {
44433 }
44438 TSI_SAME_STMT);
44439 }
44441 /* Helper to find and mark structured blocks in intervening code for a
44442 single loop level with markers for later error checking. *TP is the
44443 piece of code to be marked and INNER is the inner loop placeholder.
44444 Returns true if INNER was found (recursively) in *TP. */
44445 static bool
44447 {
44453 {
44455 {
44457 /* The normal case is that there is no intervening code and we
44458 do not have to insert any OMP_STRUCTURED_BLOCK markers. */
44460 {
44464 }
44465 }
44467 }
44472 else
44474 }
44476 /* Helpers used for relinking tree structures: In tree rooted at
44477 CONTEXT, replace ORIG with REPLACEMENT. If FLATTEN is true, try to combine
44478 nested BIND_EXPRs. Gives an assertion if it fails to find ORIG. */
44481 tree orig;
44482 tree repl;
44484 };
44486 static tree
44489 {
44492 {
44495 }
44496 /* Remove redundant BIND_EXPRs with no bindings even when not specifically
44497 trying to flatten. */
44502 {
44505 }
44509 {
44511 {
44512 /* Merge binding lists for two directly nested BIND_EXPRs,
44513 keeping the outer one. */
44518 }
44520 /* There might be a statement list containing cleanup_points
44521 etc between the two levels of BIND_EXPR. We can still merge
44522 them, again keeping the outer BIND_EXPR. */
44525 {
44528 {
44533 }
44534 }
44535 }
44537 }
44539 static void
44541 {
44554 }
44556 /* Walker to patch up the BLOCK_NODE hierarchy after the above surgery.
44557 *DP is is the parent block. */
44559 static tree
44561 {
44564 /* BIND_EXPR_BLOCK may be null if the expression is not a
44565 full-expression; if there's no block, no patching is necessary
44566 for this node. */
44568 {
44571 {
44575 }
44580 }
44583 }
44585 /* Parse the restricted form of the for statement allowed by OpenMP. */
44587 static tree
44590 {
44591 tree ret;
44599 tree result;
44606 {
44609 }
44612 {
44615 }
44622 {
44628 }
44634 {
44637 }
44639 /* Initialize parse state for recursive descent. */
44664 /* Bomb out early if there was an error (not enough loops, etc). */
44666 {
44669 }
44671 /* Relink the init and body blocks that were built during parsing. At
44672 this point we have a structure nested like
44673 init 0
44674 body 0
44675 init 1
44676 body 1
44677 init 2
44678 body 2
44679 and we want to turn it into
44680 init 0
44681 init 1
44682 init 2
44683 omp_for
44684 body 0
44685 body 1
44686 body 2
44687 We also need to flatten the init blocks, as some code for later
44688 processing of combined directives gets confused otherwise. */
44695 /* First insert markers for structured blocks for intervening code in
44696 the loop bodies. */
44698 {
44702 }
44704 /* Do the substitution from the inside out. */
44706 {
44713 }
44715 /* Generate the OMP_FOR. Note finish_omp_for adds the OMP_FOR
44716 (and possibly other stuff) to the current statement list but
44717 returns a pointer to the OMP_FOR itself, or null in case of error. */
44725 /* Check for errors involving lb/ub/incr expressions referencing
44726 variables declared in intervening code. */
44732 {
44733 /* Splice the omp_for into the nest of init blocks. */
44738 /* Some later processing for combined directives assumes
44739 that the BIND_EXPR containing range for variables appears
44740 at top level in the OMP_FOR body. Fix that up if it's
44741 not the case, e.g. because there is intervening code. */
44745 /* Clean up the block subblock/superblock links. Per comment in
44746 begin_compound_stmt, "we don't build BLOCK nodes when processing
44747 templates", so skip this step in that case. */
44749 {
44753 }
44755 /* Finally record the result. */
44757 }
44761 }
44763 /* Helper function for OpenMP parsing, split clauses and call
44764 finish_omp_clauses on each of the set of clauses afterwards. */
44766 static void
44769 {
44775 i == C_OMP_CLAUSE_SPLIT_TARGET
44777 }
44779 /* OpenMP 5.0:
44780 #pragma omp loop loop-clause[optseq] new-line
44781 for-loop */
44783 #define OMP_LOOP_CLAUSE_MASK \
44784 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
44789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44791 static tree
44795 {
44806 {
44809 }
44821 }
44823 /* OpenMP 4.0:
44824 #pragma omp simd simd-clause[optseq] new-line
44825 for-loop */
44827 #define OMP_SIMD_CLAUSE_MASK \
44828 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
44829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
44830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
44832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
44838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44840 static tree
44844 {
44855 {
44858 }
44870 }
44872 /* OpenMP 2.5:
44873 #pragma omp for for-clause[optseq] new-line
44874 for-loop
44876 OpenMP 4.0:
44877 #pragma omp for simd for-simd-clause[optseq] new-line
44878 for-loop */
44880 #define OMP_FOR_CLAUSE_MASK \
44881 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
44887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
44888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
44889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44893 static tree
44897 {
44904 /* parallel for{, simd} disallows nowait clause, but for
44905 target {teams distribute ,}parallel for{, simd} it should be accepted. */
44908 /* Composite distribute parallel for{, simd} disallows ordered clause. */
44913 {
44918 {
44942 }
44943 }
44945 {
44948 }
44950 /* Composite distribute parallel for disallows linear clause. */
44957 {
44960 }
44972 }
44977 /* OpenMP 2.5:
44978 # pragma omp master new-line
44979 structured-block */
44981 static tree
44985 {
44993 {
44998 {
45018 }
45019 }
45021 {
45024 }
45027 {
45031 }
45032 else
45037 }
45039 /* OpenMP 5.1:
45040 # pragma omp masked masked-clauses new-line
45041 structured-block */
45043 #define OMP_MASKED_CLAUSE_MASK \
45044 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FILTER)
45046 static tree
45050 {
45059 {
45064 {
45085 }
45086 }
45088 {
45091 }
45096 {
45099 }
45103 clauses);
45104 }
45106 /* OpenMP 2.5:
45107 # pragma omp ordered new-line
45108 structured-block
45110 OpenMP 4.5:
45111 # pragma omp ordered ordered-clauses new-line
45112 structured-block */
45114 #define OMP_ORDERED_CLAUSE_MASK \
45115 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
45116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
45118 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
45119 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DOACROSS))
45122 static bool
45125 {
45133 {
45138 {
45140 {
45143 }
45145 {
45147 "%qs clause may only be used in compound "
45151 }
45152 tree clauses
45154 OMP_ORDERED_DEPEND_CLAUSE_MASK,
45158 }
45159 }
45161 tree clauses
45172 }
45174 /* OpenMP 2.5:
45176 section-scope:
45177 { section-sequence }
45179 section-sequence:
45180 section-directive[opt] structured-block
45181 section-sequence section-directive structured-block */
45183 static tree
45185 {
45190 matching_braces braces;
45197 != PRAGMA_OMP_SECTION
45199 {
45201 PRAGMA_OMP_SECTION);
45204 }
45207 {
45217 {
45221 }
45223 {
45226 }
45229 PRAGMA_OMP_SECTION);
45232 }
45243 }
45245 /* OpenMP 2.5:
45246 # pragma omp sections sections-clause[optseq] newline
45247 sections-scope */
45249 #define OMP_SECTIONS_CLAUSE_MASK \
45250 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45257 static tree
45260 {
45272 {
45275 }
45282 }
45284 /* OpenMP 2.5:
45285 # pragma omp parallel parallel-clause[optseq] new-line
45286 structured-block
45287 # pragma omp parallel for parallel-for-clause[optseq] new-line
45288 structured-block
45289 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
45290 structured-block
45292 OpenMP 4.0:
45293 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
45294 structured-block */
45296 #define OMP_PARALLEL_CLAUSE_MASK \
45297 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
45301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
45303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
45305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
45308 static tree
45312 {
45319 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
45325 {
45333 if_p);
45337 if_p);
45340 block);
45345 }
45346 /* When combined with distribute, parallel has to be followed by for.
45347 #pragma omp target parallel is allowed though. */
45351 {
45355 }
45357 {
45361 {
45375 block);
45378 /* masked does have just filter clause, but during gimplification
45379 isn't represented by a gimplification omp context, so for
45380 #pragma omp parallel masked don't set OMP_PARALLEL_COMBINED,
45381 so that
45382 #pragma omp parallel masked
45383 #pragma omp taskloop simd lastprivate (x)
45384 isn't confused with
45385 #pragma omp parallel masked taskloop simd lastprivate (x) */
45389 }
45391 {
45405 block);
45408 /* master doesn't have any clauses and during gimplification
45409 isn't represented by a gimplification omp context, so for
45410 #pragma omp parallel master don't set OMP_PARALLEL_COMBINED,
45411 so that
45412 #pragma omp parallel master
45413 #pragma omp taskloop simd lastprivate (x)
45414 isn't confused with
45415 #pragma omp parallel master taskloop simd lastprivate (x) */
45419 }
45421 {
45436 block);
45441 }
45443 {
45446 }
45448 {
45458 block);
45461 }
45462 }
45464 {
45467 }
45472 {
45475 }
45484 }
45486 /* OpenMP 2.5:
45487 # pragma omp single single-clause[optseq] new-line
45488 structured-block */
45490 #define OMP_SINGLE_CLAUSE_MASK \
45491 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
45494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45497 static tree
45499 {
45510 }
45512 /* OpenMP 5.1:
45513 # pragma omp scope scope-clause[optseq] new-line
45514 structured-block */
45516 #define OMP_SCOPE_CLAUSE_MASK \
45517 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45523 static tree
45525 {
45536 }
45538 /* OpenMP 3.0:
45539 # pragma omp task task-clause[optseq] new-line
45540 structured-block */
45542 #define OMP_TASK_CLAUSE_MASK \
45543 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
45545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
45546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
45550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
45551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
45553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
45555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DETACH) \
45556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_AFFINITY))
45558 static tree
45560 {
45572 }
45574 /* OpenMP 3.0:
45575 # pragma omp taskwait new-line
45577 OpenMP 5.0:
45578 # pragma omp taskwait taskwait-clause[opt] new-line */
45580 #define OMP_TASKWAIT_CLAUSE_MASK \
45581 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45584 static void
45586 {
45587 tree clauses
45592 {
45599 }
45600 else
45602 }
45604 /* OpenMP 3.1:
45605 # pragma omp taskyield new-line */
45607 static void
45609 {
45612 }
45614 /* OpenMP 4.0:
45615 # pragma omp taskgroup new-line
45616 structured-block
45618 OpenMP 5.0:
45619 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
45621 #define OMP_TASKGROUP_CLAUSE_MASK \
45622 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
45625 static tree
45627 {
45628 tree clauses
45633 if_p),
45634 clauses);
45635 }
45638 /* OpenMP 2.5:
45639 # pragma omp threadprivate (variable-list) */
45641 static void
45643 {
45644 tree vars;
45650 }
45652 /* OpenMP 4.0:
45653 # pragma omp cancel cancel-clause[optseq] new-line */
45655 #define OMP_CANCEL_CLAUSE_MASK \
45656 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
45657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
45658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
45659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
45660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
45662 static void
45664 {
45668 }
45670 /* OpenMP 4.0:
45671 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
45673 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
45674 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
45675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
45676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
45677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
45679 static bool
45682 {
45683 tree clauses;
45687 {
45692 {
45695 }
45696 }
45698 {
45702 }
45705 {
45710 else
45714 }
45717 OMP_CANCELLATION_POINT_CLAUSE_MASK,
45719 pragma_tok);
45722 }
45724 /* OpenMP 4.0:
45725 #pragma omp distribute distribute-clause[optseq] new-line
45726 for-loop */
45728 #define OMP_DISTRIBUTE_CLAUSE_MASK \
45729 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45731 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45732 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
45733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
45735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
45737 static tree
45741 {
45750 {
45758 else
45761 {
45767 {
45771 else
45774 }
45780 else
45794 }
45795 }
45797 {
45800 }
45805 {
45808 }
45820 }
45822 /* OpenMP 4.0:
45823 # pragma omp teams teams-clause[optseq] new-line
45824 structured-block */
45826 #define OMP_TEAMS_CLAUSE_MASK \
45827 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
45832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
45833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
45836 static tree
45840 {
45849 {
45853 {
45879 }
45881 {
45907 }
45908 }
45910 {
45913 }
45918 {
45921 }
45931 }
45933 /* OpenMP 4.0:
45934 # pragma omp target data target-data-clause[optseq] new-line
45935 structured-block */
45937 #define OMP_TARGET_DATA_CLAUSE_MASK \
45938 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
45942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
45944 static tree
45946 {
45948 omp_requires_mask
45951 tree clauses
45957 {
45960 {
45985 "%<#pragma omp target data%> with map-type other "
45986 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
45990 }
45995 }
45998 {
46001 "%<#pragma omp target data%> must contain at least "
46002 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
46005 }
46016 }
46018 /* OpenMP 4.5:
46019 # pragma omp target enter data target-enter-data-clause[optseq] new-line
46020 structured-block */
46022 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
46023 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46029 static bool
46032 {
46035 {
46040 {
46043 }
46044 }
46046 {
46050 }
46053 {
46059 }
46062 omp_requires_mask
46065 tree clauses
46071 {
46074 {
46107 "%<#pragma omp target enter data%> with map-type other "
46111 }
46113 }
46116 {
46119 "%<#pragma omp target enter data%> must contain at least "
46122 }
46130 }
46132 /* OpenMP 4.5:
46133 # pragma omp target exit data target-enter-data-clause[optseq] new-line
46134 structured-block */
46136 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
46137 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46143 static bool
46146 {
46149 {
46154 {
46157 }
46158 }
46160 {
46164 }
46167 {
46173 }
46176 omp_requires_mask
46179 tree clauses
46185 {
46188 {
46221 "%<#pragma omp target exit data%> with map-type other "
46222 "than %<from%>, %<tofrom%>, %<release%> or %<delete%> "
46226 }
46228 }
46231 {
46234 "%<#pragma omp target exit data%> must contain at least "
46237 }
46245 }
46247 /* OpenMP 4.0:
46248 # pragma omp target update target-update-clause[optseq] new-line */
46250 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
46251 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
46252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
46253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46258 static bool
46261 {
46263 {
46269 }
46271 tree clauses
46276 {
46278 "%<#pragma omp target update%> must contain at least one "
46281 }
46284 omp_requires_mask
46293 }
46295 /* OpenMP 4.0:
46296 # pragma omp target target-clause[optseq] new-line
46297 structured-block */
46299 #define OMP_TARGET_CLAUSE_MASK \
46300 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
46305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
46308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
46310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
46311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR)\
46312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HAS_DEVICE_ADDR))
46314 static bool
46317 {
46319 omp_requires_mask
46323 {
46335 {
46343 {
46344 tree stmt;
46346 {
46349 OMP_TARGET_CLAUSE_MASK,
46354 OMP_TARGET_CLAUSE_MASK,
46359 OMP_TARGET_CLAUSE_MASK,
46364 }
46366 }
46371 {
46375 if_p);
46380 if_p);
46385 if_p);
46389 }
46395 /* For combined target teams, ensure the num_teams and
46396 thread_limit clause expressions are evaluated on the host,
46397 before entering the target construct. */
46406 {
46409 tf_none);
46416 OMP_CLAUSE_FIRSTPRIVATE);
46421 }
46426 }
46428 {
46431 }
46433 {
46437 }
46439 {
46442 }
46444 {
46447 }
46449 {
46452 }
46453 }
46455 {
46458 }
46465 {
46471 }
46480 }
46482 /* OpenACC 2.0:
46483 # pragma acc cache (variable-list) new-line
46484 */
46486 static tree
46488 {
46489 /* Don't create location wrapper nodes within 'OMP_CLAUSE__CACHE_'
46490 clauses. */
46491 auto_suppress_location_wrappers sentinel;
46507 }
46509 /* OpenACC 2.0:
46510 # pragma acc data oacc-data-clause[optseq] new-line
46511 structured-block */
46513 #define OACC_DATA_CLAUSE_MASK \
46514 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
46521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
46526 static tree
46528 {
46541 }
46543 /* OpenACC 2.0:
46544 # pragma acc host_data <clauses> new-line
46545 structured-block */
46547 #define OACC_HOST_DATA_CLAUSE_MASK \
46548 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) \
46549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) )
46552 static tree
46554 {
46562 {
46566 }
46574 }
46576 /* OpenACC 2.0:
46577 # pragma acc declare oacc-data-clause[optseq] new-line
46578 */
46580 #define OACC_DECLARE_CLAUSE_MASK \
46581 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
46587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
46588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
46590 static tree
46592 {
46602 {
46606 }
46609 {
46613 {
46617 }
46620 {
46632 {
46634 "%qD must be a global variable in "
46636 decl);
46639 }
46644 {
46648 }
46650 {
46652 "invalid use of %<extern%> variable %qD "
46656 }
46658 {
46660 "invalid use of %<global%> variable %qD "
46664 }
46666 }
46669 /* This seems to ignore the existence of cleanup scopes?
46670 What is the meaning for local extern decls? The local
46671 extern is in this scope, but it is referring to a decl that
46672 is namespace scope. */
46675 {
46678 }
46680 {
46682 "%qD must be a variable declared in the same scope as "
46686 }
46691 {
46696 }
46699 {
46700 tree id;
46703 /* We need to mark the aliased decl, as that is the entity
46704 that is being referred to. This won't work for
46705 dependent variables, but it didn't work for them before
46706 DECL_LOCAL_DECL_P was a thing either. But then
46707 dependent local extern variable decls are as rare as
46708 hen's teeth. */
46715 else
46721 {
46724 {
46727 {
46731 }
46732 }
46733 }
46734 }
46735 }
46748 }
46750 /* OpenACC 2.0:
46751 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
46753 or
46755 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
46757 LOC is the location of the #pragma token.
46758 */
46760 #define OACC_ENTER_DATA_CLAUSE_MASK \
46761 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46768 #define OACC_EXIT_DATA_CLAUSE_MASK \
46769 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
46773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
46774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
46775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46777 static tree
46780 {
46789 {
46794 }
46801 else
46806 {
46810 }
46818 }
46820 /* OpenACC 2.0:
46821 # pragma acc loop oacc-loop-clause[optseq] new-line
46822 structured-block */
46824 #define OACC_LOOP_CLAUSE_MASK \
46825 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
46826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
46829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
46830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
46831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
46832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
46833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
46834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
46836 static tree
46839 {
46848 {
46854 }
46861 /* Later processing of combined acc loop constructs gets confused
46862 by an extra level of empty nested BIND_EXPRs, so flatten them. */
46871 }
46873 /* OpenACC 2.0:
46874 # pragma acc kernels oacc-kernels-clause[optseq] new-line
46875 structured-block
46877 or
46879 # pragma acc parallel oacc-parallel-clause[optseq] new-line
46880 structured-block
46882 OpenACC 2.6:
46884 # pragma acc serial oacc-serial-clause[optseq] new-line
46885 */
46887 #define OACC_KERNELS_CLAUSE_MASK \
46888 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46902 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46904 #define OACC_PARALLEL_CLAUSE_MASK \
46905 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46924 #define OACC_SERIAL_CLAUSE_MASK \
46925 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46934 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46936 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46941 static tree
46944 {
46945 omp_clause_mask mask;
46948 {
46966 }
46969 {
46973 {
46976 tree clauses;
46981 }
46982 }
46991 }
46993 /* OpenACC 2.0:
46994 # pragma acc update oacc-update-clause[optseq] new-line
46995 */
46997 #define OACC_UPDATE_CLAUSE_MASK \
46998 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
47000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
47001 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47002 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
47003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
47005 static tree
47007 {
47014 {
47016 "%<#pragma acc update%> must contain at least one "
47019 }
47027 }
47029 /* OpenACC 2.0:
47030 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
47032 LOC is the location of the #pragma token.
47033 */
47035 #define OACC_WAIT_CLAUSE_MASK \
47036 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
47038 static tree
47040 {
47054 }
47056 /* OpenMP 4.0:
47057 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
47059 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
47060 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
47061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
47062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
47063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
47064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
47065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
47067 static void
47071 {
47073 cp_omp_declare_simd_data data;
47075 {
47083 /* It is safe to take the address of a local variable; it will only be
47084 used while this scope is live. */
47086 }
47088 {
47090 "%<#pragma omp declare %s%> followed by "
47095 }
47097 /* Store away all pragma tokens. */
47106 {
47110 {
47123 }
47128 "%<#pragma omp declare %s%> not immediately followed by "
47133 }
47134 }
47146 /* OpenMP 5.0:
47148 trait-selector:
47149 trait-selector-name[([trait-score:]trait-property[,trait-property[,...]])]
47151 trait-score:
47152 score(score-expression) */
47154 static tree
47156 {
47158 do
47159 {
47160 tree selector;
47164 else
47165 {
47168 }
47179 {
47206 }
47208 {
47210 {
47212 {
47215 }
47216 else
47217 {
47223 }
47224 }
47229 }
47239 {
47241 {
47245 }
47247 matching_parens parens;
47255 {
47262 {
47266 matching_parens parens2;
47274 {
47286 else
47289 }
47290 }
47291 else
47295 }
47298 {
47299 tree t;
47301 do
47302 {
47305 {
47313 "constant integer expression or string "
47315 else
47317 }
47318 else
47323 else
47325 }
47331 {
47335 }
47336 else
47337 {
47340 }
47343 do
47344 {
47348 {
47351 }
47356 else
47357 {
47361 }
47367 else
47369 }
47375 {
47382 else
47384 }
47385 else
47390 {
47392 "selector may not be specified in "
47395 }
47396 properties
47398 OMP_DECLARE_SIMD_CLAUSE_MASK,
47403 }
47409 }
47413 {
47416 }
47422 else
47424 }
47428 }
47430 /* OpenMP 5.0:
47432 trait-set-selector[,trait-set-selector[,...]]
47434 trait-set-selector:
47435 trait-set-selector-name = { trait-selector[, trait-selector[, ...]] }
47437 trait-set-selector-name:
47438 constructor
47439 device
47440 implementation
47441 user */
47443 static tree
47446 {
47448 do
47449 {
47452 setp
47455 {
47474 }
47476 {
47480 }
47488 matching_braces braces;
47492 tree selectors
47495 {
47498 }
47506 else
47508 }
47514 }
47516 /* Assumption clauses:
47517 OpenMP 5.1
47518 absent (directive-name-list)
47519 contains (directive-name-list)
47520 holds (expression)
47521 no_openmp
47522 no_openmp_routines
47523 no_parallelism */
47525 static void
47528 {
47543 {
47556 {
47561 }
47563 {
47568 }
47570 {
47575 }
47577 {
47579 matching_parens parens;
47581 {
47593 }
47594 }
47596 {
47598 matching_parens parens;
47600 {
47601 do
47602 {
47605 location_t dloc
47608 {
47609 tree id;
47614 CPP_KEYWORD))
47615 {
47616 enum rid rid
47620 }
47621 else
47624 }
47627 else
47628 {
47641 else
47642 {
47647 "mentioned in both %<absent%> and "
47655 ? &absent_head
47658 "mentioned multiple times in %qs "
47665 }
47668 }
47671 else
47673 }
47680 }
47681 }
47683 {
47690 }
47691 else
47692 {
47696 }
47697 }
47699 }
47701 /* OpenMP 5.1
47702 # pragma omp assume clauses[optseq] new-line */
47704 static void
47706 {
47709 }
47711 /* OpenMP 5.1
47712 # pragma omp assumes clauses[optseq] new-line */
47714 static bool
47716 {
47719 }
47721 /* Finalize #pragma omp declare variant after a fndecl has been parsed, and put
47722 that into "omp declare variant base" attribute. */
47724 static tree
47726 tree attrs)
47727 {
47728 matching_parens parens;
47730 {
47731 fail:
47734 }
47739 cp_expr varid
47747 tree variant;
47754 else
47755 {
47756 tree ambiguous_decls;
47764 }
47768 {
47770 variant
47778 }
47793 {
47796 }
47808 {
47810 match_loc);
47819 }
47824 }
47827 /* Finalize #pragma omp declare simd clauses after direct declarator has
47828 been parsed, and put that into "omp declare simd" attribute. */
47830 static tree
47832 {
47838 {
47843 }
47848 {
47859 {
47862 pragma_tok);
47870 }
47871 else
47872 {
47874 attrs
47876 }
47878 }
47882 {
47888 {
47890 {
47897 {
47905 else
47908 }
47914 {
47916 "unknown OpenMP directive name in "
47921 }
47925 {
47927 "OpenMP directive other than %<declare simd%> "
47928 "or %<declare variant%> appertains to a "
47931 }
47934 {
47936 "mixing OpenMP directives with attribute and "
47939 }
47944 {
47947 }
47949 cp_token tok = {};
47957 tok = {};
47962 tok = {};
47974 /* Move the current source position to that of the first token
47975 in the new lexer. */
47985 {
47993 pragma_tok);
47997 cl);
48002 }
48003 else
48004 {
48006 attrs
48008 attrs);
48009 }
48012 }
48014 }
48015 else
48017 }
48023 }
48025 /* D should be DEFERRED_PARSE from omp::decl attribute. If it contains
48026 a threadprivate, groupprivate, allocate or declare target directive,
48027 return true and parse it for DECL. */
48029 bool
48031 {
48037 {
48045 else
48048 }
48054 {
48056 "unknown OpenMP directive name in "
48059 }
48061 /* && dir->id != PRAGMA_OMP_GROUPPRIVATE */
48075 cp_token tok = {};
48083 tok = {};
48088 tok = {};
48100 /* Move the current source position to that of the first token in the
48101 new lexer. */
48106 }
48108 /* Helper for cp_parser_omp_declare_target, handle one to or link clause
48109 on #pragma omp declare target. Return false if errors were reported. */
48111 static bool
48113 {
48116 tree id;
48118 {
48121 }
48122 else
48125 {
48128 "%qD specified both in declare target %<link%> and %qs"
48130 else
48132 "%qD specified both in declare target %<link%> and "
48135 }
48137 {
48144 {
48147 {
48151 }
48152 }
48153 }
48157 {
48161 {
48164 }
48165 }
48167 {
48171 {
48174 }
48175 }
48177 }
48179 /* OpenMP 4.0:
48180 # pragma omp declare target new-line
48181 declarations and definitions
48182 # pragma omp end declare target new-line
48184 OpenMP 4.5:
48185 # pragma omp declare target ( extended-list ) new-line
48187 # pragma omp declare target declare-target-clauses[seq] new-line */
48189 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
48190 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
48191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ENTER) \
48192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
48193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE))
48195 static void
48197 {
48204 clauses
48209 {
48211 clauses);
48214 }
48215 else
48216 {
48217 cp_omp_declare_target_attr a
48222 }
48227 {
48240 device_type);
48241 }
48245 }
48247 /* OpenMP 5.1
48248 # pragma omp begin assumes clauses[optseq] new-line
48250 # pragma omp begin declare target clauses[optseq] new-line */
48252 #define OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK \
48253 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE)
48255 static void
48257 {
48261 {
48264 }
48266 {
48270 {
48273 }
48275 {
48277 tree clauses
48279 OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK,
48281 pragma_tok);
48286 cp_omp_declare_target_attr a
48289 }
48290 else
48291 {
48294 }
48295 }
48297 {
48302 }
48303 else
48304 {
48307 }
48308 }
48310 /* OpenMP 4.0:
48311 # pragma omp end declare target new-line
48313 OpenMP 5.1:
48314 # pragma omp end assumes new-line */
48316 static void
48318 {
48322 {
48325 }
48327 {
48331 {
48334 }
48337 else
48338 {
48342 }
48346 "%<#pragma omp end declare target%> without corresponding "
48347 "%<#pragma omp declare target%> or "
48349 else
48350 {
48351 cp_omp_declare_target_attr
48354 {
48357 "%qs in attribute syntax terminated "
48362 else
48364 "%qs in pragma syntax terminated "
48369 }
48370 }
48371 }
48373 {
48380 else
48381 {
48382 cp_omp_begin_assumes_data
48385 {
48388 "%qs in attribute syntax terminated "
48391 else
48393 "%qs in pragma syntax terminated "
48396 }
48397 }
48398 }
48399 else
48400 {
48404 }
48405 }
48407 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
48408 expression and optional initializer clause of
48409 #pragma omp declare reduction. We store the expression(s) as
48410 either 3, 6 or 7 special statements inside of the artificial function's
48411 body. The first two statements are DECL_EXPRs for the artificial
48412 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
48413 expression that uses those variables.
48414 If there was any INITIALIZER clause, this is followed by further statements,
48415 the fourth and fifth statements are DECL_EXPRs for the artificial
48416 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
48417 constructor variant (first token after open paren is not omp_priv),
48418 then the sixth statement is a statement with the function call expression
48419 that uses the OMP_PRIV and optionally OMP_ORIG variable.
48420 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
48421 to initialize the OMP_PRIV artificial variable and there is seventh
48422 statement, a DECL_EXPR of the OMP_PRIV statement again. */
48424 static bool
48426 {
48438 tree combiner;
48459 {
48462 }
48465 {
48467 matching_parens parens;
48473 {
48476 }
48492 {
48496 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
48500 == CPP_CLOSE_PAREN
48503 {
48507 }
48513 }
48514 else
48515 {
48517 /* Don't create location wrapper nodes here. */
48518 auto_suppress_location_wrappers sentinel;
48533 {
48538 }
48540 tree arg;
48553 }
48566 }
48570 UNKNOWN_LOCATION);
48573 }
48575 /* OpenMP 4.0
48576 #pragma omp declare reduction (reduction-id : typename-list : expression) \
48577 initializer-clause[opt] new-line
48579 initializer-clause:
48580 initializer (omp_priv initializer)
48581 initializer (function-name (argument-list)) */
48583 static void
48586 {
48596 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
48603 {
48635 }
48647 /* Types may not be defined in declare reduction type list. */
48650 parser->type_definition_forbidden_message
48656 saved_colon_doesnt_start_class_def_p
48661 {
48665 ;
48683 else
48688 else
48690 }
48692 /* Restore the saved message. */
48695 parser->colon_doesnt_start_class_def_p
48700 {
48701 fail:
48704 }
48710 {
48711 tree fntype
48714 NULL_TREE);
48731 {
48735 }
48741 {
48744 }
48746 {
48748 {
48754 }
48761 }
48762 else
48763 {
48766 /* We should never meet a matched duplicate decl. */
48768 }
48773 else
48776 {
48779 }
48787 else
48788 {
48792 }
48797 {
48805 }
48813 }
48817 done:
48818 /* Free any declarators allocated. */
48820 }
48822 /* OpenMP 4.0
48823 #pragma omp declare simd declare-simd-clauses[optseq] new-line
48824 #pragma omp declare reduction (reduction-id : typename-list : expression) \
48825 initializer-clause[opt] new-line
48826 #pragma omp declare target new-line
48828 OpenMP 5.0
48829 #pragma omp declare variant (identifier) match (context-selector) */
48831 static bool
48834 {
48836 {
48841 {
48846 }
48848 {
48853 }
48856 {
48859 context);
48861 }
48863 {
48866 }
48868 {
48872 }
48873 }
48878 }
48880 /* OpenMP 5.0
48881 #pragma omp requires clauses[optseq] new-line */
48883 static bool
48885 {
48890 {
48896 {
48911 {
48914 matching_parens parens;
48916 {
48918 {
48923 this_req
48926 this_req
48929 this_req
48931 }
48933 {
48935 "expected %<seq_cst%>, %<relaxed%> or "
48938 {
48945 CPP_CLOSE_PAREN))
48948 }
48949 }
48950 else
48957 /*consume_paren=*/
48961 {
48964 }
48965 }
48967 }
48968 else
48969 {
48971 "%<unified_shared_memory%>, "
48972 "%<dynamic_allocators%>, "
48973 "%<reverse_offload%> "
48977 }
48981 {
48983 {
48990 }
48992 {
48996 }
48999 {
49002 this_req
49004 (omp_requires_mask
49006 }
49010 "lexically after first %<atomic%> construct "
49013 omp_requires_mask
49016 }
49017 }
49019 }
49025 }
49028 /* OpenMP 5.1:
49029 #pragma omp nothing new-line */
49031 static void
49033 {
49035 }
49038 /* OpenMP 5.1
49039 #pragma omp error clauses[optseq] new-line */
49041 static bool
49044 {
49052 {
49065 };
49073 {
49076 }
49078 {
49083 }
49087 matching_parens parens;
49089 {
49091 {
49095 else
49097 tf_warning_or_error,
49098 LOOKUP_NORMAL);
49099 }
49100 else
49101 {
49103 {
49111 }
49113 {
49118 {
49125 CPP_CLOSE_PAREN))
49128 }
49129 }
49130 else
49132 }
49138 /*consume_paren=*/
49142 {
49144 {
49147 }
49148 else
49150 }
49152 {
49154 {
49157 }
49158 else
49160 }
49161 }
49162 else
49164 }
49174 {
49176 {
49180 }
49181 tree fndecl
49190 }
49197 {
49201 }
49205 else
49209 }
49211 /* OpenMP 4.5:
49212 #pragma omp taskloop taskloop-clause[optseq] new-line
49213 for-loop
49215 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
49216 for-loop */
49218 #define OMP_TASKLOOP_CLAUSE_MASK \
49219 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
49220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
49221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
49222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
49223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
49224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
49225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
49226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
49227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
49228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
49229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
49230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
49231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
49232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
49233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
49234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
49235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
49237 static tree
49241 {
49248 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
49249 clause. */
49254 {
49259 {
49283 }
49284 }
49286 {
49289 }
49294 {
49297 }
49304 if_p);
49310 }
49313 /* OpenACC 2.0:
49314 # pragma acc routine oacc-routine-clause[optseq] new-line
49315 function-definition
49317 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
49318 */
49320 #define OACC_ROUTINE_CLAUSE_MASK \
49321 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
49322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
49323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
49324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
49325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NOHOST) )
49327 /* Parse the OpenACC routine pragma. This has an optional '( name )'
49328 component, which must resolve to a declared namespace-scope
49329 function. The clauses are either processed directly (for a named
49330 function), or defered until the immediatley following declaration
49331 is parsed. */
49333 static void
49336 {
49338 /* The checking for "another pragma following this one" in the "no optional
49339 '( name )'" case makes sure that we dont re-enter. */
49342 cp_oacc_routine_data data;
49348 /* It is safe to take the address of a local variable; it will only be
49349 used while this scope is live. */
49352 /* Look for optional '( name )'. */
49354 {
49355 matching_parens parens;
49358 /* We parse the name as an id-expression. If it resolves to
49359 anything other than a non-overloaded function at namespace
49360 scope, it's an error. */
49376 {
49380 }
49382 data.clauses
49386 /* The clauses are in reverse order; fix that to make later diagnostic
49387 emission easier. */
49393 {
49398 }
49400 /* Perhaps we should use the same rule as declarations in different
49401 namespaces? */
49403 {
49408 }
49411 {
49415 }
49419 }
49421 {
49422 /* Store away all pragma tokens. */
49430 /* Emit a helpful diagnostic if there's another pragma following this
49431 one. */
49433 {
49436 /* ..., and then just keep going. */
49438 }
49440 /* We only have to consider the pragma_external case here. */
49445 else
49448 }
49449 }
49451 /* Finalize #pragma acc routine clauses after direct declarator has
49452 been parsed. */
49454 static tree
49456 {
49461 {
49463 "%<#pragma acc routine%> not immediately followed by "
49466 }
49482 /* The clauses are in reverse order; fix that to make later diagnostic
49483 emission easier. */
49486 /* Later, cp_finalize_oacc_routine will process the clauses. */
49490 }
49492 /* Apply any saved OpenACC routine clauses to a just-parsed
49493 declaration. */
49495 static void
49497 {
49499 {
49500 /* Keep going if we're in error reporting mode. */
49506 {
49508 {
49510 "%<#pragma acc routine%> not immediately followed by"
49514 }
49518 }
49520 int compatible
49525 {
49528 }
49530 {
49531 }
49532 else
49533 {
49535 {
49544 }
49546 /* Set the routine's level of parallelism. */
49550 /* Add an "omp declare target" attribute. */
49555 }
49556 }
49557 }
49559 /* Main entry point to OpenMP statement pragmas. */
49561 static void
49563 {
49564 tree stmt;
49569 {
49597 if_p);
49617 if_p);
49622 if_p);
49627 if_p);
49632 if_p);
49637 if_p);
49642 if_p);
49654 if_p);
49668 if_p);
49673 if_p);
49680 }
49683 }
49684 \f
49685 /* Transactional Memory parsing routines. */
49687 /* Parse a transaction attribute.
49689 txn-attribute:
49690 attribute
49691 [ [ identifier ] ]
49693 We use this instead of cp_parser_attributes_opt for transactions to avoid
49694 the pedwarn in C++98 mode. */
49696 static tree
49698 {
49713 {
49717 /* For keywords, use the canonical spelling,
49718 not the parsed identifier. */
49722 }
49723 else
49727 error1:
49730 }
49732 /* Parse a __transaction_atomic or __transaction_relaxed statement.
49734 transaction-statement:
49735 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
49736 compound-statement
49737 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
49738 */
49740 static tree
49742 {
49753 else
49754 {
49758 }
49760 /* Parse a noexcept specification. */
49764 {
49765 /* cancel-and-throw is unimplemented. */
49768 }
49769 else
49771 CP_PARSER_FLAGS_NONE,
49776 /* Keep track if we're in the lexical scope of an outer transaction. */
49788 }
49790 /* Parse a __transaction_atomic or __transaction_relaxed expression.
49792 transaction-expression:
49793 __transaction_atomic txn-noexcept-spec[opt] ( expression )
49794 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
49795 */
49797 static tree
49799 {
49812 keyword == RID_TRANSACTION_RELAXED
49826 /* Set this early. This might mean that we allow transaction_cancel in
49827 an expression that we find out later actually has to be a constexpr.
49828 However, we expect that cxx_constant_value will be able to deal with
49829 this; also, if the noexcept has no constexpr, then what we parse next
49830 really is a transaction's body. */
49833 /* Parse a noexcept specification. */
49835 CP_PARSER_FLAGS_NONE,
49842 {
49843 matching_parens parens;
49850 }
49851 else
49852 {
49853 /* The only expression that is available got parsed for the noexcept
49854 already. noexcept is true then. */
49857 }
49866 }
49868 /* Parse a function-transaction-block.
49870 function-transaction-block:
49871 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
49872 function-body
49873 __transaction_atomic txn-attribute[opt] function-try-block
49874 __transaction_relaxed ctor-initializer[opt] function-body
49875 __transaction_relaxed function-try-block
49876 */
49878 static void
49880 {
49895 else
49896 {
49900 }
49908 else
49909 cp_parser_ctor_initializer_opt_and_function_body
49915 }
49917 /* Parse a __transaction_cancel statement.
49919 cancel-statement:
49920 __transaction_cancel txn-attribute[opt] ;
49921 __transaction_cancel txn-attribute[opt] throw-expression ;
49923 ??? Cancel and throw is not yet implemented. */
49925 static tree
49927 {
49933 RT_TRANSACTION_CANCEL);
49940 /* ??? Parse cancel-and-throw here. */
49945 {
49949 }
49951 {
49955 }
49957 {
49960 {
49966 }
49967 }
49969 {
49973 }
49979 }
49980 \f
49982 /* Special handling for the first token or line in the file. The first
49983 thing in the file might be #pragma GCC pch_preprocess, which loads a
49984 PCH file, which is a GC collection point. So we need to handle this
49985 first pragma without benefit of an existing lexer structure.
49987 Always returns one token to the caller in *FIRST_TOKEN. This is
49988 either the true first token of the file, or the first token after
49989 the initial pragma. */
49991 static void
49993 {
50001 {
50005 }
50007 /* Skip to the end of the pragma. */
50009 {
50012 do
50015 }
50017 /* Now actually load the PCH file. */
50021 /* Read one more token to return to our caller. We have to do this
50022 after reading the PCH file in, since its pointers have to be
50023 live. */
50025 }
50027 /* Parse a pragma GCC ivdep. */
50029 static bool
50031 {
50034 }
50036 /* Parse a pragma GCC unroll. */
50038 static unsigned short
50040 {
50050 {
50052 " assignment-expression that evaluates to a non-negative"
50055 }
50056 else
50057 {
50061 }
50064 }
50066 /* Parse a pragma GCC novector. */
50068 static bool
50070 {
50073 }
50075 /* Normal parsing of a pragma token. Here we can (and must) use the
50076 regular lexer. */
50078 static bool
50080 {
50083 tree stmt;
50095 {
50101 }
50105 {
50113 {
50124 }
50129 {
50140 }
50145 {
50156 }
50161 {
50173 }
50178 {
50190 }
50195 {
50207 }
50226 {
50232 }
50240 {
50246 }
50254 {
50259 }
50265 {
50271 }
50279 {
50285 }
50327 {
50329 "%<#pragma omp requires%> may only be used at file or "
50333 }
50338 {
50340 "%<#pragma omp assumes%> may only be used at file or "
50344 }
50380 "%<#pragma omp scan%> may only be used in "
50386 "%<#pragma omp section%> may only be used in "
50393 {
50400 {
50412 }
50415 {
50418 pragma_str);
50420 }
50424 do
50425 {
50427 {
50429 {
50434 }
50436 {
50441 }
50443 {
50448 }
50452 }
50455 }
50462 {
50465 }
50468 }
50475 bad_stmt:
50478 }
50482 }
50484 /* Helper for pragma_lex in preprocess-only mode; in this mode, we have not
50485 populated the lexer with any tokens (the tokens rather being read by
50486 c-ppoutput.c's machinery), so we need to read enough tokens now to handle
50487 a pragma. */
50488 static void
50490 {
50495 /* Read the rest of the tokens comprising the pragma line. */
50497 do
50498 {
50505 }
50507 /* The interface the pragma parsers have to the lexer. */
50509 enum cpp_ttype
50511 {
50527 else
50528 {
50532 }
50535 }
50537 void
50539 {
50540 /* We have already read all the tokens, so we just need to discard
50541 them here. */
50545 }
50547 \f
50548 /* External interface. */
50550 /* Parse one entire translation unit. */
50552 void
50554 {
50562 /* cp_lexer_new_main is called before doing any GC allocation
50563 because tokenization might load a PCH file. */
50572 }
50574 /* Create an identifier for a generic parameter type (a synthesized
50575 template parameter implied by `auto' or a concept identifier). */
50578 static tree
50580 {
50584 }
50586 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
50587 (creating a new template parameter list if necessary). Returns the newly
50588 created template type parm. */
50590 static tree
50592 {
50593 /* A requires-clause is not a function and cannot have placeholders. */
50595 {
50598 }
50602 /* We are either continuing a function template that already contains implicit
50603 template parameters, creating a new fully-implicit function template, or
50604 extending an existing explicit function template with implicit template
50605 parameters. */
50613 {
50617 }
50618 else
50619 {
50620 /* Roll back to the existing template parameter scope (in the case of
50621 extending an explicit function template) or introduce a new template
50622 parameter scope ahead of the function parameter scope (or class scope
50623 in the case of out-of-line member definitions). The function scope is
50624 added back after template parameter synthesis below. */
50629 {
50632 }
50634 {
50635 /* If not defining a class, then any class scope is a scope level in
50636 an out-of-line member definition. In this case simply wind back
50637 beyond the first such scope to inject the template parameter list.
50638 Otherwise wind back to the class being defined. The latter can
50639 occur in class member friend declarations such as:
50641 class A {
50642 void foo (auto);
50643 };
50644 class B {
50645 friend void A::foo (auto);
50646 };
50648 The template parameter list synthesized for the friend declaration
50649 must be injected in the scope of 'B'. This can also occur in
50650 erroneous cases such as:
50652 struct A {
50653 struct B {
50654 void foo (auto);
50655 };
50656 void B::foo (auto) {}
50657 };
50659 Here the attempted definition of 'B::foo' within 'A' is ill-formed
50660 but, nevertheless, the template parameter list synthesized for the
50661 declarator should be injected into the scope of 'A' as if the
50662 ill-formed template was specified explicitly. */
50665 {
50668 }
50669 }
50675 {
50676 /* Introduce a new template parameter list for implicit template
50677 parameters. */
50681 parser->implicit_template_scope
50688 }
50689 else
50690 {
50691 /* Synthesize implicit template parameters at the end of the explicit
50692 template parameter list. */
50699 parser->implicit_template_parms
50701 }
50702 }
50704 /* Synthesize a new template parameter and track the current template
50705 parameter chain with implicit_template_parms. */
50711 /* Synthesize the type template parameter. */
50719 /* Attach the constraint to the parm before processing. */
50722 tree new_parm
50724 input_location,
50725 node,
50728 // Process_template_parm returns the list of parms, and
50729 // parser->implicit_template_parms holds the final node of the parm
50730 // list. We really want to manipulate the newly appended element.
50737 // Record the last implicit parm node
50740 /* Mark the synthetic declaration "virtual". This is used when
50741 comparing template-heads to determine if whether an abbreviated
50742 function template is equivalent to an explicit template.
50744 Note that DECL_ARTIFICIAL is used elsewhere for template
50745 parameters. */
50751 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
50754 /* If creating a fully implicit function template, start the new implicit
50755 template parameter list with this synthesized type, otherwise grow the
50756 current template parameter list. */
50759 {
50765 }
50766 else
50767 {
50772 }
50774 /* If the new parameter was constrained, we need to add that to the
50775 constraints in the template parameter list. */
50777 {
50781 }
50786 }
50788 /* Finish the declaration of a fully implicit function template. Such a
50789 template has no explicit template parameter list so has not been through the
50790 normal template head and tail processing. synthesize_implicit_template_parm
50791 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
50792 provided if the declaration is a class member such that its template
50793 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
50794 form is returned. Otherwise NULL_TREE is returned. */
50796 static tree
50798 {
50803 {
50807 }
50819 }
50821 /* Like finish_fully_implicit_template, but to be used in error
50822 recovery, rearranging scopes so that we restore the state we had
50823 before synthesize_implicit_template_parm inserted the implement
50824 template parms scope. */
50826 static void
50828 {
50833 {
50842 }
50843 else
50849 }
50851 /* Helper function for diagnostics that have complained about things
50852 being used with 'extern "C"' linkage.
50854 Attempt to issue a note showing where the 'extern "C"' linkage began. */
50856 void
50858 {
50862 }