| blob | 26734beacce6662bc16a77ec4c29ea4b0fc64d4e |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2024 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
258 static tree cp_parser_late_noexcept_specifier
260 static void noexcept_override_late_checks
263 static void cp_parser_initial_pragma
266 static bool cp_parser_omp_declare_reduction_exprs
268 static void cp_finalize_oacc_routine
271 static void check_omp_intervening_code
275 /* Manifest constants. */
276 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
277 #define CP_SAVED_TOKEN_STACK 5
279 /* Variables. */
281 /* The stream to which debugging output should be written. */
284 /* Nonzero if we are parsing an unevaluated operand: an operand to
285 sizeof, typeof, or alignof. */
288 /* Dump up to NUM tokens in BUFFER to FILE starting with token
289 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
290 first token in BUFFER. If NUM is 0, dump all the tokens. If
291 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
292 highlighted by surrounding it in [[ ]]. */
294 static void
298 {
315 {
318 }
323 {
330 nprinted++;
340 {
350 }
351 }
354 {
357 }
360 }
363 /* Dump all tokens in BUFFER to stderr. */
365 void
367 {
369 }
371 DEBUG_FUNCTION void
373 {
375 }
377 DEBUG_FUNCTION void
379 {
382 else
384 }
387 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
388 description for T. */
390 static void
392 {
394 {
397 }
398 }
401 /* Dump parser context C to FILE. */
403 static void
405 {
410 }
413 /* Print the stack of parsing contexts to FILE starting with FIRST. */
415 static void
417 {
423 {
426 }
427 }
430 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
432 static void
434 {
437 }
440 /* Print an unparsed function entry UF to FILE. */
442 static void
444 {
447 tree fn;
452 i++)
453 {
459 }
464 {
467 }
473 {
476 }
478 }
481 /* Print the stack of unparsed member functions S to FILE. */
483 static void
486 {
492 {
495 }
496 }
499 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
500 the given PARSER. If FILE is NULL, the output is printed on stderr. */
502 static void
504 {
516 next_token);
517 }
520 /* Dump debugging information for the given PARSER. If FILE is NULL,
521 the output is printed on stderr. */
523 void
525 {
528 expanded_location eloc;
595 parser->type_definition_forbidden_message_arg
611 }
613 DEBUG_FUNCTION void
615 {
617 }
619 DEBUG_FUNCTION void
621 {
624 else
626 }
628 /* Allocate memory for a new lexer object and return it. */
632 {
633 /* Allocate the memory. */
636 /* Initially we are not debugging. */
641 /* Create the buffer. */
645 }
647 /* Return TRUE if token is the start of a module declaration that will be
648 terminated by a CPP_PRAGMA_EOL token. */
651 {
655 }
657 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
658 PRAGMA_NONE. */
660 static enum pragma_kind
662 {
665 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
667 }
669 /* Handle early pragmas such as #pragma GCC diagnostic, which needs to be done
670 during preprocessing for the case of preprocessing-related diagnostics. This
671 is called immediately after pushing the CPP_PRAGMA_EOL token onto
672 lexer->buffer. */
674 static void
676 {
680 /* Back up to the start of the pragma so pragma_lex () can parse it when
681 c-pragma lib asks it to. */
685 {
690 }
696 /* Dispatch it. */
697 const unsigned int id
702 /* Reset to normal state. */
704 }
706 /* The parser. */
710 /* Create a new main C++ lexer, the lexer that gets tokens from the
711 preprocessor, and also create the main parser. */
715 {
716 cp_token token;
718 /* It's possible that parsing the first pragma will load a PCH file,
719 which is a GC collection point. So we have to do that before
720 allocating any memory. */
726 /* Put the first token in the buffer. */
733 /* Create the parser now, so we can use it to handle early pragmas. */
737 /* Get the remaining tokens from the preprocessor. */
739 {
741 /* Process the previous token. */
745 /* Check for early pragmas that need to be handled now. */
751 }
759 {
760 /* Set the EOF token's location to be the just after the previous
761 token's range. That way 'at-eof' diagnostics point at something
762 meaninful. */
766 }
771 /* Subsequent preprocessor diagnostics should use compiler
772 diagnostic functions to get the compiler source location. */
777 /* If we processed any #pragma GCC target directives, we handled them early so
778 any macros they defined would be effective during preprocessing. Now, we
779 need to reset to the default state to begin compilation, and we will
780 process them again at the correct time as needed. */
785 }
787 /* Create a lexer and parser to be used during preprocess-only mode.
788 This will be filled with tokens to parse when needed by pragma_lex (). */
789 void
791 {
794 }
796 /* Create a new lexer whose token stream is primed with the tokens in
797 CACHE. When these tokens are exhausted, no new tokens will be read. */
801 {
806 /* We do not own the buffer. */
809 /* Insert an EOF token. */
820 /* Initially we are not debugging. */
826 }
828 /* Frees all resources associated with LEXER. */
830 static void
832 {
835 else
836 {
837 /* Restore the token we overwrite with EOF. */
840 }
843 }
845 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
846 be used. The point of this flag is to help the compiler to fold away calls
847 to cp_lexer_debugging_p within this source file at compile time, when the
848 lexer is not being debugged. */
850 #define LEXER_DEBUGGING_ENABLED_P false
852 /* Returns nonzero if debugging information should be output. */
856 {
861 }
866 {
868 }
872 {
874 }
878 {
880 }
884 {
886 }
890 {
893 /* Skip past purged tokens. */
895 {
897 tp--;
898 }
901 }
903 /* Same as above, but return NULL when the lexer doesn't own the token
904 buffer or if the next_token is at the start of the token
905 vector or if all previous tokens are purged. */
909 {
912 {
915 /* Skip past purged tokens. */
917 {
920 tp--;
921 }
923 }
926 }
928 /* Overload for make_location, taking the lexer to mean the location of the
929 previous token. */
933 {
936 }
938 /* Overload for make_location taking tokens instead of locations. */
942 {
944 }
946 /* nonzero if we are presently saving tokens. */
950 {
952 }
954 /* Store the next token from the preprocessor in *TOKEN. Return true
955 if we reach EOF. If LEXER is NULL, assume we are handling an
956 initial #pragma pch_preprocess, and thus want the lexer to return
957 processed strings.
959 Diagnostics issued from this function must have their controlling option (if
960 any) in c.opt annotated as a libcpp option via the CppReason property. */
962 static void
964 {
967 /* Get a new token from the preprocessor. */
968 token->type
970 flags);
975 /* Usually never see a zero, but just in case ... */
978 /* On some systems, some header files are surrounded by an
979 implicit extern "C" block. Set a flag in the token if it
980 comes from such a header. */
985 /* Check to see if this token is a keyword. */
987 {
989 {
990 /* Mark this token as a keyword. */
992 /* Record which keyword. */
994 }
995 else
996 {
1000 /* These are outside the CXX11 range. */
1004 {
1005 /* Warn about the C++11 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 }
1018 {
1019 /* Warn about the C++20 keyword (but still treat it as
1020 an identifier). */
1025 /* Clear out the C_RID_CODE so we don't warn about this
1026 particular identifier-turned-keyword again. */
1028 }
1031 }
1032 }
1034 {
1035 /* This only happens in Objective-C++; it must be a keyword. */
1038 {
1039 /* Replace 'class' with '@class', 'private' with '@private',
1040 etc. This prevents confusion with the C++ keyword
1041 'class', and makes the tokens consistent with other
1042 Objective-C 'AT' keywords. For example '@class' is
1043 reported as RID_AT_CLASS which is consistent with
1044 '@synchronized', which is reported as
1045 RID_AT_SYNCHRONIZED.
1046 */
1056 }
1057 }
1058 }
1060 /* Update the globals input_location and the input file stack from TOKEN. */
1063 {
1065 }
1067 /* Update the globals input_location and the input file stack from LEXER. */
1070 {
1073 }
1075 /* Return a pointer to the next token in the token stream, but do not
1076 consume it. */
1080 {
1082 {
1086 }
1088 }
1090 /* Return true if the next token has the indicated TYPE. */
1094 {
1096 }
1098 /* Return true if the next token does not have the indicated TYPE. */
1102 {
1104 }
1106 /* Return true if the next token is the indicated KEYWORD. */
1110 {
1112 }
1116 {
1118 }
1122 {
1124 }
1126 /* Return true if KEYWORD can start a decl-specifier. */
1128 bool
1130 {
1132 {
1133 /* auto specifier: storage-class-specifier in C++,
1134 simple-type-specifier in C++0x. */
1136 /* Storage classes. */
1142 /* Elaborated type specifiers. */
1148 /* Simple type specifiers. */
1162 CASE_RID_FLOATN_NX:
1164 /* CV qualifiers. */
1167 /* Function specifiers. */
1170 /* friend/typdef/inline specifiers. */
1174 /* GNU extensions. */
1176 /* C++11 extensions. */
1179 /* C++20 extensions. */
1190 }
1191 }
1193 /* Peeks the corresponding built-in trait if the first token is
1194 a built-in trait and the second token is either `(' or `<' depending
1195 on the trait. Otherwise, returns nullptr. */
1199 {
1202 {
1206 /* Check if the subsequent token is a `<' token to
1207 __type_pack_element or is a `(' token to everything else. */
1215 }
1217 }
1219 /* Similarly, but only if the token is an expression-yielding
1220 built-in trait. */
1224 {
1230 }
1232 /* Similarly, but only if the token is a type-yielding
1233 built-in trait. */
1237 {
1243 }
1245 /* Return true if the next token is a keyword for a decl-specifier. */
1247 static bool
1249 {
1257 }
1259 /* Returns TRUE iff the token T begins a decltype type. */
1261 static bool
1263 {
1266 }
1268 /* Returns TRUE iff the next token begins a decltype type. */
1270 static bool
1272 {
1275 }
1277 /* Called when processing a token with tree_check_value; perform or defer the
1278 associated checks and return the value. */
1280 static tree
1282 {
1283 /* Perform any access checks that were deferred. */
1288 {
1294 }
1295 /* Return the stored value. */
1297 }
1299 /* Return a pointer to the Nth token in the token stream. If N is 1,
1300 then this is precisely equivalent to cp_lexer_peek_token (except
1301 that it is not inline). One would like to disallow that case, but
1302 there is one case (cp_parser_nth_token_starts_template_id) where
1303 the caller passes a variable for N and it might be 1. */
1307 {
1310 /* N is 1-based, not zero-based. */
1321 {
1325 }
1328 {
1331 }
1334 }
1336 /* Return the next token, and advance the lexer's next_token pointer
1337 to point to the next non-purged token. */
1341 {
1344 do
1345 {
1348 }
1353 /* Provide debugging output. */
1355 {
1359 }
1362 }
1364 /* Permanently remove the next token from the token stream, and
1365 advance the next_token pointer to refer to the next non-purged
1366 token. */
1368 static void
1370 {
1379 do
1380 tok++;
1383 }
1385 /* Permanently remove all tokens after TOK, up to, but not
1386 including, the token that will be returned next by
1387 cp_lexer_peek_token. */
1389 static void
1391 {
1397 {
1402 }
1403 }
1405 /* Begin saving tokens. All tokens consumed after this point will be
1406 preserved. */
1408 static void
1410 {
1411 /* Provide debugging output. */
1416 }
1418 /* Commit to the portion of the token stream most recently saved. */
1420 static void
1422 {
1423 /* Provide debugging output. */
1428 }
1430 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1431 to the token stream. Stop saving tokens. */
1433 static void
1435 {
1436 /* Provide debugging output. */
1441 }
1443 /* Determines what saved_token_sentinel does when going out of scope. */
1446 STS_COMMIT,
1447 STS_ROLLBACK,
1448 STS_DONOTHING
1449 };
1451 /* RAII wrapper around the above functions, with sanity checking (the token
1452 stream should be the same at the point of instantiation as it is at the
1453 point of destruction).
1455 Creating a variable saves tokens. MODE determines what happens when the
1456 object is destroyed. STS_COMMIT commits tokens (default),
1457 STS_ROLLBACK rolls-back and STS_DONOTHING does nothing. Calling
1458 rollback() will immediately roll-back tokens and set MODE to
1459 STS_DONOTHING. */
1461 struct saved_token_sentinel
1462 {
1465 saved_token_sentinel_mode mode;
1469 {
1472 }
1474 {
1476 cp_lexer_set_source_position_from_token
1479 }
1481 {
1488 }
1489 };
1491 /* Print a representation of the TOKEN on the STREAM. */
1493 static void
1495 {
1496 /* We don't use cpp_type2name here because the parser defines
1497 a few tokens of its own. */
1499 /* cpplib-defined token types */
1500 #define OP(e, s) #e,
1501 #define TK(e, s) #e,
1502 TTYPE_TABLE
1503 #undef OP
1504 #undef TK
1505 /* C++ parser token types - see "Manifest constants", above. */
1509 };
1511 /* For some tokens, print the associated data. */
1513 {
1515 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1516 For example, `struct' is mapped to an INTEGER_CST. */
1519 /* fall through */
1537 /* If we have a name for the token, print it out. Otherwise, we
1538 simply give the numeric code. */
1541 else
1544 }
1545 }
1547 DEBUG_FUNCTION void
1549 {
1552 }
1554 DEBUG_FUNCTION void
1556 {
1559 else
1561 }
1564 /* Start emitting debugging information. */
1566 static void
1568 {
1575 }
1577 /* Stop emitting debugging information. */
1579 static void
1581 {
1588 }
1590 /* Create a new cp_token_cache, representing a range of tokens. */
1594 {
1599 }
1601 /* Diagnose if #pragma omp declare simd isn't followed immediately
1602 by function declaration or definition. */
1606 {
1608 {
1613 }
1614 }
1616 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1617 and put that into "omp declare simd" attribute. */
1621 {
1623 {
1625 {
1628 }
1630 {
1633 }
1634 }
1635 }
1637 /* Similarly, but for use in declaration parsing functions
1638 which call cp_parser_handle_directive_omp_attributes. */
1642 {
1649 "%<declare %s%> directive not immediately followed by "
1653 }
1655 /* Diagnose if #pragma acc routine isn't followed immediately by function
1656 declaration or definition. */
1660 {
1662 {
1664 "%<#pragma acc routine%> not immediately followed by "
1667 }
1668 }
1669 \f
1670 /* Decl-specifiers. */
1672 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1674 static void
1676 {
1678 }
1680 /* Declarators. */
1682 /* Nothing other than the parser should be creating declarators;
1683 declarators are a semi-syntactic representation of C++ entities.
1684 Other parts of the front end that need to create entities (like
1685 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1699 /* An erroneous declarator. */
1702 /* The obstack on which declarators and related data structures are
1703 allocated. */
1706 /* Alloc BYTES from the declarator memory pool. */
1710 {
1712 }
1714 /* Allocate a declarator of the indicated KIND. Clear fields that are
1715 common to all declarators. */
1719 {
1733 }
1735 /* Make a declarator for a generalized identifier. If
1736 QUALIFYING_SCOPE is non-NULL, the identifier is
1737 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1738 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1739 is, if any. */
1744 {
1747 /* It is valid to write:
1749 class C { void f(); };
1750 typedef C D;
1751 void D::f();
1753 The standard is not clear about whether `typedef const C D' is
1754 legal; as of 2002-09-15 the committee is considering that
1755 question. EDG 3.0 allows that syntax. Therefore, we do as
1756 well. */
1771 }
1773 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1774 of modifiers such as const or volatile to apply to the pointer
1775 type, represented as identifiers. ATTRIBUTES represent the attributes that
1776 appertain to the pointer or reference. */
1778 cp_declarator *
1780 tree attributes)
1781 {
1789 {
1793 }
1794 else
1800 }
1802 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1803 represent the attributes that appertain to the pointer or
1804 reference. */
1806 cp_declarator *
1809 {
1817 {
1821 }
1822 else
1828 }
1830 /* Like make_pointer_declarator -- but for a pointer to a non-static
1831 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1832 appertain to the pointer or reference. */
1834 cp_declarator *
1837 tree attributes)
1838 {
1847 {
1850 }
1851 else
1857 }
1859 /* Make a declarator for the function given by TARGET, with the
1860 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1861 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1862 indicates what exceptions can be thrown. STD_ATTRS contains
1863 attributes that appertain to the function type. */
1865 cp_declarator *
1867 tree parms,
1868 cp_cv_quals cv_qualifiers,
1869 cp_virt_specifiers virt_specifiers,
1870 cp_ref_qualifier ref_qualifier,
1871 tree tx_qualifier,
1872 tree exception_specification,
1873 tree late_return_type,
1874 tree requires_clause,
1875 tree std_attrs,
1876 location_t parens_loc)
1877 {
1892 {
1896 }
1897 else
1903 }
1905 /* Make a declarator for an array of BOUNDS elements, each of which is
1906 defined by ELEMENT. */
1908 cp_declarator *
1910 {
1917 {
1921 }
1922 else
1926 }
1928 /* Determine whether the declarator we've seen so far can be a
1929 parameter pack, when followed by an ellipsis. */
1930 static bool
1932 {
1934 /* We already saw an ellipsis. */
1937 /* Search for a declarator name, or any other declarator that goes
1938 after the point where the ellipsis could appear in a parameter
1939 pack. If we find any of these, then this declarator cannot be
1940 made into a parameter pack. */
1943 {
1945 {
1958 }
1959 }
1962 }
1966 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1967 DECLARATOR and DEFAULT_ARGUMENT. */
1969 cp_parameter_declarator *
1972 tree default_argument,
1973 location_t loc,
1975 {
1983 else
1991 }
1993 /* Returns true iff DECLARATOR is a declaration for a function. */
1995 static bool
1997 {
1999 {
2008 }
2010 }
2012 /* The parser. */
2014 /* Overview
2015 --------
2017 A cp_parser parses the token stream as specified by the C++
2018 grammar. Its job is purely parsing, not semantic analysis. For
2019 example, the parser breaks the token stream into declarators,
2020 expressions, statements, and other similar syntactic constructs.
2021 It does not check that the types of the expressions on either side
2022 of an assignment-statement are compatible, or that a function is
2023 not declared with a parameter of type `void'.
2025 The parser invokes routines elsewhere in the compiler to perform
2026 semantic analysis and to build up the abstract syntax tree for the
2027 code processed.
2029 The parser (and the template instantiation code, which is, in a
2030 way, a close relative of parsing) are the only parts of the
2031 compiler that should be calling push_scope and pop_scope, or
2032 related functions. The parser (and template instantiation code)
2033 keeps track of what scope is presently active; everything else
2034 should simply honor that. (The code that generates static
2035 initializers may also need to set the scope, in order to check
2036 access control correctly when emitting the initializers.)
2038 Methodology
2039 -----------
2041 The parser is of the standard recursive-descent variety. Upcoming
2042 tokens in the token stream are examined in order to determine which
2043 production to use when parsing a non-terminal. Some C++ constructs
2044 require arbitrary look ahead to disambiguate. For example, it is
2045 impossible, in the general case, to tell whether a statement is an
2046 expression or declaration without scanning the entire statement.
2047 Therefore, the parser is capable of "parsing tentatively." When the
2048 parser is not sure what construct comes next, it enters this mode.
2049 Then, while we attempt to parse the construct, the parser queues up
2050 error messages, rather than issuing them immediately, and saves the
2051 tokens it consumes. If the construct is parsed successfully, the
2052 parser "commits", i.e., it issues any queued error messages and
2053 the tokens that were being preserved are permanently discarded.
2054 If, however, the construct is not parsed successfully, the parser
2055 rolls back its state completely so that it can resume parsing using
2056 a different alternative.
2058 Future Improvements
2059 -------------------
2061 The performance of the parser could probably be improved substantially.
2062 We could often eliminate the need to parse tentatively by looking ahead
2063 a little bit. In some places, this approach might not entirely eliminate
2064 the need to parse tentatively, but it might still speed up the average
2065 case. */
2067 /* Flags that are passed to some parsing functions. These values can
2068 be bitwise-ored together. */
2070 enum
2071 {
2072 /* No flags. */
2074 /* The construct is optional. If it is not present, then no error
2075 should be issued. */
2077 /* When parsing a type-specifier, treat user-defined type-names
2078 as non-type identifiers. */
2080 /* When parsing a type-specifier, do not try to parse a class-specifier
2081 or enum-specifier. */
2083 /* When parsing a decl-specifier-seq, only allow type-specifier or
2084 constexpr. */
2086 /* When parsing a decl-specifier-seq, only allow mutable, constexpr or
2087 for C++20 consteval or for C++23 static. */
2089 /* When parsing a decl-specifier-seq, allow missing typename. */
2091 /* When parsing of the noexcept-specifier should be delayed. */
2093 /* When parsing a consteval declarator. */
2095 /* When parsing a parameter declaration. */
2097 };
2099 /* This type is used for parameters and variables which hold
2100 combinations of the above flags. */
2103 /* The different kinds of declarators we want to parse. */
2105 enum cp_parser_declarator_kind
2106 {
2107 /* We want an abstract declarator. */
2108 CP_PARSER_DECLARATOR_ABSTRACT,
2109 /* We want a named declarator. */
2110 CP_PARSER_DECLARATOR_NAMED,
2111 /* We don't mind, but the name must be an unqualified-id. */
2112 CP_PARSER_DECLARATOR_EITHER
2113 };
2115 /* The precedence values used to parse binary expressions. The minimum value
2116 of PREC must be 1, because zero is reserved to quickly discriminate
2117 binary operators from other tokens. */
2119 enum cp_parser_prec
2120 {
2121 PREC_NOT_OPERATOR,
2122 PREC_LOGICAL_OR_EXPRESSION,
2123 PREC_LOGICAL_AND_EXPRESSION,
2124 PREC_INCLUSIVE_OR_EXPRESSION,
2125 PREC_EXCLUSIVE_OR_EXPRESSION,
2126 PREC_AND_EXPRESSION,
2127 PREC_EQUALITY_EXPRESSION,
2128 PREC_RELATIONAL_EXPRESSION,
2129 PREC_SPACESHIP_EXPRESSION,
2130 PREC_SHIFT_EXPRESSION,
2131 PREC_ADDITIVE_EXPRESSION,
2132 PREC_MULTIPLICATIVE_EXPRESSION,
2133 PREC_PM_EXPRESSION,
2134 NUM_PREC_VALUES = PREC_PM_EXPRESSION
2135 };
2137 /* A mapping from a token type to a corresponding tree node type, with a
2138 precedence value. */
2140 struct cp_parser_binary_operations_map_node
2141 {
2142 /* The token type. */
2144 /* The corresponding tree code. */
2146 /* The precedence of this operator. */
2148 };
2150 struct cp_parser_expression_stack_entry
2151 {
2152 /* Left hand side of the binary operation we are currently
2153 parsing. */
2154 cp_expr lhs;
2155 /* Original tree code for left hand side, if it was a binary
2156 expression itself (used for -Wparentheses). */
2158 /* Tree code for the binary operation we are parsing. */
2160 /* Precedence of the binary operation we are parsing. */
2162 /* Location of the binary operation we are parsing. */
2163 location_t loc;
2164 /* Flags from the operator token. */
2166 };
2168 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
2169 entries because precedence levels on the stack are monotonically
2170 increasing. */
2174 /* Used for parsing OMP for loops.
2176 Some notes on flags used for context:
2177 parser->omp_for_parse_state is non-null anywhere inside the OMP FOR
2178 construct, except for the final-loop-body.
2179 The want_nested_loop flag is true if inside a {} sequence where
2180 a loop-nest (or another {} sequence containing a loop-nest) is expected,
2181 but has not yet been seen. It's false when parsing intervening code
2182 statements or their substatements that cannot contain a loop-nest.
2183 The in_intervening_code flag is true when parsing any intervening code,
2184 including substatements, and whether or not want_nested_loop is true.
2186 And, about error handling:
2187 The saw_intervening_code flag is set if the loop is not perfectly
2188 nested, even in the usual case where this is not an error.
2189 perfect_nesting_fail is set if an error has been diagnosed because an
2190 imperfectly-nested loop was found where a perfectly-nested one is
2191 required (we diagnose this only once).
2192 fail is set if any kind of structural error in the loop nest
2193 has been found and diagnosed.
2194 */
2198 tree pre_body;
2199 tree orig_declv;
2203 location_t for_loc;
2204 releasing_vec init_blockv;
2205 releasing_vec body_blockv;
2206 releasing_vec init_placeholderv;
2207 releasing_vec body_placeholderv;
2215 tree clauses;
2217 tree ordered_cl;
2218 };
2220 /* Prototypes. */
2222 /* Constructors and destructors. */
2227 /* Class variables. */
2231 /* The operator-precedence table used by cp_parser_binary_expression.
2232 Transformed into an associative array (binops_by_token) by
2233 cp_parser_new. */
2268 };
2270 /* The same as binops, but initialized by cp_parser_new so that
2271 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
2272 for speed. */
2275 /* Constructors and destructors. */
2277 /* Construct a new context. The context below this one on the stack
2278 is given by NEXT. */
2282 {
2285 /* Allocate the storage. */
2287 {
2288 /* Pull the first entry from the free list. */
2292 }
2293 else
2296 /* No errors have occurred yet in this context. */
2298 /* If this is not the bottommost context, copy information that we
2299 need from the previous context. */
2301 {
2302 /* If, in the NEXT context, we are parsing an `x->' or `x.'
2303 expression, then we are parsing one in this context, too. */
2305 /* Thread the stack. */
2307 }
2310 }
2312 /* Managing the unparsed function queues. */
2314 #define unparsed_funs_with_default_args \
2315 parser->unparsed_queues->last ().funs_with_default_args
2316 #define unparsed_funs_with_definitions \
2317 parser->unparsed_queues->last ().funs_with_definitions
2318 #define unparsed_nsdmis \
2319 parser->unparsed_queues->last ().nsdmis
2320 #define unparsed_noexcepts \
2321 parser->unparsed_queues->last ().noexcepts
2322 #define unparsed_contracts \
2323 parser->unparsed_queues->last ().contracts
2325 static void
2327 {
2328 cp_unparsed_functions_entry e
2331 }
2333 static void
2335 {
2338 }
2340 /* Prototypes. */
2342 /* Routines to parse various constructs.
2344 Those that return `tree' will return the error_mark_node (rather
2345 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2346 Sometimes, they will return an ordinary node if error-recovery was
2347 attempted, even though a parse error occurred. So, to check
2348 whether or not a parse error occurred, you should always use
2349 cp_parser_error_occurred. If the construct is optional (indicated
2350 either by an `_opt' in the name of the function that does the
2351 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2352 the construct is not present. */
2354 /* Lexical conventions [gram.lex] */
2356 static tree finish_userdef_string_literal
2359 /* Basic concepts [gram.basic] */
2363 /* Expressions [gram.expr] */
2365 static cp_expr cp_parser_primary_expression
2367 static cp_expr cp_parser_id_expression
2369 static cp_expr cp_parser_unqualified_id
2371 static tree cp_parser_nested_name_specifier_opt
2373 static tree cp_parser_nested_name_specifier
2375 static tree cp_parser_qualifying_entity
2377 static cp_expr cp_parser_postfix_expression
2379 static tree cp_parser_postfix_open_square_expression
2381 static tree cp_parser_postfix_dot_deref_expression
2386 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2389 static void cp_parser_pseudo_destructor_name
2391 static cp_expr cp_parser_unary_expression
2393 static enum tree_code cp_parser_unary_operator
2395 static tree cp_parser_has_attribute_expression
2397 static tree cp_parser_new_expression
2401 static tree cp_parser_new_type_id
2409 static tree cp_parser_delete_expression
2411 static cp_expr cp_parser_cast_expression
2413 static cp_expr cp_parser_binary_expression
2415 static tree cp_parser_question_colon_clause
2418 static cp_expr cp_parser_assignment_expression
2420 static enum tree_code cp_parser_assignment_operator_opt
2422 static cp_expr cp_parser_expression
2424 static cp_expr cp_parser_constant_expression
2426 static cp_expr cp_parser_builtin_offsetof
2428 static cp_expr cp_parser_lambda_expression
2430 static void cp_parser_lambda_introducer
2432 static bool cp_parser_lambda_declarator_opt
2434 static void cp_parser_lambda_body
2437 /* Statements [gram.stmt.stmt] */
2439 static void cp_parser_statement
2441 static void cp_parser_label_for_labeled_statement
2443 static tree cp_parser_expression_statement
2445 static tree cp_parser_compound_statement
2447 static void cp_parser_statement_seq_opt
2449 static tree cp_parser_selection_statement
2451 static tree cp_parser_condition
2453 static tree cp_parser_iteration_statement
2455 static bool cp_parser_init_statement
2457 static tree cp_parser_for
2459 static tree cp_parser_c_for
2461 static tree cp_parser_range_for
2463 static void do_range_for_auto_deduction
2465 static tree cp_parser_perform_range_for_lookup
2467 static tree cp_parser_range_for_member_function
2469 static tree cp_parser_jump_statement
2471 static void cp_parser_declaration_statement
2474 static tree cp_parser_implicitly_scoped_statement
2476 static void cp_parser_already_scoped_statement
2479 /* State of module-declaration parsing. */
2480 enum module_parse
2481 {
2484 _MP_UNUSED,
2494 };
2496 static module_parse cp_parser_module_declaration
2498 static void cp_parser_import_declaration
2501 /* Declarations [gram.dcl.dcl] */
2503 static void cp_parser_declaration_seq_opt
2505 static void cp_parser_declaration
2507 static void cp_parser_toplevel_declaration
2509 static void cp_parser_block_declaration
2511 static void cp_parser_simple_declaration
2513 static void cp_parser_decl_specifier_seq
2515 static tree cp_parser_storage_class_specifier_opt
2517 static tree cp_parser_function_specifier_opt
2519 static tree cp_parser_type_specifier
2522 static tree cp_parser_simple_type_specifier
2524 static tree cp_parser_placeholder_type_specifier
2526 static tree cp_parser_type_name
2528 static tree cp_parser_nonclass_name
2530 static tree cp_parser_elaborated_type_specifier
2532 static tree cp_parser_enum_specifier
2534 static void cp_parser_enumerator_list
2536 static void cp_parser_enumerator_definition
2538 static tree cp_parser_namespace_name
2540 static void cp_parser_namespace_definition
2542 static void cp_parser_namespace_body
2544 static tree cp_parser_qualified_namespace_specifier
2546 static void cp_parser_namespace_alias_definition
2548 static bool cp_parser_using_declaration
2550 static void cp_parser_using_directive
2552 static void cp_parser_using_enum
2554 static tree cp_parser_alias_declaration
2556 static void cp_parser_asm_definition
2558 static void cp_parser_linkage_specification
2560 static void cp_parser_static_assert
2562 static tree cp_parser_decltype
2564 static tree cp_parser_decomposition_declaration
2567 /* Declarators [gram.dcl.decl] */
2569 static tree cp_parser_init_declarator
2579 static enum tree_code cp_parser_ptr_operator
2581 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2583 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2585 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2587 static tree cp_parser_tx_qualifier_opt
2589 static tree cp_parser_late_return_type_opt
2591 static tree cp_parser_declarator_id
2593 static tree cp_parser_type_id
2595 static tree cp_parser_template_type_arg
2598 static tree cp_parser_type_id_1
2600 static void cp_parser_type_specifier_seq
2602 static tree cp_parser_parameter_declaration_clause
2604 static tree cp_parser_parameter_declaration_list
2608 static tree cp_parser_default_argument
2610 static void cp_parser_function_body
2612 static tree cp_parser_initializer
2614 static cp_expr cp_parser_initializer_clause
2616 static cp_expr cp_parser_braced_list
2621 static void cp_parser_ctor_initializer_opt_and_function_body
2624 static tree cp_parser_late_parsing_omp_declare_simd
2627 static tree cp_parser_late_parsing_oacc_routine
2630 static tree synthesize_implicit_template_parm
2632 static tree finish_fully_implicit_template
2634 static void abort_fully_implicit_template
2637 /* Classes [gram.class] */
2639 static tree cp_parser_class_name
2641 static tree cp_parser_class_specifier
2643 static tree cp_parser_class_head
2645 static enum tag_types cp_parser_class_key
2647 static void cp_parser_type_parameter_key
2649 static void cp_parser_member_specification_opt
2651 static void cp_parser_member_declaration
2653 static tree cp_parser_pure_specifier
2655 static tree cp_parser_constant_initializer
2658 /* Derived classes [gram.class.derived] */
2660 static tree cp_parser_base_clause
2662 static tree cp_parser_base_specifier
2665 /* Special member functions [gram.special] */
2667 static tree cp_parser_conversion_function_id
2669 static tree cp_parser_conversion_type_id
2673 static void cp_parser_ctor_initializer_opt
2675 static void cp_parser_mem_initializer_list
2677 static tree cp_parser_mem_initializer
2679 static tree cp_parser_mem_initializer_id
2682 /* Overloading [gram.over] */
2684 static cp_expr cp_parser_operator_function_id
2686 static cp_expr cp_parser_operator
2689 /* Templates [gram.temp] */
2691 static void cp_parser_template_declaration
2693 static tree cp_parser_template_parameter_list
2695 static tree cp_parser_template_parameter
2697 static tree cp_parser_type_parameter
2699 static tree cp_parser_template_id
2701 static tree cp_parser_template_id_expr
2703 static tree cp_parser_template_name
2705 static tree cp_parser_template_argument_list
2707 static tree cp_parser_template_argument
2709 static void cp_parser_explicit_instantiation
2711 static void cp_parser_explicit_specialization
2714 /* Exception handling [gram.except] */
2716 static tree cp_parser_try_block
2718 static void cp_parser_function_try_block
2720 static void cp_parser_handler_seq
2722 static void cp_parser_handler
2724 static tree cp_parser_exception_declaration
2726 static tree cp_parser_throw_expression
2728 static tree cp_parser_exception_specification_opt
2730 static tree cp_parser_type_id_list
2732 static tree cp_parser_noexcept_specification_opt
2735 /* GNU Extensions */
2737 static tree cp_parser_asm_specification_opt
2739 static tree cp_parser_asm_operand_list
2741 static tree cp_parser_asm_clobber_list
2743 static tree cp_parser_asm_label_list
2745 static bool cp_next_tokens_can_be_attribute_p
2747 static bool cp_next_tokens_can_be_gnu_attribute_p
2749 static bool cp_next_tokens_can_be_std_attribute_p
2751 static bool cp_nth_tokens_can_be_std_attribute_p
2753 static bool cp_nth_tokens_can_be_gnu_attribute_p
2755 static bool cp_nth_tokens_can_be_attribute_p
2757 static tree cp_parser_attributes_opt
2759 static tree cp_parser_gnu_attributes_opt
2761 static tree cp_parser_gnu_attribute_list
2763 static tree cp_parser_std_attribute
2765 static tree cp_parser_std_attribute_spec
2767 static tree cp_parser_std_attribute_spec_seq
2769 static size_t cp_parser_skip_std_attribute_spec_seq
2771 static size_t cp_parser_skip_attributes_opt
2773 static bool cp_parser_extension_opt
2775 static void cp_parser_label_declaration
2778 /* Concept Extensions */
2780 static tree cp_parser_concept_definition
2782 static tree cp_parser_constraint_expression
2784 static tree cp_parser_requires_clause_opt
2786 static tree cp_parser_requires_expression
2788 static tree cp_parser_requirement_parameter_list
2790 static tree cp_parser_requirement_body
2792 static tree cp_parser_requirement_seq
2794 static tree cp_parser_requirement
2796 static tree cp_parser_simple_requirement
2798 static tree cp_parser_compound_requirement
2800 static tree cp_parser_type_requirement
2802 static tree cp_parser_nested_requirement
2805 /* Transactional Memory Extensions */
2807 static tree cp_parser_transaction
2809 static tree cp_parser_transaction_expression
2811 static void cp_parser_function_transaction
2813 static tree cp_parser_transaction_cancel
2816 /* Coroutine extensions. */
2818 static tree cp_parser_yield_expression
2821 /* Contracts */
2823 static void cp_parser_late_contract_condition
2827 pragma_external,
2828 pragma_member,
2829 pragma_objc_icode,
2830 pragma_stmt,
2831 pragma_compound
2832 };
2833 static bool cp_parser_pragma
2836 /* Objective-C++ Productions */
2838 static tree cp_parser_objc_message_receiver
2840 static tree cp_parser_objc_message_args
2842 static tree cp_parser_objc_message_expression
2844 static cp_expr cp_parser_objc_encode_expression
2846 static tree cp_parser_objc_defs_expression
2848 static tree cp_parser_objc_protocol_expression
2850 static tree cp_parser_objc_selector_expression
2852 static cp_expr cp_parser_objc_expression
2854 static bool cp_parser_objc_selector_p
2856 static tree cp_parser_objc_selector
2858 static tree cp_parser_objc_protocol_refs_opt
2860 static void cp_parser_objc_declaration
2862 static tree cp_parser_objc_statement
2864 static bool cp_parser_objc_valid_prefix_attributes
2866 static void cp_parser_objc_at_property_declaration
2868 static void cp_parser_objc_at_synthesize_declaration
2870 static void cp_parser_objc_at_dynamic_declaration
2872 static tree cp_parser_objc_struct_declaration
2875 /* Utility Routines */
2877 static cp_expr cp_parser_lookup_name
2879 static tree cp_parser_lookup_name_simple
2881 static tree cp_parser_maybe_treat_template_as_class
2883 static bool cp_parser_check_declarator_template_parameters
2885 static bool cp_parser_check_template_parameters
2887 static cp_expr cp_parser_simple_cast_expression
2889 static tree cp_parser_global_scope_opt
2891 static bool cp_parser_constructor_declarator_p
2893 static tree cp_parser_function_definition_from_specifiers_and_declarator
2895 static tree cp_parser_function_definition_after_declarator
2897 static bool cp_parser_template_declaration_after_export
2899 static void cp_parser_perform_template_parameter_access_checks
2901 static tree cp_parser_single_declaration
2903 static cp_expr cp_parser_functional_cast
2905 static tree cp_parser_save_member_function_body
2907 static tree cp_parser_save_nsdmi
2909 static tree cp_parser_enclosed_template_argument_list
2911 static void cp_parser_save_default_args
2913 static void cp_parser_late_parsing_for_member
2915 static tree cp_parser_late_parse_one_default_arg
2917 static void cp_parser_late_parsing_nsdmi
2919 static void cp_parser_late_parsing_default_args
2921 static tree cp_parser_sizeof_operand
2923 static cp_expr cp_parser_trait
2925 static bool cp_parser_declares_only_class_p
2927 static void cp_parser_set_storage_class
2929 static void cp_parser_set_decl_spec_type
2931 static void set_and_check_decl_spec_loc
2934 static bool cp_parser_friend_p
2936 static void cp_parser_required_error
2942 static bool cp_parser_token_starts_function_definition_p
2944 static bool cp_parser_next_token_starts_class_definition_p
2946 static bool cp_parser_next_token_ends_template_argument_p
2948 static bool cp_parser_nth_token_starts_template_argument_list_p
2950 static enum tag_types cp_parser_token_is_class_key
2952 static enum tag_types cp_parser_token_is_type_parameter_key
2955 static void cp_parser_check_class_key
2957 static void cp_parser_check_access_in_redeclaration
2959 static bool cp_parser_optional_template_keyword
2961 static void cp_parser_pre_parsed_nested_name_specifier
2963 static bool cp_parser_cache_group
2965 static tree cp_parser_cache_defarg
2967 static void cp_parser_parse_tentatively
2969 static void cp_parser_commit_to_tentative_parse
2971 static void cp_parser_commit_to_topmost_tentative_parse
2973 static void cp_parser_abort_tentative_parse
2975 static bool cp_parser_parse_definitely
2979 static bool cp_parser_uncommitted_to_tentative_parse_p
2981 static void cp_parser_error
2983 static void cp_parser_name_lookup_error
2985 static bool cp_parser_simulate_error
2987 static bool cp_parser_check_type_definition
2989 static void cp_parser_check_for_definition_in_return_type
2991 static void cp_parser_check_for_invalid_template_id
2993 static bool cp_parser_non_integral_constant_expression
2995 static void cp_parser_diagnose_invalid_type_name
2997 static bool cp_parser_parse_and_diagnose_invalid_type_name
2999 static int cp_parser_skip_to_closing_parenthesis
3001 static void cp_parser_skip_to_end_of_statement
3003 static void cp_parser_consume_semicolon_at_end_of_statement
3005 static void cp_parser_skip_to_end_of_block_or_statement
3007 static bool cp_parser_skip_to_closing_brace
3009 static bool cp_parser_skip_entire_template_parameter_list
3011 static void cp_parser_require_end_of_template_parameter_list
3013 static bool cp_parser_skip_to_end_of_template_parameter_list
3015 static void cp_parser_skip_to_pragma_eol
3017 static bool cp_parser_error_occurred
3019 static bool cp_parser_allow_gnu_extensions_p
3021 static bool cp_parser_is_pure_string_literal
3023 static bool cp_parser_is_string_literal
3025 static bool cp_parser_is_keyword
3027 static tree cp_parser_make_typename_type
3031 static bool cp_parser_compound_literal_p
3033 static bool cp_parser_array_designator_p
3035 static bool cp_parser_init_statement_p
3037 static bool cp_parser_skip_up_to_closing_square_bracket
3039 static bool cp_parser_skip_to_closing_square_bracket
3046 // -------------------------------------------------------------------------- //
3047 // Unevaluated Operand Guard
3048 //
3049 // Implementation of an RAII helper for unevaluated operand parsing.
3051 {
3054 }
3057 {
3060 }
3062 // -------------------------------------------------------------------------- //
3063 // Tentative Parsing
3065 /* Returns nonzero if we are parsing tentatively. */
3069 {
3071 }
3073 /* Returns nonzero if TOKEN is a string literal. */
3075 static bool
3077 {
3083 }
3085 /* Returns nonzero if TOKEN is a string literal
3086 of a user-defined string literal. */
3088 static bool
3090 {
3097 }
3099 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
3101 static bool
3103 {
3105 }
3107 /* Helper function for cp_parser_error.
3108 Having peeked a token of kind TOK1_KIND that might signify
3109 a conflict marker, peek successor tokens to determine
3110 if we actually do have a conflict marker.
3111 Specifically, we consider a run of 7 '<', '=' or '>' characters
3112 at the start of a line as a conflict marker.
3113 These come through the lexer as three pairs and a single,
3114 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
3115 If it returns true, *OUT_LOC is written to with the location/range
3116 of the marker. */
3118 static bool
3121 {
3132 /* It must be at the start of the line. */
3137 /* We have a conflict marker. Construct a location of the form:
3138 <<<<<<<
3139 ^~~~~~~
3140 with start == caret, finishing at the end of the marker. */
3145 }
3147 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
3148 RT_CLOSE_PAREN. */
3152 {
3154 {
3162 }
3163 }
3165 /* Attempt to convert TOKEN_DESC from a required_token to an
3166 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
3168 static enum cpp_ttype
3170 {
3172 {
3193 /* Use CPP_EOF as a "no completions possible" code. */
3195 }
3196 }
3199 /* Subroutine of cp_parser_error and cp_parser_required_error.
3201 Issue a diagnostic of the form
3202 FILE:LINE: MESSAGE before TOKEN
3203 where TOKEN is the next token in the input stream. MESSAGE
3204 (specified by the caller) is usually of the form "expected
3205 OTHER-TOKEN".
3207 This bypasses the check for tentative passing, and potentially
3208 adds material needed by cp_parser_required_error.
3210 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
3211 suggesting insertion of the missing token.
3213 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
3214 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
3215 location. */
3217 static void
3219 required_token missing_token_desc,
3220 location_t matching_location)
3221 {
3223 /* This diagnostic makes more sense if it is tagged to the line
3224 of the token we just peeked at. */
3228 {
3233 }
3236 {
3237 auto_diagnostic_group d;
3241 " %qs, or other disambiguation, to prevent this being"
3246 }
3248 /* If this is actually a conflict marker, report it as such. */
3252 {
3253 location_t loc;
3255 {
3258 /* Consume tokens until the end of the source line. */
3260 {
3274 }
3276 }
3277 }
3279 auto_diagnostic_group d;
3286 {
3287 /* Potentially supply a fix-it hint, suggesting to add the
3288 missing token immediately after the *previous* token.
3289 This may move the primary location within richloc. */
3293 prev_token_loc);
3295 /* If matching_location != UNKNOWN_LOCATION, highlight it.
3296 Attempt to consolidate diagnostics by printing it as a
3297 secondary range within the main diagnostic. */
3299 added_matching_location
3301 matching_location);
3302 }
3304 /* If we were parsing a string-literal and there is an unknown name
3305 token right after, then check to see if that could also have been
3306 a literal string by checking the name against a list of known
3307 standard string literal constants defined in header files. If
3308 there is one, then add that as an hint to the error message. */
3309 name_hint h;
3313 {
3320 token_name,
3321 header_hint));
3322 }
3324 /* Actually emit the error. */
3326 /* Because c_parser_error does not understand
3327 CPP_KEYWORD, keywords are treated like
3328 identifiers. */
3333 {
3334 /* If we weren't able to consolidate matching_location, then
3335 print it as a secondary diagnostic. */
3340 }
3341 }
3343 /* If not parsing tentatively, issue a diagnostic of the form
3344 FILE:LINE: MESSAGE before TOKEN
3345 where TOKEN is the next token in the input stream. MESSAGE
3346 (specified by the caller) is usually of the form "expected
3347 OTHER-TOKEN". */
3349 static void
3351 {
3354 }
3356 /* Issue an error about name-lookup failing. NAME is the
3357 IDENTIFIER_NODE DECL is the result of
3358 the lookup (as returned from cp_parser_lookup_name). DESIRED is
3359 the thing that we hoped to find. */
3361 static void
3363 tree name,
3364 tree decl,
3365 name_lookup_error desired,
3366 location_t location)
3367 {
3368 /* If name lookup completely failed, tell the user that NAME was not
3369 declared. */
3371 {
3384 else
3386 }
3388 {
3390 {
3407 }
3408 }
3410 {
3412 {
3422 name);
3426 }
3427 }
3428 else
3429 {
3431 {
3444 }
3445 }
3446 }
3448 /* If we are parsing tentatively, remember that an error has occurred
3449 during this tentative parse. Returns true if the error was
3450 simulated; false if a message should be issued by the caller. */
3452 static bool
3454 {
3456 {
3459 }
3461 }
3463 /* This function is called when a type is defined. If type
3464 definitions are forbidden at this point, an error message is
3465 issued. */
3467 static bool
3469 {
3470 /* If types are forbidden here, issue a message. */
3472 {
3473 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3474 or %qs in the message need to be interpreted. */
3478 }
3480 }
3482 /* This function is called when the DECLARATOR is processed. The TYPE
3483 was a type defined in the decl-specifiers. If it is invalid to
3484 define a type in the decl-specifiers for DECLARATOR, an error is
3485 issued. TYPE_LOCATION is the location of TYPE and is used
3486 for error reporting. */
3488 static void
3491 {
3492 /* [dcl.fct] forbids type definitions in return types.
3493 Unfortunately, it's not easy to know whether or not we are
3494 processing a return type until after the fact. */
3502 {
3507 type);
3508 }
3509 }
3511 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3512 "<" in any valid C++ program. If the next token is indeed "<",
3513 issue a message warning the user about what appears to be an
3514 invalid attempt to form a template-id. LOCATION is the location
3515 of the type-specifier (TYPE) */
3517 static void
3519 tree type,
3521 location_t location)
3522 {
3526 {
3532 {
3535 else
3537 }
3538 else
3540 /* Remember the location of the invalid "<". */
3543 /* Consume the "<". */
3545 /* Parse the template arguments. */
3547 /* Permanently remove the invalid template arguments so that
3548 this error message is not issued again. */
3551 }
3552 }
3554 /* If parsing an integral constant-expression, issue an error message
3555 about the fact that THING appeared and return true. Otherwise,
3556 return false. In either case, set
3557 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3559 static bool
3561 non_integral_constant thing)
3562 {
3565 {
3567 {
3570 {
3573 "ISO C++ forbids using a floating-point literal "
3578 "enumeration type cannot appear in a "
3669 }
3673 }
3674 }
3676 }
3678 /* Emit a diagnostic for an invalid type name. This function commits
3679 to the current active tentative parse, if any. (Otherwise, the
3680 problematic construct might be encountered again later, resulting
3681 in duplicate error messages.) LOCATION is the location of ID. */
3683 static void
3685 location_t location)
3686 {
3689 /* Try to lookup the identifier. */
3696 /* If the lookup was ambiguous, an error will already have
3697 been issued. */
3699 /* If the lookup found a template-name, it means that the user forgot
3700 to specify an argument list. Emit a useful error message. */
3702 {
3703 auto_diagnostic_group d;
3706 decl);
3711 }
3715 /* Something like 'unsigned A a;' */
3718 {
3719 /* Issue an error message. */
3720 auto_diagnostic_group d;
3721 name_hint hint;
3725 {
3731 }
3732 else
3734 /* If we're in a template class, it's possible that the user was
3735 referring to a type from a base class. For example:
3737 template <typename T> struct A { typedef T X; };
3738 template <typename T> struct B : public A<T> { X x; };
3740 The user should have said "typename A<T>::X". */
3749 {
3752 id);
3755 id);
3756 else
3759 }
3776 {
3779 {
3783 {
3784 /* Go from a particular instantiation of the
3785 template (which will have an empty TYPE_FIELDs),
3786 to the main version. */
3792 {
3797 }
3798 }
3799 }
3800 found:;
3801 }
3802 }
3803 /* Here we diagnose qualified-ids where the scope is actually correct,
3804 but the identifier does not resolve to a valid type name. */
3806 {
3808 {
3809 auto_diagnostic_group d;
3810 name_hint hint;
3819 {
3822 "%qE in namespace %qE does not name a template"
3825 else
3829 }
3831 {
3834 "%qE in namespace %qE does not name a template"
3837 else
3839 "%qE in namespace %qE does not name a template"
3842 }
3843 else
3844 {
3847 "%qE in namespace %qE does not name a type"
3850 else
3854 }
3857 }
3860 {
3861 /* A<T>::A<T>() */
3862 auto_diagnostic_group d;
3868 }
3871 {
3876 "need %<typename%> before %<%T::%D::%E%> because "
3880 id,
3883 else
3887 }
3889 {
3890 auto_diagnostic_group d;
3902 else
3908 }
3909 else
3911 }
3912 }
3914 /* Check for a common situation where a type-name should be present,
3915 but is not, and issue a sensible error message. Returns true if an
3916 invalid type-name was detected.
3918 The situation handled by this function are variable declarations of the
3919 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3920 Usually, `ID' should name a type, but if we got here it means that it
3921 does not. We try to emit the best possible error message depending on
3922 how exactly the id-expression looks like. */
3924 static bool
3926 {
3927 tree id;
3930 /* Avoid duplicate error about ambiguous lookup. */
3932 {
3936 }
3945 /* If the next token is a (, this is a function with no explicit return
3946 type, i.e. constructor, destructor or conversion op. */
3949 {
3952 }
3956 /* Emit a diagnostic for the invalid type. */
3958 out:
3959 /* If we aren't in the middle of a declarator (i.e. in a
3960 parameter-declaration-clause), skip to the end of the declaration;
3961 there's no point in trying to process it. */
3965 }
3967 /* Consume tokens up to, and including, the next non-nested closing `)'.
3968 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3969 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3970 found an unnested token of that type. */
3972 static int
3975 cpp_ttype or_ttype,
3977 {
3988 {
3991 /* Have we found what we're looking for before the closing paren? */
3997 {
4001 /* FALLTHRU */
4003 /* If we've run out of tokens, then there is no closing `)'. */
4006 /* This is good for lambda expression capture-lists. */
4016 /* This matches the processing in skip_to_end_of_statement. */
4036 {
4040 }
4050 condop_depth--;
4056 /* FALLTHROUGH */
4059 /* We fell into a pragma. Skip it, and continue. */
4065 }
4067 /* Consume the token. */
4069 }
4070 }
4072 /* Consume tokens up to, and including, the next non-nested closing `)'.
4073 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
4074 are doing error recovery. Returns -1 if OR_COMMA is true and we
4075 found an unnested token of that type. */
4077 static int
4082 {
4086 }
4088 /* Consume tokens until we reach the end of the current statement.
4089 Normally, that will be just before consuming a `;'. However, if a
4090 non-nested `}' comes first, then we stop before consuming that. */
4092 static void
4094 {
4097 /* Unwind generic function template scope if necessary. */
4102 {
4106 {
4110 /* FALLTHRU */
4112 /* If we've run out of tokens, stop. */
4116 /* If the next token is a `;', we have reached the end of the
4117 statement. */
4123 /* If this is a non-nested '}', stop before consuming it.
4124 That way, when confronted with something like:
4126 { 3 + }
4128 we stop before consuming the closing '}', even though we
4129 have not yet reached a `;'. */
4133 /* If it is the closing '}' for a block that we have
4134 scanned, stop -- but only after consuming the token.
4135 That way given:
4137 void f g () { ... }
4138 typedef int I;
4140 we will stop after the body of the erroneously declared
4141 function, but before consuming the following `typedef'
4142 declaration. */
4144 {
4147 }
4157 /* FALLTHROUGH */
4160 /* We fell into a pragma. Skip it, and continue or return. */
4168 }
4170 /* Consume the token. */
4172 }
4173 }
4175 /* This function is called at the end of a statement or declaration.
4176 If the next token is a semicolon, it is consumed; otherwise, error
4177 recovery is attempted. */
4179 static void
4181 {
4182 /* Look for the trailing `;'. */
4184 {
4185 /* If there is additional (erroneous) input, skip to the end of
4186 the statement. */
4188 /* If the next token is now a `;', consume it. */
4191 }
4192 }
4194 /* Skip tokens until we have consumed an entire block, or until we
4195 have consumed a non-nested `;'. */
4197 static void
4199 {
4202 /* Unwind generic function template scope if necessary. */
4207 {
4211 {
4215 /* FALLTHRU */
4217 /* If we've run out of tokens, stop. */
4221 /* Stop if this is an unnested ';'. */
4227 /* Stop if this is an unnested '}', or closes the outermost
4228 nesting level. */
4229 nesting_depth--;
4237 /* Nest. */
4238 nesting_depth++;
4244 /* FALLTHROUGH */
4247 /* Skip it, and continue or return. */
4255 }
4257 /* Consume the token. */
4259 }
4260 }
4262 /* Skip tokens until a non-nested closing curly brace is the next
4263 token, or there are no more tokens. Return true in the first case,
4264 false otherwise. */
4266 static bool
4268 {
4272 {
4276 {
4280 /* FALLTHRU */
4282 /* If we've run out of tokens, stop. */
4286 /* If the next token is a non-nested `}', then we have reached
4287 the end of the current block. */
4293 /* If it the next token is a `{', then we are entering a new
4294 block. Consume the entire block. */
4300 }
4302 /* Consume the token. */
4304 }
4305 }
4307 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
4308 parameter is the PRAGMA token, allowing us to purge the entire pragma
4309 sequence. PRAGMA_TOK can be NULL, if we're speculatively scanning
4310 forwards (not error recovery). */
4312 static void
4314 {
4317 do
4318 {
4319 /* The preprocessor makes sure that a PRAGMA_EOL token appears
4320 before an EOF token, even when the EOF is on the pragma line.
4321 We should never get here without being inside a deferred
4322 pragma. */
4325 }
4329 {
4333 {
4335 /* Put the current source position back where it was before this
4336 lexer was pushed. */
4338 }
4339 }
4340 }
4342 /* Require pragma end of line, resyncing with it as necessary. The
4343 arguments are as for cp_parser_skip_to_pragma_eol. */
4345 static void
4347 {
4353 {
4355 /* Put the current source position back where it was before this
4356 lexer was pushed. */
4358 }
4359 }
4361 /* This is a simple wrapper around make_typename_type. When the id is
4362 an unresolved identifier node, we can provide a superior diagnostic
4363 using cp_parser_diagnose_invalid_type_name. */
4365 static tree
4367 location_t id_location)
4368 {
4369 tree result;
4371 {
4377 }
4379 }
4381 /* This is a wrapper around the
4382 make_{pointer,ptrmem,reference}_declarator functions that decides
4383 which one to call based on the CODE and CLASS_TYPE arguments. The
4384 CODE argument should be one of the values returned by
4385 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
4386 appertain to the pointer or reference. */
4390 cp_cv_quals cv_qualifiers,
4392 tree attributes)
4393 {
4400 else
4410 }
4412 /* Create a new C++ parser. */
4416 {
4417 /* Initialize the binops_by_token so that we can get the tree
4418 directly from the token. */
4426 /* For now, we always accept GNU extensions. */
4429 /* The `>' token is a greater-than operator, not the end of a
4430 template-id. */
4435 /* We are not parsing a constant-expression. */
4440 /* Local variable names are not forbidden. */
4443 /* We are not processing an `extern "C"' declaration. */
4446 /* We aren't parsing an export-declaration. */
4449 /* We are not processing a declarator. */
4452 /* We are not processing a template-argument-list. */
4455 /* We are not in an iteration statement. */
4458 /* We are not in a switch statement. */
4461 /* We are not parsing a type-id inside an expression. */
4464 /* String literals should be translated to the execution character set. */
4467 /* We are not parsing a function body. */
4470 /* We can correct until told otherwise. */
4473 /* The unparsed function queue is empty. */
4476 /* There are no classes being defined. */
4479 /* No template parameters apply. */
4482 /* Special parsing data structures. */
4486 /* Disallow OpenMP array sections in expressions. */
4489 /* Not declaring an implicit function template. */
4495 /* Allow constrained-type-specifiers. */
4498 /* We haven't yet seen an 'extern "C"'. */
4502 }
4504 /* Create a cp_lexer structure which will emit the tokens in CACHE
4505 and push it onto the parser's lexer stack. This is used for delayed
4506 parsing of in-class method bodies and default arguments, and should
4507 not be confused with tentative parsing. */
4508 static void
4510 {
4515 /* Move the current source position to that of the first token in the
4516 new lexer. */
4518 }
4520 /* Pop the top lexer off the parser stack. This is never used for the
4521 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4522 static void
4524 {
4529 /* Put the current source position back where it was before this
4530 lexer was pushed. */
4532 }
4534 /* Lexical conventions [gram.lex] */
4536 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4537 identifier. */
4539 static cp_expr
4541 {
4544 /* Look for the identifier. */
4546 /* Return the value. */
4549 else
4551 }
4553 /* Worker for cp_parser_string_literal, cp_parser_userdef_string_literal
4554 and cp_parser_unevaluated_string_literal.
4555 Do not call this directly; use either of the above.
4557 Parse a sequence of adjacent string constants. Return a
4558 TREE_STRING representing the combined, nul-terminated string
4559 constant. If TRANSLATE is true, translate the string to the
4560 execution character set. If WIDE_OK is true, a wide string is
4561 valid here. If UDL_OK is true, a string literal with user-defined
4562 suffix can be used in this context. If UNEVAL is true, diagnose
4563 numeric and conditional escape sequences in it if pedantic.
4565 C++98 [lex.string] says that if a narrow string literal token is
4566 adjacent to a wide string literal token, the behavior is undefined.
4567 However, C99 6.4.5p4 says that this results in a wide string literal.
4568 We follow C99 here, for consistency with the C front end.
4570 This code is largely lifted from lex_string() in c-lex.cc.
4572 FUTURE: ObjC++ will need to handle @-strings here. */
4574 static cp_expr
4578 {
4579 tree value;
4587 tree string_tree;
4593 {
4596 }
4601 {
4603 {
4607 }
4611 }
4612 else
4613 {
4616 }
4619 /* Try to avoid the overhead of creating and destroying an obstack
4620 for the common case of just one string. */
4623 {
4631 {
4635 }
4636 else
4640 }
4641 else
4642 {
4648 do
4649 {
4651 count++;
4656 {
4659 {
4662 }
4665 {
4670 }
4672 }
4673 else
4677 {
4681 {
4685 "concatenation of string literals with "
4687 }
4688 }
4697 {
4699 {
4703 }
4707 }
4708 else
4709 {
4713 }
4714 }
4717 /* A string literal built by concatenation has its caret=start at
4718 the start of the initial string, and its finish at the finish of
4719 the final string literal. */
4723 }
4726 {
4729 }
4735 {
4739 {
4743 }
4746 {
4754 else
4766 }
4771 {
4776 else
4778 }
4779 }
4780 else
4781 /* cpp_interpret_string has issued an error. */
4785 {
4788 }
4791 }
4793 /* Parse a sequence of adjacent string constants. Return a TREE_STRING
4794 representing the combined, nul-terminated string constant. If
4795 TRANSLATE is true, translate the string to the execution character set.
4796 If WIDE_OK is true, a wide string is valid here.
4798 This function issues an error if a user defined string literal is
4799 encountered; use cp_parser_userdef_string_literal if UDLs are allowed. */
4803 {
4808 }
4810 /* Parse a string literal or user defined string literal.
4812 user-defined-string-literal :
4813 string-literal ud-suffix
4815 If LOOKUP_UDLIT, perform a lookup for a suitable template function. */
4819 {
4823 }
4825 /* Parse an unevaluated string literal.
4827 unevaluated-string:
4828 string-literal */
4832 {
4837 }
4839 /* Look up a literal operator with the name and the exact arguments. */
4841 static tree
4843 {
4849 {
4853 {
4860 {
4870 }
4874 /* May be this should be sufficient_parms_p instead,
4875 depending on how exactly should user-defined literals
4876 work in presence of default arguments on the literal
4877 operator parameters. */
4880 }
4881 }
4884 }
4886 /* Parse a user-defined char constant. Returns a call to a user-defined
4887 literal operator taking the character as an argument. */
4889 static cp_expr
4891 {
4899 /* Build up a call to the user-defined operator */
4900 /* Lookup the name we got back from the id-expression. */
4901 releasing_vec args;
4905 {
4909 }
4912 }
4914 /* A subroutine of cp_parser_userdef_numeric_literal to
4915 create a char... template parameter pack from a string node. */
4917 static tree
4919 {
4920 tree charvec;
4927 /* Fill in CHARVEC with all of the parameters. */
4930 {
4939 }
4941 /* Build the argument packs. */
4947 }
4949 /* A subroutine of cp_parser_userdef_numeric_literal to
4950 create a char... template parameter pack from a string node. */
4952 static tree
4954 {
4955 tree charvec;
4966 /* First template parm is character type. */
4969 /* Fill in CHARVEC with all of the parameters. */
4976 /* Build the argument packs. */
4982 }
4984 /* Parse a user-defined numeric constant. returns a call to a user-defined
4985 literal operator. */
4987 static cp_expr
4989 {
4999 /* Look for a literal operator taking the exact type of numeric argument
5000 as the literal value. */
5001 releasing_vec args;
5005 {
5007 tf_warning_or_error);
5010 {
5013 long_long_unsigned_type_node);
5014 }
5015 else
5016 {
5020 long_double_type_node);
5024 }
5027 }
5029 /* If the numeric argument didn't work, look for a raw literal
5030 operator taking a const char* argument consisting of the number
5031 in string format. */
5036 {
5038 tf_warning_or_error);
5040 }
5042 /* If the raw literal didn't work, look for a non-type template
5043 function with parameter pack char.... Call the function with
5044 template parameter characters representing the number. */
5048 {
5051 {
5053 num_string);
5055 }
5058 tf_warning_or_error);
5060 }
5062 /* In C++14 the standard library defines complex number suffixes that
5063 conflict with GNU extensions. Prefer them if <complex> is #included. */
5073 {
5077 {
5078 /* No <complex>, so pedwarn and use GNU semantics. */
5081 }
5082 }
5084 bool complained
5091 {
5093 "(from %<<complex>%>) to enable the C++14 user-defined literal "
5098 }
5105 else
5106 {
5107 /* Use the built-in semantics. */
5108 tree type;
5110 {
5113 else
5115 }
5123 }
5126 /* Avoid repeated diagnostics. */
5129 }
5131 /* Parse a user-defined string constant. Returns a call to a user-defined
5132 literal operator taking a character pointer and the length of the string
5133 as arguments. */
5135 static tree
5137 {
5143 tree decl;
5145 /* Build up a call to the user-defined operator. */
5146 /* Lookup the name we got back from the id-expression. */
5147 releasing_vec args;
5154 tf_warning_or_error);
5156 /* Look for a suitable template function, either (C++20) with a single
5157 parameter of class type, or (N3599) with typename parameter CharT and
5158 parameter pack CharT... */
5162 {
5163 /* Use resolve_nondeduced_context to try to choose one form of template
5164 or the other. */
5171 else
5172 {
5177 }
5181 tf_warning_or_error);
5182 }
5187 }
5190 /* Basic concepts [gram.basic] */
5192 /* Parse a translation-unit.
5194 translation-unit:
5195 declaration-seq [opt] */
5197 static void
5199 {
5202 /* Create the declarator obstack. */
5204 /* Create the error declarator. */
5206 /* Create the empty parameter list. */
5208 UNKNOWN_LOCATION);
5209 /* Remember where the base of the declarator obstack lies. */
5221 /* Parse until EOF. */
5223 {
5226 /* If we're entering or exiting a region that's implicitly
5227 extern "C", modify the lang context appropriately. This is
5228 so horrible. Please die. */
5231 {
5235 else
5237 }
5243 {
5244 /* Top-level module declarations are ok, and change the
5245 portion of file we're in. Top-level import declarations
5246 are significant for the import portions. */
5251 {
5254 }
5256 {
5257 mp_state
5260 }
5262 {
5267 }
5268 else
5272 {
5275 {
5278 "global module fragment contents must be"
5280 }
5281 }
5282 }
5284 /* This relies on the ordering of module_parse values. */
5286 /* We're no longer in the import portion of a named module. */
5292 {
5295 /* If the next token is now a `;', consume it. */
5298 }
5299 else
5301 }
5303 /* Get rid of the token array; we don't need it any more. */
5307 /* The EOF should have reset this. */
5310 /* Make sure the declarator obstack was fully cleaned up. */
5313 }
5315 /* Return the appropriate tsubst flags for parsing, possibly in N3276
5316 decltype context. */
5320 {
5325 }
5327 /* We're about to parse a collection of statements. If we're currently
5328 parsing tentatively, set up a firewall so that any nested
5329 cp_parser_commit_to_tentative_parse won't affect the current context. */
5331 static cp_token_position
5333 {
5340 }
5342 /* We've finished parsing the collection of statements. Wrap up the
5343 firewall and replace the relevant tokens with the parsed form. */
5345 static void
5347 tree expr)
5348 {
5352 /* Finish the firewall level. */
5354 /* And remember the result of the parse for when we try again. */
5360 }
5362 /* Like the above functions, but let the user modify the tokens. Used by
5363 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
5364 later parses, so it makes sense to localize the effects of
5365 cp_parser_commit_to_tentative_parse. */
5367 struct tentative_firewall
5368 {
5373 {
5374 /* If we're currently parsing tentatively, start a committed level as a
5375 firewall and then an inner tentative parse. */
5377 {
5381 }
5382 }
5385 {
5387 {
5388 /* Finish the inner tentative parse and the firewall, propagating any
5389 uncommitted error state to the outer tentative parse. */
5395 }
5396 }
5397 };
5399 /* Some tokens naturally come in pairs e.g.'(' and ')'.
5400 This class is for tracking such a matching pair of symbols.
5401 In particular, it tracks the location of the first token,
5402 so that if the second token is missing, we can highlight the
5403 location of the first token when notifying the user about the
5404 problem. */
5407 class token_pair
5408 {
5410 /* token_pair's ctor. */
5413 /* If the next token is the opening symbol for this pair, consume it and
5414 return true.
5415 Otherwise, issue an error and return false.
5416 In either case, record the location of the opening token. */
5419 {
5423 }
5425 /* Consume the next token from PARSER, recording its location as
5426 that of the opening token within the pair. */
5429 {
5434 }
5436 /* If the next token is the closing symbol for this pair, consume it
5437 and return it.
5438 Otherwise, issue an error, highlighting the location of the
5439 corresponding opening token, and return NULL. */
5442 {
5445 m_open_loc);
5446 }
5451 location_t m_open_loc;
5452 };
5454 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
5456 struct matching_paren_traits
5457 {
5462 };
5464 /* "matching_parens" is a token_pair<T> class for tracking matching
5465 pairs of parentheses. */
5469 /* Traits for token_pair<T> for tracking matching pairs of braces. */
5471 struct matching_brace_traits
5472 {
5477 };
5479 /* "matching_braces" is a token_pair<T> class for tracking matching
5480 pairs of braces. */
5485 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
5486 enclosing parentheses. */
5488 static cp_expr
5490 {
5494 /* Consume the '('. */
5496 matching_parens parens;
5498 /* Start the statement-expression. */
5500 /* Parse the compound-statement. */
5502 /* Finish up. */
5504 /* Consume the ')'. */
5512 }
5514 /* Expressions [gram.expr] */
5516 /* Parse a fold-operator.
5518 fold-operator:
5519 - * / % ^ & | = < > << >>
5520 = -= *= /= %= ^= &= |= <<= >>=
5521 == != <= >= && || , .* ->*
5523 This returns the tree code corresponding to the matched operator
5524 as an int. When the current token matches a compound assignment
5525 operator, the resulting tree code is the negative value of the
5526 non-assignment operator. */
5528 static int
5530 {
5532 {
5572 }
5573 }
5575 /* Returns true if CODE indicates a binary expression, which is not allowed in
5576 the LHS of a fold-expression. More codes will need to be added to use this
5577 function in other contexts. */
5579 static bool
5581 {
5583 {
5616 }
5617 }
5619 /* If the next token is a suitable fold operator, consume it and return as
5620 the function above. */
5622 static int
5624 {
5630 }
5632 /* Parse a fold-expression.
5634 fold-expression:
5635 ( ... folding-operator cast-expression)
5636 ( cast-expression folding-operator ... )
5637 ( cast-expression folding operator ... folding-operator cast-expression)
5639 Note that the '(' and ')' are matched in primary expression. */
5641 static cp_expr
5643 {
5644 cp_id_kind pidk;
5648 // Left fold.
5650 {
5657 {
5660 }
5668 }
5673 {
5676 }
5679 {
5682 }
5685 /* The operands of a fold-expression are cast-expressions, so binary or
5686 conditional expressions are not allowed. We check this here to avoid
5687 tentative parsing. */
5699 // Right fold.
5701 {
5704 }
5707 {
5710 }
5713 // Binary left or right fold.
5719 }
5721 /* Parse a primary-expression.
5723 primary-expression:
5724 literal
5725 this
5726 ( expression )
5727 id-expression
5728 lambda-expression (C++11)
5730 GNU Extensions:
5732 primary-expression:
5733 ( compound-statement )
5734 __builtin_va_arg ( assignment-expression , type-id )
5735 __builtin_offsetof ( type-id , offsetof-expression )
5737 C++ Extensions:
5738 __has_nothrow_assign ( type-id )
5739 __has_nothrow_constructor ( type-id )
5740 __has_nothrow_copy ( type-id )
5741 __has_trivial_assign ( type-id )
5742 __has_trivial_constructor ( type-id )
5743 __has_trivial_copy ( type-id )
5744 __has_trivial_destructor ( type-id )
5745 __has_virtual_destructor ( type-id )
5746 __is_abstract ( type-id )
5747 __is_base_of ( type-id , type-id )
5748 __is_class ( type-id )
5749 __is_empty ( type-id )
5750 __is_enum ( type-id )
5751 __is_final ( type-id )
5752 __is_literal_type ( type-id )
5753 __is_pod ( type-id )
5754 __is_polymorphic ( type-id )
5755 __is_std_layout ( type-id )
5756 __is_trivial ( type-id )
5757 __is_union ( type-id )
5759 Objective-C++ Extension:
5761 primary-expression:
5762 objc-expression
5764 literal:
5765 __null
5767 ADDRESS_P is true iff this expression was immediately preceded by
5768 "&" and therefore might denote a pointer-to-member. CAST_P is true
5769 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5770 true iff this expression is a template argument.
5772 Returns a representation of the expression. Upon return, *IDK
5773 indicates what kind of id-expression (if any) was present. */
5775 static cp_expr
5782 {
5785 /* Assume the primary expression is not an id-expression. */
5788 /* Peek at the next token. */
5791 {
5792 /* literal:
5793 integer-literal
5794 character-literal
5795 floating-literal
5796 string-literal
5797 boolean-literal
5798 pointer-literal
5799 user-defined-literal */
5811 {
5815 }
5816 /* Floating-point literals are only allowed in an integral
5817 constant expression if they are cast to an integral or
5818 enumeration type. */
5824 {
5825 /* CAST_P will be set even in invalid code like "int(2.7 +
5826 ...)". Therefore, we have to check that the next token
5827 is sure to end the cast. */
5829 {
5834 enumerator-definition. */
5836 /* The curly brace at the end of an enum-specifier. */
5838 /* The end of a statement. */
5840 /* The end of the cast-expression. */
5842 /* The end of an array bound. */
5844 /* The closing ">" in a template-argument-list. */
5847 /* C++0x only: A ">>" treated like two ">" tokens,
5848 in a template-argument-list. */
5853 }
5855 /* If we are within a cast, then the constraint that the
5856 cast is to an integral or enumeration type will be
5857 checked at that point. If we are not within a cast, then
5858 this code is invalid. */
5861 }
5882 /* ??? Should wide strings be allowed when parser->translate_strings_p
5883 is false (i.e. in attributes)? If not, we can kill the third
5884 argument to cp_parser_string_literal. */
5889 else
5896 /* If we see `( { ' then we are looking at the beginning of
5897 a GNU statement-expression. */
5900 {
5901 /* Statement-expressions are not allowed by the standard. */
5905 /* And they're not allowed outside of a function-body; you
5906 cannot, for example, write:
5908 int i = ({ int j = 3; j + 1; });
5910 at class or namespace scope. */
5913 {
5915 "statement-expressions are not allowed outside "
5921 }
5922 else
5924 }
5925 /* Otherwise it's a normal parenthesized expression. */
5926 {
5927 cp_expr expr;
5932 /* Consume the `('. */
5933 matching_parens parens;
5935 /* Within a parenthesized expression, a `>' token is always
5936 the greater-than operator. */
5937 saved_greater_than_is_operator_p
5942 /* Left fold expression. */
5944 else
5945 /* Parse the parenthesized expression. */
5950 {
5955 "fold-expressions only available with %<-std=c++17%> "
5957 }
5958 else
5959 /* Let the front end know that this expression was
5960 enclosed in parentheses. This matters in case, for
5961 example, the expression is of the form `A::B', since
5962 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5963 not. */
5966 /* DR 705: Wrapping an unqualified name in parentheses
5967 suppresses arg-dependent lookup. We want to pass back
5968 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5969 (c++/37862), but none of the others. */
5973 /* The `>' token might be the end of a template-id or
5974 template-parameter-list now. */
5975 parser->greater_than_is_operator_p
5978 /* Consume the `)'. */
5990 }
5993 {
5995 {
5996 /* We might have an Objective-C++ message. */
5999 /* If that works out, we're done ... */
6002 /* ... else, fall though to see if it's a lambda. */
6003 }
6005 /* Don't warn about a failed tentative parse. */
6010 }
6014 /* We have an Objective-C++ string literal. */
6021 {
6022 /* These two are the boolean literals. */
6030 /* The `__null' literal. */
6035 /* The `nullptr' literal. */
6040 /* Recognize the `this' keyword. */
6044 {
6048 }
6049 /* Pointers cannot appear in constant-expressions. */
6054 /* The `operator' keyword can be the beginning of an
6055 id-expression. */
6062 {
6063 non_integral_constant name;
6065 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
6066 __func__ are the names of variables -- but they are
6067 treated specially. Therefore, they are handled here,
6068 rather than relying on the generic id-expression logic
6069 below. Grammatically, these names are id-expressions.
6071 Consume the token. */
6075 {
6087 }
6092 /* Look up the name. */
6094 }
6097 {
6098 tree expression;
6099 tree type;
6100 location_t type_location;
6101 location_t start_loc
6103 /* The `__builtin_va_arg' construct is used to handle
6104 `va_arg'. Consume the `__builtin_va_arg' token. */
6106 /* Look for the opening `('. */
6107 matching_parens parens;
6109 /* Now, parse the assignment-expression. */
6111 /* Look for the `,'. */
6114 /* Parse the type-id. */
6115 {
6118 }
6119 /* Look for the closing `)'. */
6120 location_t finish_loc
6123 /* Using `va_arg' in a constant-expression is not
6124 allowed. */
6126 NIC_VA_ARG))
6128 /* Construct a location of the form:
6129 __builtin_va_arg (v, int)
6130 ~~~~~~~~~~~~~~~~~~~~~^~~~
6131 with the caret at the type, ranging from the start of the
6132 "__builtin_va_arg" token to the close paren. */
6133 location_t combined_loc
6136 }
6141 // C++ concepts
6145 /* Objective-C++ expressions. */
6155 "%<omp_all_memory%> may only be used in OpenMP "
6163 {
6168 }
6169 /* FALLTHRU */
6173 }
6175 /* An id-expression can start with either an identifier, a
6176 `::' as the beginning of a qualified-id, or the "operator"
6177 keyword. */
6181 /* FALLTHRU */
6185 {
6186 id_expression:
6187 cp_expr id_expression;
6188 cp_expr decl;
6194 /* Parse the id-expression. */
6195 id_expression
6212 /* If we have a template-id, then no further lookup is
6213 required. If the template-id was for a template-class, we
6214 will sometimes have a TYPE_DECL at this point. */
6218 /* Look up the name. */
6219 else
6220 {
6221 tree ambiguous_decls;
6223 /* If we already know that this lookup is ambiguous, then
6224 we've already issued an error message; there's no reason
6225 to check again. */
6228 {
6231 }
6234 none_type,
6235 template_p,
6240 /* If the lookup was ambiguous, an error will already have
6241 been issued. */
6245 /* In Objective-C++, we may have an Objective-C 2.0
6246 dot-syntax for classes here. */
6251 {
6252 tree component;
6259 component);
6260 /* Build a location of the form:
6261 expr.component
6262 ~~~~~^~~~~~~~~
6263 with caret at the start of the component name (at
6264 input_location), ranging from the start of the id_expression
6265 to the end of the component name. */
6266 location_t combined_loc
6271 }
6273 /* In Objective-C++, an instance variable (ivar) may be preferred
6274 to whatever cp_parser_lookup_name() found.
6275 Call objc_lookup_ivar. To avoid exposing cp_expr to the
6276 rest of c-family, we have to do a little extra work to preserve
6277 any location information in cp_expr "decl". Given that
6278 objc_lookup_ivar is implemented in "c-family" and "objc", we
6279 have a trip through the pure "tree" type, rather than cp_expr.
6280 Naively copying it back to "decl" would implicitly give the
6281 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
6282 store an EXPR_LOCATION. Hence we only update "decl" (and
6283 hence its location_t) if we get back a different tree node. */
6285 id_expression);
6289 /* If name lookup gives us a SCOPE_REF, then the
6290 qualifying scope was dependent. */
6292 {
6293 /* At this point, we do not know if DECL is a valid
6294 integral constant expression. We assume that it is
6295 in fact such an expression, so that code like:
6297 template <int N> struct A {
6298 int a[B<N>::i];
6299 };
6301 is accepted. At template-instantiation time, we
6302 will check that B<N>::i is actually a constant. */
6304 }
6305 /* Check to see if DECL is a local variable in a context
6306 where that is forbidden. */
6309 /* DR 2082 permits local variables in unevaluated contexts
6310 within a default argument. */
6312 {
6320 }
6321 }
6323 decl = (finish_id_expression
6325 idk,
6330 template_arg_p,
6335 /* Build a location for an id-expression of the form:
6336 ::ns::id
6337 ~~~~~~^~
6338 or:
6339 id
6340 ^~
6341 i.e. from the start of the first token to the end of the final
6342 token, with the caret at the start of the unqualified-id. */
6346 location_t combined_loc
6351 }
6353 /* Anything else is an error. */
6357 }
6358 }
6366 {
6369 }
6371 /* Complain about missing template keyword when naming a dependent
6372 member template. */
6374 static void
6376 {
6383 "expected %qs keyword before dependent "
6386 }
6388 /* Parse an id-expression.
6390 id-expression:
6391 unqualified-id
6392 qualified-id
6394 qualified-id:
6395 :: [opt] nested-name-specifier template [opt] unqualified-id
6396 :: identifier
6397 :: operator-function-id
6398 :: template-id
6400 Return a representation of the unqualified portion of the
6401 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
6402 a `::' or nested-name-specifier.
6404 Often, if the id-expression was a qualified-id, the caller will
6405 want to make a SCOPE_REF to represent the qualified-id. This
6406 function does not do this in order to avoid wastefully creating
6407 SCOPE_REFs when they are not required.
6409 If TEMPLATE_KEYWORD_P is true, then we have just seen the
6410 `template' keyword.
6412 If CHECK_DEPENDENCY_P is false, then names are looked up inside
6413 uninstantiated templates.
6415 If *TEMPLATE_P is non-NULL, it is set to true iff the
6416 `template' keyword is used to explicitly indicate that the entity
6417 named is a template.
6419 If DECLARATOR_P is true, the id-expression is appearing as part of
6420 a declarator, rather than as part of an expression. */
6422 static cp_expr
6429 {
6433 /* Assume the `template' keyword was not used. */
6437 /* Look for the optional `::' operator. */
6438 global_scope_p
6439 = (!template_keyword_p
6444 /* Look for the optional nested-name-specifier. */
6445 nested_name_specifier_p
6448 check_dependency_p,
6450 declarator_p,
6451 template_keyword_p)
6457 /* Peek at the next token. */
6460 /* If there is a nested-name-specifier, then we are looking at
6461 the first qualified-id production. */
6463 {
6464 tree saved_object_scope;
6465 tree saved_qualifying_scope;
6467 /* See if the next token is the `template' keyword. */
6471 /* Name lookup we do during the processing of the
6472 unqualified-id might obliterate SCOPE. */
6475 /* Process the final unqualified-id. */
6477 check_dependency_p,
6478 declarator_p,
6480 /* Restore the SAVED_SCOPE for our caller. */
6484 }
6485 /* Otherwise, if we are in global scope, then we are looking at one
6486 of the other qualified-id productions. */
6488 {
6489 /* If it's an identifier, and the next token is not a "<", then
6490 we can avoid the template-id case. This is an optimization
6491 for this common case. */
6493 && !cp_parser_nth_token_starts_template_argument_list_p
6498 /* Try a template-id. */
6502 declarator_p);
6503 /* If that worked, we're done. */
6507 /* Peek at the next token. (Changes in the token buffer may
6508 have invalidated the pointer obtained above.) */
6512 {
6519 {
6522 }
6523 /* Fall through. */
6528 }
6529 }
6530 else
6531 {
6536 declarator_p,
6537 optional_p);
6538 }
6541 && warn_missing_template_keyword
6542 && !template_keyword_p
6543 /* Don't warn if we're looking inside templates. */
6544 && check_dependency_p
6545 /* In a template argument list a > could be closing
6546 the enclosing targs. */
6549 /* Don't confuse an ill-formed constructor declarator for a missing
6550 template keyword in a return type. */
6554 OPT_Wmissing_template_keyword))
6555 {
6558 /* An operator after the > suggests that the > ends a
6559 template-id; a name or literal suggests that the > is an
6560 operator. */
6564 }
6567 }
6569 /* Parse an unqualified-id.
6571 unqualified-id:
6572 identifier
6573 operator-function-id
6574 conversion-function-id
6575 ~ class-name
6576 template-id
6578 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
6579 keyword, in a construct like `A::template ...'.
6581 Returns a representation of unqualified-id. For the `identifier'
6582 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
6583 production a BIT_NOT_EXPR is returned; the operand of the
6584 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
6585 other productions, see the documentation accompanying the
6586 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
6587 names are looked up in uninstantiated templates. If DECLARATOR_P
6588 is true, the unqualified-id is appearing as part of a declarator,
6589 rather than as part of an expression. */
6591 static cp_expr
6597 {
6600 /* Peek at the next token. */
6604 {
6606 {
6607 tree id;
6609 /* We don't know yet whether or not this will be a
6610 template-id. */
6612 /* Try a template-id. */
6614 check_dependency_p,
6615 declarator_p);
6616 /* If it worked, we're done. */
6619 /* Otherwise, it's an ordinary identifier. */
6621 }
6625 check_dependency_p,
6626 declarator_p);
6629 {
6630 tree type_decl;
6631 tree qualifying_scope;
6632 tree object_scope;
6633 tree scope;
6637 /* Consume the `~' token. */
6639 /* Parse the class-name. The standard, as written, seems to
6640 say that:
6642 template <typename T> struct S { ~S (); };
6643 template <typename T> S<T>::~S() {}
6645 is invalid, since `~' must be followed by a class-name, but
6646 `S<T>' is dependent, and so not known to be a class.
6647 That's not right; we need to look in uninstantiated
6648 templates. A further complication arises from:
6650 template <typename T> void f(T t) {
6651 t.T::~T();
6652 }
6654 Here, it is not possible to look up `T' in the scope of `T'
6655 itself. We must look in both the current scope, and the
6656 scope of the containing complete expression.
6658 Yet another issue is:
6660 struct S {
6661 int S;
6662 ~S();
6663 };
6665 S::~S() {}
6667 The standard does not seem to say that the `S' in `~S'
6668 should refer to the type `S' and not the data member
6669 `S::S'. */
6671 /* DR 244 says that we look up the name after the "~" in the
6672 same scope as we looked up the qualifying name. That idea
6673 isn't fully worked out; it's more complicated than that. */
6678 /* Check for invalid scopes. */
6680 {
6684 }
6686 {
6690 scope);
6695 }
6697 {
6703 }
6709 /* Create a location with caret == start at the tilde,
6710 finishing at the end of the peeked token, e.g:
6711 ~token
6712 ^~~~~~. */
6713 location_t loc
6716 /* If the name is of the form "X::~X" it's OK even if X is a
6717 typedef. */
6726 {
6729 }
6731 /* ~auto means the destructor of whatever the object is. */
6733 {
6736 "%<~auto%> only available with "
6740 }
6742 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
6743 declarator-id of a constructor or destructor. */
6745 {
6746 auto_diagnostic_group d;
6757 }
6759 /* If there was an explicit qualification (S::~T), first look
6760 in the scope given by the qualification (i.e., S).
6762 Note: in the calls to cp_parser_class_name below we pass
6763 typename_type so that lookup finds the injected-class-name
6764 rather than the constructor. */
6768 {
6773 typename_type,
6776 declarator_p);
6779 }
6780 /* In "N::S::~S", look in "N" as well. */
6782 {
6787 type_decl
6791 typename_type,
6794 declarator_p);
6797 }
6798 /* In "p->S::~T", look in the scope given by "*p" as well. */
6800 {
6805 type_decl
6809 typename_type,
6812 declarator_p);
6815 }
6816 /* Look in the surrounding context. */
6818 {
6824 type_decl
6828 typename_type,
6831 declarator_p);
6834 {
6835 /* We couldn't find a type with this name. If we're parsing
6836 tentatively, fail and try something else. */
6838 {
6841 }
6842 /* Otherwise, accept it and check for a match at instantiation
6843 time. */
6848 }
6849 }
6850 /* If an error occurred, assume that the name of the
6851 destructor is the same as the name of the qualifying
6852 class. That allows us to keep parsing after running
6853 into ill-formed destructor names. */
6859 /* Check that destructor name and scope match. */
6861 {
6868 }
6870 /* [class.dtor]
6872 A typedef-name that names a class shall not be used as the
6873 identifier in the declarator for a destructor declaration. */
6880 type_decl);
6883 }
6887 {
6888 cp_expr id;
6890 /* This could be a template-id, so we try that first. */
6892 /* Try a template-id. */
6895 declarator_p);
6896 /* If that worked, we're done. */
6899 /* We still don't know whether we're looking at an
6900 operator-function-id or a conversion-function-id. */
6902 /* Try an operator-function-id. */
6904 /* If that didn't work, try a conversion-function-id. */
6909 }
6910 /* Fall through. */
6917 }
6918 }
6920 /* Check [temp.names]/5: A name prefixed by the keyword template shall
6921 be a template-id or the name shall refer to a class template or an
6922 alias template. */
6924 static void
6926 {
6936 /* Alias templates are also OK. */
6943 name);
6944 }
6946 /* Parse an (optional) nested-name-specifier.
6948 nested-name-specifier: [C++98]
6949 class-or-namespace-name :: nested-name-specifier [opt]
6950 class-or-namespace-name :: template nested-name-specifier [opt]
6952 nested-name-specifier: [C++0x]
6953 type-name ::
6954 namespace-name ::
6955 nested-name-specifier identifier ::
6956 nested-name-specifier template [opt] simple-template-id ::
6958 PARSER->SCOPE should be set appropriately before this function is
6959 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6960 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6961 in name lookups.
6963 Sets PARSER->SCOPE to the class (TYPE) or namespace
6964 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6965 it unchanged if there is no nested-name-specifier. Returns the new
6966 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6968 If CHECK_DEPENDENCY_P is FALSE, names are looked up in dependent scopes.
6970 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6971 part of a declaration and/or decl-specifier. */
6973 static tree
6980 {
6985 /* Remember where the nested-name-specifier starts. */
6988 {
6991 }
6994 {
6995 tree new_scope;
6996 tree old_scope;
6997 tree saved_qualifying_scope;
6999 /* Spot cases that cannot be the beginning of a
7000 nested-name-specifier. */
7003 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
7004 the already parsed nested-name-specifier. */
7006 {
7007 /* Grab the nested-name-specifier and continue the loop. */
7009 /* If we originally encountered this nested-name-specifier
7010 with CHECK_DEPENDENCY_P set to true, we will not have
7011 resolved TYPENAME_TYPEs, so we must do so here. */
7013 && !check_dependency_p
7015 {
7020 }
7023 }
7025 /* Spot cases that cannot be the beginning of a
7026 nested-name-specifier. On the second and subsequent times
7027 through the loop, we look for the `template' keyword. */
7029 ;
7030 /* A template-id can start a nested-name-specifier. */
7032 ;
7033 /* DR 743: decltype can be used in a nested-name-specifier. */
7035 ;
7036 else
7037 {
7038 /* If the next token is not an identifier, then it is
7039 definitely not a type-name or namespace-name. */
7042 /* If the following token is neither a `<' (to begin a
7043 template-id), nor a `::', then we are not looking at a
7044 nested-name-specifier. */
7050 /* name:name is a valid sequence in an Objective C message. */
7052 {
7056 "found %<:%> in nested-name-specifier, "
7059 }
7062 && !cp_parser_nth_token_starts_template_argument_list_p
7065 }
7067 /* The nested-name-specifier is optional, so we parse
7068 tentatively. */
7071 /* Look for the optional `template' keyword, if this isn't the
7072 first time through the loop. */
7074 {
7076 /* DR1710: "In a qualified-id used as the name in
7077 a typename-specifier, elaborated-type-specifier, using-declaration,
7078 or class-or-decltype, an optional keyword template appearing at
7079 the top level is ignored." */
7081 && typename_keyword_p
7084 }
7086 /* Save the old scope since the name lookup we are about to do
7087 might destroy it. */
7090 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
7091 look up names in "X<T>::I" in order to determine that "Y" is
7092 a template. So, if we have a typename at this point, we make
7093 an effort to look through it. */
7095 && !check_dependency_p
7096 && !typename_keyword_p
7101 /* Parse the qualifying entity. */
7102 new_scope
7104 typename_keyword_p,
7105 template_keyword_p,
7106 check_dependency_p,
7107 type_p,
7108 is_declaration);
7109 /* Look for the `::' token. */
7112 /* If we found what we wanted, we keep going; otherwise, we're
7113 done. */
7115 {
7118 /* Restore the OLD_SCOPE since it was valid before the
7119 failed attempt at finding the last
7120 class-or-namespace-name. */
7124 /* If the next token is a decltype, and the one after that is a
7125 `::', then the decltype has failed to resolve to a class or
7126 enumeration type. Give this error even when parsing
7127 tentatively since it can't possibly be valid--and we're going
7128 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
7129 won't get another chance.*/
7133 {
7139 dtype);
7142 /* As below. */
7145 }
7149 {
7150 /* If we have a non-type template-id followed by ::, it can't
7151 possibly be valid. */
7156 {
7159 {
7166 else
7169 }
7170 else
7171 {
7177 else
7178 {
7179 /* Variable template. */
7183 }
7184 }
7191 /* As below. */
7195 }
7196 }
7200 /* If the next token is an identifier, and the one after
7201 that is a `::', then any valid interpretation would have
7202 found a class-or-namespace-name. */
7208 {
7211 {
7213 {
7214 tree decl;
7215 tree ambiguous_decls;
7218 none_type,
7227 decl);
7229 {
7230 // cp_parser_lookup_name has the same diagnostic,
7231 // thus make sure to emit it at most once.
7234 {
7239 }
7241 }
7242 else
7243 {
7245 cp_parser_name_lookup_error
7248 else
7249 cp_parser_name_lookup_error
7252 }
7253 }
7256 /* Treat this as a successful nested-name-specifier
7257 due to:
7259 [basic.lookup.qual]
7261 If the name found is not a class-name (clause
7262 _class_) or namespace-name (_namespace.def_), the
7263 program is ill-formed. */
7265 }
7267 }
7269 }
7270 /* We've found one valid nested-name-specifier. */
7272 /* Name lookup always gives us a DECL. */
7275 /* Uses of "template" must be followed by actual templates. */
7278 /* If it is a class scope, try to complete it; we are about to
7279 be looking up names inside the class. */
7281 /* Since checking types for dependency can be expensive,
7282 avoid doing it if the type is already complete. */
7284 /* Do not try to complete dependent types. */
7286 {
7288 /* If it is a typedef to current class, use the current
7289 class instead, as the typedef won't have any names inside
7290 it yet. */
7294 }
7295 /* Make sure we look in the right scope the next time through
7296 the loop. */
7298 }
7300 /* If parsing tentatively, replace the sequence of tokens that makes
7301 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
7302 token. That way, should we re-parse the token stream, we will
7303 not have to repeat the effort required to do the parse, nor will
7304 we issue duplicate error messages. */
7306 {
7310 /* Reset the contents of the START token. */
7312 /* Retrieve any deferred checks. Do not pop this access checks yet
7313 so the memory will not be reclaimed during token replacing below. */
7322 /* Purge all subsequent tokens. */
7324 }
7330 }
7332 /* Parse a nested-name-specifier. See
7333 cp_parser_nested_name_specifier_opt for details. This function
7334 behaves identically, except that it will an issue an error if no
7335 nested-name-specifier is present. */
7337 static tree
7343 {
7344 tree scope;
7346 /* Look for the nested-name-specifier. */
7348 typename_keyword_p,
7349 check_dependency_p,
7350 type_p,
7351 is_declaration);
7352 /* If it was not present, issue an error message. */
7354 {
7357 }
7360 }
7362 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
7363 this is either a class-name or a namespace-name (which corresponds
7364 to the class-or-namespace-name production in the grammar). For
7365 C++0x, it can also be a type-name that refers to an enumeration
7366 type or a simple-template-id.
7368 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
7369 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
7370 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
7371 TYPE_P is TRUE iff the next name should be taken as a class-name,
7372 even the same name is declared to be another entity in the same
7373 scope.
7375 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
7376 specified by the class-or-namespace-name. If neither is found the
7377 ERROR_MARK_NODE is returned. */
7379 static tree
7386 {
7387 tree saved_scope;
7388 tree saved_qualifying_scope;
7389 tree saved_object_scope;
7390 tree scope;
7394 /* DR 743: decltype can appear in a nested-name-specifier. */
7396 {
7400 {
7403 }
7407 }
7409 /* Before we try to parse the class-name, we must save away the
7410 current PARSER->SCOPE since cp_parser_class_name will destroy
7411 it. */
7415 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
7416 there is no need to look for a namespace-name. */
7417 only_class_p = template_keyword_p
7422 typename_keyword_p,
7423 template_keyword_p,
7425 check_dependency_p,
7427 is_declaration,
7430 /* If that didn't work, try for a namespace-name. */
7432 {
7433 /* Restore the saved scope. */
7437 /* If we are not looking at an identifier followed by the scope
7438 resolution operator, then this is not part of a
7439 nested-name-specifier. (Note that this function is only used
7440 to parse the components of a nested-name-specifier.) */
7445 }
7448 }
7450 /* Return true if we are looking at a compound-literal, false otherwise. */
7452 static bool
7454 {
7457 /* Skip tokens until the next token is a closing parenthesis.
7458 If we find the closing `)', and the next token is a `{', then
7459 we are looking at a compound-literal. */
7460 bool compound_literal_p
7465 /* Roll back the tokens we skipped. */
7469 }
7471 /* Return true if EXPR is the integer constant zero or a complex constant
7472 of zero, without any folding, but ignoring location wrappers. */
7474 bool
7476 {
7479 }
7481 /* Parse a postfix-expression.
7483 postfix-expression:
7484 primary-expression
7485 postfix-expression [ expression ]
7486 postfix-expression ( expression-list [opt] )
7487 simple-type-specifier ( expression-list [opt] )
7488 typename :: [opt] nested-name-specifier identifier
7489 ( expression-list [opt] )
7490 typename :: [opt] nested-name-specifier template [opt] template-id
7491 ( expression-list [opt] )
7492 postfix-expression . template [opt] id-expression
7493 postfix-expression -> template [opt] id-expression
7494 postfix-expression . pseudo-destructor-name
7495 postfix-expression -> pseudo-destructor-name
7496 postfix-expression ++
7497 postfix-expression --
7498 dynamic_cast < type-id > ( expression )
7499 static_cast < type-id > ( expression )
7500 reinterpret_cast < type-id > ( expression )
7501 const_cast < type-id > ( expression )
7502 typeid ( expression )
7503 typeid ( type-id )
7505 GNU Extension:
7507 postfix-expression:
7508 ( type-id ) { initializer-list , [opt] }
7510 This extension is a GNU version of the C99 compound-literal
7511 construct. (The C99 grammar uses `type-name' instead of `type-id',
7512 but they are essentially the same concept.)
7514 If ADDRESS_P is true, the postfix expression is the operand of the
7515 `&' operator. CAST_P is true if this expression is the target of a
7516 cast.
7518 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
7519 class member access expressions [expr.ref].
7521 Returns a representation of the expression. */
7523 static cp_expr
7527 {
7529 location_t loc;
7535 /* Peek at the next token. */
7540 /* Some of the productions are determined by keywords. */
7543 {
7548 {
7549 tree type;
7550 cp_expr expression;
7554 /* All of these can be handled in the same way from the point
7555 of view of parsing. Begin by consuming the token
7556 identifying the cast. */
7559 /* New types cannot be defined in the cast. */
7561 parser->type_definition_forbidden_message
7564 /* Look for the opening `<'. */
7566 /* Parse the type to which we are casting. */
7570 NULL);
7572 /* Look for the closing `>'. */
7574 /* Restore the old message. */
7577 bool saved_greater_than_is_operator_p
7581 /* And the expression which is being cast. */
7582 matching_parens parens;
7586 RT_CLOSE_PAREN);
7590 parser->greater_than_is_operator_p
7593 /* Only type conversions to integral or enumeration types
7594 can be used in constant-expressions. */
7597 {
7600 }
7602 /* Construct a location e.g. :
7603 reinterpret_cast <int *> (expr)
7604 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
7605 ranging from the start of the "*_cast" token to the final closing
7606 paren, with the caret at the start. */
7610 {
7612 postfix_expression
7614 tf_warning_or_error);
7617 postfix_expression
7619 tf_warning_or_error);
7622 postfix_expression
7624 tf_warning_or_error);
7627 postfix_expression
7629 tf_warning_or_error);
7633 }
7634 }
7638 {
7639 tree type;
7643 /* Consume the `typeid' token. */
7645 /* Look for the `(' token. */
7646 matching_parens parens;
7648 /* Types cannot be defined in a `typeid' expression. */
7650 parser->type_definition_forbidden_message
7652 /* We can't be sure yet whether we're looking at a type-id or an
7653 expression. */
7655 /* Try a type-id first. */
7660 /* Look for the `)' token. Otherwise, we can't be sure that
7661 we're not looking at an expression: consider `typeid (int
7662 (3))', for example. */
7664 /* If all went well, simply lookup the type-id. */
7667 /* Otherwise, fall back to the expression variant. */
7668 else
7669 {
7670 tree expression;
7672 /* Look for an expression. */
7674 /* Compute its typeid. */
7676 /* Look for the `)' token. */
7678 }
7679 /* Restore the saved message. */
7681 /* `typeid' may not appear in an integral constant expression. */
7685 /* Construct a location e.g. :
7686 typeid (expr)
7687 ^~~~~~~~~~~~~
7688 ranging from the start of the "typeid" token to the final closing
7689 paren, with the caret at the start. */
7691 {
7692 location_t typeid_loc
7696 }
7697 }
7701 {
7702 tree type;
7703 /* The syntax permitted here is the same permitted for an
7704 elaborated-type-specifier. */
7711 }
7719 {
7727 {
7730 }
7736 {
7739 postfix_expression
7741 else
7742 {
7746 }
7752 tf_warning_or_error);
7753 else
7754 {
7758 }
7766 else
7767 {
7771 }
7776 postfix_expression
7780 postfix_expression
7783 else
7784 {
7788 }
7793 {
7797 }
7798 else
7799 {
7800 postfix_expression
7802 }
7807 }
7809 }
7812 {
7813 tree expression;
7814 tree type;
7815 /* Consume the `__builtin_convertvector' token. */
7817 /* Look for the opening `('. */
7818 matching_parens parens;
7820 /* Now, parse the assignment-expression. */
7822 /* Look for the `,'. */
7824 location_t type_location
7826 /* Parse the type-id. */
7827 {
7830 }
7831 /* Look for the closing `)'. */
7833 postfix_expression
7835 tf_warning_or_error);
7837 }
7840 {
7841 tree expression;
7842 tree type;
7843 /* Consume the `__builtin_bit_cast' token. */
7845 /* Look for the opening `('. */
7846 matching_parens parens;
7848 location_t type_location
7850 /* Parse the type-id. */
7851 {
7854 }
7855 /* Look for the `,'. */
7857 /* Now, parse the assignment-expression. */
7859 /* Look for the closing `)'. */
7861 postfix_expression
7863 tf_warning_or_error);
7865 }
7868 {
7869 tree type;
7871 /* If the next thing is a simple-type-specifier, we may be
7872 looking at a functional cast. We could also be looking at
7873 an id-expression. So, we try the functional cast, and if
7874 that doesn't work we fall back to the primary-expression. */
7876 /* Look for the simple-type-specifier. */
7880 CP_PARSER_FLAGS_NONE);
7882 /* Parse the cast itself. */
7884 postfix_expression
7886 /* If that worked, we're done. */
7890 /* If the functional-cast didn't work out, try a
7891 compound-literal. */
7894 {
7899 matching_parens parens;
7902 /* Avoid calling cp_parser_type_id pointlessly, see comment
7903 in cp_parser_cast_expression about c++/29234. */
7906 else
7907 {
7908 /* Parse the type. */
7914 }
7916 /* If things aren't going well, there's no need to
7917 keep going. */
7919 /* Parse the brace-enclosed initializer list. */
7921 /* If that worked, we're definitely looking at a
7922 compound-literal expression. */
7924 {
7925 /* Warn the user that a compound literal is not
7926 allowed in standard C++. */
7929 /* For simplicity, we disallow compound literals in
7930 constant-expressions. We could
7931 allow compound literals of integer type, whose
7932 initializer was a constant, in constant
7933 expressions. Permitting that usage, as a further
7934 extension, would not change the meaning of any
7935 currently accepted programs. (Of course, as
7936 compound literals are not part of ISO C++, the
7937 standard has nothing to say.) */
7939 NIC_NCC))
7940 {
7943 }
7944 /* Form the representation of the compound-literal. */
7945 postfix_expression
7950 }
7951 }
7953 /* It must be a primary-expression. */
7954 postfix_expression
7957 decltype_p,
7959 }
7961 }
7963 /* Note that we don't need to worry about calling build_cplus_new on a
7964 class-valued CALL_EXPR in decltype when it isn't the end of the
7965 postfix-expression; unary_complex_lvalue will take care of that for
7966 all these cases. */
7968 /* Keep looping until the postfix-expression is complete. */
7970 {
7974 /* It is not a Koenig lookup function call. */
7975 postfix_expression
7978 /* Peek at the next token. */
7982 {
7985 {
7987 "two consecutive %<[%> shall "
7990 }
7991 postfix_expression
7993 postfix_expression,
7995 decltype_p);
8004 /* postfix-expression ( expression-list [opt] ) */
8005 {
8017 tree stripped_expression
8019 is_builtin_constant_p
8022 {
8023 /* The whole point of __builtin_constant_p is to allow
8024 non-constant expressions to appear as arguments. */
8025 saved_integral_constant_expression_p
8027 saved_non_integral_constant_expression_p
8030 }
8033 BUILT_IN_CLASSIFY_TYPE))
8034 {
8035 /* __builtin_classify_type (type) */
8042 NULL);
8045 cp_unevaluated uev;
8047 matching_parens parens;
8052 {
8054 {
8062 }
8063 else
8064 {
8065 postfix_expression
8068 }
8070 }
8071 }
8072 args = (cp_parser_parenthesized_expression_list
8079 {
8080 parser->integral_constant_expression_p
8082 parser->non_integral_constant_expression_p
8084 }
8087 {
8090 }
8092 /* Function calls are not permitted in
8093 constant-expressions. */
8096 NIC_FUNC_CALL))
8097 {
8101 }
8106 {
8108 /* In C++20, we may need to perform ADL for a template
8109 name. */
8112 {
8114 {
8117 postfix_expression
8119 complain);
8120 }
8121 else
8122 postfix_expression
8124 }
8125 /* We do not perform argument-dependent lookup if
8126 normal lookup finds a non-function, in accordance
8127 with the expected resolution of DR 218. */
8130 {
8131 /* Do not do argument dependent lookup if regular
8132 lookup finds a member function or a block-scope
8133 function declaration. [basic.lookup.argdep]/3 */
8137 {
8143 {
8146 }
8147 }
8150 {
8153 postfix_expression
8155 complain);
8156 }
8157 }
8158 }
8160 /* Temporarily set input_location to the combined location
8161 with call expression range, as e.g. build_out_target_exprs
8162 called from convert_default_arg relies on input_location,
8163 so updating it only when the call is fully built results
8164 in inconsistencies between location handling in templates
8165 and outside of templates. */
8168 close_paren_loc);
8174 postfix_expression = (build_offset_ref_call_from_tree
8176 complain));
8177 else
8178 /* All other function calls. */
8179 {
8184 {
8188 }
8190 postfix_expression
8192 disallow_virtual,
8193 koenig_p,
8194 complain);
8195 }
8200 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
8204 }
8209 /* postfix-expression . template [opt] id-expression
8210 postfix-expression . pseudo-destructor-name
8211 postfix-expression -> template [opt] id-expression
8212 postfix-expression -> pseudo-destructor-name */
8214 /* Consume the `.' or `->' operator. */
8217 postfix_expression
8219 postfix_expression,
8226 /* postfix-expression ++ */
8227 /* Consume the `++' token. */
8229 /* Generate a representation for the complete expression. */
8230 postfix_expression
8232 POSTINCREMENT_EXPR);
8233 /* Increments may not appear in constant-expressions. */
8241 /* postfix-expression -- */
8242 /* Consume the `--' token. */
8244 /* Generate a representation for the complete expression. */
8245 postfix_expression
8247 POSTDECREMENT_EXPR);
8248 /* Decrements may not appear in constant-expressions. */
8259 return is_member_access
8260 ? postfix_expression
8262 else
8264 }
8265 }
8266 }
8268 /* Helper function for cp_parser_parenthesized_expression_list and
8269 cp_parser_postfix_open_square_expression. Parse a single element
8270 of parenthesized expression list. */
8272 static cp_expr
8276 {
8280 /* Parse the next assignment-expression. */
8282 {
8283 /* A braced-init-list. */
8288 ? &expr_non_constant_p
8292 }
8294 {
8300 }
8301 else
8304 /* If we have an ellipsis, then this is an expression expansion. */
8307 {
8308 /* Consume the `...'. */
8311 /* Build the argument pack. */
8313 }
8315 }
8317 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8318 by cp_parser_builtin_offsetof. We're looking for
8320 postfix-expression [ expression ]
8321 postfix-expression [ braced-init-list ] (C++11)
8322 postfix-expression [ expression-list[opt] ] (C++23)
8324 FOR_OFFSETOF is set if we're being called in that context, which
8325 changes how we deal with integer constant expressions. */
8327 static tree
8329 tree postfix_expression,
8332 {
8339 /* Consume the `[' token. */
8349 /* Parse the index expression. */
8350 /* ??? For offsetof, there is a question of what to allow here. If
8351 offsetof is not being used in an integral constant expression context,
8352 then we *could* get the right answer by computing the value at runtime.
8353 If we are in an integral constant expression context, then we might
8354 could accept any constant expression; hard to say without analysis.
8355 Rather than open the barn door too wide right away, allow only integer
8356 constant expressions here. */
8361 {
8366 {
8368 {
8369 cp_expr expr
8371 /*cast_p=*/
8373 /*allow_exp_p=*/
8375 /*non_cst_p=*/
8376 NULL);
8383 else
8386 /* If the next token isn't a `,', then we are done. */
8391 {
8394 }
8396 /* Otherwise, consume the `,' and keep going. */
8398 }
8401 }
8403 {
8407 }
8408 else
8412 }
8420 {
8424 }
8427 {
8431 {
8433 {
8434 cp_expr expr
8436 /*cast_p=*/
8438 /*allow_exp_p=*/
8440 /*non_cst_p=*/
8441 NULL);
8445 else
8449 {
8453 }
8454 }
8455 else
8456 length
8460 }
8465 {
8468 }
8469 else
8473 length);
8474 }
8478 /* Look for the closing `]'. */
8481 /* Build the ARRAY_REF. */
8484 tf_warning_or_error
8487 /* When not doing offsetof, array references are not permitted in
8488 constant-expressions. */
8494 }
8496 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
8497 dereference of incomplete type, returns true if error_mark_node should
8498 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
8499 and *DEPENDENT_P. */
8501 bool
8504 {
8505 /* In a template, be permissive by treating an object expression
8506 of incomplete type as dependent (after a pedwarn). */
8507 diagnostic_t kind = (processing_template_decl
8511 {
8523 /* Don't emit any diagnostic for OVERLOADs. */
8527 /* Avoid clobbering e.g. DECLs. */
8531 }
8543 {
8546 }
8548 }
8550 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8551 by cp_parser_builtin_offsetof. We're looking for
8553 postfix-expression . template [opt] id-expression
8554 postfix-expression . pseudo-destructor-name
8555 postfix-expression -> template [opt] id-expression
8556 postfix-expression -> pseudo-destructor-name
8558 FOR_OFFSETOF is set if we're being called in that context. That sorta
8559 limits what of the above we'll actually accept, but nevermind.
8560 TOKEN_TYPE is the "." or "->" token, which will already have been
8561 removed from the stream. */
8563 static tree
8566 cp_expr postfix_expression,
8568 location_t location)
8569 {
8570 tree name;
8576 /* If this is a `->' operator, dereference the pointer. */
8579 tf_warning_or_error);
8580 /* Check to see whether or not the expression is type-dependent and
8581 not the current instantiation. */
8583 /* The identifier following the `->' or `.' is not qualified. */
8589 /* Enter the scope corresponding to the type of the object
8590 given by the POSTFIX_EXPRESSION. */
8592 {
8594 /* According to the standard, no expression should ever have
8595 reference type. Unfortunately, we do not currently match
8596 the standard in this respect in that our internal representation
8597 of an expression may have reference type even when the standard
8598 says it does not. Therefore, we have to manually obtain the
8599 underlying type here. */
8601 /* The type of the POSTFIX_EXPRESSION must be complete. */
8602 /* Unlike the object expression in other contexts, *this is not
8603 required to be of complete type for purposes of class member
8604 access (5.2.5) outside the member function body. */
8608 {
8614 }
8617 {
8618 /* Let the name lookup machinery know that we are processing a
8619 class member access expression. */
8621 /* If something went wrong, we want to be able to discern that case,
8622 as opposed to the case where there was no SCOPE due to the type
8623 of expression being dependent. */
8626 /* If the SCOPE was erroneous, make the various semantic analysis
8627 functions exit quickly -- and without issuing additional error
8628 messages. */
8631 }
8632 }
8635 {
8637 /* If we don't have a (type-dependent) object of class type, use
8638 typeof to figure out the type of the object. */
8642 }
8644 /* Assume this expression is not a pseudo-destructor access. */
8647 /* If the SCOPE is a scalar type, then, if this is a valid program,
8648 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
8649 is type dependent, it can be pseudo-destructor-name or something else.
8650 Try to parse it as pseudo-destructor-name first. */
8652 {
8653 tree s;
8654 tree type;
8657 /* Parse the pseudo-destructor-name. */
8666 {
8668 postfix_expression
8671 }
8672 }
8675 {
8676 /* If the SCOPE is not a scalar type, we are looking at an
8677 ordinary class member access expression, rather than a
8678 pseudo-destructor-name. */
8681 /* Parse the id-expression. */
8682 name = (cp_parser_id_expression
8689 /* In general, build a SCOPE_REF if the member name is qualified.
8690 However, if the name was not dependent and has already been
8691 resolved; there is no need to build the SCOPE_REF. For example;
8693 struct X { void f(); };
8694 template <typename T> void f(T* t) { t->X::f(); }
8696 Even though "t" is dependent, "X::f" is not and has been resolved
8697 to a BASELINK; there is no need to include scope information. */
8699 /* But we do need to remember that there was an explicit scope for
8700 virtual function calls. */
8704 /* If the name is a template-id that names a type, we will get a
8705 TYPE_DECL here. That is invalid code. */
8707 {
8710 }
8711 else
8712 {
8714 {
8716 {
8720 }
8721 else
8724 name,
8725 template_p);
8729 }
8731 adjust_result_of_qualified_name_lookup
8733 postfix_expression
8735 template_p,
8736 tf_warning_or_error);
8737 /* Build a location e.g.:
8738 ptr->access_expr
8739 ~~~^~~~~~~~~~~~~
8740 where the caret is at the deref token, ranging from
8741 the start of postfix_expression to the end of the access expr. */
8742 location_t combined_loc
8745 }
8746 }
8748 /* We no longer need to look up names in the scope of the object on
8749 the left-hand side of the `.' or `->' operator. */
8752 /* Outside of offsetof, these operators may not appear in
8753 constant-expressions. */
8755 && (cp_parser_non_integral_constant_expression
8760 }
8762 /* Parse a parenthesized expression-list.
8764 expression-list:
8765 assignment-expression
8766 expression-list, assignment-expression
8768 attribute-list:
8769 expression-list
8770 identifier
8771 identifier, expression-list
8773 CAST_P is true if this expression is the target of a cast.
8775 ALLOW_EXPANSION_P is true if this expression allows expansion of an
8776 argument pack.
8778 WRAP_LOCATIONS_P is true if expressions within this list for which
8779 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
8780 their source locations.
8782 Returns a vector of trees. Each element is a representation of an
8783 assignment-expression. NULL is returned if the ( and or ) are
8784 missing. An empty, but allocated, vector is returned on no
8785 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
8786 if we are parsing an attribute list for an attribute that wants a
8787 plain identifier argument, normal_attr for an attribute that wants
8788 an expression, or non_attr if we aren't parsing an attribute list. If
8789 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
8790 not all of the expressions in the list were constant.
8791 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
8792 will be written to with the location of the closing parenthesis. If
8793 an error occurs, it may or may not be written to. */
8803 {
8808 /* Assume all the expressions will be constant. */
8812 matching_parens parens;
8818 /* Within a parenthesized expression, a `>' token is always
8819 the greater-than operator. */
8820 saved_greater_than_is_operator_p
8829 /* Consume expressions until there are no more. */
8832 {
8833 /* At the beginning of attribute lists, check to see if the
8834 next token is an identifier. */
8842 else
8843 expr
8845 allow_expansion_p,
8846 non_constant_p);
8851 /* Add it to the list. We add error_mark_node
8852 expressions to the list, so that we can still tell if
8853 the correct form for a parenthesized expression-list
8854 is found. That gives better errors. */
8860 /* After the first item, attribute lists look the same as
8861 expression lists. */
8864 get_comma:;
8865 /* If the next token isn't a `,', then we are done. */
8869 /* Otherwise, consume the `,' and keep going. */
8871 }
8877 {
8880 skip_comma:;
8881 /* We try and resync to an unnested comma, as that will give the
8882 user better diagnostics. */
8890 {
8891 parser->greater_than_is_operator_p
8895 }
8896 }
8898 parser->greater_than_is_operator_p
8903 }
8905 /* Parse a pseudo-destructor-name.
8907 pseudo-destructor-name:
8908 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
8909 :: [opt] nested-name-specifier template template-id :: ~ type-name
8910 :: [opt] nested-name-specifier [opt] ~ type-name
8912 If either of the first two productions is used, sets *SCOPE to the
8913 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
8914 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
8915 or ERROR_MARK_NODE if the parse fails. */
8917 static void
8919 tree object,
8922 {
8925 /* Handle ~auto. */
8929 {
8932 "%<~auto%> only available with "
8939 }
8941 /* Assume that things will not work out. */
8944 /* Look for the optional `::' operator. */
8946 /* Look for the optional nested-name-specifier. */
8947 nested_name_specifier_p
8954 /* Now, if we saw a nested-name-specifier, we might be doing the
8955 second production. */
8958 {
8959 /* Consume the `template' keyword. */
8961 /* Parse the template-id. */
8965 class_type,
8967 /* Look for the `::' token. */
8969 }
8970 /* If the next token is not a `~', then there might be some
8971 additional qualification. */
8973 {
8974 /* At this point, we're looking for "type-name :: ~". The type-name
8975 must not be a class-name, since this is a pseudo-destructor. So,
8976 it must be either an enum-name, or a typedef-name -- both of which
8977 are just identifiers. So, we peek ahead to check that the "::"
8978 and "~" tokens are present; if they are not, then we can avoid
8979 calling type_name. */
8983 {
8986 }
8988 /* Look for the type-name. */
8993 /* Look for the `::' token. */
8995 }
8996 else
8999 /* Look for the `~'. */
9002 /* Once we see the ~, this has to be a pseudo-destructor. */
9006 /* Look for the type-name again. We are not responsible for
9007 checking that it matches the first type-name. */
9009 }
9011 /* Parse a unary-expression.
9013 unary-expression:
9014 postfix-expression
9015 ++ cast-expression
9016 -- cast-expression
9017 await-expression
9018 unary-operator cast-expression
9019 sizeof unary-expression
9020 sizeof ( type-id )
9021 alignof ( type-id ) [C++0x]
9022 new-expression
9023 delete-expression
9025 GNU Extensions:
9027 unary-expression:
9028 __extension__ cast-expression
9029 __alignof__ unary-expression
9030 __alignof__ ( type-id )
9031 alignof unary-expression [C++0x]
9032 __real__ cast-expression
9033 __imag__ cast-expression
9034 && identifier
9035 sizeof ( type-id ) { initializer-list , [opt] }
9036 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
9037 __alignof__ ( type-id ) { initializer-list , [opt] }
9039 ADDRESS_P is true iff the unary-expression is appearing as the
9040 operand of the `&' operator. CAST_P is true if this expression is
9041 the target of a cast.
9043 Returns a representation of the expression. */
9045 static cp_expr
9048 {
9052 /* Peek at the next token. */
9054 /* Some keywords give away the kind of expression. */
9056 {
9060 {
9063 {
9071 /* Consume the token. */
9073 /* Parse the operand. */
9076 /* Construct a location e.g. :
9077 alignof (expr)
9078 ^~~~~~~~~~~~~~
9079 with start == caret at the start of the "alignof"/"sizeof"
9080 token, with the endpoint at the final closing paren. */
9081 location_t compound_loc
9087 else
9088 {
9089 /* ISO C++ defines alignof only with types, not with
9090 expressions. So pedwarn if alignof is used with a non-
9091 type expression. However, __alignof__ is ok. */
9094 "ISO C++ does not allow %<alignof%> "
9099 }
9100 /* For SIZEOF_EXPR, just issue diagnostics, but keep
9101 SIZEOF_EXPR with the original operand. */
9103 {
9105 {
9107 {
9110 error_mark_node));
9112 }
9113 else
9118 }
9119 }
9124 }
9136 {
9137 /* The saved value of the PEDANTIC flag. */
9139 tree expr;
9141 /* Save away the PEDANTIC flag. */
9143 /* Parse the cast-expression. */
9145 /* Restore the PEDANTIC flag. */
9149 }
9153 {
9154 tree expression;
9156 /* Consume the `__real__' or `__imag__' token. */
9158 /* Parse the cast-expression. */
9160 /* Create the complete representation. */
9165 tf_warning_or_error);
9166 }
9174 {
9175 tree expr;
9184 matching_parens parens;
9188 parser->type_definition_forbidden_message
9191 saved_integral_constant_expression_p
9193 saved_non_integral_constant_expression_p
9197 saved_greater_than_is_operator_p
9209 parser->greater_than_is_operator_p
9212 parser->integral_constant_expression_p
9214 parser->non_integral_constant_expression_p
9221 /* Construct a location of the form:
9222 noexcept (expr)
9223 ^~~~~~~~~~~~~~~
9224 with start == caret, finishing at the close-paren. */
9225 location_t noexcept_loc
9229 noexcept_loc);
9230 }
9233 {
9234 tree expr;
9237 /* Consume the `co_await' token. */
9239 /* Parse its cast-expression. */
9244 /* Handle [expr.await]. */
9246 }
9250 }
9251 }
9253 /* Look for the `:: new' and `:: delete', which also signal the
9254 beginning of a new-expression, or delete-expression,
9255 respectively. If the next token is `::', then it might be one of
9256 these. */
9258 {
9261 /* See if the token after the `::' is one of the keywords in
9262 which we're interested. */
9264 /* If it's `new', we have a new-expression. */
9267 /* Similarly, for `delete'. */
9270 }
9272 /* Look for a unary operator. */
9274 /* The `++' and `--' operators can be handled similarly, even though
9275 they are not technically unary-operators in the grammar. */
9277 {
9282 /* Handle the GNU address-of-label extension. */
9285 {
9286 tree identifier;
9287 tree expression;
9290 /* Consume the '&&' token. */
9292 /* Look for the identifier. */
9294 /* Construct a location of the form:
9295 &&label
9296 ^~~~~~~
9297 with caret==start at the "&&", finish at the end of the label. */
9298 location_t combined_loc
9300 /* Create an expression representing the address. */
9305 NIC_ADDR_LABEL))
9308 }
9309 }
9311 {
9312 cp_expr cast_expression;
9318 /* Consume the operator token. */
9322 /* Parse the cast-expression. */
9323 cast_expression
9328 pidk);
9330 /* Make a location:
9331 OP_TOKEN CAST_EXPRESSION
9332 ^~~~~~~~~~~~~~~~~~~~~~~~~
9333 with start==caret at the operator token, and
9334 extending to the end of the cast_expression. */
9337 /* Now, build an appropriate representation. */
9339 {
9344 complain);
9345 /* TODO: build_x_indirect_ref does not always honor the
9346 location, so ensure it is set. */
9352 /* Fall through. */
9355 cast_expression,
9357 /* TODO: build_x_unary_op does not always honor the location,
9358 so ensure it is set. */
9366 /* Fall through. */
9368 /* Immediately fold negation of a constant, unless the constant is 0
9369 (since -0 == 0) or it would overflow. */
9371 {
9372 tree stripped_expr
9377 {
9380 stripped_expr);
9382 {
9385 }
9386 }
9387 }
9388 /* Fall through. */
9397 }
9401 non_constant_p))
9405 }
9409 decltype_p,
9410 pidk);
9411 }
9413 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
9414 unary-operator, the corresponding tree code is returned. */
9416 static enum tree_code
9418 {
9420 {
9441 }
9442 }
9444 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
9445 Returns a representation of the expression. */
9447 static tree
9449 {
9452 /* Consume the __builtin_has_attribute token. */
9455 matching_parens parens;
9459 /* Types cannot be defined in a `sizeof' expression. Save away the
9460 old message. */
9464 parser->type_definition_forbidden_message
9466 parser->type_definition_forbidden_message_arg
9469 /* The restrictions on constant-expressions do not apply inside
9470 sizeof expressions. */
9471 bool saved_integral_constant_expression_p
9473 bool saved_non_integral_constant_expression_p
9477 /* Do not actually evaluate the expression. */
9483 /* We can't be sure yet whether we're looking at a type-id or an
9484 expression. */
9489 /* Look for the type-id. */
9495 /* If the type-id production did not work out, then we must be
9496 looking at an expression. */
9502 /* Go back to evaluating expressions. */
9506 /* And restore the old one. */
9509 parser->integral_constant_expression_p
9511 parser->non_integral_constant_expression_p
9514 /* Consume the comma if it's there. */
9516 {
9520 }
9522 /* Parse the attribute specification. */
9526 {
9532 else
9533 {
9534 /* Fold constant expressions used in attributes first. */
9537 /* Finally, see if OPER has been declared with ATTR. */
9539 }
9542 }
9543 else
9544 {
9547 }
9549 /* Construct a location e.g. :
9550 __builtin_has_attribute (oper, attr)
9551 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
9552 with start == caret at the start of the built-in token,
9553 and with the endpoint at the final closing paren. */
9554 location_t compound_loc
9561 }
9563 /* Parse a new-expression.
9565 new-expression:
9566 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
9567 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
9569 Returns a representation of the expression. */
9571 static tree
9573 {
9576 tree type;
9579 tree ret;
9583 /* Look for the optional `::' operator. */
9584 global_scope_p
9588 /* Look for the `new' operator. */
9590 /* There's no easy way to tell a new-placement from the
9591 `( type-id )' construct. */
9593 /* Look for a new-placement. */
9595 /* If that didn't work out, there's no new-placement. */
9597 {
9601 }
9603 /* If the next token is a `(', then we have a parenthesized
9604 type-id. */
9606 {
9610 /* Consume the `('. */
9611 matching_parens parens;
9614 /* Parse the type-id. */
9615 parser->type_definition_forbidden_message
9617 {
9620 }
9623 /* Look for the closing `)'. */
9626 /* There should not be a direct-new-declarator in this production,
9627 but GCC used to allowed this, so we check and emit a sensible error
9628 message for this case. */
9630 {
9636 }
9637 }
9638 /* Otherwise, there must be a new-type-id. */
9639 else
9642 /* If the next token is a `(' or '{', then we have a new-initializer. */
9647 else
9650 /* A new-expression may not appear in an integral constant
9651 expression. */
9654 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
9655 of a new-type-id or type-id of a new-expression, the new-expression shall
9656 contain a new-initializer of the form ( assignment-expression )".
9657 Additionally, consistently with the spirit of DR 1467, we want to accept
9658 'new auto { 2 }' too. */
9664 {
9666 "initialization of new-expression for type %<auto%> "
9669 }
9670 else
9671 {
9672 /* Construct a location e.g.:
9673 ptr = new int[100]
9674 ^~~~~~~~~~~~
9675 with caret == start at the start of the "new" token, and the end
9676 at the end of the final token we consumed. */
9679 /* Create a representation of the new-expression. */
9682 }
9690 }
9692 /* Parse a new-placement.
9694 new-placement:
9695 ( expression-list )
9697 Returns the same representation as for an expression-list. */
9701 {
9704 /* Parse the expression-list. */
9705 expression_list = (cp_parser_parenthesized_expression_list
9714 }
9716 /* Parse a new-type-id.
9718 new-type-id:
9719 type-specifier-seq new-declarator [opt]
9721 Returns the TYPE allocated. If the new-type-id indicates an array
9722 type, *NELTS is set to the number of elements in the last array
9723 bound; the TYPE will not include the last array bound. */
9725 static tree
9727 {
9728 cp_decl_specifier_seq type_specifier_seq;
9734 /* The type-specifier sequence must not contain type definitions.
9735 (It cannot contain declarations of new types either, but if they
9736 are not definitions we will catch that because they are not
9737 complete.) */
9739 parser->type_definition_forbidden_message
9741 /* Parse the type-specifier-seq. */
9746 /* Restore the old message. */
9752 /* Parse the new-declarator. */
9755 /* Determine the number of elements in the last array dimension, if
9756 any. */
9758 /* Skip down to the last array dimension. */
9763 {
9766 }
9771 {
9774 }
9777 {
9786 else
9788 }
9791 }
9793 /* Parse an (optional) new-declarator.
9795 new-declarator:
9796 ptr-operator new-declarator [opt]
9797 direct-new-declarator
9799 Returns the declarator. */
9803 {
9806 cp_cv_quals cv_quals;
9808 /* We don't know if there's a ptr-operator next, or not. */
9810 /* Look for a ptr-operator. */
9812 /* If that worked, look for more new-declarators. */
9814 {
9817 /* Parse another optional declarator. */
9820 declarator = cp_parser_make_indirect_declarator
9824 }
9826 /* If the next token is a `[', there is a direct-new-declarator. */
9831 }
9833 /* Parse a direct-new-declarator.
9835 direct-new-declarator:
9836 [ expression ]
9837 direct-new-declarator [constant-expression]
9839 */
9843 {
9848 {
9849 tree expression;
9852 /* Look for the opening `['. */
9858 else
9860 /* The standard requires that the expression have integral
9861 type. DR 74 adds enumeration types. We believe that the
9862 real intent is that these expressions be handled like the
9863 expression in a `switch' condition, which also allows
9864 classes with a single conversion to integral or
9865 enumeration type. */
9867 {
9868 expression
9870 expression,
9873 {
9875 "expression in new-declarator must have integral "
9878 }
9879 }
9881 /* Look for the closing `]'. */
9884 /* Add this bound to the declarator. */
9887 /* If the next token is not a `[', then there are no more
9888 bounds. */
9892 }
9895 }
9897 /* Parse a new-initializer.
9899 new-initializer:
9900 ( expression-list [opt] )
9901 braced-init-list
9903 Returns a representation of the expression-list. */
9907 {
9911 {
9917 }
9918 else
9919 expression_list = (cp_parser_parenthesized_expression_list
9925 }
9927 /* Parse a delete-expression.
9929 delete-expression:
9930 :: [opt] delete cast-expression
9931 :: [opt] delete [ ] cast-expression
9933 Returns a representation of the expression. */
9935 static tree
9937 {
9940 tree expression;
9943 /* Look for the optional `::' operator. */
9944 global_scope_p
9948 /* Look for the `delete' keyword. */
9950 /* See if the array syntax is in use. */
9952 {
9953 /* Consume the `[' token. */
9955 /* Look for the `]' token. */
9957 /* Remember that this is the `[]' construct. */
9959 }
9960 else
9963 /* Parse the cast-expression. */
9966 /* A delete-expression may not appear in an integral constant
9967 expression. */
9971 /* Construct a location e.g.:
9972 delete [ ] ptr
9973 ^~~~~~~~~~~~~~
9974 with caret == start at the start of the "delete" token, and
9975 the end at the end of the final token we consumed. */
9982 }
9984 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
9985 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
9986 0 otherwise. */
9988 static int
9990 {
9993 {
10035 /* In ((type ()) () the last () isn't a valid cast-expression,
10036 so the whole must be parsed as postfix-expression. */
10041 /* '[' may start a primary-expression in obj-c++ and in C++11,
10042 as a lambda-expression, eg, '(void)[]{}'. */
10049 /* '++' and '--' may or may not start a cast-expression:
10051 struct T { void operator++(int); };
10052 void f() { (T())++; }
10054 vs
10056 int a;
10057 (int)++a; */
10062 }
10063 }
10065 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
10066 in the order: const_cast, static_cast, reinterpret_cast.
10068 Don't suggest dynamic_cast.
10070 Return the first legal cast kind found, or NULL otherwise. */
10074 {
10075 tree trial;
10077 /* Reuse the parser logic by attempting to build the various kinds of
10078 cast, with "complain" disabled.
10079 Identify the first such cast that is valid. */
10081 /* Don't attempt to run such logic within template processing. */
10085 /* First try const_cast. */
10090 /* If that fails, try static_cast. */
10095 /* Finally, try reinterpret_cast. */
10097 tf_none);
10101 /* No such cast possible. */
10103 }
10105 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
10106 suggesting how to convert a C-style cast of the form:
10108 (DST_TYPE)ORIG_EXPR
10110 to a C++-style cast.
10112 The primary range of RICHLOC is asssumed to be that of the original
10113 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
10114 of the parens in the C-style cast. */
10116 static void
10119 tree dst_type)
10120 {
10121 /* This function is non-trivial, so bail out now if the warning isn't
10122 going to be emitted. */
10126 /* Try to find a legal C++ cast, trying them in order:
10127 const_cast, static_cast, reinterpret_cast. */
10132 /* Replace the open paren with "CAST_SUGGESTION<". */
10133 pretty_printer pp;
10138 /* Replace the close paren with "> (". */
10141 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
10143 }
10146 /* Parse a cast-expression.
10148 cast-expression:
10149 unary-expression
10150 ( type-id ) cast-expression
10152 ADDRESS_P is true iff the unary-expression is appearing as the
10153 operand of the `&' operator. CAST_P is true if this expression is
10154 the target of a cast.
10156 Returns a representation of the expression. */
10158 static cp_expr
10161 {
10162 /* If it's a `(', then we might be looking at a cast. */
10164 {
10170 /* There's no way to know yet whether or not this is a cast.
10171 For example, `(int (3))' is a unary-expression, while `(int)
10172 3' is a cast. So, we resort to parsing tentatively. */
10174 /* Types may not be defined in a cast. */
10176 parser->type_definition_forbidden_message
10178 /* Consume the `('. */
10179 matching_parens parens;
10184 /* A very tricky bit is that `(struct S) { 3 }' is a
10185 compound-literal (which we permit in C++ as an extension).
10186 But, that construct is not a cast-expression -- it is a
10187 postfix-expression. (The reason is that `(struct S) { 3 }.i'
10188 is legal; if the compound-literal were a cast-expression,
10189 you'd need an extra set of parentheses.) But, if we parse
10190 the type-id, and it happens to be a class-specifier, then we
10191 will commit to the parse at that point, because we cannot
10192 undo the action that is done when creating a new class. So,
10193 then we cannot back up and do a postfix-expression.
10195 Another tricky case is the following (c++/29234):
10197 struct S { void operator () (); };
10199 void foo ()
10200 {
10201 ( S()() );
10202 }
10204 As a type-id we parse the parenthesized S()() as a function
10205 returning a function, groktypename complains and we cannot
10206 back up in this case either.
10208 Therefore, we scan ahead to the closing `)', and check to see
10209 if the tokens after the `)' can start a cast-expression. Otherwise
10210 we are dealing with an unary-expression, a postfix-expression
10211 or something else.
10213 Yet another tricky case, in C++11, is the following (c++/54891):
10215 (void)[]{};
10217 The issue is that usually, besides the case of lambda-expressions,
10218 the parenthesized type-id cannot be followed by '[', and, eg, we
10219 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
10220 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
10221 we don't commit, we try a cast-expression, then an unary-expression.
10223 Save tokens so that we can put them back. */
10226 /* We may be looking at a cast-expression. */
10229 cast_expression
10232 /* Roll back the tokens we skipped. */
10234 /* If we aren't looking at a cast-expression, simulate an error so
10235 that the call to cp_parser_error_occurred below returns true. */
10238 else
10239 {
10242 /* Look for the type-id. */
10244 /* Look for the closing `)'. */
10249 }
10251 /* Restore the saved message. */
10254 /* At this point this can only be either a cast or a
10255 parenthesized ctor such as `(T ())' that looks like a cast to
10256 function returning T. */
10258 {
10259 /* Only commit if the cast-expression doesn't start with
10260 '++', '--', or '[' in C++11. */
10268 pidk);
10271 {
10272 /* Warn about old-style casts, if so requested. */
10277 {
10283 }
10285 /* Only type conversions to integral or enumeration types
10286 can be used in constant-expressions. */
10289 NIC_CAST))
10292 /* Perform the cast. */
10293 /* Make a location:
10294 (TYPE) EXPR
10295 ^~~~~~~~~~~
10296 with start==caret at the open paren, extending to the
10297 end of "expr". */
10299 open_paren_loc,
10303 }
10304 }
10305 else
10307 }
10309 /* If we get here, then it's not a cast, so it must be a
10310 unary-expression. */
10313 }
10315 /* Parse a binary expression of the general form:
10317 pm-expression:
10318 cast-expression
10319 pm-expression .* cast-expression
10320 pm-expression ->* cast-expression
10322 multiplicative-expression:
10323 pm-expression
10324 multiplicative-expression * pm-expression
10325 multiplicative-expression / pm-expression
10326 multiplicative-expression % pm-expression
10328 additive-expression:
10329 multiplicative-expression
10330 additive-expression + multiplicative-expression
10331 additive-expression - multiplicative-expression
10333 shift-expression:
10334 additive-expression
10335 shift-expression << additive-expression
10336 shift-expression >> additive-expression
10338 relational-expression:
10339 shift-expression
10340 relational-expression < shift-expression
10341 relational-expression > shift-expression
10342 relational-expression <= shift-expression
10343 relational-expression >= shift-expression
10345 GNU Extension:
10347 relational-expression:
10348 relational-expression <? shift-expression
10349 relational-expression >? shift-expression
10351 equality-expression:
10352 relational-expression
10353 equality-expression == relational-expression
10354 equality-expression != relational-expression
10356 and-expression:
10357 equality-expression
10358 and-expression & equality-expression
10360 exclusive-or-expression:
10361 and-expression
10362 exclusive-or-expression ^ and-expression
10364 inclusive-or-expression:
10365 exclusive-or-expression
10366 inclusive-or-expression | exclusive-or-expression
10368 logical-and-expression:
10369 inclusive-or-expression
10370 logical-and-expression && inclusive-or-expression
10372 logical-or-expression:
10373 logical-and-expression
10374 logical-or-expression || logical-and-expression
10376 All these are implemented with a single function like:
10378 binary-expression:
10379 simple-cast-expression
10380 binary-expression <token> binary-expression
10382 CAST_P is true if this expression is the target of a cast.
10384 The binops_by_token map is used to get the tree codes for each <token> type.
10385 binary-expressions are associated according to a precedence table. */
10387 #define TOKEN_PRECEDENCE(token) \
10388 (((token->type == CPP_GREATER \
10389 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
10390 && !parser->greater_than_is_operator_p) \
10391 ? PREC_NOT_OPERATOR \
10392 : binops_by_token[token->type].prec)
10394 static cp_expr
10400 {
10401 cp_parser_expression_stack stack;
10404 cp_parser_expression_stack_entry current;
10405 cp_expr rhs;
10409 tree overload;
10411 /* Parse the first expression. */
10422 {
10423 /* Get an operator token. */
10429 {
10431 "%<>>%> operator is treated"
10435 }
10440 /* This is a fold-expression; handle it later. */
10443 /* Popping an entry off the stack means we completed a subexpression:
10444 - either we found a token which is not an operator (`>' where it is not
10445 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
10446 will happen repeatedly;
10447 - or, we found an operator which has lower priority. This is the case
10448 where the recursive descent *ascends*, as in `3 * 4 + 5' after
10449 parsing `3 * 4'. */
10451 {
10454 else
10456 }
10458 get_rhs:
10463 /* We used the operator token. */
10466 /* For "false && x" or "true || x", x will never be executed;
10467 disable warnings while evaluating it. */
10472 {
10475 }
10477 /* Extract another operand. It may be the RHS of this expression
10478 or the LHS of a new, higher priority expression. */
10483 /* Get another operator token. Look up its precedence to avoid
10484 building a useless (immediately popped) stack entry for common
10485 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
10492 {
10493 /* ... and prepare to parse the RHS of the new, higher priority
10494 expression. Since precedence levels on the stack are
10495 monotonically increasing, we do not have to care about
10496 stack overflows. */
10505 pop:
10507 /* If the stack is not empty, we have parsed into LHS the right side
10508 (`4' in the example above) of an expression we had suspended.
10509 We can use the information on the stack to recover the LHS (`3')
10510 from the stack together with the tree code (`MULT_EXPR'), and
10511 the precedence of the higher level subexpression
10512 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
10513 which will be used to actually build the additive expression. */
10518 }
10520 /* Undo the disabling of warnings done above. */
10522 {
10525 }
10530 /* Avoid warning for !!x == y. */
10535 /* Avoid warning for !b == y where b is boolean. */
10539 /* Avoid warning for !!b == y where b is boolean. */
10551 /* Don't warn for named "xor" (as opposed to '^'). */
10555 check_for_xor_used_as_pow
10568 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
10569 ERROR_MARK for everything that is not a binary expression.
10570 This makes warn_about_parentheses miss some warnings that
10571 involve unary operators. For unary expressions we should
10572 pass the correct tree_code unless the unary expression was
10573 surrounded by parentheses.
10574 */
10578 {
10581 else
10582 {
10585 current.lhs
10588 == tcc_comparison
10592 }
10593 }
10594 else
10595 {
10601 /* TODO: build_x_binary_op doesn't always honor the location. */
10603 }
10606 /* If the binary operator required the use of an overloaded operator,
10607 then this expression cannot be an integral constant-expression.
10608 An overloaded operator can be used even if both operands are
10609 otherwise permissible in an integral constant-expression if at
10610 least one of the operands is of enumeration type. */
10614 NIC_OVERLOADED))
10616 }
10619 }
10621 static cp_expr
10626 {
10629 }
10631 /* Parse the `? expression : assignment-expression' part of a
10632 conditional-expression. The LOGICAL_OR_EXPR is the
10633 logical-or-expression that started the conditional-expression.
10634 Returns a representation of the entire conditional-expression.
10636 This routine is used by cp_parser_assignment_expression
10637 and cp_parser_conditional_expression.
10639 ? expression : assignment-expression
10641 GNU Extensions:
10643 ? : assignment-expression */
10645 static tree
10647 {
10649 cp_expr assignment_expr;
10653 /* Consume the `?' token. */
10658 {
10661 /* Implicit true clause. */
10663 c_inhibit_evaluation_warnings +=
10666 }
10667 else
10668 {
10671 /* Parse the expression. */
10672 c_inhibit_evaluation_warnings +=
10675 c_inhibit_evaluation_warnings +=
10679 }
10681 /* The next token should be a `:'. */
10683 /* Parse the assignment-expression. */
10685 c_inhibit_evaluation_warnings -=
10688 /* Make a location:
10689 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
10690 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
10691 with the caret at the "?", ranging from the start of
10692 the logical_or_expr to the end of the assignment_expr. */
10697 /* Build the conditional-expression. */
10699 expr,
10700 assignment_expr,
10701 tf_warning_or_error);
10702 }
10704 /* Parse a conditional-expression.
10706 conditional-expression:
10707 logical-or-expression
10708 logical-or-expression ? expression : assignment-expression
10710 GNU Extensions:
10712 logical-or-expression ? : assignment-expression */
10714 static cp_expr
10716 {
10719 /* If the next token is a `?' then we're actually looking at
10720 a conditional-expression; otherwise we're done. */
10724 }
10726 /* Parse an assignment-expression.
10728 assignment-expression:
10729 conditional-expression
10730 logical-or-expression assignment-operator assignment_expression
10731 throw-expression
10732 yield-expression
10734 CAST_P is true if this expression is the target of a cast.
10735 DECLTYPE_P is true if this expression is the operand of decltype.
10737 Returns a representation for the expression. */
10739 static cp_expr
10742 {
10743 cp_expr expr;
10745 /* If the next token is the `throw' keyword, then we're looking at
10746 a throw-expression. */
10749 /* If the next token is the `co_yield' keyword, then we're looking at
10750 a yield-expression. */
10753 /* Otherwise, it must be that we are looking at a
10754 logical-or-expression. */
10755 else
10756 {
10757 /* Parse the binary expressions (logical-or-expression). */
10759 decltype_p,
10761 /* If the next token is a `?' then we're actually looking at a
10762 conditional-expression. */
10765 else
10766 {
10769 /* If it's an assignment-operator, we're using the second
10770 production. */
10771 enum tree_code assignment_operator
10774 {
10775 /* Parse the right-hand side of the assignment. */
10781 /* An assignment may not appear in a
10782 constant-expression. */
10784 NIC_ASSIGNMENT))
10786 /* Build the assignment expression. Its default
10787 location:
10788 LHS = RHS
10789 ~~~~^~~~~
10790 is the location of the '=' token as the
10791 caret, ranging from the start of the lhs to the
10792 end of the rhs. */
10797 assignment_operator,
10800 /* TODO: build_x_modify_expr doesn't honor the location,
10801 so we must set it here. */
10803 }
10804 }
10805 }
10808 }
10810 /* Parse an (optional) assignment-operator.
10812 assignment-operator: one of
10813 = *= /= %= += -= >>= <<= &= ^= |=
10815 GNU Extension:
10817 assignment-operator: one of
10818 <?= >?=
10820 If the next token is an assignment operator, the corresponding tree
10821 code is returned, and the token is consumed. For example, for
10822 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
10823 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
10824 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
10825 operator, ERROR_MARK is returned. */
10827 static enum tree_code
10829 {
10833 /* Peek at the next token. */
10837 {
10883 /* Nothing else is an assignment operator. */
10885 }
10887 /* An operator followed by ... is a fold-expression, handled elsewhere. */
10892 /* If it was an assignment operator, consume it. */
10897 }
10899 /* Parse an expression.
10901 expression:
10902 assignment-expression
10903 expression , assignment-expression
10905 CAST_P is true if this expression is the target of a cast.
10906 DECLTYPE_P is true if this expression is the immediate operand of decltype,
10907 except possibly parenthesized or on the RHS of a comma (N3276).
10908 WARN_COMMA_P is true if a comma should be diagnosed.
10910 Returns a representation of the expression. */
10912 static cp_expr
10915 {
10920 {
10921 cp_expr assignment_expression;
10923 /* Parse the next assignment-expression. */
10924 assignment_expression
10927 /* We don't create a temporary for a call that is the immediate operand
10928 of decltype or on the RHS of a comma. But when we see a comma, we
10929 need to create a temporary for a call on the LHS. */
10934 assignment_expression
10938 /* If this is the first assignment-expression, we can just
10939 save it away. */
10942 else
10943 {
10944 /* Create a location with caret at the comma, ranging
10945 from the start of the LHS to the end of the RHS. */
10953 }
10954 /* If the next token is not a comma, or we're in a fold-expression, then
10955 we are done with the expression. */
10959 /* Consume the `,'. */
10962 {
10963 /* [depr.comma.subscript]: A comma expression appearing as
10964 the expr-or-braced-init-list of a subscripting expression
10965 is deprecated. A parenthesized comma expression is not
10966 deprecated. */
10968 "top-level comma expression in array subscript "
10971 }
10973 /* A comma operator cannot appear in a constant-expression. */
10976 }
10979 }
10981 /* Parse a constant-expression.
10983 constant-expression:
10984 conditional-expression
10986 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
10987 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
10988 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
10989 is false, NON_CONSTANT_P should be NULL. If ALLOW_NON_CONSTANT_P is
10990 greater than 1, this isn't really a constant-expression, only a
10991 potentially constant-evaluated expression. If STRICT_P is true,
10992 only parse a conditional-expression, otherwise parse an
10993 assignment-expression. See below for rationale. */
10995 static cp_expr
11000 {
11001 /* It might seem that we could simply parse the
11002 conditional-expression, and then check to see if it were
11003 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
11004 one that the compiler can figure out is constant, possibly after
11005 doing some simplifications or optimizations. The standard has a
11006 precise definition of constant-expression, and we must honor
11007 that, even though it is somewhat more restrictive.
11009 For example:
11011 int i[(2, 3)];
11013 is not a legal declaration, because `(2, 3)' is not a
11014 constant-expression. The `,' operator is forbidden in a
11015 constant-expression. However, GCC's constant-folding machinery
11016 will fold this operation to an INTEGER_CST for `3'. */
11018 /* Save the old settings. */
11019 bool saved_integral_constant_expression_p
11021 bool saved_allow_non_integral_constant_expression_p
11023 bool saved_non_integral_constant_expression_p
11025 /* We are now parsing a constant-expression. */
11027 parser->allow_non_integral_constant_expression_p
11031 /* A manifestly constant-evaluated expression is evaluated even in an
11032 unevaluated operand. */
11035 /* Although the grammar says "conditional-expression", when not STRICT_P,
11036 we parse an "assignment-expression", which also permits
11037 "throw-expression" and the use of assignment operators. In the case
11038 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
11039 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
11040 actually essential that we look for an assignment-expression.
11041 For example, cp_parser_initializer_clauses uses this function to
11042 determine whether a particular assignment-expression is in fact
11043 constant. */
11044 cp_expr expression;
11047 else
11049 /* Restore the old settings. */
11050 parser->integral_constant_expression_p
11052 parser->allow_non_integral_constant_expression_p
11056 {
11057 /* Require an rvalue constant expression here; that's what our
11058 callers expect. Reference constant expressions are handled
11059 separately in e.g. cp_parser_template_argument. */
11068 }
11071 parser->non_integral_constant_expression_p
11075 }
11077 /* Parse __builtin_offsetof.
11079 offsetof-expression:
11080 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
11082 offsetof-member-designator:
11083 id-expression
11084 | offsetof-member-designator "." id-expression
11085 | offsetof-member-designator "[" expression "]"
11086 | offsetof-member-designator "->" id-expression */
11088 static cp_expr
11090 {
11092 tree type;
11093 cp_expr expr;
11094 cp_id_kind dummy;
11096 location_t finish_loc;
11098 /* We're about to accept non-integral-constant things, but will
11099 definitely yield an integral constant expression. Save and
11100 restore these values around our local parsing. */
11106 /* Consume the "__builtin_offsetof" token. */
11108 /* Consume the opening `('. */
11109 matching_parens parens;
11111 /* Parse the type-id. */
11113 {
11115 parser->type_definition_forbidden_message
11119 }
11120 /* Look for the `,'. */
11124 /* Build the (type *)null that begins the traditional offsetof macro. */
11125 tree object_ptr
11129 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
11133 {
11136 {
11138 /* offsetof-member-designator "[" expression "]" */
11144 /* offsetof-member-designator "->" identifier */
11147 /* FALLTHRU */
11150 /* offsetof-member-designator "." identifier */
11158 /* Consume the ")" token. */
11164 /* Error. We know the following require will fail, but
11165 that gives the proper error message. */
11170 }
11171 }
11173 success:
11174 /* Make a location of the form:
11175 __builtin_offsetof (struct s, f)
11176 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
11177 with caret at the type-id, ranging from the start of the
11178 "_builtin_offsetof" token to the close paren. */
11180 /* The result will be an INTEGER_CST, so we need to explicitly
11181 preserve the location. */
11184 failure:
11190 }
11192 /* Parse a builtin trait expression or type. */
11194 static cp_expr
11196 {
11203 /* Get location of initial token. */
11206 /* Consume the token. */
11209 matching_parens parens;
11212 else
11216 {
11225 }
11227 /* __type_pack_element takes an expression as its first argument and uses
11228 template-id syntax instead of function call syntax (for consistency
11229 with Clang). We special case these properties of __type_pack_element
11230 here and elsewhere. */
11232 else
11233 {
11236 }
11242 {
11246 {
11248 {
11250 "trailing argument to %<__type_pack_element%> "
11253 }
11254 }
11256 }
11258 {
11261 {
11264 }
11268 }
11270 {
11273 {
11277 {
11280 }
11284 }
11288 }
11292 /* cp_parser_enclosed_template_argument_list above already took care
11294 else
11297 /* Construct a location of the form:
11298 __is_trivially_copyable(_Tp)
11299 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
11300 with start == caret, finishing at the close-paren. */
11303 /* Complete the trait expression, which may mean either processing
11304 the trait expr now or saving it for template instantiation. */
11306 {
11314 else
11316 }
11317 }
11319 /* Parse a lambda expression.
11321 lambda-expression:
11322 lambda-introducer lambda-declarator [opt] compound-statement
11323 lambda-introducer < template-parameter-list > requires-clause [opt]
11324 lambda-declarator [opt] compound-statement
11326 Returns a representation of the expression. */
11328 static cp_expr
11330 {
11332 tree type;
11340 {
11341 /* C++20 allows lambdas in unevaluated context, but one in the type of a
11342 non-type parameter is nonsensical.
11344 Distinguish a lambda in the parameter type from a lambda in the
11345 default argument by looking at local_variables_forbidden_p, which is
11346 only set in default arguments. */
11348 {
11353 }
11354 }
11356 {
11358 {
11360 "lambda-expression in unevaluated context"
11363 }
11365 }
11367 {
11369 {
11373 }
11375 }
11377 /* We may be in the middle of deferred access check. Disable
11378 it now. */
11392 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
11395 /* Now that we've started the type, add the capture fields for any
11396 explicit captures. */
11399 {
11400 /* Inside the class, surrounding template-parameter-lists do not apply. */
11401 unsigned int saved_num_template_parameter_lists
11405 bool fully_implicit_function_template_p
11409 bool auto_is_implicit_function_template_parm_p
11422 /* The body of a lambda in a discarded statement is not discarded. */
11426 /* Similarly the body of a lambda in immediate function context is not
11427 in immediate function context. */
11431 /* By virtue of defining a local class, a lambda expression has access to
11432 the private variables of enclosing classes. */
11445 {
11448 }
11450 /* The capture list was built up in reverse order; fix that now. */
11465 parser->fully_implicit_function_template_p
11469 parser->auto_is_implicit_function_template_parm_p
11472 }
11474 /* This field is only used during parsing of the lambda. */
11477 /* This lambda shouldn't have any proxies left at this point. */
11479 /* And now that we're done, push proxies for an enclosing lambda. */
11482 /* Update the lambda expression to a range. */
11489 else
11497 }
11499 /* Parse the beginning of a lambda expression.
11501 lambda-introducer:
11502 [ lambda-capture [opt] ]
11504 LAMBDA_EXPR is the current representation of the lambda expression. */
11506 static void
11508 {
11509 /* Need commas after the first capture. */
11512 /* Eat the leading `['. */
11515 /* Record default capture mode. "[&" "[=" "[&," "[=," */
11525 {
11531 }
11537 {
11539 tree capture_id;
11540 tree capture_init_expr;
11544 enum capture_kind_type
11545 {
11546 BY_COPY,
11547 BY_REFERENCE
11548 };
11552 {
11555 }
11559 else
11562 /* Possibly capture `this'. */
11564 {
11569 "explicit by-copy capture of %<this%> "
11570 "with by-copy capture default only available with "
11576 this_identifier);
11577 else
11582 }
11584 /* Possibly capture `*this'. */
11587 {
11591 "%<*this%> capture only available with "
11598 this_identifier);
11599 else
11604 }
11606 /* But reject `&this'. */
11609 {
11615 }
11617 /* Remember whether we want to capture as a reference or not. */
11619 {
11622 }
11627 {
11631 "pack init-capture only available with "
11635 }
11637 /* Early C++20 drafts had ...& instead of &...; be forgiving. */
11640 {
11645 }
11647 /* Get the identifier. */
11652 /* Would be nice to have a cp_parser_skip_to_closing_x for general
11653 delimiters, but I modified this to stop on unnested ']' as well. It
11654 was already changed to stop on unnested '}', so the
11655 "closing_parenthesis" name is no more misleading with my change. */
11656 {
11662 }
11664 /* Find the initializer for this capture. */
11668 {
11669 /* An explicit initializer exists. */
11672 "lambda capture initializers "
11680 {
11683 }
11686 }
11687 else
11688 {
11691 /* Turn the identifier into an id-expression. */
11692 capture_init_expr
11697 {
11700 }
11703 {
11706 capture_init_expr);
11711 }
11714 {
11717 capture_init_expr))
11721 }
11723 capture_init_expr
11724 = finish_id_expression
11726 capture_init_expr,
11740 {
11745 {
11746 /* If what follows is an initializer, the second '...' is
11747 invalid. But for cases like [...xs...], the first one
11748 is invalid. */
11755 }
11756 }
11757 }
11761 {
11766 capture_id);
11770 "capture of %qD redundant with by-reference capture "
11772 }
11774 /* Check for duplicates.
11775 Optimize for the zero or one explicit captures cases and only create
11776 the hash_set after adding second capture. */
11784 else
11785 {
11788 }
11794 else
11799 /* If there is any qualification still in effect, clear it
11800 now; we will be starting fresh with the next capture. */
11804 }
11807 }
11809 /* Parse the (optional) middle of a lambda expression.
11811 lambda-declarator:
11812 ( parameter-declaration-clause ) lambda-specifiers requires-clause [opt]
11813 lambda-specifiers (C++23)
11815 lambda-specifiers:
11816 decl-specifier-seq [opt] noexcept-specifier [opt]
11817 attribute-specifier-seq [opt] trailing-return-type [opt]
11819 LAMBDA_EXPR is the current representation of the lambda expression. */
11821 static bool
11823 {
11824 /* 5.1.1.4 of the standard says:
11825 If a lambda-expression does not include a lambda-declarator, it is as if
11826 the lambda-declarator were ().
11827 This means an empty parameter list, no attributes, and no exception
11828 specification. */
11839 cp_decl_specifier_seq lambda_specs;
11841 /* A lambda op() is const unless explicitly 'mutable'. */
11844 /* The template-parameter-list is optional, but must begin with
11845 an opening angle if present. */
11847 {
11851 "lambda templates are only available with "
11859 /* We may have a constrained generic lambda; parse the requires-clause
11860 immediately after the template-parameter-list and combine with any
11861 shorthand constraints present. */
11864 {
11869 }
11871 /* We just processed one more parameter list. */
11873 }
11875 /* Committee discussion supports allowing attributes here. */
11878 /* The parameter-declaration-clause is optional (unless
11879 template-parameter-list was given), but must begin with an
11880 opening parenthesis if present. */
11882 {
11883 matching_parens parens;
11888 /* Parse parameters. */
11889 param_list
11890 = cp_parser_parameter_declaration_clause
11893 /* Default arguments shall not be specified in the
11894 parameter-declaration-clause of a lambda-declarator. */
11899 OPT_Wc__14_extensions,
11904 }
11908 /* [expr.prim.lambda.general]
11909 lambda-specifier:
11910 consteval, constexpr, mutable, static
11911 [4] A lambda-specifier-seq shall contain at most one of each
11912 lambda-specifier and shall not contain both constexpr and consteval.
11913 The lambda-specifier-seq shall not contain both mutable and static. */
11917 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
11921 {
11923 "parameter declaration before lambda declaration "
11924 "specifiers only optional with %<-std=c++2b%> or "
11927 }
11928 /* Peek at the params, see if we have an xobj parameter. */
11930 {
11932 /* We still need grokdeclarator to see that this is an xobj function
11933 and finish the rest of the work, don't mutate it. */
11936 /* [expr.prim.lambda.closure-5]
11937 Given a lambda with a lambda-capture, the type of the explicit object
11938 parameter, if any, of the lambda's function call operator (possibly
11939 instantiated from a function call operator template) shall be either:
11940 -- the closure type,
11941 -- a class type derived from the closure type, or
11942 -- a reference to a possibly cv-qualified such type. */
11943 bool const unrelated_with_captures
11946 /* Since a lambda's type is anonymous, we can assume an xobj
11947 parameter is unrelated to the closure if it is non-dependent.
11948 If it is dependent we handle it at instantiation time. */
11951 {
11953 "a lambda with captures may not have an explicit object "
11956 }
11958 /* [expr.prim.lambda.general-4]
11959 If the lambda-declarator contains an explicit object parameter
11960 ([dcl.fct]), then no lambda-specifier in the lambda-specifier-seq
11961 shall be mutable or static. */
11963 {
11964 auto_diagnostic_group d;
11966 "%<mutable%> lambda specifier "
11968 /* Tell the user how to do what they probably meant, maybe fixits
11969 would be appropriate later? */
11971 /* The following hints don't make sense when we already have an
11975 "the passed in closure object will not be mutated because "
11979 "declare the explicit object parameter as non-const "
11981 else
11983 "explicit object parameter is already a mutable "
11985 }
11987 {
11988 auto_diagnostic_group d;
11990 "%<static%> lambda specifier "
11994 }
11995 }
11997 {
11999 }
12001 {
12002 /* [expr.prim.lambda.general-4]
12003 If the lambda-specifier-seq contains static, there shall be no
12004 lambda-capture. */
12009 else
12010 {
12013 }
12014 }
12018 {
12020 "parameter declaration before lambda transaction "
12021 "qualifier only optional with %<-std=c++2b%> or "
12024 }
12026 /* Parse optional exception specification. */
12027 exception_spec
12031 {
12033 "parameter declaration before lambda exception "
12034 "specification only optional with %<-std=c++2b%> or "
12037 }
12039 /* GCC 8 accepted attributes here, and this is the place for standard C++11
12040 attributes that appertain to the function type. */
12043 else
12046 /* Parse optional trailing return type. */
12048 {
12051 "parameter declaration before lambda trailing "
12052 "return type only optional with %<-std=c++2b%> or "
12056 }
12058 /* Also allow GNU attributes at the very end of the declaration, the usual
12059 place for GNU attributes. */
12064 {
12065 /* Parse optional trailing requires clause. */
12068 /* The function parameters must be in scope all the way until after the
12069 trailing-return-type in case of decltype. */
12071 }
12073 /* Create the function call operator.
12075 Messing with declarators like this is no uglier than building up the
12076 FUNCTION_DECL by hand, and this is less likely to get out of sync with
12077 other code. */
12078 {
12079 cp_decl_specifier_seq return_type_specs;
12081 tree fco;
12088 {
12092 else
12094 "lambda only available with %<-std=c++17%> or "
12096 }
12101 {
12105 }
12113 VIRT_SPEC_UNSPECIFIED,
12114 REF_QUAL_NONE,
12115 tx_qual,
12116 exception_spec,
12117 return_type,
12118 trailing_requires_clause,
12119 std_attrs,
12120 UNKNOWN_LOCATION);
12123 declarator,
12126 {
12130 /* Give the object parameter a different name. */
12133 }
12135 {
12139 }
12149 }
12150 }
12152 /* Parse the body of a lambda expression, which is simply
12154 compound-statement
12156 but which requires special handling.
12157 LAMBDA_EXPR is the current representation of the lambda expression. */
12159 static void
12161 {
12163 unsigned char local_variables_forbidden_p
12167 /* The body of a lambda-expression is not a subexpression of the enclosing
12168 expression. */
12169 cp_evaluated ev;
12173 else
12174 /* Still increment function_depth so that we don't GC in the
12175 middle of an expression. */
12183 /* Clear this in case we're in the middle of a default argument. */
12187 {
12192 /* Originally C++11 required us to peek for 'return expr'; and
12193 process it specially here to deduce the return type. N3638
12194 removed the need for that. */
12198 }
12205 else
12207 }
12209 /* Statements [gram.stmt.stmt] */
12211 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
12213 static void
12215 {
12219 /* A concept is never expanded normally. */
12225 }
12227 struct cp_omp_attribute_data
12228 {
12231 c_omp_directive_kind kind;
12232 };
12234 /* Handle omp::directive and omp::sequence attributes in ATTRS
12235 (if any) at the start of a statement or in attribute-declaration. */
12237 static tree
12239 {
12250 {
12251 cnt++;
12253 {
12259 {
12261 "mixing OpenMP directives with attribute and pragma "
12265 }
12267 {
12271 }
12274 {
12282 else
12285 }
12291 {
12293 "unknown OpenMP directive name in %qs attribute "
12297 }
12300 {
12301 /* ordered is C_OMP_DIR_CONSTRUCT only if it doesn't contain
12302 depend/doacross clause. */
12315 }
12317 {
12318 /* error with at(execution) clause is C_OMP_DIR_STANDALONE. */
12322 paren_depth++;
12324 paren_depth--;
12335 {
12338 }
12339 }
12344 }
12345 cp_omp_attribute_data v = {};
12348 }
12349 else
12362 {
12367 }
12368 else
12369 {
12371 {
12374 }
12375 }
12378 {
12380 "OpenMP construct among %<omp::directive%> attributes"
12381 " requires all %<omp::directive%> attributes on the"
12384 }
12386 {
12388 "multiple OpenMP standalone directives among"
12389 " %<omp::directive%> attributes must be all within the"
12392 }
12398 {
12400 "standalone OpenMP directives in %<omp::directive%> attribute"
12403 }
12405 {
12409 {
12411 "mixing OpenMP directives with attribute and pragma "
12414 }
12415 }
12419 tokens++;
12424 {
12431 cp_token tok = {};
12439 tok = {};
12444 }
12445 cp_token tok = {};
12457 /* Move the current source position to that of the first token in the
12458 new lexer. */
12461 }
12463 /* True if and only if the name is one of the contract types. */
12465 static bool
12467 {
12471 }
12473 /* Handle omp::directive and omp::sequence attributes in *PATTRS
12474 (if any) at the start or after declaration-id of a declaration. */
12476 static void
12480 {
12491 {
12493 {
12500 {
12508 else
12511 }
12521 {
12523 {
12526 }
12528 {
12530 "mixing OpenMP directives with attribute and "
12533 }
12534 }
12535 }
12536 }
12539 {
12544 else
12547 }
12552 {
12561 }
12563 }
12565 /* Parse a statement.
12567 statement:
12568 labeled-statement
12569 expression-statement
12570 compound-statement
12571 selection-statement
12572 iteration-statement
12573 jump-statement
12574 declaration-statement
12575 try-block
12577 C++11:
12579 statement:
12580 labeled-statement
12581 attribute-specifier-seq (opt) expression-statement
12582 attribute-specifier-seq (opt) compound-statement
12583 attribute-specifier-seq (opt) selection-statement
12584 attribute-specifier-seq (opt) iteration-statement
12585 attribute-specifier-seq (opt) jump-statement
12586 declaration-statement
12587 attribute-specifier-seq (opt) try-block
12589 init-statement:
12590 expression-statement
12591 simple-declaration
12592 alias-declaration
12594 TM Extension:
12596 statement:
12597 atomic-statement
12599 IN_COMPOUND is true when the statement is nested inside a
12600 cp_parser_compound_statement.
12602 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12603 is a (possibly labeled) if statement which is not enclosed in braces
12604 and has an else clause. This is used to implement -Wparentheses.
12606 CHAIN is a vector of if-else-if conditions.
12608 Note that this version of parsing restricts assertions to be attached to
12609 empty statements. */
12611 static void
12615 {
12621 /* A copy of IN_COMPOUND which is set to false after seeing a label.
12622 This matters for certain pragmas. */
12625 restart:
12628 /* There is no statement yet. */
12635 /* In obj-c++, seeing '[[' might be the either the beginning of
12636 c++11 attributes, or a nested objc-message-expression. So
12637 let's parse the c++11 attributes tentatively. */
12643 {
12646 }
12649 /* Peek at the next token. */
12652 /* If we have contracts, check that they're valid in this context. */
12654 {
12662 /* Check that assertions are null statements. */
12666 }
12672 {
12676 {
12703 }
12709 {
12711 std_attrs);
12713 }
12714 }
12717 /* Remember the location of the first token in the statement. */
12721 /* If this is a keyword, then that will often determine what kind of
12722 statement we have. */
12724 {
12728 {
12731 /* Looks like a labeled-statement with a case label.
12732 Parse the label, and then use tail recursion to parse
12733 the statement. */
12762 /* Objective-C++ exception-handling constructs. */
12778 /* This must be a namespace alias definition. */
12780 {
12781 /* Attributes should be parsed as part of the
12782 declaration, so let's un-parse them. */
12785 }
12803 /* It might be a keyword like `int' that can start a
12804 declaration-statement. */
12806 }
12807 }
12809 {
12810 /* If the next token is a `:', then we are looking at a
12811 labeled-statement. */
12814 {
12815 /* Looks like a labeled-statement with an ordinary label.
12816 Parse the label, and then use tail recursion to parse
12817 the statement. */
12821 /* If there's no statement, it's not a labeled-statement, just
12822 a label. That's allowed in C++23, but only if we're at the
12823 end of a compound-statement. */
12826 {
12830 "label at end of compound statement only available "
12833 }
12837 }
12838 }
12839 /* Anything that starts with a `{' must be a compound-statement. */
12841 {
12844 }
12845 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
12846 a statement all its own. */
12848 {
12849 do_pragma:;
12852 /* Only certain OpenMP pragmas are attached to statements, and thus
12853 are considered statements themselves. All others are not. In
12854 the context of a compound, accept the pragma as a "statement" and
12855 return so that we can check for a close brace. Otherwise we
12856 require a real statement and must go back and read one. */
12858 {
12862 }
12870 {
12872 {
12879 }
12882 }
12890 }
12892 {
12895 }
12897 /* Everything else must be a declaration-statement or an
12898 expression-statement. Try for the declaration-statement
12899 first, unless we are looking at a `;', in which case we know that
12900 we have an expression-statement. */
12902 {
12904 {
12906 /* Attributes should be parsed as part of the declaration,
12907 so let's un-parse them. */
12912 /* Try to parse the declaration-statement. */
12915 /* If that worked, we're done. */
12918 /* It didn't work, restore the post-attribute position. */
12920 {
12923 {
12928 i++;
12930 {
12936 /* Don't handle OpenMP attribs on keywords that
12937 always start a declaration statement but don't
12938 accept attribute before it and therefore
12939 the tentative cp_parser_declaration_statement
12940 fails to parse because of that. */
12945 }
12948 {
12950 std_attrs
12951 = cp_parser_handle_statement_omp_attributes
12957 }
12958 }
12959 }
12960 }
12961 /* All preceding labels have been parsed at this point. */
12967 /* Look for an expression-statement instead. */
12971 attrs_loc);
12973 /* Handle [[fallthrough]];. */
12975 {
12976 /* The next token after the fallthrough attribute is ';'. */
12978 {
12979 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12981 IFN_FALLTHROUGH,
12984 }
12985 else
12989 }
12991 /* Handle [[assert: ...]]; */
12993 {
12994 /* Add the assertion as a statement in the current block. */
12998 }
12999 }
13001 /* Set the line number for the statement. */
13005 /* Allow "[[fallthrough]];" or "[[assume(cond)]];", but warn otherwise. */
13009 }
13011 /* Append ATTR to attribute list ATTRS. */
13013 tree
13015 {
13021 }
13023 /* Parse the label for a labeled-statement, i.e.
13025 label:
13026 attribute-specifier-seq[opt] identifier :
13027 attribute-specifier-seq[opt] case constant-expression :
13028 attribute-specifier-seq[opt] default :
13030 labeled-statement:
13031 label statement
13033 GNU Extension:
13034 case constant-expression ... constant-expression : statement
13036 When a label is parsed without errors, the label is added to the
13037 parse tree by the finish_* functions, so this function doesn't
13038 have to return the label. */
13040 static void
13042 {
13047 /* The next token should be an identifier. */
13051 {
13054 }
13056 /* Remember whether this case or a user-defined label is allowed to fall
13057 through to. */
13062 {
13064 {
13068 /* Consume the `case' token. */
13070 /* Parse the constant-expression. */
13077 {
13078 /* Consume the `...' token. */
13084 /* We don't need to emit warnings here, as the common code
13085 will do this for us. */
13086 }
13087 else
13091 {
13094 {
13097 }
13098 }
13099 else
13102 expr);
13103 }
13107 /* Consume the `default' token. */
13111 {
13114 {
13117 }
13118 }
13119 else
13124 /* Anything else must be an ordinary label. */
13127 {
13131 }
13133 }
13135 /* Require the `:' token. */
13138 /* An ordinary label may optionally be followed by attributes.
13139 However, this is only permitted if the attributes are then
13140 followed by a semicolon. This is because, for backward
13141 compatibility, when parsing
13142 lab: __attribute__ ((unused)) int i;
13143 we want the attribute to attach to "i", not "lab". */
13146 {
13147 tree attrs;
13151 /* And fallthrough always binds to the expression-statement. */
13156 ;
13157 else
13159 }
13165 }
13167 /* Parse an expression-statement.
13169 expression-statement:
13170 expression [opt] ;
13172 Returns the new EXPR_STMT -- or NULL_TREE if the expression
13173 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
13174 indicates whether this expression-statement is part of an
13175 expression statement. */
13177 static tree
13179 {
13184 /* There might be attribute fallthrough. */
13187 /* If the next token is a ';', then there is no expression
13188 statement. */
13190 {
13194 {
13195 /* If we ran into a problem, make sure we complained. */
13200 }
13201 }
13205 /* Handle [[fallthrough]];. */
13207 {
13208 /* The next token after the fallthrough attribute is ';'. */
13210 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
13213 else
13217 }
13219 /* Allow "[[fallthrough]];", but warn otherwise. */
13224 /* Give a helpful message for "A<T>::type t;" and the like. */
13227 {
13234 {
13235 /* A::A a; */
13240 }
13241 }
13243 /* Consume the final `;'. */
13248 /* This is the final expression statement of a statement
13249 expression. */
13255 }
13257 /* Parse a compound-statement.
13259 compound-statement:
13260 { statement-seq [opt] label-seq [opt] }
13262 label-seq:
13263 label
13264 label-seq label
13266 GNU extension:
13268 compound-statement:
13269 { label-declaration-seq [opt] statement-seq [opt] }
13271 label-declaration-seq:
13272 label-declaration
13273 label-declaration-seq label-declaration
13275 Returns a tree representing the statement. */
13277 static tree
13280 {
13281 tree compound_stmt;
13282 matching_braces braces;
13284 /* Consume the `{'. */
13291 /* Begin the compound-statement. */
13293 /* If the next keyword is `__label__' we have a label declaration. */
13296 /* Parse an (optional) statement-seq. */
13299 /* Consume the `}'. */
13302 /* Finish the compound-statement. */
13306 }
13308 /* Diagnose errors related to imperfectly nested loops in an OMP
13309 loop construct. This function is called when such code is seen.
13310 Only issue one such diagnostic no matter how much invalid
13311 intervening code there is in the loop.
13312 FIXME: maybe the location associated with the diagnostic should
13313 be the current parser token instead of the location of the outer loop
13314 nest. */
13316 static void
13318 {
13327 /* Only diagnose errors related to perfect nesting once. */
13329 {
13331 {
13333 "inner loops must be perfectly nested in "
13336 }
13338 {
13340 "inner loops must be perfectly nested with "
13343 }
13345 {
13347 "inner loops must be perfectly nested with "
13350 }
13352 {
13354 "inner loops must be perfectly nested "
13357 }
13360 }
13361 }
13363 /* Parse an (optional) statement-seq.
13365 statement-seq:
13366 statement
13367 statement-seq [opt] statement */
13369 static void
13371 {
13374 bool in_omp_loop_block
13377 /* Scan statements until there aren't any more. */
13379 {
13382 /* If we are looking at a `}', then we have run out of
13383 statements; the same is true if we have reached the end
13384 of file, or have stumbled upon a stray '@end'. */
13391 /* If we are in a compound statement and find 'else' then
13392 something went wrong. */
13394 {
13397 else
13398 {
13401 }
13402 }
13404 /* Handle special cases for OMP FOR canonical loop syntax. */
13406 {
13411 {
13412 /* Found the nested loop. */
13416 }
13418 {
13419 /* Prior to implementing the OpenMP 5.1 syntax for canonical
13420 loop form, GCC used to accept an empty statements as not
13421 being intervening code. Continue to do that, as an
13422 extension. */
13423 /* FIXME: Maybe issue a warning or something here? */
13425 }
13427 /* The nested compound statement may contain the next loop, or
13428 it might just be intervening code. */
13429 {
13433 }
13434 else
13435 {
13436 /* This must be intervening code. */
13438 /* Defer calling check_omp_intervening_code on pragmas until
13439 cp_parser_statement, because we can't know until we parse
13440 it whether or not the pragma is a statement. */
13445 }
13447 }
13449 /* Parse the statement. */
13451 }
13452 }
13454 /* Return true if this is the C++20 version of range-based-for with
13455 init-statement. */
13457 static bool
13459 {
13462 /* Save tokens so that we can put them back. */
13465 /* There has to be an unnested ; followed by an unnested :. */
13468 CPP_SEMICOLON,
13472 /* We found the semicolon, eat it now. */
13475 /* Now look for ':' that is not nested in () or {}. */
13478 CPP_COLON,
13481 out:
13482 /* Roll back the tokens we skipped. */
13486 }
13488 /* Return true if we're looking at (init; cond), false otherwise. */
13490 static bool
13492 {
13493 /* Save tokens so that we can put them back. */
13496 /* Look for ';' that is not nested in () or {}. */
13499 CPP_SEMICOLON,
13502 /* Roll back the tokens we skipped. */
13506 }
13508 /* Parse a selection-statement.
13510 selection-statement:
13511 if ( init-statement [opt] condition ) statement
13512 if ( init-statement [opt] condition ) statement else statement
13513 switch ( init-statement [opt] condition ) statement
13515 Returns the new IF_STMT or SWITCH_STMT.
13517 If IF_P is not NULL, *IF_P is set to indicate whether the statement
13518 is a (possibly labeled) if statement which is not enclosed in
13519 braces and has an else clause. This is used to implement
13520 -Wparentheses.
13522 CHAIN is a vector of if-else-if conditions. This is used to implement
13523 -Wduplicated-cond. */
13525 static tree
13528 {
13531 token_indent_info guard_tinfo;
13536 /* Peek at the next token. */
13540 /* See what kind of keyword it is. */
13543 {
13546 {
13547 tree statement;
13548 tree condition;
13553 RID_CONSTEXPR))
13554 {
13559 "%<if constexpr%> only available with "
13561 }
13564 {
13566 RID_CONSTEVAL))
13570 RID_CONSTEVAL))
13571 {
13574 }
13575 }
13577 {
13581 "%<if consteval%> only available with "
13592 {
13595 }
13601 {
13602 location_t before_loc
13608 }
13612 /* If the next token is `else', parse the else-clause. */
13614 RID_ELSE))
13615 {
13619 /* Consume the `else' keyword. */
13625 {
13629 }
13633 guard_tinfo);
13636 {
13637 location_t before_loc
13642 }
13645 }
13649 {
13653 }
13657 }
13659 /* Look for the `('. */
13660 matching_parens parens;
13662 {
13665 }
13667 /* Begin the selection-statement. */
13669 {
13672 }
13673 else
13676 /* Parse the optional init-statement. */
13678 {
13679 tree decl;
13682 OPT_Wc__17_extensions,
13683 "init-statement in selection statements only available "
13686 /* A non-empty init-statement can have arbitrary side
13687 effects. */
13690 }
13692 /* Parse the condition. */
13694 /* Look for the `)'. */
13700 {
13704 /* Add the condition. */
13711 /* Parse the then-clause. */
13715 /* Outside a template, the non-selected branch of a constexpr
13716 if is a 'discarded statement', i.e. unevaluated. */
13721 {
13724 }
13727 guard_tinfo);
13734 {
13738 }
13740 /* If the next token is `else', parse the else-clause. */
13742 RID_ELSE))
13743 {
13747 {
13750 }
13752 guard_tinfo
13754 /* Consume the `else' keyword. */
13757 {
13759 RID_IF)
13761 {
13762 /* We've got "if (COND) else if (COND2)". Start
13763 the condition chain and add COND as the first
13764 element. */
13768 {
13769 /* Wrap it in a NOP_EXPR so that we can set the
13770 location of the condition. */
13772 condition);
13775 }
13776 }
13778 RID_IF))
13779 /* This is if-else without subsequent if. Zap the
13780 condition chain; we would have already warned at
13781 this point. */
13783 }
13785 /* Parse the else-clause. */
13791 /* If we are currently parsing a then-clause, then
13792 IF_P will not be NULL. We set it to true to
13793 indicate that this if statement has an else clause.
13794 This may trigger the Wparentheses warning below
13795 when we get back up to the parent if statement. */
13800 {
13804 }
13805 }
13806 else
13807 {
13808 /* This if statement does not have an else clause. If
13809 NESTED_IF is true, then the then-clause has an if
13810 statement which does have an else clause. We warn
13811 about the potential ambiguity. */
13814 "suggest explicit braces to avoid ambiguous"
13817 /* We don't need the condition chain anymore. */
13819 }
13821 /* Now we're all done with the if-statement. */
13823 }
13824 else
13825 {
13829 /* Add the condition. */
13832 /* Parse the body of the switch-statement. */
13838 guard_tinfo);
13842 /* Now we're all done with the switch-statement. */
13844 }
13847 }
13853 }
13854 }
13856 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
13857 If we have seen at least one decl-specifier, and the next token is not
13858 a parenthesis (after "int (" we might be looking at a functional cast)
13859 neither we are dealing with a concept-check expression then we must be
13860 looking at a declaration. */
13862 static void
13865 {
13874 }
13876 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
13877 The declarator shall not specify a function or an array. Returns
13878 TRUE if the declarator is valid, FALSE otherwise. */
13880 static bool
13883 location_t loc)
13884 {
13888 {
13893 else
13901 }
13902 else
13904 }
13906 /* Parse a condition.
13908 condition:
13909 expression
13910 type-specifier-seq declarator = initializer-clause
13911 type-specifier-seq declarator braced-init-list
13913 GNU Extension:
13915 condition:
13916 type-specifier-seq declarator asm-specification [opt]
13917 attributes [opt] = assignment-expression
13919 Returns the expression that should be tested. */
13921 static tree
13923 {
13924 cp_decl_specifier_seq type_specifiers;
13928 /* Try the declaration first. */
13930 /* New types are not allowed in the type-specifier-seq for a
13931 condition. */
13933 parser->type_definition_forbidden_message
13935 /* Parse the type-specifier-seq. */
13937 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
13940 /* Restore the saved message. */
13943 /* Gather the attributes that were provided with the
13944 decl-specifiers. */
13949 /* If all is well, we might be looking at a declaration. */
13951 {
13952 tree decl;
13953 tree asm_specification;
13954 tree attributes;
13959 /* Parse the declarator. */
13961 CP_PARSER_FLAGS_NONE,
13967 /* Parse the attributes. */
13969 /* Parse the asm-specification. */
13971 /* If the next token is not an `=' or '{', then we might still be
13972 looking at an expression. For example:
13974 if (A(a).x)
13976 looks like a decl-specifier-seq and a declarator -- but then
13977 there is no `=', so this is an expression. */
13982 /* If we did see an `=' or '{', then we are looking at a declaration
13983 for sure. */
13985 {
13986 tree pushed_scope;
13993 /* Create the declaration. */
14000 /* Parse the initializer. */
14002 {
14006 }
14008 {
14009 /* Consume the `='. */
14013 }
14014 else
14015 {
14018 }
14022 /* Process the initializer. */
14025 asm_specification,
14026 flags);
14032 }
14033 }
14034 /* If we didn't even get past the declarator successfully, we are
14035 definitely not looking at a declaration. */
14036 else
14039 /* Otherwise, we are looking at an expression. */
14041 }
14043 /* Parses a for-statement or range-for-statement until the closing ')',
14044 not included. */
14046 static tree
14048 {
14052 /* Begin the for-statement. */
14055 /* Maybe parse the optional init-statement in a range-based for loop. */
14057 /* Checked for diagnostic purposes only. */
14059 {
14060 tree dummy;
14063 {
14065 OPT_Wc__20_extensions,
14066 "range-based %<for%> loops with initializer only "
14069 }
14070 }
14072 /* Parse the initialization. */
14078 else
14080 }
14082 static tree
14085 {
14086 /* Normal for loop */
14089 tree stmt;
14092 /* The init-statement has already been parsed in
14093 cp_parser_init_statement, so no work is needed here. */
14096 /* If there's a condition, process it. */
14100 {
14104 }
14106 {
14110 }
14112 /* Look for the `;'. */
14115 /* If there's an expression, process it. */
14121 }
14123 /* Tries to parse a range-based for-statement:
14125 range-based-for:
14126 decl-specifier-seq declarator : expression
14128 The decl-specifier-seq declarator and the `:' are already parsed by
14129 cp_parser_init_statement. If processing_template_decl it returns a
14130 newly created RANGE_FOR_STMT; if not, it is converted to a
14131 regular FOR_STMT. */
14133 static tree
14136 {
14142 /* Get the range declaration momentarily out of the way so that
14143 the range expression doesn't clash with it. */
14145 {
14147 {
14149 /* For decomposition declaration get all of the corresponding
14150 declarations out of the way. */
14153 {
14161 {
14167 }
14168 }
14169 }
14171 {
14176 }
14177 }
14181 else
14184 /* Put the range declaration(s) back into scope. */
14186 {
14190 }
14192 /* finish_omp_for has its own code for the following, so just
14193 return the range_expr instead. */
14197 /* If in template, STMT is converted to a normal for-statement
14198 at instantiation. If not, it is done just ahead. */
14200 {
14212 /* do_auto_deduction doesn't mess with template init-lists. */
14215 }
14216 else
14217 {
14221 }
14223 }
14225 /* Subroutine of cp_convert_range_for: given the initializer expression,
14226 builds up the range temporary. */
14228 static tree
14230 {
14231 /* Find out the type deduced by the declaration
14232 `auto &&__range = range_expr'. */
14237 /* Create the __range variable. */
14244 }
14246 /* Used by cp_parser_range_for in template context: we aren't going to
14247 do a full conversion yet, but we still need to resolve auto in the
14248 type of the for-range-declaration if present. This is basically
14249 a shortcut version of cp_convert_range_for. */
14251 static void
14253 {
14256 {
14259 iter_type = (cp_parser_perform_range_for_lookup
14262 {
14264 iter_type);
14267 tf_warning_or_error);
14270 tf_warning_or_error,
14271 adc_variable_type);
14274 }
14275 }
14276 }
14278 /* Warns when the loop variable should be changed to a reference type to
14279 avoid unnecessary copying. I.e., from
14281 for (const auto x : range)
14283 where range returns a reference, to
14285 for (const auto &x : range)
14287 if this version doesn't make a copy.
14289 This function also warns when the loop variable is initialized with
14290 a value of a different type resulting in a copy:
14292 int arr[10];
14293 for (const double &x : arr)
14295 DECL is the RANGE_DECL; EXPR is the *__for_begin expression.
14296 This function is never called when processing_template_decl is on. */
14298 static void
14300 {
14312 {
14315 {
14316 auto_diagnostic_group d;
14318 "loop variable %qD of type %qT binds to a temporary "
14321 {
14323 TYPE_QUAL_CONST);
14328 }
14329 }
14331 }
14335 /* Since small trivially copyable types are cheap to copy, we suppress the
14336 warning for them. 64B is a common size of a cache line. */
14342 /* If we can initialize a reference directly, suggest that to avoid the
14343 copy. */
14346 {
14347 auto_diagnostic_group d;
14351 {
14355 }
14356 }
14357 }
14359 /* Converts a range-based for-statement into a normal
14360 for-statement, as per the definition.
14362 for (RANGE_DECL : RANGE_EXPR)
14363 BLOCK
14365 should be equivalent to:
14367 {
14368 auto &&__range = RANGE_EXPR;
14369 for (auto __begin = BEGIN_EXPR, __end = END_EXPR;
14370 __begin != __end;
14371 ++__begin)
14372 {
14373 RANGE_DECL = *__begin;
14374 BLOCK
14375 }
14376 }
14378 If RANGE_EXPR is an array:
14379 BEGIN_EXPR = __range
14380 END_EXPR = __range + ARRAY_SIZE(__range)
14381 Else if RANGE_EXPR has a member 'begin' or 'end':
14382 BEGIN_EXPR = __range.begin()
14383 END_EXPR = __range.end()
14384 Else:
14385 BEGIN_EXPR = begin(__range)
14386 END_EXPR = end(__range);
14388 If __range has a member 'begin' but not 'end', or vice versa, we must
14389 still use the second alternative (it will surely fail, however).
14390 When calling begin()/end() in the third alternative we must use
14391 argument dependent lookup, but always considering 'std' as an associated
14392 namespace. */
14394 tree
14398 {
14406 /* If an error happened previously do nothing or else a lot of
14407 unhelpful errors would be issued. */
14409 else
14410 {
14411 tree range_temp;
14415 /* Can't bind a reference to an array of runtime bound. */
14417 else
14418 {
14423 LOOKUP_ONLYCONVERTING);
14425 }
14428 }
14430 /* The new for initialization statement. */
14432 iter_type);
14438 LOOKUP_ONLYCONVERTING);
14448 LOOKUP_ONLYCONVERTING);
14452 /* The new for condition. */
14459 /* The new increment expression. */
14462 tf_warning_or_error);
14465 /* The declaration is initialized with *__begin inside the loop body. */
14477 }
14479 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
14480 We need to solve both at the same time because the method used
14481 depends on the existence of members begin or end.
14482 Returns the type deduced for the iterator expression. */
14484 static tree
14486 {
14488 {
14491 }
14494 {
14499 }
14501 {
14502 /* If RANGE is an array, we will use pointer arithmetic. */
14505 range,
14509 }
14510 else
14511 {
14512 /* If it is not an array, we must do a bit of magic. */
14522 tf_warning_or_error);
14525 tf_warning_or_error);
14528 {
14529 /* Use the member functions. */
14532 }
14533 else
14534 {
14535 /* Use global functions with ADL. */
14536 releasing_vec vec;
14541 tf_warning_or_error);
14543 tf_warning_or_error);
14545 tf_warning_or_error);
14547 tf_warning_or_error);
14548 }
14550 /* Last common checks. */
14552 {
14553 /* If one of the expressions is an error do no more checks. */
14556 }
14559 /* Can happen, when, eg, in a template context, Koenig lookup
14560 can't resolve begin/end (c++/58503). */
14562 else
14563 {
14565 /* The unqualified type of the __begin and __end temporaries should
14566 be the same, as required by the multiple auto declaration. */
14568 {
14575 /* P0184R0 allows __begin and __end to have different types,
14576 but make sure they are comparable so we can give a better
14578 else
14582 }
14584 }
14585 }
14586 }
14588 /* Helper function for cp_parser_perform_range_for_lookup.
14589 Builds a tree for RANGE.IDENTIFIER(). */
14591 static tree
14593 {
14601 releasing_vec vec;
14605 tf_warning_or_error);
14607 }
14609 /* Parse an iteration-statement.
14611 iteration-statement:
14612 while ( condition ) statement
14613 do statement while ( expression ) ;
14614 for ( init-statement condition [opt] ; expression [opt] )
14615 statement
14617 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
14619 static tree
14622 {
14625 tree statement;
14627 token_indent_info guard_tinfo;
14629 /* Peek at the next token. */
14636 /* Remember whether or not we are already within an iteration
14637 statement. */
14640 /* Special case for OMP loop intervening code. Parsing of permitted
14641 collapsed loop nests is handled elsewhere. */
14643 {
14647 }
14649 /* See what kind of keyword it is. */
14652 {
14654 {
14655 tree condition;
14657 /* Begin the while-statement. */
14659 /* Look for the `('. */
14660 matching_parens parens;
14662 /* Parse the condition. */
14665 /* Look for the `)'. */
14667 /* Parse the dependent statement. */
14673 /* We're done with the while-statement. */
14675 }
14679 {
14680 tree expression;
14682 /* Begin the do-statement. */
14684 /* Parse the body of the do-statement. */
14691 /* Look for the `while' keyword. */
14693 /* Look for the `('. */
14694 matching_parens parens;
14696 /* Parse the expression. */
14698 /* We're done with the do-statement. */
14700 /* Look for the `)'. */
14702 /* Look for the `;'. */
14704 }
14708 {
14709 /* Look for the `('. */
14710 matching_parens parens;
14715 /* Look for the `)'. */
14718 /* Parse the body of the for-statement. */
14725 /* We're done with the for-statement. */
14727 }
14734 }
14737 }
14739 /* Parse an init-statement or the declarator of a range-based-for.
14740 Returns true if a range-based-for declaration is seen.
14742 init-statement:
14743 expression-statement
14744 simple-declaration
14745 alias-declaration */
14747 static bool
14749 {
14750 /* If the next token is a `;', then we have an empty
14751 expression-statement. Grammatically, this is also a
14752 simple-declaration, but an invalid one, because it does not
14753 declare anything. Therefore, if we did not handle this case
14754 specially, we would issue an error message about an invalid
14755 declaration. */
14757 {
14761 /* A colon is used in range-based for. */
14764 /* We're going to speculatively look for a declaration, falling back
14765 to an expression, if necessary. */
14769 {
14775 OPT_Wc__23_extensions,
14776 "alias-declaration in init-statement only "
14778 }
14779 else
14780 /* Parse the declaration. */
14783 decl);
14786 {
14787 /* It is a range-for, consume the ':'. */
14792 OPT_Wc__11_extensions,
14793 "range-based %<for%> loops only available with "
14795 }
14797 /* The ';' is not consumed yet because we told
14798 cp_parser_simple_declaration not to. */
14803 /* If the tentative parse failed, then we shall need to look for an
14804 expression-statement. */
14805 }
14806 /* If we are here, it is an expression-statement. */
14809 }
14811 /* Parse a jump-statement.
14813 jump-statement:
14814 break ;
14815 continue ;
14816 return expression [opt] ;
14817 return braced-init-list ;
14818 coroutine-return-statement;
14819 goto identifier ;
14821 GNU extension:
14823 jump-statement:
14824 goto * expression ;
14826 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
14828 static tree
14830 {
14836 /* Peek at the next token. */
14841 /* See what kind of keyword it is. */
14844 {
14848 {
14865 }
14871 {
14875 /* Fall through. */
14885 }
14891 {
14892 tree expr;
14895 {
14899 }
14902 else
14903 /* If the next token is a `;', then there is no
14904 expression. */
14906 /* Build the return-statement, check co-return first, since type
14907 deduction is not valid there. */
14912 else
14914 /* Look for the final `;'. */
14916 }
14923 {
14927 }
14929 /* Create the goto-statement. */
14931 {
14932 /* Issue a warning about this use of a GNU extension. */
14934 /* Consume the '*' token. */
14936 /* Parse the dependent expression. */
14938 }
14939 else
14941 /* Look for the final `;'. */
14948 }
14951 }
14953 /* Parse a declaration-statement.
14955 declaration-statement:
14956 block-declaration */
14958 static void
14960 {
14963 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14966 /* Parse the block-declaration. */
14969 /* Free any declarators allocated. */
14971 }
14973 /* Some dependent statements (like `if (cond) statement'), are
14974 implicitly in their own scope. In other words, if the statement is
14975 a single statement (as opposed to a compound-statement), it is
14976 none-the-less treated as if it were enclosed in braces. Any
14977 declarations appearing in the dependent statement are out of scope
14978 after control passes that point. This function parses a statement,
14979 but ensures that is in its own scope, even if it is not a
14980 compound-statement.
14982 If IF_P is not NULL, *IF_P is set to indicate whether the statement
14983 is a (possibly labeled) if statement which is not enclosed in
14984 braces and has an else clause. This is used to implement
14985 -Wparentheses.
14987 CHAIN is a vector of if-else-if conditions. This is used to implement
14988 -Wduplicated-cond.
14990 Returns the new statement. */
14992 static tree
14996 {
14997 tree statement;
15000 token_indent_info body_tinfo
15006 /* Mark if () ; with a special NOP_EXPR. */
15008 {
15019 }
15020 /* if a compound is opened, we simply parse the statement directly. */
15023 /* If the token is not a `{', then we must take special action. */
15024 else
15025 {
15026 /* Create a compound-statement. */
15028 /* Parse the dependent-statement. */
15031 /* Finish the dummy compound-statement. */
15033 }
15035 token_indent_info next_tinfo
15044 /* Return the statement. */
15046 }
15048 /* For some dependent statements (like `while (cond) statement'), we
15049 have already created a scope. Therefore, even if the dependent
15050 statement is a compound-statement, we do not want to create another
15051 scope. */
15053 static void
15056 {
15057 /* If the token is a `{', then we must take special action. */
15059 {
15060 token_indent_info body_tinfo
15066 token_indent_info next_tinfo
15075 }
15076 else
15077 {
15078 /* Avoid calling cp_parser_compound_statement, so that we
15079 don't create a new scope. Do everything else by hand. */
15080 matching_braces braces;
15082 /* If the next keyword is `__label__' we have a label declaration. */
15085 /* Parse an (optional) statement-seq. */
15088 }
15089 }
15091 /* Modules */
15093 /* Parse a module-name or module-partition.
15095 module-name:
15096 module-name-qualifier [opt] identifier
15098 module-partition:
15099 : module-name-qualifier [opt] identifier
15101 module-name-qualifier:
15102 identifier .
15103 module-name-qualifier identifier .
15105 Returns a pointer to the module object, or NULL on failure.
15106 For PARTITION_P, PARENT is the module this is a partition of. */
15111 {
15117 {
15119 {
15122 else
15125 }
15133 }
15136 }
15138 /* Parse a module-partition. Defers to cp_parser_module_name. */
15142 {
15144 }
15146 /* Named module-declaration
15147 __module ; PRAGMA_EOL
15148 __module : private ; PRAGMA_EOL (unimplemented)
15149 [__export] __module module-name module-partition [opt]
15150 attr-spec-seq-opt ; PRAGMA_EOL
15151 */
15153 static module_parse
15156 {
15157 /* We're a pseudo pragma. */
15163 {
15167 }
15169 {
15173 }
15176 {
15177 /* Start global module fragment. */
15182 }
15187 {
15195 {
15198 }
15199 else
15201 "private module fragment only permitted in purview"
15203 }
15205 {
15206 /* Neither the first declaration, nor in a GMF. */
15209 skip_eol:
15211 }
15212 else
15213 {
15226 }
15229 }
15231 /* Import-declaration
15232 __import module-name attr-spec-seq-opt ; PRAGMA_EOL
15233 __import module-partition attr-spec-seq-opt ; PRAGMA_EOL
15234 __import header-name attr-spec-seq-opt ; PRAGMA_EOL
15235 */
15237 static void
15240 {
15241 /* We're a pseudo pragma. */
15246 {
15249 note_lexer:
15251 " %<import%>, or other disambiguation, to prevent this"
15253 skip_eol:
15255 }
15257 {
15260 }
15261 else
15262 {
15266 {
15269 }
15271 {
15272 /* An import specifying a module-partition shall only appear after the
15273 module-declaration in a module unit: [module.import]/4. */
15278 else
15281 }
15282 else
15291 {
15292 /* Module-purview imports must not be from source inclusion
15293 [cpp.import]/7 */
15302 }
15305 }
15306 }
15308 /* export-declaration.
15310 export name-declaration
15311 export { declaration-seq-opt } */
15313 static void
15315 {
15334 {
15341 }
15342 else
15343 {
15344 /* Explicitly check if the next tokens might be a
15345 module-directive line, so we can give a clearer error message
15346 about why the directive will be rejected. */
15353 bool saved_in_unbraced_export_declaration_p
15357 parser->in_unbraced_export_declaration_p
15359 }
15362 }
15364 /* Used for maybe_warn_extra_semi. */
15368 /* Warn about an extra semicolon. KIND says in which context the extra
15369 semicolon occurs. */
15371 static void
15373 {
15374 /* -Wno-extra-semi suppresses all. */
15382 {
15384 /* If -Wextra-semi wasn't specified, warn only when -pedantic is in
15385 effect in C++98. DR 569 says that spurious semicolons at namespace
15386 scope should be allowed. */
15396 /* If -Wextra-semi wasn't specified, warn only when -pedantic is in
15397 effect in C++98. DR 1693 added "empty-declaration" to the syntax for
15398 "member-declaration". */
15407 /* A single semicolon is valid after a member function definition
15408 so this is just a warning. */
15416 }
15417 }
15419 /* Declarations [gram.dcl.dcl] */
15421 /* Parse an optional declaration-sequence. TOP_LEVEL is true, if this
15422 is the top-level declaration sequence. That affects whether we
15423 deal with module-preamble.
15425 declaration-seq:
15426 declaration
15427 declaration-seq declaration */
15429 static void
15431 {
15432 bool saved_in_unbraced_linkage_specification_p
15434 bool saved_in_unbraced_export_declaration_p
15437 /* We're not in an unbraced linkage-specification
15438 or export-declaration anymore. */
15443 {
15449 else
15451 }
15453 parser->in_unbraced_linkage_specification_p
15455 parser->in_unbraced_export_declaration_p
15457 }
15459 /* Parse a declaration. The distinction between name-declaration
15460 and special-declaration is only since C++20.
15462 declaration:
15463 name-declaration
15464 special-declaration
15466 name-declaration:
15467 block-declaration
15468 nodeclspec-function-declaration
15469 function-definition
15470 template-declaration
15471 deduction-guide (C++17)
15472 linkage-specification
15473 namespace-definition
15474 empty-declaration
15475 attribute-declaration
15476 module-import-declaration (modules)
15478 special-declaration:
15479 explicit-instantiation
15480 explicit-specialization
15481 export-declaration (modules)
15483 GNU extension:
15485 declaration:
15486 __extension__ declaration */
15488 static void
15490 {
15493 /* Check for the `__extension__' keyword. */
15495 {
15496 /* Parse the qualified declaration. */
15498 /* Restore the PEDANTIC flag. */
15502 }
15504 /* P2615: Determine if we're parsing a name-declaration specifically,
15505 or if special-declarations are OK too. */
15506 bool require_name_decl_p
15511 /* Try to figure out what kind of declaration is present. */
15517 {
15518 location_t semicolon_loc
15520 /* A declaration consisting of a single semicolon is invalid
15521 before C++11. Allow it unless we're being pedantic. */
15524 }
15528 CPP_SEMICOLON))
15529 {
15534 {
15537 std_attrs);
15539 {
15542 {
15544 CPP_PRAGMA));
15546 }
15548 }
15549 }
15557 }
15559 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
15564 /* Conditionally, allow attributes to precede a linkage specification. */
15566 {
15574 {
15576 /* We might have already been here. */
15578 {
15586 }
15589 }
15590 else
15591 {
15594 }
15595 }
15596 /* If we already had some attributes, and we've added more, then prepend.
15597 Otherwise attributes just contains any that we just read. */
15599 {
15603 }
15605 /* If the next token is `extern' and the following token is a string
15606 literal, then we have a linkage specification. */
15610 /* If the next token is `template', then we have either a template
15611 declaration, an explicit instantiation, or an explicit
15612 specialization. */
15614 {
15615 /* `template <>' indicates a template specialization. */
15618 {
15620 {
15621 auto_diagnostic_group d;
15628 }
15630 }
15631 /* `template <' indicates a template declaration. */
15634 /* Anything else must be an explicit instantiation. */
15635 else
15636 {
15641 }
15642 }
15643 /* If the next token is `export', it's new-style modules or
15644 old-style template. */
15646 {
15649 else
15650 {
15651 /* We check for nested exports in cp_parser_module_export. */
15657 }
15658 }
15660 {
15665 // In module purview this will be ill-formed.
15671 else
15673 }
15674 /* If the next token is `extern', 'static' or 'inline' and the one
15675 after that is `template', we have a GNU extended explicit
15676 instantiation directive. */
15683 /* If the next token is `namespace', check for a named or unnamed
15684 namespace definition. */
15693 /* An unnamed namespace definition. */
15697 /* An inline (associated) namespace definition. */
15701 /* Objective-C++ declaration/definition. */
15708 /* At this point we may have a template declared by a concept
15709 introduction. */
15714 else
15715 /* Try to parse a block-declaration, or a function-definition. */
15718 /* Free any declarators allocated. */
15720 }
15722 /* Parse a namespace-scope declaration. */
15724 static void
15726 {
15730 /* A top-level declaration can consist solely of a #pragma. A
15731 nested declaration cannot, so this is done here and not in
15732 cp_parser_declaration. (A #pragma at block scope is
15733 handled in cp_parser_statement.) */
15735 else
15736 /* Parse the declaration itself. */
15738 }
15740 /* Parse a block-declaration.
15742 block-declaration:
15743 simple-declaration
15744 asm-definition
15745 namespace-alias-definition
15746 using-declaration
15747 using-directive
15749 GNU Extension:
15751 block-declaration:
15752 __extension__ block-declaration
15754 C++0x Extension:
15756 block-declaration:
15757 static_assert-declaration
15759 If STATEMENT_P is TRUE, then this block-declaration is occurring as
15760 part of a declaration-statement. */
15762 static void
15765 {
15768 /* Check for the `__extension__' keyword. */
15770 {
15771 /* Parse the qualified declaration. */
15773 /* Restore the PEDANTIC flag. */
15777 }
15779 /* Peek at the next token to figure out which kind of declaration is
15780 present. */
15783 /* If the next keyword is `asm', we have an asm-definition. */
15785 {
15789 }
15790 /* If the next keyword is `namespace', we have a
15791 namespace-alias-definition. */
15794 /* If the next keyword is `using', we have a
15795 using-declaration, a using-directive, or an alias-declaration. */
15797 {
15802 /* If the token after `using' is `namespace', then we have a
15803 using-directive. */
15809 /* If the second token after 'using' is '=', then we have an
15810 alias-declaration. */
15816 /* Otherwise, it's a using-declaration. */
15817 else
15820 }
15821 /* If the next keyword is `__label__' we have a misplaced label
15822 declaration. */
15824 {
15828 /* If the next token is now a `;', consume it. */
15831 }
15832 /* If the next token is `static_assert' we have a static assertion. */
15835 else
15836 {
15841 /* If the next tokens after attributes is `using namespace', then we have
15842 a using-directive. */
15846 RID_NAMESPACE))
15847 {
15851 }
15852 /* If the next token after attributes is `asm', then we have
15853 an asm-definition. */
15855 {
15859 }
15860 /* Anything else must be a simple-declaration. */
15861 else
15864 }
15865 }
15867 /* Parse a simple-declaration.
15869 simple-declaration:
15870 decl-specifier-seq [opt] init-declarator-list [opt] ;
15871 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15872 brace-or-equal-initializer ;
15874 init-declarator-list:
15875 init-declarator
15876 init-declarator-list , init-declarator
15878 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
15879 function-definition as a simple-declaration.
15881 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15882 parsed declaration if it is an uninitialized single declarator not followed
15883 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15884 if present, will not be consumed. */
15886 static void
15890 {
15891 cp_decl_specifier_seq decl_specifiers;
15900 /* Defer access checks until we know what is being declared; the
15901 checks for names appearing in the decl-specifier-seq should be
15902 done as if we were in the scope of the thing being declared. */
15905 /* Parse the decl-specifier-seq. We have to keep track of whether
15906 or not the decl-specifier-seq declares a named class or
15907 enumeration type, since that is the only case in which the
15908 init-declarator-list is allowed to be empty.
15910 [dcl.dcl]
15912 In a simple-declaration, the optional init-declarator-list can be
15913 omitted only when declaring a class or enumeration, that is when
15914 the decl-specifier-seq contains either a class-specifier, an
15915 elaborated-type-specifier, or an enum-specifier. */
15917 CP_PARSER_FLAGS_OPTIONAL,
15920 /* We no longer need to defer access checks. */
15923 cp_omp_declare_simd_data odsd;
15929 /* In a block scope, a valid declaration must always have a
15930 decl-specifier-seq. By not trying to parse declarators, we can
15931 resolve the declaration/expression ambiguity more quickly. */
15934 {
15937 }
15939 /* If the next two tokens are both identifiers, the code is
15940 erroneous. The usual cause of this situation is code like:
15942 T t;
15944 where "T" should name a type -- but does not. */
15947 {
15948 /* If parsing tentatively, we should commit; we really are
15949 looking at a declaration. */
15951 /* Give up. */
15953 }
15957 /* Look for C++17 decomposition declaration. */
15965 {
15966 tree decl
15968 maybe_range_for_decl,
15971 /* The next token should be either a `,' or a `;'. */
15973 /* If it's a `;', we are done. */
15977 {
15981 }
15982 /* Anything else is an error. */
15983 else
15984 {
15985 /* If we have already issued an error message we don't need
15986 to issue another one. */
15991 /* Skip tokens until we reach the end of the statement. */
15993 /* If the next token is now a `;', consume it. */
15997 }
15998 }
15999 else
16002 tree last_type;
16004 /* NULL_TREE if both variable and function declaration are allowed,
16005 error_mark_node if function declaration are not allowed and
16006 a FUNCTION_DECL that should be diagnosed if it is followed by
16007 variable declarations. */
16008 tree auto_function_declaration;
16011 auto_specifier_p
16015 /* Keep going until we hit the `;' at the end of the simple
16016 declaration. */
16019 CPP_SEMICOLON))
16020 {
16023 tree decl;
16027 {
16028 /* If we are processing next declarator, comma is expected */
16033 {
16037 }
16038 }
16039 else
16042 /* Parse the init-declarator. */
16044 CP_PARSER_FLAGS_NONE,
16047 function_definition_allowed_p,
16049 declares_class_or_enum,
16051 maybe_range_for_decl,
16055 /* If an error occurred while parsing tentatively, exit quickly.
16056 (That usually happens when in the body of a function; each
16057 statement is treated as a declaration-statement until proven
16058 otherwise.) */
16063 {
16064 /* If the init-declarator-list contains more than one
16065 init-declarator, they shall all form declarations of
16066 variables. */
16070 {
16072 "non-variable %qD in declaration with more than one "
16076 }
16077 }
16081 {
16085 {
16086 /* If the list of declarators contains more than one declarator,
16087 the type of each declared variable is determined as described
16088 above. If the type deduced for the template parameter U is not
16089 the same in each deduction, the program is ill-formed. */
16094 }
16095 else
16097 }
16099 /* Handle function definitions specially. */
16101 {
16102 /* If the next token is a `,', then we are probably
16103 processing something like:
16105 void f() {}, *p;
16107 which is erroneous. */
16109 {
16112 "mixing"
16114 }
16115 /* Otherwise, we're done with the list of declarators. */
16116 else
16117 {
16121 }
16122 }
16125 /* The next token should be either a `,' or a `;'. */
16127 /* If it's a `,', there are more declarators to come. */
16130 /* If it's a `;', we are done. */
16134 {
16139 }
16140 /* Anything else is an error. */
16141 else
16142 {
16143 /* If we have already issued an error message we don't need
16144 to issue another one. */
16146 /* grokfndecl sets DECL_INITIAL to error_mark_node for
16147 functions. */
16151 /* Skip tokens until we reach the end of the statement. */
16153 /* If the next token is now a `;', consume it. */
16157 }
16158 /* After the first time around, a function-definition is not
16159 allowed -- even if it was OK at first. For example:
16161 int i, f() {}
16163 is not valid. */
16165 }
16167 /* Issue an error message if no declarators are present, and the
16168 decl-specifier-seq does not itself declare a class or
16169 enumeration: [dcl.dcl]/3. */
16171 {
16173 {
16177 /* Ensure an error is issued anyway when finish_decltype_type,
16178 called via cp_parser_decl_specifier_seq, returns a class or
16179 an enumeration (c++/51786). */
16182 }
16183 /* Perform any deferred access checks. */
16185 }
16187 /* Consume the `;'. */
16188 finish:
16192 {
16198 }
16200 done:
16203 }
16205 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
16206 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
16207 initializer ; */
16209 static tree
16214 {
16219 /* Parse the identifier-list. */
16226 {
16232 {
16234 {
16236 OPT_Wc__26_extensions,
16237 "structured bindings with attributed identifiers "
16238 "only available with %<-std=c++2c%> or "
16241 }
16247 }
16255 }
16259 {
16265 else
16266 {
16269 }
16270 }
16274 "structured bindings only available with "
16277 tree pushed_scope;
16284 NULL_TREE);
16291 cp_expr e;
16292 cp_decl_specifier_seq decl_specs;
16299 {
16303 else
16304 {
16307 }
16308 tree elt_pushed_scope;
16317 {
16318 /* Ensure we've diagnosed redeclaration if we aren't creating
16319 a new VAR_DECL. */
16322 }
16323 else
16327 }
16330 {
16333 }
16337 {
16345 || (is_direct_init
16348 {
16352 }
16355 {
16361 }
16362 }
16364 {
16367 /* Ensure DECL_VALUE_EXPR is created for all the decls but
16368 the underlying DECL. */
16370 }
16376 {
16379 }
16382 }
16384 /* Names of storage classes. */
16387 cp_storage_class_name[] = {
16389 };
16391 /* Parse a decl-specifier-seq.
16393 decl-specifier-seq:
16394 decl-specifier-seq [opt] decl-specifier
16395 decl-specifier attribute-specifier-seq [opt] (C++11)
16397 decl-specifier:
16398 storage-class-specifier
16399 type-specifier
16400 function-specifier
16401 friend
16402 typedef
16404 GNU Extension:
16406 decl-specifier:
16407 attributes
16409 Concepts Extension:
16411 decl-specifier:
16412 concept
16414 Set *DECL_SPECS to a representation of the decl-specifier-seq.
16416 The parser flags FLAGS is used to control type-specifier parsing.
16418 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
16419 flags:
16421 1: one of the decl-specifiers is an elaborated-type-specifier
16422 (i.e., a type declaration)
16423 2: one of the decl-specifiers is an enum-specifier or a
16424 class-specifier (i.e., a type definition)
16426 */
16428 static void
16430 cp_parser_flags flags,
16433 {
16437 cp_decl_spec ds;
16439 /* Clear DECL_SPECS. */
16442 /* Assume no class or enumeration type is declared. */
16445 /* Keep a token that additionally will be used for diagnostics. */
16447 /* Keep reading specifiers until there are no more to read. */
16449 {
16454 /* Peek at the next token. */
16457 /* Save the first token of the decl spec list for error
16458 reporting. */
16461 /* Handle attributes. */
16464 {
16465 /* Parse the attributes. */
16468 /* In a sequence of declaration specifiers, c++11 attributes
16469 appertain to the type that precede them. In that case
16470 [dcl.spec]/1 says:
16472 The attribute-specifier-seq affects the type only for
16473 the declaration it appears in, not other declarations
16474 involving the same type.
16476 But for now let's force the user to position the
16477 attribute either at the beginning of the declaration or
16478 after the declarator-id, which would clearly mean that it
16479 applies to the declarator. */
16481 {
16483 /* The c++11 attribute is at the beginning of the
16484 declaration. It appertains to the entity being
16486 else
16487 {
16489 {
16492 }
16494 {
16495 /* This is an attribute following a
16496 class-specifier. */
16501 }
16502 else
16503 {
16504 decl_specs->std_attributes
16508 }
16510 }
16511 }
16513 decl_specs->attributes
16518 }
16519 /* We know by this point that the token is not part of an attribute. */
16522 /* Special case for "this" specifier, indicating a parm is an xobj parm.
16523 The "this" specifier must be the first specifier in the declaration,
16524 after any attributes. */
16526 {
16529 {
16530 /* Don't emit diagnostics if we have already seen "this",
16531 leave it for set_and_check_decl_spec_loc. */
16533 {
16534 auto_diagnostic_group d;
16536 /* Works, need to add tests for it though. */
16541 "%<this%> must be the first specifier "
16543 }
16544 }
16547 }
16549 /* Assume we will find a decl-specifier keyword. */
16551 /* If the next token is an appropriate keyword, we can simply
16552 add it to the list. */
16554 {
16555 /* decl-specifier:
16556 friend
16557 constexpr
16558 constinit */
16561 {
16566 }
16567 else
16568 {
16570 /* Consume the token. */
16572 }
16597 /* Warn for concept as a decl-specifier. We'll rewrite these as
16598 concept declarations later. */
16600 {
16605 else
16608 }
16610 /* In C++20 a concept definition is just 'concept name = expr;'
16611 Support that syntax as a TS extension by pretending we've seen
16612 the 'bool' specifier. */
16616 {
16620 }
16623 /* function-specifier:
16624 inline
16625 virtual
16626 explicit */
16633 /* decl-specifier:
16634 typedef */
16637 /* Consume the token. */
16643 /* A constructor declarator cannot appear in a typedef. */
16645 /* The "typedef" keyword can only occur in a declaration; we
16646 may as well commit at this point. */
16650 {
16660 }
16663 /* storage-class-specifier:
16664 auto
16665 register
16666 static
16667 extern
16668 mutable
16670 GNU Extension:
16671 thread */
16674 {
16675 /* Consume the token. */
16678 /* Complain about `auto' as a storage specifier, if
16679 we're complaining about C++0x compatibility. */
16683 "%<auto%> changes meaning in C++11; "
16686 /* Set the storage class anyway. */
16688 token);
16689 }
16690 else
16691 /* C++0x auto type-specifier. */
16699 /* Consume the token. */
16702 token);
16705 /* Consume the token. */
16711 /* We did not yet find a decl-specifier yet. */
16714 }
16726 {
16732 "%qD only valid in lambda with %<-std=c++23%> or "
16734 }
16739 /* Constructors are a special case. The `S' in `S()' is not a
16740 decl-specifier; it is the beginning of the declarator. */
16741 constructor_p
16742 = (!found_decl_spec
16743 && constructor_possible_p
16744 && (cp_parser_constructor_declarator_p
16746 ds_friend))));
16748 /* If we don't have a DECL_SPEC yet, then we must be looking at
16749 a type-specifier. */
16751 {
16754 tree type_spec;
16759 type_spec
16761 decl_specs,
16767 /* If this type-specifier referenced a user-defined type
16768 (a typedef, class-name, etc.), then we can't allow any
16769 more such type-specifiers henceforth.
16771 [dcl.spec]
16773 The longest sequence of decl-specifiers that could
16774 possibly be a type name is taken as the
16775 decl-specifier-seq of a declaration. The sequence shall
16776 be self-consistent as described below.
16778 [dcl.type]
16780 As a general rule, at most one type-specifier is allowed
16781 in the complete decl-specifier-seq of a declaration. The
16782 only exceptions are the following:
16784 -- const or volatile can be combined with any other
16785 type-specifier.
16787 -- signed or unsigned can be combined with char, long,
16788 short, or int.
16790 -- ..
16792 Example:
16794 typedef char* Pc;
16795 void g (const int Pc);
16797 Here, Pc is *not* part of the decl-specifier seq; it's
16798 the declarator. Therefore, once we see a type-specifier
16799 (other than a cv-qualifier), we forbid any additional
16800 user-defined types. We *do* still allow things like `int
16801 int' to be considered a decl-specifier-seq, and issue the
16802 error message later. */
16805 /* A constructor declarator cannot follow a type-specifier. */
16807 {
16815 }
16816 }
16818 /* If we still do not have a DECL_SPEC, then there are no more
16819 decl-specifiers. */
16824 {
16828 "standard attributes must precede the decl-specifiers to "
16829 "apply to the declaration, or follow them to apply to "
16831 }
16834 /* After we see one decl-specifier, further decl-specifiers are
16835 always optional. */
16837 }
16839 /* Don't allow a friend specifier with a class definition. */
16844 }
16846 /* Parse an (optional) storage-class-specifier.
16848 storage-class-specifier:
16849 auto
16850 register
16851 static
16852 extern
16853 mutable
16855 GNU Extension:
16857 storage-class-specifier:
16858 thread
16860 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
16862 static tree
16864 {
16866 {
16870 /* Fall through for C++98. */
16878 /* Consume the token. */
16883 }
16884 }
16886 /* Parse an (optional) function-specifier.
16888 function-specifier:
16889 inline
16890 virtual
16891 explicit
16893 C++20 Extension:
16894 explicit(constant-expression)
16896 Returns an IDENTIFIER_NODE corresponding to the keyword used.
16897 Updates DECL_SPECS, if it is non-NULL. */
16899 static tree
16902 {
16905 {
16911 /* 14.5.2.3 [temp.mem]
16913 A member function template shall not be virtual. */
16917 else
16922 {
16924 /* If we see '(', it's C++20 explicit(bool). */
16925 tree expr;
16927 {
16928 matching_parens parens;
16931 /* New types are not allowed in an explicit-specifier. */
16934 parser->type_definition_forbidden_message
16939 "%<explicit(bool)%> only available with %<-std=c++20%> "
16942 /* Parse the constant-expression. */
16945 /* Restore the saved message. */
16948 }
16949 else
16950 /* The explicit-specifier explicit without a constant-expression is
16951 equivalent to the explicit-specifier explicit(true). */
16954 /* [dcl.fct.spec]
16955 "the constant-expression, if supplied, shall be a contextually
16956 converted constant expression of type bool." */
16958 /* We could evaluate it -- mark the decl as appropriate. */
16964 /* The expression was value-dependent. Remember it so that we can
16965 substitute it later. */
16968 }
16972 }
16974 /* Consume the token. */
16976 }
16978 /* Parse a linkage-specification.
16980 linkage-specification:
16981 extern string-literal { declaration-seq [opt] }
16982 extern string-literal name-declaration */
16984 static void
16986 {
16987 /* Look for the `extern' keyword. */
16988 cp_token *extern_token
16991 /* Look for the string-literal. */
16993 tree linkage;
16996 else
17000 /* Transform the literal into an identifier. If the literal is a
17001 wide-character string, or contains embedded NULs, then we can't
17002 handle it as the user wants. */
17006 {
17008 /* Assume C++ linkage. */
17010 }
17011 else
17014 /* We're now using the new linkage. */
17019 /* Preserve the location of the innermost linkage specification,
17020 tracking the locations of nested specifications via a local. */
17021 location_t saved_location
17023 /* Construct a location ranging from the start of the "extern" to
17024 the end of the string-literal, with the caret at the start, e.g.:
17025 extern "C" {
17026 ^~~~~~~~~~
17027 */
17028 parser->innermost_linkage_specification_location
17033 /* If the next token is a `{', then we're using the first
17034 production. */
17036 {
17040 /* Consume the `{' token. */
17041 matching_braces braces;
17043 /* Parse the declarations. */
17045 /* Look for the closing `}'. */
17047 }
17048 /* Otherwise, there's just one declaration. */
17049 else
17050 {
17053 saved_in_unbraced_linkage_specification_p
17057 parser->in_unbraced_linkage_specification_p
17059 }
17061 /* We're done with the linkage-specification. */
17065 /* Restore location of parent linkage specification, if any. */
17067 }
17069 /* Parse a static_assert-declaration.
17071 static_assert-declaration:
17072 static_assert ( constant-expression , string-literal ) ;
17073 static_assert ( constant-expression ) ; (C++17)
17074 static_assert ( constant-expression, conditional-expression ) ; (C++26)
17076 If MEMBER_P, this static_assert is a class member. */
17078 static void
17080 {
17081 cp_expr condition;
17082 location_t token_loc;
17083 tree message;
17085 /* Peek at the `static_assert' token so we can keep track of exactly
17086 where the static assertion started. */
17089 /* Look for the `static_assert' keyword. */
17091 RT_STATIC_ASSERT))
17094 /* We know we are in a static assertion; commit to any tentative
17095 parse. */
17099 /* Parse the `(' starting the static assertion condition. */
17100 matching_parens parens;
17103 /* Parse the constant-expression. Allow a non-constant expression
17104 here in order to give better diagnostics in finish_static_assert. */
17105 condition
17111 {
17114 "%<static_assert%> without a message "
17116 /* Eat the ')' */
17121 }
17122 else
17123 {
17124 /* Parse the separating `,'. */
17127 /* Parse the message expression. */
17130 {
17138 }
17140 {
17144 "%<static_assert%> with non-string message only "
17150 message);
17151 }
17154 else
17158 /* A `)' completes the static assertion. */
17164 }
17166 /* A semicolon terminates the declaration. */
17169 /* Get the location for the static assertion. Use that of the
17170 condition if available, otherwise, use that of the "static_assert"
17171 token. */
17176 /* Complete the static assertion, which may mean either processing
17177 the static assert now or saving it for template instantiation. */
17180 }
17182 /* Parse the expression in decltype ( expression ). */
17184 static tree
17187 {
17189 tree expr;
17191 /* First, try parsing an id-expression. */
17202 {
17205 cp_id_kind idk;
17209 /* Lookup the name we got back from the id-expression. */
17219 {
17220 /* Complete lookup of the id-expression. */
17221 expr = (finish_id_expression
17234 {
17235 /* We found an id-expression, but it was something that we
17236 should not have found. This is an error, not something
17237 we can recover from, so report the error we found and
17238 we'll recover as gracefully as possible. */
17243 }
17244 }
17249 /* We have an id-expression. */
17251 }
17254 {
17255 /* Abort the id-expression parse. */
17258 /* Parsing tentatively, again. */
17261 /* Parse a class member access. */
17269 /* We have an id-expression. */
17271 }
17274 /* We have parsed the complete id-expression or member access. */
17276 else
17277 {
17278 /* Abort our attempt to parse an id-expression or member access
17279 expression. */
17282 /* Parse a full expression. */
17285 }
17288 }
17290 /* Parse a `decltype' type. Returns the type.
17292 decltype-specifier:
17293 decltype ( expression )
17294 C++14:
17295 decltype ( auto ) */
17297 static tree
17299 {
17304 {
17305 /* Already parsed. */
17308 }
17310 /* Look for the `decltype' token. */
17314 /* Parse the opening `('. */
17315 matching_parens parens;
17319 /* Since we're going to preserve any side-effects from this parse, set up a
17320 firewall to protect our callers from cp_parser_commit_to_tentative_parse
17321 in the expression. */
17324 /* If in_declarator_p, a reparse as an expression might succeed (60361).
17325 Otherwise, commit now for better diagnostics. */
17336 {
17337 /* decltype (auto) */
17340 {
17342 "%<decltype(auto)%> type specifier only available with "
17345 }
17346 }
17347 else
17348 {
17349 /* decltype (expression) */
17351 /* Types cannot be defined in a `decltype' expression. Save away the
17352 old message and set the new one. */
17354 parser->type_definition_forbidden_message
17357 /* The restrictions on constant-expressions do not apply inside
17358 decltype expressions. */
17359 bool saved_integral_constant_expression_p
17361 bool saved_non_integral_constant_expression_p
17365 /* Within a parenthesized expression, a `>' token is always
17366 the greater-than operator. */
17367 bool saved_greater_than_is_operator_p
17371 /* Don't synthesize an implicit template type parameter here. This
17372 could happen with C++23 code like
17374 void f(decltype(new auto{0}));
17376 where we want to deduce the auto right away so that the parameter
17377 is of type 'int *'. */
17381 /* Do not actually evaluate the expression. */
17384 /* Do not warn about problems with the expression. */
17390 /* Go back to evaluating expressions. */
17394 /* The `>' token might be the end of a template-id or
17395 template-parameter-list now. */
17396 parser->greater_than_is_operator_p
17399 /* Restore the old message and the integral constant expression
17400 flags. */
17402 parser->integral_constant_expression_p
17404 parser->non_integral_constant_expression_p
17406 }
17408 /* Parse to the closing `)'. */
17410 {
17414 }
17416 /* If we got a parse error while tentative, bail out now. */
17418 {
17421 }
17424 /* Build auto. */
17426 else
17428 tf_warning_or_error);
17430 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
17431 it again. */
17448 }
17450 /* Special member functions [gram.special] */
17452 /* Parse a conversion-function-id.
17454 conversion-function-id:
17455 operator conversion-type-id
17457 Returns an IDENTIFIER_NODE representing the operator. */
17459 static tree
17461 {
17462 tree type;
17463 tree saved_scope;
17464 tree saved_qualifying_scope;
17465 tree saved_object_scope;
17468 /* Look for the `operator' token. */
17471 /* When we parse the conversion-type-id, the current scope will be
17472 reset. However, we need that information in able to look up the
17473 conversion function later, so we save it here. */
17477 /* We must enter the scope of the class so that the names of
17478 entities declared within the class are available in the
17479 conversion-type-id. For example, consider:
17481 struct S {
17482 typedef int I;
17483 operator I();
17484 };
17486 S::operator I() { ... }
17488 In order to see that `I' is a type-name in the definition, we
17489 must be in the scope of `S'. */
17492 /* Parse the conversion-type-id. */
17494 /* Leave the scope of the class, if any. */
17497 /* Restore the saved scope. */
17501 /* If the TYPE is invalid, indicate failure. */
17505 }
17507 /* Parse a conversion-type-id:
17509 conversion-type-id:
17510 type-specifier-seq conversion-declarator [opt]
17512 Returns the TYPE specified. */
17514 static tree
17516 {
17517 tree attributes;
17518 cp_decl_specifier_seq type_specifiers;
17520 tree type_specified;
17523 /* Parse the attributes. */
17527 parser->type_definition_forbidden_message
17530 /* Parse the type-specifiers. DR 2413 clarifies that `typename' is
17531 optional in conversion-type-id. */
17539 /* If that didn't work, stop. */
17542 /* Parse the conversion-declarator. */
17550 /* Don't give this error when parsing tentatively. This happens to
17551 work because we always parse this definitively once. */
17554 {
17556 {
17559 }
17563 }
17566 }
17568 /* Parse an (optional) conversion-declarator.
17570 conversion-declarator:
17571 ptr-operator conversion-declarator [opt]
17573 */
17577 {
17580 cp_cv_quals cv_quals;
17582 /* We don't know if there's a ptr-operator next, or not. */
17584 /* Try the ptr-operator. */
17587 /* If it worked, look for more conversion-declarators. */
17589 {
17592 /* Parse another optional declarator. */
17595 declarator = cp_parser_make_indirect_declarator
17599 }
17602 }
17604 /* Parse an (optional) ctor-initializer.
17606 ctor-initializer:
17607 : mem-initializer-list */
17609 static void
17611 {
17612 /* If the next token is not a `:', then there is no
17613 ctor-initializer. */
17615 {
17616 /* Do default initialization of any bases and members. */
17620 }
17622 /* Consume the `:' token. */
17624 /* And the mem-initializer-list. */
17626 }
17628 /* Parse a mem-initializer-list.
17630 mem-initializer-list:
17631 mem-initializer ... [opt]
17632 mem-initializer ... [opt] , mem-initializer-list */
17634 static void
17636 {
17641 /* Let the semantic analysis code know that we are starting the
17642 mem-initializer-list. */
17647 /* Loop through the list. */
17649 {
17650 tree mem_initializer;
17653 /* Parse the mem-initializer. */
17655 /* If the next token is a `...', we're expanding member initializers. */
17661 {
17662 /* Consume the `...'. */
17666 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
17667 can be expanded but members cannot. */
17670 {
17675 }
17677 /* Construct the pack expansion type. */
17680 }
17683 {
17687 }
17688 /* Look for a target constructor. */
17692 {
17695 {
17699 }
17701 }
17702 /* Add it to the list, unless it was erroneous. */
17704 {
17707 }
17708 /* If the next token is not a `,', we're done. */
17711 /* Consume the `,' token. */
17713 }
17715 /* Perform semantic analysis. */
17718 }
17720 /* Parse a mem-initializer.
17722 mem-initializer:
17723 mem-initializer-id ( expression-list [opt] )
17724 mem-initializer-id braced-init-list
17726 GNU extension:
17728 mem-initializer:
17729 ( expression-list [opt] )
17731 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
17732 class) or FIELD_DECL (for a non-static data member) to initialize;
17733 the TREE_VALUE is the expression-list. An empty initialization
17734 list is represented by void_list_node. */
17736 static tree
17738 {
17739 tree mem_initializer_id;
17740 tree expression_list;
17741 tree member;
17744 /* Find out what is being initialized. */
17746 {
17750 }
17751 else
17752 {
17756 }
17762 {
17768 }
17769 else
17770 {
17782 }
17795 /* We can't attach the source location of this initializer directly to
17796 the list node, so we instead attach it to a dummy EMPTY_CLASS_EXPR
17797 within the TREE_TYPE of the list node. */
17798 location_t loc
17805 }
17807 /* Parse a mem-initializer-id.
17809 mem-initializer-id:
17810 :: [opt] nested-name-specifier [opt] class-name
17811 decltype-specifier (C++11)
17812 identifier
17814 Returns a TYPE indicating the class to be initialized for the first
17815 production (and the second in C++11). Returns an IDENTIFIER_NODE
17816 indicating the data member to be initialized for the last production. */
17818 static tree
17820 {
17824 tree id;
17828 /* `typename' is not allowed in this context ([temp.res]). */
17830 {
17832 "keyword %<typename%> not allowed in this context (a qualified "
17835 }
17836 /* Look for the optional `::' operator. */
17837 global_scope_p
17841 /* Look for the optional nested-name-specifier. The simplest way to
17842 implement:
17844 [temp.res]
17846 The keyword `typename' is not permitted in a base-specifier or
17847 mem-initializer; in these contexts a qualified name that
17848 depends on a template-parameter is implicitly assumed to be a
17849 type name.
17851 is to assume that we have seen the `typename' keyword at this
17852 point. */
17853 nested_name_specifier_p
17862 /* If there is a `::' operator or a nested-name-specifier, then we
17863 are definitely looking for a class-name. */
17868 typename_type,
17872 /* Otherwise, we could also be looking for an ordinary identifier. */
17875 /* Try a decltype-specifier. */
17877 else
17878 /* Otherwise, try a class-name. */
17882 none_type,
17886 /* If we found one, we're done. */
17889 /* Otherwise, look for an ordinary identifier. */
17891 }
17893 /* Overloading [gram.over] */
17895 /* Parse an operator-function-id.
17897 operator-function-id:
17898 operator operator
17900 Returns an IDENTIFIER_NODE for the operator which is a
17901 human-readable spelling of the identifier, e.g., `operator +'. */
17903 static cp_expr
17905 {
17907 /* Look for the `operator' keyword. */
17910 /* And then the name of the operator itself. */
17912 }
17914 /* Return an identifier node for a user-defined literal operator.
17915 The suffix identifier is chained to the operator name identifier. */
17917 tree
17919 {
17920 tree identifier;
17928 }
17930 /* Parse an operator.
17932 operator:
17933 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
17934 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
17935 || ++ -- , ->* -> () []
17937 GNU Extensions:
17939 operator:
17940 <? >? <?= >?=
17942 Returns an IDENTIFIER_NODE for the operator which is a
17943 human-readable spelling of the identifier, e.g., `operator +'. */
17945 static cp_expr
17947 {
17952 /* Peek at the next token. */
17957 /* Figure out which operator we have. */
17962 {
17964 {
17965 /* The keyword should be either `new', `delete' or `co_await'. */
17972 else
17975 /* Consume the `new', `delete' or co_await token. */
17978 /* Peek at the next token. */
17980 /* If it's a `[' token then this is the array variant of the
17981 operator. */
17984 {
17985 /* Consume the `[' token. */
17987 /* Look for the `]' token. */
17992 }
17995 }
18158 /* Consume the `?'. */
18160 /* Look for the matching `:'. */
18166 {
18167 /* Consume the `('. */
18168 matching_parens parens;
18170 /* Look for the matching `)'. */
18177 }
18180 /* Consume the `['. */
18182 /* Look for the matching `]'. */
18193 /* FALLTHRU */
18202 {
18203 tree string_tree;
18209 /* Consume the string. */
18215 {
18219 }
18220 else
18221 {
18223 /* Look for the suffix identifier. */
18226 {
18229 }
18231 {
18235 }
18236 else
18237 {
18240 }
18241 }
18246 {
18249 }
18252 {
18255 }
18257 {
18260 }
18261 /* Generate a location of the form:
18262 "" _suffix_identifier
18263 ^~~~~~~~~~~~~~~~~~~~~
18264 with caret == start at the start token, finish at the end of the
18265 suffix identifier. */
18266 location_t combined_loc
18269 }
18272 /* Anything else is an error. */
18274 }
18276 /* If we have selected an identifier, we need to consume the
18277 operator token. */
18279 {
18283 }
18284 /* Otherwise, no valid operator name was present. */
18285 else
18286 {
18289 }
18293 }
18295 /* Parse a template-declaration.
18297 template-declaration:
18298 export [opt] template < template-parameter-list > declaration
18300 If MEMBER_P is TRUE, this template-declaration occurs within a
18301 class-specifier.
18303 The grammar rule given by the standard isn't correct. What
18304 is really meant is:
18306 template-declaration:
18307 export [opt] template-parameter-list-seq
18308 decl-specifier-seq [opt] init-declarator [opt] ;
18309 export [opt] template-parameter-list-seq
18310 function-definition
18312 template-parameter-list-seq:
18313 template-parameter-list-seq [opt]
18314 template < template-parameter-list >
18316 Concept Extensions:
18318 template-parameter-list-seq:
18319 template < template-parameter-list > requires-clause [opt]
18321 requires-clause:
18322 requires logical-or-expression */
18324 static void
18326 {
18327 /* Check for `export'. */
18329 {
18330 /* Consume the `export' token. */
18332 /* Warn that this use of export is deprecated. */
18337 else
18339 }
18342 }
18344 /* Parse a template-parameter-list.
18346 template-parameter-list:
18347 template-parameter
18348 template-parameter-list , template-parameter
18350 Returns a TREE_LIST. Each node represents a template parameter.
18351 The nodes are connected via their TREE_CHAINs. */
18353 static tree
18355 {
18358 /* Don't create wrapper nodes within a template-parameter-list,
18359 since we don't want to have different types based on the
18360 spelling location of constants and decls within them. */
18361 auto_suppress_location_wrappers sentinel;
18365 /* The loop below parses the template parms. We first need to know
18366 the total number of template parms to be able to compute proper
18367 canonical types of each dependent type. So after the loop, when
18368 we know the total number of template parms,
18369 end_template_parm_list computes the proper canonical types and
18370 fixes up the dependent types accordingly. */
18372 {
18373 tree parameter;
18376 location_t parm_loc;
18378 /* Parse the template-parameter. */
18383 /* Add it to the list. */
18386 parm_loc,
18387 parameter,
18388 is_non_type,
18389 is_parameter_pack);
18390 else
18391 {
18394 }
18396 /* If the next token is not a `,', we're done. */
18399 /* Otherwise, consume the `,' token. */
18401 }
18404 }
18406 /* Parse a introduction-list.
18408 introduction-list:
18409 introduced-parameter
18410 introduction-list , introduced-parameter
18412 introduced-parameter:
18413 ...[opt] identifier
18415 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
18416 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
18417 WILDCARD_DECL will also have DECL_NAME set and token location in
18418 DECL_SOURCE_LOCATION. */
18420 static tree
18422 {
18426 {
18435 /* Build placeholder. */
18443 /* If the next token is not a `,', we're done. */
18446 /* Otherwise, consume the `,' token. */
18448 }
18450 /* Convert the vec into a TREE_VEC. */
18453 tree parm;
18459 }
18461 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
18462 is an abstract declarator. */
18466 {
18471 }
18473 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
18474 is an abstract declarator. */
18478 {
18482 else
18484 }
18486 /* Returns true if TYPE would declare a constrained constrained-parameter. */
18490 {
18495 }
18497 /* Returns true if PARM declares a constrained-parameter. */
18501 {
18503 }
18505 /* Check that the type parameter is only a declarator-id, and that its
18506 type is not cv-qualified. */
18508 bool
18511 {
18516 {
18519 }
18521 /* Don't allow cv-qualified type parameters. */
18524 {
18527 }
18530 }
18532 /* Finish parsing/processing a template type parameter and checking
18533 various restrictions. */
18537 tree id,
18539 {
18542 else
18544 }
18546 static tree
18548 {
18549 /* FIXME: This should probably be copied, and we may need to adjust
18550 the template parameter depths. */
18560 }
18562 /* Finish parsing/processing a template template parameter by borrowing
18563 the template parameter list from the prototype parameter. */
18565 static tree
18567 tree proto,
18568 tree id,
18570 {
18574 }
18576 /* Create a new non-type template parameter from the given PARM
18577 declarator. */
18579 static tree
18582 {
18588 }
18590 /* Build a constrained template parameter based on the PARMDECL
18591 declarator. The type of PARMDECL is the constrained type, which
18592 refers to the prototype template parameter that ultimately
18593 specifies the type of the declared parameter. */
18595 static tree
18599 {
18605 /* Build the parameter. Return an error if the declarator was invalid. */
18606 tree parm;
18611 parmdecl);
18612 else
18617 /* Finish the parameter decl and create a node attaching the
18618 default argument and constraint. */
18623 }
18625 /* Returns true if the parsed type actually represents the declaration
18626 of a type template-parameter. */
18628 static bool
18630 {
18633 }
18635 /* Returns true if the parsed type actually represents the declaration of
18636 a template template-parameter. */
18638 static bool
18640 {
18643 }
18645 /* Parse a default argument for a type template-parameter.
18646 Note that diagnostics are handled in cp_parser_template_parameter. */
18648 static tree
18650 {
18653 /* Consume the `=' token. */
18658 /* Tell cp_parser_lambda_expression this is a default argument. */
18662 /* Parse the default-argument. */
18665 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18666 NULL);
18670 {
18674 }
18677 }
18679 /* Parse a default argument for a template template-parameter. */
18681 static tree
18683 {
18688 /* Consume the `='. */
18690 /* Parse the id-expression. */
18692 /* save token before parsing the id-expression, for error
18693 reporting */
18695 tree default_argument
18703 /* If the id-expression was a template-id that refers to
18704 a template-class, we already have the declaration here,
18705 so no further lookup is needed. */
18706 ;
18707 else
18708 /* Look up the name. */
18709 default_argument
18711 none_type,
18717 /* See if the default argument is valid. */
18721 }
18723 /* Parse a template-parameter.
18725 template-parameter:
18726 type-parameter
18727 parameter-declaration
18729 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
18730 the parameter. The TREE_PURPOSE is the default value, if any.
18731 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
18732 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
18733 set to true iff this parameter is a parameter pack. */
18735 static tree
18738 {
18741 tree parm;
18743 /* Assume it is a type parameter or a template parameter. */
18745 /* Assume it not a parameter pack. */
18747 /* Peek at the next token. */
18749 /* If it is `template', we have a type-parameter. */
18752 /* If it is `class' or `typename' we do not know yet whether it is a
18753 type parameter or a non-type parameter. Consider:
18755 template <typename T, typename T::X X> ...
18757 or:
18759 template <class C, class D*> ...
18761 Here, the first parameter is a type parameter, and the second is
18762 a non-type parameter. We can tell by looking at the token after
18763 the identifier -- if it is a `,', `=', or `>' then we have a type
18764 parameter. */
18766 {
18767 /* Peek at the token after `class' or `typename'. */
18769 /* If it's an ellipsis, we have a template type parameter
18770 pack. */
18773 /* If it's an identifier, skip it. */
18776 /* Now, see if the token looks like the end of a template
18777 parameter. */
18782 }
18784 /* Otherwise, it is a non-type parameter or a constrained parameter.
18786 [temp.param]
18788 When parsing a default template-argument for a non-type
18789 template-parameter, the first non-nested `>' is taken as the end
18790 of the template parameter-list rather than a greater-than
18791 operator. */
18792 parameter_declarator
18794 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18801 /* If the parameter declaration is marked as a parameter pack, set
18802 *IS_PARAMETER_PACK to notify the caller. */
18807 {
18808 /* Can happen in some cases of erroneous input (c++/34892). */
18810 /* Consume the `...' for better error recovery. */
18812 }
18814 /* The parameter may have been constrained type parameter. */
18817 parameter_declarator,
18818 is_non_type);
18820 // Now we're sure that the parameter is a non-type parameter.
18831 }
18833 /* Parse a type-parameter.
18835 type-parameter:
18836 class identifier [opt]
18837 class identifier [opt] = type-id
18838 typename identifier [opt]
18839 typename identifier [opt] = type-id
18840 template < template-parameter-list > class identifier [opt]
18841 template < template-parameter-list > class identifier [opt]
18842 = id-expression
18844 GNU Extension (variadic templates):
18846 type-parameter:
18847 class ... identifier [opt]
18848 typename ... identifier [opt]
18850 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
18851 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
18852 the declaration of the parameter.
18854 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
18856 static tree
18858 {
18860 tree parameter;
18862 /* Look for a keyword to tell us what kind of parameter this is. */
18868 {
18871 {
18872 tree identifier;
18873 tree default_argument;
18875 /* If the next token is an ellipsis, we have a template
18876 argument pack. */
18878 {
18879 /* Consume the `...' token. */
18884 }
18886 /* If the next token is an identifier, then it names the
18887 parameter. */
18890 else
18893 /* Create the parameter. */
18896 /* If the next token is an `=', we have a default argument. */
18898 {
18899 default_argument
18902 /* Template parameter packs cannot have default
18903 arguments. */
18905 {
18908 "template parameter pack %qD cannot have a "
18910 else
18912 "template parameter packs cannot have "
18915 }
18918 }
18919 else
18922 /* Create the combined representation of the parameter and the
18923 default argument. */
18925 }
18929 {
18930 tree identifier;
18931 tree default_argument;
18933 /* Look for the `<'. */
18935 /* Parse the template-parameter-list. */
18937 /* Look for the `>'. */
18940 /* If template requirements are present, parse them. */
18942 {
18947 }
18949 /* Look for the `class' or 'typename' keywords. */
18951 /* If the next token is an ellipsis, we have a template
18952 argument pack. */
18954 {
18955 /* Consume the `...' token. */
18960 }
18961 /* If the next token is an `=', then there is a
18962 default-argument. If the next token is a `>', we are at
18963 the end of the parameter-list. If the next token is a `,',
18964 then we are at the end of this parameter. */
18968 {
18970 /* Treat invalid names as if the parameter were nameless. */
18973 }
18974 else
18977 /* Create the template parameter. */
18979 identifier);
18981 /* If the next token is an `=', then there is a
18982 default-argument. */
18984 {
18985 default_argument
18988 /* Template parameter packs cannot have default
18989 arguments. */
18991 {
18994 "template parameter pack %qD cannot "
18996 identifier);
18997 else
19001 }
19002 }
19003 else
19006 /* Create the combined representation of the parameter and the
19007 default argument. */
19009 }
19015 }
19018 }
19020 /* Parse a template-id.
19022 template-id:
19023 template-name < template-argument-list [opt] >
19025 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
19026 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
19027 returned. Otherwise, if the template-name names a function, or set
19028 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
19029 names a class, returns a TYPE_DECL for the specialization.
19031 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
19032 uninstantiated templates. */
19034 static tree
19040 {
19041 tree templ;
19042 tree arguments;
19043 tree template_id;
19048 /* If the next token corresponds to a template-id, there is no need
19049 to reparse it. */
19053 {
19056 }
19058 /* Avoid performing name lookup if there is no possibility of
19059 finding a template-id. */
19062 && !cp_parser_nth_token_starts_template_argument_list_p
19064 {
19067 }
19069 /* Remember where the template-id starts. */
19075 /* Parse the template-name. */
19078 check_dependency_p,
19079 is_declaration,
19080 tag_type,
19083 /* Push any access checks inside the firewall we're about to create. */
19089 /* Since we're going to preserve any side-effects from this parse, set up a
19090 firewall to protect our callers from cp_parser_commit_to_tentative_parse
19091 in the template arguments. */
19095 /* If we find the sequence `[:' after a template-name, it's probably
19096 a digraph-typo for `< ::'. Substitute the tokens and check if we can
19097 parse correctly the argument list. */
19104 {
19106 /* Change `:' into `::'. */
19108 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
19109 CPP_LESS. */
19112 /* Parse the arguments. */
19115 {
19116 /* If we couldn't parse an argument list, then we revert our changes
19117 and return simply an error. Maybe this is not a template-id
19118 after all. */
19123 }
19124 /* Otherwise, emit an error about the invalid digraph, but continue
19125 parsing because we got our argument list. */
19128 {
19131 "%<<:%> is an alternate spelling for %<[%>."
19134 {
19136 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
19139 }
19140 }
19141 }
19142 else
19143 {
19144 /* Look for the `<' that starts the template-argument-list. */
19146 {
19149 }
19150 /* Parse the arguments. */
19155 && !template_keyword_p
19158 {
19159 /* This didn't go well. */
19161 {
19162 /* C++20 says that "function-name < a;" is now ill-formed. */
19164 {
19167 "operand of %<<%> is ill-formed in C++20; wrap the "
19169 }
19170 else
19171 /* We expect "f<targs>" to be followed by "(args)". */
19175 /* Purge all subsequent tokens. */
19177 }
19178 else
19182 }
19183 }
19185 /* Set the location to be of the form:
19186 template-name < template-argument-list [opt] >
19187 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
19188 with caret == start at the start of the template-name,
19189 ranging until the closing '>'. */
19190 location_t combined_loc
19193 /* Check for concepts autos where they don't belong. We could
19194 identify types in some cases of identifier TEMPL, looking ahead
19195 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
19196 types. We reject them in functions, but if what we have is an
19197 identifier, even with none_type we can't conclude it's NOT a
19198 type, we have to wait for template substitution. */
19201 /* Build a representation of the specialization. */
19204 TEMPLATE_ID_EXPR,
19208 {
19209 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
19210 template (rather than some instantiation thereof) only if
19211 is not nested within some other construct. For example, in
19212 "template <typename T> void f(T) { A<T>::", A<T> is just an
19213 instantiation of A. */
19214 bool entering_scope
19217 template_id
19219 }
19221 {
19222 /* The caller will decide whether this is a concept check or type
19223 constraint. */
19226 }
19228 {
19232 }
19235 {
19236 /* Some type template in dependent scope. */
19239 TEMPLATE_ID_EXPR,
19242 }
19243 else
19244 {
19245 /* If it's not a class-template or a template-template, it should be
19246 a function-template. */
19252 }
19254 /* If parsing tentatively, replace the sequence of tokens that makes
19255 up the template-id with a CPP_TEMPLATE_ID token. That way,
19256 should we re-parse the token stream, we will not have to repeat
19257 the effort required to do the parse, nor will we issue duplicate
19258 error messages about problems during instantiation of the
19259 template. */
19261 /* Don't do this if we had a parse error in a declarator; re-parsing
19262 might succeed if a name changes meaning (60361). */
19266 {
19267 /* Reset the contents of the START_OF_ID token. */
19271 /* Retrieve any deferred checks. Do not pop this access checks yet
19272 so the memory will not be reclaimed during token replacing below. */
19279 /* Purge all subsequent tokens. */
19282 /* ??? Can we actually assume that, if template_id ==
19283 error_mark_node, we will have issued a diagnostic to the
19284 user, as opposed to simply marking the tentative parse as
19285 failed? */
19288 }
19292 }
19294 /* Like cp_parser_template_id, called in non-type context. */
19296 static tree
19301 {
19306 /* We didn't check the arguments in cp_parser_template_id; do that now. */
19309 }
19311 /* Parse a template-name.
19313 template-name:
19314 identifier
19316 The standard should actually say:
19318 template-name:
19319 identifier
19320 operator-function-id
19322 A defect report has been filed about this issue.
19324 A conversion-function-id cannot be a template name because they cannot
19325 be part of a template-id. In fact, looking at this code:
19327 a.operator K<int>()
19329 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
19330 It is impossible to call a templated conversion-function-id with an
19331 explicit argument list, since the only allowed template parameter is
19332 the type to which it is converting.
19334 If TEMPLATE_KEYWORD_P is true, then we have just seen the
19335 `template' keyword, in a construction like:
19337 T::template f<3>()
19339 In that case `f' is taken to be a template-name, even though there
19340 is no way of knowing for sure.
19342 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
19343 name refers to a set of overloaded functions, at least one of which
19344 is a template, or an IDENTIFIER_NODE with the name of the template,
19345 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
19346 names are looked up inside uninstantiated templates. */
19348 static tree
19355 {
19356 tree identifier;
19357 tree decl;
19360 /* If the next token is `operator', then we have either an
19361 operator-function-id or a conversion-function-id. */
19363 {
19364 /* We don't know whether we're looking at an
19365 operator-function-id or a conversion-function-id. */
19367 /* Try an operator-function-id. */
19369 /* If that didn't work, try a conversion-function-id. */
19371 {
19374 }
19375 }
19376 /* Look for the identifier. */
19377 else
19380 /* If we didn't find an identifier, we don't have a template-id. */
19384 /* If the name immediately followed the `template' keyword, then it
19385 is a template-name. However, if the next token is not `<', then
19386 we do not treat it as a template-name, since it is not being used
19387 as part of a template-id. This enables us to handle constructs
19388 like:
19390 template <typename T> struct S { S(); };
19391 template <typename T> S<T>::S();
19393 correctly. We would treat `S' as a template -- if it were `S<T>'
19394 -- but we do not if there is no `<'. */
19398 {
19399 /* In a declaration, in a dependent context, we pretend that the
19400 "template" keyword was present in order to improve error
19401 recovery. For example, given:
19403 template <typename T> void f(T::X<int>);
19405 we want to treat "X<int>" as a template-id. */
19407 && !template_keyword_p
19409 && check_dependency_p
19411 /* Do not do this for dtors (or ctors), since they never
19412 need the template keyword before their name. */
19414 {
19417 /* Explain what went wrong. */
19419 identifier);
19422 /* If parsing tentatively, find the location of the "<" token. */
19425 /* Parse the template arguments so that we can issue error
19426 messages about them. */
19429 /* Skip tokens until we find a good place from which to
19430 continue parsing. */
19435 /* If parsing tentatively, permanently remove the
19436 template argument list. That will prevent duplicate
19437 error messages from being issued about the missing
19438 "template" keyword. */
19445 }
19447 /* If the "template" keyword is present, then there is generally
19448 no point in doing name-lookup, so we just return IDENTIFIER.
19449 But, if the qualifying scope is non-dependent then we can
19450 (and must) do name-lookup normally. */
19452 {
19458 {
19459 /* We're optimizing away the call to cp_parser_lookup_name, but
19460 we still need to do this. */
19464 }
19465 }
19466 }
19468 /* cp_parser_lookup_name clears OBJECT_TYPE. */
19472 /* Look up the name. */
19474 tag_type,
19477 check_dependency_p,
19483 /* 13.3 [temp.names] A < is interpreted as the delimiter of a
19484 template-argument-list if it follows a name that is not a
19485 conversion-function-id and
19486 - that follows the keyword template or a ~ after a nested-name-specifier or
19487 in a class member access expression, or
19488 - for which name lookup finds the injected-class-name of a class template
19489 or finds any declaration of a template, or
19490 - that is an unqualified name for which name lookup either finds one or
19491 more functions or finds nothing, or
19492 - that is a terminal name in a using-declarator (9.9), in a declarator-id
19493 (9.3.4), or in a type-only context other than a nested-name-specifier
19494 (13.8). */
19496 /* Handle injected-class-name. */
19499 /* If DECL is a template, then the name was a template-name. */
19501 {
19504 {
19506 tree attr;
19509 else
19512 {
19515 }
19518 {
19521 }
19522 }
19523 }
19524 else
19525 {
19526 /* Look through an overload set for any templates. */
19534 /* "an unqualified name for which name lookup either finds one or more
19535 functions or finds nothing". */
19538 && !scope
19541 {
19542 /* The "more functions" case. Just use the OVERLOAD as normally.
19543 We don't use is_overloaded_fn here to avoid considering
19544 BASELINKs. */
19546 /* Name lookup found one function. */
19548 /* Name lookup found nothing. */
19551 }
19553 /* "that follows the keyword template"..."in a type-only context" */
19561 {
19562 /* The name does not name a template. */
19565 }
19568 /* cp_parser_template_id can only handle some TYPE_DECLs. */
19571 /* Repeat the lookup at instantiation time. */
19573 }
19576 }
19578 /* Parse a template-argument-list.
19580 template-argument-list:
19581 template-argument ... [opt]
19582 template-argument-list , template-argument ... [opt]
19584 Returns a TREE_VEC containing the arguments. */
19586 static tree
19588 {
19593 /* Don't create location wrapper nodes within a template-argument-list. */
19594 auto_suppress_location_wrappers sentinel;
19598 /* Even if the template-id appears in an integral
19599 constant-expression, the contents of the argument list do
19600 not. */
19606 /* Parse the arguments. */
19608 do
19609 {
19611 /* Consume the comma. */
19614 /* Parse the template-argument. */
19617 /* If the next token is an ellipsis, we're expanding a template
19618 argument pack. */
19620 {
19622 {
19626 }
19627 /* Consume the `...' token. */
19630 /* Make the argument into a TYPE_PACK_EXPANSION or
19631 EXPR_PACK_EXPANSION. */
19633 }
19636 }
19651 }
19653 /* Parse a template-argument.
19655 template-argument:
19656 assignment-expression
19657 type-id
19658 id-expression
19660 The representation is that of an assignment-expression, type-id, or
19661 id-expression -- except that the qualified id-expression is
19662 evaluated, so that the value returned is either a DECL or an
19663 OVERLOAD.
19665 Although the standard says "assignment-expression", it forbids
19666 throw-expressions or assignments in the template argument.
19667 Therefore, we use "conditional-expression" instead. */
19669 static tree
19671 {
19672 tree argument;
19678 cp_id_kind idk;
19680 /* There's really no way to know what we're looking at, so we just
19681 try each alternative in order.
19683 [temp.arg]
19685 In a template-argument, an ambiguity between a type-id and an
19686 expression is resolved to a type-id, regardless of the form of
19687 the corresponding template-parameter.
19689 Therefore, we try a type-id first. */
19692 /* If there was no error parsing the type-id but the next token is a
19693 '>>', our behavior depends on which dialect of C++ we're
19694 parsing. In C++98, we probably found a typo for '> >'. But there
19695 are type-id which are also valid expressions. For instance:
19697 struct X { int operator >> (int); };
19698 template <int V> struct Foo {};
19699 Foo<X () >> 5> r;
19701 Here 'X()' is a valid type-id of a function type, but the user just
19702 wanted to write the expression "X() >> 5". Thus, we remember that we
19703 found a valid type-id, but we still try to parse the argument as an
19704 expression to see what happens.
19706 In C++0x, the '>>' will be considered two separate '>'
19707 tokens. */
19711 /* Similarly for >= which
19712 cp_parser_next_token_ends_template_argument_p treats for
19713 diagnostics purposes as mistyped > =, but can be valid
19714 after a type-id. */
19716 {
19719 }
19720 else
19721 {
19722 /* If the next token isn't a `,' or a `>', then this argument wasn't
19723 really finished. This means that the argument is not a valid
19724 type-id. */
19727 /* If that worked, we're done. */
19730 }
19731 /* We're still not sure what the argument will be. */
19733 /* Try a template. */
19741 /* If the next token isn't a `,' or a `>', then this argument wasn't
19742 really finished. */
19746 {
19747 /* Figure out what is being referred to. If the id-expression
19748 was for a class template specialization, then we will have a
19749 TYPE_DECL at this point. There is no need to do name lookup
19750 at this point in that case. */
19753 none_type,
19762 }
19764 {
19770 }
19771 /* It must be a non-type argument. In C++17 any constant-expression is
19772 allowed. */
19776 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
19778 -- an integral constant-expression of integral or enumeration
19779 type; or
19781 -- the name of a non-type template-parameter; or
19783 -- the name of an object or function with external linkage...
19785 -- the address of an object or function with external linkage...
19787 -- a pointer to member... */
19788 /* Look for a non-type template parameter. */
19790 {
19802 }
19804 /* If the next token is "&", the argument must be the address of an
19805 object or function with external linkage. */
19808 {
19811 }
19812 /* See if we might have an id-expression. */
19819 {
19822 address_p,
19829 else
19830 {
19831 tree probe;
19834 {
19835 /* Strip the dereference temporarily. */
19838 }
19840 /* If we're in a template, we represent a qualified-id referring
19841 to a static data member as a SCOPE_REF even if the scope isn't
19842 dependent so that we can check access control later. */
19847 {
19848 /* A variable without external linkage might still be a
19849 valid constant-expression, so no error is issued here
19850 if the external-linkage check fails. */
19853 }
19855 /* All overloaded functions are allowed; if the external
19856 linkage test does not pass, an error will be issued
19857 later. */
19858 ;
19862 /* A pointer-to-member. */
19863 ;
19865 ;
19866 else
19870 {
19874 else
19877 }
19878 }
19879 }
19880 /* If the argument started with "&", there are no other valid
19881 alternatives at this point. */
19883 {
19886 }
19888 general_expr:
19889 /* If the argument wasn't successfully parsed as a type-id followed
19890 by '>>', the argument can only be a constant expression now.
19891 Otherwise, we try parsing the constant-expression tentatively,
19892 because the argument could really be a type-id. */
19898 else
19899 {
19900 /* In C++20, we can encounter a braced-init-list. */
19905 /* With C++17 generalized non-type template arguments we need to handle
19906 lvalue constant expressions, too. */
19909 }
19917 /* We did our best to parse the argument as a non type-id, but that
19918 was the only alternative that matched (albeit with a '>' after
19919 it). We can assume it's just a typo from the user, and a
19920 diagnostic will then be issued. */
19922 }
19924 /* Parse an explicit-instantiation.
19926 explicit-instantiation:
19927 template declaration
19929 Although the standard says `declaration', what it really means is:
19931 explicit-instantiation:
19932 template decl-specifier-seq [opt] declarator [opt] ;
19934 Things like `template int S<int>::i = 5, int S<double>::j;' are not
19935 supposed to be allowed. A defect report has been filed about this
19936 issue.
19938 GNU Extension:
19940 explicit-instantiation:
19941 storage-class-specifier template
19942 decl-specifier-seq [opt] declarator [opt] ;
19943 function-specifier template
19944 decl-specifier-seq [opt] declarator [opt] ; */
19946 static void
19948 {
19950 cp_decl_specifier_seq decl_specifiers;
19955 /* Look for an (optional) storage-class-specifier or
19956 function-specifier. */
19958 {
19959 extension_specifier
19962 extension_specifier
19965 }
19967 /* Look for the `template' keyword. */
19969 /* Let the front end know that we are processing an explicit
19970 instantiation. */
19972 /* [temp.explicit] says that we are supposed to ignore access
19973 control while processing explicit instantiation directives. */
19975 /* Parse a decl-specifier-seq. */
19977 CP_PARSER_FLAGS_OPTIONAL,
19981 cp_omp_declare_simd_data odsd;
19987 /* If there was exactly one decl-specifier, and it declared a class,
19988 and there's no declarator, then we have an explicit type
19989 instantiation. */
19991 {
19994 /* Turn access control back on for names used during
19995 template instantiation. */
20000 }
20001 else
20002 {
20004 tree decl;
20006 /* Parse the declarator. */
20007 declarator
20009 CP_PARSER_FLAGS_NONE,
20020 {
20023 "explicit instantiation shall not use"
20027 "explicit instantiation shall not use"
20031 "explicit instantiation shall not use"
20036 /* Turn access control back on for names used during
20037 template instantiation. */
20039 /* Do the explicit instantiation. */
20041 }
20042 else
20043 {
20045 /* Skip the body of the explicit instantiation. */
20047 }
20048 }
20049 /* We're done with the instantiation. */
20055 }
20057 /* Parse an explicit-specialization.
20059 explicit-specialization:
20060 template < > declaration
20062 Although the standard says `declaration', what it really means is:
20064 explicit-specialization:
20065 template <> decl-specifier [opt] init-declarator [opt] ;
20066 template <> function-definition
20067 template <> explicit-specialization
20068 template <> template-declaration */
20070 static void
20072 {
20075 /* Look for the `template' keyword. */
20077 /* Look for the `<'. */
20079 /* Look for the `>'. */
20081 /* We have processed another parameter list. */
20084 /* [temp]
20086 A template ... explicit specialization ... shall not have C
20087 linkage. */
20090 {
20094 /* Give it C++ linkage to avoid confusing other parts of the
20095 front end. */
20097 }
20099 /* Let the front end know that we are beginning a specialization. */
20101 {
20102 /* If the next keyword is `template', we need to figure out
20103 whether or not we're looking a template-declaration. */
20105 {
20110 else
20112 }
20113 else
20114 /* Parse the dependent declaration. */
20120 }
20122 /* We're done with the specialization. */
20125 /* For the erroneous case of a template with C linkage, we pushed an
20126 implicit C++ linkage scope; exit that scope now. */
20130 /* We're done with this parameter list. */
20132 }
20134 /* Preserve the attributes across a garbage collect (by making it a GC
20135 root), which can occur when parsing a member function. */
20139 /* Parse a type-specifier.
20141 type-specifier:
20142 simple-type-specifier
20143 class-specifier
20144 enum-specifier
20145 elaborated-type-specifier
20146 cv-qualifier
20148 GNU Extension:
20150 type-specifier:
20151 __complex__
20153 Returns a representation of the type-specifier. For a
20154 class-specifier, enum-specifier, or elaborated-type-specifier, a
20155 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
20157 The parser flags FLAGS is used to control type-specifier parsing.
20159 If IS_DECLARATION is TRUE, then this type-specifier is appearing
20160 in a decl-specifier-seq.
20162 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
20163 class-specifier, enum-specifier, or elaborated-type-specifier, then
20164 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
20165 if a type is declared; 2 if it is defined. Otherwise, it is set to
20166 zero.
20168 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
20169 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
20170 is set to FALSE. */
20172 static tree
20174 cp_parser_flags flags,
20179 {
20185 /* Assume this type-specifier does not declare a new type. */
20188 /* And that it does not specify a cv-qualifier. */
20191 /* Peek at the next token. */
20194 /* If we're looking at a keyword, we can use that to guide the
20195 production we choose. */
20198 {
20203 /* Look for the enum-specifier. */
20205 /* If that worked, we're done. */
20207 {
20212 type_spec,
20213 token,
20216 }
20217 else
20220 /* Any of these indicate either a class-specifier, or an
20221 elaborated-type-specifier. */
20228 /* Parse tentatively so that we can back up if we don't find a
20229 class-specifier. */
20233 /* Look for the class-specifier. */
20238 /* If that worked, we're done. */
20240 {
20245 type_spec,
20246 token,
20249 }
20251 /* Fall through. */
20252 elaborated_type_specifier:
20253 /* We're declaring (not defining) a class or enum. */
20257 /* Fall through. */
20259 /* Look for an elaborated-type-specifier. */
20260 type_spec
20261 = (cp_parser_elaborated_type_specifier
20264 is_declaration));
20267 type_spec,
20268 token,
20291 /* The `__complex__' keyword is a GNU extension. */
20297 }
20299 /* Handle simple keywords. */
20301 {
20303 {
20306 }
20308 }
20310 /* If we do not already have a type-specifier, assume we are looking
20311 at a simple-type-specifier. */
20313 decl_specs,
20314 flags);
20316 /* If we didn't find a type-specifier, and a type-specifier was not
20317 optional in this context, issue an error message. */
20319 {
20322 }
20325 }
20327 /* Parse a simple-type-specifier.
20329 simple-type-specifier:
20330 :: [opt] nested-name-specifier [opt] type-name
20331 :: [opt] nested-name-specifier template template-id
20332 char
20333 wchar_t
20334 bool
20335 short
20336 int
20337 long
20338 signed
20339 unsigned
20340 float
20341 double
20342 void
20344 C++11 Extension:
20346 simple-type-specifier:
20347 auto
20348 decltype ( expression )
20349 char16_t
20350 char32_t
20351 __underlying_type ( type-id )
20353 C++17 extension:
20355 nested-name-specifier(opt) template-name
20357 GNU Extension:
20359 simple-type-specifier:
20360 __int128
20361 __typeof__ unary-expression
20362 __typeof__ ( type-id )
20363 __typeof__ ( type-id ) { initializer-list , [opt] }
20365 Concepts Extension:
20367 simple-type-specifier:
20368 constrained-type-specifier
20370 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
20371 appropriately updated. */
20373 static tree
20376 cp_parser_flags flags)
20377 {
20382 /* Peek at the next token. */
20385 /* If we're looking at a keyword, things are easy. */
20387 {
20425 {
20428 /* Check if the alternate "__intN__" form has been used instead of
20429 "__intN". */
20433 }
20455 CASE_RID_FLOATN_NX:
20470 {
20471 /* The 'auto' might be the placeholder return type for a function decl
20472 with trailing return type. */
20481 {
20483 {
20490 }
20493 {
20496 }
20499 }
20503 {
20506 }
20509 {
20512 }
20513 else
20517 {
20520 "use of %<auto%> in lambda parameter declaration "
20521 "only available with "
20523 }
20526 "use of %<auto%> in template argument "
20530 "use of %<auto%> in parameter declaration "
20534 "use of %<auto%> in parameter declaration "
20535 "only available with "
20537 }
20538 else
20543 /* Since DR 743, decltype can either be a simple-type-specifier by
20544 itself or begin a nested-name-specifier. Parsing it will replace
20545 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
20546 handling below decide what to do. */
20552 /* Consume the `typeof' token. */
20554 /* Parse the operand to `typeof'. */
20556 /* If it is not already a TYPE, take its type. */
20562 token,
20568 /* If token is a type-yielding built-in traits, parse it. */
20571 {
20575 token,
20579 }
20582 }
20584 /* If token is an already-parsed decltype not followed by ::,
20585 it's a simple-type-specifier. */
20588 {
20591 {
20593 token,
20595 /* Remember that we are handling a decltype in order to
20596 implement the resolution of DR 1510 when the argument
20597 isn't instantiation dependent. */
20599 }
20602 }
20604 /* If the type-specifier was for a built-in type, we're done. */
20606 {
20607 /* Record the type. */
20614 type,
20615 token,
20620 /* Consume the token. */
20626 /* There is no valid C++ program where a non-template type is
20627 followed by a "<". That usually indicates that the user thought
20628 that the type was a template. */
20633 }
20635 /* The type-specifier must be a user-defined type. */
20637 {
20643 /* Don't gobble tokens or issue error messages if this is an
20644 optional type-specifier. */
20648 /* Remember current tentative parsing state -- if we know we need
20649 a type, we can give better diagnostics here. */
20654 /* Look for the optional `::' operator. */
20655 global_p
20659 /* Look for the nested-name specifier. */
20660 qualified_p
20667 /* If we have seen a nested-name-specifier, and the next token
20668 is `template', then we are using the template-id production. */
20671 {
20672 /* Look for the template-id. */
20676 none_type,
20678 /* If the template-id did not name a type, we are out of
20679 luck. */
20681 {
20682 /* ...unless we pretend we have seen 'typename'. */
20686 else
20687 {
20690 }
20691 }
20692 }
20693 /* DR 1812: A < following a qualified-id in a typename-specifier
20694 could safely be assumed to begin a template argument list, so
20695 the template keyword should be optional. */
20697 && qualified_p
20698 && typename_p
20700 {
20706 none_type,
20708 /* This is handled below, so back off. */
20719 }
20721 /* Otherwise, look for a type-name. */
20723 {
20732 }
20735 {
20736 /* Try for a type-constraint with template arguments. We check
20737 decl_specs here to avoid trying this for a functional cast. */
20744 none_type,
20747 {
20752 /* Perhaps it's a concept-check expression. */
20754 }
20755 else
20760 }
20763 {
20764 /* Try class template argument deduction or type-constraint without
20765 template arguments. */
20769 {
20770 location_t loc
20773 none_type,
20785 else
20786 {
20791 }
20792 }
20793 else
20795 }
20797 /* If it didn't work out, we don't have a TYPE. */
20802 /* Keep track of all name-lookups performed in class scopes. */
20804 && !global_p
20805 && !qualified_p
20812 token,
20814 }
20816 /* If we didn't get a type-name, issue an error message. */
20818 {
20821 }
20824 {
20825 /* See if TYPE is an Objective-C type, and if so, parse and
20826 accept any protocol references following it. Do this before
20827 the cp_parser_check_for_invalid_template_id() call, because
20828 Objective-C types can be followed by '<...>' which would
20829 enclose protocol names rather than template arguments, and so
20830 everything is fine. */
20833 {
20837 /* Clobber the "unqualified" type previously entered into
20838 DECL_SPECS with the new, improved protocol-qualified version. */
20843 }
20845 /* There is no valid C++ program where a non-template type is
20846 followed by a "<". That usually indicates that the user
20847 thought that the type was a template. */
20849 none_type,
20851 }
20854 }
20856 /* Parse the remainder of a placholder-type-specifier.
20858 placeholder-type-specifier:
20859 type-constraint_opt auto
20860 type-constraint_opt decltype(auto)
20862 The raw form of the constraint is parsed in cp_parser_simple_type_specifier
20863 and passed as TMPL. This function converts TMPL to an actual type-constraint,
20864 parses the placeholder type, and performs some contextual syntactic analysis.
20866 LOC provides the location of the template name.
20868 TENTATIVE is true if the type-specifier parsing is tentative; in that case,
20869 don't give an error if TMPL isn't a valid type-constraint, as the template-id
20870 might actually be a concept-check,
20872 Note that the Concepts TS allows the auto or decltype(auto) to be
20873 omitted in a constrained-type-specifier. */
20875 static tree
20878 {
20884 /* Get the arguments as written for subsequent analysis. */
20887 {
20890 }
20891 else
20892 /* A concept-name with no arguments can't be an expression. */
20897 /* Get the concept and prototype parameter for the constraint. */
20904 /* As per the standard, require auto or decltype(auto), except in some
20905 cases (template parameter lists, -fconcepts-ts enabled). */
20908 {
20912 {
20914 matching_parens parens;
20918 }
20919 }
20921 /* A type constraint constrains a contextually determined type or type
20922 parameter pack. However, the Concepts TS does allow concepts
20923 to introduce non-type and template template parameters. */
20925 {
20928 {
20930 {
20933 }
20935 }
20936 }
20938 /* In a template parameter list, a type-parameter can be introduced
20939 by type-constraints alone. */
20941 {
20942 /* In a default argument we may not be creating new parameters. */
20944 {
20945 /* If this assert turns out to be false, do error() instead. */
20948 }
20950 }
20952 /* Diagnose issues placeholder issues. */
20956 {
20958 /* Perhaps it's a concept-check expression (c++/91073). */
20965 /* Fall through. This is an error of omission. */
20966 }
20968 {
20969 /* A trailing return type only allows type-constraints. */
20972 }
20974 /* In a parameter-declaration-clause, a placeholder-type-specifier
20975 results in an invented template parameter. */
20977 {
20979 {
20985 }
20988 }
20990 /* Determine if the type should be deduced using template argument
20991 deduction or decltype deduction. Note that the latter is always
20992 used for type-constraints in trailing return types. */
20997 /* Otherwise, this is the type of a variable or return type. */
21000 else
21002 }
21004 /* Parse a type-name.
21006 type-name:
21007 class-name
21008 enum-name
21009 typedef-name
21010 simple-template-id [in c++0x]
21012 enum-name:
21013 identifier
21015 typedef-name:
21016 identifier
21018 Concepts:
21020 type-name:
21021 concept-name
21022 partial-concept-id
21024 concept-name:
21025 identifier
21027 Returns a TYPE_DECL for the type. */
21029 static tree
21031 {
21032 tree type_decl;
21034 /* We can't know yet whether it is a class-name or not. */
21036 /* Try a class-name. */
21038 typename_keyword_p,
21040 none_type,
21044 /* If it's not a class-name, keep looking. */
21046 {
21048 /* It must be a typedef-name or an enum-name. */
21052 /* It is either a simple-template-id representing an
21053 instantiation of an alias template... */
21057 none_type,
21059 /* Note that this must be an instantiation of an alias template
21060 because [temp.names]/6 says:
21062 A template-id that names an alias template specialization
21063 is a type-name.
21065 Whereas [temp.names]/7 says:
21067 A simple-template-id that names a class template
21068 specialization is a class-name.
21070 With concepts, this could also be a partial-concept-id that
21071 declares a non-type template parameter. */
21076 else
21080 /* ... Or a typedef-name or an enum-name. */
21082 }
21085 }
21087 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
21088 or a concept-name.
21090 enum-name:
21091 identifier
21093 typedef-name:
21094 identifier
21096 concept-name:
21097 identifier
21099 Returns a TYPE_DECL for the type. */
21101 static tree
21103 {
21104 tree type_decl;
21105 tree identifier;
21112 /* Look up the type-name. */
21119 {
21120 /* See if this is an Objective-C type. */
21125 }
21127 /* Issue an error if we did not find a type-name. */
21129 /* In Objective-C, we have the complication that class names are
21130 normally type names and start declarations (eg, the
21131 "NSObject" in "NSObject *object;"), but can be used in an
21132 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
21133 is an expression. So, a classname followed by a dot is not a
21134 valid type-name. */
21137 {
21142 }
21143 /* Remember that the name was used in the definition of the
21144 current class so that we can check later to see if the
21145 meaning would have been different after the class was
21146 entirely defined. */
21152 }
21154 /* Parse an elaborated-type-specifier. Note that the grammar given
21155 here incorporates the resolution to DR68.
21157 elaborated-type-specifier:
21158 class-key :: [opt] nested-name-specifier [opt] identifier
21159 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
21160 enum-key :: [opt] nested-name-specifier [opt] identifier
21161 typename :: [opt] nested-name-specifier identifier
21162 typename :: [opt] nested-name-specifier template [opt]
21163 template-id
21165 GNU extension:
21167 elaborated-type-specifier:
21168 class-key attributes :: [opt] nested-name-specifier [opt] identifier
21169 class-key attributes :: [opt] nested-name-specifier [opt]
21170 template [opt] template-id
21171 enum attributes :: [opt] nested-name-specifier [opt] identifier
21173 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
21174 declared `friend'. If IS_DECLARATION is TRUE, then this
21175 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
21176 something is being declared.
21178 Returns the TYPE specified. */
21180 static tree
21184 {
21186 tree identifier;
21189 tree globalscope;
21192 /* For class and enum types the location of the class-key or enum-key. */
21194 /* For a scoped enum, the 'class' or 'struct' keyword id. */
21197 /* See if we're looking at the `enum' keyword. */
21199 {
21200 /* Consume the `enum' token. */
21202 /* Remember that it's an enumeration type. */
21204 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
21205 enums) is used here. */
21209 {
21217 /* Consume the `struct' or `class' and parse it anyway. */
21219 /* Create a combined location for the whole scoped-enum-key. */
21221 }
21222 else
21225 /* Parse the attributes. */
21227 }
21228 /* Or, it might be `typename'. */
21230 RID_TYPENAME))
21231 {
21232 /* Consume the `typename' token. */
21234 /* Remember that it's a `typename' type. */
21236 }
21237 /* Otherwise it must be a class-key. */
21238 else
21239 {
21244 /* Parse the attributes. */
21246 }
21248 /* Look for the `::' operator. */
21251 /* Look for the nested-name-specifier. */
21252 tree nested_name_specifier;
21254 {
21255 nested_name_specifier
21260 is_declaration);
21263 }
21264 else
21265 /* Even though `typename' is not present, the proposed resolution
21266 to Core Issue 180 says that in `class A<T>::B', `B' should be
21267 considered a type-name, even if `A<T>' is dependent. */
21268 nested_name_specifier
21273 is_declaration);
21274 /* For everything but enumeration types, consider a template-id.
21275 For an enumeration type, consider only a plain identifier. */
21277 {
21279 tree decl;
21281 /* Allow the `template' keyword. */
21283 /* If we didn't see `template', we don't know if there's a
21284 template-id or not. */
21287 /* The `template' keyword must follow a nested-name-specifier. */
21289 {
21293 }
21295 /* Parse the template-id. */
21299 tag_type,
21300 is_declaration);
21301 /* If we didn't find a template-id, look for an ordinary
21302 identifier. */
21304 ;
21305 /* We can get here when cp_parser_template_id, called by
21306 cp_parser_class_name with tag_type == none_type, succeeds
21307 and caches a BASELINK. Then, when called again here,
21308 instead of failing and returning an error_mark_node
21309 returns it (see template/typename17.C in C++11).
21310 ??? Could we diagnose this earlier? */
21312 {
21315 }
21316 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
21317 in effect, then we must assume that, upon instantiation, the
21318 template will correspond to a class. */
21322 typename_type,
21324 /* If the `typename' keyword is in effect and DECL is not a type
21325 decl, then type is non existent. */
21327 ;
21329 {
21333 /* If the next token is a semicolon, this must be a specialization,
21334 instantiation, or friend declaration. Check the scope while we
21335 still know whether or not we had a nested-name-specifier. */
21340 }
21343 }
21346 {
21351 {
21354 }
21356 /* For a `typename', we needn't call xref_tag. */
21362 /* Template parameter lists apply only if we are not within a
21363 function parameter list. */
21364 bool template_parm_lists_apply
21373 /* Look up a qualified name in the usual way. */
21375 {
21376 tree decl;
21377 tree ambiguous_decls;
21380 tag_type,
21387 /* If the lookup was ambiguous, an error will already have been
21388 issued. */
21392 /* If we are parsing friend declaration, DECL may be a
21393 TEMPLATE_DECL tree node here. However, we need to check
21394 whether this TEMPLATE_DECL results in valid code. Consider
21395 the following example:
21397 namespace N {
21398 template <class T> class C {};
21399 }
21400 class X {
21401 template <class T> friend class N::C; // #1, valid code
21402 };
21403 template <class T> class Y {
21404 friend class N::C; // #2, invalid code
21405 };
21407 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
21408 name lookup of `N::C'. We see that friend declaration must
21409 be template for the code to be valid. Note that
21410 processing_template_decl does not work here since it is
21411 always 1 for the above two cases. */
21413 decl = (cp_parser_maybe_treat_template_as_class
21418 {
21420 identifier,
21423 }
21426 {
21430 allow_template);
21434 }
21436 /* Forward declarations of nested types, such as
21438 class C1::C2;
21439 class C1::C2::C3;
21441 are invalid unless all components preceding the final '::'
21442 are complete. If all enclosing types are complete, these
21443 declarations become merely pointless.
21445 Invalid forward declarations of nested types are errors
21446 caught elsewhere in parsing. Those that are pointless arrive
21447 here. */
21455 }
21456 else
21457 {
21458 /* An elaborated-type-specifier sometimes introduces a new type and
21459 sometimes names an existing type. Normally, the rule is that it
21460 introduces a new type only if there is not an existing type of
21461 the same name already in scope. For example, given:
21463 struct S {};
21464 void f() { struct S s; }
21466 the `struct S' in the body of `f' is the same `struct S' as in
21467 the global scope; the existing definition is used. However, if
21468 there were no global declaration, this would introduce a new
21469 local class named `S'.
21471 An exception to this rule applies to the following code:
21473 namespace N { struct S; }
21475 Here, the elaborated-type-specifier names a new type
21476 unconditionally; even if there is already an `S' in the
21477 containing scope this declaration names a new type.
21478 This exception only applies if the elaborated-type-specifier
21479 forms the complete declaration:
21481 [class.name]
21483 A declaration consisting solely of `class-key identifier ;' is
21484 either a redeclaration of the name in the current scope or a
21485 forward declaration of the identifier as a class name. It
21486 introduces the name into the current scope.
21488 We are in this situation precisely when the next token is a `;'.
21490 An exception to the exception is that a `friend' declaration does
21491 *not* name a new type; i.e., given:
21493 struct S { friend struct T; };
21495 `T' is not a new type in the scope of `S'.
21497 Also, `new struct S' or `sizeof (struct S)' never results in the
21498 definition of a new type; a new type can only be declared in a
21499 declaration context. */
21501 TAG_how how;
21504 /* Friends have special name lookup rules. */
21508 CPP_SEMICOLON))
21509 /* This is a `class-key identifier ;' */
21511 else
21515 (template_parm_lists_apply
21518 /* An unqualified name was used to reference this type, so
21519 there were no qualifying templates. */
21529 }
21530 }
21535 /* Allow attributes on forward declarations of classes. */
21537 {
21548 {
21552 }
21555 else
21557 "attributes ignored on elaborated-type-specifier that is "
21559 }
21563 else
21564 {
21565 /* Diagnose class/struct/union mismatches. IS_DECLARATION is false
21566 for alias definition. */
21570 decl_class);
21572 /* Indicate whether this class was declared as a `class' or as a
21573 `struct'. */
21576 }
21578 /* A "<" cannot follow an elaborated type specifier. If that
21579 happens, the user was probably trying to form a template-id. */
21584 }
21586 /* Parse an enum-specifier.
21588 enum-specifier:
21589 enum-head { enumerator-list [opt] }
21590 enum-head { enumerator-list , } [C++0x]
21592 enum-head:
21593 enum-key identifier [opt] enum-base [opt]
21594 enum-key nested-name-specifier identifier enum-base [opt]
21596 enum-key:
21597 enum
21598 enum class [C++0x]
21599 enum struct [C++0x]
21601 enum-base: [C++0x]
21602 : type-specifier-seq
21604 opaque-enum-specifier:
21605 enum-key identifier enum-base [opt] ;
21607 GNU Extensions:
21608 enum-key attributes[opt] identifier [opt] enum-base [opt]
21609 { enumerator-list [opt] }attributes[opt]
21610 enum-key attributes[opt] identifier [opt] enum-base [opt]
21611 { enumerator-list, }attributes[opt] [C++0x]
21613 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
21614 if the token stream isn't an enum-specifier after all. */
21616 static tree
21618 {
21619 tree identifier;
21621 tree prev_scope;
21623 tree attributes;
21634 /* Parse tentatively so that we can back up if we don't find a
21635 enum-specifier. */
21638 /* Caller guarantees that the current token is 'enum', an identifier
21639 possibly follows, and the token after that is an opening brace.
21640 If we don't have an identifier, fabricate an anonymous name for
21641 the enumeration being defined. */
21644 /* Parse the "class" or "struct", which indicates a scoped
21645 enumeration type in C++0x. */
21648 {
21652 /* Consume the `struct' or `class' token. */
21656 }
21660 /* Clear the qualification. */
21665 /* Figure out in what scope the declaration is being placed. */
21671 nested_name_specifier
21679 {
21680 tree name;
21684 enum_type,
21689 input_location);
21691 {
21694 {
21695 /* Are template enums allowed in ISO? */
21699 /* ignore a typename reference, for it will be solved by name
21700 in start_enum. */
21702 }
21703 }
21706 else
21707 {
21712 }
21713 }
21714 else
21715 {
21718 else
21719 {
21725 }
21726 }
21729 /* Check for the `:' that denotes a specified underlying type in C++0x.
21730 Note that a ':' could also indicate a bitfield width, however. */
21733 {
21734 cp_decl_specifier_seq type_specifiers;
21736 /* Consume the `:'. */
21740 auto tdf
21744 /* Parse the type-specifier-seq. */
21750 /* At this point this is surely not elaborated type specifier. */
21759 /* If that didn't work, stop. */
21761 {
21767 }
21768 }
21770 /* Look for the `{' but don't consume it yet. */
21772 {
21774 {
21780 }
21781 /* An opaque-enum-specifier must have a ';' here. */
21784 {
21787 OPT_Welaborated_enum_base,
21788 "declaration of enumeration with "
21789 "fixed underlying type and no enumerator list is "
21791 else
21793 }
21794 }
21800 {
21802 {
21806 }
21809 }
21811 /* Issue an error message if type-definitions are forbidden here. */
21814 else
21815 /* Create the new type. We do this before consuming the opening
21816 brace so the enum will be recorded as being on the line of its
21817 tag (or the 'enum' keyword, if there is no tag). */
21821 /* If the next token is not '{' it is an opaque-enum-specifier or an
21822 elaborated-type-specifier. */
21824 {
21829 {
21830 /* The following catches invalid code such as:
21831 enum class S<int>::E { A, B, C }; */
21839 {
21843 nested_name_specifier);
21845 }
21848 {
21850 "%qT for enum declaration does not name a class "
21853 }
21854 /* If that scope does not contain the scope in which the
21855 class was originally declared, the program is invalid. */
21857 nested_name_specifier))
21858 {
21861 "declaration of %qD in namespace %qD which does not "
21864 else
21866 "declaration of %qD in %qD which does not "
21870 }
21871 /* If that scope is the scope where the declaration is being placed
21872 the program is invalid. */
21876 {
21880 }
21881 }
21886 /* Consume the opening brace. */
21887 matching_braces braces;
21894 {
21898 }
21899 else
21900 {
21906 }
21910 /* If the next token is not '}', then there are some enumerators. */
21912 {
21914 /* Don't warn for enum {} a; here. */
21918 }
21919 else
21920 {
21921 /* We've seen a '{' so we know we're in an enum-specifier.
21922 Commit to any tentative parse to get syntax errors. */
21925 }
21927 /* Consume the final '}'. */
21932 }
21933 else
21934 {
21935 /* If a ';' follows, then it is an opaque-enum-specifier
21936 and additional restrictions apply. */
21938 {
21945 }
21946 }
21948 /* Look for trailing attributes to apply to this enumeration, and
21949 apply them if appropriate. */
21951 {
21954 trailing_attr,
21956 }
21958 /* Finish up the enumeration. */
21960 {
21965 }
21968 {
21970 {
21973 }
21976 }
21978 }
21980 /* Parse an enumerator-list. The enumerators all have the indicated
21981 TYPE.
21983 enumerator-list:
21984 enumerator-definition
21985 enumerator-list , enumerator-definition */
21987 static void
21989 {
21991 {
21992 /* Parse an enumerator-definition. */
21995 /* If the next token is not a ',', we've reached the end of
21996 the list. */
21999 /* Otherwise, consume the `,' and keep going. */
22001 /* If the next token is a `}', there is a trailing comma. */
22003 {
22008 }
22009 }
22010 }
22012 /* Parse an enumerator-definition. The enumerator has the indicated
22013 TYPE.
22015 enumerator-definition:
22016 enumerator
22017 enumerator = constant-expression
22019 enumerator:
22020 identifier
22022 GNU Extensions:
22024 enumerator-definition:
22025 enumerator attributes [opt]
22026 enumerator attributes [opt] = constant-expression */
22028 static void
22030 {
22031 tree identifier;
22032 tree value;
22033 location_t loc;
22035 /* Save the input location because we are interested in the location
22036 of the identifier and not the location of the explicit value. */
22039 /* Look for the identifier. */
22044 /* Parse any specified attributes. */
22047 /* If the next token is an '=', then there is an explicit value. */
22049 {
22050 /* Consume the `=' token. */
22052 /* Parse the value. */
22054 }
22055 else
22058 /* If we are processing a template, make sure the initializer of the
22059 enumerator doesn't contain any bare template parameter pack. */
22061 {
22062 /* In a lambda it should work, but doesn't currently. */
22064 {
22067 }
22068 }
22072 /* Create the enumerator. */
22074 }
22076 /* Parse a namespace-name.
22078 namespace-name:
22079 original-namespace-name
22080 namespace-alias
22082 Returns the NAMESPACE_DECL for the namespace. */
22084 static tree
22086 {
22087 tree identifier;
22088 tree namespace_decl;
22092 /* Get the name of the namespace. */
22097 /* Look up the identifier in the currently active scope. Look only
22098 for namespaces, due to:
22100 [basic.lookup.udir]
22102 When looking up a namespace-name in a using-directive or alias
22103 definition, only namespace names are considered.
22105 And:
22107 [basic.lookup.qual]
22109 During the lookup of a name preceding the :: scope resolution
22110 operator, object, function, and enumerator names are ignored.
22112 (Note that cp_parser_qualifying_entity only calls this
22113 function if the token after the name is the scope resolution
22114 operator.) */
22116 none_type,
22122 /* If it's not a namespace, issue an error. */
22125 {
22127 {
22128 auto_diagnostic_group d;
22129 name_hint hint;
22133 identifier,
22136 {
22142 }
22143 else
22145 identifier);
22146 }
22147 else
22150 }
22153 }
22155 /* Parse a namespace-definition.
22157 namespace-definition:
22158 named-namespace-definition
22159 unnamed-namespace-definition
22161 named-namespace-definition:
22162 original-namespace-definition
22163 extension-namespace-definition
22165 original-namespace-definition:
22166 namespace identifier { namespace-body }
22168 extension-namespace-definition:
22169 namespace original-namespace-name { namespace-body }
22171 unnamed-namespace-definition:
22172 namespace { namespace-body } */
22174 static void
22176 {
22177 tree identifier;
22187 {
22190 }
22192 /* Look for the `namespace' keyword. */
22193 cp_token* token
22196 /* Parse any specified attributes before the identifier. */
22200 {
22204 RID_INLINE);
22206 {
22210 "definitions only available with %<-std=c++20%> or "
22213 }
22216 {
22221 "standard attributes on namespaces must precede "
22224 /* Parse any attributes specified after the identifier. */
22226 }
22229 {
22230 /* Don't forget that the innermost namespace might have been
22231 marked as inline. Use |= because we cannot overwrite
22232 IS_INLINE in case the outermost namespace is inline, but
22233 there are no nested inlines. */
22236 }
22240 "nested namespace definitions only available with "
22243 /* Nested namespace names can create new namespaces (unlike
22244 other qualified-ids). */
22249 else
22252 }
22264 /* Start the namespace. */
22271 /* Look for the `{' to validate starting the namespace. */
22272 matching_braces braces;
22274 {
22275 /* Parse the body of the namespace. */
22278 /* Look for the final `}'. */
22280 }
22285 /* Pop the nested namespace definitions. */
22288 }
22290 /* Parse a namespace-body.
22292 namespace-body:
22293 declaration-seq [opt] */
22295 static void
22297 {
22299 }
22301 /* Parse a namespace-alias-definition.
22303 namespace-alias-definition:
22304 namespace identifier = qualified-namespace-specifier ; */
22306 static void
22308 {
22309 tree identifier;
22310 tree namespace_specifier;
22314 /* Look for the `namespace' keyword. */
22316 /* Look for the identifier. */
22320 /* Look for the `=' token. */
22323 {
22325 /* Skip the definition. */
22330 }
22332 /* Look for the qualified-namespace-specifier. */
22333 namespace_specifier
22336 /* Look for the `;' token. */
22339 /* Register the alias in the symbol table. */
22341 }
22343 /* Parse a qualified-namespace-specifier.
22345 qualified-namespace-specifier:
22346 :: [opt] nested-name-specifier [opt] namespace-name
22348 Returns a NAMESPACE_DECL corresponding to the specified
22349 namespace. */
22351 static tree
22353 {
22354 /* Look for the optional `::'. */
22358 /* Look for the optional nested-name-specifier. */
22366 }
22368 /* Subroutine of cp_parser_using_declaration. */
22370 static tree
22372 {
22375 {
22376 /* Create the USING_DECL. */
22385 /* Add it to the list of members in this class. */
22387 }
22388 else
22391 }
22393 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
22394 access declaration.
22396 using-declaration:
22397 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
22398 using :: unqualified-id ;
22400 access-declaration:
22401 qualified-id ;
22403 */
22405 static bool
22408 {
22412 tree identifier;
22413 tree qscope;
22418 {
22421 }
22422 else
22423 {
22424 /* Look for the `using' keyword. */
22427 again:
22428 /* Peek at the next token. */
22430 /* See if it's `typename'. */
22432 {
22433 /* Remember that we've seen it. */
22435 /* Consume the `typename' token. */
22437 }
22438 }
22440 /* Look for the optional global scope qualification. */
22441 global_scope_p
22446 /* If we saw `typename', or didn't see `::', then there must be a
22447 nested-name-specifier present. */
22449 {
22455 {
22458 }
22459 }
22460 /* Otherwise, we could be in either of the two productions. In that
22461 case, treat the nested-name-specifier as optional. */
22462 else
22476 /* If the qualifying scope of an access-declaration isn't a class
22477 or enumeration type then it can't be valid. */
22481 /* Something has already gone wrong; there's no need to parse
22482 further. Since an error has occurred, the return value of
22483 cp_parser_parse_definitely will be false, as required. */
22487 /* Parse the unqualified-id. */
22495 {
22500 }
22502 {
22506 "pack expansion in using-declaration only available "
22509 /* A parameter pack can appear in the qualifying scope, and/or in the
22510 terminal name (if naming a conversion function). Logically they're
22511 part of a single pack expansion of the overall USING_DECL, but we
22512 express them as separate pack expansions within the USING_DECL since
22513 we can't create a pack expansion over a USING_DECL. */
22516 {
22519 }
22523 {
22527 }
22529 {
22530 /* Issue an error in terms using a SCOPE_REF that includes both
22531 components. */
22532 tree name
22537 }
22538 }
22540 /* The function we call to handle a using-declaration is different
22541 depending on what scope we are in. */
22543 ;
22546 /* [namespace.udecl]
22548 A using declaration shall not name a template-id. */
22551 else
22552 {
22556 {
22559 }
22560 }
22564 {
22568 "comma-separated list in using-declaration only available "
22571 }
22573 /* Look for the final `;'. */
22578 "access declarations are deprecated "
22579 "in favor of using-declarations; "
22583 }
22585 /* C++20 using enum declaration.
22587 using-enum-declaration :
22588 using elaborated-enum-specifier ; */
22590 static void
22592 {
22595 /* Using cp_parser_elaborated_type_specifier rejects typedef-names, which
22596 breaks one of the motivating examples in using-enum-5.C.
22597 cp_parser_simple_type_specifier seems to be closer to what we actually
22598 want, though that hasn't been properly specified yet. */
22600 /* Consume 'enum'. */
22606 tree type = (cp_parser_simple_type_specifier
22613 {
22616 }
22620 /* The elaborated-enum-specifier shall not name a dependent type and the type
22621 shall have a reachable enum-specifier. */
22635 {
22637 auto_diagnostic_group g;
22641 ;
22644 else
22646 }
22648 /* A using-enum-declaration introduces the enumerator names of the named
22649 enumeration as if by a using-declaration for each enumerator. */
22653 }
22655 /* Parse an alias-declaration.
22657 alias-declaration:
22658 using identifier attribute-specifier-seq [opt] = type-id */
22660 static tree
22662 {
22666 cp_decl_specifier_seq decl_specs;
22670 /* Look for the `using' keyword. */
22671 cp_token *using_token
22693 /* Now we are going to parse the type-id of the declaration. */
22695 /*
22696 [dcl.type]/3 says:
22698 "A type-specifier-seq shall not define a class or enumeration
22699 unless it appears in the type-id of an alias-declaration (7.1.3) that
22700 is not the declaration of a template-declaration."
22702 In other words, if we currently are in an alias template, the
22703 type-id should not define a type.
22705 So let's set parser->type_definition_forbidden_message in that
22706 case; cp_parser_check_type_definition (called by
22707 cp_parser_class_specifier) will then emit an error if a type is
22708 defined in the type-id. */
22710 {
22714 }
22719 /* Restore the error message if need be. */
22725 {
22728 }
22730 /* A typedef-name can also be introduced by an alias-declaration. The
22731 identifier following the using keyword becomes a typedef-name. It has
22732 the same semantics as if it were introduced by the typedef
22733 specifier. In particular, it does not define a new type and it shall
22734 not appear in the type-id. */
22739 {
22742 ds_attribute,
22743 attrs_token);
22744 }
22746 ds_typedef,
22747 using_token);
22749 ds_alias,
22750 using_token);
22757 id_location,
22767 else
22778 /* If decl is a template, return its TEMPLATE_DECL so that it gets
22779 added into the symbol table; otherwise, return the TYPE_DECL. */
22783 {
22787 }
22790 }
22792 /* Parse a using-directive.
22794 using-directive:
22795 attribute-specifier-seq [opt] using namespace :: [opt]
22796 nested-name-specifier [opt] namespace-name ; */
22798 static void
22800 {
22801 tree namespace_decl;
22804 {
22805 /* Error during attribute parsing that resulted in skipping
22806 to next semicolon. */
22809 }
22811 /* Look for the `using' keyword. */
22813 /* And the `namespace' keyword. */
22815 /* Look for the optional `::' operator. */
22817 /* And the optional nested-name-specifier. */
22823 /* Get the namespace being used. */
22826 /* And any specified GNU attributes. */
22830 /* Update the symbol table. */
22833 /* Look for the final `;'. */
22835 }
22837 /* Parse a string literal or constant expression yielding a string.
22838 The constant expression uses extra parens to avoid ambiguity with "x" (expr).
22840 asm-string-expr:
22841 string-literal
22842 ( constant-expr ) */
22844 static tree
22846 {
22850 {
22851 matching_parens parens;
22863 }
22865 {
22869 }
22871 }
22873 /* Parse an asm-definition.
22875 asm-qualifier:
22876 volatile
22877 inline
22878 goto
22880 asm-qualifier-list:
22881 asm-qualifier
22882 asm-qualifier-list asm-qualifier
22884 asm-definition:
22885 asm ( constant-expr ) ;
22887 GNU Extension:
22889 asm-definition:
22890 asm asm-qualifier-list [opt] ( asm-string-expr ) ;
22891 asm asm-qualifier-list [opt] ( asm-string-expr : asm-operand-list [opt] ) ;
22892 asm asm-qualifier-list [opt] ( asm-string-expr : asm-operand-list [opt]
22893 : asm-operand-list [opt] ) ;
22894 asm asm-qualifier-list [opt] ( asm-string-expr : asm-operand-list [opt]
22895 : asm-operand-list [opt]
22896 : asm-clobber-list [opt] ) ;
22897 asm asm-qualifier-list [opt] ( asm-string-expr : : asm-operand-list [opt]
22898 : asm-clobber-list [opt]
22899 : asm-goto-list ) ;
22901 The form with asm-goto-list is valid if and only if the asm-qualifier-list
22902 contains goto, and is the only allowed form in that case. No duplicates are
22903 allowed in an asm-qualifier-list. */
22905 static void
22907 {
22912 tree asm_stmt;
22920 /* Look for the `asm' keyword. */
22923 /* In C++20, unevaluated inline assembly is permitted in constexpr
22924 functions. */
22929 "function only available with %<-std=c++20%> or "
22932 /* Handle the asm-qualifier-list. */
22940 {
22944 {
22947 {
22951 }
22952 else
22953 {
22958 }
22964 {
22968 }
22969 else
22978 {
22982 }
22983 else
22998 }
23000 }
23007 {
23010 }
23012 /* Look for the opening `('. */
23015 /* Look for the string. */
23018 {
23022 }
23024 /* If we're allowing GNU extensions, check for the extended assembly
23025 syntax. Unfortunately, the `:' tokens need not be separated by
23026 a space in C, and so, for compatibility, we tolerate that here
23027 too. Doing that means that we have to treat the `::' operator as
23028 two `:' tokens. */
23033 {
23038 /* The extended syntax was used. */
23041 /* Look for outputs. */
23043 {
23044 /* Consume the `:'. */
23046 /* Parse the output-operands. */
23048 CPP_COLON)
23050 CPP_SCOPE)
23052 CPP_CLOSE_PAREN))
23053 {
23057 }
23058 }
23059 /* If the next token is `::', there are no outputs, and the
23060 next token is the beginning of the inputs. */
23062 /* The inputs are coming next. */
23065 /* Look for inputs. */
23068 {
23069 /* Consume the `:' or `::'. */
23071 /* Parse the output-operands. */
23073 CPP_COLON)
23075 CPP_SCOPE)
23077 CPP_CLOSE_PAREN))
23078 {
23082 }
23083 }
23085 /* The clobbers are coming next. */
23088 /* Look for clobbers. */
23091 {
23093 /* Consume the `:' or `::'. */
23095 /* Parse the clobbers. */
23097 CPP_COLON)
23099 CPP_CLOSE_PAREN))
23101 }
23103 /* The labels are coming next. */
23106 /* Look for labels. */
23109 {
23111 /* Consume the `:' or `::'. */
23113 /* Parse the labels. */
23115 }
23119 }
23123 /* Look for the closing `)'. */
23131 {
23132 /* Create the ASM_EXPR. */
23134 {
23137 /* If the extended syntax was not used, mark the ASM_EXPR. */
23139 {
23145 }
23146 }
23147 else
23149 }
23154 }
23156 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
23157 type that comes from the decl-specifier-seq. */
23159 static tree
23161 {
23164 {
23177 }
23180 }
23182 /* Warn about the most vexing parse syntactic ambiguity, i.e., warn when
23183 a construct looks like a variable definition but is actually a function
23184 declaration. DECL_SPECIFIERS is the decl-specifier-seq and DECLARATOR
23185 is the declarator for this function declaration. */
23187 static void
23190 {
23191 /* Only warn if we are declaring a function at block scope. */
23195 /* And only if there is no storage class specified. */
23207 /* Don't warn when the whole declarator (not just the declarator-id!)
23208 was parenthesized. That is, don't warn for int(n()) but do warn
23209 for int(f)(). */
23213 tree type;
23215 {
23220 /* If the return type is void there is no ambiguity. */
23223 }
23225 /* Code like long f(); will have null ->type. If we have any
23226 type-specifiers, pretend we've seen int. */
23228 else
23231 auto_diagnostic_group d;
23236 /* The T t() case. */
23238 {
23240 "empty parentheses were disambiguated as a function "
23242 {
23243 /* () means value-initialization (C++03 and up); {} (C++11 and up)
23244 means value-initialization or aggregate-initialization, nothing
23245 means default-initialization. We can only suggest removing the
23246 parentheses/adding {} if T has a default constructor. */
23248 {
23254 {
23258 else
23261 }
23262 }
23263 }
23265 }
23267 /* If we had (...) or the parameter-list wasn't parenthesized,
23268 we're done. */
23272 /* The T t(X()) case. */
23274 {
23276 "parentheses were disambiguated as a function "
23278 {
23280 /* {}-initialization means that we can use an initializer-list
23281 constructor if no default constructor is available, so don't
23282 suggest using {} for classes that have an initializer_list
23283 constructor. */
23285 {
23290 }
23291 else
23292 {
23296 }
23297 }
23298 }
23299 /* The T t(X(), X()) case. */
23301 "parentheses were disambiguated as a function "
23303 {
23306 {
23311 }
23312 }
23313 }
23315 /* If DECLARATOR with DECL_SPECS is a function declarator that has
23316 the form of a deduction guide, tag it as such. CTOR_DTOR_OR_CONV_P
23317 has the same meaning as in cp_parser_declarator. */
23319 static void
23324 {
23330 {
23338 {
23342 }
23343 }
23344 }
23346 /* Declarators [gram.dcl.decl] */
23348 /* Parse an init-declarator.
23350 init-declarator:
23351 declarator initializer [opt]
23353 GNU Extension:
23355 init-declarator:
23356 declarator asm-specification [opt] attributes [opt] initializer [opt]
23358 function-definition:
23359 decl-specifier-seq [opt] declarator ctor-initializer [opt]
23360 function-body
23361 decl-specifier-seq [opt] declarator function-try-block
23363 GNU Extension:
23365 function-definition:
23366 __extension__ function-definition
23368 TM Extension:
23370 function-definition:
23371 decl-specifier-seq [opt] declarator function-transaction-block
23373 The parser flags FLAGS is used to control type-specifier parsing.
23375 The DECL_SPECIFIERS apply to this declarator. Returns a
23376 representation of the entity declared. If MEMBER_P is TRUE, then
23377 this declarator appears in a class scope. The new DECL created by
23378 this declarator is returned.
23380 The CHECKS are access checks that should be performed once we know
23381 what entity is being declared (and, therefore, what classes have
23382 befriended it).
23384 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
23385 for a function-definition here as well. If the declarator is a
23386 declarator for a function-definition, *FUNCTION_DEFINITION_P will
23387 be TRUE upon return. By that point, the function-definition will
23388 have been completely parsed.
23390 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
23391 is FALSE.
23393 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
23394 parsed declaration if it is an uninitialized single declarator not followed
23395 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
23396 if present, will not be consumed. If returned, this declarator will be
23397 created with SD_INITIALIZED but will not call cp_finish_decl.
23399 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
23400 and there is an initializer, the pointed location_t is set to the
23401 location of the '=' or `(', or '{' in C++11 token introducing the
23402 initializer. */
23404 static tree
23406 cp_parser_flags flags,
23416 {
23420 tree prefix_attributes;
23422 tree asm_specification;
23423 tree initializer;
23425 tree scope;
23427 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
23428 initialized with "= ..", CPP_OPEN_PAREN if initialized with
23429 "(...)". */
23444 /* Assume that this is not the declarator for a function
23445 definition. */
23449 /* Default arguments are only permitted for function parameters. */
23453 /* Defer access checks while parsing the declarator; we cannot know
23454 what names are accessible until we know what is being
23455 declared. */
23460 /* Parse the declarator. */
23461 declarator
23466 /* Gather up the deferred checks. */
23471 /* If the DECLARATOR was erroneous, there's no need to go
23472 further. */
23476 /* Check that the number of template-parameter-lists is OK. */
23486 /* Figure out what scope the entity declared by the DECLARATOR is
23487 located in. `grokdeclarator' sometimes changes the scope, so
23488 we compute it now. */
23491 /* Perform any lookups in the declared type which were thought to be
23492 dependent, but are not in the scope of the declarator. */
23493 decl_specifiers->type
23496 /* If we're allowing GNU extensions, look for an
23497 asm-specification. */
23499 {
23500 /* Look for an asm-specification. */
23503 }
23504 else
23507 /* Gather the attributes that were provided with the
23508 decl-specifiers. */
23511 /* Look for attributes. */
23515 /* Peek at the next token. */
23521 {
23522 /* Handle C++17 deduction guides. Note that class-scope
23523 non-template deduction guides are instead handled in
23524 cp_parser_member_declaration. */
23526 decl_specifiers,
23527 declarator,
23533 /* Check to see if the token indicates the start of a
23534 function-definition. */
23536 {
23538 {
23539 /* If a function-definition should not appear here, issue an
23540 error message. */
23544 }
23546 location_t func_brace_location
23549 /* Neither attributes nor an asm-specification are allowed
23550 on a function-definition. */
23553 "an %<asm%> specification is not allowed "
23557 "attributes are not allowed "
23559 /* This is a function-definition. */
23562 /* Parse the function definition. */
23565 decl_specifiers,
23566 declarator,
23567 prefix_attributes);
23568 else
23569 decl =
23570 (cp_parser_function_definition_from_specifiers_and_declarator
23574 {
23575 /* This is where the prologue starts... */
23578 }
23581 }
23582 }
23584 {
23585 /* A non-template declaration involving a function parameter list
23586 containing an implicit template parameter will be made into a
23587 template. If the resulting declaration is not going to be an
23588 actual function then finish the template scope here to prevent it.
23589 An error message will be issued once we have a decl to talk about.
23591 FIXME probably we should do type deduction rather than create an
23592 implicit template, but the standard currently doesn't allow it. */
23595 }
23597 /* [dcl.dcl]
23599 Only in function declarations for constructors, destructors, type
23600 conversions, and deduction guides can the decl-specifier-seq be omitted.
23602 We explicitly postpone this check past the point where we handle
23603 function-definitions because we tolerate function-definitions
23604 that are missing their return types in some modes. */
23606 {
23610 }
23612 /* An `=' or an '{' in C++11, indicate an initializer. An '(' may indicate
23613 an initializer as well. */
23617 {
23618 /* Don't get fooled into thinking that F(i)(1)(2) is an initializer.
23619 It isn't; it's an expression. (Here '(i)' would have already been
23620 parsed as a declarator.) */
23623 {
23630 /* If this is an initializer, only a ',' or ';' can follow: either
23631 we have another init-declarator, or we're at the end of an
23632 init-declarator-list which can only be followed by a ';'. */
23637 /* Not an init-declarator. */
23639 }
23651 {
23657 }
23658 }
23659 else
23660 {
23661 /* If the init-declarator isn't initialized and isn't followed by a
23662 `,' or `;', it's not a valid init-declarator. */
23665 {
23668 else
23669 {
23673 }
23674 }
23677 }
23679 /* Because start_decl has side-effects, we should only call it if we
23680 know we're going ahead. By this point, we know that we cannot
23681 possibly be looking at any other construct. */
23684 /* Enter the newly declared entry in the symbol table. If we're
23685 processing a declaration in a class-specifier, we wait until
23686 after processing the initializer. */
23688 {
23696 /* Adjust location of decl if declarator->id_loc is more appropriate:
23697 set, and decl wasn't merged with another decl, in which case its
23698 location would be different from input_location, and more accurate. */
23703 }
23705 /* Enter the SCOPE. That way unqualified names appearing in the
23706 initializer will be looked up in SCOPE. */
23709 /* Perform deferred access control checks, now that we know in which
23710 SCOPE the declared entity resides. */
23712 {
23715 /* If the entity being declared is a function, pretend that we
23716 are in its scope. If it is a `friend', it may have access to
23717 things that would not otherwise be accessible. */
23719 {
23722 }
23724 /* Perform access checks for template parameters. */
23727 /* Perform the access control checks for the declarator and the
23728 decl-specifiers. */
23731 /* Restore the saved value. */
23734 }
23736 /* Parse the initializer. */
23741 {
23743 {
23746 else
23747 {
23748 /* If the declaration was erroneous, we don't really
23749 know what the user intended, so just silently
23750 consume the initializer. */
23757 }
23758 }
23759 else
23760 {
23761 /* We want to record the extra mangling scope for in-class
23762 initializers of class members and initializers of static
23763 data member templates and namespace-scope initializers.
23764 The former involves deferring parsing of the initializer
23765 until end of class as with default arguments. So right
23766 here we only handle the latter two. */
23770 && !member_p
23783 }
23784 }
23786 /* The old parser allows attributes to appear after a parenthesized
23787 initializer. Mark Mitchell proposed removing this functionality
23788 on the GCC mailing lists on 2002-08-13. This parser accepts the
23789 attributes -- but ignores them. Made a permerror in GCC 8. */
23795 {
23798 {
23802 }
23803 }
23805 /* And now complain about a non-function implicit template. */
23810 /* For an in-class declaration, use `grokfield' to create the
23811 declaration. */
23813 {
23815 {
23818 }
23827 }
23829 /* Finish processing the declaration. But, skip member
23830 declarations. */
23832 {
23835 asm_specification,
23836 /* If the initializer is in parentheses, then this is
23837 a direct-initialization, which means that an
23838 `explicit' constructor is OK. Otherwise, an
23839 `explicit' constructor cannot be used. */
23842 }
23845 /* Core issue #226 (C++0x only): A default template-argument
23846 shall not be specified in a friend class template
23847 declaration. */
23856 {
23859 else
23861 }
23868 }
23870 /* Parse a declarator.
23872 declarator:
23873 direct-declarator
23874 ptr-operator declarator
23876 abstract-declarator:
23877 ptr-operator abstract-declarator [opt]
23878 direct-abstract-declarator
23880 GNU Extensions:
23882 declarator:
23883 attributes [opt] direct-declarator
23884 attributes [opt] ptr-operator declarator
23886 abstract-declarator:
23887 attributes [opt] ptr-operator abstract-declarator [opt]
23888 attributes [opt] direct-abstract-declarator
23890 The parser flags FLAGS is used to control type-specifier parsing.
23892 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
23893 detect constructors, destructors, deduction guides, or conversion operators.
23894 It is set to -1 if the declarator is a name, and +1 if it is a
23895 function. Otherwise it is set to zero. Usually you just want to
23896 test for >0, but internally the negative value is used.
23898 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
23899 a decl-specifier-seq unless it declares a constructor, destructor,
23900 or conversion. It might seem that we could check this condition in
23901 semantic analysis, rather than parsing, but that makes it difficult
23902 to handle something like `f()'. We want to notice that there are
23903 no decl-specifiers, and therefore realize that this is an
23904 expression, not a declaration.)
23906 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
23907 the declarator is a direct-declarator of the form "(...)".
23909 MEMBER_P is true iff this declarator is a member-declarator.
23911 FRIEND_P is true iff this declarator is a friend.
23913 STATIC_P is true iff the keyword static was seen. */
23917 cp_parser_declarator_kind dcl_kind,
23918 cp_parser_flags flags,
23922 {
23925 cp_cv_quals cv_quals;
23926 tree class_type;
23929 /* Assume this is not a constructor, destructor, or type-conversion
23930 operator. */
23937 /* Check for the ptr-operator production. */
23939 /* Parse the ptr-operator. */
23945 /* If that worked, then we have a ptr-operator. */
23947 {
23948 /* If a ptr-operator was found, then this declarator was not
23949 parenthesized. */
23952 /* The dependent declarator is optional if we are parsing an
23953 abstract-declarator. */
23957 /* Parse the dependent declarator. */
23963 /* If we are parsing an abstract-declarator, we must handle the
23964 case where the dependent declarator is absent. */
23969 declarator = cp_parser_make_indirect_declarator
23971 }
23972 /* Everything else is a direct-declarator. */
23973 else
23974 {
23977 CPP_OPEN_PAREN);
23981 }
23986 }
23988 /* Parse a direct-declarator or direct-abstract-declarator.
23990 direct-declarator:
23991 declarator-id
23992 direct-declarator ( parameter-declaration-clause )
23993 cv-qualifier-seq [opt]
23994 ref-qualifier [opt]
23995 exception-specification [opt]
23996 direct-declarator [ constant-expression [opt] ]
23997 ( declarator )
23999 direct-abstract-declarator:
24000 direct-abstract-declarator [opt]
24001 ( parameter-declaration-clause )
24002 cv-qualifier-seq [opt]
24003 ref-qualifier [opt]
24004 exception-specification [opt]
24005 direct-abstract-declarator [opt] [ constant-expression [opt] ]
24006 ( abstract-declarator )
24008 Returns a representation of the declarator. DCL_KIND is
24009 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
24010 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
24011 we are parsing a direct-declarator. It is
24012 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
24013 of ambiguity we prefer an abstract declarator, as per
24014 [dcl.ambig.res].
24015 The parser flags FLAGS is used to control type-specifier parsing.
24016 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
24017 as for cp_parser_declarator. */
24021 cp_parser_declarator_kind dcl_kind,
24022 cp_parser_flags flags,
24025 {
24036 {
24037 /* Peek at the next token. */
24040 || (first
24045 {
24046 /* This is either a parameter-declaration-clause, or a
24047 parenthesized declarator. When we know we are parsing a
24048 named declarator, it must be a parenthesized declarator
24049 if FIRST is true. For instance, `(int)' is a
24050 parameter-declaration-clause, with an omitted
24051 direct-abstract-declarator. But `((*))', is a
24052 parenthesized abstract declarator. Finally, when T is a
24053 template parameter `(T)' is a
24054 parameter-declaration-clause, and not a parenthesized
24055 named declarator.
24057 We first try and parse a parameter-declaration-clause,
24058 and then try a nested declarator (if FIRST is true).
24060 It is not an error for it not to be a
24061 parameter-declaration-clause, even when FIRST is
24062 false. Consider,
24064 int i (int);
24065 int i (3);
24067 The first is the declaration of a function while the
24068 second is the definition of a variable, including its
24069 initializer.
24071 Having seen only the parenthesis, we cannot know which of
24072 these two alternatives should be selected. Even more
24073 complex are examples like:
24075 int i (int (a));
24076 int i (int (3));
24078 The former is a function-declaration; the latter is a
24079 variable initialization.
24081 Thus again, we try a parameter-declaration-clause, and if
24082 that fails, we back out and return. */
24086 /* Consume the `...' */
24090 {
24091 tree params;
24096 /* In a member-declarator, the only valid interpretation
24097 of a parenthesis is the start of a
24098 parameter-declaration-clause. (It is invalid to
24099 initialize a static data member with a parenthesized
24100 initializer; only the "=" form of initialization is
24101 permitted.) */
24105 /* Consume the `('. */
24107 matching_parens parens;
24110 {
24111 /* If this is going to be an abstract declarator, we're
24112 in a declarator and we can't have default args. */
24115 }
24119 /* Parse the parameter-declaration-clause. */
24120 params
24122 const location_t parens_end
24125 /* Consume the `)'. */
24128 /* For code like
24129 int x(auto(42));
24130 A a(auto(i), 42);
24131 we have synthesized an implicit template parameter and marked
24132 what we thought was a function as an implicit function template.
24133 But now, having seen the whole parameter list, we know it's not
24134 a function declaration, so undo that. */
24137 /* Don't do this for the inner (). */
24141 /* If all went well, parse the cv-qualifier-seq,
24142 ref-qualifier and the exception-specification. */
24144 {
24145 cp_cv_quals cv_quals;
24146 cp_virt_specifiers virt_specifiers;
24147 cp_ref_qualifier ref_qual;
24148 tree exception_specification;
24149 tree late_return;
24150 tree attrs;
24153 unsigned char local_variables_forbidden_p
24155 /* 'this' is not allowed in static member functions. */
24165 /* Parse the cv-qualifier-seq. */
24167 /* Parse the ref-qualifier. */
24169 /* Parse the tx-qualifier. */
24175 /* DR 1207: 'this' is in scope after the cv-quals. */
24178 /* If it turned out that this is e.g. a pointer to a
24179 function, we don't want to delay noexcept parsing. */
24183 /* Parse the exception-specification. */
24184 exception_specification
24186 flags);
24190 cp_omp_declare_simd_data odsd;
24192 && declarator
24195 {
24199 }
24201 /* In here, we handle cases where attribute is used after
24202 the function declaration. For example:
24203 void func (int x) __attribute__((vector(..))); */
24206 late_return
24208 requires_clause);
24212 /* Parse the virt-specifier-seq. */
24216 parens_start,
24217 parens_end);
24218 /* Create the function-declarator. */
24220 params,
24221 cv_quals,
24222 virt_specifiers,
24223 ref_qual,
24224 tx_qual,
24225 exception_specification,
24226 late_return,
24227 requires_clause,
24228 attrs,
24229 parens_loc);
24232 /* Any subsequent parameter lists are to do with
24233 return type, so are not those of the declared
24234 function. */
24240 /* Restore the state of local_variables_forbidden_p. */
24241 parser->local_variables_forbidden_p
24243 }
24245 /* Remove the function parms from scope. */
24249 /* Repeat the main loop. */
24251 }
24253 /* If this is the first, we can try a parenthesized
24254 declarator. */
24256 {
24263 /* Consume the `('. */
24264 matching_parens parens;
24266 /* Parse the nested declarator. */
24269 declarator
24271 ctor_dtor_or_conv_p,
24277 /* Expect a `)'. */
24285 }
24286 /* Otherwise, we must be done. */
24287 else
24289 }
24293 {
24294 /* Parse an array-declarator. */
24304 /* Consume the `['. */
24306 /* Peek at the next token. */
24308 /* If the next token is `]', then there is no
24309 constant-expression. */
24311 {
24313 bounds
24325 {
24326 /* Normally, the array bound must be an integral constant
24327 expression. However, as an extension, we allow VLAs
24328 in function scopes as long as they aren't part of a
24329 parameter declaration. */
24333 }
24336 {
24337 /* Remember this wasn't a constant-expression. */
24340 }
24341 }
24342 else
24344 /* Look for the closing `]'. */
24346 {
24349 }
24354 }
24356 {
24357 {
24358 tree qualifying_scope;
24359 tree unqualified_name;
24360 tree attrs;
24361 special_function_kind sfk;
24366 /* Parse a declarator-id */
24369 {
24372 /* If we see an ellipsis, we should be looking at a
24373 parameter pack. */
24375 {
24376 /* Consume the `...' */
24380 }
24381 }
24384 unqualified_name
24388 {
24392 {
24393 /* Check whether an error occurred. */
24396 /* We already consumed the ellipsis to mark a
24397 parameter pack, but we have no way to report it,
24398 so abort the tentative parse. We will be exiting
24399 immediately anyway. */
24401 }
24402 else
24408 && (qualifying_scope
24410 {
24413 }
24414 }
24419 {
24424 }
24430 {
24431 /* In the declaration of a member of a template class
24432 outside of the class itself, the SCOPE will sometimes
24433 be a TYPENAME_TYPE. For example, given:
24435 template <typename T>
24436 int S<T>::R::i = 3;
24438 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
24439 this context, we must resolve S<T>::R to an ordinary
24440 type, rather than a typename type.
24442 The reason we normally avoid resolving TYPENAME_TYPEs
24443 is that a specialization of `S' might render
24444 `S<T>::R' not a type. However, if `S' is
24445 specialized, then this `i' will not be used, so there
24446 is no harm in resolving the types here. */
24447 tree type;
24449 /* Resolve the TYPENAME_TYPE. */
24452 /* If that failed, the declarator is invalid. */
24454 {
24457 "cannot define member of dependent typedef "
24459 else
24464 }
24466 }
24471 {
24472 tree class_type;
24477 else
24481 {
24485 {
24486 /* We do not attempt to print the declarator
24487 here because we do not have enough
24488 information about its original syntactic
24489 form. */
24493 }
24496 {
24500 "use %<%T::%D%> instead of %<%T::%D%> to "
24502 class_type,
24507 }
24509 }
24512 {
24519 for an unnamed type, even if the type
24520 got a name for linkage purposes. */
24522 /* Handle correctly (c++/19200):
24524 struct S {
24525 struct T{};
24526 friend void S(T);
24527 };
24529 and also:
24531 namespace N {
24532 void S();
24533 }
24535 struct S {
24536 friend void N::S();
24537 }; */
24540 class_type))
24549 }
24550 }
24552 unqualified_name,
24560 /* We're looking for this case in [temp.res]:
24561 A qualified-id is assumed to name a type if [...]
24562 - it is a decl-specifier of the decl-specifier-seq of a
24563 parameter-declaration in a declarator of a function or
24564 function template declaration, ... */
24570 {
24571 /* ...whose declarator-id is qualified. If it isn't, never
24572 assume the parameters to refer to types. */
24575 else
24576 {
24577 /* Now we have something like
24578 template <typename T> int C::x(S::p);
24579 which can be a function template declaration or a
24580 variable template definition. If name lookup for
24581 the declarator-id C::x finds one or more function
24582 templates, assume S::p to name a type. Otherwise,
24583 don't. */
24584 tree decl
24586 none_type,
24594 /* Allow
24595 template<typename T>
24596 A<T>::A(T::type) { } */
24599 qualifying_scope)))
24601 }
24602 }
24603 }
24605 handle_declarator:;
24608 {
24609 /* Any names that appear after the declarator-id for a
24610 member are looked up in the containing scope. */
24612 {
24613 /* But declarations with qualified-ids can't appear in a
24614 function. */
24618 }
24620 }
24624 /* Default args are only allowed on function
24625 declarations. */
24627 else
24631 }
24632 /* We're done. */
24633 else
24635 }
24637 /* For an abstract declarator, we might wind up with nothing at this
24638 point. That's an error; the declarator is not optional. */
24642 {
24643 /* Record overly parenthesized declarator so we can give a
24644 diagnostic about confusing decl/expr disambiguation. */
24646 {
24647 /* If the open and close parens are on different lines, this
24648 is probably a formatting thing, so ignore. */
24653 }
24658 }
24660 /* If we entered a scope, we must exit it now. */
24668 }
24670 /* Parse a ptr-operator.
24672 ptr-operator:
24673 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24674 * cv-qualifier-seq [opt]
24675 &
24676 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
24677 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24679 GNU Extension:
24681 ptr-operator:
24682 & cv-qualifier-seq [opt]
24684 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
24685 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
24686 an rvalue reference. In the case of a pointer-to-member, *TYPE is
24687 filled in with the TYPE containing the member. *CV_QUALS is
24688 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
24689 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
24690 Note that the tree codes returned by this function have nothing
24691 to do with the types of trees that will be eventually be created
24692 to represent the pointer or reference type being parsed. They are
24693 just constants with suggestive names. */
24694 static enum tree_code
24699 {
24704 /* Assume that it's not a pointer-to-member. */
24706 /* And that there are no cv-qualifiers. */
24709 /* Peek at the next token. */
24712 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
24722 {
24723 /* Consume the `*', `&' or `&&'. */
24726 /* A `*' can be followed by a cv-qualifier-seq, and so can a
24727 `&', if we are allowing GNU extensions. (The only qualifier
24728 that can legally appear after `&' is `restrict', but that is
24729 enforced during semantic analysis. */
24737 }
24738 else
24739 {
24740 /* Try the pointer-to-member case. */
24742 /* Look for the optional `::' operator. */
24745 /* Look for the nested-name specifier. */
24752 /* If we found it, and the next token is a `*', then we are
24753 indeed looking at a pointer-to-member operator. */
24756 {
24757 /* Indicate that the `*' operator was used. */
24765 else
24766 {
24767 /* The type of which the member is a member is given by the
24768 current SCOPE. */
24770 /* The next name will not be qualified. */
24774 /* Look for optional c++11 attributes. */
24778 /* Look for the optional cv-qualifier-seq. */
24780 }
24781 }
24782 /* If that didn't work we don't have a ptr-operator. */
24785 }
24788 }
24790 /* Parse an (optional) cv-qualifier-seq.
24792 cv-qualifier-seq:
24793 cv-qualifier cv-qualifier-seq [opt]
24795 cv-qualifier:
24796 const
24797 volatile
24799 GNU Extension:
24801 cv-qualifier:
24802 __restrict__
24804 Returns a bitmask representing the cv-qualifiers. */
24806 static cp_cv_quals
24808 {
24812 {
24814 cp_cv_quals cv_qualifier;
24816 /* Peek at the next token. */
24818 /* See if it's a cv-qualifier. */
24820 {
24836 }
24842 {
24847 }
24848 else
24849 {
24852 }
24853 }
24856 }
24858 /* Parse an (optional) ref-qualifier
24860 ref-qualifier:
24861 &
24862 &&
24864 Returns cp_ref_qualifier representing ref-qualifier. */
24866 static cp_ref_qualifier
24868 {
24871 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
24876 {
24881 {
24893 }
24898 {
24901 }
24902 else
24903 {
24906 }
24907 }
24910 }
24912 /* Parse an optional tx-qualifier.
24914 tx-qualifier:
24915 transaction_safe
24916 transaction_safe_dynamic */
24918 static tree
24920 {
24923 {
24928 {
24932 {
24935 {
24938 }
24939 else
24941 }
24942 }
24943 }
24945 }
24947 /* Parse an (optional) virt-specifier-seq.
24949 virt-specifier-seq:
24950 virt-specifier virt-specifier-seq [opt]
24952 virt-specifier:
24953 override
24954 final
24956 Returns a bitmask representing the virt-specifiers. */
24958 static cp_virt_specifiers
24960 {
24964 {
24966 cp_virt_specifiers virt_specifier;
24968 /* Peek at the next token. */
24970 /* See if it's a virt-specifier-qualifier. */
24974 {
24977 }
24979 {
24982 }
24984 {
24986 }
24987 else
24991 {
24996 }
24997 else
24998 {
25001 }
25002 }
25004 }
25006 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
25007 is in scope even though it isn't real. */
25009 void
25011 {
25012 tree this_parm;
25015 {
25016 /* We don't clear this between NSDMIs. Is it already what we want? */
25023 }
25026 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
25028 current_class_ref
25031 }
25033 /* Return true iff our current scope is a non-static data member
25034 initializer. */
25036 bool
25038 {
25039 /* We recognize NSDMI context by the context-less 'this' pointer set up
25040 by the function above. */
25046 }
25048 /* True if we're parsing a function declarator. */
25050 bool
25052 {
25053 /* this_entity is NULL for a function parameter scope while parsing the
25054 declarator; it is set when parsing the body of the function. */
25057 }
25059 /* Parse a late-specified return type, if any. This is not a separate
25060 non-terminal, but part of a function declarator, which looks like
25062 -> trailing-type-specifier-seq abstract-declarator(opt)
25064 Returns the type indicated by the type-id.
25066 In addition to this, parse any queued up #pragma omp declare simd
25067 clauses, and #pragma acc routine clauses.
25069 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
25070 function. */
25072 static tree
25075 {
25079 && declarator
25083 && declarator
25086 /* Peek at the next token. */
25088 /* A late-specified return type is indicated by an initial '->'. */
25097 {
25098 /* Consume the ->. */
25102 }
25104 /* Function declarations may be followed by a trailing
25105 requires-clause. */
25109 declarator->attributes
25113 declarator->attributes
25118 }
25120 /* Parse a declarator-id.
25122 declarator-id:
25123 id-expression
25124 :: [opt] nested-name-specifier [opt] type-name
25126 In the `id-expression' case, the value returned is as for
25127 cp_parser_id_expression if the id-expression was an unqualified-id.
25128 If the id-expression was a qualified-id, then a SCOPE_REF is
25129 returned. The first operand is the scope (either a NAMESPACE_DECL
25130 or TREE_TYPE), but the second is still just a representation of an
25131 unqualified-id. */
25133 static tree
25135 {
25136 tree id;
25137 /* The expression must be an id-expression. Assume that qualified
25138 names are the names of types so that:
25140 template <class T>
25141 int S<T>::R::i = 3;
25143 will work; we must treat `S<T>::R' as the name of a type.
25144 Similarly, assume that qualified names are templates, where
25145 required, so that:
25147 template <class T>
25148 int S<T>::R<T>::i = 3;
25150 will work, too. */
25156 optional_p);
25160 }
25162 /* Parse a type-id.
25164 type-id:
25165 type-specifier-seq abstract-declarator [opt]
25167 The parser flags FLAGS is used to control type-specifier parsing.
25169 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
25171 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
25172 i.e. we've just seen "->".
25174 Returns the TYPE specified. */
25176 static tree
25180 {
25181 cp_decl_specifier_seq type_specifier_seq;
25184 /* Parse the type-specifier-seq. */
25187 is_trailing_return,
25195 /* A bare template name as a template argument is a template template
25196 argument, not a placeholder, so fail parsing it as a type argument. */
25197 {
25201 }
25205 /* There might or might not be an abstract declarator. */
25207 /* Look for the declarator. */
25208 abstract_declarator
25215 /* Check to see if there really was a declarator. */
25220 /* The concepts TS allows 'auto' as a type-id. */
25223 /* DR 625 prohibits use of auto as a template-argument. We allow 'auto'
25224 outside the template-argument-list context here only for the sake of
25225 diagnostic: grokdeclarator then can emit a better error message for
25226 e.g. using T = auto. */
25232 && !auto_typeid_ok
25233 /* None of the valid uses of 'auto' in C++14 involve the type-id
25234 nonterminal, but it is valid in a trailing-return-type. */
25237 {
25238 /* A type-id with type 'auto' is only ok if the abstract declarator
25239 is a function declarator with a late-specified return type.
25241 A type-id with 'auto' is also valid in a trailing-return-type
25242 in a compound-requirement. */
25249 else
25250 {
25252 {
25255 {
25256 auto_diagnostic_group g;
25260 tmpl);
25262 tmpl);
25263 }
25266 auto_node);
25267 else
25269 }
25271 }
25272 }
25275 is_template_arg);
25276 }
25278 /* Wrapper for cp_parser_type_id_1. */
25280 static tree
25283 {
25285 }
25287 /* Wrapper for cp_parser_type_id_1. */
25289 static tree
25291 {
25293 parser->type_definition_forbidden_message
25299 /* cp_parser_type_id_1 checks for auto, but only for
25300 ->auto_is_implicit_function_template_parm_p. */
25302 {
25305 }
25307 }
25309 /* Wrapper for cp_parser_type_id_1. */
25311 static tree
25313 {
25316 }
25318 /* Parse a type-specifier-seq.
25320 type-specifier-seq:
25321 type-specifier type-specifier-seq [opt]
25323 GNU extension:
25325 type-specifier-seq:
25326 attributes type-specifier-seq [opt]
25328 The parser flags FLAGS is used to control type-specifier parsing.
25330 If IS_DECLARATION is true, we are at the start of a "condition" or
25331 exception-declaration, so we might be followed by a declarator-id.
25333 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
25334 i.e. we've just seen "->".
25336 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
25338 static void
25340 cp_parser_flags flags,
25344 {
25348 /* Clear the TYPE_SPECIFIER_SEQ. */
25352 /* In the context of a trailing return type, enum E { } is an
25353 elaborated-type-specifier followed by a function-body, not an
25354 enum-specifier. */
25358 /* Parse the type-specifiers and attributes. */
25360 {
25361 tree type_specifier;
25364 /* Check for attributes first. */
25366 {
25367 /* GNU attributes at the end of a declaration apply to the
25368 declaration as a whole, not to the trailing return type. So look
25369 ahead to see if these attributes are at the end. */
25372 {
25378 }
25379 type_specifier_seq->attributes
25383 }
25385 /* record the token of the beginning of the type specifier seq,
25386 for error reporting purposes*/
25390 /* Look for the type-specifier. */
25392 flags,
25393 type_specifier_seq,
25395 NULL,
25398 {
25399 /* If the first type-specifier could not be found, this is not a
25400 type-specifier-seq at all. */
25402 {
25403 /* Set in_declarator_p to avoid skipping to the semicolon. */
25415 }
25416 /* If subsequent type-specifiers could not be found, the
25417 type-specifier-seq is complete. */
25419 }
25422 /* The standard says that a condition can be:
25424 type-specifier-seq declarator = assignment-expression
25426 However, given:
25428 struct S {};
25429 if (int S = ...)
25431 we should treat the "S" as a declarator, not as a
25432 type-specifier. The standard doesn't say that explicitly for
25433 type-specifier-seq, but it does say that for
25434 decl-specifier-seq in an ordinary declaration. Perhaps it
25435 would be clearer just to allow a decl-specifier-seq here, and
25436 then add a semantic restriction that if any decl-specifiers
25437 that are not type-specifiers appear, the program is invalid. */
25440 }
25441 }
25443 /* Return whether the function currently being declared has an associated
25444 template parameter list. */
25446 static bool
25448 {
25461 }
25463 /* Parse a parameter-declaration-clause.
25465 parameter-declaration-clause:
25466 parameter-declaration-list [opt] ... [opt]
25467 parameter-declaration-list , ...
25469 The parser flags FLAGS is used to control type-specifier parsing.
25471 Returns a representation for the parameter declarations. A return
25472 value of NULL indicates a parameter-declaration-clause consisting
25473 only of an ellipsis. */
25475 static tree
25477 cp_parser_flags flags)
25478 {
25479 tree parameters;
25487 && !processing_template_parmlist
25488 && !processing_explicit_instantiation
25489 /* default_arg_ok_p tracks whether this is a parameter-clause for an
25490 actual function or a random abstract declarator. */
25496 /* Peek at the next token. */
25498 /* Check for trivial parameter-declaration-clauses. */
25500 {
25501 /* Consume the `...' token. */
25504 }
25506 /* There are no parameters. */
25508 /* Check for `(void)', too, which is a special case. */
25512 {
25513 /* Consume the `void' token. */
25515 /* There are no parameters. */
25517 }
25519 /* A vector of parameters that haven't been pushed yet. */
25522 /* Parse the parameter-declaration-list. */
25525 /* If a parse error occurred while parsing the
25526 parameter-declaration-list, then the entire
25527 parameter-declaration-clause is erroneous. */
25531 /* Peek at the next token. */
25533 /* If it's a `,', the clause should terminate with an ellipsis. */
25535 {
25536 /* Consume the `,'. */
25538 /* Expect an ellipsis. */
25539 ellipsis_p
25541 }
25542 /* It might also be `...' if the optional trailing `,' was
25543 omitted. */
25545 {
25546 /* Consume the `...' token. */
25548 /* And remember that we saw it. */
25550 }
25551 else
25554 /* A valid parameter-declaration-clause can only be followed by a ')'.
25555 So it's time to push all the parameters we have seen now that we
25556 know we have a valid declaration. Note that here we may not have
25557 committed yet, nor should we. Pushing here will detect the error
25558 of redefining a parameter. */
25560 {
25564 /* Delayed checking of auto parameters. */
25569 {
25573 }
25574 }
25576 /* Finish the parameter list. */
25581 }
25583 /* Parse a parameter-declaration-list.
25585 parameter-declaration-list:
25586 parameter-declaration
25587 parameter-declaration-list , parameter-declaration
25589 The parser flags FLAGS is used to control type-specifier parsing.
25590 PENDING_DECLS is a vector of parameters that haven't been pushed yet.
25592 Returns a representation of the parameter-declaration-list, as for
25593 cp_parser_parameter_declaration_clause. However, the
25594 `void_list_node' is never appended to the list. */
25596 static tree
25598 cp_parser_flags flags,
25600 {
25606 /* The special considerations that apply to a function within an
25607 unbraced linkage specifications do not apply to the parameters
25608 to the function. */
25609 saved_in_unbraced_linkage_specification_p
25613 /* Look for more parameters. */
25615 {
25620 /* Parse the parameter. */
25621 parameter
25626 /* We don't know yet if the enclosing context is unavailable or deprecated,
25627 so wait and deal with it in grokparms if appropriate. */
25631 {
25634 PARM,
25639 }
25643 /* If a parse error occurred parsing the parameter declaration,
25644 then the entire parameter-declaration-list is erroneous. */
25646 {
25649 }
25656 {
25657 /* We cannot always pushdecl while parsing tentatively because
25658 it may have side effects and we can't be sure yet if we're
25659 parsing a declaration, e.g.:
25661 S foo(int(x), int(x), int{x});
25663 where it's not clear if we're dealing with a constructor call
25664 or a function declaration until we've seen the last argument
25665 which breaks it up.
25666 It's safe to pushdecl so long as it doesn't result in a clash
25667 with an already-pushed parameter. But we don't delay pushing
25668 different parameters to handle
25670 S foo(int(i), decltype(i) j = 42);
25672 which is valid. */
25675 /* See if PARAMETERS already contains a parameter with the same
25676 DECL_NAME as DECL. */
25682 }())
25684 else
25686 }
25689 {
25693 }
25695 /* Add the new parameter to the list. */
25699 /* If the parameters were parenthesized, it's the case of
25700 T foo(X(x)) which looks like a variable definition but
25701 is a function declaration. */
25705 /* Peek at the next token. */
25708 /* These are for Objective-C++ */
25711 /* The parameter-declaration-list is complete. */
25714 {
25717 /* Peek at the next token. */
25719 /* If it's an ellipsis, then the list is complete. */
25722 /* Otherwise, there must be more parameters. Consume the
25723 `,'. */
25725 /* When parsing something like:
25727 int i(float f, double d)
25729 we can tell after seeing the declaration for "f" that we
25730 are not looking at an initialization of a variable "i",
25731 but rather at the declaration of a function "i".
25733 Due to the fact that the parsing of template arguments
25734 (as specified to a template-id) requires backtracking we
25735 cannot use this technique when inside a template argument
25736 list. */
25740 /* However, a parameter-declaration of the form
25741 "float(f)" (which is a valid declaration of a
25742 parameter "f") can also be interpreted as an
25743 expression (the conversion of "f" to "float"). */
25746 }
25747 else
25748 {
25756 }
25757 }
25759 parser->in_unbraced_linkage_specification_p
25762 /* Reset implicit_template_scope if we are about to leave the function
25763 parameter list that introduced it. Note that for out-of-line member
25764 definitions, there will be one or more class scopes before we get to
25765 the template parameter scope. */
25769 {
25773 {
25776 }
25777 }
25780 }
25782 /* Parse a parameter declaration.
25784 parameter-declaration:
25785 decl-specifier-seq ... [opt] declarator
25786 decl-specifier-seq declarator = assignment-expression
25787 decl-specifier-seq ... [opt] abstract-declarator [opt]
25788 decl-specifier-seq abstract-declarator [opt] = assignment-expression
25790 The parser flags FLAGS is used to control type-specifier parsing.
25792 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
25793 declares a template parameter. (In that case, a non-nested `>'
25794 token encountered during the parsing of the assignment-expression
25795 is not interpreted as a greater-than operator.)
25797 Returns a representation of the parameter, or NULL if an error
25798 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
25799 true iff the declarator is of the form "(p)". */
25803 cp_parser_flags flags,
25806 {
25808 cp_decl_specifier_seq decl_specifiers;
25810 tree default_argument;
25815 /* In a template parameter, `>' is not an operator.
25817 [temp.param]
25819 When parsing a default template-argument for a non-type
25820 template-parameter, the first non-nested `>' is taken as the end
25821 of the template parameter-list rather than a greater-than
25822 operator. */
25824 /* Type definitions may not appear in parameter types. */
25826 parser->type_definition_forbidden_message
25833 /* Parse the declaration-specifiers. */
25840 /* [dcl.spec.auto.general]: "A placeholder-type-specifier of the form
25841 type-constraint opt auto can be used as a decl-specifier of the
25842 decl-specifier-seq of a parameter-declaration of a function declaration
25843 or lambda-expression..." but we must not synthesize an implicit template
25844 type parameter in its declarator. That is, in "void f(auto[auto{10}]);"
25845 we want to synthesize only the first auto. */
25849 /* Complain about missing 'typename' or other invalid type names. */
25854 /* If an error occurred, there's no reason to attempt to parse the
25855 rest of the declaration. */
25857 {
25860 }
25862 /* Peek at the next token. */
25865 /* If the next token is a `)', `,', `=', `>', or `...', then there
25866 is no declarator. However, when variadic templates are enabled,
25867 there may be a declarator following `...'. */
25872 {
25876 }
25877 /* Otherwise, there should be a declarator. */
25878 else
25879 {
25883 /* After seeing a decl-specifier-seq, if the next token is not a
25884 "(" or "{", there is no possibility that the code is a valid
25885 expression. Therefore, if parsing tentatively, we commit at
25886 this point. */
25888 /* In an expression context, having seen:
25890 (int((char ...
25892 we cannot be sure whether we are looking at a
25893 function-type (taking a "char" as a parameter) or a cast
25894 of some object of type "char" to "int". */
25898 {
25900 {
25903 /* This is a CTAD expression, not a parameter declaration. */
25905 }
25906 else
25908 }
25909 /* Parse the declarator. */
25912 CP_PARSER_DECLARATOR_EITHER,
25913 CP_PARSER_FLAGS_NONE,
25915 parenthesized_p,
25920 /* After the declarator, allow more attributes. */
25921 decl_specifiers.attributes
25925 /* If the declarator is a template parameter pack, remember that and
25926 clear the flag in the declarator itself so we don't get errors
25927 from grokdeclarator. */
25929 {
25932 }
25933 }
25935 /* If the next token is an ellipsis, and we have not seen a declarator
25936 name, and if either the type of the declarator contains parameter
25937 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
25938 for, eg, abbreviated integral type names), then we actually have a
25939 parameter pack expansion expression. Otherwise, leave the ellipsis
25940 for a C-style variadic function. */
25943 bool xobj_param_p
25946 {
25951 }
25953 /* If a function parameter pack was specified and an implicit template
25954 parameter was introduced during cp_parser_parameter_declaration,
25955 change any implicit parameters introduced into packs. */
25960 {
25965 decl_specifiers.type
25967 template_parm_idx,
25968 latest_template_parm_idx);
25969 }
25972 {
25983 {
25984 /* Consume the `...'. */
25988 /* Build a pack expansion type */
25993 else
25995 }
25996 }
26002 {
26003 location_t xobj_param
26006 input_location);
26008 "an explicit object parameter cannot "
26012 }
26014 /* The restriction on defining new types applies only to the type
26015 of the parameter, not to the default argument. */
26018 /* If the next token is `=', then process a default argument. */
26020 {
26023 /* Used for diagnostics with an xobj parameter. */
26027 /* If we are defining a class, then the tokens that make up the
26028 default argument must be saved and processed later. */
26034 /* A constrained-type-specifier may declare a type
26035 template-parameter. */
26037 default_argument
26040 /* A constrained-type-specifier may declare a
26041 template-template-parameter. */
26043 default_argument
26046 /* Outside of a class definition, we can just parse the
26047 assignment-expression. */
26048 else
26049 default_argument
26053 {
26055 "default arguments are only "
26057 }
26059 || template_parameter_pack_p
26062 {
26063 /* Find the name of the parameter pack. */
26070 template_parm_p
26076 else
26078 template_parm_p
26085 }
26086 }
26087 else
26094 {
26096 {
26097 /* If there is a default_argument, eq_token should always be set. */
26099 location_t param_with_init_loc
26102 input_location);
26104 "an explicit object parameter "
26106 }
26107 /* Xobj parameters can not have default arguments, thus
26108 we can reuse the default argument field to flag the param as such. */
26110 }
26112 /* Generate a location for the parameter, ranging from the start of the
26113 initial token to the end of the final token (using input_location for
26114 the latter, set up by cp_lexer_set_source_position_from_token when
26115 consuming tokens).
26117 If we have a identifier, then use it for the caret location, e.g.
26119 extern int callee (int one, int (*two)(int, int), float three);
26120 ~~~~~~^~~~~~~~~~~~~~
26122 otherwise, reuse the start location for the caret location e.g.:
26124 extern int callee (int one, int (*)(int, int), float three);
26125 ^~~~~~~~~~~~~~~~~
26127 */
26133 input_location);
26136 declarator,
26137 default_argument,
26138 param_loc,
26139 template_parameter_pack_p);
26140 }
26142 /* Parse a default argument and return it.
26144 TEMPLATE_PARM_P is true if this is a default argument for a
26145 non-type template parameter. */
26146 static tree
26148 {
26153 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
26154 set correctly. */
26161 /* Local variable names (and the `this' keyword) may not
26162 appear in a default argument. */
26165 /* Parse the assignment-expression. */
26170 /* The "this" pointer is not valid in a default argument. */
26172 {
26177 }
26179 /* Restore the "this" pointer. */
26181 {
26184 }
26193 }
26195 /* Parse a function-body.
26197 function-body:
26198 compound_statement */
26200 static void
26202 {
26206 }
26208 /* Parse a ctor-initializer-opt followed by a function-body. Return
26209 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
26210 is true we are parsing a function-try-block. */
26212 static void
26215 {
26217 const bool check_body_p
26225 {
26228 "function-try-block body of %<constexpr%> constructor only "
26230 else
26232 "function-try-block body of %<constexpr%> function only "
26234 }
26236 /* Begin the function body. */
26238 /* Parse the optional ctor-initializer. */
26241 /* If we're parsing a constexpr constructor definition, we need
26242 to check that the constructor body is indeed empty. However,
26243 before we get to cp_parser_function_body lot of junk has been
26244 generated, so we can't just check that we have an empty block.
26245 Rather we take a snapshot of the outermost block, and check whether
26246 cp_parser_function_body changed its state. */
26248 {
26252 }
26253 /* Parse the function-body. */
26257 /* Finish the function body. */
26259 }
26261 /* Parse an initializer.
26263 initializer:
26264 = initializer-clause
26265 ( expression-list )
26267 Returns an expression representing the initializer. If no
26268 initializer is present, NULL_TREE is returned.
26270 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
26271 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
26272 set to TRUE if there is no initializer present. If there is an
26273 initializer, and it is not a constant-expression, *NON_CONSTANT_P
26274 is set to true; otherwise it is set to false. */
26276 static tree
26279 {
26281 tree init;
26283 /* Peek at the next token. */
26286 /* Let our caller know whether or not this initializer was
26287 parenthesized. */
26290 /* Assume that the initializer is constant. */
26295 {
26296 /* Consume the `='. */
26298 /* Parse the initializer-clause. */
26300 }
26302 {
26307 non_constant_p);
26312 }
26314 {
26319 }
26320 else
26321 {
26322 /* Anything else is an error. */
26325 }
26331 }
26333 /* Parse an initializer-clause.
26335 initializer-clause:
26336 assignment-expression
26337 braced-init-list
26339 Returns an expression representing the initializer.
26341 If the `assignment-expression' production is used the value
26342 returned is simply a representation for the expression.
26344 Otherwise, calls cp_parser_braced_list. */
26346 static cp_expr
26348 {
26349 cp_expr initializer;
26351 /* Assume the expression is constant. */
26355 /* If it is not a `{', then we are looking at an
26356 assignment-expression. */
26358 {
26359 initializer
26362 non_constant_p);
26363 }
26364 else
26368 }
26370 /* Parse a brace-enclosed initializer list.
26372 braced-init-list:
26373 { initializer-list , [opt] }
26374 { designated-initializer-list , [opt] }
26375 { }
26377 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
26378 the elements of the initializer-list (or NULL, if the last
26379 production is used). The TREE_TYPE for the CONSTRUCTOR will be
26380 NULL_TREE. There is no way to detect whether or not the optional
26381 trailing `,' was provided. NON_CONSTANT_P is as for
26382 cp_parser_initializer. */
26384 static cp_expr
26386 {
26387 tree initializer;
26391 /* Consume the `{' token. */
26392 matching_braces braces;
26394 /* Create a CONSTRUCTOR to represent the braced-initializer. */
26396 /* If it's not a `}', then there is a non-trivial initializer. */
26398 {
26400 /* Parse the initializer list. */
26404 /* A trailing `,' token is allowed. */
26407 }
26410 /* Now, there should be a trailing `}'. */
26417 /* Build a location of the form:
26418 { ... }
26419 ^~~~~~~
26420 with caret==start at the open brace, finish at the close brace. */
26424 }
26426 /* Consume tokens up to, but not including, the next non-nested closing `]'.
26427 Returns true iff we found a closing `]'. */
26429 static bool
26431 {
26435 {
26439 {
26443 /* FALLTHRU */
26446 /* If we've run out of tokens, then there is no closing `]'. */
26460 }
26462 /* Consume the current token, skipping it. */
26464 }
26465 }
26467 /* Consume tokens up to, and including, the next non-nested closing `]'.
26468 Returns true iff we found a closing `]'. */
26470 static bool
26472 {
26477 }
26479 /* Return true if we are looking at an array-designator, false otherwise. */
26481 static bool
26483 {
26484 /* Consume the `['. */
26489 /* Skip tokens until the next token is a closing square bracket.
26490 If we find the closing `]', and the next token is a `=', then
26491 we are looking at an array designator. */
26492 bool array_designator_p
26496 /* Roll back the tokens we skipped. */
26500 }
26502 /* Parse an initializer-list.
26504 initializer-list:
26505 initializer-clause ... [opt]
26506 initializer-list , initializer-clause ... [opt]
26508 C++20 Extension:
26510 designated-initializer-list:
26511 designated-initializer-clause
26512 designated-initializer-list , designated-initializer-clause
26514 designated-initializer-clause:
26515 designator brace-or-equal-initializer
26517 designator:
26518 . identifier
26520 GNU Extension:
26522 initializer-list:
26523 designation initializer-clause ...[opt]
26524 initializer-list , designation initializer-clause ...[opt]
26526 designation:
26527 . identifier =
26528 identifier :
26529 [ constant-expression ] =
26531 Returns a vec of constructor_elt. The VALUE of each elt is an expression
26532 for the initializer. If the INDEX of the elt is non-NULL, it is the
26533 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
26534 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
26535 are any designators. */
26540 {
26545 /* Assume all of the expressions are constant. */
26552 /* Parse the rest of the list. */
26554 {
26556 tree designator;
26557 tree initializer;
26562 /* Handle the C++20 syntax, '. id ='. */
26570 {
26573 "C++ designated initializers only available with "
26575 /* Consume the `.'. */
26577 /* Consume the identifier. */
26580 /* Consume the `='. */
26582 else
26584 }
26585 /* Also, if the next token is an identifier and the following one is a
26586 colon, we are looking at the GNU designated-initializer
26587 syntax. */
26592 {
26593 /* Warn the user that they are using an extension. */
26596 /* Consume the identifier. */
26598 /* Consume the `:'. */
26600 }
26601 /* Also handle C99 array designators, '[ const ] ='. */
26605 {
26606 /* In C++11, [ could start a lambda-introducer. */
26612 {
26615 }
26616 else
26617 {
26622 }
26627 && (!require_potential_rvalue_constant_expression
26631 /* Warn the user that they are using an extension. */
26634 }
26635 else
26639 {
26642 }
26646 {
26650 }
26654 /* Parse the initializer. */
26657 ? &clause_non_constant_p
26659 /* If any clause is non-constant, so is the entire initializer. */
26664 /* This uses |= rather than = because C_I_D_I could have been set in
26665 cp_parser_functional_cast so we must be careful not to clear the
26666 flag. */
26669 /* If we have an ellipsis, this is an initializer pack
26670 expansion. */
26672 {
26675 /* Consume the `...'. */
26682 /* Turn the initializer into an initializer expansion. */
26684 }
26686 /* Add it to the vector. */
26689 /* If the next token is not a comma, we have reached the end of
26690 the list. */
26694 /* Peek at the next token. */
26696 /* If the next token is a `}', then we're still done. An
26697 initializer-clause can have a trailing `,' after the
26698 initializer-list and before the closing `}'. */
26702 /* Suppress location wrappers in a long initializer to save memory
26703 (14179). The cutoff is chosen arbitrarily. */
26707 /* Look one level down because it's easy. Looking deeper would require
26708 passing down a nelts pointer, and I don't think multi-level massive
26709 initializers are common enough to justify this. */
26715 /* Consume the `,' token. */
26717 }
26719 /* The same identifier shall not appear in multiple designators
26720 of a designated-initializer-list. */
26722 {
26727 {
26729 {
26731 "%<.%s%> designator used multiple times in "
26735 }
26736 else
26738 }
26742 }
26748 }
26750 /* Classes [gram.class] */
26752 /* Parse a class-name.
26754 class-name:
26755 identifier
26756 template-id
26758 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
26759 to indicate that names looked up in dependent types should be
26760 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
26761 keyword has been used to indicate that the name that appears next
26762 is a template. TAG_TYPE indicates the explicit tag given before
26763 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
26764 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
26765 is the class being defined in a class-head. If ENUM_OK is TRUE,
26766 enum-names are also accepted.
26768 Returns the TYPE_DECL representing the class. */
26770 static tree
26779 {
26780 tree decl;
26783 /* All class-names start with an identifier. */
26786 {
26789 }
26791 /* PARSER->SCOPE can be cleared when parsing the template-arguments
26792 to a template-id, so we save it here. Consider object scope too,
26793 so that make_typename_type below can use it (cp_parser_template_name
26794 considers object scope also). This may happen with code like
26796 p->template A<T>::a()
26798 where we first want to look up A<T>::a in the class of the object
26799 expression, as per [basic.lookup.classref]. */
26801 /* This only checks parser->scope to avoid duplicate errors; if
26802 ->object_type is erroneous, go on to give a parse error. */
26806 /* Any name names a type if we're following the `typename' keyword
26807 in a qualified name where the enclosing scope is type-dependent. */
26812 /* Handle the common case (an identifier, but not a template-id)
26813 efficiently. */
26816 {
26820 /* Look for the identifier. */
26824 /* If the next token isn't an identifier, we are certainly not
26825 looking at a class-name. */
26828 /* If we know this is a type-name, there's no need to look it
26829 up. */
26832 else
26833 {
26834 tree ambiguous_decls;
26835 /* If we already know that this lookup is ambiguous, then
26836 we've already issued an error message; there's no reason
26837 to check again. */
26839 {
26842 }
26843 /* If the next token is a `::', then the name must be a type
26844 name.
26846 [basic.lookup.qual]
26848 During the lookup for a name preceding the :: scope
26849 resolution operator, object, function, and enumerator
26850 names are ignored. */
26853 /* Look up the name. */
26855 tag_type,
26858 check_dependency_p,
26862 {
26866 }
26867 }
26868 }
26869 else
26870 {
26871 /* Try a template-id. */
26873 check_dependency_p,
26874 tag_type,
26875 is_declaration);
26878 }
26882 /* If this is a typename, create a TYPENAME_TYPE. */
26884 {
26889 }
26893 /* Check to see that it is really the name of a class. */
26897 /* Situations like this:
26899 template <typename T> struct A {
26900 typename T::template X<int>::I i;
26901 };
26903 are problematic. Is `T::template X<int>' a class-name? The
26904 standard does not seem to be definitive, but there is no other
26905 valid interpretation of the following `::'. Therefore, those
26906 names are considered class-names. */
26907 {
26911 }
26916 /* In Objective-C 2.0, a classname followed by '.' starts a
26917 dot-syntax expression, and it's not a type-name. */
26929 }
26931 /* Make sure that any member-function parameters are in scope.
26932 For instance, a function's noexcept-specifier can use the function's
26933 parameters:
26935 struct S {
26936 void fn (int p) noexcept(noexcept(p));
26937 };
26939 so we need to make sure name lookup can find them. This is used
26940 when we delay parsing of the noexcept-specifier. */
26942 static void
26944 {
26951 {
26955 }
26956 }
26958 /* Undo the effects of inject_parm_decls. */
26960 static void
26962 {
26965 }
26967 /* Parse a class-specifier.
26969 class-specifier:
26970 class-head { member-specification [opt] }
26972 Returns the TREE_TYPE representing the class. */
26974 tree
26976 {
26979 tree type;
26994 /* Parse the class-head. */
26997 /* If the class-head was a semantic disaster, skip the entire body
26998 of the class. */
27000 {
27004 }
27006 /* Look for the `{'. */
27007 matching_braces braces;
27009 {
27012 }
27017 /* Issue an error message if type-definitions are forbidden here. */
27019 /* Remember that we are defining one more class. */
27021 /* Inside the class, surrounding template-parameter-lists do not
27022 apply. */
27023 saved_num_template_parameter_lists
27026 /* We are not in a function body. */
27029 /* Or in a loop. */
27032 /* Or in a switch. */
27035 /* We are not immediately inside an extern "lang" block. */
27036 saved_in_unbraced_linkage_specification_p
27039 /* Or in an export-declaration. */
27040 saved_in_unbraced_export_declaration_p
27043 /* 'this' from an enclosing non-static member function is unavailable. */
27049 /* Start the class. */
27051 {
27053 /* SCOPE must be a scope nested inside current scope. */
27057 else
27059 }
27063 /* If the type is erroneous, skip the entire body of the class. */
27065 else
27066 /* Parse the member-specification. */
27069 /* Look for the trailing `}'. */
27071 /* Look for trailing attributes to apply to this class. */
27079 /* We've finished a type definition. Check for the common syntax
27080 error of forgetting a semicolon after the definition. We need to
27081 be careful, as we can't just check for not-a-semicolon and be done
27082 with it; the user might have typed:
27084 class X { } c = ...;
27085 class X { } *p = ...;
27087 and so forth. Instead, enumerate all the possible tokens that
27088 might follow this production; if we don't see one of them, then
27089 complain and silently insert the semicolon. */
27090 {
27095 /* Don't try to parse c++11 attributes here. As per the
27096 grammar, that should be a task for
27097 cp_parser_decl_specifier_seq. */
27101 {
27113 /* While it's legal for type qualifiers and storage class
27114 specifiers to follow type definitions in the grammar, only
27115 compiler testsuites contain code like that. Assume that if
27116 we see such code, then what we're really seeing is a case
27117 like:
27119 class X { }
27120 const <type> var = ...;
27122 or
27124 class Y { }
27125 static <type> func (...) ...
27127 i.e. the qualifier or specifier applies to the next
27128 declaration. To do so, however, we need to look ahead one
27129 more token to see if *that* token is a type specifier.
27131 This code could be improved to handle:
27133 class Z { }
27134 static const <type> var = ...; */
27137 {
27140 /* Handling user-defined types here would be nice, but very
27141 tricky. */
27142 want_semicolon
27145 }
27149 }
27151 /* If we don't have a type, then something is very wrong and we
27152 shouldn't try to do anything clever. Likewise for not seeing the
27153 closing brace. */
27155 {
27156 /* Locate the closing brace. */
27157 cp_token_position prev
27162 /* We want to suggest insertion of a ';' immediately *after* the
27163 closing brace, so, if we can, offset the location by 1 column. */
27170 /* If we successfully offset the location, suggest the fix-it. */
27183 else
27186 /* Unget one token and smash it to look as though we encountered
27187 a semicolon in the input stream. */
27192 }
27193 }
27195 /* If this class is not itself within the scope of another class,
27196 then we need to parse the bodies of all of the queued function
27197 definitions. Note that the queued functions defined in a class
27198 are not always processed immediately following the
27199 class-specifier for that class. Consider:
27201 struct A {
27202 struct B { void f() { sizeof (A); } };
27203 };
27205 If `f' were processed before the processing of `A' were
27206 completed, there would be no way to compute the size of `A'.
27207 Note that the nesting we are interested in here is lexical --
27208 not the semantic nesting given by TYPE_CONTEXT. In particular,
27209 for:
27211 struct A { struct B; };
27212 struct A::B { void f() { } };
27214 there is no need to delay the parsing of `A::B::f'. */
27216 {
27217 tree decl;
27224 {
27225 /* Skip default arguments, NSDMIs, etc, in order to improve
27226 error recovery (c++/71169, c++/71832). */
27230 }
27232 /* In a first pass, parse default arguments to the functions.
27233 Then, in a second pass, parse the bodies of the functions.
27234 This two-phased approach handles cases like:
27236 struct S {
27237 void f() { g(); }
27238 void g(int i = 3);
27239 };
27241 */
27243 {
27245 /* If there are default arguments that have not yet been processed,
27246 take care of them now. */
27248 {
27253 }
27254 /* Make sure that any template parameters are in scope. */
27256 /* Parse the default argument expressions. */
27258 /* Remove any template parameters from the symbol table. */
27260 }
27263 /* If there are noexcept-specifiers that have not yet been processed,
27264 take care of them now. Do this before processing NSDMIs as they
27265 may depend on noexcept-specifiers already having been processed. */
27267 {
27270 {
27275 }
27280 /* Make sure that any template parameters are in scope. */
27283 /* Make sure that any member-function parameters are in scope.
27284 This function doesn't expect ccp to be set. */
27288 /* 'this' is not allowed in static member functions. */
27289 unsigned char local_variables_forbidden_p
27294 /* Now we can parse the noexcept-specifier. */
27300 /* Update the fn's type directly -- it might have escaped
27301 beyond this decl :( */
27303 /* Update any instantiations we've already created. We must
27304 keep the new noexcept-specifier wrapped in a DEFERRED_NOEXCEPT
27305 so that maybe_instantiate_noexcept can tsubst the NOEXCEPT_EXPR
27306 in the pattern. */
27311 /* Restore the state of local_variables_forbidden_p. */
27314 /* The finish_struct call above performed various override checking,
27315 but it skipped unparsed noexcept-specifier operands. Now that we
27316 have resolved them, check again. */
27319 /* Remove any member-function parameters from the symbol table. */
27322 /* Remove any template parameters from the symbol table. */
27324 }
27327 /* Now parse any NSDMIs. */
27329 {
27332 {
27337 }
27340 }
27343 /* Now contract attributes. */
27345 {
27348 {
27353 }
27357 /* Make sure that any template parameters are in scope. */
27360 /* Make sure that any member-function parameters are in scope.
27361 This function doesn't expect ccp to be set. */
27365 /* 'this' is not allowed in static member functions. */
27366 unsigned char local_variables_forbidden_p
27371 /* Now we can parse contract conditions. */
27373 {
27376 }
27378 /* Restore the state of local_variables_forbidden_p. */
27381 /* Remove any member-function parameters from the symbol table. */
27384 /* Remove any template parameters from the symbol table. */
27387 /* Perform any deferred contract matching. */
27389 }
27397 /* Now parse the body of the functions. */
27399 {
27400 /* OpenMP UDRs need to be parsed before all other functions. */
27407 }
27408 else
27412 }
27414 /* Put back any saved access checks. */
27417 /* Restore saved state. */
27421 parser->num_template_parameter_lists
27423 parser->in_unbraced_linkage_specification_p
27425 parser->in_unbraced_export_declaration_p
27431 }
27433 /* Parse a class-head.
27435 class-head:
27436 class-key identifier [opt] base-clause [opt]
27437 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
27438 class-key nested-name-specifier [opt] template-id
27439 base-clause [opt]
27441 class-virt-specifier:
27442 final
27444 GNU Extensions:
27445 class-key attributes identifier [opt] base-clause [opt]
27446 class-key attributes nested-name-specifier identifier base-clause [opt]
27447 class-key attributes nested-name-specifier [opt] template-id
27448 base-clause [opt]
27450 Upon return BASES is initialized to the list of base classes (or
27451 NULL, if there are none) in the same form returned by
27452 cp_parser_base_clause.
27454 Returns the TYPE of the indicated class. Sets
27455 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
27456 involving a nested-name-specifier was used, and FALSE otherwise.
27458 Returns error_mark_node if this is not a class-head.
27460 Returns NULL_TREE if the class-head is syntactically valid, but
27461 semantically invalid in a way that means we should skip the entire
27462 body of the class. */
27464 static tree
27467 {
27468 tree nested_name_specifier;
27472 tree attributes;
27473 tree bases;
27483 /* Assume no nested-name-specifier will be present. */
27485 /* Assume no template parameter lists will be used in defining the
27486 type. */
27490 /* Look for the class-key. */
27497 /* Parse the attributes. */
27502 /* If the next token is `::', that is invalid -- but sometimes
27503 people do try to write:
27505 struct ::S {};
27507 Handle this gracefully by accepting the extra qualifier, and then
27508 issuing an error about it later if this really is a
27509 class-head. If it turns out just to be an elaborated type
27510 specifier, remain silent. */
27514 /* It is OK to define an inaccessible class; for example:
27516 class A { class B; };
27517 class A::B {};
27519 So we want to ignore access when parsing the class name.
27520 However, we might be tentatively parsing what is really an
27521 elaborated-type-specifier naming a template-id, e.g.
27523 struct C<&D::m> c;
27525 In this case the tentative parse as a class-head will fail, but not
27526 before cp_parser_template_id splices in a CPP_TEMPLATE_ID token.
27527 Since dk_no_check is sticky, we must instead use dk_deferred so that
27528 any such CPP_TEMPLATE_ID token created during this tentative parse
27529 will correctly capture the access checks imposed by the template-id . */
27532 /* Determine the name of the class. Begin by looking for an
27533 optional nested-name-specifier. */
27535 nested_name_specifier
27541 /* If there was a nested-name-specifier, then there *must* be an
27542 identifier. */
27547 {
27549 /* Although the grammar says `identifier', it really means
27550 `class-name' or `template-name'. You are only allowed to
27551 define a class that has already been declared with this
27552 syntax.
27554 The proposed resolution for Core Issue 180 says that wherever
27555 you see `class T::X' you should treat `X' as a type-name.
27557 We do not know if we will see a class-name, or a
27558 template-name. We look for a class-name first, in case the
27559 class-name is a template-id; if we looked for the
27560 template-name first we would stop after the template-name. */
27567 class_type,
27571 /* If that didn't work, ignore the nested-name-specifier. */
27573 {
27579 }
27580 /* If we could not find a corresponding TYPE, treat this
27581 declaration like an unqualified declaration. */
27584 /* Otherwise, count the number of templates used in TYPE and its
27585 containing scopes. */
27586 else
27588 }
27589 /* Otherwise, the identifier is optional. */
27590 else
27591 {
27592 /* We don't know whether what comes next is a template-id,
27593 an identifier, or nothing at all. */
27595 /* Check for a template-id. */
27600 class_key,
27602 /* If that didn't work, it could still be an identifier. */
27604 {
27606 {
27609 }
27610 else
27612 }
27613 else
27614 {
27617 }
27618 }
27623 {
27625 class_key,
27627 }
27630 /* If it's not a `:' or a `{' then we can't really be looking at a
27631 class-head, since a class-head only appears as part of a
27632 class-specifier. We have to detect this situation before calling
27633 xref_tag, since that has irreversible side-effects. */
27635 {
27639 }
27641 /* At this point, we're going ahead with the class-specifier, even
27642 if some other problem occurs. */
27645 {
27650 }
27651 /* Issue the error about the overly-qualified name now. */
27653 {
27658 }
27660 {
27665 }
27667 {
27668 tree scope;
27671 /* [temp.names]: in a qualified-id formed by a class-head-name, the
27672 keyword template shall not appear at the top level. */
27676 /* Reject typedef-names in class heads. */
27678 {
27681 type);
27684 }
27686 /* Figure out in what scope the declaration is being placed. */
27688 /* If that scope does not contain the scope in which the
27689 class was originally declared, the program is invalid. */
27691 {
27694 "declaration of %qD in namespace %qD which does not "
27697 else
27703 }
27704 /* [dcl.meaning]
27706 A declarator-id shall not be qualified except for the
27707 definition of a ... nested class outside of its class
27708 ... [or] the definition or explicit instantiation of a
27709 class member of a namespace outside of its namespace. */
27713 }
27714 /* The name-declaration of an export-declaration shall not declare
27715 a partial specialization. */
27718 && !processing_specialization
27720 {
27721 auto_diagnostic_group d;
27727 }
27728 /* An explicit-specialization must be preceded by "template <>". If
27729 it is not, try to recover gracefully. */
27732 && !processing_template_parmlist
27734 {
27735 /* Build a location of this form:
27736 struct typename <ARGS>
27737 ^~~~~~~~~~~~~~~~~~~~~~
27738 with caret==start at the start token, and
27739 finishing at the end of the type. */
27740 location_t reported_loc
27742 class_head_start_location,
27748 "an explicit specialization must be preceded by"
27751 /* Take the same action that would have been taken by
27752 cp_parser_explicit_specialization. */
27755 }
27756 /* There must be no "return" statements between this point and the
27757 end of this function; set "type "to the correct return value and
27758 use "goto done;" to return. */
27759 /* Make sure that the right number of template parameters were
27760 present. */
27762 template_id_p,
27765 {
27766 /* If something went wrong, there is no point in even trying to
27767 process the class-definition. */
27770 }
27772 /* Look up the type. */
27774 {
27778 {
27782 }
27783 else
27784 {
27788 /* Check the scope while we still know whether or not we had a
27789 nested-name-specifier. */
27792 }
27795 }
27797 {
27800 /* Given:
27802 template <typename T> struct S { struct T };
27803 template <typename T> struct S<T>::T { };
27805 we will get a TYPENAME_TYPE when processing the definition of
27806 `S::T'. We need to resolve it to the actual type before we
27807 try to define it. */
27809 {
27812 {
27815 }
27816 }
27820 {
27823 }
27825 /* Enter the scope indicated by the nested-name-specifier. */
27827 /* Get the canonical version of this type. */
27829 /* Call push_template_decl if it seems like we should be defining a
27830 template either from the template headers or the type we're
27831 defining, so that we diagnose both extra and missing headers. */
27835 {
27838 {
27841 }
27842 }
27846 }
27848 {
27849 /* If the class was unnamed, create a dummy name. */
27857 }
27859 /* Diagnose class/struct/union mismatches. */
27863 /* Indicate whether this class was declared as a `class' or as a
27864 `struct'. */
27868 /* If this type was already complete, and we see another definition,
27869 that's an error. Likewise if the type is already being defined:
27870 this can happen, eg, when it's defined from within an expression
27871 (c++/84605). */
27874 {
27876 type);
27878 type);
27881 }
27886 {
27889 {
27890 /* In a lambda this should work, but doesn't currently. */
27893 }
27895 /* Apply attributes now, before any use of the class as a template
27896 argument in its base list. */
27899 }
27901 /* Associate constraints with the type. */
27905 /* We will have entered the scope containing the class; the names of
27906 base classes should be looked up in that context. For example:
27908 struct A { struct B {}; struct C; };
27909 struct A::C : B {};
27911 is valid. */
27913 /* Get the list of base-classes, if there is one. Defer access checking
27914 until the entire list has been seen, as per [class.access.general]. */
27917 {
27919 {
27922 }
27925 {
27928 }
27929 }
27930 else
27933 /* If we're really defining a class, process the base classes.
27934 If they're invalid, fail. */
27938 /* Now that all bases have been seen and attached to the class, check
27939 accessibility of the types named in the base-clause. This must be
27940 done relative to the class scope, so that we accept e.g.
27942 struct A { protected: struct B {}; };
27943 struct C : A::B, A {}; // OK: A::B is accessible via base A
27945 as per [class.access.general]. */
27952 done:
27953 /* Leave the scope given by the nested-name-specifier. We will
27954 enter the class scope itself while processing the members. */
27959 {
27962 }
27968 out:
27971 }
27973 /* Parse a class-key.
27975 class-key:
27976 class
27977 struct
27978 union
27980 Returns the kind of class-key specified, or none_type to indicate
27981 error. */
27983 static enum tag_types
27985 {
27989 /* Look for the class-key. */
27994 /* Check to see if the TOKEN is a class-key. */
27999 }
28001 /* Parse a type-parameter-key.
28003 type-parameter-key:
28004 class
28005 typename
28006 */
28008 static void
28010 {
28011 /* Look for the type-parameter-key. */
28015 {
28019 /* typename is not allowed in a template template parameter
28020 by the standard until C++17. */
28022 "ISO C++ forbids typename key in template template parameter;"
28024 }
28025 else
28029 }
28031 /* Parse an (optional) member-specification.
28033 member-specification:
28034 member-declaration member-specification [opt]
28035 access-specifier : member-specification [opt] */
28037 static void
28039 {
28041 {
28045 /* Peek at the next token. */
28047 /* If it's a `}', or EOF then we've seen all the members. */
28053 /* See if this token is a keyword. */
28056 {
28060 /* Consume the access-specifier. */
28062 /* Remember which access-specifier is active. */
28064 /* Look for the `:'. */
28069 /* Accept #pragmas at class scope. */
28071 {
28074 }
28076 /* Otherwise, the next construction must be a
28077 member-declaration. */
28079 }
28080 }
28081 }
28083 /* Parse a member-declaration.
28085 member-declaration:
28086 decl-specifier-seq [opt] member-declarator-list [opt] ;
28087 function-definition ; [opt]
28088 :: [opt] nested-name-specifier template [opt] unqualified-id ;
28089 using-declaration
28090 template-declaration
28091 alias-declaration
28093 member-declarator-list:
28094 member-declarator
28095 member-declarator-list , member-declarator
28097 member-declarator:
28098 declarator pure-specifier [opt]
28099 declarator constant-initializer [opt]
28100 identifier [opt] : constant-expression
28102 GNU Extensions:
28104 member-declaration:
28105 __extension__ member-declaration
28107 member-declarator:
28108 declarator attributes [opt] pure-specifier [opt]
28109 declarator attributes [opt] constant-initializer [opt]
28110 identifier [opt] attributes [opt] : constant-expression
28112 C++0x Extensions:
28114 member-declaration:
28115 static_assert-declaration */
28117 static void
28119 {
28120 cp_decl_specifier_seq decl_specifiers;
28121 tree prefix_attributes;
28122 tree decl;
28131 /* Check for the `__extension__' keyword. */
28133 {
28134 /* Recurse. */
28136 /* Restore the old value of the PEDANTIC flag. */
28140 }
28142 /* Check for a template-declaration. */
28144 {
28145 /* An explicit specialization here is an error condition, and we
28146 expect the specialization handler to detect and report this. */
28150 else
28154 }
28155 /* Check for a template introduction. */
28159 /* Check for a using-declaration. */
28161 {
28163 /* Parse the using-declaration. */
28167 else
28168 {
28169 tree decl;
28173 /* Note that if we actually see the '=' token after the
28174 identifier, cp_parser_alias_declaration commits the
28175 tentative parse. In that case, we really expect an
28176 alias-declaration. Otherwise, we expect a using
28177 declaration. */
28178 alias_decl_expected =
28184 else
28187 }
28189 }
28191 /* Check for @defs. */
28193 {
28198 {
28203 }
28205 }
28207 /* If the next token is `static_assert' we have a static assertion. */
28209 {
28212 }
28216 cp_omp_declare_simd_data odsd;
28220 /* Parse the decl-specifier-seq. */
28223 (CP_PARSER_FLAGS_OPTIONAL
28233 /* Check for an invalid type-name. */
28237 /* If there is no declarator, then the decl-specifier-seq should
28238 specify a type. For C++26 Variadic friends don't just check for
28239 a semicolon, but also for a comma and in both cases optionally
28240 preceded by ellipsis. */
28248 CPP_COMMA))))))
28249 {
28250 /* If there was no decl-specifier-seq, and the next token is a
28251 `;', then we have something like:
28253 struct S { ; };
28255 [class.mem] used to say
28257 Each member-declaration shall declare at least one member
28258 name of the class.
28260 but since DR 1693:
28262 A member-declaration does not declare new members of the class
28263 if it is
28264 -- [...]
28265 -- an empty-declaration.
28266 For any other member-declaration, each declared entity that is not
28267 an unnamed bit-field is a member of the class, and each such
28268 member-declaration shall either declare at least one member name of
28269 the class or declare at least one unnamed bit-field. */
28271 {
28274 }
28275 else
28276 {
28277 /* See if this declaration is a friend. */
28279 /* If there were decl-specifiers, check to see if there was
28280 a class-declaration. */
28283 /* Nested classes have already been added to the class, but
28284 a `friend' needs to be explicitly registered. */
28286 {
28287 /* If the `friend' keyword was present, the friend must
28288 be introduced with a class-key. */
28291 "in C++03 a class-key must be used "
28296 OPT_Wc__26_extensions,
28297 "variadic friends or friend type declarations with "
28298 "multiple types only available with "
28301 do
28302 {
28303 /* In this case:
28305 template <typename T> struct A {
28306 friend struct A<T>::B;
28307 };
28309 A<T>::B will be represented by a TYPENAME_TYPE, and
28310 therefore not recognized by check_tag_decl. */
28312 {
28316 }
28317 /* Warn if an attribute cannot appear here, as per
28318 [dcl.attr.grammar]/5. But not when
28319 declares_class_or_enum: we ignore attributes in
28320 elaborated-type-specifiers. */
28323 {
28328 "that appertains to a friend declaration that "
28330 }
28332 CPP_ELLIPSIS);
28337 "friend declaration does not name a class or "
28339 else
28340 {
28346 }
28355 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
28360 /*explicit_type_instantiation_p=*/
28362 }
28364 }
28365 /* If there is no TYPE, an error message will already have
28366 been issued. */
28368 ;
28369 /* An anonymous aggregate has to be handled specially; such
28370 a declaration really declares a data member (with a
28371 particular type), as opposed to a nested class. */
28373 {
28374 /* C++11 9.5/6. */
28377 "a storage class on an anonymous aggregate "
28380 /* Remove constructors and such from TYPE, now that we
28381 know it is an anonymous aggregate. */
28383 /* And make the corresponding data member. */
28386 /* Add it to the class. */
28388 }
28389 else
28390 cp_parser_check_access_in_redeclaration
28393 }
28394 }
28395 else
28396 {
28399 /* Clear attributes from the decl_specifiers but keep them
28400 around as prefix attributes that apply them to the entity
28401 being declared. */
28409 /* See if these declarations will be friends. */
28412 /* Keep going until we hit the `;' at the end of the
28413 declaration. */
28415 {
28417 tree first_attribute;
28418 tree initializer;
28421 /* Peek at the next token. */
28424 /* The following code wants to know early if it is a bit-field
28425 or some other declaration. Attributes can appear before
28426 the `:' token. Skip over them without consuming any tokens
28427 to peek if they are followed by `:'. */
28432 {
28433 size_t n
28436 }
28438 /* Check for a bitfield declaration. */
28444 {
28445 tree identifier;
28446 tree width;
28448 location_t id_location
28453 else
28456 /* Look for attributes that apply to the bitfield. */
28459 /* Consume the `:' token. */
28462 /* Get the width of the bitfield. */
28466 /* In C++20 and as extension for C++11 and above we allow
28467 default member initializers for bit-fields. */
28472 CPP_OPEN_BRACE)))
28473 {
28474 location_t loc
28479 "default member initializers for bit-fields "
28480 "only available with %<-std=c++20%> or "
28485 {
28489 }
28490 }
28491 else
28492 {
28493 /* Look for attributes that apply to the bitfield after
28494 the `:' token and width. This is where GCC used to
28495 parse attributes in the past, pedwarn if there is
28496 a std attribute. */
28499 "ISO C++ allows bit-field attributes only "
28503 }
28507 /* Remember which attributes are prefix attributes and
28508 which are not. */
28510 /* Combine the attributes. */
28513 /* Create the bitfield declaration. */
28516 identifier,
28517 sfk_none,
28518 id_location)
28522 attributes);
28523 }
28524 else
28525 {
28527 tree asm_specification;
28531 /* We can't delay parsing for friends,
28532 alias-declarations, and typedefs, even though the
28533 standard seems to require it. */
28538 /* Parse the declarator. */
28539 declarator
28541 flags,
28547 /* If something went wrong parsing the declarator, make sure
28548 that we at least consume some tokens. */
28550 {
28551 /* Skip to the end of the statement. */
28553 /* If the next token is not a semicolon, that is
28554 probably because we just skipped over the body of
28555 a function. So, we consume a semicolon if
28556 present, but do not issue an error message if it
28557 is not present. */
28559 CPP_SEMICOLON))
28562 }
28564 /* Handle class-scope non-template C++17 deduction guides. */
28567 declarator,
28571 cp_parser_check_for_definition_in_return_type
28575 /* Look for an asm-specification. */
28577 /* Look for attributes that apply to the declaration. */
28579 /* Remember which attributes are prefix attributes and
28580 which are not. */
28582 /* Combine the attributes. */
28585 /* If it's an `=', then we have a constant-initializer or a
28586 pure-specifier. It is not correct to parse the
28587 initializer before registering the member declaration
28588 since the member declaration should be in scope while
28589 its initializer is processed. However, the rest of the
28590 front end does not yet provide an interface that allows
28591 us to handle this correctly. */
28593 {
28594 /* In [class.mem]:
28596 A pure-specifier shall be used only in the declaration of
28597 a virtual function.
28599 A member-declarator can contain a constant-initializer
28600 only if it declares a static member of integral or
28601 enumeration type.
28603 Therefore, if the DECLARATOR is for a function, we look
28604 for a pure-specifier; otherwise, we look for a
28605 constant-initializer. When we call `grokfield', it will
28606 perform more stringent semantics checks. */
28619 {
28620 /* Don't require a constant rvalue in C++11, since we
28621 might want a reference constant. We'll enforce
28622 constancy later. */
28624 /* Parse the initializer. */
28626 }
28627 else
28628 /* Parse the initializer. */
28630 }
28633 {
28634 declarator->init_loc
28638 else
28640 }
28641 /* Detect invalid bit-field cases such as
28643 int *p : 4;
28644 int &&r : 3;
28646 and similar. */
28648 /* If there were no type specifiers, it was a
28649 constructor. */
28651 {
28652 /* This is called for a decent diagnostic only. */
28661 /* Avoid "extra ;" pedwarns. */
28663 CPP_SEMICOLON))
28666 }
28667 /* Otherwise, there is no initializer. */
28668 else
28671 /* See if we are probably looking at a function
28672 definition. We are certainly not looking at a
28673 member-declarator. Calling `grokfield' has
28674 side-effects, so we must not do it unless we are sure
28675 that we are looking at a member-declarator. */
28678 {
28679 /* The grammar does not allow a pure-specifier to be
28680 used when a member function is defined. (It is
28681 possible that this fact is an oversight in the
28682 standard, since a pure function may be defined
28683 outside of the class-specifier. */
28689 declarator,
28690 attributes);
28694 /* If the member was not a friend, declare it here. */
28697 /* Peek at the next token. */
28699 /* If the next token is a semicolon, consume it. */
28701 {
28702 location_t semicolon_loc
28706 }
28708 }
28709 else
28713 /* Create the declaration. */
28719 {
28722 else
28724 }
28725 }
28730 /* Reset PREFIX_ATTRIBUTES. */
28732 {
28737 }
28739 /* If there is any qualification still in effect, clear it
28740 now; we will be starting fresh with the next declarator. */
28744 /* If it's a `,', then there are more declarators. */
28746 {
28749 {
28755 }
28756 }
28757 /* If the next token isn't a `;', then we have a parse error. */
28759 CPP_SEMICOLON))
28760 {
28761 /* The next token might be a ways away from where the
28762 actual semicolon is missing. Find the previous token
28763 and use that for our error position. */
28770 /* Assume that the user meant to provide a semicolon. If
28771 we were to cp_parser_skip_to_end_of_statement, we might
28772 skip to a semicolon inside a member function definition
28773 and issue nonsensical error messages. */
28775 }
28778 {
28779 /* Add DECL to the list of members. */
28781 /* Explicitly include, eg, NSDMIs, for better error
28782 recovery (c++/58650). */
28790 /* Add DECL to the queue of NSDMI to be parsed later. */
28792 }
28796 }
28797 }
28800 out:
28803 }
28805 /* Parse a pure-specifier.
28807 pure-specifier:
28808 = 0
28810 Returns INTEGER_ZERO_NODE if a pure specifier is found.
28811 Otherwise, ERROR_MARK_NODE is returned. */
28813 static tree
28815 {
28818 /* Look for the `=' token. */
28821 /* Look for the `0' token. */
28830 /* Accept = default or = delete in c++0x mode. */
28833 {
28836 {
28839 OPT_Wc__26_extensions,
28840 "%<delete%> reason only available with "
28843 /* Consume the `('. */
28844 matching_parens parens;
28847 /* Consume the `)'. */
28850 {
28853 }
28854 }
28857 }
28859 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
28861 {
28866 }
28868 {
28871 }
28874 }
28876 /* Parse a constant-initializer.
28878 constant-initializer:
28879 = constant-expression
28881 Returns a representation of the constant-expression. */
28883 static tree
28885 {
28886 /* Look for the `=' token. */
28890 /* It is invalid to write:
28892 struct S { static const int i = { 7 }; };
28894 */
28896 {
28899 /* Consume the opening brace. */
28900 matching_braces braces;
28902 /* Skip the initializer. */
28904 /* Look for the trailing `}'. */
28908 }
28911 }
28913 /* Derived classes [gram.class.derived] */
28915 /* Parse a base-clause.
28917 base-clause:
28918 : base-specifier-list
28920 base-specifier-list:
28921 base-specifier ... [opt]
28922 base-specifier-list , base-specifier ... [opt]
28924 Returns a TREE_LIST representing the base-classes, in the order in
28925 which they were declared. The representation of each node is as
28926 described by cp_parser_base_specifier.
28928 In the case that no bases are specified, this function will return
28929 NULL_TREE, not ERROR_MARK_NODE. */
28931 static tree
28933 {
28936 /* Look for the `:' that begins the list. */
28939 /* Scan the base-specifier-list. */
28941 {
28943 tree base;
28946 /* Look for the base-specifier. */
28948 /* Look for the (optional) ellipsis. */
28950 {
28951 /* Consume the `...'. */
28955 }
28957 /* Add BASE to the front of the list. */
28959 {
28961 /* Make this a pack expansion type. */
28965 {
28968 }
28969 }
28970 /* Peek at the next token. */
28972 /* If it's not a comma, then the list is complete. */
28975 /* Consume the `,'. */
28977 }
28979 /* PARSER->SCOPE may still be non-NULL at this point, if the last
28980 base class had a qualified name. However, the next name that
28981 appears is certainly not qualified. */
28987 }
28989 /* Parse a base-specifier.
28991 base-specifier:
28992 :: [opt] nested-name-specifier [opt] class-name
28993 virtual access-specifier [opt] :: [opt] nested-name-specifier
28994 [opt] class-name
28995 access-specifier virtual [opt] :: [opt] nested-name-specifier
28996 [opt] class-name
28998 Returns a TREE_LIST. The TREE_PURPOSE will be one of
28999 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
29000 indicate the specifiers provided. The TREE_VALUE will be a TYPE
29001 (or the ERROR_MARK_NODE) indicating the type that was specified. */
29003 static tree
29005 {
29013 tree type;
29015 /* Process the optional `virtual' and `access-specifier'. */
29017 {
29018 /* Peek at the next token. */
29020 /* Process `virtual'. */
29022 {
29024 /* If `virtual' appears more than once, issue an error. */
29026 {
29030 }
29034 /* Consume the `virtual' token. */
29042 /* If more than one access specifier appears, issue an
29043 error. */
29046 {
29050 }
29054 /* Consume the access-specifier. */
29062 }
29063 }
29064 /* It is not uncommon to see programs mechanically, erroneously, use
29065 the 'typename' keyword to denote (dependent) qualified types
29066 as base classes. */
29068 {
29073 else
29075 "keyword %<typename%> not allowed in this context "
29078 }
29080 /* Look for the optional `::' operator. */
29082 /* Look for the nested-name-specifier. The simplest way to
29083 implement:
29085 [temp.res]
29087 The keyword `typename' is not permitted in a base-specifier or
29088 mem-initializer; in these contexts a qualified name that
29089 depends on a template-parameter is implicitly assumed to be a
29090 type name.
29092 is to pretend that we have seen the `typename' keyword at this
29093 point. */
29099 /* If the base class is given by a qualified name, assume that names
29100 we see are type names or templates, as appropriate. */
29106 /* DR 950 allows decltype as a base-specifier. */
29108 else
29109 {
29110 /* Otherwise, look for the class-name. */
29112 class_scope_p,
29113 template_p,
29114 typename_type,
29119 }
29125 }
29127 /* Exception handling [gram.exception] */
29129 /* Save the tokens that make up the noexcept-specifier for a member-function.
29130 Returns a DEFERRED_PARSE. */
29132 static tree
29134 {
29136 /* We want everything up to, including, the final ')'. */
29140 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
29141 to carry the information we will need. */
29143 /* Save away the noexcept-specifier; we will process it when the
29144 class is complete. */
29149 }
29151 /* Used for late processing of noexcept-specifiers of member-functions.
29152 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
29153 we saved for later; parse it now. DECL is the declaration of the
29154 member function. */
29156 static tree
29158 {
29159 /* Make sure we've gotten something that hasn't been parsed yet. */
29164 /* Push the saved tokens for the noexcept-specifier onto the parser's
29165 lexer stack. */
29169 /* Parse the cached noexcept-specifier. */
29170 tree parsed_arg
29172 CP_PARSER_FLAGS_NONE,
29177 /* Revert to the main lexer. */
29180 /* Restore the queue. */
29183 /* And we're done. */
29185 }
29187 /* Perform late checking of overriding function with respect to their
29188 noexcept-specifiers. FNDECL is the member function that potentially
29189 overrides some virtual function with the same signature. */
29191 static void
29193 {
29195 tree base_binfo;
29201 {
29210 }
29211 }
29213 /* Parse an (optional) noexcept-specification.
29215 noexcept-specification:
29216 noexcept ( constant-expression ) [opt]
29218 If no noexcept-specification is present, returns NULL_TREE.
29219 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
29220 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
29221 there are no parentheses. CONSUMED_EXPR will be set accordingly.
29222 Otherwise, returns a noexcept specification unless RETURN_COND is true,
29223 in which case a boolean condition is returned instead. The parser flags
29224 FLAGS is used to control parsing. QUALS are qualifiers indicating whether
29225 the (member) function is `const'. */
29227 static tree
29229 cp_parser_flags flags,
29233 {
29237 /* Peek at the next token. */
29240 /* Is it a noexcept-specification? */
29242 {
29243 tree expr;
29245 /* [class.mem]/6 says that a noexcept-specifer (within the
29246 member-specification of the class) is a complete-class context of
29247 a class. So, if the noexcept-specifier has the optional expression,
29248 just save the tokens, and reparse this after we're done with the
29249 class. */
29253 /* No need to delay parsing for a number literal or true/false. */
29265 {
29266 matching_parens parens;
29270 {
29271 /* Types may not be defined in an exception-specification. */
29273 parser->type_definition_forbidden_message
29277 expr
29283 {
29286 }
29288 /* Restore the saved message. */
29290 }
29291 else
29292 {
29295 }
29298 }
29299 else
29300 {
29304 }
29306 /* We cannot build a noexcept-spec right away because this will check
29307 that expr is a constexpr. */
29310 else
29312 }
29313 else
29315 }
29317 /* Parse an (optional) exception-specification.
29319 exception-specification:
29320 throw ( type-id-list [opt] )
29322 Returns a TREE_LIST representing the exception-specification. The
29323 TREE_VALUE of each node is a type. The parser flags FLAGS is used to
29324 control parsing. QUALS are qualifiers indicating whether the (member)
29325 function is `const'. */
29327 static tree
29329 cp_parser_flags flags)
29330 {
29332 tree type_id_list;
29335 /* Peek at the next token. */
29338 /* Is it a noexcept-specification? */
29339 type_id_list
29347 /* If it's not `throw', then there's no exception-specification. */
29353 /* Consume the `throw'. */
29356 /* Look for the `('. */
29357 matching_parens parens;
29360 /* Peek at the next token. */
29362 /* If it's not a `)', then there is a type-id-list. */
29364 {
29365 /* Types may not be defined in an exception-specification. */
29367 parser->type_definition_forbidden_message
29369 /* Parse the type-id-list. */
29371 /* Restore the saved message. */
29375 {
29379 }
29382 "dynamic exception specifications are deprecated in "
29384 }
29385 /* In C++17, throw() is equivalent to noexcept (true). throw()
29386 is deprecated in C++11 and above as well, but is still widely used,
29387 so don't warn about it yet. */
29390 else
29393 /* Look for the `)'. */
29397 }
29399 /* Parse an (optional) type-id-list.
29401 type-id-list:
29402 type-id ... [opt]
29403 type-id-list , type-id ... [opt]
29405 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
29406 in the order that the types were presented. */
29408 static tree
29410 {
29414 {
29416 tree type;
29420 /* Get the next type-id. */
29422 /* Check for invalid 'auto'. */
29424 {
29428 }
29429 /* Parse the optional ellipsis. */
29431 {
29432 /* Consume the `...'. */
29435 /* Turn the type into a pack expansion expression. */
29437 }
29438 /* Add it to the list. */
29440 /* Peek at the next token. */
29442 /* If it is not a `,', we are done. */
29445 /* Consume the `,'. */
29447 }
29450 }
29452 /* Parse a try-block.
29454 try-block:
29455 try compound-statement handler-seq */
29457 static tree
29459 {
29460 tree try_block;
29467 "%<try%> in %<constexpr%> function only "
29477 }
29479 /* Parse a function-try-block.
29481 function-try-block:
29482 try ctor-initializer [opt] function-body handler-seq */
29484 static void
29486 {
29487 tree compound_stmt;
29488 tree try_block;
29490 /* Look for the `try' keyword. */
29493 /* Let the rest of the front end know where we are. */
29495 /* Parse the function-body. */
29496 cp_parser_ctor_initializer_opt_and_function_body
29498 /* We're done with the `try' part. */
29500 /* Parse the handlers. */
29502 /* We're done with the handlers. */
29504 }
29506 /* Parse a handler-seq.
29508 handler-seq:
29509 handler handler-seq [opt] */
29511 static void
29513 {
29515 {
29518 /* Parse the handler. */
29520 /* Peek at the next token. */
29522 /* If it's not `catch' then there are no more handlers. */
29525 }
29526 }
29528 /* Parse a handler.
29530 handler:
29531 catch ( exception-declaration ) compound-statement */
29533 static void
29535 {
29536 tree handler;
29537 tree declaration;
29541 matching_parens parens;
29548 }
29550 /* Parse an exception-declaration.
29552 exception-declaration:
29553 type-specifier-seq declarator
29554 type-specifier-seq abstract-declarator
29555 type-specifier-seq
29556 ...
29558 Returns a VAR_DECL for the declaration, or NULL_TREE if the
29559 ellipsis variant is used. */
29561 static tree
29563 {
29564 cp_decl_specifier_seq type_specifiers;
29568 /* If it's an ellipsis, it's easy to handle. */
29570 {
29571 /* Consume the `...' token. */
29574 }
29576 /* Types may not be defined in exception-declarations. */
29578 parser->type_definition_forbidden_message
29581 /* Parse the type-specifier-seq. */
29586 /* If it's a `)', then there is no declarator. */
29589 else
29591 CP_PARSER_FLAGS_NONE,
29598 /* Restore the saved message. */
29605 }
29607 /* Parse a throw-expression.
29609 throw-expression:
29610 throw assignment-expression [opt]
29612 Returns a THROW_EXPR representing the throw-expression. */
29614 static tree
29616 {
29617 tree expression;
29623 /* Figure out whether or not there is an assignment-expression
29624 following the "throw" keyword. */
29632 else
29635 /* Construct a location e.g.:
29636 throw x
29637 ^~~~~~~
29638 with caret == start at the start of the "throw" token, and
29639 the end at the end of the final token we consumed. */
29645 }
29647 /* Parse a yield-expression.
29649 yield-expression:
29650 co_yield assignment-expression
29651 co_yield braced-init-list
29653 Returns a CO_YIELD_EXPR representing the yield-expression. */
29655 static tree
29657 {
29658 tree expr;
29666 {
29668 /* ??? : probably a moot point? */
29671 }
29672 else
29679 }
29681 /* GNU Extensions */
29683 /* Parse an (optional) asm-specification.
29685 asm-specification:
29686 asm ( asm-string-expr )
29688 If the asm-specification is present, returns a STRING_CST
29689 corresponding to the string-literal. Otherwise, returns
29690 NULL_TREE. */
29692 static tree
29694 {
29695 /* Peek at the next token. */
29697 /* If the next token isn't the `asm' keyword, then there's no
29698 asm-specification. */
29702 /* Consume the `asm' token. */
29704 /* Look for the `('. */
29705 matching_parens parens;
29708 /* Look for the string-literal. */
29711 /* Look for the `)'. */
29715 }
29717 /* Parse an asm-operand-list.
29719 asm-operand-list:
29720 asm-operand
29721 asm-operand-list , asm-operand
29723 asm-operand:
29724 asm-string-expr ( expression )
29725 [ asm-string-expr ] asm-string-expr ( expression )
29727 Returns a TREE_LIST representing the operands. The TREE_VALUE of
29728 each node is the expression. The TREE_PURPOSE is itself a
29729 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
29730 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
29731 is a STRING_CST for the string literal before the parenthesis. Returns
29732 ERROR_MARK_NODE if any of the operands are invalid. */
29734 static tree
29736 {
29741 {
29742 tree name;
29745 {
29746 /* Consume the `[' token. */
29748 /* Read the operand name. */
29753 /* Look for the closing `]'. */
29755 }
29756 else
29758 /* Look for the string. */
29761 /* Look for the `('. */
29762 matching_parens parens;
29764 /* Parse the expression. */
29766 /* Look for the `)'. */
29774 /* Add this operand to the list. */
29776 expression,
29777 asm_operands);
29778 /* If the next token is not a `,', there are no more
29779 operands. */
29782 /* Consume the `,'. */
29784 }
29787 }
29789 /* Parse an asm-clobber-list.
29791 asm-clobber-list:
29792 const-expression
29793 asm-clobber-list , const-expression
29795 Returns a TREE_LIST, indicating the clobbers in the order that they
29796 appeared. The TREE_VALUE of each node is a STRING_CST. */
29798 static tree
29800 {
29804 {
29805 /* Look for the string literal. */
29807 /* Add it to the list. */
29809 /* If the next token is not a `,', then the list is
29810 complete. */
29813 /* Consume the `,' token. */
29815 }
29818 }
29820 /* Parse an asm-label-list.
29822 asm-label-list:
29823 identifier
29824 asm-label-list , identifier
29826 Returns a TREE_LIST, indicating the labels in the order that they
29827 appeared. The TREE_VALUE of each node is a label. */
29829 static tree
29831 {
29835 {
29838 /* Look for the identifier. */
29841 {
29844 {
29850 }
29851 }
29852 /* If the next token is not a `,', then the list is
29853 complete. */
29856 /* Consume the `,' token. */
29858 }
29861 }
29863 /* Return TRUE iff the next tokens in the stream are possibly the
29864 beginning of a GNU extension attribute. */
29866 static bool
29868 {
29870 }
29872 /* Return TRUE iff the next tokens in the stream are possibly the
29873 beginning of a standard C++-11 attribute specifier. */
29875 static bool
29877 {
29879 }
29881 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29882 beginning of a standard C++-11 attribute specifier. */
29884 static bool
29886 {
29894 }
29896 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29897 beginning of a GNU extension attribute. */
29899 static bool
29901 {
29905 }
29907 /* Return true iff the next tokens can be the beginning of either a
29908 GNU attribute list, or a standard C++11 attribute sequence. */
29910 static bool
29912 {
29915 }
29917 /* Return true iff the next Nth tokens can be the beginning of either
29918 a GNU attribute list, or a standard C++11 attribute sequence. */
29920 static bool
29922 {
29925 }
29927 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
29928 of GNU attributes, or return NULL. */
29930 static tree
29932 {
29935 {
29940 else
29942 }
29944 }
29946 /* Parse an (optional) series of attributes.
29948 attributes:
29949 attributes attribute
29951 attribute:
29952 __attribute__ (( attribute-list [opt] ))
29954 The return value is as for cp_parser_gnu_attribute_list. */
29956 static tree
29958 {
29965 {
29967 tree attribute_list;
29970 /* Peek at the next token. */
29972 /* If it's not `__attribute__', then we're done. */
29976 /* Consume the `__attribute__' keyword. */
29978 /* Look for the two `(' tokens. */
29979 matching_parens outer_parens;
29982 matching_parens inner_parens;
29986 /* Peek at the next token. */
29989 /* Parse the attribute-list. */
29991 else
29992 /* If the next token is a `)', then there is no attribute
29993 list. */
29996 /* Look for the two `)' tokens. */
30004 /* Add these new attributes to the list. */
30006 }
30009 }
30011 /* Parse a GNU attribute-list.
30013 attribute-list:
30014 attribute
30015 attribute-list , attribute
30017 attribute:
30018 identifier
30019 identifier ( identifier )
30020 identifier ( identifier , expression-list )
30021 identifier ( expression-list )
30023 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
30024 to an attribute. The TREE_PURPOSE of each node is the identifier
30025 indicating which attribute is in use. The TREE_VALUE represents
30026 the arguments, if any. */
30028 static tree
30030 {
30034 /* Don't create wrapper nodes within attributes: the
30035 handlers don't know how to handle them. */
30036 auto_suppress_location_wrappers sentinel;
30040 {
30042 tree identifier;
30043 tree attribute;
30045 /* Look for the identifier. We also allow keywords here; for
30046 example `__attribute__ ((const))' is legal. */
30050 {
30053 /* Consume the token, but save it since we need it for the
30054 SIMD enabled function parsing. */
30057 /* Save away the identifier that indicates which attribute
30058 this is. */
30060 /* For keywords, use the canonical spelling, not the
30061 parsed identifier. */
30068 /* Peek at the next token. */
30070 /* If it's an `(', then parse the attribute arguments. */
30072 {
30078 vec = cp_parser_parenthesized_expression_list
30084 else
30085 {
30088 }
30089 /* Save the arguments away. */
30091 }
30094 {
30095 /* Add this attribute to the list. */
30098 }
30101 }
30102 /* Unless EXACTLY_ONE is set look for more attributes.
30103 If the next token isn't a `,', we're done. */
30107 /* Consume the comma and keep going. */
30109 }
30112 /* We built up the list in reverse order. */
30114 }
30116 /* Parse arguments of omp::directive attribute.
30118 ( directive-name ,[opt] clause-list[opt] )
30120 For directive just remember the first/last tokens for subsequent
30121 parsing. */
30123 static void
30125 {
30128 {
30134 }
30137 {
30143 }
30154 }
30156 /* Parse arguments of omp::sequence attribute.
30158 ( omp::[opt] directive-attr [ , omp::[opt] directive-attr ]... ) */
30160 static void
30162 {
30163 matching_parens parens;
30165 do
30166 {
30171 {
30175 }
30180 else
30185 {
30194 }
30198 UNKNOWN_LOCATION);
30201 else
30206 }
30211 }
30213 /* Parse a standard C++11 attribute.
30215 The returned representation is a TREE_LIST which TREE_PURPOSE is
30216 the scoped name of the attribute, and the TREE_VALUE is its
30217 arguments list.
30219 Note that the scoped name of the attribute is itself a TREE_LIST
30220 which TREE_PURPOSE is the namespace of the attribute, and
30221 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
30222 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
30223 and which TREE_PURPOSE is directly the attribute name.
30225 Clients of the attribute code should use get_attribute_namespace
30226 and get_attribute_name to get the actual namespace and name of
30227 attributes, regardless of their being GNU or C++11 attributes.
30229 attribute:
30230 attribute-token attribute-argument-clause [opt]
30232 attribute-token:
30233 identifier
30234 attribute-scoped-token
30236 attribute-scoped-token:
30237 attribute-namespace :: identifier
30239 attribute-namespace:
30240 identifier
30242 attribute-argument-clause:
30243 ( balanced-token-seq )
30245 balanced-token-seq:
30246 balanced-token [opt]
30247 balanced-token-seq balanced-token
30249 balanced-token:
30250 ( balanced-token-seq )
30251 [ balanced-token-seq ]
30252 { balanced-token-seq }. */
30254 static tree
30256 {
30263 /* First, parse name of the attribute, a.k.a attribute-token. */
30280 {
30281 /* We are seeing a scoped attribute token. */
30296 else
30297 {
30301 }
30307 NULL_TREE);
30309 }
30311 {
30315 NULL_TREE);
30316 }
30317 else
30318 {
30321 NULL_TREE);
30323 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
30324 but no longer: we have to be able to tell [[noreturn]] and
30325 __attribute__((noreturn)) apart. */
30326 /* C++14 deprecated attribute is equivalent to GNU's. */
30329 /* C++17 fallthrough attribute is equivalent to GNU's. */
30332 /* C++23 assume attribute is equivalent to GNU's. */
30335 /* Transactional Memory TS optimize_for_synchronized attribute is
30336 equivalent to GNU transaction_callable. */
30340 /* Transactional Memory attributes are GNU attributes. */
30343 }
30345 /* Now parse the optional argument clause of the attribute. */
30348 {
30354 {
30356 attr_id);
30358 }
30360 }
30362 {
30366 /* Maybe we don't expect to see any arguments for this attribute. */
30370 {
30372 attr_id);
30378 }
30382 /* The assume attribute needs special handling of the argument. */
30386 /* A GNU attribute that takes an identifier in parameter. */
30394 /* If this is a fake attribute created to handle -Wno-attributes,
30395 we must skip parsing the arguments. */
30397 {
30399 {
30401 {
30404 }
30406 {
30411 }
30413 {
30419 }
30420 }
30422 /* For unknown attributes, just skip balanced tokens instead of
30423 trying to parse the arguments. Set TREE_VALUE (attribute) to
30424 error_mark_node to distinguish skipped arguments from attributes
30425 with no arguments. */
30430 }
30432 vec = cp_parser_parenthesized_expression_list
30438 else
30439 {
30441 /* e.g. [[attr()]]. */
30444 attr_id);
30447 }
30451 else
30453 }
30456 }
30458 /* Warn if the attribute ATTRIBUTE appears more than once in the
30459 attribute-list ATTRIBUTES. This used to be enforced for certain
30460 attributes, but the restriction was removed in P2156.
30461 LOC is the location of ATTRIBUTE. Returns true if ATTRIBUTE was not
30462 found in ATTRIBUTES. */
30464 static bool
30466 {
30475 {
30480 }
30482 }
30484 /* Parse a list of standard C++-11 attributes.
30486 attribute-list:
30487 attribute [opt]
30488 attribute-list , attribute[opt]
30489 attribute ...
30490 attribute-list , attribute ...
30491 */
30493 static tree
30495 {
30500 {
30506 {
30508 {
30511 }
30512 }
30515 {
30521 {
30525 }
30527 {
30532 }
30534 }
30538 }
30541 }
30543 /* Optionally parse a C++20 contract role. A NULL return means that no
30544 contract role was specified.
30546 contract-role:
30547 % default
30548 % identifier
30550 If the identifier does not name a known contract role, it will
30551 be assumed to be default. Returns the identifier for the role
30552 token. */
30554 static tree
30556 {
30566 else
30567 {
30570 }
30573 /* FIXME: Warn about invalid/unknown roles? */
30575 }
30577 /* Parse an optional contract mode.
30579 contract-mode:
30580 contract-semantic
30581 [contract-level] [contract-role]
30583 contract-semantic:
30584 check_never_continue
30585 check_maybe_continue
30586 check_always_continue
30588 contract-level:
30589 default
30590 audit
30591 axiom
30593 contract-role:
30594 default
30595 identifier
30597 This grammar is taken from P1332R0. During parsing, this sets options
30598 on the MODE object to determine the configuration of the contract.
30600 Returns a tree containing the identifiers used in the configuration.
30601 This is either an IDENTIFIER with the literal semantic or a TREE_LIST
30602 whose TREE_VALUE is the contract-level and whose TREE_PURPOSE is the
30603 contract-role, if any. NULL_TREE is returned if no information is
30604 given (i.e., all defaults selected). */
30606 static tree
30609 {
30610 /* The mode is empty; the level and role are default. */
30614 /* There is only a role; the level is default. */
30616 {
30619 }
30621 /* Otherwise, match semantic or level. */
30625 tree config_id;
30627 {
30630 /* Either a named level, a concrete semantic, or an identifier
30631 for a postcondition. */
30636 /* The identifier is the return value for a postcondition. */
30640 }
30642 {
30645 }
30646 else
30647 {
30648 /* We got some other token other than a ':'. */
30651 }
30653 /* Consume the literal semantic or level token. */
30657 {
30659 "expected contract level: "
30662 }
30664 /* We matched an explicit semantic. */
30666 {
30668 {
30672 }
30674 }
30676 /* We matched a level, there may be a role; otherwise this is default. */
30678 {
30681 }
30684 }
30686 static tree
30688 {
30692 }
30694 static bool
30696 {
30698 }
30700 /* Parse a standard C++20 contract attribute specifier.
30702 contract-attribute-specifier:
30703 [ [ assert contract-level [opt] : conditional-expression ] ]
30704 [ [ pre contract-level [opt] : conditional-expression ] ]
30705 [ [ post contract-level [opt] identifier [opt] : conditional-expression ] ]
30707 For free functions, we cannot determine the type of the postcondition
30708 identifier because the we haven't called grokdeclarator yet. In those
30709 cases we parse the postcondition as if the identifier was declared as
30710 'auto <identifier>'. We then instantiate the postcondition once the
30711 return type is known.
30713 For member functions, contracts are in the complete-class context, so the
30714 parse is deferred. We also have the return type avaialable (unless it's
30715 deduced), so we don't need to parse the postcondition in terms of a
30716 placeholder. */
30718 static tree
30720 {
30728 /* Parse the optional mode. */
30731 /* Check for postcondition identifiers. */
30732 cp_expr identifier;
30740 /* Defer the parsing of pre/post contracts inside class definitions. */
30741 tree contract;
30743 current_class_type &&
30745 {
30746 /* Skip until we reach an unenclose ']'. If we ran into an unnested ']'
30747 that doesn't close the attribute, return an error and let the attribute
30748 handling code emit an error for missing ']]'. */
30752 CPP_CLOSE_SQUARE,
30759 /* Build a deferred-parse node. */
30764 /* And its corresponding contract. */
30766 }
30767 else
30768 {
30769 /* Enable location wrappers when parsing contracts. */
30772 /* Build a fake variable for the result identifier. */
30775 {
30779 }
30781 /* Parse the condition, ensuring that parameters or the return variable
30782 aren't flagged for use outside the body of a function. */
30787 /* Try to recover from errors by scanning up to the end of the
30788 attribute. Sometimes we get partially parsed expressions, so
30789 we need to search the condition for errors. */
30793 /* Build the contract. */
30796 /* Leave our temporary scope for the postcondition result. */
30798 {
30801 }
30802 }
30805 {
30808 }
30811 }
30813 /* Parse a contract condition for a deferred contract. */
30816 tree fn,
30817 tree attribute)
30818 {
30821 /* Make sure we've gotten something that hasn't been parsed yet or that
30822 we're not parsing an invalid contract. */
30831 /* Build a fake variable for the result identifier. */
30834 {
30835 /* TODO: Can we guarantee that the identifier has a location? */
30839 {
30842 }
30847 }
30849 /* 'this' is not allowed in preconditions of constructors or in postconditions
30850 of destructors. Note that the previous value of this variable is
30851 established by the calling function, so we need to save it here. */
30856 {
30859 }
30863 /* Push the saved tokens onto the parser's lexer stack. */
30867 /* Parse the condition, ensuring that parameters or the return variable
30868 aren't flagged for use outside the body of a function. */
30873 /* Revert to the main lexer. */
30876 /* Restore the queue. */
30882 /* Commit to changes. */
30885 /* Leave our temporary scope for the postcondition result. */
30887 {
30890 }
30891 }
30893 /* Parse a standard C++-11 attribute specifier.
30895 attribute-specifier:
30896 [ [ attribute-using-prefix [opt] attribute-list ] ]
30897 contract-attribute-specifier
30898 alignment-specifier
30900 attribute-using-prefix:
30901 using attribute-namespace :
30903 alignment-specifier:
30904 alignas ( type-id ... [opt] )
30905 alignas ( alignment-expression ... [opt] ).
30907 Extensions for contracts:
30909 contract-attribute-specifier:
30910 [ [ assert : contract-mode [opt] : conditional-expression ] ]
30911 [ [ pre : contract-mode [opt] : conditional-expression ] ]
30912 [ [ post : contract-mode [opt] identifier [opt] :
30913 conditional-expression ] ]
30915 Return void_list_node if the current token doesn't start an
30916 attribute-specifier to differentiate from NULL_TREE returned e.g.
30917 for [ [ ] ]. */
30919 static tree
30921 {
30927 {
30936 {
30939 }
30941 /* Handle contract-attribute-specs specially. */
30943 {
30948 }
30951 {
30962 {
30965 "attribute using prefix only available "
30971 }
30972 else
30974 }
30978 finish_attrs:
30982 else
30983 /* Warn about parsing c++11 attribute in non-c++11 mode, only
30984 when we are sure that we have actually parsed them. */
30986 }
30987 else
30988 {
30989 tree alignas_expr;
30991 /* Look for an alignment-specifier. */
31002 matching_parens parens;
31010 {
31017 }
31022 /* Handle alignas (pack...). */
31024 {
31027 }
31029 /* Something went wrong, so don't build the attribute. */
31033 /* Missing ')' means the code cannot possibly be valid; go ahead
31034 and commit to make sure we issue a hard error. */
31042 /* Build the C++-11 representation of an 'aligned'
31043 attribute. */
31044 attributes
31047 }
31050 }
31052 /* Parse a standard C++-11 attribute-specifier-seq.
31054 attribute-specifier-seq:
31055 attribute-specifier-seq [opt] attribute-specifier */
31057 static tree
31059 {
31063 /* Don't create wrapper nodes within attributes: the
31064 handlers don't know how to handle them. */
31065 auto_suppress_location_wrappers sentinel;
31068 {
31072 /* Accept [[]][[]]; for which cp_parser_std_attribute_spec
31073 returns NULL_TREE as there are no attributes. */
31081 else
31084 }
31087 }
31089 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
31090 return index of the first token after balanced-token, or N on failure. */
31092 static size_t
31094 {
31097 do
31099 {
31103 /* FALLTHRU */
31105 /* Ran out of tokens. */
31127 }
31130 }
31132 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
31133 return index of the first token after the GNU attribute tokens, or N on
31134 failure. */
31136 static size_t
31138 {
31140 {
31152 }
31154 }
31156 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
31157 next token), return index of the first token after the standard C++11
31158 attribute tokens, or N on failure. */
31160 static size_t
31162 {
31164 {
31167 {
31174 }
31177 {
31182 }
31183 else
31185 }
31187 }
31189 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
31190 as the next token), return index of the first token after the attribute
31191 tokens, or N on failure. */
31193 static size_t
31195 {
31199 }
31201 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
31202 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
31203 current value of the PEDANTIC flag, regardless of whether or not
31204 the `__extension__' keyword is present. The caller is responsible
31205 for restoring the value of the PEDANTIC flag. */
31207 static bool
31209 {
31210 /* Save the old value of the PEDANTIC flag. */
31214 {
31215 /* Consume the `__extension__' token. */
31217 /* We're not being pedantic while the `__extension__' keyword is
31218 in effect. */
31222 }
31225 }
31227 /* Parse a label declaration.
31229 label-declaration:
31230 __label__ label-declarator-seq ;
31232 label-declarator-seq:
31233 identifier , label-declarator-seq
31234 identifier */
31236 static void
31238 {
31239 /* Look for the `__label__' keyword. */
31243 {
31244 tree identifier;
31246 /* Look for an identifier. */
31248 /* If we failed, stop. */
31251 /* Declare it as a label. */
31253 /* If the next token is a `;', stop. */
31256 /* Look for the `,' separating the label declarations. */
31258 }
31260 /* Look for the final `;'. */
31262 }
31264 // -------------------------------------------------------------------------- //
31265 // Concept definitions
31267 static tree
31269 {
31270 /* A concept definition is an unevaluated context. */
31271 cp_unevaluated u;
31278 {
31282 }
31287 {
31291 }
31293 processing_constraint_expression_sentinel parsing_constraint;
31298 /* Consume the trailing ';'. Diagnose the problem if it isn't there,
31299 but continue as if it were. */
31303 }
31305 // -------------------------------------------------------------------------- //
31306 // Requires Clause
31308 /* Diagnose an expression that should appear in ()'s within a requires-clause
31309 and suggest where to place those parentheses. */
31311 static void
31313 {
31315 }
31317 static void
31319 {
31324 }
31326 /* Characterizes the likely kind of expression intended by a mis-written
31327 primary constraint. */
31328 enum primary_constraint_error
31329 {
31330 pce_ok,
31331 pce_maybe_operator,
31332 pce_maybe_postfix
31333 };
31335 /* Returns true if the token(s) following a primary-expression in a
31336 constraint-logical-* expression would require parentheses. */
31338 static primary_constraint_error
31340 {
31343 {
31348 {
31349 /* An equal sign may be part of the definition of a function,
31350 and not an assignment operator, when parsing the expression
31351 for a trailing requires-clause. For example:
31353 template<typename T>
31354 struct S {
31355 S() requires C<T> = default;
31356 };
31358 Don't try to reparse this a binary operator. */
31364 }
31366 /* Arithmetic operators. */
31372 /* Bitwise operators. */
31378 /* Relational operators. */
31386 /* Pointer-to-member. */
31389 /* Assignment operators. */
31400 /* Conditional operator */
31402 /* Unenclosed binary or conditional operator. */
31406 {
31407 /* A primary constraint that precedes the parameter-list of a
31408 lambda expression is followed by an open paren.
31410 []<typename T> requires C (T a, T b) { ... }
31412 Don't try to re-parse this as a postfix expression. */
31417 }
31419 {
31420 /* A primary-constraint-expression followed by a '[[' is not a
31421 postfix expression. */
31426 }
31430 /* Unenclosed postfix operator. */
31434 /* A primary constraint that precedes the lambda-declarator of a
31435 lambda expression is followed by trailing return type.
31437 []<typename T> requires C -> void {}
31439 Don't try to re-parse this as a postfix expression in
31440 C++23 and later. In C++20 ( needs to come in between but we
31441 allow it to be omitted with pedwarn. */
31444 /* Unenclosed postfix operator. */
31446 }
31447 }
31449 /* Returns true if the next token begins a unary expression, preceded by
31450 an operator or keyword. */
31452 static bool
31454 {
31457 {
31468 {
31470 {
31486 }
31487 }
31491 }
31494 }
31496 /* Parse a primary expression within a constraint. */
31498 static cp_expr
31500 {
31501 /* If this looks like a unary expression, parse it as such, but diagnose
31502 it as ill-formed; it requires parens. */
31504 {
31508 }
31511 cp_id_kind idk;
31522 {
31523 /* The primary-expression could be part of an unenclosed non-logical
31524 compound expression. */
31526 }
31528 {
31533 }
31535 /* Retry the parse at a lower precedence. If that succeeds, diagnose the
31536 error, but return the expression as if it were valid. */
31541 else
31544 {
31547 }
31549 /* Otherwise, something has gone very wrong, and we can't generate a more
31550 meaningful diagnostic or recover. */
31553 }
31555 /* Parse a constraint-logical-and-expression.
31557 constraint-logical-and-expression:
31558 primary-expression
31559 constraint-logical-and-expression '&&' primary-expression */
31561 static cp_expr
31563 {
31566 {
31570 }
31572 }
31574 /* Parse a constraint-logical-or-expression.
31576 constraint-logical-or-expression:
31577 constraint-logical-and-expression
31578 constraint-logical-or-expression '||' constraint-logical-and-expression */
31580 static cp_expr
31582 {
31585 {
31589 }
31591 }
31593 /* Parse the expression after a requires-clause. This has a different grammar
31594 than that in the concepts TS. */
31596 static tree
31598 {
31599 processing_constraint_expression_sentinel parsing_constraint;
31606 }
31608 /* Parse a expression after a requires clause.
31610 constraint-expression:
31611 logical-or-expression
31613 The required logical-or-expression must be a constant expression. Note
31614 that we don't check that the expression is constepxr here. We defer until
31615 we analyze constraints and then, we only check atomic constraints. */
31617 static tree
31619 {
31620 processing_constraint_expression_sentinel parsing_constraint;
31629 }
31631 /* Optionally parse a requires clause:
31633 requires-clause:
31634 `requires` constraint-logical-or-expression.
31635 [ConceptsTS]
31636 `requires constraint-expression.
31638 LAMBDA_P is true when the requires-clause is parsed before the
31639 parameter-list of a lambda-declarator. */
31641 static tree
31643 {
31644 /* A requires clause is an unevaluated context. */
31645 cp_unevaluated u;
31649 {
31652 {
31654 "%<requires%> only available with "
31656 /* Parse and discard the requires-clause. */
31659 }
31661 }
31665 {
31666 /* An opening brace following the start of a requires-clause is
31667 ill-formed; the user likely forgot the second `requires' that
31668 would start a requires-expression. */
31673 /* Don't consume the `requires', so that it's reused as the start of a
31674 requires-expression. */
31675 }
31676 else
31681 else
31683 }
31685 /*---------------------------------------------------------------------------
31686 Requires expressions
31687 ---------------------------------------------------------------------------*/
31689 /* Parse a requires expression
31691 requirement-expression:
31692 'requires' requirement-parameter-list [opt] requirement-body */
31694 static tree
31696 {
31700 /* Avoid committing to outer tentative parse. */
31703 /* This is definitely a requires-expression. */
31707 {
31708 /* Local parameters are delared as variables within the scope
31709 of the expression. They are not visible past the end of
31710 the expression. Expressions within the requires-expression
31711 are unevaluated. */
31712 struct scope_sentinel
31713 {
31715 {
31719 }
31722 {
31725 }
31728 /* Parse the optional parameter list. */
31730 {
31734 }
31735 else
31738 /* Parse the requirement body. */
31744 }
31746 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
31747 the parm chain. */
31752 {
31753 /* Perform semantic processing now to diagnose any invalid types and
31754 expressions. */
31759 }
31761 }
31763 /* Parse a parameterized requirement.
31765 requirement-parameter-list:
31766 '(' parameter-declaration-clause ')' */
31768 static tree
31770 {
31771 matching_parens parens;
31775 tree parms = (cp_parser_parameter_declaration_clause
31781 /* Modify the declared parameters by removing their context
31782 so they don't refer to the enclosing scope and explicitly
31783 indicating that they are constraint variables. */
31785 {
31790 {
31793 }
31794 }
31797 }
31799 /* Parse the body of a requirement.
31801 requirement-body:
31802 '{' requirement-list '}' */
31803 static tree
31805 {
31806 matching_braces braces;
31816 }
31818 /* Parse a sequence of requirements.
31820 requirement-seq:
31821 requirement
31822 requirement-seq requirement */
31824 static tree
31826 {
31828 do
31829 {
31833 }
31837 /* If there are no valid requirements, this is not a valid expression. */
31841 /* Reverse the order of requirements so they are analyzed in order. */
31843 }
31845 /* Parse a syntactic requirement or type requirement.
31847 requirement:
31848 simple-requirement
31849 compound-requirement
31850 type-requirement
31851 nested-requirement */
31853 static tree
31855 {
31859 {
31860 /* It's probably a type-requirement. */
31865 /* No, maybe it's something like typename T::type(); */
31870 /* Non-tentative for the error. */
31872 }
31875 else
31877 }
31879 /* Parse a simple requirement.
31881 simple-requirement:
31882 expression ';' */
31884 static tree
31886 {
31897 /* Sometimes we don't get locations, so use the cached token location
31898 as a reasonable approximation. */
31903 {
31906 {
31909 }
31911 {
31915 "if a concept-id is a valid expression; add "
31917 }
31919 }
31922 }
31924 /* Parse a type requirement
31926 type-requirement
31927 nested-name-specifier [opt] required-type-name ';'
31929 required-type-name:
31930 type-name
31931 'template' [opt] simple-template-id */
31933 static tree
31935 {
31939 // Save the scope before parsing name specifiers.
31950 tree type;
31952 {
31961 }
31962 else
31982 }
31984 /* Parse a compound requirement
31986 compound-requirement:
31987 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
31989 static tree
31991 {
31992 /* Parse an expression enclosed in '{ }'s. */
31993 matching_braces braces;
32004 {
32008 }
32010 /* If the expression was invalid, skip the remainder of the requirement. */
32012 {
32016 }
32018 /* Parse the optional noexcept. */
32021 {
32024 }
32026 /* Parse the optional trailing return type. */
32029 {
32035 /* C++20 allows either a type-id or a type-constraint. Parsing
32036 a type-id will subsume the parsing for a type-constraint but
32037 allow for more syntactic forms (e.g., const C<T>*). */
32046 /* Check that we haven't written something like 'const C<T>*'. */
32048 {
32050 {
32055 }
32056 }
32058 /* P1452R2 removed the trailing-return-type option. */
32061 }
32073 }
32075 /* Parse a nested requirement. This is the same as a requires clause.
32077 nested-requirement:
32078 requires-clause */
32080 static tree
32082 {
32094 }
32096 /* Support Functions */
32098 /* Return the appropriate prefer_type argument for lookup_name based on
32099 tag_type. */
32103 {
32105 {
32109 }
32110 }
32112 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
32113 NAME should have one of the representations used for an
32114 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
32115 is returned. If PARSER->SCOPE is a dependent type, then a
32116 SCOPE_REF is returned.
32118 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
32119 returned; the name was already resolved when the TEMPLATE_ID_EXPR
32120 was formed. Abstractly, such entities should not be passed to this
32121 function, because they do not need to be looked up, but it is
32122 simpler to check for this special case here, rather than at the
32123 call-sites.
32125 In cases not explicitly covered above, this function returns a
32126 DECL, OVERLOAD, or baselink representing the result of the lookup.
32127 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
32128 is returned.
32130 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
32131 (e.g., "struct") that was used. In that case bindings that do not
32132 refer to types are ignored.
32134 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
32135 ignored. If IS_TEMPLATE IS 2, the 'template' keyword was specified.
32137 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
32138 are ignored.
32140 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
32141 types.
32143 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
32144 TREE_LIST of candidates if name-lookup results in an ambiguity, and
32145 NULL_TREE otherwise. */
32147 static cp_expr
32154 location_t name_location)
32155 {
32156 tree decl;
32159 /* Assume that the lookup will be unambiguous. */
32163 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
32164 no longer valid. Note that if we are parsing tentatively, and
32165 the parse fails, OBJECT_TYPE will be automatically restored. */
32171 /* A template-id has already been resolved; there is no lookup to
32172 do. */
32176 {
32180 }
32182 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
32183 it should already have been checked to make sure that the name
32184 used matches the type being destroyed. */
32186 {
32187 tree type;
32189 /* Figure out to which type this destructor applies. */
32194 else
32196 /* If that's not a class type, there is no destructor. */
32200 /* In a non-static member function, check implicit this->. */
32203 tf_warning_or_error);
32212 }
32214 /* By this point, the NAME should be an ordinary identifier. If
32215 the id-expression was a qualified name, the qualifying scope is
32216 stored in PARSER->SCOPE at this point. */
32219 /* Perform the lookup. */
32221 {
32227 /* If the SCOPE is dependent, the lookup must be deferred until
32228 the template is instantiated -- unless we are explicitly
32229 looking up names in uninstantiated templates. Even then, we
32230 cannot look up the name if the scope is not a class type; it
32231 might, for example, be a template type parameter. */
32236 /* Defer lookup. */
32238 else
32239 {
32242 /* If PARSER->SCOPE is a dependent type, then it must be a
32243 class type, and we must not be checking dependencies;
32244 otherwise, we would have processed this lookup above. So
32245 that PARSER->SCOPE is not considered a dependent base by
32246 lookup_member, we must enter the scope here. */
32250 /* If the PARSER->SCOPE is a template specialization, it
32251 may be instantiated during name lookup. In that case,
32252 errors may be issued. Even if we rollback the current
32253 tentative parse, those errors are valid. */
32258 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
32259 lookup result and the nested-name-specifier nominates a class C:
32260 * if the name specified after the nested-name-specifier, when
32261 looked up in C, is the injected-class-name of C (Clause 9), or
32262 * if the name specified after the nested-name-specifier is the
32263 same as the identifier or the simple-template-id's template-
32264 name in the last component of the nested-name-specifier,
32265 the name is instead considered to name the constructor of
32266 class C. [ Note: for example, the constructor is not an
32267 acceptable lookup result in an elaborated-type-specifier so
32268 the constructor would not be used in place of the
32269 injected-class-name. --end note ] Such a constructor name
32270 shall be used only in the declarator-id of a declaration that
32271 names a constructor or in a using-declaration. */
32281 }
32283 /* If the scope is a dependent type and either we deferred lookup or
32284 we did lookup but didn't find the name, rememeber the name. */
32287 {
32289 {
32290 tree type;
32292 /* The resolution to Core Issue 180 says that `struct
32293 A::B' should be considered a type-name, even if `A'
32294 is dependent. */
32299 }
32303 CPP_CLOSE_PAREN)))
32307 else
32310 is_template);
32311 }
32314 }
32316 {
32319 /* Look up the name in the scope of the OBJECT_TYPE, unless the
32320 OBJECT_TYPE is not a class. */
32322 /* If the OBJECT_TYPE is a template specialization, it may
32323 be instantiated during name lookup. In that case, errors
32324 may be issued. Even if we rollback the current tentative
32325 parse, those errors are valid. */
32327 name,
32330 tf_warning_or_error);
32331 else
32334 /* If we didn't find a member and have dependent bases, the member lookup
32335 is now dependent. */
32342 /* Look it up in the enclosing context. DR 141: When looking for a
32343 template-name after -> or ., only consider class templates. */
32345 /* DR 141: When looking in the
32346 current enclosing context for a
32347 template-name after -> or ., only
32348 consider class templates. */
32352 /* If we did unqualified lookup of a dependent member-qualified name and
32353 found something, do we want to use it? P1787 clarified that we need
32354 to look in the object scope first even if it's dependent, but for now
32355 let's still use it in some cases.
32356 FIXME remember unqualified lookup result to use if member lookup fails
32357 at instantiation time. */
32359 {
32361 /* Only use the unqualified class template lookup if we're actually
32362 looking at a template arg list. */
32365 }
32367 /* If we know we're looking for a type (e.g. A in p->A::x),
32368 mock up a typename. */
32370 {
32372 typename_type);
32374 }
32378 }
32379 else
32380 {
32385 }
32387 /* If the lookup failed, let our caller know. */
32391 /* If we have resolved the name of a member declaration, check to
32392 see if the declaration is accessible. When the name resolves to
32393 set of overloaded functions, accessibility is checked when
32394 overload resolution is done. If we have a TREE_LIST, then the lookup
32395 is either ambiguous or it found multiple injected-class-names, the
32396 accessibility of which is trivially satisfied.
32398 During an explicit instantiation, access is not checked at all,
32399 as per [temp.explicit]. */
32402 tf_warning_or_error);
32404 /* Pull out the template from an injected-class-name (or multiple). */
32408 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
32410 {
32413 /* The error message we have to print is too complicated for
32414 cp_parser_error, so we incorporate its actions directly. */
32416 {
32418 name);
32420 }
32422 }
32433 }
32435 /* Like cp_parser_lookup_name, but for use in the typical case where
32436 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
32437 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
32439 static tree
32441 {
32443 none_type,
32448 location);
32449 }
32451 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
32452 the current context, return the TYPE_DECL. If TAG_NAME_P is
32453 true, the DECL indicates the class being defined in a class-head,
32454 or declared in an elaborated-type-specifier.
32456 Otherwise, return DECL. */
32458 static tree
32460 {
32461 /* If the TEMPLATE_DECL is being declared as part of a class-head,
32462 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
32464 struct A {
32465 template <typename T> struct B;
32466 };
32468 template <typename T> struct A::B {};
32470 Similarly, in an elaborated-type-specifier:
32472 namespace N { struct X{}; }
32474 struct A {
32475 template <typename T> friend struct N::X;
32476 };
32478 However, if the DECL refers to a class type, and we are in
32479 the scope of the class, then the name lookup automatically
32480 finds the TYPE_DECL created by build_self_reference rather
32481 than a TEMPLATE_DECL. For example, in:
32483 template <class T> struct S {
32484 S s;
32485 };
32487 there is no need to handle such case. */
32493 }
32495 /* If too many, or too few, template-parameter lists apply to the
32496 declarator, issue an error message. Returns TRUE if all went well,
32497 and FALSE otherwise. */
32499 static bool
32502 location_t declarator_location)
32503 {
32505 {
32507 {
32516 {
32517 /* If the DECLARATOR has the form `X<y>' then it uses one
32518 additional level of template parameters. */
32521 }
32523 return cp_parser_check_template_parameters
32525 declarator);
32526 }
32542 }
32544 }
32546 /* NUM_TEMPLATES were used in the current declaration. If that is
32547 invalid, return FALSE and issue an error messages. Otherwise,
32548 return TRUE. If DECLARATOR is non-NULL, then we are checking a
32549 declarator and we can print more accurate diagnostics. */
32551 static bool
32555 location_t location,
32557 {
32558 /* If there are the same number of template classes and parameter
32559 lists, that's OK. */
32562 /* If there are more, but only one more, and the name ends in an identifier,
32563 then we are declaring a primary template. That's OK too. */
32571 /* If there are more template classes than parameter lists, we have
32572 something like:
32574 template <class T> void S<T>::R<T>::f (); */
32576 {
32586 else
32589 }
32590 /* Otherwise, there are too many template parameter lists. We have
32591 something like:
32593 template <class T> template <class U> void S::f(); */
32596 }
32598 /* Parse an optional `::' token indicating that the following name is
32599 from the global namespace. If so, PARSER->SCOPE is set to the
32600 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
32601 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
32602 Returns the new value of PARSER->SCOPE, if the `::' token is
32603 present, and NULL_TREE otherwise. */
32605 static tree
32607 {
32610 /* Peek at the next token. */
32612 /* If we're looking at a `::' token then we're starting from the
32613 global namespace, not our current location. */
32615 {
32616 /* Consume the `::' token. */
32618 /* Set the SCOPE so that we know where to start the lookup. */
32624 }
32626 {
32630 }
32633 }
32635 /* Returns TRUE if the upcoming token sequence is the start of a
32636 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
32637 declarator is preceded by the `friend' specifier. The parser flags FLAGS
32638 is used to control type-specifier parsing. */
32640 static bool
32643 {
32646 tree nested_name_specifier;
32649 /* The common case is that this is not a constructor declarator, so
32650 try to avoid doing lots of work if at all possible. It's not
32651 valid declare a constructor at function scope. */
32654 /* And only certain tokens can begin a constructor declarator. */
32662 /* Parse tentatively; we are going to roll back all of the tokens
32663 consumed here. */
32665 /* Assume that we are looking at a constructor declarator. */
32668 /* Look for the optional `::' operator. */
32671 /* Look for the nested-name-specifier. */
32672 nested_name_specifier
32679 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
32682 {
32687 }
32693 /* Outside of a class-specifier, there must be a
32694 nested-name-specifier. Except in C++17 mode, where we
32695 might be declaring a guiding declaration. */
32702 /* If we have a class scope, this is easy; DR 147 says that S::S always
32703 names the constructor, and no other qualified name could. */
32706 {
32716 }
32717 /* If we still think that this might be a constructor-declarator,
32718 look for a class-name. */
32720 {
32721 /* If we have:
32723 template <typename T> struct S {
32724 S();
32725 };
32727 we must recognize that the nested `S' names a class. */
32731 tree type_decl;
32735 none_type,
32742 {
32748 none_type,
32753 else
32755 }
32757 /* If there was no class-name, then this is not a constructor.
32758 Otherwise, if we are in a class-specifier and we aren't
32759 handling a friend declaration, check that its type matches
32760 current_class_type (c++/38313). Note: error_mark_node
32761 is left alone for error recovery purposes. */
32763 && (outside_class_specifier_p
32769 /* If we're still considering a constructor, we have to see a `(',
32770 to begin the parameter-declaration-clause, followed by either a
32771 `)', an `...', or a decl-specifier. We need to check for a
32772 type-specifier to avoid being fooled into thinking that:
32774 S (f) (int);
32776 is a constructor. (It is actually a function named `f' that
32777 takes one parameter (of type `int') and returns a value of type
32778 `S'. */
32786 /* A parameter declaration begins with a decl-specifier,
32787 which is either the "attribute" keyword, a storage class
32788 specifier, or (usually) a type-specifier. */
32790 /* GNU attributes can actually appear both at the start of
32791 a parameter and parenthesized declarator.
32792 S (__attribute__((unused)) int);
32793 is a constructor, but
32794 S (__attribute__((unused)) foo) (int);
32795 is a function declaration. [[attribute]] can appear in the
32796 first form too, but not in the second form. */
32798 {
32799 tree type;
32805 {
32809 }
32811 /* Names appearing in the type-specifier should be looked up
32812 in the scope of the class. */
32816 {
32819 {
32823 {
32826 }
32827 }
32829 }
32831 /* Inside the constructor parameter list, surrounding
32832 template-parameter-lists do not apply. */
32833 saved_num_template_parameter_lists
32837 /* Look for the type-specifier. It's not optional, but its typename
32838 might be. Unless this is a friend declaration; we don't want to
32839 treat
32841 friend S (T::fn)(int);
32843 as a constructor, but with P0634, we might assume a type when
32844 looking for the type-specifier. It is actually a function named
32845 `T::fn' that takes one parameter (of type `int') and returns a
32846 value of type `S'. Constructors can be friends, but they must
32847 use a qualified name.
32849 Parse with an empty set of declaration specifiers since we're
32850 trying to match a decl-specifier-seq of the first parameter.
32851 This must be non-null so that cp_parser_simple_type_specifier
32852 will recognize a constrained placeholder type such as:
32853 'C<int> auto' where C is a type concept. */
32854 cp_decl_specifier_seq ctor_specs;
32864 parser->num_template_parameter_lists
32867 /* Leave the scope of the class. */
32872 }
32873 }
32875 /* We did not really want to consume any tokens. */
32878 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
32879 declarator-id of a constructor or destructor. */
32882 {
32883 auto_diagnostic_group d;
32888 }
32891 }
32893 /* Parse the definition of the function given by the DECL_SPECIFIERS,
32894 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
32895 they must be performed once we are in the scope of the function.
32897 Returns the function defined. */
32899 static tree
32900 cp_parser_function_definition_from_specifiers_and_declarator
32903 tree attributes,
32905 {
32906 tree fn;
32909 /* Begin the function-definition. */
32912 /* The things we're about to see are not directly qualified by any
32913 template headers we've seen thus far. */
32916 /* If there were names looked up in the decl-specifier-seq that we
32917 did not check, check them now. We must wait until we are in the
32918 scope of the function to perform the checks, since the function
32919 might be a friend. */
32923 {
32928 }
32931 {
32932 /* Skip the entire function. */
32935 }
32937 {
32938 /* Seen already, skip it. An error message has already been output. */
32942 /* If this is a function from a class, pop the nested class. */
32945 }
32946 else
32947 {
32952 }
32955 }
32957 /* Parse the part of a function-definition that follows the
32958 declarator. INLINE_P is TRUE iff this function is an inline
32959 function defined within a class-specifier.
32961 Returns the function defined. */
32963 static tree
32966 {
32967 tree fn;
32972 bool fully_implicit_function_template_p
32975 tree implicit_template_parms
32978 cp_binding_level* implicit_template_scope
32984 /* If the next token is `return', then the code may be trying to
32985 make use of the "named return value" extension that G++ used to
32986 support. */
32989 {
32990 /* Consume the `return' keyword. */
32992 /* Look for the identifier that indicates what value is to be
32993 returned. */
32995 /* Issue an error message. */
32998 /* Skip tokens until we reach the start of the function body. */
33000 {
33007 }
33008 }
33009 /* The `extern' in `extern "C" void f () { ... }' does not apply to
33010 anything declared inside `f'. */
33011 saved_in_unbraced_linkage_specification_p
33014 /* Inside the function, surrounding template-parameter-lists do not
33015 apply. */
33016 saved_num_template_parameter_lists
33020 /* If the next token is `try', `__transaction_atomic', or
33021 `__transaction_relaxed`, then we are looking at either function-try-block
33022 or function-transaction-block. Note that all of these include the
33023 function-body. */
33027 RID_TRANSACTION_RELAXED))
33031 else
33032 cp_parser_ctor_initializer_opt_and_function_body
33035 /* Finish the function. */
33039 && !inline_p
33045 /* Generate code for it, if necessary. */
33048 /* Restore the saved values. */
33049 parser->in_unbraced_linkage_specification_p
33051 parser->num_template_parameter_lists
33055 parser->fully_implicit_function_template_p
33057 parser->implicit_template_parms
33059 parser->implicit_template_scope
33066 }
33068 /* Parse a template-declaration body (following argument list). */
33070 static void
33072 tree parameter_list,
33074 {
33078 /* We just processed one more parameter list. */
33081 /* Get the deferred access checks from the parameter list. These
33082 will be checked once we know what is being declared, as for a
33083 member template the checks must be performed in the scope of the
33084 class containing the member. */
33087 /* Tentatively parse for a new template parameter list, which can either be
33088 the template keyword or a template introduction. */
33097 /* -fconcept-ts 'concept bool' syntax is handled below, in
33098 cp_parser_single_declaration. */
33100 else
33101 {
33104 checks,
33105 member_p,
33109 /* If this is a member template declaration, let the front
33110 end know. */
33112 {
33117 }
33122 }
33123 /* We are done with the current parameter list. */
33128 /* Finish up. */
33131 /* Check the template arguments for a literal operator template. */
33135 {
33139 else
33140 {
33143 {
33150 /* OK, C++20 string literal operator template. We don't need
33151 to warn in lower dialects here because we will have already
33156 }
33158 {
33167 else
33168 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
33170 "ISO C++ did not adopt string literal operator templa"
33172 }
33173 else
33175 }
33177 {
33180 "template %qD has invalid parameter list; expected "
33181 "non-type template parameter pack %<<char...>%> or "
33183 decl);
33184 else
33186 "template %qD has invalid parameter list; expected "
33188 decl);
33189 }
33190 }
33192 /* Register member declarations. */
33195 /* If DECL is a function template, we must return to parse it later.
33196 (Even though there is no definition, there might be default
33197 arguments that need handling.) */
33201 }
33203 /* Parse a template introduction header for a template-declaration. Returns
33204 false if tentative parse fails. */
33206 static bool
33208 {
33218 /* In classes don't parse valid unnamed bitfields as invalid
33219 template introductions. */
33223 /* Look for the optional `::' operator. */
33226 /* Look for the nested-name-specifier. */
33236 /* Look up the concept for which we will be matching
33237 template parameters. */
33249 /* Look for opening brace for introduction. */
33250 matching_braces braces;
33259 /* Build vector of placeholder parameters and grab
33260 matching identifiers. */
33263 /* Look for closing brace for introduction. */
33267 /* The introduction-list shall not be empty. */
33270 {
33271 /* In cp_parser_introduction_list we have already issued an error. */
33273 }
33276 {
33280 }
33282 /* Build and associate the constraint. */
33287 introduction_list,
33288 introduction_loc);
33290 {
33297 member_p);
33299 }
33305 }
33307 /* Parse a normal template-declaration following the template keyword. */
33309 static void
33311 {
33312 tree parameter_list;
33316 /* Look for the `<' token. */
33320 {
33321 /* 14.5.2.2 [temp.mem]
33323 A local class shall not have member templates. */
33328 }
33329 /* [temp]
33331 A template ... shall not have C linkage. */
33333 {
33336 /* Give it C++ linkage to avoid confusing other parts of the
33337 front end. */
33340 }
33341 else
33344 /* We cannot perform access checks on the template parameter
33345 declarations until we know what is being declared, just as we
33346 cannot check the decl-specifier list. */
33349 /* If the next token is `>', then we have an invalid
33350 specialization. Rather than complain about an invalid template
33351 parameter, issue an error message here. */
33353 {
33357 }
33358 else
33359 {
33360 /* Parse the template parameters. */
33362 }
33364 /* Look for the `>'. */
33367 /* Manage template requirements */
33369 {
33374 }
33377 member_p);
33379 /* For the erroneous case of a template with C linkage, we pushed an
33380 implicit C++ linkage scope; exit that scope now. */
33383 }
33385 /* Parse a template-declaration, assuming that the `export' (and
33386 `extern') keywords, if present, has already been scanned. MEMBER_P
33387 is as for cp_parser_template_declaration. */
33389 static bool
33391 {
33393 {
33397 }
33402 }
33404 /* Perform the deferred access checks from a template-parameter-list.
33405 CHECKS is a TREE_LIST of access checks, as returned by
33406 get_deferred_access_checks. */
33408 static void
33409 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
33410 {
33414 }
33416 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
33417 `function-definition' sequence that follows a template header.
33418 If MEMBER_P is true, this declaration appears in a class scope.
33420 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
33421 *FRIEND_P is set to TRUE iff the declaration is a friend. */
33423 static tree
33429 {
33432 cp_decl_specifier_seq decl_specifiers;
33436 /* This function is only used when processing a template
33437 declaration. */
33441 /* Defer access checks until we know what is being declared. */
33444 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
33445 alternative. */
33448 (CP_PARSER_FLAGS_OPTIONAL
33453 cp_omp_declare_simd_data odsd;
33462 /* There are no template typedefs. */
33464 {
33468 }
33470 /* Gather up the access checks that occurred the
33471 decl-specifier-seq. */
33474 /* Check for the declaration of a template class. */
33476 {
33479 {
33482 /* In this case:
33484 struct C {
33485 friend template <typename T> struct A<T>::B;
33486 };
33488 A<T>::B will be represented by a TYPENAME_TYPE, and
33489 therefore not recognized by shadow_tag. */
33491 && !decl
33498 else
33501 /* If this is a declaration, but not a definition, associate
33502 any constraints with the type declaration. Constraints
33503 are associated with definitions in cp_parser_class_specifier. */
33507 /* Perform access checks for template parameters. */
33510 /* Give a helpful diagnostic for
33511 template <class T> struct A { } a;
33512 if we aren't already recovering from an error. */
33515 {
33517 "a class template declaration must not declare "
33521 }
33522 }
33523 }
33525 /* Complain about missing 'typename' or other invalid type names. */
33528 {
33529 /* cp_parser_parse_and_diagnose_invalid_type_name calls
33530 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
33531 the rest of this declaration. */
33534 }
33536 /* If it's not a template class, try for a template function. If
33537 the next token is a `;', then this declaration does not declare
33538 anything. But, if there were errors in the decl-specifiers, then
33539 the error might well have come from an attempted class-specifier.
33540 In that case, there's no need to warn about a missing declarator. */
33544 {
33546 /* We don't delay parsing for friends, though CWG 2510 may change
33547 that. */
33551 flags,
33553 checks,
33555 member_p,
33556 declares_class_or_enum,
33560 /* 7.1.1-1 [dcl.stc]
33562 A storage-class-specifier shall not be specified in an explicit
33563 specialization... */
33565 && explicit_specialization_p
33567 {
33571 }
33575 }
33577 /* Look for a trailing `;' after the declaration. */
33583 out:
33586 /* Clear any current qualification; whatever comes next is the start
33587 of something new. */
33595 }
33597 /* Parse a cast-expression that is not the operand of a unary "&". */
33599 static cp_expr
33601 {
33604 }
33606 /* Parse a functional cast to TYPE. Returns an expression
33607 representing the cast. */
33609 static cp_expr
33611 {
33613 tree expression_list;
33614 cp_expr cast;
33629 /* auto(x) and auto{x} need to use a level-less auto. */
33633 {
33643 /* Create a location of the form:
33644 type_name{i, f}
33645 ^~~~~~~~~~~~~~~
33646 with caret == start at the start of the type name,
33647 finishing at the closing brace. */
33652 }
33661 else
33662 {
33665 }
33667 /* Create a location of the form:
33668 float(i)
33669 ^~~~~~~~
33670 with caret == start at the start of the type name,
33671 finishing at the closing paren. */
33675 tf_warning_or_error);
33677 /* [expr.const]/1: In an integral constant expression "only type
33678 conversions to integral or enumeration type can be used". */
33684 NIC_CONSTRUCTOR))
33688 }
33690 /* Save the tokens that make up the body of a member function defined
33691 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
33692 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
33693 specifiers applied to the declaration. Returns the FUNCTION_DECL
33694 for the member function. */
33696 static tree
33700 tree attributes)
33701 {
33704 tree fn;
33707 /* Create the FUNCTION_DECL. */
33711 /* If something went badly wrong, bail out now. */
33713 {
33714 /* If there's a function-body, skip it. */
33719 }
33721 /* Remember it, if there are default args to post process. */
33724 /* Save away the tokens that make up the body of the
33725 function. */
33731 RID_TRANSACTION_ATOMIC))
33732 {
33734 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
33741 {
33747 }
33748 else
33751 {
33755 }
33756 }
33758 /* Handle function try blocks. */
33760 {
33763 }
33764 /* We can have braced-init-list mem-initializers before the fn body. */
33766 {
33769 {
33770 /* cache_group will stop after an un-nested { } pair, too. */
33774 /* variadic mem-inits have ... after the ')'. */
33777 }
33778 }
33780 /* Handle function try blocks. */
33786 /* Save away the inline definition; we will process it when the
33787 class is complete. */
33791 /* We need to know that this was defined in the class, so that
33792 friend templates are handled correctly. */
33795 /* Add FN to the queue of functions to be parsed later. */
33799 }
33801 /* Save the tokens that make up the in-class initializer for a non-static
33802 data member. Returns a DEFERRED_PARSE. */
33804 static tree
33806 {
33808 }
33810 /* Parse a template-argument-list, as well as the trailing ">" (but
33811 not the opening "<"). See cp_parser_template_argument_list for the
33812 return value. */
33814 static tree
33816 {
33817 tree arguments;
33818 tree saved_scope;
33819 tree saved_qualifying_scope;
33820 tree saved_object_scope;
33823 /* [temp.names]
33825 When parsing a template-id, the first non-nested `>' is taken as
33826 the end of the template-argument-list rather than a greater-than
33827 operator. */
33828 saved_greater_than_is_operator_p
33831 /* Parsing the argument list may modify SCOPE, so we save it
33832 here. */
33836 /* We need to evaluate the template arguments, even though this
33837 template-id may be nested within a "sizeof". */
33838 cp_evaluated ev;
33839 /* Parse the template-argument-list itself. */
33844 {
33847 }
33848 else
33850 /* Look for the `>' that ends the template-argument-list. If we find
33851 a '>>' instead, it's probably just a typo. */
33853 {
33855 {
33856 /* In C++0x, a `>>' in a template argument list or cast
33857 expression is considered to be two separate `>'
33858 tokens. So, change the current token to a `>', but don't
33859 consume it: it will be consumed later when the outer
33860 template argument list (or cast expression) is parsed.
33861 Note that this replacement of `>' for `>>' is necessary
33862 even if we are parsing tentatively: in the tentative
33863 case, after calling
33864 cp_parser_enclosed_template_argument_list we will always
33865 throw away all of the template arguments and the first
33866 closing `>', either because the template argument list
33867 was erroneous or because we are replacing those tokens
33868 with a CPP_TEMPLATE_ID token. The second `>' (which will
33869 not have been thrown away) is needed either to close an
33870 outer template argument list or to complete a new-style
33871 cast. */
33874 }
33876 {
33877 /* If we're in a nested template argument list, the '>>' has
33878 to be a typo for '> >'. We emit the error message, but we
33879 continue parsing and we push a '>' as next token, so that
33880 the argument list will be parsed correctly. Note that the
33881 global source location is still on the token before the
33882 '>>', so we need to say explicitly where we want it. */
33890 }
33891 else
33892 {
33893 /* If this is not a nested template argument list, the '>>'
33894 is a typo for '>'. Emit an error message and continue.
33895 Same deal about the token location, but here we can get it
33896 right by consuming the '>>' before issuing the diagnostic. */
33899 "spurious %<>>%>, use %<>%> to terminate "
33901 }
33902 }
33903 /* Similarly for >>= and >=. */
33906 {
33912 {
33915 }
33917 {
33920 else
33923 }
33924 else
33925 {
33928 }
33934 }
33935 else
33937 /* The `>' token might be a greater-than operator again now. */
33938 parser->greater_than_is_operator_p
33940 /* Restore the SAVED_SCOPE. */
33946 }
33948 /* MEMBER_FUNCTION is a member function, or a friend. If default
33949 arguments, or the body of the function have not yet been parsed,
33950 parse them now. */
33952 static void
33954 {
33957 /* If this member is a template, get the underlying
33958 FUNCTION_DECL. */
33962 /* There should not be any class definitions in progress at this
33963 point; the bodies of members are only parsed outside of all class
33964 definitions. */
33966 /* While we're parsing the member functions we might encounter more
33967 classes. We want to handle them right away, but we don't want
33968 them getting mixed up with functions that are currently in the
33969 queue. */
33972 /* Make sure that any template parameters are in scope. */
33975 /* If the body of the function has not yet been parsed, parse it
33976 now. Except if the tokens have been purged (PR c++/39751). */
33979 {
33980 tree function_scope;
33983 /* The function is no longer pending; we are processing it. */
33988 /* If this is a local class, enter the scope of the containing
33989 function. */
33994 /* Push the body of the function onto the lexer stack. */
33997 /* Let the front end know that we going to be defining this
33998 function. */
34002 /* #pragma omp declare reduction needs special parsing. */
34004 {
34009 }
34010 else
34011 /* Now, parse the body of the function. */
34015 /* Leave the scope of the containing function. */
34019 }
34021 /* Remove any template parameters from the symbol table. */
34024 /* Restore the queue. */
34026 }
34028 /* If DECL contains any default args, remember it on the unparsed
34029 functions queue. */
34031 static void
34033 {
34034 tree probe;
34037 probe;
34040 {
34044 }
34046 /* Remember if there is a noexcept-specifier to post process. */
34051 /* Contracts are deferred. */
34054 {
34057 }
34058 }
34060 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
34061 which is either a FIELD_DECL or PARM_DECL. Parse it and return
34062 the result. For a PARM_DECL, PARMTYPE is the corresponding type
34063 from the parameter-type-list. */
34065 static tree
34068 {
34070 tree parsed_arg;
34075 /* Push the saved tokens for the default argument onto the parser's
34076 lexer stack. */
34082 /* Parse the default argument. */
34093 {
34094 /* In a non-template class, check conversions now. In a template,
34095 we'll wait and instantiate these as needed. */
34098 tf_warning_or_error);
34101 else
34103 }
34105 /* If the token stream has not been completely used up, then
34106 there was extra junk after the end of the default
34107 argument. */
34109 {
34112 else
34114 }
34116 /* Revert to the main lexer. */
34120 }
34122 /* FIELD is a non-static data member with an initializer which we saved for
34123 later; parse it now. */
34125 static void
34127 {
34128 tree def;
34135 NULL_TREE);
34141 }
34143 /* FN is a FUNCTION_DECL which may contains a parameter with an
34144 unparsed DEFERRED_PARSE. Parse the default args now. This function
34145 assumes that the current scope is the scope in which the default
34146 argument should be processed. */
34148 static void
34150 {
34153 /* While we're parsing the default args, we might (due to the
34154 statement expression extension) encounter more classes. We want
34155 to handle them right away, but we don't want them getting mixed
34156 up with default args that are currently in the queue. */
34159 /* Local variable names (and the `this' keyword) may not appear
34160 in a default argument. */
34168 /* Gather the PARM_DECLs into a vec so we can keep track of them when
34169 pushdecl clears DECL_CHAIN. */
34170 releasing_vec parms;
34180 {
34182 tree parsed_arg;
34191 /* This can happen for a friend declaration for a function
34192 already declared with default arguments. */
34195 parsed_arg
34197 default_arg,
34201 /* Update any instantiations we've already created. */
34204 }
34208 /* Restore DECL_CHAINs after clobbering by pushdecl. */
34211 {
34214 }
34218 /* Make sure no default arg is missing. */
34221 /* Restore the state of local_variables_forbidden_p. */
34224 /* Restore the queue. */
34226 }
34228 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
34230 sizeof ... ( identifier )
34232 where the 'sizeof' token has already been consumed. */
34234 static tree
34236 {
34237 /* Consume the `...'. */
34241 matching_parens parens;
34245 else
34253 /* The name is not qualified. */
34273 }
34275 /* Parse the operand of `sizeof' (or a similar operator). Returns
34276 either a TYPE or an expression, depending on the form of the
34277 input. The KEYWORD indicates which kind of expression we have
34278 encountered. */
34280 static tree
34282 {
34289 /* If it's a `...', then we are computing the length of a parameter
34290 pack. */
34295 /* Types cannot be defined in a `sizeof' expression. Save away the
34296 old message. */
34299 parser->type_definition_forbidden_message
34301 parser->type_definition_forbidden_message_arg
34304 /* The restrictions on constant-expressions do not apply inside
34305 sizeof expressions. */
34306 saved_integral_constant_expression_p
34308 saved_non_integral_constant_expression_p
34315 /* Do not actually evaluate the expression. */
34318 /* If it's a `(', then we might be looking at the type-id
34319 construction. */
34321 {
34326 /* We can't be sure yet whether we're looking at a type-id or an
34327 expression. */
34330 matching_parens parens;
34333 /* Note: as a GNU Extension, compound literals are considered
34334 postfix-expressions as they are in C99, so they are valid
34335 arguments to sizeof. See comment in cp_parser_cast_expression
34336 for details. */
34339 else
34340 {
34343 /* Look for the type-id. */
34345 /* Look for the closing `)'. */
34348 }
34350 /* If all went well, then we're done. */
34353 else
34354 {
34355 /* Commit to the tentative_firewall so we get syntax errors. */
34359 }
34360 }
34361 else
34364 /* Go back to evaluating expressions. */
34368 /* And restore the old one. */
34371 parser->integral_constant_expression_p
34373 parser->non_integral_constant_expression_p
34377 }
34379 /* If the current declaration has no declarator, return true. */
34381 static bool
34383 {
34384 /* If the next token is a `;' or a `,' then there is no
34385 declarator. */
34388 }
34390 /* Update the DECL_SPECS to reflect the storage class indicated by
34391 KEYWORD. */
34393 static void
34398 {
34399 cp_storage_class storage_class;
34402 {
34420 }
34423 {
34427 }
34429 {
34437 else
34444 }
34449 {
34452 }
34457 /* A storage class specifier cannot be applied alongside a typedef
34458 specifier. If there is a typedef specifier present then set
34459 conflicting_specifiers_p which will trigger an error later
34460 on in grokdeclarator. */
34463 {
34471 }
34472 }
34474 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
34475 is true, the type is a class or enum definition. */
34477 static void
34479 tree type_spec,
34482 {
34485 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
34486 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
34487 this is what happened. In system headers, we ignore these
34488 declarations so that G++ can work with system headers that are not
34489 C++-safe. */
34491 && !type_definition_p
34504 {
34507 ds_redefined_builtin_type_spec,
34508 token);
34510 {
34514 }
34515 }
34518 else
34519 {
34524 }
34525 }
34527 /* True iff TOKEN is the GNU keyword __thread. */
34529 static bool
34531 {
34534 }
34536 /* Set the location for a declarator specifier and check if it is
34537 duplicated.
34539 DECL_SPECS is the sequence of declarator specifiers onto which to
34540 set the location.
34542 DS is the single declarator specifier to set which location is to
34543 be set onto the existing sequence of declarators.
34545 LOCATION is the location for the declarator specifier to
34546 consider. */
34548 static void
34551 {
34560 {
34564 }
34565 else
34566 {
34568 {
34572 else
34573 {
34576 OPT_Wlong_long,
34578 }
34579 }
34581 {
34585 {
34589 }
34590 else
34591 {
34594 }
34595 }
34596 else
34597 {
34598 /* These correspond to cp-tree.h:cp_decl_spec,
34599 changes here should also be reflected there. */
34618 "this"
34619 };
34623 }
34624 }
34625 }
34627 /* Return true iff the declarator specifier DS is present in the
34628 sequence of declarator specifiers DECL_SPECS. */
34630 bool
34632 cp_decl_spec ds)
34633 {
34640 }
34642 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
34643 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
34645 static bool
34647 {
34649 }
34651 /* Issue an error message indicating that TOKEN_DESC was expected.
34652 If KEYWORD is true, it indicated this function is called by
34653 cp_parser_require_keword and the required token can only be
34654 a indicated keyword.
34656 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
34657 within any error as the location of an "opening" token matching
34658 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
34659 RT_CLOSE_PAREN). */
34661 static void
34663 required_token token_desc,
34665 location_t matching_location)
34666 {
34672 {
34747 }
34750 {
34752 {
34830 }
34831 }
34835 }
34838 /* If the next token is of the indicated TYPE, consume it. Otherwise,
34839 issue an error message indicating that TOKEN_DESC was expected.
34841 Returns the token consumed, if the token had the appropriate type.
34842 Otherwise, returns NULL.
34844 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
34845 within any error as the location of an "opening" token matching
34846 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
34847 RT_CLOSE_PAREN). */
34852 required_token token_desc,
34853 location_t matching_location)
34854 {
34857 else
34858 {
34859 /* Output the MESSAGE -- unless we're parsing tentatively. */
34862 matching_location);
34864 }
34865 }
34867 /* Skip an entire parameter list from start to finish. The next token must
34868 be the initial "<" of the parameter list. Returns true on success and
34869 false otherwise. */
34871 static bool
34873 {
34874 /* Consume the "<" because cp_parser_skip_to_end_of_template_parameter_list
34875 requires it. */
34878 }
34880 /* Ensure we are at the end of a template parameter list. If we are, return.
34881 If we are not, something has gone wrong, in which case issue an error and
34882 skip to end of the parameter list. */
34884 static void
34886 {
34887 /* Are we ready, yet? If not, issue error message. */
34892 }
34894 /* You should only call this function from inside a template parameter list
34895 (i.e. the current token should at least be the initial "<" of the
34896 parameter list). If you are skipping the entire list, it may be better to
34897 use cp_parser_skip_entire_template_parameter_list.
34899 Tokens are skipped until the final ">" is found, or if we see
34900 '{', '}', ';', or if we find an unbalanced ')' or ']'.
34902 Returns true if we successfully reached the end, and false if
34903 something unexpected happened (e.g. end of file). */
34905 static bool
34907 {
34908 /* Current level of '< ... >'. */
34910 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
34913 /* Skip tokens until the desired token is found. */
34915 {
34916 /* Peek at the next token. */
34918 {
34926 /* C++0x views the `>>' operator as two `>' tokens, but
34927 C++98 does not. */
34930 {
34931 /* We've hit a `>>' where the first `>' closes the
34932 template argument list, and the second `>' is
34933 spurious. Just consume the `>>' and stop; we've
34934 already produced at least one error. */
34937 }
34938 /* Fall through for C++0x, so we handle the second `>' in
34939 the `>>'. */
34944 {
34945 /* We've reached the token we want, consume it and stop. */
34948 }
34967 /* The '>' was probably forgotten, don't look further. */
34972 }
34974 /* Consume this token. */
34976 }
34977 }
34979 /* If the next token is the indicated keyword, consume it. Otherwise,
34980 issue an error message indicating that TOKEN_DESC was expected.
34982 Returns the token consumed, if the token had the appropriate type.
34983 Otherwise, returns NULL. */
34988 required_token token_desc)
34989 {
34993 {
34995 UNKNOWN_LOCATION);
34997 }
35000 }
35002 /* Returns TRUE iff TOKEN is a token that can begin the body of a
35003 function-definition. */
35005 static bool
35007 {
35010 /* A ctor-initializer begins with a `:'. */
35012 /* A function-try-block begins with `try'. */
35014 /* A function-transaction-block begins with `__transaction_atomic'
35015 or `__transaction_relaxed'. */
35018 /* The named return value extension begins with `return'. */
35020 }
35022 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
35023 definition. */
35025 static bool
35027 {
35034 }
35036 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
35037 C++0x) ending a template-argument. */
35039 static bool
35041 {
35049 /* For better diagnostics, treat >>= like that too, that
35050 shouldn't appear non-nested in template arguments. */
35052 }
35054 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
35055 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
35057 static bool
35060 {
35066 /* Check for the sequence `<::' in the original code. It would be lexed as
35067 `[:', where `[' is a digraph, and there is no whitespace before
35068 `:'. */
35070 {
35075 }
35077 }
35079 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
35080 or none_type otherwise. */
35082 static enum tag_types
35084 {
35086 {
35096 }
35097 }
35099 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
35100 or none_type otherwise or if the token is null. */
35102 static enum tag_types
35104 {
35109 {
35117 }
35118 }
35120 /* Diagnose redundant enum-keys. */
35122 static void
35125 {
35131 /* Look up the NAME to see if it unambiguously refers to the TYPE. */
35136 /* The enum-key is redundant for uses of the TYPE that are not
35137 declarations and for which name lookup returns just the type
35138 itself. */
35146 {
35147 /* Avoid issuing the diagnostic for apparently redundant (unscoped)
35148 enum tag in shared C/C++ code in files (such as headers) included
35149 in the main source file. */
35152 LRK_MACRO_DEFINITION_LOCATION,
35156 }
35164 }
35166 /* Describes the set of declarations of a struct, class, or class template
35167 or its specializations. Used for -Wmismatched-tags. */
35169 class class_decl_loc_t
35170 {
35175 {
35177 }
35179 /* Constructs an object for a single declaration of a class with
35180 CLASS_KEY at the current location in the current function (or
35181 at another scope). KEY_REDUNDANT is true if the class-key may
35182 be omitted in the current context without an ambiguity with
35183 another symbol with the same name.
35184 DEF_P is true for a class declaration that is a definition.
35185 CURLOC is the associated location. */
35189 {
35192 key_redundant);
35194 }
35196 /* Copy, assign, and destroy the object. Necessary because LOCVEC
35197 isn't safely copyable and assignable and doesn't release storage
35198 on its own. */
35202 { }
35205 {
35213 }
35216 {
35218 }
35220 /* Issues -Wmismatched-tags for a single class. */
35223 /* Issues -Wmismatched-tags for all classes. */
35226 /* Adds TYPE_DECL to the collection of class decls and diagnoses
35227 redundant tags (if -Wredundant-tags is enabled). */
35230 /* Either adds this decl to the collection of class decls
35231 or diagnoses it, whichever is appropriate. */
35237 {
35239 }
35242 {
35244 }
35247 {
35249 }
35252 {
35254 }
35256 /* True if a definition for the class has been seen. */
35258 {
35260 }
35262 /* The location of a single mention of a class type with the given
35263 class-key. */
35264 struct class_key_loc_t
35265 {
35268 { }
35270 /* The function the type is mentioned in. */
35271 tree func;
35272 /* The exact location. */
35273 location_t loc;
35274 /* The class-key used in the mention of the type. */
35275 tag_types class_key;
35276 /* True when the class-key could be omitted at this location
35277 without an ambiguity with another symbol of the same name. */
35279 };
35280 /* Avoid using auto_vec here since it's not safe to copy due to pr90904. */
35282 /* LOCVEC index of the definition or UINT_MAX if none exists. */
35284 /* The class-key the class was last declared with or none_type when
35285 it has been declared with a mismatched key. */
35286 tag_types def_class_key;
35288 /* A mapping between a TYPE_DECL for a class and the class_decl_loc_t
35289 description above. */
35292 };
35296 /* Issue an error message if the CLASS_KEY does not match the TYPE.
35297 DEF_P is expected to be set for a definition of class TYPE. DECL_P
35298 is set for a declaration of class TYPE and clear for a reference to
35299 it that is not a declaration of it. */
35301 static void
35305 {
35311 {
35315 type))
35319 }
35324 /* Only consider the true class-keys below and ignore typename_type,
35325 etc. that are not C++ class-keys. */
35332 }
35334 /* Returns the template or specialization of one to which the RECORD_TYPE
35335 TYPE corresponds. */
35337 static tree
35339 {
35342 /* Determine the template or its partial specialization to which TYPE
35343 corresponds. */
35352 }
35355 /* Adds the class TYPE to the collection of class decls and diagnoses
35356 redundant tags (if -Wredundant-tags is enabled).
35357 DEF_P is expected to be set for a definition of class TYPE. DECL_P
35358 is set for a (likely, based on syntactic context) declaration of class
35359 TYPE and clear for a reference to it that is not a declaration of it. */
35361 void
35364 {
35367 /* Look up the NAME to see if it unambiguously refers to the TYPE
35368 and set KEY_REDUNDANT if so. */
35373 /* The class-key is redundant for uses of the CLASS_TYPE that are
35374 neither definitions of it nor declarations, and for which name
35375 lookup returns just the type itself. */
35386 {
35387 /* Avoid issuing the diagnostic for apparently redundant struct
35388 and union class-keys in shared C/C++ code in files (such as
35389 headers) included in the main source file. */
35392 LRK_MACRO_DEFINITION_LOCATION,
35396 }
35398 /* Set if a declaration of TYPE has previously been seen or if it must
35399 exist in a precompiled header. */
35403 {
35406 {
35407 /* TYPE_DECL is the first declaration or definition of the type
35408 (outside precompiled headers -- see below). Just create
35409 a new entry for it and return unless it's a declaration
35410 involving a template that may need to be diagnosed by
35411 -Wredundant-tags. */
35415 }
35416 else
35417 {
35418 /* TYPE was previously defined in some unknown precompiled header.
35419 Simply add a record of its definition at an unknown location and
35420 proceed below to add a reference to it at the current location.
35421 (Declarations in precompiled headers that are not definitions
35422 are ignored.) */
35423 tag_types def_key
35428 }
35429 }
35431 /* A prior declaration of TYPE_DECL has been seen. */
35434 {
35441 type);
35442 }
35445 /* Do nothing if this is the first declaration of the type. */
35449 /* Do nothing if the class-key in this declaration matches
35450 the definition. */
35454 def_p);
35455 }
35457 /* Either adds this DECL corresponding to the TYPE_DECL to the collection
35458 of class decls or diagnoses it, whichever is appropriate. */
35460 void
35462 tag_types class_key,
35465 {
35466 /* Reset the CLASS_KEY associated with this type on mismatch.
35467 This is an optimization that lets the diagnostic code skip
35468 over classes that use the same class-key in all declarations. */
35472 /* Set IDXDEF to the index of the vector corresponding to
35473 the definition. */
35477 /* Append a record of this declaration to the vector. */
35479 redundant);
35485 /* As a space optimization diagnose declarations of a class
35486 whose definition has been seen and purge the LOCVEC of
35487 all entries except the definition. */
35490 {
35496 }
35497 else
35498 /* Pop the entry pushed above for this declaration. */
35500 }
35502 /* Issues -Wmismatched-tags for a single class. */
35504 void
35506 {
35510 /* Number of uses of the class. */
35513 /* The class (or template) declaration guiding the decisions about
35514 the diagnostic. For ordinary classes it's the same as THIS. For
35515 uses of instantiations of templates other than their declarations
35516 it points to the record for the declaration of the corresponding
35517 primary template or partial specialization. */
35522 {
35523 /* For implicit instantiations of a primary template look up
35524 the primary or partial specialization and use it as
35525 the expected class-key rather than using the class-key of
35526 the first reference to the instantiation. The primary must
35527 be (and inevitably is) at index zero. */
35530 /* It's possible that we didn't find SPEC. Consider:
35532 template<typename T> struct A {
35533 template<typename U> struct W { };
35534 };
35535 struct A<int>::W<int> w; // #1
35537 where while parsing A and #1 we've stashed
35538 A<T>
35539 A<T>::W<U>
35540 A<int>::W<int>
35541 into CLASS2LOC. If TYPE is A<int>::W<int>, specialization_of
35542 will yield A<int>::W<U> which may be in CLASS2LOC if we had
35543 an A<int> class specialization, but otherwise won't be in it.
35544 So try to look up A<T>::W<U>. */
35546 {
35549 }
35550 /* Now we really should have found something. */
35552 }
35553 /* Skip declarations that consistently use the same class-key. */
35557 /* Set if a definition for the class has been seen. */
35560 /* The index of the declaration whose class-key this declaration
35561 is expected to match. It's either the class-key of the class
35562 definition if one exists or the first declaration otherwise. */
35565 /* The class-key the class is expected to be declared with: it's
35566 either the key used in its definition or the first declaration
35567 if no definition has been provided.
35568 For implicit instantiations of a primary template it's
35569 the class-key used to declare the primary with. The primary
35570 must be at index zero. */
35574 /* Advance IDX to the first declaration that either is not
35575 a definition or that doesn't match the first declaration
35576 if no definition is provided. */
35581 /* Save the current function before changing it below. */
35583 /* Set the function declaration to print in diagnostic context. */
35591 auto_diagnostic_group d;
35592 /* Issue a warning for the first mismatched declaration.
35593 Avoid using "%#qT" since the class-key for the same type will
35594 be the same regardless of which one was used in the declaraion. */
35598 {
35599 /* Suggest how to avoid the warning for each instance since
35600 the guidance may be different depending on context. */
35602 (key_redundant_p
35605 xpectkstr);
35607 /* Also point to the first declaration or definition that guided
35608 the decision to issue the warning above. */
35610 (def_p
35614 }
35616 /* Issue warnings for the remaining inconsistent declarations. */
35618 {
35620 /* Skip over the declarations that match either the definition
35621 if one was provided or the first declaration. */
35627 /* Set the function declaration to print in diagnostic context. */
35632 /* Suggest how to avoid the warning for each instance since
35633 the guidance may be different depending on context. */
35635 (key_redundant_p
35638 xpectkstr);
35639 }
35641 /* Restore the current function in case it was replaced above. */
35643 }
35645 /* Issues -Wmismatched-tags for all classes. Called at the end
35646 of processing a translation unit, after declarations of all class
35647 types and their uses have been recorded. */
35649 void
35651 {
35652 /* CLASS2LOC should be empty if both -Wmismatched-tags and
35653 -Wredundant-tags are disabled. */
35655 || warn_redundant_tags
35658 /* Save the current function before changing on return. It should
35659 be null at this point. */
35663 {
35664 /* Iterate over the collected class/struct/template declarations. */
35667 {
35671 }
35672 }
35675 }
35677 /* Issue an error message if DECL is redeclared with different
35678 access than its original declaration [class.access.spec/3].
35679 This applies to nested classes, nested class templates and
35680 enumerations [class.mem/1]. */
35682 static void
35684 {
35696 }
35698 /* Look for the `template' keyword, as a syntactic disambiguator.
35699 Return TRUE iff it is present, in which case it will be
35700 consumed. */
35702 static bool
35704 {
35706 {
35707 /* In C++98 the `template' keyword can only be used within templates;
35708 outside templates the parser can always figure out what is a
35709 template and what is not. In C++11, per the resolution of DR 468,
35710 `template' is allowed in cases where it is not strictly necessary. */
35713 {
35716 "in C++98 %<template%> (as a disambiguator) is only "
35718 /* If this part of the token stream is rescanned, the same
35719 error message would be generated. So, we purge the token
35720 from the stream. */
35723 }
35724 else
35725 {
35726 /* Consume the `template' keyword. */
35729 }
35730 }
35732 }
35734 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
35735 set PARSER->SCOPE, and perform other related actions. */
35737 static void
35739 {
35742 /* Get the stored value. */
35744 /* Set the scope from the stored value. */
35749 }
35751 /* Consume tokens up through a non-nested END token. Returns TRUE if we
35752 encounter the end of a block before what we were looking for. */
35754 static bool
35758 {
35760 {
35763 /* Abort a parenthesized expression if we encounter a semicolon. */
35767 /* If we've reached the end of the file, stop. */
35773 /* We've hit the end of an enclosing block, so there's been some
35774 kind of syntax error. */
35777 /* Consume the token. */
35779 /* See if it starts a new group. */
35781 {
35783 /* In theory this should probably check end == '}', but
35784 cp_parser_save_member_function_body needs it to exit
35785 after either '}' or ')' when called with ')'. */
35788 }
35790 {
35794 }
35799 }
35800 }
35802 /* Like above, for caching a default argument or NSDMI. Both of these are
35803 terminated by a non-nested comma, but it can be unclear whether or not a
35804 comma is nested in a template argument list unless we do more parsing.
35805 In order to handle this ambiguity, when we encounter a ',' after a '<'
35806 we try to parse what follows as a parameter-declaration-list (in the
35807 case of a default argument) or a member-declarator (in the case of an
35808 NSDMI). If that succeeds, then we stop caching. */
35810 static tree
35812 {
35817 tree default_argument;
35819 /* Add tokens until we have processed the entire default
35820 argument. We add the range [first_token, token). */
35823 {
35824 /* For list-initialization, this is straightforward. */
35827 }
35829 {
35832 /* Peek at the next token. */
35834 /* What we do depends on what token we have. */
35836 {
35837 /* In valid code, a default argument must be
35838 immediately followed by a `,' `)', or `...'. */
35841 {
35842 /* If we've seen a '<', we might be in a
35843 template-argument-list. Until Core issue 325 is
35844 resolved, we don't know how this situation ought
35845 to be handled, so try to DTRT. We check whether
35846 what comes after the comma is a valid parameter
35847 declaration list. If it is, then the comma ends
35848 the default argument; otherwise the default
35849 argument continues. */
35853 /* Set ITALP so cp_parser_parameter_declaration_list
35854 doesn't decide to commit to this parse. */
35861 {
35862 /* Parse declarators until we reach a non-comma or
35863 somthing that cannot be an initializer.
35864 Just checking whether we're looking at a single
35865 declarator is insufficient. Consider:
35866 int var = tuple<T,U>::x;
35867 The template parameter 'U' looks exactly like a
35868 declarator. */
35869 do
35870 {
35874 CP_PARSER_FLAGS_NONE,
35883 }
35885 /* If we met an '=' or ';' then the original comma
35886 was the end of the NSDMI. Otherwise assume
35887 we're still in the NSDMI. */
35890 }
35891 else
35892 {
35895 tree t = cp_parser_parameter_declaration_list
35901 }
35908 }
35909 /* FALLTHRU */
35912 /* If we run into a non-nested `;', `}', or `]',
35913 then the code is invalid -- but the default
35914 argument is certainly over. */
35919 /* Handle correctly int n = sizeof ... ( p ); */
35922 /* Update DEPTH, if necessary. */
35937 /* This might be the comparison operator, or it might
35938 start a template argument list. */
35945 /* Fall through for C++0x, which treats the `>>'
35946 operator like two `>' tokens in certain
35947 cases. */
35952 {
35953 /* This might be an operator, or it might close a
35954 template argument list. But if a previous '<'
35955 started a template argument list, this will have
35956 closed it, so we can't be in one anymore. */
35960 }
35963 /* If we run out of tokens, issue an error message. */
35971 /* In these cases, we should look for template-ids.
35972 For example, if the default argument is
35973 `X<int, double>()', we need to do name lookup to
35974 figure out whether or not `X' is a template; if
35975 so, the `,' does not end the default argument.
35977 That is not yet done. */
35982 }
35984 /* If we've reached the end, stop. */
35988 /* Add the token to the token block. */
35990 }
35992 /* Create a DEFERRED_PARSE to represent the unparsed default
35993 argument. */
36000 }
36002 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
36004 location_t
36006 {
36011 }
36013 /* Begin parsing tentatively. We always save tokens while parsing
36014 tentatively so that if the tentative parsing fails we can restore the
36015 tokens. */
36017 static void
36019 {
36020 /* Enter a new parsing context. */
36022 /* Begin saving tokens. */
36024 /* In order to avoid repetitive access control error messages,
36025 access checks are queued up until we are no longer parsing
36026 tentatively. */
36028 }
36030 /* Commit to the currently active tentative parse. */
36032 static void
36034 {
36038 /* Mark all of the levels as committed. */
36041 {
36048 }
36049 }
36051 /* Commit to the topmost currently active tentative parse.
36053 Note that this function shouldn't be called when there are
36054 irreversible side-effects while in a tentative state. For
36055 example, we shouldn't create a permanent entry in the symbol
36056 table, or issue an error message that might not apply if the
36057 tentative parse is aborted. */
36059 static void
36061 {
36066 {
36074 }
36075 }
36077 /* Abort the currently active tentative parse. All consumed tokens
36078 will be rolled back, and no diagnostics will be issued. */
36080 static void
36082 {
36086 /* Now, pretend that we want to see if the construct was
36087 successfully parsed. */
36089 }
36091 /* Stop parsing tentatively. If a parse error has occurred, restore the
36092 token stream. Otherwise, commit to the tokens we have consumed.
36093 Returns true if no error occurred; false otherwise. */
36095 static bool
36097 {
36101 /* Remember whether or not an error occurred, since we are about to
36102 destroy that information. */
36104 /* Remove the topmost context from the stack. */
36107 /* If no parse errors occurred, commit to the tentative parse. */
36109 {
36110 /* Commit to the tokens read tentatively, unless that was
36111 already done. */
36116 }
36117 /* Otherwise, if errors occurred, roll back our state so that things
36118 are just as they were before we began the tentative parse. */
36119 else
36120 {
36123 }
36124 /* Add the context to the front of the free list. */
36129 }
36131 /* Returns true if we are parsing tentatively and are not committed to
36132 this tentative parse. */
36134 static bool
36136 {
36139 }
36141 /* Returns nonzero iff an error has occurred during the most recent
36142 tentative parse. */
36144 static bool
36146 {
36149 }
36151 /* Returns nonzero if GNU extensions are allowed. */
36153 static bool
36155 {
36157 }
36158 \f
36159 /* Objective-C++ Productions */
36162 /* Parse an Objective-C expression, which feeds into a primary-expression
36163 above.
36165 objc-expression:
36166 objc-message-expression
36167 objc-string-literal
36168 objc-encode-expression
36169 objc-protocol-expression
36170 objc-selector-expression
36172 Returns a tree representation of the expression. */
36174 static cp_expr
36176 {
36177 /* Try to figure out what kind of declaration is present. */
36181 {
36191 {
36203 }
36204 /* FALLTHRU */
36210 }
36213 }
36215 /* Parse an Objective-C message expression.
36217 objc-message-expression:
36218 [ objc-message-receiver objc-message-args ]
36220 Returns a representation of an Objective-C message. */
36222 static tree
36224 {
36237 /* Construct a location e.g.
36238 [self func1:5]
36239 ^~~~~~~~~~~~~~
36240 ranging from the '[' to the ']', with the caret at the start. */
36246 }
36248 /* Parse an objc-message-receiver.
36250 objc-message-receiver:
36251 expression
36252 simple-type-specifier
36254 Returns a representation of the type or expression. */
36256 static tree
36258 {
36259 tree rcv;
36261 /* An Objective-C message receiver may be either (1) a type
36262 or (2) an expression. */
36266 /* If that worked out, fine. */
36273 CP_PARSER_FLAGS_NONE);
36280 }
36282 /* Parse the arguments and selectors comprising an Objective-C message.
36284 objc-message-args:
36285 objc-selector
36286 objc-selector-args
36287 objc-selector-args , objc-comma-args
36289 objc-selector-args:
36290 objc-selector [opt] : assignment-expression
36291 objc-selector-args objc-selector [opt] : assignment-expression
36293 objc-comma-args:
36294 assignment-expression
36295 objc-comma-args , assignment-expression
36297 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
36298 selector arguments and TREE_VALUE containing a list of comma
36299 arguments. */
36301 static tree
36303 {
36309 {
36315 /* Detect if we have a unary selector. */
36324 sel_args
36329 }
36331 /* Handle non-selector arguments, if any. */
36333 {
36334 tree arg;
36339 addl_args
36344 }
36347 {
36350 }
36353 }
36355 /* Parse an Objective-C encode expression.
36357 objc-encode-expression:
36358 @encode objc-typename
36360 Returns an encoded representation of the type argument. */
36362 static cp_expr
36364 {
36365 tree type;
36370 matching_parens parens;
36377 {
36381 }
36383 /* This happens if we find @encode(T) (where T is a template
36384 typename or something dependent on a template typename) when
36385 parsing a template. In that case, we can't compile it
36386 immediately, but we rather create an AT_ENCODE_EXPR which will
36387 need to be instantiated when the template is used.
36388 */
36390 {
36394 }
36397 /* Build a location of the form:
36398 @encode(int)
36399 ^~~~~~~~~~~~
36400 with caret==start at the @ token, finishing at the close paren. */
36404 }
36406 /* Parse an Objective-C @defs expression. */
36408 static tree
36410 {
36411 tree name;
36414 matching_parens parens;
36420 }
36422 /* Parse an Objective-C protocol expression.
36424 objc-protocol-expression:
36425 @protocol ( identifier )
36427 Returns a representation of the protocol expression. */
36429 static tree
36431 {
36432 tree proto;
36436 matching_parens parens;
36441 /* Build a location of the form:
36442 @protocol(prot)
36443 ^~~~~~~~~~~~~~~
36444 with caret==start at the @ token, finishing at the close paren. */
36449 }
36451 /* Parse an Objective-C selector expression.
36453 objc-selector-expression:
36454 @selector ( objc-method-signature )
36456 objc-method-signature:
36457 objc-selector
36458 objc-selector-seq
36460 objc-selector-seq:
36461 objc-selector :
36462 objc-selector-seq objc-selector :
36464 Returns a representation of the method selector. */
36466 static tree
36468 {
36475 matching_parens parens;
36481 {
36490 {
36491 /* Detect if we have a unary selector. */
36493 {
36496 }
36497 else
36498 {
36500 }
36501 }
36506 {
36507 sel_seq
36510 sel_seq
36513 }
36514 else
36515 sel_seq
36520 }
36522 finish_selector:
36526 /* Build a location of the form:
36527 @selector(func)
36528 ^~~~~~~~~~~~~~~
36529 with caret==start at the @ token, finishing at the close paren. */
36532 /* TODO: objc_build_selector_expr doesn't always honor the location. */
36535 }
36537 /* Parse a list of identifiers.
36539 objc-identifier-list:
36540 identifier
36541 objc-identifier-list , identifier
36543 Returns a TREE_LIST of identifier nodes. */
36545 static tree
36547 {
36548 tree identifier;
36549 tree list;
36560 {
36567 identifier));
36569 }
36572 }
36574 /* Parse an Objective-C alias declaration.
36576 objc-alias-declaration:
36577 @compatibility_alias identifier identifier ;
36579 This function registers the alias mapping with the Objective-C front end.
36580 It returns nothing. */
36582 static void
36584 {
36592 }
36594 /* Parse an Objective-C class forward-declaration.
36596 objc-class-declaration:
36597 @class objc-identifier-list ;
36599 The function registers the forward declarations with the Objective-C
36600 front end. It returns nothing. */
36602 static void
36604 {
36607 {
36608 tree id;
36618 else
36620 }
36622 }
36624 /* Parse a list of Objective-C protocol references.
36626 objc-protocol-refs-opt:
36627 objc-protocol-refs [opt]
36629 objc-protocol-refs:
36630 < objc-identifier-list >
36632 Returns a TREE_LIST of identifiers, if any. */
36634 static tree
36636 {
36640 {
36644 }
36647 }
36649 /* Parse a Objective-C visibility specification. */
36651 static void
36653 {
36657 {
36672 }
36674 /* Eat '@private'/'@protected'/'@public'. */
36676 }
36678 /* Parse an Objective-C method type. Return 'true' if it is a class
36679 (+) method, and 'false' if it is an instance (-) method. */
36683 {
36686 else
36688 }
36690 /* Parse an Objective-C protocol qualifier. */
36692 static tree
36694 {
36707 {
36712 }
36715 }
36717 /* Parse an Objective-C typename. */
36719 static tree
36721 {
36725 {
36728 matching_parens parens;
36732 /* An ObjC type name may consist of just protocol qualifiers, in which
36733 case the type shall default to 'id'. */
36735 {
36738 /* If the type could not be parsed, an error has already
36739 been produced. For error recovery, behave as if it had
36740 not been specified, which will use the default type
36741 'id'. */
36743 {
36745 /* We need to skip to the closing parenthesis as
36746 cp_parser_type_id() does not seem to do it for
36747 us. */
36752 }
36753 }
36757 }
36760 }
36762 /* Check to see if TYPE refers to an Objective-C selector name. */
36764 static bool
36766 {
36772 }
36774 /* Parse an Objective-C selector. */
36776 static tree
36778 {
36782 {
36785 }
36787 /* C++ operator names are allowed to appear in ObjC selectors. */
36789 {
36802 }
36803 }
36805 /* Parse an Objective-C params list. */
36807 static tree
36809 {
36815 {
36825 /* Detect if we have a unary selector. */
36828 {
36831 }
36835 {
36836 /* Something went quite wrong. There should be a colon
36837 here, but there is not. Stop parsing parameters. */
36839 }
36841 /* New ObjC allows attributes on parameters too. */
36846 params
36849 type_name,
36850 identifier,
36851 parm_attr));
36854 }
36857 {
36860 }
36862 /* We allow tail attributes for the method. */
36864 {
36872 }
36875 {
36878 }
36880 }
36882 /* Parse the non-keyword Objective-C params. */
36884 static tree
36887 {
36893 {
36895 tree parm;
36901 {
36906 }
36908 /* TODO: parse attributes for tail parameters. */
36918 }
36920 /* We allow tail attributes for the method. */
36922 {
36924 {
36929 }
36930 else
36931 /* We have an error, but parse the attributes, so that we can
36932 carry on. */
36938 }
36941 }
36943 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
36945 static void
36947 {
36950 /* If the next token is `extern' and the following token is a string
36951 literal, then we have a linkage specification. */
36953 && cp_parser_is_pure_string_literal
36956 /* Handle #pragma, if any. */
36959 /* Allow stray semicolons. */
36962 /* Mark methods as optional or required, when building protocols. */
36964 {
36967 }
36969 {
36972 }
36975 /* Other stray characters must generate errors. */
36977 {
36981 }
36982 /* Finally, try to parse a block-declaration, or a function-definition. */
36983 else
36985 }
36987 /* Parse a method signature. */
36989 static tree
36991 {
37007 }
37009 static bool
37011 {
37012 tree tattr;
37017 /* If the attributes are followed by a method introducer, this is not allowed.
37018 Dump the attributes and flag the situation. */
37023 /* Otherwise, the attributes introduce some interstitial code, possibly so
37024 rewind to allow that check. */
37027 }
37029 /* Parse an Objective-C method prototype list. */
37031 static void
37033 {
37037 {
37039 {
37044 else
37048 {
37052 }
37055 }
37061 OPT_Wattributes,
37063 else
37064 /* Allow for interspersed non-ObjC++ code. */
37068 }
37072 else
37076 }
37078 /* Parse an Objective-C method definition list. */
37080 static void
37082 {
37084 {
37088 {
37091 }
37093 {
37096 }
37098 {
37102 tree attribute;
37106 else
37107 {
37111 /* For historical reasons, we accept an optional semicolon. */
37117 tree meth
37121 }
37122 }
37123 /* The following case will be removed once @synthesize is
37124 completely implemented. */
37135 else
37136 /* Allow for interspersed non-ObjC++ code. */
37138 }
37141 }
37143 /* Parse Objective-C ivars. */
37145 static void
37147 {
37158 {
37159 cp_decl_specifier_seq declspecs;
37161 tree prefix_attributes;
37169 CP_PARSER_FLAGS_OPTIONAL,
37173 /* auto, register, static, extern, mutable. */
37175 {
37178 }
37180 /* thread_local. */
37182 {
37185 }
37187 /* typedef. */
37189 {
37192 }
37197 /* Keep going until we hit the `;' at the end of the
37198 declaration. */
37200 {
37205 /* Check for a (possibly unnamed) bitfield declaration. */
37213 {
37214 /* Get the name of the bitfield. */
37219 eat_colon:
37221 /* Get the width of the bitfield. */
37222 width
37224 }
37225 else
37226 {
37227 /* Parse the declarator. */
37228 declarator
37230 CP_PARSER_FLAGS_NONE,
37236 }
37238 /* Look for attributes that apply to the ivar. */
37240 /* Remember which attributes are prefix attributes and
37241 which are not. */
37243 /* Combine the attributes. */
37247 /* Create the bitfield declaration. */
37250 else
37255 /* Add the instance variable. */
37259 /* Reset PREFIX_ATTRIBUTES. */
37261 {
37266 }
37271 {
37274 }
37276 }
37280 }
37285 /* Do not consume the RID_AT_END, so it will be read again as terminating
37286 the @interface of @implementation. */
37290 /* For historical reasons, we accept an optional semicolon. */
37293 }
37295 /* Parse an Objective-C protocol declaration. */
37297 static void
37299 {
37305 {
37310 }
37312 /* See if we have a forward declaration or a definition. */
37315 /* Try a forward declaration first. */
37317 {
37319 {
37320 tree id;
37330 else
37332 }
37334 }
37336 /* Ok, we got a full-fledged definition (or at least should). */
37337 else
37338 {
37343 }
37344 }
37346 /* Parse an Objective-C superclass or category. */
37348 static void
37353 {
37359 {
37362 }
37364 {
37365 matching_parens parens;
37368 /* If there is no category name, and this is an @interface, we
37369 have a class extension. */
37371 {
37374 }
37375 else
37379 }
37380 }
37382 /* Parse an Objective-C class interface. */
37384 static void
37386 {
37394 {
37395 /* It's hard to recover because even if valid @interface stuff
37396 is to follow, we can't compile it (or validate it) if we
37397 don't even know which class it refers to. Let's assume this
37398 was a stray '@interface' token in the stream and skip it.
37399 */
37401 }
37406 /* We have either a class or a category on our hands. */
37409 else
37410 {
37412 /* Handle instance variable declarations, if any. */
37415 }
37418 }
37420 /* Parse an Objective-C class implementation. */
37422 static void
37424 {
37431 {
37432 /* It's hard to recover because even if valid @implementation
37433 stuff is to follow, we can't compile it (or validate it) if
37434 we don't even know which class it refers to. Let's assume
37435 this was a stray '@implementation' token in the stream and
37436 skip it.
37437 */
37439 }
37443 /* We have either a class or a category on our hands. */
37446 else
37447 {
37449 /* Handle instance variable declarations, if any. */
37452 }
37455 }
37457 /* Consume the @end token and finish off the implementation. */
37459 static void
37461 {
37464 }
37466 /* Parse an Objective-C declaration. */
37468 static void
37470 {
37471 /* Try to figure out what kind of declaration is present. */
37476 {
37492 }
37495 {
37518 }
37519 }
37521 /* Parse an Objective-C try-catch-finally statement.
37523 objc-try-catch-finally-stmt:
37524 @try compound-statement objc-catch-clause-seq [opt]
37525 objc-finally-clause [opt]
37527 objc-catch-clause-seq:
37528 objc-catch-clause objc-catch-clause-seq [opt]
37530 objc-catch-clause:
37531 @catch ( objc-exception-declaration ) compound-statement
37533 objc-finally-clause:
37534 @finally compound-statement
37536 objc-exception-declaration:
37537 parameter-declaration
37538 '...'
37540 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
37542 Returns NULL_TREE.
37544 PS: This function is identical to c_parser_objc_try_catch_finally_statement
37545 for C. Keep them in sync. */
37547 static tree
37549 {
37550 location_t location;
37551 tree stmt;
37556 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
37557 node, lest it get absorbed into the surrounding block. */
37563 {
37567 matching_parens parens;
37573 {
37574 /* We have "@catch (...)" (where the '...' are literally
37575 what is in the code). Skip the '...'.
37576 parameter_declaration is set to NULL_TREE, and
37577 objc_being_catch_clauses() knows that that means
37578 '...'. */
37581 }
37582 else
37583 {
37584 /* We have "@catch (NSException *exception)" or something
37585 like that. Parse the parameter declaration. */
37590 else
37595 }
37598 else
37599 {
37600 /* If there was no open parenthesis, we are recovering from
37601 an error, and we are trying to figure out what mistake
37602 the user has made. */
37604 /* If there is an immediate closing parenthesis, the user
37605 probably forgot the opening one (ie, they typed "@catch
37606 NSException *e)". Parse the closing parenthesis and keep
37607 going. */
37611 /* If these is no immediate closing parenthesis, the user
37612 probably doesn't know that parenthesis are required at
37613 all (ie, they typed "@catch NSException *e"). So, just
37614 forget about the closing parenthesis and keep going. */
37615 }
37619 }
37621 {
37624 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
37625 node, lest it get absorbed into the surrounding block. */
37629 }
37632 }
37634 /* Parse an Objective-C synchronized statement.
37636 objc-synchronized-stmt:
37637 @synchronized ( expression ) compound-statement
37639 Returns NULL_TREE. */
37641 static tree
37643 {
37644 location_t location;
37651 matching_parens parens;
37656 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
37657 node, lest it get absorbed into the surrounding block. */
37662 }
37664 /* Parse an Objective-C throw statement.
37666 objc-throw-stmt:
37667 @throw assignment-expression [opt] ;
37669 Returns a constructed '@throw' statement. */
37671 static tree
37673 {
37685 }
37687 /* Parse an Objective-C statement. */
37689 static tree
37691 {
37692 /* Try to figure out what kind of declaration is present. */
37696 {
37707 }
37710 }
37712 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
37713 look ahead to see if an objc keyword follows the attributes. This
37714 is to detect the use of prefix attributes on ObjC @interface and
37715 @protocol. */
37717 static bool
37719 {
37724 {
37728 else
37731 }
37734 }
37736 /* This routine is a minimal replacement for
37737 c_parser_struct_declaration () used when parsing the list of
37738 types/names or ObjC++ properties. For example, when parsing the
37739 code
37741 @property (readonly) int a, b, c;
37743 this function is responsible for parsing "int a, int b, int c" and
37744 returning the declarations as CHAIN of DECLs.
37746 TODO: Share this code with cp_parser_objc_class_ivars. It's very
37747 similar parsing. */
37748 static tree
37750 {
37752 cp_decl_specifier_seq declspecs;
37754 tree prefix_attributes;
37757 CP_PARSER_FLAGS_NONE,
37764 /* auto, register, static, extern, mutable. */
37766 {
37769 }
37771 /* thread_local. */
37773 {
37776 }
37778 /* typedef. */
37780 {
37783 }
37788 /* Keep going until we hit the `;' at the end of the declaration. */
37790 {
37795 /* Parse the declarator. */
37797 CP_PARSER_FLAGS_NONE,
37800 /* Look for attributes that apply to the ivar. */
37802 /* Remember which attributes are prefix attributes and
37803 which are not. */
37805 /* Combine the attributes. */
37815 /* Reset PREFIX_ATTRIBUTES. */
37817 {
37822 }
37829 {
37832 }
37833 else
37835 }
37837 }
37839 /* Parse an Objective-C @property declaration. The syntax is:
37841 objc-property-declaration:
37842 '@property' objc-property-attributes[opt] struct-declaration ;
37844 objc-property-attributes:
37845 '(' objc-property-attribute-list ')'
37847 objc-property-attribute-list:
37848 objc-property-attribute
37849 objc-property-attribute-list, objc-property-attribute
37851 objc-property-attribute
37852 'getter' = identifier
37853 'setter' = identifier
37854 'readonly'
37855 'readwrite'
37856 'assign'
37857 'retain'
37858 'copy'
37859 'nonatomic'
37861 For example:
37862 @property NSString *name;
37863 @property (readonly) id object;
37864 @property (retain, nonatomic, getter=getTheName) id name;
37865 @property int a, b, c;
37867 PS: This function is identical to
37868 c_parser_objc_at_property_declaration for C. Keep them in sync. */
37869 static void
37871 {
37872 /* Parse the optional attribute list.
37874 A list of parsed, but not verified, attributes. */
37880 /* Parse the optional attribute list... */
37882 {
37883 /* Eat the '('. */
37884 matching_parens parens;
37889 /* Allow empty @property attribute lists, but with a warning. */
37891 location_t attr_comb;
37893 {
37897 }
37898 else
37900 {
37907 {
37914 }
37925 /* Account for accepting the 'class' keyword in this context. */
37927 else
37931 enum objc_property_attribute_kind prop_kind
37933 property_attribute_info *prop
37937 tree meth_name;
37939 {
37944 attr_name);
37945 else
37953 {
37956 attr_name);
37959 }
37967 {
37970 attr_name);
37973 }
37975 /* Get the end of the method name, and consume the name. */
37978 /* Because method names may contain C++ keywords, we have a
37979 routine to fetch them (this also consumes the token). */
37983 {
37985 {
37987 attr_end);
37991 }
37992 else
37993 {
37997 }
37999 attr_end);
38000 }
38001 else
38003 attr_end);
38005 /* Updated location including all that was successfully
38006 parsed. */
38009 }
38011 /* If we see a comma here, then keep going - even if we already
38012 saw a syntax error. For simple mistakes e.g. (asign, getter=x)
38013 this makes a more useful output and avoid spurious warnings
38014 about missing attributes that are, in fact, specified after the
38015 one with the syntax error. */
38018 else
38020 }
38026 }
38028 /* 'properties' is the list of properties that we read. Usually a
38029 single one, but maybe more (eg, in "@property int a, b, c;" there
38030 are three).
38031 TODO: Update this parsing so that it accepts (erroneous) bitfields so
38032 that we can issue a meaningful and consistent (between C/C++) error
38033 message from objc_add_property_declaration (). */
38040 else
38041 {
38042 /* Comma-separated properties are chained together in reverse order;
38043 add them one by one. */
38047 prop_attr_list);
38048 }
38051 }
38053 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
38055 objc-synthesize-declaration:
38056 @synthesize objc-synthesize-identifier-list ;
38058 objc-synthesize-identifier-list:
38059 objc-synthesize-identifier
38060 objc-synthesize-identifier-list, objc-synthesize-identifier
38062 objc-synthesize-identifier
38063 identifier
38064 identifier = identifier
38066 For example:
38067 @synthesize MyProperty;
38068 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
38070 PS: This function is identical to c_parser_objc_at_synthesize_declaration
38071 for C. Keep them in sync.
38072 */
38073 static void
38075 {
38077 location_t loc;
38082 {
38086 {
38089 }
38091 {
38095 {
38098 }
38099 }
38100 else
38105 else
38107 }
38110 }
38112 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
38114 objc-dynamic-declaration:
38115 @dynamic identifier-list ;
38117 For example:
38118 @dynamic MyProperty;
38119 @dynamic MyProperty, AnotherProperty;
38121 PS: This function is identical to c_parser_objc_at_dynamic_declaration
38122 for C. Keep them in sync.
38123 */
38124 static void
38126 {
38128 location_t loc;
38133 {
38134 tree property;
38137 {
38140 }
38144 else
38146 }
38149 }
38151 \f
38152 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
38154 /* Returns name of the next clause.
38155 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
38156 the token is not consumed. Otherwise appropriate pragma_omp_clause is
38157 returned and the token is consumed. */
38159 static pragma_omp_clause
38161 {
38177 {
38182 {
38407 }
38408 }
38414 }
38416 /* Validate that a clause of the given type does not already exist. */
38418 static void
38421 {
38424 }
38426 /* OpenMP 2.5:
38427 variable-list:
38428 identifier
38429 variable-list , identifier
38431 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
38432 colon). An opening parenthesis will have been consumed by the caller.
38434 If KIND is nonzero, create the appropriate node and install the decl
38435 in OMP_CLAUSE_DECL and add the node to the head of the list.
38437 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
38438 return the list created.
38440 COLON can be NULL if only closing parenthesis should end the list,
38441 or pointer to bool which will receive false if the list is terminated
38442 by closing parenthesis or true if the list is terminated by colon.
38444 The optional ALLOW_DEREF argument is true if list items can use the deref
38445 (->) operator. */
38447 struct omp_dim
38448 {
38450 location_t loc;
38454 };
38456 static tree
38460 {
38466 {
38469 }
38471 {
38476 /* This condition doesn't include OMP_CLAUSE_DEPEND or
38477 OMP_CLAUSE_AFFINITY since lvalue ("locator list") parsing for those is
38478 handled further down the function. */
38483 {
38489 /* This code rewrites a parsed expression containing various tree
38490 codes used to represent array accesses into a more uniform nest of
38491 OMP_ARRAY_SECTION nodes before it is processed by
38492 semantics.cc:handle_omp_array_sections_1. It might be more
38493 efficient to move this logic to that function instead, analysing
38494 the parsed expression directly rather than this preprocessed
38495 form. */
38498 {
38500 {
38505 }
38510 {
38515 {
38518 }
38520 {
38524 }
38526 {
38531 }
38532 }
38534 /* Bare references have their own special handling, so remove
38535 the explicit dereference added by convert_from_reference. */
38542 }
38544 {
38547 /* If we have "*foo" and
38548 - it's an indirection of a reference, "unconvert" it, i.e.
38549 strip the indirection (to just "foo").
38550 - it's an indirection of a pointer, turn it into
38551 "foo[0:1]". */
38557 integer_one_node);
38558 }
38560 {
38567 }
38573 }
38577 {
38583 }
38587 {
38588 cp_id_kind idk;
38591 }
38596 CPP_CLOSE_PAREN)))
38597 {
38600 }
38601 else
38602 {
38609 {
38614 }
38618 else
38621 {
38627 }
38628 }
38632 ;
38634 {
38636 {
38638 /* The OpenACC cache directive explicitly only allows "array
38639 elements or subarrays". */
38641 {
38645 }
38646 /* FALLTHROUGH. */
38650 start_component_ref:
38653 {
38654 cpp_ttype ttype
38657 location_t loc
38662 decl = (cp_parser_postfix_dot_deref_expression
38665 }
38666 /* FALLTHROUGH. */
38676 {
38684 {
38687 /* Later handling is not prepared to see through these. */
38689 }
38691 parser->colon_corrects_to_scope_p
38694 {
38697 }
38698 else
38699 {
38700 /* Look for `:'. */
38702 {
38707 }
38710 else
38713 CPP_CLOSE_SQUARE))
38714 {
38716 /* Later handling is not prepared to see through these. */
38718 }
38719 }
38720 /* Look for the closing `]'. */
38722 RT_CLOSE_SQUARE))
38723 {
38728 }
38731 }
38736 && !array_section_p
38739 {
38741 {
38745 }
38747 }
38748 else
38756 }
38759 {
38763 {
38764 depend_lvalue:
38768 }
38769 else
38771 }
38773 build_clause:
38778 }
38779 else
38782 get_comma:
38786 }
38792 {
38796 }
38799 {
38802 /* Try to resync to an unnested comma. Copied from
38803 cp_parser_parenthesized_expression_list. */
38804 skip_comma:
38813 }
38816 }
38818 /* Similarly, but expect leading and trailing parenthesis. This is a very
38819 common case for omp clauses. */
38821 static tree
38824 {
38826 {
38828 {
38834 }
38835 else
38837 list);
38838 }
38842 map_lvalue);
38844 }
38846 /* OpenACC 2.0:
38847 copy ( variable-list )
38848 copyin ( variable-list )
38849 copyout ( variable-list )
38850 create ( variable-list )
38851 delete ( variable-list )
38852 present ( variable-list )
38854 OpenACC 2.6:
38855 no_create ( variable-list )
38856 attach ( variable-list )
38857 detach ( variable-list )
38859 OpenACC 2.7:
38860 copyin (readonly : variable-list )
38861 */
38863 static tree
38865 tree list)
38866 {
38869 {
38907 /* "The 'host' clause is a synonym for the 'self' clause." */
38913 }
38918 {
38919 /* Turn on readonly modifier parsing for copyin clause. */
38921 {
38926 {
38930 }
38931 }
38934 }
38937 {
38941 }
38944 }
38946 /* OpenACC 2.0:
38947 deviceptr ( variable-list ) */
38949 static tree
38951 {
38955 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
38956 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
38957 variable-list must only allow for pointer variables. */
38960 {
38967 }
38970 }
38972 /* OpenACC 2.5:
38973 auto
38974 finalize
38975 independent
38976 nohost
38977 seq */
38979 static tree
38981 tree list)
38982 {
38989 }
38991 /* OpenACC:
38992 num_gangs ( expression )
38993 num_workers ( expression )
38994 vector_length ( expression ) */
38996 static tree
38999 {
39002 matching_parens parens;
39010 {
39015 }
39023 }
39025 /* OpenACC:
39027 gang [( gang-arg-list )]
39028 worker [( [num:] int-expr )]
39029 vector [( [length:] int-expr )]
39031 where gang-arg is one of:
39033 [num:] int-expr
39034 static: size-expr
39036 and size-expr may be:
39038 *
39039 int-expr
39040 */
39042 static tree
39044 omp_clause_code kind,
39046 {
39055 {
39056 matching_parens parens;
39059 do
39060 {
39064 /* Gang static argument. */
39067 {
39075 {
39078 }
39080 /* Check for the '*' argument. */
39084 CPP_CLOSE_PAREN)))
39085 {
39090 {
39093 }
39095 }
39096 }
39097 /* Worker num: argument and vector length: arguments. */
39101 {
39104 }
39106 /* Now collect the actual argument. */
39108 {
39111 }
39123 {
39126 }
39128 }
39133 }
39147 cleanup_error:
39150 }
39152 /* OpenACC 2.0:
39153 tile ( size-expr-list ) */
39155 static tree
39157 {
39161 /* Collapse and tile are mutually exclusive. (The spec doesn't say
39162 so, but the spec authors never considered such a case and have
39163 differing opinions on what it might mean, including 'not
39164 allowed'.) */
39167 clause_loc);
39172 do
39173 {
39180 {
39183 }
39184 else
39188 }
39191 /* Consume the trailing ')'. */
39199 }
39201 /* OpenACC 2.0
39202 Parse wait clause or directive parameters. */
39204 static tree
39206 {
39216 {
39218 {
39221 }
39223 }
39230 {
39234 {
39237 else
39238 {
39245 }
39246 }
39247 }
39250 }
39252 /* OpenACC:
39253 wait [( int-expr-list )] */
39255 static tree
39257 {
39262 else
39263 {
39269 }
39272 }
39274 /* OpenMP 3.0:
39275 collapse ( constant-expression ) */
39277 static tree
39279 {
39281 location_t loc;
39282 HOST_WIDE_INT n;
39285 matching_parens parens;
39303 {
39306 }
39315 }
39317 /* OpenMP 2.5:
39318 default ( none | shared )
39320 OpenMP 5.1:
39321 default ( private | firstprivate )
39323 OpenACC:
39324 default ( none | present ) */
39326 static tree
39329 {
39331 tree c;
39333 matching_parens parens;
39337 {
39340 }
39342 {
39347 {
39374 }
39377 }
39378 else
39379 {
39380 invalid_kind:
39383 else
39386 }
39403 }
39405 /* OpenMP 3.1:
39406 final ( expression ) */
39408 static tree
39410 {
39413 matching_parens parens;
39432 }
39434 /* OpenMP 5.1:
39435 indirect [( expression )]
39436 */
39438 static tree
39440 location_t location)
39441 {
39442 tree t;
39445 {
39446 matching_parens parens;
39461 }
39462 else
39472 }
39474 /* OpenMP 2.5:
39475 if ( expression )
39477 OpenMP 4.5:
39478 if ( directive-name-modifier : expression )
39480 directive-name-modifier:
39481 parallel | task | taskloop | target data | target | target update
39482 | target enter data | target exit data
39484 OpenMP 5.0:
39485 directive-name-modifier:
39486 ... | simd | cancel */
39488 static tree
39491 {
39495 matching_parens parens;
39500 {
39516 {
39519 {
39532 else
39533 {
39534 location_t loc
39539 }
39542 {
39544 {
39549 }
39551 {
39552 location_t loc
39556 }
39557 }
39558 }
39559 }
39561 {
39563 {
39566 }
39567 else
39568 {
39570 {
39571 location_t loc
39574 }
39576 }
39577 }
39578 }
39590 {
39593 {
39596 {
39608 }
39610 p);
39612 }
39614 {
39617 else
39620 }
39623 {
39627 }
39628 }
39636 }
39638 /* OpenMP 3.1:
39639 mergeable */
39641 static tree
39644 {
39645 tree c;
39648 location);
39653 }
39655 /* OpenMP 2.5:
39656 nowait */
39658 static tree
39661 {
39662 tree c;
39669 }
39671 /* OpenMP 2.5:
39672 num_threads ( expression ) */
39674 static tree
39676 location_t location)
39677 {
39680 matching_parens parens;
39700 }
39702 /* OpenMP 4.5:
39703 num_tasks ( expression )
39705 OpenMP 5.1:
39706 num_tasks ( strict : expression ) */
39708 static tree
39710 location_t location)
39711 {
39714 matching_parens parens;
39721 {
39724 {
39728 }
39729 }
39748 }
39750 /* OpenMP 4.5:
39751 grainsize ( expression )
39753 OpenMP 5.1:
39754 grainsize ( strict : expression ) */
39756 static tree
39758 location_t location)
39759 {
39762 matching_parens parens;
39769 {
39772 {
39776 }
39777 }
39796 }
39798 /* OpenMP 4.5:
39799 priority ( expression ) */
39801 static tree
39803 location_t location)
39804 {
39807 matching_parens parens;
39827 }
39829 /* OpenMP 4.5:
39830 hint ( expression ) */
39832 static tree
39834 {
39837 matching_parens parens;
39844 {
39852 }
39865 }
39867 /* OpenMP 5.1:
39868 filter ( integer-expression ) */
39870 static tree
39872 {
39875 matching_parens parens;
39893 }
39895 /* OpenMP 4.5:
39896 defaultmap ( tofrom : scalar )
39898 OpenMP 5.0:
39899 defaultmap ( implicit-behavior [ : variable-category ] ) */
39901 static tree
39903 location_t location)
39904 {
39908 enum omp_clause_defaultmap_kind category
39911 matching_parens parens;
39918 {
39919 invalid_behavior:
39921 "%<tofrom%>, %<firstprivate%>, %<none%> "
39924 }
39925 else
39926 {
39929 }
39932 {
39936 else
39943 else
39952 else
39959 else
39966 else
39975 else
39981 }
39985 {
39990 {
39991 invalid_category:
39995 }
40000 {
40006 else
40013 else
40020 else
40026 }
40029 }
40042 {
40052 {
40070 }
40073 p);
40074 else
40078 }
40085 out_err:
40090 }
40092 /* OpenMP 5.0:
40093 order ( concurrent )
40095 OpenMP 5.1:
40096 order ( order-modifier : concurrent )
40098 order-modifier:
40099 reproducible
40100 unconstrained */
40102 static tree
40104 {
40110 matching_parens parens;
40116 {
40123 else
40124 {
40128 }
40131 }
40133 {
40136 }
40137 else
40138 {
40141 }
40143 {
40146 }
40158 out_err:
40163 }
40165 /* OpenMP 5.0:
40166 bind ( teams | parallel | thread ) */
40168 static tree
40170 location_t location)
40171 {
40172 tree c;
40176 matching_parens parens;
40181 {
40182 invalid:
40186 }
40187 else
40188 {
40191 }
40202 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
40208 out_err:
40213 }
40215 /* OpenMP 2.5:
40216 ordered
40218 OpenMP 4.5:
40219 ordered ( constant-expression ) */
40221 static tree
40224 {
40226 HOST_WIDE_INT n;
40232 {
40233 matching_parens parens;
40250 {
40252 "ordered argument needs positive constant integer "
40255 }
40256 }
40262 }
40264 /* OpenMP 2.5:
40265 reduction ( reduction-operator : variable-list )
40267 reduction-operator:
40268 One of: + * - & ^ | && ||
40270 OpenMP 3.1:
40272 reduction-operator:
40273 One of: + * - & ^ | && || min max
40275 OpenMP 4.0:
40277 reduction-operator:
40278 One of: + * - & ^ | && ||
40279 id-expression
40281 OpenMP 5.0:
40282 reduction ( reduction-modifier, reduction-operator : variable-list )
40283 in_reduction ( reduction-operator : variable-list )
40284 task_reduction ( reduction-operator : variable-list ) */
40286 static tree
40289 {
40299 {
40302 {
40305 }
40308 {
40316 {
40319 }
40320 }
40321 }
40324 {
40334 }
40338 else
40339 {
40350 {
40380 }
40381 else
40382 {
40384 resync_fail:
40389 }
40390 }
40396 NULL);
40398 {
40405 }
40408 }
40410 /* OpenMP 2.5:
40411 schedule ( schedule-kind )
40412 schedule ( schedule-kind , expression )
40414 schedule-kind:
40415 static | dynamic | guided | runtime | auto
40417 OpenMP 4.5:
40418 schedule ( schedule-modifier : schedule-kind )
40419 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
40421 schedule-modifier:
40422 simd
40423 monotonic
40424 nonmonotonic */
40426 static tree
40428 {
40432 matching_parens parens;
40440 {
40449 else
40455 {
40458 }
40459 else
40460 {
40463 }
40464 }
40469 {
40474 {
40495 }
40496 }
40501 else
40507 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
40509 {
40513 }
40516 {
40531 else
40536 }
40548 invalid_kind:
40550 resync_fail:
40555 }
40557 /* OpenMP 3.0:
40558 untied */
40560 static tree
40563 {
40564 tree c;
40571 }
40573 /* OpenMP 4.0:
40574 inbranch
40575 notinbranch */
40577 static tree
40580 {
40585 }
40587 /* OpenMP 4.0:
40588 parallel
40589 for
40590 sections
40591 taskgroup */
40593 static tree
40597 {
40601 }
40603 /* OpenMP 4.5:
40604 nogroup */
40606 static tree
40609 {
40614 }
40616 /* OpenMP 4.5:
40617 simd
40618 threads */
40620 static tree
40624 {
40629 }
40631 /* OpenMP 4.0:
40632 num_teams ( expression )
40634 OpenMP 5.1:
40635 num_teams ( expression : expression ) */
40637 static tree
40639 location_t location)
40640 {
40643 matching_parens parens;
40654 {
40658 }
40675 }
40677 /* OpenMP 4.0:
40678 thread_limit ( expression ) */
40680 static tree
40682 location_t location)
40683 {
40686 matching_parens parens;
40706 }
40708 /* OpenMP 5.1
40709 full */
40711 static tree
40713 {
40719 }
40721 /* OpenMP 5.1
40722 partial ( constant-expression ) */
40724 static tree
40726 {
40731 {
40732 matching_parens parens;
40742 }
40748 }
40750 /* OpenMP 4.0:
40751 aligned ( variable-list )
40752 aligned ( variable-list : constant-expression ) */
40754 static tree
40756 {
40760 matching_parens parens;
40768 {
40778 }
40784 }
40786 /* OpenMP 5.0:
40787 allocate ( variable-list )
40788 allocate ( expression : variable-list )
40790 OpenMP 5.1:
40791 allocate ( allocator-modifier : variable-list )
40792 allocate ( allocator-modifier , allocator-modifier : variable-list )
40794 allocator-modifier:
40795 allocator ( expression )
40796 align ( expression ) */
40798 static tree
40800 {
40804 matching_parens parens;
40814 {
40820 matching_parens parens2;
40824 {
40828 }
40829 else
40830 {
40834 }
40838 {
40841 }
40845 }
40846 else
40849 {
40855 }
40858 {
40865 }
40866 else
40867 {
40871 }
40878 {
40881 }
40884 }
40886 /* OpenMP 2.5:
40887 lastprivate ( variable-list )
40889 OpenMP 5.0:
40890 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
40892 static tree
40894 {
40902 {
40907 {
40911 }
40912 }
40921 }
40923 /* OpenMP 4.0:
40924 linear ( variable-list )
40925 linear ( variable-list : expression )
40927 OpenMP 4.5:
40928 linear ( modifier ( variable-list ) )
40929 linear ( modifier ( variable-list ) : expression )
40931 modifier:
40932 val
40933 ref
40934 uval
40936 OpenMP 5.2:
40937 linear ( variable-list : modifiers-list )
40939 modifiers:
40940 val
40941 ref
40942 uval
40943 step ( expression ) */
40945 static tree
40948 {
40954 matching_parens parens;
40959 {
40970 {
40973 }
40974 else
40976 }
40981 else
40982 {
40991 }
40994 {
40998 {
41008 {
41012 }
41016 CPP_CLOSE_PAREN)))
41018 }
41022 {
41024 {
41035 {
41041 }
41043 {
41044 location_t step_loc
41047 matching_parens parens2;
41049 {
41055 CPP_CLOSE_PAREN))
41056 {
41057 cp_token *token
41065 tok_loc);
41067 {
41070 }
41073 }
41079 }
41080 else
41082 }
41083 else
41086 {
41089 }
41091 }
41094 }
41098 {
41109 {
41112 }
41115 }
41126 }
41129 {
41133 }
41136 }
41138 /* OpenMP 4.0:
41139 safelen ( constant-expression ) */
41141 static tree
41143 location_t location)
41144 {
41147 matching_parens parens;
41166 }
41168 /* OpenMP 4.0:
41169 simdlen ( constant-expression ) */
41171 static tree
41173 location_t location)
41174 {
41177 matching_parens parens;
41196 }
41198 /* OpenMP 4.5:
41199 vec:
41200 identifier [+/- integer]
41201 vec , identifier [+/- integer]
41202 */
41204 static tree
41207 {
41211 {
41214 }
41217 {
41223 {
41226 {
41234 }
41235 }
41236 }
41239 {
41246 else
41247 {
41248 t = cp_parser_lookup_name_simple
41253 id_loc);
41254 }
41260 {
41263 }
41267 {
41270 }
41274 {
41277 }
41280 add_to_vector:
41282 {
41286 }
41293 }
41296 {
41303 }
41305 }
41307 /* OpenMP 5.0:
41308 detach ( event-handle ) */
41310 static tree
41312 {
41313 matching_parens parens;
41329 else
41330 {
41333 else
41338 }
41351 }
41353 /* OpenMP 5.0:
41354 iterators ( iterators-definition )
41356 iterators-definition:
41357 iterator-specifier
41358 iterator-specifier , iterators-definition
41360 iterator-specifier:
41361 identifier = range-specification
41362 iterator-type identifier = range-specification
41364 range-specification:
41365 begin : end
41366 begin : end : step */
41368 static tree
41370 {
41374 matching_parens parens;
41378 bool saved_colon_corrects_to_scope_p
41380 bool saved_colon_doesnt_start_class_def_p
41383 do
41384 {
41385 tree iter_type;
41389 else
41390 {
41393 parser->type_definition_forbidden_message
41399 }
41403 {
41406 }
41426 {
41429 }
41444 {
41447 }
41449 }
41453 parser->colon_doesnt_start_class_def_p
41463 }
41465 /* OpenMP 5.0:
41466 affinity ( [aff-modifier :] variable-list )
41467 aff-modifier:
41468 iterator ( iterators-definition ) */
41470 static tree
41472 {
41475 matching_parens parens;
41480 {
41485 CPP_OPEN_PAREN)));
41487 {
41490 }
41492 {
41496 {
41504 }
41505 }
41506 }
41510 {
41513 {
41518 }
41519 }
41521 }
41523 /* OpenMP 4.0:
41524 depend ( depend-kind : variable-list )
41526 depend-kind:
41527 in | out | inout
41529 OpenMP 4.5:
41530 depend ( source )
41532 depend ( sink : vec )
41534 OpenMP 5.0:
41535 depend ( depend-modifier , depend-kind: variable-list )
41537 depend-kind:
41538 in | out | inout | mutexinoutset | depobj
41540 depend-modifier:
41541 iterator ( iterators-definition ) */
41543 static tree
41545 {
41550 matching_parens parens;
41554 do
41555 {
41563 {
41568 }
41585 else
41588 }
41596 {
41601 }
41604 {
41615 }
41621 {
41627 }
41628 else
41629 {
41634 {
41638 else
41640 }
41643 {
41648 }
41649 }
41652 invalid_kind:
41654 resync_fail:
41661 }
41663 /* OpenMP 5.2:
41664 doacross ( source : )
41665 doacross ( source : omp_cur_iteration )
41667 doacross ( sink : vec )
41668 doacross ( sink : omp_cur_iteration - logical_iteration ) */
41670 static tree
41672 {
41673 tree nlist;
41676 matching_parens parens;
41681 {
41682 invalid_kind:
41684 resync_fail:
41689 }
41698 else
41707 {
41709 {
41714 }
41719 }
41720 else
41728 }
41730 /* OpenMP 4.0:
41731 from ( variable-list )
41732 to ( variable-list )
41734 OpenMP 5.1:
41735 from ( [present :] variable-list )
41736 to ( [present :] variable-list ) */
41738 static tree
41740 tree list)
41741 {
41751 {
41755 }
41763 }
41765 /* OpenMP 4.0:
41766 map ( map-kind : variable-list )
41767 map ( variable-list )
41769 map-kind:
41770 alloc | to | from | tofrom
41772 OpenMP 4.5:
41773 map-kind:
41774 alloc | to | from | tofrom | release | delete
41776 map ( always [,] map-kind: variable-list )
41778 OpenMP 5.0:
41779 map ( [map-type-modifier[,] ...] map-kind: variable-list )
41781 map-type-modifier:
41782 always | close */
41784 static tree
41786 {
41797 {
41799 {
41802 }
41805 pos++;
41806 pos++;
41807 }
41813 {
41816 {
41819 }
41823 {
41825 {
41832 }
41834 }
41836 {
41838 {
41845 }
41847 }
41849 {
41851 {
41858 }
41860 }
41861 else
41862 {
41870 }
41873 }
41877 {
41901 else
41902 {
41908 }
41911 }
41914 {
41918 }
41920 /* We introduce a scope here so that errors parsing e.g. "always", "close"
41921 tokens do not propagate to later directives that might use them
41922 legally. */
41932 }
41934 /* OpenMP 4.0:
41935 device ( expression )
41937 OpenMP 5.0:
41938 device ( [device-modifier :] integer-expression )
41940 device-modifier:
41941 ancestor | device_num */
41943 static tree
41945 location_t location)
41946 {
41950 matching_parens parens;
41956 {
41960 {
41963 /* A requires directive with the reverse_offload clause must be
41964 specified. */
41966 {
41968 "preceded by %<requires%> directive "
41972 }
41973 }
41975 ;
41976 else
41977 {
41981 }
41984 }
42003 }
42005 /* OpenMP 4.0:
42006 dist_schedule ( static )
42007 dist_schedule ( static , expression ) */
42009 static tree
42011 location_t location)
42012 {
42015 matching_parens parens;
42026 {
42037 }
42041 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
42042 "dist_schedule", location); */
42048 invalid_kind:
42050 resync_fail:
42055 }
42057 /* OpenMP 4.0:
42058 proc_bind ( proc-bind-kind )
42060 proc-bind-kind:
42061 primary | master | close | spread
42062 where OpenMP 5.1 added 'primary' and deprecated the alias 'master'. */
42064 static tree
42066 location_t location)
42067 {
42068 tree c;
42075 {
42087 else
42089 }
42090 else
42099 location);
42104 invalid_kind:
42106 resync_fail:
42111 }
42113 /* OpenMP 5.0:
42114 device_type ( host | nohost | any ) */
42116 static tree
42118 location_t location)
42119 {
42120 tree c;
42127 {
42137 else
42139 }
42140 else
42149 location);
42154 invalid_kind:
42156 resync_fail:
42161 }
42163 /* OpenACC:
42164 async [( int-expr )] */
42166 static tree
42168 {
42175 {
42176 matching_parens parens;
42185 }
42195 }
42197 /* OpenACC 2.7:
42198 self [( expression )] */
42200 static tree
42202 {
42203 tree t;
42206 {
42207 matching_parens parens;
42212 {
42217 }
42218 }
42219 else
42224 {
42227 }
42233 }
42235 /* Parse all OpenACC clauses. The set clauses allowed by the directive
42236 is a bitmask in MASK. Return the list of clauses found. */
42238 static tree
42242 {
42246 /* Don't create location wrapper nodes within OpenACC clauses. */
42247 auto_suppress_location_wrappers sentinel;
42250 {
42251 location_t here;
42252 pragma_omp_clause c_kind;
42253 omp_clause_code code;
42264 {
42271 clauses);
42324 clauses);
42329 clauses);
42347 clauses);
42352 clauses);
42365 clauses);
42372 clauses);
42378 clauses);
42386 clauses);
42390 clauses
42397 /* OpenACC compute construct */
42399 else
42400 /* OpenACC 'update' directive */
42406 clauses);
42415 clauses);
42421 OMP_CLAUSE_VECTOR,
42428 clauses);
42437 OMP_CLAUSE_WORKER,
42443 }
42448 {
42449 /* Remove the invalid clause(s) from the list to avoid
42450 confusing the rest of the compiler. */
42453 }
42454 }
42456 saw_error:
42464 }
42466 /* Parse all OpenMP clauses. The set clauses allowed by the directive
42467 is a bitmask in MASK. Return the list of clauses found.
42468 FINISH_P set if finish_omp_clauses should be called.
42469 NESTED non-zero if clauses should be terminated by closing paren instead
42470 of end of pragma. If it is 2, additionally commas are required in between
42471 the clauses. */
42473 static tree
42477 {
42482 /* Don't create location wrapper nodes within OpenMP clauses. */
42483 auto_suppress_location_wrappers sentinel;
42486 {
42487 pragma_omp_clause c_kind;
42495 {
42500 "clauses in %<simd%> trait should be separated "
42502 }
42508 {
42525 clauses);
42544 clauses);
42564 clauses);
42569 clauses);
42574 clauses);
42579 clauses);
42588 clauses
42639 clauses);
42643 clauses
42655 clauses);
42659 clauses
42661 OMP_CLAUSE_TASK_REDUCTION,
42677 clauses);
42682 OMP_CLAUSE_NOTINBRANCH,
42691 {
42692 clause_not_first:
42696 }
42725 {
42727 clauses);
42731 }
42732 else
42734 clauses);
42739 clauses);
42744 clauses);
42766 {
42771 }
42832 clauses
42838 clauses
42845 clauses);
42860 }
42865 {
42866 /* Remove the invalid clause(s) from the list to avoid
42867 confusing the rest of the compiler. */
42870 }
42871 }
42872 saw_error:
42876 {
42879 else
42881 }
42883 }
42885 /* OpenMP 2.5:
42886 structured-block:
42887 statement
42889 In practice, we're also interested in adding the statement to an
42890 outer node. So it is convenient if we work around the fact that
42891 cp_parser_statement calls add_stmt. */
42893 static unsigned
42895 {
42898 /* Only move the values to IN_OMP_BLOCK if they weren't false.
42899 This preserves the "not within loop or switch" style error messages
42900 for nonsense cases like
42901 void foo() {
42902 #pragma omp single
42903 break;
42904 }
42905 */
42910 }
42912 static void
42914 {
42916 }
42918 static tree
42920 {
42929 }
42931 /* OpenMP 5.x:
42932 # pragma omp allocate (list) clauses
42934 OpenMP 5.0 clause:
42935 allocator (omp_allocator_handle_t expression)
42937 OpenMP 5.1 additional clause:
42938 align (constant-expression)] */
42940 static void
42942 {
42948 do
42949 {
42956 matching_parens parens;
42962 {
42965 }
42970 {
42973 }
42975 {
42978 /* FIXME: Remove when adding check to semantics.cc; cf FIXME below. */
42982 {
42984 "positive constant power of two integer "
42987 }
42989 {
42992 {
42997 {
42999 "positive constant power of two integer "
43002 }
43003 }
43004 }
43005 }
43007 {
43010 }
43011 else
43012 {
43015 }
43022 {
43025 }
43027 /* FIXME: When implementing properly, delete the align/allocate expr error
43028 check above and add one in semantics.cc (to properly handle templates).
43029 Base this on the allocator/align modifiers check for the 'allocate' clause
43030 in semantics.cc's finish_omp_clauses. */
43032 }
43034 /* OpenMP 2.5:
43035 # pragma omp atomic new-line
43036 expression-stmt
43038 expression-stmt:
43039 x binop= expr | x++ | ++x | x-- | --x
43040 binop:
43041 +, *, -, /, &, ^, |, <<, >>
43043 where x is an lvalue expression with scalar type.
43045 OpenMP 3.1:
43046 # pragma omp atomic new-line
43047 update-stmt
43049 # pragma omp atomic read new-line
43050 read-stmt
43052 # pragma omp atomic write new-line
43053 write-stmt
43055 # pragma omp atomic update new-line
43056 update-stmt
43058 # pragma omp atomic capture new-line
43059 capture-stmt
43061 # pragma omp atomic capture new-line
43062 capture-block
43064 read-stmt:
43065 v = x
43066 write-stmt:
43067 x = expr
43068 update-stmt:
43069 expression-stmt | x = x binop expr
43070 capture-stmt:
43071 v = expression-stmt
43072 capture-block:
43073 { v = x; update-stmt; } | { update-stmt; v = x; }
43075 OpenMP 4.0:
43076 update-stmt:
43077 expression-stmt | x = x binop expr | x = expr binop x
43078 capture-stmt:
43079 v = update-stmt
43080 capture-block:
43081 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
43083 OpenMP 5.1:
43084 # pragma omp atomic compare new-line
43085 conditional-update-atomic
43087 # pragma omp atomic compare capture new-line
43088 conditional-update-capture-atomic
43090 conditional-update-atomic:
43091 cond-expr-stmt | cond-update-stmt
43092 cond-expr-stmt:
43093 x = expr ordop x ? expr : x;
43094 x = x ordop expr ? expr : x;
43095 x = x == e ? d : x;
43096 cond-update-stmt:
43097 if (expr ordop x) { x = expr; }
43098 if (x ordop expr) { x = expr; }
43099 if (x == e) { x = d; }
43100 ordop:
43101 <, >
43102 conditional-update-capture-atomic:
43103 v = cond-expr-stmt
43104 { v = x; cond-expr-stmt }
43105 { cond-expr-stmt v = x; }
43106 { v = x; cond-update-stmt }
43107 { cond-update-stmt v = x; }
43108 if (x == e) { x = d; } else { v = x; }
43109 { r = x == e; if (r) { x = d; } }
43110 { r = x == e; if (r) { x = d; } else { v = x; } }
43112 where x, r and v are lvalue expressions with scalar type,
43113 expr, e and d are expressions with scalar type and e might be
43114 the same as v. */
43116 static void
43118 {
43134 {
43140 {
43145 enum omp_memory_order new_memory_order
43161 {
43165 }
43173 {
43174 matching_parens parens;
43181 {
43191 }
43194 {
43198 else
43200 }
43201 else
43211 }
43223 {
43227 }
43228 else
43229 {
43232 "%<capture%>, %<compare%>, %<weak%>, %<fail%>, "
43233 "%<seq_cst%>, %<acq_rel%>, %<release%>, "
43235 }
43237 {
43239 {
43240 /* OpenACC permits 'update capture'. */
43247 else
43249 }
43251 {
43254 else
43256 }
43258 {
43261 else
43263 }
43265 {
43268 else
43270 }
43272 {
43275 else
43277 }
43280 }
43281 }
43283 }
43289 {
43293 else
43295 }
43297 {
43301 }
43303 {
43306 }
43308 {
43311 }
43315 {
43316 omp_requires_mask
43321 {
43331 {
43333 "%<acquire%> clause implicitly provided by a "
43336 }
43337 else
43342 {
43344 "%<release%> clause implicitly provided by a "
43347 }
43348 else
43353 {
43363 }
43367 }
43368 }
43369 else
43371 {
43374 {
43378 }
43384 {
43388 }
43394 }
43396 memory_order
43401 {
43411 else
43416 {
43417 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
43418 opcode. */
43423 }
43427 {
43430 }
43434 else
43435 {
43443 {
43447 }
43448 }
43451 }
43453 restart:
43455 {
43458 matching_parens parens;
43462 tree cmp_expr;
43465 else
43473 {
43479 }
43481 ;
43483 {
43487 }
43490 {
43492 "expected %<==%>, %<<%> or %<>%> comparison in %<if%> "
43495 }
43506 {
43509 }
43514 else
43527 {
43529 {
43532 }
43534 {
43539 }
43540 else
43542 }
43547 {
43552 }
43553 else
43554 {
43555 bad_if:
43559 }
43562 {
43566 {
43570 }
43598 /* Signal to c_finish_omp_atomic that in
43599 if (x == e) { x = d; } else { v = x; }
43600 case the store to v should be conditional. */
43602 }
43604 {
43607 }
43613 }
43617 {
43624 /* FALLTHROUGH */
43636 /* FALLTHROUGH */
43653 /* Undo effects of boolean_increment for post {in,de}crement. */
43655 /* FALLTHRU */
43659 {
43660 /* Undo effects of boolean_increment. */
43662 {
43663 /* This is pre or post increment. */
43668 && !structured_block
43674 }
43675 }
43676 /* FALLTHRU */
43679 {
43682 }
43684 {
43719 {
43723 }
43728 {
43734 {
43739 }
43741 {
43755 {
43757 {
43762 }
43763 else
43765 }
43770 || !structured_block
43771 || v
43777 {
43779 {
43785 }
43786 }
43794 {
43798 cond_expr:
43800 bool saved_colon_corrects_to_scope_p
43804 parser->colon_corrects_to_scope_p
43809 {
43811 {
43813 {
43817 }
43819 {
43820 opcode
43824 }
43825 }
43826 else
43827 {
43830 {
43831 opcode
43836 }
43837 }
43838 }
43840 "invalid form of "
43843 }
43847 }
43852 {
43859 }
43863 }
43867 {
43870 {
43878 }
43880 {
43885 }
43929 }
43932 {
43934 "invalid form of "
43937 }
43948 {
43950 {
43952 "invalid form of "
43955 }
43957 }
43963 }
43970 }
43971 stmt_done:
43973 {
43986 }
43988 {
43992 }
43993 done:
43995 {
43998 }
44006 invalid_compare:
44008 /* FALLTHRU */
44009 saw_error:
44014 {
44018 {
44022 }
44023 }
44024 }
44027 /* OpenMP 2.5:
44028 # pragma omp barrier new-line */
44030 static void
44032 {
44035 }
44037 /* OpenMP 2.5:
44038 # pragma omp critical [(name)] new-line
44039 structured-block
44041 OpenMP 4.5:
44042 # pragma omp critical [(name) [hint(expression)]] new-line
44043 structured-block */
44045 #define OMP_CRITICAL_CLAUSE_MASK \
44046 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
44048 static tree
44050 {
44054 {
44055 matching_parens parens;
44071 }
44078 }
44080 /* OpenMP 5.0:
44081 # pragma omp depobj ( depobj ) depobj-clause new-line
44083 depobj-clause:
44084 depend (dependence-type : locator)
44085 destroy
44086 update (dependence-type)
44088 OpenMP 5.2 additionally:
44089 destroy ( depobj )
44091 dependence-type:
44092 in
44093 out
44094 inout
44095 mutexinout */
44097 static void
44099 {
44101 matching_parens parens;
44103 {
44106 }
44121 {
44127 {
44128 /* Don't create location wrapper nodes within the depend clause. */
44129 auto_suppress_location_wrappers sentinel;
44135 }
44137 {
44139 matching_parens c_parens;
44142 {
44149 "the %<destroy%> expression %qE should be the same "
44156 }
44157 }
44159 {
44160 matching_parens c_parens;
44162 {
44163 location_t c2_loc
44166 {
44181 }
44183 {
44187 }
44193 }
44194 else
44196 }
44197 }
44199 {
44202 }
44206 }
44209 /* OpenMP 2.5:
44210 # pragma omp flush flush-vars[opt] new-line
44212 flush-vars:
44213 ( variable-list )
44215 OpenMP 5.0:
44216 # pragma omp flush memory-order-clause new-line */
44218 static void
44220 {
44226 {
44237 else
44239 "expected %<seq_cst%>, %<acq_rel%>, %<release%> or "
44242 }
44244 {
44247 "%<flush%> list specified together with memory order "
44250 }
44254 }
44256 /* Helper function, to parse omp for increment expression. */
44258 static tree
44260 {
44265 {
44268 }
44271 {
44283 }
44285 /* If decl is an iterator, preserve LHS and RHS of the relational
44286 expr until finish_omp_for. */
44297 }
44299 /* Helper function, to parse omp for increment expression. */
44301 static tree
44303 {
44307 cp_id_kind idk;
44311 {
44320 }
44329 {
44334 }
44341 {
44345 }
44358 do
44359 {
44366 {
44368 {
44371 else
44374 }
44375 else
44380 }
44381 }
44385 {
44391 }
44392 else
44396 }
44398 /* Parse the initialization statement of an OpenMP for loop. Range-for
44399 is handled separately in cp_convert_omp_range_for.
44401 On entry SL is the current statement list. Parsing of some forms
44402 of initialization pops this list and stores its contents in either INIT
44403 or THIS_PRE_BODY, and sets SL to null. Initialization for class
44404 iterators is added directly to SL and it is not popped until later.
44406 On return, DECL is set if the initialization is by binding the
44407 iteration variable. If the initialization is by assignment, REAL_DECL
44408 is set to point to a variable in an outer scope. ORIG_INIT is set
44409 if the iteration variable is of class type; this is a copy saved for
44410 error checking in finish_omp_for.
44412 Return true if the resulting construct should have an
44413 OMP_CLAUSE_PRIVATE added to it. */
44415 static tree
44423 {
44429 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
44431 init-expr:
44432 var = lb
44433 integer-type var = lb
44434 random-access-iterator-type var = lb
44435 pointer-type var = lb
44436 */
44437 cp_decl_specifier_seq type_specifiers;
44439 /* First, try to parse as an initialized declaration. See
44440 cp_parser_condition, from whence the bulk of this is copied. */
44448 {
44449 /* If parsing a type specifier seq succeeded, then this
44450 MUST be a initialized declaration. */
44455 CP_PARSER_DECLARATOR_NAMED,
44456 CP_PARSER_FLAGS_NONE,
44468 else
44469 {
44479 {
44481 CPP_OPEN_PAREN))
44484 else
44485 /* Trigger an error. */
44490 }
44494 {
44502 {
44505 auto_node);
44510 }
44513 asm_specification,
44514 LOOKUP_ONLYCONVERTING);
44517 /* In the case of a class iterator, do not pop sl here.
44518 Both class initialization and finalization must happen in
44519 the enclosing init block scope. For now set the init
44520 expression to null; it'll be filled in properly in
44521 finish_omp_for before stuffing it in the OMP_FOR. */
44525 {
44529 {
44531 /* Move lambda DECL_EXPRs to the enclosing block. */
44533 {
44537 {
44541 }
44543 }
44545 {
44550 }
44551 }
44552 }
44553 }
44554 else
44555 /* This is an initialized declaration of non-class,
44556 non-parameterized type iteration variable. */
44557 {
44558 /* Consume '='. */
44562 non_class:
44565 else
44568 asm_specification,
44569 LOOKUP_ONLYCONVERTING);
44572 }
44576 }
44577 }
44578 else
44579 {
44580 cp_id_kind idk;
44581 /* If parsing a type specifier sequence failed, then
44582 this MUST be a simple expression. */
44588 && decl
44591 {
44602 {
44607 }
44612 }
44614 && decl
44617 {
44618 tree rhs;
44627 tf_warning_or_error));
44630 }
44631 else
44632 {
44637 {
44641 }
44642 }
44645 }
44647 }
44649 /* Helper for cp_parser_omp_loop_nest, handle one range-for loop
44650 including introducing new temporaries for the range start and end,
44651 doing auto deduction, and processing decomposition variables.
44653 This function is also called from pt.cc during template instantiation.
44654 In that case SL is NULL_TREE, otherwise it is the current statement
44655 list. */
44656 void
44660 {
44666 {
44670 /* do_auto_deduction doesn't mess with template init-lists. */
44672 {
44676 {
44680 {
44685 }
44686 }
44688 }
44693 {
44696 }
44698 }
44703 /* If an error happened previously do nothing or else a lot of
44704 unhelpful errors would be issued. */
44706 else
44707 {
44708 tree range_temp;
44712 /* Can't bind a reference to an array of runtime bound. */
44714 else
44715 {
44721 LOOKUP_ONLYCONVERTING);
44724 }
44727 }
44738 LOOKUP_ONLYCONVERTING);
44740 /* The new for initialization statement. */
44748 else
44749 {
44752 }
44755 LOOKUP_ONLYCONVERTING);
44757 /* The new for condition. */
44760 else
44766 /* The new increment expression. */
44769 else
44772 tf_warning_or_error);
44776 /* Defer popping sl here. */
44780 {
44784 {
44790 }
44791 }
44795 {
44799 {
44803 {
44809 }
44810 }
44811 }
44813 /* The output ORIG_DECL is not a decl. Instead, it is a tree structure
44814 that holds decls for variables implementing the iterator, represented
44815 as a TREE_LIST whose TREE_CHAIN is a vector. The first two elements
44816 of the vector are decls of scratch variables for the range start and
44817 end that will eventually be bound in the implicit scope surrounding
44818 the whole loop nest. The remaining elements are decls of derived
44819 decomposition variables that are bound inside the loop body. This
44820 structure is further mangled by finish_omp_for into the form required
44821 for the OMP_FOR_ORIG_DECLS field of the OMP_FOR tree node. */\
44830 {
44832 {
44833 /* If cp_finish_decomp was called with processing_template_decl
44834 temporarily set to 1, then decomp names will have deduced
44835 name but the DECL_VALUE_EXPR will be dependent. Hide those
44836 from folding of other loop initializers e.g. for warning
44837 purposes until cp_finish_omp_range_for. */
44842 }
44845 }
44847 }
44849 /* Helper for cp_parser_omp_for_loop, finalize part of range for
44850 inside of the collapsed body. */
44852 void
44854 {
44861 {
44866 {
44867 /* Undo temporary clearing of DECL_HAS_VALUE_EXPR_P done
44868 by cp_convert_omp_range_for above. */
44872 {
44876 }
44877 }
44878 }
44880 /* The declaration is initialized with *__begin inside the loop body. */
44888 }
44890 /* Return true if next tokens contain a standard attribute that contains
44891 omp::directive (DIRECTIVE). */
44893 static bool
44896 {
44904 {
44912 }
44917 location_t last_loc
44926 {
44928 {
44932 cnt++;
44936 {
44940 }
44941 }
44942 }
44944 {
44947 }
44949 {
44951 "%<[[omp::directive(%s)]]%> must be the only specified "
44955 }
44960 }
44962 /* Parse an OpenMP structured block sequence. KIND is the corresponding
44963 separating directive. */
44965 static tree
44968 {
44974 {
44987 kind == PRAGMA_OMP_SCAN
44992 }
44996 }
44999 /* OpenMP 5.0:
45001 scan-loop-body:
45002 { structured-block scan-directive structured-block } */
45004 static void
45006 {
45010 matching_braces braces;
45017 else
45018 {
45020 "%<#pragma omp scan%> with zero preceding executable "
45023 }
45029 {
45039 {
45046 }
45048 {
45051 }
45052 else
45057 }
45058 else
45064 else
45065 {
45068 "%<#pragma omp scan%> with zero succeeding executable "
45071 }
45073 clauses);
45077 }
45080 /* Check that the next token starts a loop nest. Return true if yes,
45081 otherwise diagnose an error if ERROR_P is true and return false. */
45082 static bool
45085 {
45087 {
45092 }
45093 else
45094 {
45103 /* Skip standard attributes on next for in case they are
45104 [[omp::directive (unroll partial (4))]] or
45105 [[omp::directive (tile sizes (1, 2, 3))]] etc. */
45110 {
45114 else
45116 }
45117 }
45119 }
45124 /* This function parses a single level of a loop nest, invoking itself
45125 recursively if necessary.
45127 loop-nest :: for (...) loop-body
45128 loop-body :: loop-nest
45129 | { [intervening-code] loop-body [intervening-code] }
45130 | final-loop-body
45131 intervening-code :: structured-block-sequence
45132 final-loop-body :: structured-block
45134 For a collapsed loop nest, only a single OMP_FOR is built, pulling out
45135 all the iterator information from the inner loops into vectors in the
45136 parser->omp_for_parse_state structure.
45138 In the "range for" case, it is transformed into a regular "for" iterator
45139 by introducing some temporary variables for the begin/end,
45140 as well as bindings of the actual iteration variables which are
45141 injected into the body of the loop.
45143 Initialization code for iterator variables may end up either in the
45144 init vector (simple assignments), in omp_for_parse_state->pre_body
45145 (decl_exprs for iterators bound in the for statement), or in the
45146 scope surrounding this level of loop initialization.
45148 The scopes of class iterator variables and their finalizers need to
45149 be adjusted after parsing so that all of the initialization happens
45150 in a scope surrounding all of the intervening and body code. For
45151 this reason we separately store the initialization and body blocks
45152 for each level of loops in the omp_for_parse_state structure and
45153 reassemble/reorder them in cp_parser_omp_for. See additional
45154 comments there about the use of placeholders, etc. */
45156 static tree
45158 {
45163 tree init_scope;
45168 location_t loc;
45176 /* Handle loop transformations first. Note that when we get here
45177 omp_for_parse_state->depth has already been incremented to indicate
45178 the depth of the *next* loop, not the level of the loop body the
45179 transformation directive appears in. */
45181 /* Arrange for C++ standard attribute syntax to be parsed as regular
45182 pragmas. Give an error if there are other random attributes present. */
45188 "attributes other than OpenMP directives "
45192 {
45196 tree stmt;
45199 {
45209 {
45212 }
45215 OMP_CLAUSE_PARTIAL))
45216 {
45218 {
45220 "clause generates just one loop with "
45224 }
45225 else
45227 }
45228 else
45229 {
45231 "without %<partial%> clause does not have "
45234 }
45245 {
45248 }
45251 OMP_CLAUSE_SIZES);
45255 {
45260 }
45265 }
45270 {
45273 }
45275 {
45286 }
45289 }
45291 /* Diagnose errors if we don't have a "for" loop following the
45292 optional loop transforms. Otherwise, consume the token. */
45294 {
45297 /* Don't call cp_parser_error here since it overrides the
45298 provided message with a more confusing one if there was
45299 a bad pragma or attribute directive. */
45301 /* See if we can recover by skipping over bad pragma(s). */
45303 {
45309 }
45311 }
45314 /* Forbid break/continue in the loop initializer, condition, and
45315 increment expressions. */
45319 /* We are not in intervening code now. */
45322 /* Don't create location wrapper nodes within an OpenMP "for"
45323 statement. */
45324 auto_suppress_location_wrappers sentinel;
45326 matching_parens parens;
45331 integer_zero_node);
45334 /* The init_block acts as a container for this level of loop goo. */
45338 /* Wrap a scope around this entire level of loop to hold bindings
45339 of loop iteration variables. We can't insert them directly
45340 in the containing scope because that would cause their visibility to
45341 be incorrect with respect to intervening code after this loop.
45342 We will combine the nested init_scopes in postprocessing after the
45343 entire loop is parsed. */
45346 /* Now we need another level of statement list container to capture the
45347 initialization (and possible finalization) bits. In some cases this
45348 container may be popped off during initializer parsing to store code in
45349 INIT or THIS_PRE_BODY, depending on the form of initialization. If
45350 we have a class iterator we will pop it at the end of parsing this
45351 level, so the cleanups are handled correctly. */
45355 {
45356 /* Save tokens so that we can put them back. */
45359 /* Look for ':' that is not nested in () or {}. */
45360 is_range_for
45363 CPP_COLON,
45364 /*consume_paren=*/
45367 /* Roll back the tokens we skipped. */
45371 {
45372 bool saved_colon_corrects_to_scope_p
45375 /* A colon is used in range-based for. */
45378 /* Parse the declaration. */
45380 /*function_definition_allowed_p=*/
45382 parser->colon_corrects_to_scope_p
45396 "%<ordered%> clause with parameter on "
45400 }
45401 }
45403 add_private_clause
45409 /* If the iteration variable was introduced via a declaration in the
45410 for statement, DECL points at it. Otherwise DECL is null and
45411 REAL_DECL is a variable previously declared in an outer scope.
45412 Make REAL_DECL point at the iteration variable no matter where it
45413 was introduced. */
45417 /* Some clauses treat iterator variables specially. */
45422 {
45428 {
45432 }
45435 {
45436 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
45440 {
45444 }
45445 else
45446 {
45449 }
45451 }
45452 else
45453 {
45458 }
45459 }
45462 {
45463 tree c;
45465 {
45474 decl);
45479 decl);
45480 }
45482 {
45489 else
45494 {
45497 /* For linear, signal that we need to fill up
45498 the so far unknown linear step. */
45501 }
45502 }
45503 }
45510 {
45511 /* If decl is an iterator, preserve the operator on decl
45512 until finish_omp_for. */
45514 && ((processing_template_decl
45519 else
45522 }
45524 parse_close_paren:
45530 /* We've parsed all the for (...) stuff now. Store the bits. */
45536 {
45539 }
45541 {
45543 omp_for_parse_state->orig_declv
45546 }
45553 /* Start a nested block for the loop body. */
45555 integer_zero_node);
45566 {
45572 }
45575 {
45576 /* This is the open brace in the loop-body grammar production. Rather
45577 than trying to special-case braces, just parse it as a compound
45578 statement and handle the nested loop-body case there. Note that
45579 when we see a further open brace inside the compound statement
45580 loop-body, we don't know whether it is the start of intervening
45581 code that is a compound statement, or a level of braces
45582 surrounding a nested loop-body. Use the WANT_NESTED_LOOP state
45583 bit to ensure we have only one nested loop at each level. */
45590 {
45591 /* We have already parsed the whole loop body and not found a
45592 nested loop. */
45596 }
45598 }
45599 else
45600 {
45601 /* This is the final-loop-body case in the grammar: we have something
45602 that is not a FOR and not an open brace. */
45604 {
45605 /* If we were expecting a nested loop, give an error and mark
45606 that parsing has failed, and try to recover by parsing the
45607 body as regular code without further collapsing. */
45611 }
45614 /* Generate the parts of range for that belong in the loop body,
45615 to be executed on every iteration. This includes setting the
45616 user-declared decomposition variables from the compiler-generated
45617 temporaries that are the real iteration variables for OMP_FOR.
45618 FIXME: Not sure if this is correct with respect to visibility
45619 of the variables from intervening code. However, putting this
45620 code in each level of loop instead of all around the innermost
45621 body also makes the decomposition variables visible to the
45622 inner for init/bound/step exressions, which is not supposed to
45623 happen and causes test failures. */
45626 {
45631 }
45633 /* Now parse the final-loop-body for the innermost loop. */
45637 else
45640 }
45645 /* Pop and remember the body block. Add the body placeholder
45646 to the surrounding statement list instead. This is just a unique
45647 token that will be replaced when we reassemble the generated
45648 code for the entire omp for statement. */
45653 /* Pop and remember the init block. */
45660 /* Return the init placeholder rather than the remembered init block.
45661 Again, this is just a unique cookie that will be used to reassemble
45662 code pieces when the entire omp for statement has been parsed. */
45664 }
45666 /* Worker for find_structured_blocks. *TP points to a STATEMENT_LIST
45667 and ITER is the element that is or contains a nested loop. This
45668 function moves the statements before and after ITER into
45669 OMP_STRUCTURED_BLOCKs and modifies *TP. */
45670 static void
45672 {
45676 {
45681 TSI_SAME_STMT);
45682 i++;
45684 }
45685 else
45686 {
45690 }
45695 TSI_SAME_STMT);
45696 }
45698 /* Helper to find and mark structured blocks in intervening code for a
45699 single loop level with markers for later error checking. *TP is the
45700 piece of code to be marked and INNER is the inner loop placeholder.
45701 Returns true if INNER was found (recursively) in *TP. */
45702 static bool
45704 {
45710 {
45712 {
45714 /* The normal case is that there is no intervening code and we
45715 do not have to insert any OMP_STRUCTURED_BLOCK markers. */
45717 {
45721 }
45722 }
45724 }
45729 else
45731 }
45733 /* Helpers used for relinking tree structures: In tree rooted at
45734 CONTEXT, replace ORIG with REPLACEMENT. If FLATTEN is true, try to combine
45735 nested BIND_EXPRs. Gives an assertion if it fails to find ORIG. */
45738 tree orig;
45739 tree repl;
45741 };
45743 static tree
45746 {
45749 {
45752 }
45753 /* Remove redundant BIND_EXPRs with no bindings even when not specifically
45754 trying to flatten. */
45759 {
45762 }
45766 {
45768 {
45769 /* Merge binding lists for two directly nested BIND_EXPRs,
45770 keeping the outer one. */
45775 }
45777 /* There might be a statement list containing cleanup_points
45778 etc between the two levels of BIND_EXPR. We can still merge
45779 them, again keeping the outer BIND_EXPR. */
45782 {
45785 {
45790 }
45791 }
45792 }
45794 }
45796 static void
45798 {
45811 }
45813 /* Walker to patch up the BLOCK_NODE hierarchy after the above surgery.
45814 *DP is the parent block. */
45816 static tree
45818 {
45821 /* BIND_EXPR_BLOCK may be null if the expression is not a
45822 full-expression; if there's no block, no patching is necessary
45823 for this node. */
45825 {
45828 {
45832 }
45837 }
45840 }
45842 /* Parse the restricted form of the for statement allowed by OpenMP. */
45844 static tree
45847 {
45848 tree ret;
45856 tree result;
45863 {
45866 }
45871 {
45874 }
45881 {
45887 }
45895 /* Initialize parse state for recursive descent. */
45920 /* Bomb out early if there was an error (not enough loops, etc). */
45922 {
45925 }
45927 /* Relink the init and body blocks that were built during parsing. At
45928 this point we have a structure nested like
45929 init 0
45930 body 0
45931 init 1
45932 body 1
45933 init 2
45934 body 2
45935 and we want to turn it into
45936 init 0
45937 init 1
45938 init 2
45939 omp_for
45940 body 0
45941 body 1
45942 body 2
45943 We also need to flatten the init blocks, as some code for later
45944 processing of combined directives gets confused otherwise. */
45951 /* First insert markers for structured blocks for intervening code in
45952 the loop bodies. */
45957 {
45962 }
45964 /* Do the substitution from the inside out. */
45969 {
45977 }
45981 {
45984 }
45986 /* Generate the OMP_FOR. Note finish_omp_for adds the OMP_FOR
45987 (and possibly other stuff) to the current statement list but
45988 returns a pointer to the OMP_FOR itself, or null in case of error. */
45995 /* Check for errors involving lb/ub/incr expressions referencing
45996 variables declared in intervening code. */
45998 && ret
46005 {
46012 /* Splice the omp_for into the nest of init blocks. */
46017 /* Some later processing for combined directives assumes
46018 that the BIND_EXPR containing range for variables appears
46019 at top level in the OMP_FOR body. Fix that up if it's
46020 not the case, e.g. because there is intervening code. */
46024 /* Clean up the block subblock/superblock links. Per comment in
46025 begin_compound_stmt, "we don't build BLOCK nodes when processing
46026 templates", so skip this step in that case. */
46028 {
46032 }
46034 /* Finally record the result. */
46038 }
46044 }
46046 /* Helper function for OpenMP parsing, split clauses and call
46047 finish_omp_clauses on each of the set of clauses afterwards. */
46049 static void
46052 {
46058 i == C_OMP_CLAUSE_SPLIT_TARGET
46060 }
46062 /* OpenMP 5.0:
46063 #pragma omp loop loop-clause[optseq] new-line
46064 for-loop */
46066 #define OMP_LOOP_CLAUSE_MASK \
46067 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
46069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
46071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
46072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
46074 static tree
46078 {
46089 {
46092 }
46104 }
46106 /* OpenMP 4.0:
46107 #pragma omp simd simd-clause[optseq] new-line
46108 for-loop */
46110 #define OMP_SIMD_CLAUSE_MASK \
46111 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
46112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
46113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
46114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
46115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
46117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
46119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
46121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
46123 static tree
46127 {
46138 {
46141 }
46153 }
46155 /* OpenMP 2.5:
46156 #pragma omp for for-clause[optseq] new-line
46157 for-loop
46159 OpenMP 4.0:
46160 #pragma omp for simd for-simd-clause[optseq] new-line
46161 for-loop */
46163 #define OMP_FOR_CLAUSE_MASK \
46164 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
46167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
46168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
46170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
46171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
46172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
46173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
46176 static tree
46180 {
46187 /* parallel for{, simd} disallows nowait clause, but for
46188 target {teams distribute ,}parallel for{, simd} it should be accepted. */
46191 /* Composite distribute parallel for{, simd} disallows ordered clause. */
46196 {
46201 {
46225 }
46226 }
46228 {
46231 }
46233 /* Composite distribute parallel for disallows linear clause. */
46240 {
46243 }
46255 }
46260 /* OpenMP 2.5:
46261 # pragma omp master new-line
46262 structured-block */
46264 static tree
46268 {
46276 {
46281 {
46301 }
46302 }
46304 {
46307 }
46310 {
46314 }
46315 else
46320 }
46322 /* OpenMP 5.1:
46323 # pragma omp masked masked-clauses new-line
46324 structured-block */
46326 #define OMP_MASKED_CLAUSE_MASK \
46327 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FILTER)
46329 static tree
46333 {
46342 {
46347 {
46368 }
46369 }
46371 {
46374 }
46379 {
46382 }
46386 clauses);
46387 }
46389 /* OpenMP 2.5:
46390 # pragma omp ordered new-line
46391 structured-block
46393 OpenMP 4.5:
46394 # pragma omp ordered ordered-clauses new-line
46395 structured-block */
46397 #define OMP_ORDERED_CLAUSE_MASK \
46398 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
46399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
46401 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
46402 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DOACROSS))
46405 static bool
46408 {
46416 {
46421 {
46423 {
46426 }
46428 {
46430 "%qs clause may only be used in compound "
46434 }
46435 tree clauses
46437 OMP_ORDERED_DEPEND_CLAUSE_MASK,
46441 }
46442 }
46444 tree clauses
46455 }
46457 /* OpenMP 2.5:
46459 section-scope:
46460 { section-sequence }
46462 section-sequence:
46463 section-directive[opt] structured-block
46464 section-sequence section-directive structured-block */
46466 static tree
46468 {
46473 matching_braces braces;
46480 != PRAGMA_OMP_SECTION
46482 {
46484 PRAGMA_OMP_SECTION);
46487 }
46490 {
46500 {
46504 }
46506 {
46509 }
46512 PRAGMA_OMP_SECTION);
46515 }
46526 }
46528 /* OpenMP 2.5:
46529 # pragma omp sections sections-clause[optseq] newline
46530 sections-scope */
46532 #define OMP_SECTIONS_CLAUSE_MASK \
46533 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
46536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46540 static tree
46543 {
46555 {
46558 }
46565 }
46567 /* OpenMP 2.5:
46568 # pragma omp parallel parallel-clause[optseq] new-line
46569 structured-block
46570 # pragma omp parallel for parallel-for-clause[optseq] new-line
46571 structured-block
46572 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
46573 structured-block
46575 OpenMP 4.0:
46576 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
46577 structured-block */
46579 #define OMP_PARALLEL_CLAUSE_MASK \
46580 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
46584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
46585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
46586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
46588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
46591 static tree
46595 {
46602 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
46608 {
46616 if_p);
46620 if_p);
46623 block);
46628 }
46629 /* When combined with distribute, parallel has to be followed by for.
46630 #pragma omp target parallel is allowed though. */
46634 {
46638 }
46640 {
46644 {
46658 block);
46661 /* masked does have just filter clause, but during gimplification
46662 isn't represented by a gimplification omp context, so for
46663 #pragma omp parallel masked don't set OMP_PARALLEL_COMBINED,
46664 so that
46665 #pragma omp parallel masked
46666 #pragma omp taskloop simd lastprivate (x)
46667 isn't confused with
46668 #pragma omp parallel masked taskloop simd lastprivate (x) */
46672 }
46674 {
46688 block);
46691 /* master doesn't have any clauses and during gimplification
46692 isn't represented by a gimplification omp context, so for
46693 #pragma omp parallel master don't set OMP_PARALLEL_COMBINED,
46694 so that
46695 #pragma omp parallel master
46696 #pragma omp taskloop simd lastprivate (x)
46697 isn't confused with
46698 #pragma omp parallel master taskloop simd lastprivate (x) */
46702 }
46704 {
46719 block);
46724 }
46726 {
46729 }
46731 {
46741 block);
46744 }
46745 }
46747 {
46750 }
46755 {
46758 }
46767 }
46769 /* OpenMP 2.5:
46770 # pragma omp single single-clause[optseq] new-line
46771 structured-block */
46773 #define OMP_SINGLE_CLAUSE_MASK \
46774 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
46777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46780 static tree
46782 {
46793 }
46795 /* OpenMP 5.1:
46796 # pragma omp scope scope-clause[optseq] new-line
46797 structured-block */
46799 #define OMP_SCOPE_CLAUSE_MASK \
46800 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46806 static tree
46808 {
46819 }
46821 /* OpenMP 3.0:
46822 # pragma omp task task-clause[optseq] new-line
46823 structured-block */
46825 #define OMP_TASK_CLAUSE_MASK \
46826 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
46828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
46829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
46832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
46833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
46834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
46836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
46838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DETACH) \
46839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_AFFINITY))
46841 static tree
46843 {
46855 }
46857 /* OpenMP 3.0:
46858 # pragma omp taskwait new-line
46860 OpenMP 5.0:
46861 # pragma omp taskwait taskwait-clause[opt] new-line */
46863 #define OMP_TASKWAIT_CLAUSE_MASK \
46864 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46867 static void
46869 {
46870 tree clauses
46875 {
46882 }
46883 else
46885 }
46887 /* OpenMP 3.1:
46888 # pragma omp taskyield new-line */
46890 static void
46892 {
46895 }
46897 /* OpenMP 4.0:
46898 # pragma omp taskgroup new-line
46899 structured-block
46901 OpenMP 5.0:
46902 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
46904 #define OMP_TASKGROUP_CLAUSE_MASK \
46905 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
46908 static tree
46910 {
46911 tree clauses
46916 if_p),
46917 clauses);
46918 }
46921 /* OpenMP 2.5:
46922 # pragma omp threadprivate (variable-list) */
46924 static void
46926 {
46927 tree vars;
46933 }
46935 /* OpenMP 4.0:
46936 # pragma omp cancel cancel-clause[optseq] new-line */
46938 #define OMP_CANCEL_CLAUSE_MASK \
46939 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
46940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
46941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
46942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
46943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
46945 static void
46947 {
46951 }
46953 /* OpenMP 4.0:
46954 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
46956 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
46957 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
46958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
46959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
46960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
46962 static bool
46965 {
46966 tree clauses;
46970 {
46975 {
46978 }
46979 }
46981 {
46985 }
46988 {
46993 else
46997 }
47000 OMP_CANCELLATION_POINT_CLAUSE_MASK,
47002 pragma_tok);
47005 }
47007 /* OpenMP 4.0:
47008 #pragma omp distribute distribute-clause[optseq] new-line
47009 for-loop */
47011 #define OMP_DISTRIBUTE_CLAUSE_MASK \
47012 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
47013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
47014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
47015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
47016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
47017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
47018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
47020 static tree
47024 {
47033 {
47041 else
47044 {
47050 {
47054 else
47057 }
47063 else
47077 }
47078 }
47080 {
47083 }
47088 {
47091 }
47103 }
47105 /* OpenMP 4.0:
47106 # pragma omp teams teams-clause[optseq] new-line
47107 structured-block */
47109 #define OMP_TEAMS_CLAUSE_MASK \
47110 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
47111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
47112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
47113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
47114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
47115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
47116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
47117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
47119 static tree
47123 {
47132 {
47136 {
47162 }
47164 {
47190 }
47191 }
47193 {
47196 }
47201 {
47204 }
47214 }
47216 /* OpenMP 4.0:
47217 # pragma omp target data target-data-clause[optseq] new-line
47218 structured-block */
47220 #define OMP_TARGET_DATA_CLAUSE_MASK \
47221 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
47222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
47223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
47224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
47225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
47227 static tree
47229 {
47231 omp_requires_mask
47234 tree clauses
47240 {
47243 {
47269 "%<#pragma omp target data%> with map-type other "
47270 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
47274 }
47279 }
47282 {
47285 "%<#pragma omp target data%> must contain at least "
47286 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
47289 }
47300 }
47302 /* OpenMP 4.5:
47303 # pragma omp target enter data target-enter-data-clause[optseq] new-line
47304 structured-block */
47306 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
47307 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
47308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
47309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
47310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
47311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
47313 static bool
47316 {
47319 {
47324 {
47327 }
47328 }
47330 {
47334 }
47337 {
47343 }
47346 omp_requires_mask
47349 tree clauses
47355 {
47358 {
47392 "%<#pragma omp target enter data%> with map-type other "
47396 }
47398 }
47401 {
47404 "%<#pragma omp target enter data%> must contain at least "
47407 }
47415 }
47417 /* OpenMP 4.5:
47418 # pragma omp target exit data target-enter-data-clause[optseq] new-line
47419 structured-block */
47421 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
47422 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
47423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
47424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
47425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
47426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
47428 static bool
47431 {
47434 {
47439 {
47442 }
47443 }
47445 {
47449 }
47452 {
47458 }
47461 omp_requires_mask
47464 tree clauses
47472 {
47475 {
47509 "%<#pragma omp target exit data%> with map-type other "
47510 "than %<from%>, %<tofrom%>, %<release%> or %<delete%> "
47514 }
47516 }
47519 {
47522 "%<#pragma omp target exit data%> must contain at least "
47525 }
47533 }
47535 /* OpenMP 4.0:
47536 # pragma omp target update target-update-clause[optseq] new-line */
47538 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
47539 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
47540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
47541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
47542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
47543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
47544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
47546 static bool
47549 {
47551 {
47557 }
47559 tree clauses
47564 {
47566 "%<#pragma omp target update%> must contain at least one "
47569 }
47572 omp_requires_mask
47581 }
47583 /* OpenMP 4.0:
47584 # pragma omp target target-clause[optseq] new-line
47585 structured-block */
47587 #define OMP_TARGET_CLAUSE_MASK \
47588 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
47589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
47590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
47591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
47592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
47593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
47594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
47595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
47596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
47597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
47598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
47599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR)\
47600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HAS_DEVICE_ADDR))
47602 static bool
47605 {
47607 omp_requires_mask
47611 {
47623 {
47631 {
47632 tree stmt;
47634 {
47637 OMP_TARGET_CLAUSE_MASK,
47642 OMP_TARGET_CLAUSE_MASK,
47647 OMP_TARGET_CLAUSE_MASK,
47652 }
47654 }
47659 {
47663 if_p);
47668 if_p);
47673 if_p);
47677 }
47683 /* For combined target teams, ensure the num_teams and
47684 thread_limit clause expressions are evaluated on the host,
47685 before entering the target construct. */
47694 {
47697 tf_none);
47704 OMP_CLAUSE_FIRSTPRIVATE);
47709 }
47714 }
47716 {
47719 }
47721 {
47725 }
47727 {
47730 }
47732 {
47735 }
47737 {
47740 }
47741 }
47743 {
47746 }
47753 {
47759 }
47768 }
47771 /* OpenMP 5.1: Parse sizes list for "omp tile sizes"
47772 sizes ( size-expr-list ) */
47773 static tree
47775 {
47784 {
47787 }
47790 matching_parens parens;
47794 do
47795 {
47801 {
47807 }
47810 }
47818 }
47820 /* OpenMP 5.1:
47821 #pragma omp tile sizes ( size-expr-list ) */
47823 static tree
47825 {
47839 }
47841 #define OMP_UNROLL_CLAUSE_MASK \
47842 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARTIAL) \
47843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FULL))
47845 /* OpenMP 5.1:
47846 #pragma omp unroll unroll-clause[optseq] */
47848 static tree
47850 {
47860 }
47862 /* OpenACC 2.0:
47863 # pragma acc cache (variable-list) new-line
47865 OpenACC 2.7:
47866 # pragma acc cache (readonly: variable-list) new-line
47867 */
47869 static tree
47871 {
47872 /* Don't create location wrapper nodes within 'OMP_CLAUSE__CACHE_'
47873 clauses. */
47874 auto_suppress_location_wrappers sentinel;
47880 {
47885 {
47889 }
47892 }
47909 }
47911 /* OpenACC 2.0:
47912 # pragma acc data oacc-data-clause[optseq] new-line
47913 structured-block */
47915 #define OACC_DATA_CLAUSE_MASK \
47916 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
47917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
47918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
47922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
47923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
47924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
47926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
47928 static tree
47930 {
47943 }
47945 /* OpenACC 2.0:
47946 # pragma acc host_data <clauses> new-line
47947 structured-block */
47949 #define OACC_HOST_DATA_CLAUSE_MASK \
47950 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) \
47951 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47952 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) )
47954 static tree
47956 {
47964 {
47968 }
47976 }
47978 /* OpenACC 2.0:
47979 # pragma acc declare oacc-data-clause[optseq] new-line
47980 */
47982 #define OACC_DECLARE_CLAUSE_MASK \
47983 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
47984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
47988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
47989 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
47990 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
47992 static tree
47994 {
48004 {
48008 }
48011 {
48015 {
48019 }
48022 {
48034 {
48036 "%qD must be a global variable in "
48038 decl);
48041 }
48046 {
48050 }
48052 {
48054 "invalid use of %<extern%> variable %qD "
48058 }
48060 {
48062 "invalid use of %<global%> variable %qD "
48066 }
48068 }
48071 /* This seems to ignore the existence of cleanup scopes?
48072 What is the meaning for local extern decls? The local
48073 extern is in this scope, but it is referring to a decl that
48074 is namespace scope. */
48077 {
48080 }
48082 {
48084 "%qD must be a variable declared in the same scope as "
48088 }
48091 {
48093 /* We need to mark the aliased decl, as that is the entity
48094 that is being referred to. This won't work for
48095 dependent variables, but it didn't work for them before
48096 DECL_LOCAL_DECL_P was a thing either. But then
48097 dependent local extern variable decls are as rare as
48098 hen's teeth. */
48106 {
48111 }
48113 tree id;
48116 else
48122 {
48125 {
48128 {
48132 }
48133 }
48134 }
48135 }
48136 }
48149 }
48151 /* OpenACC 2.0:
48152 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
48154 or
48156 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
48158 LOC is the location of the #pragma token.
48159 */
48161 #define OACC_ENTER_DATA_CLAUSE_MASK \
48162 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
48163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
48164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
48165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
48166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
48167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
48169 #define OACC_EXIT_DATA_CLAUSE_MASK \
48170 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
48171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
48172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
48173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
48174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
48175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
48176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
48178 static tree
48181 {
48190 {
48195 }
48202 else
48207 {
48211 }
48219 }
48221 /* OpenACC 2.0:
48222 # pragma acc loop oacc-loop-clause[optseq] new-line
48223 structured-block */
48225 #define OACC_LOOP_CLAUSE_MASK \
48226 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
48227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
48228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
48229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
48230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
48231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
48232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
48233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
48234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
48235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
48237 static tree
48240 {
48250 {
48256 }
48263 /* Later processing of combined acc loop constructs gets confused
48264 by an extra level of empty nested BIND_EXPRs, so flatten them. */
48273 }
48275 /* OpenACC 2.0:
48276 # pragma acc kernels oacc-kernels-clause[optseq] new-line
48277 structured-block
48279 or
48281 # pragma acc parallel oacc-parallel-clause[optseq] new-line
48282 structured-block
48284 OpenACC 2.6:
48286 # pragma acc serial oacc-serial-clause[optseq] new-line
48287 */
48289 #define OACC_KERNELS_CLAUSE_MASK \
48290 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
48291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
48292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
48293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
48294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
48295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
48296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
48297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
48298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
48299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
48300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
48301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
48302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
48303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
48304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
48305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
48307 #define OACC_PARALLEL_CLAUSE_MASK \
48308 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
48309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
48310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
48311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
48312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
48313 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
48314 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
48315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
48316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
48317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
48318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
48319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
48320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
48321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
48322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
48323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
48324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
48325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
48326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
48328 #define OACC_SERIAL_CLAUSE_MASK \
48329 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
48330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
48331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
48332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
48333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
48334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
48335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
48336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
48337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
48338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
48339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
48340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
48341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
48342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
48343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
48344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
48346 static tree
48349 {
48350 omp_clause_mask mask;
48353 {
48371 }
48374 {
48378 {
48381 tree clauses;
48386 }
48387 }
48398 }
48400 /* OpenACC 2.0:
48401 # pragma acc update oacc-update-clause[optseq] new-line
48402 */
48404 #define OACC_UPDATE_CLAUSE_MASK \
48405 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
48406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
48407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
48408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
48409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
48410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
48411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
48413 static tree
48415 {
48422 {
48424 "%<#pragma acc update%> must contain at least one "
48427 }
48435 }
48437 /* OpenACC 2.0:
48438 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
48440 LOC is the location of the #pragma token.
48441 */
48443 #define OACC_WAIT_CLAUSE_MASK \
48444 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
48446 static tree
48448 {
48462 }
48464 /* OpenMP 4.0:
48465 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
48467 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
48468 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
48469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
48470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
48471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
48472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
48473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
48475 static void
48479 {
48481 cp_omp_declare_simd_data data;
48483 {
48491 /* It is safe to take the address of a local variable; it will only be
48492 used while this scope is live. */
48494 }
48496 {
48498 "%<#pragma omp declare %s%> followed by "
48503 }
48505 /* Store away all pragma tokens. */
48514 {
48518 {
48531 }
48536 "%<#pragma omp declare %s%> not immediately followed by "
48541 }
48542 }
48544 /* OpenMP 5.0:
48546 trait-selector:
48547 trait-selector-name[([trait-score:]trait-property[,trait-property[,...]])]
48549 trait-score:
48550 score(score-expression)
48552 Note that this function returns a list of trait selectors for the
48553 trait-selector-set SET. */
48555 static tree
48558 {
48560 do
48561 {
48562 tree selector;
48566 else
48567 {
48570 }
48572 enum omp_ts_code sel
48576 {
48577 /* Per the spec, "Implementations can ignore specified selectors
48578 that are not those described in this section"; however, we
48579 must record such selectors because they cause match failures. */
48581 OPT_Wopenmp,
48591 {
48594 }
48595 else
48597 }
48605 tree t;
48608 {
48610 {
48614 }
48616 matching_parens parens;
48623 {
48630 {
48634 matching_parens parens2;
48643 "%<score%> cannot be specified in traits "
48647 {
48658 else
48660 }
48661 }
48662 else
48666 }
48669 {
48673 {
48677 properties);
48678 }
48679 else
48680 {
48683 }
48686 do
48687 {
48692 {
48695 }
48700 else
48701 {
48705 }
48711 else
48713 }
48718 /* FIXME: this is bogus, the expression need
48719 not be constant. */
48722 {
48729 else
48731 properties);
48732 }
48733 else
48738 {
48740 {
48742 "selector may not be specified in "
48745 }
48746 properties
48748 OMP_DECLARE_SIMD_CLAUSE_MASK,
48750 }
48752 {
48753 /* FIXME: The "requires" selector was added in OpenMP 5.1.
48754 Currently only the now-deprecated syntax
48755 from OpenMP 5.0 is supported. */
48759 }
48760 else
48765 }
48771 }
48775 {
48778 }
48784 else
48786 }
48790 }
48792 /* OpenMP 5.0:
48794 trait-set-selector[,trait-set-selector[,...]]
48796 trait-set-selector:
48797 trait-set-selector-name = { trait-selector[, trait-selector[, ...]] }
48799 trait-set-selector-name:
48800 constructor
48801 device
48802 implementation
48803 user */
48805 static tree
48808 {
48810 do
48811 {
48814 setp
48819 {
48822 }
48829 matching_braces braces;
48833 tree selectors
48836 {
48839 }
48847 else
48849 }
48855 }
48857 /* Assumption clauses:
48858 OpenMP 5.1
48859 absent (directive-name-list)
48860 contains (directive-name-list)
48861 holds (expression)
48862 no_openmp
48863 no_openmp_routines
48864 no_parallelism */
48866 static void
48869 {
48884 {
48897 {
48902 }
48904 {
48909 }
48911 {
48916 }
48918 {
48920 matching_parens parens;
48922 {
48934 }
48935 }
48937 {
48939 matching_parens parens;
48941 {
48942 do
48943 {
48946 location_t dloc
48949 {
48950 tree id;
48955 CPP_KEYWORD))
48956 {
48957 enum rid rid
48961 }
48962 else
48965 }
48968 else
48969 {
48982 else
48983 {
48988 "mentioned in both %<absent%> and "
48996 ? &absent_head
48999 "mentioned multiple times in %qs "
49006 }
49009 }
49012 else
49014 }
49021 }
49022 }
49024 {
49031 }
49032 else
49033 {
49037 }
49038 }
49040 }
49042 /* OpenMP 5.1
49043 # pragma omp assume clauses[optseq] new-line */
49045 static void
49047 {
49050 }
49052 /* OpenMP 5.1
49053 # pragma omp assumes clauses[optseq] new-line */
49055 static bool
49057 {
49060 }
49062 /* Finalize #pragma omp declare variant after a fndecl has been parsed, and put
49063 that into "omp declare variant base" attribute. */
49065 static tree
49067 tree attrs)
49068 {
49069 matching_parens parens;
49071 {
49072 fail:
49075 }
49080 cp_expr varid
49088 tree variant;
49095 else
49096 {
49097 tree ambiguous_decls;
49105 }
49109 {
49111 variant
49119 }
49134 {
49137 }
49149 {
49151 match_loc);
49160 }
49165 }
49168 /* Finalize #pragma omp declare simd clauses after direct declarator has
49169 been parsed, and put that into "omp declare simd" attribute. */
49171 static tree
49173 {
49179 {
49184 }
49189 {
49200 {
49203 pragma_tok);
49211 }
49212 else
49213 {
49215 attrs
49217 }
49219 }
49223 {
49229 {
49231 {
49238 {
49246 else
49249 }
49255 {
49257 "unknown OpenMP directive name in "
49262 }
49266 {
49268 "OpenMP directive other than %<declare simd%> "
49269 "or %<declare variant%> appertains to a "
49272 }
49275 {
49277 "mixing OpenMP directives with attribute and "
49280 }
49285 {
49288 }
49290 cp_token tok = {};
49298 tok = {};
49303 tok = {};
49315 /* Move the current source position to that of the first token
49316 in the new lexer. */
49326 {
49334 pragma_tok);
49338 cl);
49343 }
49344 else
49345 {
49347 attrs
49349 attrs);
49350 }
49353 }
49355 }
49356 else
49358 }
49364 }
49366 /* D should be DEFERRED_PARSE from omp::decl attribute. If it contains
49367 a threadprivate, groupprivate, allocate or declare target directive,
49368 return true and parse it for DECL. */
49370 bool
49372 {
49378 {
49386 else
49389 }
49395 {
49397 "unknown OpenMP directive name in "
49400 }
49402 /* && dir->id != PRAGMA_OMP_GROUPPRIVATE */
49416 cp_token tok = {};
49424 tok = {};
49429 tok = {};
49441 /* Move the current source position to that of the first token in the
49442 new lexer. */
49447 }
49449 /* Helper for cp_parser_omp_declare_target, handle one to or link clause
49450 on #pragma omp declare target. Return false if errors were reported. */
49452 static bool
49455 {
49458 tree id;
49460 {
49463 }
49464 else
49467 {
49470 "%qD specified both in declare target %<link%> and %qs"
49472 else
49474 "%qD specified both in declare target %<link%> and "
49477 }
49479 {
49486 {
49489 {
49493 }
49494 }
49495 }
49499 {
49503 {
49506 }
49507 }
49509 {
49513 {
49516 }
49517 }
49519 {
49523 {
49527 }
49528 }
49530 }
49532 /* OpenMP 4.0:
49533 # pragma omp declare target new-line
49534 declarations and definitions
49535 # pragma omp end declare target new-line
49537 OpenMP 4.5:
49538 # pragma omp declare target ( extended-list ) new-line
49540 # pragma omp declare target declare-target-clauses[seq] new-line */
49542 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
49543 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
49544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ENTER) \
49545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
49546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE) \
49547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INDIRECT))
49549 static void
49551 {
49559 clauses
49564 {
49566 clauses);
49569 }
49570 else
49571 {
49572 cp_omp_declare_target_attr a
49577 }
49579 {
49584 }
49586 {
49601 }
49607 "%<device_type%> clause must specify 'any' when used with "
49609 }
49611 /* OpenMP 5.1
49612 # pragma omp begin assumes clauses[optseq] new-line
49614 # pragma omp begin declare target clauses[optseq] new-line */
49616 #define OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK \
49617 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE) \
49618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INDIRECT))
49620 static void
49622 {
49626 {
49629 }
49631 {
49635 {
49638 }
49640 {
49642 tree clauses
49644 OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK,
49646 pragma_tok);
49650 {
49655 }
49656 cp_omp_declare_target_attr a
49659 }
49660 else
49661 {
49664 }
49665 }
49667 {
49672 }
49673 else
49674 {
49677 }
49678 }
49680 /* OpenMP 4.0:
49681 # pragma omp end declare target new-line
49683 OpenMP 5.1:
49684 # pragma omp end assumes new-line */
49686 static void
49688 {
49692 {
49695 }
49697 {
49701 {
49704 }
49707 else
49708 {
49712 }
49716 "%<#pragma omp end declare target%> without corresponding "
49717 "%<#pragma omp declare target%> or "
49719 else
49720 {
49721 cp_omp_declare_target_attr
49724 {
49727 "%qs in attribute syntax terminated "
49732 else
49734 "%qs in pragma syntax terminated "
49739 }
49740 }
49741 }
49743 {
49750 else
49751 {
49752 cp_omp_begin_assumes_data
49755 {
49758 "%qs in attribute syntax terminated "
49761 else
49763 "%qs in pragma syntax terminated "
49766 }
49767 }
49768 }
49769 else
49770 {
49774 }
49775 }
49777 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
49778 expression and optional initializer clause of
49779 #pragma omp declare reduction. We store the expression(s) as
49780 either 3, 6 or 7 special statements inside of the artificial function's
49781 body. The first two statements are DECL_EXPRs for the artificial
49782 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
49783 expression that uses those variables.
49784 If there was any INITIALIZER clause, this is followed by further statements,
49785 the fourth and fifth statements are DECL_EXPRs for the artificial
49786 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
49787 constructor variant (first token after open paren is not omp_priv),
49788 then the sixth statement is a statement with the function call expression
49789 that uses the OMP_PRIV and optionally OMP_ORIG variable.
49790 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
49791 to initialize the OMP_PRIV artificial variable and there is seventh
49792 statement, a DECL_EXPR of the OMP_PRIV statement again. */
49794 static bool
49796 {
49808 tree combiner;
49829 {
49832 }
49835 {
49837 matching_parens parens;
49843 {
49846 }
49862 {
49866 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
49870 == CPP_CLOSE_PAREN
49873 {
49877 }
49883 }
49884 else
49885 {
49887 /* Don't create location wrapper nodes here. */
49888 auto_suppress_location_wrappers sentinel;
49903 {
49908 }
49910 tree arg;
49923 }
49936 }
49940 UNKNOWN_LOCATION);
49943 }
49945 /* OpenMP 4.0
49946 #pragma omp declare reduction (reduction-id : typename-list : expression) \
49947 initializer-clause[opt] new-line
49949 initializer-clause:
49950 initializer (omp_priv initializer)
49951 initializer (function-name (argument-list)) */
49953 static void
49956 {
49966 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
49973 {
50005 }
50017 /* Types may not be defined in declare reduction type list. */
50020 parser->type_definition_forbidden_message
50026 saved_colon_doesnt_start_class_def_p
50031 {
50035 ;
50053 else
50058 else
50060 }
50062 /* Restore the saved message. */
50065 parser->colon_doesnt_start_class_def_p
50070 {
50071 fail:
50074 }
50080 {
50081 tree fntype
50084 NULL_TREE);
50101 {
50105 }
50111 {
50114 }
50116 {
50118 {
50124 }
50131 }
50132 else
50133 {
50136 /* We should never meet a matched duplicate decl. */
50138 }
50143 else
50146 {
50149 }
50157 else
50158 {
50162 }
50167 {
50175 }
50183 }
50187 done:
50188 /* Free any declarators allocated. */
50190 }
50192 /* OpenMP 4.0
50193 #pragma omp declare simd declare-simd-clauses[optseq] new-line
50194 #pragma omp declare reduction (reduction-id : typename-list : expression) \
50195 initializer-clause[opt] new-line
50196 #pragma omp declare target new-line
50198 OpenMP 5.0
50199 #pragma omp declare variant (identifier) match (context-selector) */
50201 static bool
50204 {
50206 {
50211 {
50216 }
50218 {
50223 }
50226 {
50229 context);
50231 }
50233 {
50236 }
50238 {
50242 }
50243 }
50248 }
50250 /* OpenMP 5.0
50251 #pragma omp requires clauses[optseq] new-line */
50253 static bool
50255 {
50260 {
50266 {
50281 {
50284 matching_parens parens;
50286 {
50288 {
50293 this_req
50296 this_req
50299 this_req
50302 this_req
50305 this_req
50307 }
50309 {
50311 "expected %<acq_rel%>, %<acquire%>, "
50314 {
50321 CPP_CLOSE_PAREN))
50324 }
50325 }
50326 else
50333 /*consume_paren=*/
50337 {
50340 }
50341 }
50343 }
50344 else
50345 {
50347 "%<unified_shared_memory%>, "
50348 "%<dynamic_allocators%>, "
50349 "%<reverse_offload%> "
50353 }
50357 {
50359 {
50366 }
50368 {
50372 }
50375 {
50378 this_req
50380 (omp_requires_mask
50382 }
50386 "lexically after first %<atomic%> construct "
50389 omp_requires_mask
50392 }
50393 }
50395 }
50401 }
50404 /* OpenMP 5.1:
50405 #pragma omp nothing new-line */
50407 static void
50409 {
50411 }
50414 /* OpenMP 5.1
50415 #pragma omp error clauses[optseq] new-line */
50417 static bool
50420 {
50428 {
50441 };
50449 {
50452 }
50454 {
50459 }
50463 matching_parens parens;
50465 {
50467 {
50471 else
50473 tf_warning_or_error,
50474 LOOKUP_NORMAL);
50475 }
50476 else
50477 {
50479 {
50487 }
50489 {
50494 {
50501 CPP_CLOSE_PAREN))
50504 }
50505 }
50506 else
50508 }
50514 /*consume_paren=*/
50518 {
50520 {
50523 }
50524 else
50526 }
50528 {
50530 {
50533 }
50534 else
50536 }
50537 }
50538 else
50540 }
50550 {
50552 {
50556 }
50557 tree fndecl
50566 }
50573 {
50577 }
50581 else
50585 }
50587 /* OpenMP 4.5:
50588 #pragma omp taskloop taskloop-clause[optseq] new-line
50589 for-loop
50591 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
50592 for-loop */
50594 #define OMP_TASKLOOP_CLAUSE_MASK \
50595 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
50596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
50597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
50598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
50599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
50600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
50601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
50602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
50603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
50604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
50605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
50606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
50607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
50608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
50609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
50610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
50611 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
50613 static tree
50617 {
50624 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
50625 clause. */
50630 {
50635 {
50659 }
50660 }
50662 {
50665 }
50670 {
50673 }
50680 if_p);
50686 }
50689 /* OpenACC 2.0:
50690 # pragma acc routine oacc-routine-clause[optseq] new-line
50691 function-definition
50693 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
50694 */
50696 #define OACC_ROUTINE_CLAUSE_MASK \
50697 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
50698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
50699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
50700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
50701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NOHOST) )
50703 /* Parse the OpenACC routine pragma. This has an optional '( name )'
50704 component, which must resolve to a declared namespace-scope
50705 function. The clauses are either processed directly (for a named
50706 function), or defered until the immediatley following declaration
50707 is parsed. */
50709 static void
50712 {
50714 /* The checking for "another pragma following this one" in the "no optional
50715 '( name )'" case makes sure that we dont re-enter. */
50718 cp_oacc_routine_data data;
50724 /* It is safe to take the address of a local variable; it will only be
50725 used while this scope is live. */
50728 /* Look for optional '( name )'. */
50730 {
50731 matching_parens parens;
50734 /* We parse the name as an id-expression. If it resolves to
50735 anything other than a non-overloaded function at namespace
50736 scope, it's an error. */
50752 {
50756 }
50758 data.clauses
50762 /* The clauses are in reverse order; fix that to make later diagnostic
50763 emission easier. */
50769 {
50774 }
50776 /* Perhaps we should use the same rule as declarations in different
50777 namespaces? */
50779 {
50784 }
50787 {
50791 }
50795 }
50797 {
50798 /* Store away all pragma tokens. */
50806 /* Emit a helpful diagnostic if there's another pragma following this
50807 one. */
50809 {
50812 /* ..., and then just keep going. */
50814 }
50816 /* We only have to consider the pragma_external case here. */
50821 else
50824 }
50825 }
50827 /* Finalize #pragma acc routine clauses after direct declarator has
50828 been parsed. */
50830 static tree
50832 {
50837 {
50839 "%<#pragma acc routine%> not immediately followed by "
50842 }
50858 /* The clauses are in reverse order; fix that to make later diagnostic
50859 emission easier. */
50862 /* Later, cp_finalize_oacc_routine will process the clauses. */
50866 }
50868 /* Apply any saved OpenACC routine clauses to a just-parsed
50869 declaration. */
50871 static void
50873 {
50875 {
50876 /* Keep going if we're in error reporting mode. */
50882 {
50884 {
50886 "%<#pragma acc routine%> not immediately followed by"
50890 }
50894 }
50896 int compatible
50901 {
50904 }
50906 {
50907 }
50908 else
50909 {
50911 {
50920 }
50922 /* Set the routine's level of parallelism. */
50926 /* Add an "omp declare target" attribute. */
50931 }
50932 }
50933 }
50935 /* Main entry point to OpenMP statement pragmas. */
50937 static void
50939 {
50940 tree stmt;
50945 {
50973 if_p);
50993 if_p);
50998 if_p);
51003 if_p);
51008 if_p);
51013 if_p);
51018 if_p);
51030 if_p);
51044 if_p);
51049 if_p);
51062 }
51065 }
51066 \f
51067 /* Transactional Memory parsing routines. */
51069 /* Parse a transaction attribute.
51071 txn-attribute:
51072 attribute
51073 [ [ identifier ] ]
51075 We use this instead of cp_parser_attributes_opt for transactions to avoid
51076 the pedwarn in C++98 mode. */
51078 static tree
51080 {
51095 {
51099 /* For keywords, use the canonical spelling,
51100 not the parsed identifier. */
51104 }
51105 else
51109 error1:
51112 }
51114 /* Parse a __transaction_atomic or __transaction_relaxed statement.
51116 transaction-statement:
51117 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
51118 compound-statement
51119 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
51120 */
51122 static tree
51124 {
51135 else
51136 {
51140 }
51142 /* Parse a noexcept specification. */
51146 {
51147 /* cancel-and-throw is unimplemented. */
51150 }
51151 else
51153 CP_PARSER_FLAGS_NONE,
51158 /* Keep track if we're in the lexical scope of an outer transaction. */
51170 }
51172 /* Parse a __transaction_atomic or __transaction_relaxed expression.
51174 transaction-expression:
51175 __transaction_atomic txn-noexcept-spec[opt] ( expression )
51176 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
51177 */
51179 static tree
51181 {
51194 keyword == RID_TRANSACTION_RELAXED
51208 /* Set this early. This might mean that we allow transaction_cancel in
51209 an expression that we find out later actually has to be a constexpr.
51210 However, we expect that cxx_constant_value will be able to deal with
51211 this; also, if the noexcept has no constexpr, then what we parse next
51212 really is a transaction's body. */
51215 /* Parse a noexcept specification. */
51217 CP_PARSER_FLAGS_NONE,
51224 {
51225 matching_parens parens;
51232 }
51233 else
51234 {
51235 /* The only expression that is available got parsed for the noexcept
51236 already. noexcept is true then. */
51239 }
51248 }
51250 /* Parse a function-transaction-block.
51252 function-transaction-block:
51253 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
51254 function-body
51255 __transaction_atomic txn-attribute[opt] function-try-block
51256 __transaction_relaxed ctor-initializer[opt] function-body
51257 __transaction_relaxed function-try-block
51258 */
51260 static void
51262 {
51277 else
51278 {
51282 }
51290 else
51291 cp_parser_ctor_initializer_opt_and_function_body
51297 }
51299 /* Parse a __transaction_cancel statement.
51301 cancel-statement:
51302 __transaction_cancel txn-attribute[opt] ;
51303 __transaction_cancel txn-attribute[opt] throw-expression ;
51305 ??? Cancel and throw is not yet implemented. */
51307 static tree
51309 {
51315 RT_TRANSACTION_CANCEL);
51322 /* ??? Parse cancel-and-throw here. */
51327 {
51331 }
51333 {
51337 }
51339 {
51342 {
51348 }
51349 }
51351 {
51355 }
51361 }
51362 \f
51364 /* Special handling for the first token or line in the file. The first
51365 thing in the file might be #pragma GCC pch_preprocess, which loads a
51366 PCH file, which is a GC collection point. So we need to handle this
51367 first pragma without benefit of an existing lexer structure.
51369 Always returns one token to the caller in *FIRST_TOKEN. This is
51370 either the true first token of the file, or the first token after
51371 the initial pragma. */
51373 static void
51375 {
51383 {
51387 }
51389 /* Skip to the end of the pragma. */
51391 {
51394 do
51397 }
51399 /* Now actually load the PCH file. */
51403 /* Read one more token to return to our caller. We have to do this
51404 after reading the PCH file in, since its pointers have to be
51405 live. */
51407 }
51409 /* Parse a pragma GCC ivdep. */
51411 static bool
51413 {
51416 }
51418 /* Parse a pragma GCC unroll. */
51420 static tree
51422 {
51428 }
51430 /* Parse a pragma GCC novector. */
51432 static bool
51434 {
51437 }
51439 /* Normal parsing of a pragma token. Here we can (and must) use the
51440 regular lexer. */
51442 static bool
51444 {
51447 tree stmt;
51459 {
51465 }
51469 {
51477 {
51488 }
51493 {
51504 }
51509 {
51520 }
51525 {
51537 }
51542 {
51554 }
51559 {
51571 }
51590 {
51596 }
51604 {
51610 }
51618 {
51623 }
51629 {
51635 }
51643 {
51649 }
51693 {
51695 "%<#pragma omp requires%> may only be used at file or "
51699 }
51704 {
51706 "%<#pragma omp assumes%> may only be used at file or "
51710 }
51746 "%<#pragma omp scan%> may only be used in "
51752 "%<#pragma omp section%> may only be used in "
51759 {
51766 {
51778 }
51781 {
51784 pragma_str);
51786 }
51790 do
51791 {
51793 {
51795 {
51800 }
51802 {
51807 }
51809 {
51814 }
51818 }
51821 }
51828 {
51831 }
51834 }
51841 bad_stmt:
51844 }
51848 }
51850 /* Helper for pragma_lex in preprocess-only mode; in this mode, we have not
51851 populated the lexer with any tokens (the tokens rather being read by
51852 c-ppoutput.c's machinery), so we need to read enough tokens now to handle
51853 a pragma. */
51854 static void
51856 {
51861 /* Read the rest of the tokens comprising the pragma line. */
51863 do
51864 {
51871 }
51873 /* The interface the pragma parsers have to the lexer. */
51875 enum cpp_ttype
51877 {
51893 else
51894 {
51898 }
51901 }
51903 void
51905 {
51906 /* We have already read all the tokens, so we just need to discard
51907 them here. */
51911 }
51913 \f
51914 /* External interface. */
51916 /* Parse one entire translation unit. */
51918 void
51920 {
51928 /* cp_lexer_new_main is called before doing any GC allocation
51929 because tokenization might load a PCH file. */
51938 }
51940 /* Create an identifier for a generic parameter type (a synthesized
51941 template parameter implied by `auto' or a concept identifier). */
51944 static tree
51946 {
51950 }
51952 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
51953 (creating a new template parameter list if necessary). Returns the newly
51954 created template type parm. */
51956 static tree
51958 {
51959 /* A requires-clause is not a function and cannot have placeholders. */
51961 {
51964 }
51968 /* We are either continuing a function template that already contains implicit
51969 template parameters, creating a new fully-implicit function template, or
51970 extending an existing explicit function template with implicit template
51971 parameters. */
51979 {
51983 }
51984 else
51985 {
51986 /* Roll back to the existing template parameter scope (in the case of
51987 extending an explicit function template) or introduce a new template
51988 parameter scope ahead of the function parameter scope (or class scope
51989 in the case of out-of-line member definitions). The function scope is
51990 added back after template parameter synthesis below. */
51995 {
51998 }
52000 {
52001 /* If not defining a class, then any class scope is a scope level in
52002 an out-of-line member definition. In this case simply wind back
52003 beyond the first such scope to inject the template parameter list.
52004 Otherwise wind back to the class being defined. The latter can
52005 occur in class member friend declarations such as:
52007 class A {
52008 void foo (auto);
52009 };
52010 class B {
52011 friend void A::foo (auto);
52012 };
52014 The template parameter list synthesized for the friend declaration
52015 must be injected in the scope of 'B'. This can also occur in
52016 erroneous cases such as:
52018 struct A {
52019 struct B {
52020 void foo (auto);
52021 };
52022 void B::foo (auto) {}
52023 };
52025 Here the attempted definition of 'B::foo' within 'A' is ill-formed
52026 but, nevertheless, the template parameter list synthesized for the
52027 declarator should be injected into the scope of 'A' as if the
52028 ill-formed template was specified explicitly. */
52031 {
52034 }
52035 }
52041 {
52042 /* Introduce a new template parameter list for implicit template
52043 parameters. */
52047 parser->implicit_template_scope
52054 }
52055 else
52056 {
52057 /* Synthesize implicit template parameters at the end of the explicit
52058 template parameter list. */
52065 parser->implicit_template_parms
52067 }
52068 }
52070 /* Synthesize a new template parameter and track the current template
52071 parameter chain with implicit_template_parms. */
52077 /* Synthesize the type template parameter. */
52085 /* Attach the constraint to the parm before processing. */
52088 tree new_parm
52090 input_location,
52091 node,
52094 // Process_template_parm returns the list of parms, and
52095 // parser->implicit_template_parms holds the final node of the parm
52096 // list. We really want to manipulate the newly appended element.
52103 // Record the last implicit parm node
52106 /* Mark the synthetic declaration "virtual". This is used when
52107 comparing template-heads to determine if whether an abbreviated
52108 function template is equivalent to an explicit template.
52110 Note that DECL_ARTIFICIAL is used elsewhere for template
52111 parameters. */
52117 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
52120 /* If creating a fully implicit function template, start the new implicit
52121 template parameter list with this synthesized type, otherwise grow the
52122 current template parameter list. */
52125 {
52131 }
52132 else
52133 {
52138 }
52140 /* If the new parameter was constrained, we need to add that to the
52141 constraints in the template parameter list. */
52143 {
52147 }
52152 }
52154 /* Finish the declaration of a fully implicit function template. Such a
52155 template has no explicit template parameter list so has not been through the
52156 normal template head and tail processing. synthesize_implicit_template_parm
52157 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
52158 provided if the declaration is a class member such that its template
52159 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
52160 form is returned. Otherwise NULL_TREE is returned. */
52162 static tree
52164 {
52169 {
52173 }
52185 }
52187 /* Like finish_fully_implicit_template, but to be used in error
52188 recovery, rearranging scopes so that we restore the state we had
52189 before synthesize_implicit_template_parm inserted the implement
52190 template parms scope. */
52192 static void
52194 {
52199 {
52208 }
52209 else
52215 }
52217 /* Helper function for diagnostics that have complained about things
52218 being used with 'extern "C"' linkage.
52220 Attempt to issue a note showing where the 'extern "C"' linkage began. */
52222 void
52224 {
52228 }