| blob | 046c48d5552b3619b29865aa2750df1f0a1b42b0 |
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;
593 parser->type_definition_forbidden_message_arg
609 }
611 DEBUG_FUNCTION void
613 {
615 }
617 DEBUG_FUNCTION void
619 {
622 else
624 }
626 /* Allocate memory for a new lexer object and return it. */
630 {
631 /* Allocate the memory. */
634 /* Initially we are not debugging. */
639 /* Create the buffer. */
643 }
645 /* Return TRUE if token is the start of a module declaration that will be
646 terminated by a CPP_PRAGMA_EOL token. */
649 {
653 }
655 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
656 PRAGMA_NONE. */
658 static enum pragma_kind
660 {
663 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
665 }
667 /* Handle early pragmas such as #pragma GCC diagnostic, which needs to be done
668 during preprocessing for the case of preprocessing-related diagnostics. This
669 is called immediately after pushing the CPP_PRAGMA_EOL token onto
670 lexer->buffer. */
672 static void
674 {
678 /* Back up to the start of the pragma so pragma_lex () can parse it when
679 c-pragma lib asks it to. */
683 {
688 }
694 /* Dispatch it. */
695 const unsigned int id
700 /* Reset to normal state. */
702 }
704 /* The parser. */
708 /* Create a new main C++ lexer, the lexer that gets tokens from the
709 preprocessor, and also create the main parser. */
713 {
714 cp_token token;
716 /* It's possible that parsing the first pragma will load a PCH file,
717 which is a GC collection point. So we have to do that before
718 allocating any memory. */
724 /* Put the first token in the buffer. */
731 /* Create the parser now, so we can use it to handle early pragmas. */
735 /* Get the remaining tokens from the preprocessor. */
737 {
739 /* Process the previous token. */
743 /* Check for early pragmas that need to be handled now. */
749 }
757 {
758 /* Set the EOF token's location to be the just after the previous
759 token's range. That way 'at-eof' diagnostics point at something
760 meaninful. */
764 }
769 /* Subsequent preprocessor diagnostics should use compiler
770 diagnostic functions to get the compiler source location. */
775 /* If we processed any #pragma GCC target directives, we handled them early so
776 any macros they defined would be effective during preprocessing. Now, we
777 need to reset to the default state to begin compilation, and we will
778 process them again at the correct time as needed. */
783 }
785 /* Create a lexer and parser to be used during preprocess-only mode.
786 This will be filled with tokens to parse when needed by pragma_lex (). */
787 void
789 {
792 }
794 /* Create a new lexer whose token stream is primed with the tokens in
795 CACHE. When these tokens are exhausted, no new tokens will be read. */
799 {
804 /* We do not own the buffer. */
807 /* Insert an EOF token. */
818 /* Initially we are not debugging. */
824 }
826 /* Frees all resources associated with LEXER. */
828 static void
830 {
833 else
834 {
835 /* Restore the token we overwrite with EOF. */
838 }
841 }
843 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
844 be used. The point of this flag is to help the compiler to fold away calls
845 to cp_lexer_debugging_p within this source file at compile time, when the
846 lexer is not being debugged. */
848 #define LEXER_DEBUGGING_ENABLED_P false
850 /* Returns nonzero if debugging information should be output. */
854 {
859 }
864 {
866 }
870 {
872 }
876 {
878 }
882 {
884 }
888 {
891 /* Skip past purged tokens. */
893 {
895 tp--;
896 }
899 }
901 /* Same as above, but return NULL when the lexer doesn't own the token
902 buffer or if the next_token is at the start of the token
903 vector or if all previous tokens are purged. */
907 {
910 {
913 /* Skip past purged tokens. */
915 {
918 tp--;
919 }
921 }
924 }
926 /* Overload for make_location, taking the lexer to mean the location of the
927 previous token. */
931 {
934 }
936 /* Overload for make_location taking tokens instead of locations. */
940 {
942 }
944 /* nonzero if we are presently saving tokens. */
948 {
950 }
952 /* Store the next token from the preprocessor in *TOKEN. Return true
953 if we reach EOF. If LEXER is NULL, assume we are handling an
954 initial #pragma pch_preprocess, and thus want the lexer to return
955 processed strings.
957 Diagnostics issued from this function must have their controlling option (if
958 any) in c.opt annotated as a libcpp option via the CppReason property. */
960 static void
962 {
965 /* Get a new token from the preprocessor. */
966 token->type
968 flags);
973 /* Usually never see a zero, but just in case ... */
976 /* On some systems, some header files are surrounded by an
977 implicit extern "C" block. Set a flag in the token if it
978 comes from such a header. */
983 /* Check to see if this token is a keyword. */
985 {
987 {
988 /* Mark this token as a keyword. */
990 /* Record which keyword. */
992 }
993 else
994 {
998 /* These are outside the CXX11 range. */
1002 {
1003 /* Warn about the C++11 keyword (but still treat it as
1004 an identifier). */
1009 /* Clear out the C_RID_CODE so we don't warn about this
1010 particular identifier-turned-keyword again. */
1012 }
1016 {
1017 /* Warn about the C++20 keyword (but still treat it as
1018 an identifier). */
1023 /* Clear out the C_RID_CODE so we don't warn about this
1024 particular identifier-turned-keyword again. */
1026 }
1029 }
1030 }
1032 {
1033 /* This only happens in Objective-C++; it must be a keyword. */
1036 {
1037 /* Replace 'class' with '@class', 'private' with '@private',
1038 etc. This prevents confusion with the C++ keyword
1039 'class', and makes the tokens consistent with other
1040 Objective-C 'AT' keywords. For example '@class' is
1041 reported as RID_AT_CLASS which is consistent with
1042 '@synchronized', which is reported as
1043 RID_AT_SYNCHRONIZED.
1044 */
1054 }
1055 }
1056 }
1058 /* Update the globals input_location and the input file stack from TOKEN. */
1061 {
1063 }
1065 /* Update the globals input_location and the input file stack from LEXER. */
1068 {
1071 }
1073 /* Return a pointer to the next token in the token stream, but do not
1074 consume it. */
1078 {
1080 {
1084 }
1086 }
1088 /* Return true if the next token has the indicated TYPE. */
1092 {
1094 }
1096 /* Return true if the next token does not have the indicated TYPE. */
1100 {
1102 }
1104 /* Return true if the next token is the indicated KEYWORD. */
1108 {
1110 }
1114 {
1116 }
1120 {
1122 }
1124 /* Return true if KEYWORD can start a decl-specifier. */
1126 bool
1128 {
1130 {
1131 /* auto specifier: storage-class-specifier in C++,
1132 simple-type-specifier in C++0x. */
1134 /* Storage classes. */
1140 /* Elaborated type specifiers. */
1146 /* Simple type specifiers. */
1160 CASE_RID_FLOATN_NX:
1162 /* CV qualifiers. */
1165 /* Function specifiers. */
1168 /* friend/typdef/inline specifiers. */
1172 /* GNU extensions. */
1174 /* C++11 extensions. */
1177 /* C++20 extensions. */
1188 }
1189 }
1191 /* Peeks the corresponding built-in trait if the first token is
1192 a built-in trait and the second token is either `(' or `<' depending
1193 on the trait. Otherwise, returns nullptr. */
1197 {
1200 {
1204 /* Check if the subsequent token is a `<' token to
1205 __type_pack_element or is a `(' token to everything else. */
1213 }
1215 }
1217 /* Similarly, but only if the token is an expression-yielding
1218 built-in trait. */
1222 {
1228 }
1230 /* Similarly, but only if the token is a type-yielding
1231 built-in trait. */
1235 {
1241 }
1243 /* Return true if the next token is a keyword for a decl-specifier. */
1245 static bool
1247 {
1255 }
1257 /* Returns TRUE iff the token T begins a decltype type. */
1259 static bool
1261 {
1264 }
1266 /* Returns TRUE iff the next token begins a decltype type. */
1268 static bool
1270 {
1273 }
1275 /* Called when processing a token with tree_check_value; perform or defer the
1276 associated checks and return the value. */
1278 static tree
1280 {
1281 /* Perform any access checks that were deferred. */
1286 {
1292 }
1293 /* Return the stored value. */
1295 }
1297 /* Return a pointer to the Nth token in the token stream. If N is 1,
1298 then this is precisely equivalent to cp_lexer_peek_token (except
1299 that it is not inline). One would like to disallow that case, but
1300 there is one case (cp_parser_nth_token_starts_template_id) where
1301 the caller passes a variable for N and it might be 1. */
1305 {
1308 /* N is 1-based, not zero-based. */
1318 {
1322 }
1325 {
1328 }
1331 }
1333 /* Return the next token, and advance the lexer's next_token pointer
1334 to point to the next non-purged token. */
1338 {
1341 do
1342 {
1345 }
1350 /* Provide debugging output. */
1352 {
1356 }
1359 }
1361 /* Permanently remove the next token from the token stream, and
1362 advance the next_token pointer to refer to the next non-purged
1363 token. */
1365 static void
1367 {
1376 do
1377 tok++;
1380 }
1382 /* Permanently remove all tokens after TOK, up to, but not
1383 including, the token that will be returned next by
1384 cp_lexer_peek_token. */
1386 static void
1388 {
1394 {
1399 }
1400 }
1402 /* Begin saving tokens. All tokens consumed after this point will be
1403 preserved. */
1405 static void
1407 {
1408 /* Provide debugging output. */
1413 }
1415 /* Commit to the portion of the token stream most recently saved. */
1417 static void
1419 {
1420 /* Provide debugging output. */
1425 }
1427 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1428 to the token stream. Stop saving tokens. */
1430 static void
1432 {
1433 /* Provide debugging output. */
1438 }
1440 /* Determines what saved_token_sentinel does when going out of scope. */
1443 STS_COMMIT,
1444 STS_ROLLBACK,
1445 STS_DONOTHING
1446 };
1448 /* RAII wrapper around the above functions, with sanity checking (the token
1449 stream should be the same at the point of instantiation as it is at the
1450 point of destruction).
1452 Creating a variable saves tokens. MODE determines what happens when the
1453 object is destroyed. STS_COMMIT commits tokens (default),
1454 STS_ROLLBACK rolls-back and STS_DONOTHING does nothing. Calling
1455 rollback() will immediately roll-back tokens and set MODE to
1456 STS_DONOTHING. */
1458 struct saved_token_sentinel
1459 {
1462 saved_token_sentinel_mode mode;
1466 {
1469 }
1471 {
1473 cp_lexer_set_source_position_from_token
1476 }
1478 {
1485 }
1486 };
1488 /* Print a representation of the TOKEN on the STREAM. */
1490 static void
1492 {
1493 /* We don't use cpp_type2name here because the parser defines
1494 a few tokens of its own. */
1496 /* cpplib-defined token types */
1497 #define OP(e, s) #e,
1498 #define TK(e, s) #e,
1499 TTYPE_TABLE
1500 #undef OP
1501 #undef TK
1502 /* C++ parser token types - see "Manifest constants", above. */
1506 };
1508 /* For some tokens, print the associated data. */
1510 {
1512 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1513 For example, `struct' is mapped to an INTEGER_CST. */
1516 /* fall through */
1534 /* If we have a name for the token, print it out. Otherwise, we
1535 simply give the numeric code. */
1538 else
1541 }
1542 }
1544 DEBUG_FUNCTION void
1546 {
1549 }
1551 DEBUG_FUNCTION void
1553 {
1556 else
1558 }
1561 /* Start emitting debugging information. */
1563 static void
1565 {
1572 }
1574 /* Stop emitting debugging information. */
1576 static void
1578 {
1585 }
1587 /* Create a new cp_token_cache, representing a range of tokens. */
1591 {
1596 }
1598 /* Diagnose if #pragma omp declare simd isn't followed immediately
1599 by function declaration or definition. */
1603 {
1605 {
1610 }
1611 }
1613 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1614 and put that into "omp declare simd" attribute. */
1618 {
1620 {
1622 {
1625 }
1627 {
1630 }
1631 }
1632 }
1634 /* Similarly, but for use in declaration parsing functions
1635 which call cp_parser_handle_directive_omp_attributes. */
1639 {
1646 "%<declare %s%> directive not immediately followed by "
1650 }
1652 /* Diagnose if #pragma acc routine isn't followed immediately by function
1653 declaration or definition. */
1657 {
1659 {
1661 "%<#pragma acc routine%> not immediately followed by "
1664 }
1665 }
1666 \f
1667 /* Decl-specifiers. */
1669 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1671 static void
1673 {
1675 }
1677 /* Declarators. */
1679 /* Nothing other than the parser should be creating declarators;
1680 declarators are a semi-syntactic representation of C++ entities.
1681 Other parts of the front end that need to create entities (like
1682 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1696 /* An erroneous declarator. */
1699 /* The obstack on which declarators and related data structures are
1700 allocated. */
1703 /* Alloc BYTES from the declarator memory pool. */
1707 {
1709 }
1711 /* Allocate a declarator of the indicated KIND. Clear fields that are
1712 common to all declarators. */
1716 {
1730 }
1732 /* Make a declarator for a generalized identifier. If
1733 QUALIFYING_SCOPE is non-NULL, the identifier is
1734 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1735 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1736 is, if any. */
1741 {
1744 /* It is valid to write:
1746 class C { void f(); };
1747 typedef C D;
1748 void D::f();
1750 The standard is not clear about whether `typedef const C D' is
1751 legal; as of 2002-09-15 the committee is considering that
1752 question. EDG 3.0 allows that syntax. Therefore, we do as
1753 well. */
1768 }
1770 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1771 of modifiers such as const or volatile to apply to the pointer
1772 type, represented as identifiers. ATTRIBUTES represent the attributes that
1773 appertain to the pointer or reference. */
1775 cp_declarator *
1777 tree attributes)
1778 {
1786 {
1790 }
1791 else
1797 }
1799 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1800 represent the attributes that appertain to the pointer or
1801 reference. */
1803 cp_declarator *
1806 {
1814 {
1818 }
1819 else
1825 }
1827 /* Like make_pointer_declarator -- but for a pointer to a non-static
1828 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1829 appertain to the pointer or reference. */
1831 cp_declarator *
1834 tree attributes)
1835 {
1844 {
1847 }
1848 else
1854 }
1856 /* Make a declarator for the function given by TARGET, with the
1857 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1858 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1859 indicates what exceptions can be thrown. STD_ATTRS contains
1860 attributes that appertain to the function type. */
1862 cp_declarator *
1864 tree parms,
1865 cp_cv_quals cv_qualifiers,
1866 cp_virt_specifiers virt_specifiers,
1867 cp_ref_qualifier ref_qualifier,
1868 tree tx_qualifier,
1869 tree exception_specification,
1870 tree late_return_type,
1871 tree requires_clause,
1872 tree std_attrs,
1873 location_t parens_loc)
1874 {
1889 {
1893 }
1894 else
1900 }
1902 /* Make a declarator for an array of BOUNDS elements, each of which is
1903 defined by ELEMENT. */
1905 cp_declarator *
1907 {
1914 {
1918 }
1919 else
1923 }
1925 /* Determine whether the declarator we've seen so far can be a
1926 parameter pack, when followed by an ellipsis. */
1927 static bool
1929 {
1931 /* We already saw an ellipsis. */
1934 /* Search for a declarator name, or any other declarator that goes
1935 after the point where the ellipsis could appear in a parameter
1936 pack. If we find any of these, then this declarator cannot be
1937 made into a parameter pack. */
1940 {
1942 {
1955 }
1956 }
1959 }
1963 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1964 DECLARATOR and DEFAULT_ARGUMENT. */
1966 cp_parameter_declarator *
1969 tree default_argument,
1970 location_t loc,
1972 {
1980 else
1988 }
1990 /* Returns true iff DECLARATOR is a declaration for a function. */
1992 static bool
1994 {
1996 {
2005 }
2007 }
2009 /* The parser. */
2011 /* Overview
2012 --------
2014 A cp_parser parses the token stream as specified by the C++
2015 grammar. Its job is purely parsing, not semantic analysis. For
2016 example, the parser breaks the token stream into declarators,
2017 expressions, statements, and other similar syntactic constructs.
2018 It does not check that the types of the expressions on either side
2019 of an assignment-statement are compatible, or that a function is
2020 not declared with a parameter of type `void'.
2022 The parser invokes routines elsewhere in the compiler to perform
2023 semantic analysis and to build up the abstract syntax tree for the
2024 code processed.
2026 The parser (and the template instantiation code, which is, in a
2027 way, a close relative of parsing) are the only parts of the
2028 compiler that should be calling push_scope and pop_scope, or
2029 related functions. The parser (and template instantiation code)
2030 keeps track of what scope is presently active; everything else
2031 should simply honor that. (The code that generates static
2032 initializers may also need to set the scope, in order to check
2033 access control correctly when emitting the initializers.)
2035 Methodology
2036 -----------
2038 The parser is of the standard recursive-descent variety. Upcoming
2039 tokens in the token stream are examined in order to determine which
2040 production to use when parsing a non-terminal. Some C++ constructs
2041 require arbitrary look ahead to disambiguate. For example, it is
2042 impossible, in the general case, to tell whether a statement is an
2043 expression or declaration without scanning the entire statement.
2044 Therefore, the parser is capable of "parsing tentatively." When the
2045 parser is not sure what construct comes next, it enters this mode.
2046 Then, while we attempt to parse the construct, the parser queues up
2047 error messages, rather than issuing them immediately, and saves the
2048 tokens it consumes. If the construct is parsed successfully, the
2049 parser "commits", i.e., it issues any queued error messages and
2050 the tokens that were being preserved are permanently discarded.
2051 If, however, the construct is not parsed successfully, the parser
2052 rolls back its state completely so that it can resume parsing using
2053 a different alternative.
2055 Future Improvements
2056 -------------------
2058 The performance of the parser could probably be improved substantially.
2059 We could often eliminate the need to parse tentatively by looking ahead
2060 a little bit. In some places, this approach might not entirely eliminate
2061 the need to parse tentatively, but it might still speed up the average
2062 case. */
2064 /* Flags that are passed to some parsing functions. These values can
2065 be bitwise-ored together. */
2067 enum
2068 {
2069 /* No flags. */
2071 /* The construct is optional. If it is not present, then no error
2072 should be issued. */
2074 /* When parsing a type-specifier, treat user-defined type-names
2075 as non-type identifiers. */
2077 /* When parsing a type-specifier, do not try to parse a class-specifier
2078 or enum-specifier. */
2080 /* When parsing a decl-specifier-seq, only allow type-specifier or
2081 constexpr. */
2083 /* When parsing a decl-specifier-seq, only allow mutable, constexpr or
2084 for C++20 consteval or for C++23 static. */
2086 /* When parsing a decl-specifier-seq, allow missing typename. */
2088 /* When parsing of the noexcept-specifier should be delayed. */
2090 /* When parsing a consteval declarator. */
2092 };
2094 /* This type is used for parameters and variables which hold
2095 combinations of the above flags. */
2098 /* The different kinds of declarators we want to parse. */
2100 enum cp_parser_declarator_kind
2101 {
2102 /* We want an abstract declarator. */
2103 CP_PARSER_DECLARATOR_ABSTRACT,
2104 /* We want a named declarator. */
2105 CP_PARSER_DECLARATOR_NAMED,
2106 /* We don't mind, but the name must be an unqualified-id. */
2107 CP_PARSER_DECLARATOR_EITHER
2108 };
2110 /* The precedence values used to parse binary expressions. The minimum value
2111 of PREC must be 1, because zero is reserved to quickly discriminate
2112 binary operators from other tokens. */
2114 enum cp_parser_prec
2115 {
2116 PREC_NOT_OPERATOR,
2117 PREC_LOGICAL_OR_EXPRESSION,
2118 PREC_LOGICAL_AND_EXPRESSION,
2119 PREC_INCLUSIVE_OR_EXPRESSION,
2120 PREC_EXCLUSIVE_OR_EXPRESSION,
2121 PREC_AND_EXPRESSION,
2122 PREC_EQUALITY_EXPRESSION,
2123 PREC_RELATIONAL_EXPRESSION,
2124 PREC_SPACESHIP_EXPRESSION,
2125 PREC_SHIFT_EXPRESSION,
2126 PREC_ADDITIVE_EXPRESSION,
2127 PREC_MULTIPLICATIVE_EXPRESSION,
2128 PREC_PM_EXPRESSION,
2129 NUM_PREC_VALUES = PREC_PM_EXPRESSION
2130 };
2132 /* A mapping from a token type to a corresponding tree node type, with a
2133 precedence value. */
2135 struct cp_parser_binary_operations_map_node
2136 {
2137 /* The token type. */
2139 /* The corresponding tree code. */
2141 /* The precedence of this operator. */
2143 };
2145 struct cp_parser_expression_stack_entry
2146 {
2147 /* Left hand side of the binary operation we are currently
2148 parsing. */
2149 cp_expr lhs;
2150 /* Original tree code for left hand side, if it was a binary
2151 expression itself (used for -Wparentheses). */
2153 /* Tree code for the binary operation we are parsing. */
2155 /* Precedence of the binary operation we are parsing. */
2157 /* Location of the binary operation we are parsing. */
2158 location_t loc;
2159 /* Flags from the operator token. */
2161 };
2163 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
2164 entries because precedence levels on the stack are monotonically
2165 increasing. */
2169 /* Used for parsing OMP for loops.
2171 Some notes on flags used for context:
2172 parser->omp_for_parse_state is non-null anywhere inside the OMP FOR
2173 construct, except for the final-loop-body.
2174 The want_nested_loop flag is true if inside a {} sequence where
2175 a loop-nest (or another {} sequence containing a loop-nest) is expected,
2176 but has not yet been seen. It's false when parsing intervening code
2177 statements or their substatements that cannot contain a loop-nest.
2178 The in_intervening_code flag is true when parsing any intervening code,
2179 including substatements, and whether or not want_nested_loop is true.
2181 And, about error handling:
2182 The saw_intervening_code flag is set if the loop is not perfectly
2183 nested, even in the usual case where this is not an error.
2184 perfect_nesting_fail is set if an error has been diagnosed because an
2185 imperfectly-nested loop was found where a perfectly-nested one is
2186 required (we diagnose this only once).
2187 fail is set if any kind of structural error in the loop nest
2188 has been found and diagnosed.
2189 */
2193 tree pre_body;
2194 tree orig_declv;
2198 location_t for_loc;
2199 releasing_vec init_blockv;
2200 releasing_vec body_blockv;
2201 releasing_vec init_placeholderv;
2202 releasing_vec body_placeholderv;
2210 tree clauses;
2212 tree ordered_cl;
2213 };
2215 /* Prototypes. */
2217 /* Constructors and destructors. */
2222 /* Class variables. */
2226 /* The operator-precedence table used by cp_parser_binary_expression.
2227 Transformed into an associative array (binops_by_token) by
2228 cp_parser_new. */
2263 };
2265 /* The same as binops, but initialized by cp_parser_new so that
2266 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
2267 for speed. */
2270 /* Constructors and destructors. */
2272 /* Construct a new context. The context below this one on the stack
2273 is given by NEXT. */
2277 {
2280 /* Allocate the storage. */
2282 {
2283 /* Pull the first entry from the free list. */
2287 }
2288 else
2291 /* No errors have occurred yet in this context. */
2293 /* If this is not the bottommost context, copy information that we
2294 need from the previous context. */
2296 {
2297 /* If, in the NEXT context, we are parsing an `x->' or `x.'
2298 expression, then we are parsing one in this context, too. */
2300 /* Thread the stack. */
2302 }
2305 }
2307 /* Managing the unparsed function queues. */
2309 #define unparsed_funs_with_default_args \
2310 parser->unparsed_queues->last ().funs_with_default_args
2311 #define unparsed_funs_with_definitions \
2312 parser->unparsed_queues->last ().funs_with_definitions
2313 #define unparsed_nsdmis \
2314 parser->unparsed_queues->last ().nsdmis
2315 #define unparsed_noexcepts \
2316 parser->unparsed_queues->last ().noexcepts
2317 #define unparsed_contracts \
2318 parser->unparsed_queues->last ().contracts
2320 static void
2322 {
2323 cp_unparsed_functions_entry e
2326 }
2328 static void
2330 {
2333 }
2335 /* Prototypes. */
2337 /* Routines to parse various constructs.
2339 Those that return `tree' will return the error_mark_node (rather
2340 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2341 Sometimes, they will return an ordinary node if error-recovery was
2342 attempted, even though a parse error occurred. So, to check
2343 whether or not a parse error occurred, you should always use
2344 cp_parser_error_occurred. If the construct is optional (indicated
2345 either by an `_opt' in the name of the function that does the
2346 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2347 the construct is not present. */
2349 /* Lexical conventions [gram.lex] */
2351 static tree finish_userdef_string_literal
2354 /* Basic concepts [gram.basic] */
2358 /* Expressions [gram.expr] */
2360 static cp_expr cp_parser_primary_expression
2362 static cp_expr cp_parser_id_expression
2364 static cp_expr cp_parser_unqualified_id
2366 static tree cp_parser_nested_name_specifier_opt
2368 static tree cp_parser_nested_name_specifier
2370 static tree cp_parser_qualifying_entity
2372 static cp_expr cp_parser_postfix_expression
2374 static tree cp_parser_postfix_open_square_expression
2376 static tree cp_parser_postfix_dot_deref_expression
2381 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2384 static void cp_parser_pseudo_destructor_name
2386 static cp_expr cp_parser_unary_expression
2388 static enum tree_code cp_parser_unary_operator
2390 static tree cp_parser_has_attribute_expression
2392 static tree cp_parser_new_expression
2396 static tree cp_parser_new_type_id
2404 static tree cp_parser_delete_expression
2406 static cp_expr cp_parser_cast_expression
2408 static cp_expr cp_parser_binary_expression
2410 static tree cp_parser_question_colon_clause
2413 static cp_expr cp_parser_assignment_expression
2415 static enum tree_code cp_parser_assignment_operator_opt
2417 static cp_expr cp_parser_expression
2419 static cp_expr cp_parser_constant_expression
2421 static cp_expr cp_parser_builtin_offsetof
2423 static cp_expr cp_parser_lambda_expression
2425 static void cp_parser_lambda_introducer
2427 static bool cp_parser_lambda_declarator_opt
2429 static void cp_parser_lambda_body
2432 /* Statements [gram.stmt.stmt] */
2434 static void cp_parser_statement
2436 static void cp_parser_label_for_labeled_statement
2438 static tree cp_parser_expression_statement
2440 static tree cp_parser_compound_statement
2442 static void cp_parser_statement_seq_opt
2444 static tree cp_parser_selection_statement
2446 static tree cp_parser_condition
2448 static tree cp_parser_iteration_statement
2450 static bool cp_parser_init_statement
2452 static tree cp_parser_for
2454 static tree cp_parser_c_for
2456 static tree cp_parser_range_for
2458 static void do_range_for_auto_deduction
2460 static tree cp_parser_perform_range_for_lookup
2462 static tree cp_parser_range_for_member_function
2464 static tree cp_parser_jump_statement
2466 static void cp_parser_declaration_statement
2469 static tree cp_parser_implicitly_scoped_statement
2471 static void cp_parser_already_scoped_statement
2474 /* State of module-declaration parsing. */
2475 enum module_parse
2476 {
2479 _MP_UNUSED,
2489 };
2491 static module_parse cp_parser_module_declaration
2493 static void cp_parser_import_declaration
2496 /* Declarations [gram.dcl.dcl] */
2498 static void cp_parser_declaration_seq_opt
2500 static void cp_parser_declaration
2502 static void cp_parser_toplevel_declaration
2504 static void cp_parser_block_declaration
2506 static void cp_parser_simple_declaration
2508 static void cp_parser_decl_specifier_seq
2510 static tree cp_parser_storage_class_specifier_opt
2512 static tree cp_parser_function_specifier_opt
2514 static tree cp_parser_type_specifier
2517 static tree cp_parser_simple_type_specifier
2519 static tree cp_parser_placeholder_type_specifier
2521 static tree cp_parser_type_name
2523 static tree cp_parser_nonclass_name
2525 static tree cp_parser_elaborated_type_specifier
2527 static tree cp_parser_enum_specifier
2529 static void cp_parser_enumerator_list
2531 static void cp_parser_enumerator_definition
2533 static tree cp_parser_namespace_name
2535 static void cp_parser_namespace_definition
2537 static void cp_parser_namespace_body
2539 static tree cp_parser_qualified_namespace_specifier
2541 static void cp_parser_namespace_alias_definition
2543 static bool cp_parser_using_declaration
2545 static void cp_parser_using_directive
2547 static void cp_parser_using_enum
2549 static tree cp_parser_alias_declaration
2551 static void cp_parser_asm_definition
2553 static void cp_parser_linkage_specification
2555 static void cp_parser_static_assert
2557 static tree cp_parser_decltype
2559 static tree cp_parser_decomposition_declaration
2562 /* Declarators [gram.dcl.decl] */
2564 static tree cp_parser_init_declarator
2574 static enum tree_code cp_parser_ptr_operator
2576 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2578 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2580 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2582 static tree cp_parser_tx_qualifier_opt
2584 static tree cp_parser_late_return_type_opt
2586 static tree cp_parser_declarator_id
2588 static tree cp_parser_type_id
2590 static tree cp_parser_template_type_arg
2593 static tree cp_parser_type_id_1
2595 static void cp_parser_type_specifier_seq
2597 static tree cp_parser_parameter_declaration_clause
2599 static tree cp_parser_parameter_declaration_list
2603 static tree cp_parser_default_argument
2605 static void cp_parser_function_body
2607 static tree cp_parser_initializer
2609 static cp_expr cp_parser_initializer_clause
2611 static cp_expr cp_parser_braced_list
2616 static void cp_parser_ctor_initializer_opt_and_function_body
2619 static tree cp_parser_late_parsing_omp_declare_simd
2622 static tree cp_parser_late_parsing_oacc_routine
2625 static tree synthesize_implicit_template_parm
2627 static tree finish_fully_implicit_template
2629 static void abort_fully_implicit_template
2632 /* Classes [gram.class] */
2634 static tree cp_parser_class_name
2636 static tree cp_parser_class_specifier
2638 static tree cp_parser_class_head
2640 static enum tag_types cp_parser_class_key
2642 static void cp_parser_type_parameter_key
2644 static void cp_parser_member_specification_opt
2646 static void cp_parser_member_declaration
2648 static tree cp_parser_pure_specifier
2650 static tree cp_parser_constant_initializer
2653 /* Derived classes [gram.class.derived] */
2655 static tree cp_parser_base_clause
2657 static tree cp_parser_base_specifier
2660 /* Special member functions [gram.special] */
2662 static tree cp_parser_conversion_function_id
2664 static tree cp_parser_conversion_type_id
2668 static void cp_parser_ctor_initializer_opt
2670 static void cp_parser_mem_initializer_list
2672 static tree cp_parser_mem_initializer
2674 static tree cp_parser_mem_initializer_id
2677 /* Overloading [gram.over] */
2679 static cp_expr cp_parser_operator_function_id
2681 static cp_expr cp_parser_operator
2684 /* Templates [gram.temp] */
2686 static void cp_parser_template_declaration
2688 static tree cp_parser_template_parameter_list
2690 static tree cp_parser_template_parameter
2692 static tree cp_parser_type_parameter
2694 static tree cp_parser_template_id
2696 static tree cp_parser_template_id_expr
2698 static tree cp_parser_template_name
2700 static tree cp_parser_template_argument_list
2702 static tree cp_parser_template_argument
2704 static void cp_parser_explicit_instantiation
2706 static void cp_parser_explicit_specialization
2709 /* Exception handling [gram.except] */
2711 static tree cp_parser_try_block
2713 static void cp_parser_function_try_block
2715 static void cp_parser_handler_seq
2717 static void cp_parser_handler
2719 static tree cp_parser_exception_declaration
2721 static tree cp_parser_throw_expression
2723 static tree cp_parser_exception_specification_opt
2725 static tree cp_parser_type_id_list
2727 static tree cp_parser_noexcept_specification_opt
2730 /* GNU Extensions */
2732 static tree cp_parser_asm_specification_opt
2734 static tree cp_parser_asm_operand_list
2736 static tree cp_parser_asm_clobber_list
2738 static tree cp_parser_asm_label_list
2740 static bool cp_next_tokens_can_be_attribute_p
2742 static bool cp_next_tokens_can_be_gnu_attribute_p
2744 static bool cp_next_tokens_can_be_std_attribute_p
2746 static bool cp_nth_tokens_can_be_std_attribute_p
2748 static bool cp_nth_tokens_can_be_gnu_attribute_p
2750 static bool cp_nth_tokens_can_be_attribute_p
2752 static tree cp_parser_attributes_opt
2754 static tree cp_parser_gnu_attributes_opt
2756 static tree cp_parser_gnu_attribute_list
2758 static tree cp_parser_std_attribute
2760 static tree cp_parser_std_attribute_spec
2762 static tree cp_parser_std_attribute_spec_seq
2764 static size_t cp_parser_skip_std_attribute_spec_seq
2766 static size_t cp_parser_skip_attributes_opt
2768 static bool cp_parser_extension_opt
2770 static void cp_parser_label_declaration
2773 /* Concept Extensions */
2775 static tree cp_parser_concept_definition
2777 static tree cp_parser_constraint_expression
2779 static tree cp_parser_requires_clause_opt
2781 static tree cp_parser_requires_expression
2783 static tree cp_parser_requirement_parameter_list
2785 static tree cp_parser_requirement_body
2787 static tree cp_parser_requirement_seq
2789 static tree cp_parser_requirement
2791 static tree cp_parser_simple_requirement
2793 static tree cp_parser_compound_requirement
2795 static tree cp_parser_type_requirement
2797 static tree cp_parser_nested_requirement
2800 /* Transactional Memory Extensions */
2802 static tree cp_parser_transaction
2804 static tree cp_parser_transaction_expression
2806 static void cp_parser_function_transaction
2808 static tree cp_parser_transaction_cancel
2811 /* Coroutine extensions. */
2813 static tree cp_parser_yield_expression
2816 /* Contracts */
2818 static void cp_parser_late_contract_condition
2822 pragma_external,
2823 pragma_member,
2824 pragma_objc_icode,
2825 pragma_stmt,
2826 pragma_compound
2827 };
2828 static bool cp_parser_pragma
2831 /* Objective-C++ Productions */
2833 static tree cp_parser_objc_message_receiver
2835 static tree cp_parser_objc_message_args
2837 static tree cp_parser_objc_message_expression
2839 static cp_expr cp_parser_objc_encode_expression
2841 static tree cp_parser_objc_defs_expression
2843 static tree cp_parser_objc_protocol_expression
2845 static tree cp_parser_objc_selector_expression
2847 static cp_expr cp_parser_objc_expression
2849 static bool cp_parser_objc_selector_p
2851 static tree cp_parser_objc_selector
2853 static tree cp_parser_objc_protocol_refs_opt
2855 static void cp_parser_objc_declaration
2857 static tree cp_parser_objc_statement
2859 static bool cp_parser_objc_valid_prefix_attributes
2861 static void cp_parser_objc_at_property_declaration
2863 static void cp_parser_objc_at_synthesize_declaration
2865 static void cp_parser_objc_at_dynamic_declaration
2867 static tree cp_parser_objc_struct_declaration
2870 /* Utility Routines */
2872 static cp_expr cp_parser_lookup_name
2874 static tree cp_parser_lookup_name_simple
2876 static tree cp_parser_maybe_treat_template_as_class
2878 static bool cp_parser_check_declarator_template_parameters
2880 static bool cp_parser_check_template_parameters
2882 static cp_expr cp_parser_simple_cast_expression
2884 static tree cp_parser_global_scope_opt
2886 static bool cp_parser_constructor_declarator_p
2888 static tree cp_parser_function_definition_from_specifiers_and_declarator
2890 static tree cp_parser_function_definition_after_declarator
2892 static bool cp_parser_template_declaration_after_export
2894 static void cp_parser_perform_template_parameter_access_checks
2896 static tree cp_parser_single_declaration
2898 static cp_expr cp_parser_functional_cast
2900 static tree cp_parser_save_member_function_body
2902 static tree cp_parser_save_nsdmi
2904 static tree cp_parser_enclosed_template_argument_list
2906 static void cp_parser_save_default_args
2908 static void cp_parser_late_parsing_for_member
2910 static tree cp_parser_late_parse_one_default_arg
2912 static void cp_parser_late_parsing_nsdmi
2914 static void cp_parser_late_parsing_default_args
2916 static tree cp_parser_sizeof_operand
2918 static cp_expr cp_parser_trait
2920 static bool cp_parser_declares_only_class_p
2922 static void cp_parser_set_storage_class
2924 static void cp_parser_set_decl_spec_type
2926 static void set_and_check_decl_spec_loc
2929 static bool cp_parser_friend_p
2931 static void cp_parser_required_error
2937 static bool cp_parser_token_starts_function_definition_p
2939 static bool cp_parser_next_token_starts_class_definition_p
2941 static bool cp_parser_next_token_ends_template_argument_p
2943 static bool cp_parser_nth_token_starts_template_argument_list_p
2945 static enum tag_types cp_parser_token_is_class_key
2947 static enum tag_types cp_parser_token_is_type_parameter_key
2950 static void cp_parser_check_class_key
2952 static void cp_parser_check_access_in_redeclaration
2954 static bool cp_parser_optional_template_keyword
2956 static void cp_parser_pre_parsed_nested_name_specifier
2958 static bool cp_parser_cache_group
2960 static tree cp_parser_cache_defarg
2962 static void cp_parser_parse_tentatively
2964 static void cp_parser_commit_to_tentative_parse
2966 static void cp_parser_commit_to_topmost_tentative_parse
2968 static void cp_parser_abort_tentative_parse
2970 static bool cp_parser_parse_definitely
2974 static bool cp_parser_uncommitted_to_tentative_parse_p
2976 static void cp_parser_error
2978 static void cp_parser_name_lookup_error
2980 static bool cp_parser_simulate_error
2982 static bool cp_parser_check_type_definition
2984 static void cp_parser_check_for_definition_in_return_type
2986 static void cp_parser_check_for_invalid_template_id
2988 static bool cp_parser_non_integral_constant_expression
2990 static void cp_parser_diagnose_invalid_type_name
2992 static bool cp_parser_parse_and_diagnose_invalid_type_name
2994 static int cp_parser_skip_to_closing_parenthesis
2996 static void cp_parser_skip_to_end_of_statement
2998 static void cp_parser_consume_semicolon_at_end_of_statement
3000 static void cp_parser_skip_to_end_of_block_or_statement
3002 static bool cp_parser_skip_to_closing_brace
3004 static bool cp_parser_skip_entire_template_parameter_list
3006 static void cp_parser_require_end_of_template_parameter_list
3008 static bool cp_parser_skip_to_end_of_template_parameter_list
3010 static void cp_parser_skip_to_pragma_eol
3012 static bool cp_parser_error_occurred
3014 static bool cp_parser_allow_gnu_extensions_p
3016 static bool cp_parser_is_pure_string_literal
3018 static bool cp_parser_is_string_literal
3020 static bool cp_parser_is_keyword
3022 static tree cp_parser_make_typename_type
3026 static bool cp_parser_compound_literal_p
3028 static bool cp_parser_array_designator_p
3030 static bool cp_parser_init_statement_p
3032 static bool cp_parser_skip_up_to_closing_square_bracket
3034 static bool cp_parser_skip_to_closing_square_bracket
3039 // -------------------------------------------------------------------------- //
3040 // Unevaluated Operand Guard
3041 //
3042 // Implementation of an RAII helper for unevaluated operand parsing.
3044 {
3047 }
3050 {
3053 }
3055 // -------------------------------------------------------------------------- //
3056 // Tentative Parsing
3058 /* Returns nonzero if we are parsing tentatively. */
3062 {
3064 }
3066 /* Returns nonzero if TOKEN is a string literal. */
3068 static bool
3070 {
3076 }
3078 /* Returns nonzero if TOKEN is a string literal
3079 of a user-defined string literal. */
3081 static bool
3083 {
3090 }
3092 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
3094 static bool
3096 {
3098 }
3100 /* Helper function for cp_parser_error.
3101 Having peeked a token of kind TOK1_KIND that might signify
3102 a conflict marker, peek successor tokens to determine
3103 if we actually do have a conflict marker.
3104 Specifically, we consider a run of 7 '<', '=' or '>' characters
3105 at the start of a line as a conflict marker.
3106 These come through the lexer as three pairs and a single,
3107 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
3108 If it returns true, *OUT_LOC is written to with the location/range
3109 of the marker. */
3111 static bool
3114 {
3125 /* It must be at the start of the line. */
3130 /* We have a conflict marker. Construct a location of the form:
3131 <<<<<<<
3132 ^~~~~~~
3133 with start == caret, finishing at the end of the marker. */
3138 }
3140 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
3141 RT_CLOSE_PAREN. */
3145 {
3147 {
3155 }
3156 }
3158 /* Attempt to convert TOKEN_DESC from a required_token to an
3159 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
3161 static enum cpp_ttype
3163 {
3165 {
3186 /* Use CPP_EOF as a "no completions possible" code. */
3188 }
3189 }
3192 /* Subroutine of cp_parser_error and cp_parser_required_error.
3194 Issue a diagnostic of the form
3195 FILE:LINE: MESSAGE before TOKEN
3196 where TOKEN is the next token in the input stream. MESSAGE
3197 (specified by the caller) is usually of the form "expected
3198 OTHER-TOKEN".
3200 This bypasses the check for tentative passing, and potentially
3201 adds material needed by cp_parser_required_error.
3203 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
3204 suggesting insertion of the missing token.
3206 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
3207 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
3208 location. */
3210 static void
3212 required_token missing_token_desc,
3213 location_t matching_location)
3214 {
3216 /* This diagnostic makes more sense if it is tagged to the line
3217 of the token we just peeked at. */
3221 {
3226 }
3228 /* If this is actually a conflict marker, report it as such. */
3232 {
3233 location_t loc;
3235 {
3238 /* Consume tokens until the end of the source line. */
3240 {
3254 }
3256 }
3257 }
3259 auto_diagnostic_group d;
3266 {
3267 /* Potentially supply a fix-it hint, suggesting to add the
3268 missing token immediately after the *previous* token.
3269 This may move the primary location within richloc. */
3273 prev_token_loc);
3275 /* If matching_location != UNKNOWN_LOCATION, highlight it.
3276 Attempt to consolidate diagnostics by printing it as a
3277 secondary range within the main diagnostic. */
3279 added_matching_location
3281 }
3283 /* If we were parsing a string-literal and there is an unknown name
3284 token right after, then check to see if that could also have been
3285 a literal string by checking the name against a list of known
3286 standard string literal constants defined in header files. If
3287 there is one, then add that as an hint to the error message. */
3288 name_hint h;
3292 {
3299 token_name,
3300 header_hint));
3301 }
3303 /* Actually emit the error. */
3305 /* Because c_parser_error does not understand
3306 CPP_KEYWORD, keywords are treated like
3307 identifiers. */
3312 {
3313 /* If we weren't able to consolidate matching_location, then
3314 print it as a secondary diagnostic. */
3319 }
3320 }
3322 /* If not parsing tentatively, issue a diagnostic of the form
3323 FILE:LINE: MESSAGE before TOKEN
3324 where TOKEN is the next token in the input stream. MESSAGE
3325 (specified by the caller) is usually of the form "expected
3326 OTHER-TOKEN". */
3328 static void
3330 {
3333 }
3335 /* Issue an error about name-lookup failing. NAME is the
3336 IDENTIFIER_NODE DECL is the result of
3337 the lookup (as returned from cp_parser_lookup_name). DESIRED is
3338 the thing that we hoped to find. */
3340 static void
3342 tree name,
3343 tree decl,
3344 name_lookup_error desired,
3345 location_t location)
3346 {
3347 /* If name lookup completely failed, tell the user that NAME was not
3348 declared. */
3350 {
3363 else
3365 }
3367 {
3369 {
3386 }
3387 }
3389 {
3391 {
3401 name);
3405 }
3406 }
3407 else
3408 {
3410 {
3423 }
3424 }
3425 }
3427 /* If we are parsing tentatively, remember that an error has occurred
3428 during this tentative parse. Returns true if the error was
3429 simulated; false if a message should be issued by the caller. */
3431 static bool
3433 {
3435 {
3438 }
3440 }
3442 /* This function is called when a type is defined. If type
3443 definitions are forbidden at this point, an error message is
3444 issued. */
3446 static bool
3448 {
3449 /* If types are forbidden here, issue a message. */
3451 {
3452 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3453 or %qs in the message need to be interpreted. */
3457 }
3459 }
3461 /* This function is called when the DECLARATOR is processed. The TYPE
3462 was a type defined in the decl-specifiers. If it is invalid to
3463 define a type in the decl-specifiers for DECLARATOR, an error is
3464 issued. TYPE_LOCATION is the location of TYPE and is used
3465 for error reporting. */
3467 static void
3470 {
3471 /* [dcl.fct] forbids type definitions in return types.
3472 Unfortunately, it's not easy to know whether or not we are
3473 processing a return type until after the fact. */
3481 {
3486 type);
3487 }
3488 }
3490 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3491 "<" in any valid C++ program. If the next token is indeed "<",
3492 issue a message warning the user about what appears to be an
3493 invalid attempt to form a template-id. LOCATION is the location
3494 of the type-specifier (TYPE) */
3496 static void
3498 tree type,
3500 location_t location)
3501 {
3505 {
3511 {
3514 else
3516 }
3517 else
3519 /* Remember the location of the invalid "<". */
3522 /* Consume the "<". */
3524 /* Parse the template arguments. */
3526 /* Permanently remove the invalid template arguments so that
3527 this error message is not issued again. */
3530 }
3531 }
3533 /* If parsing an integral constant-expression, issue an error message
3534 about the fact that THING appeared and return true. Otherwise,
3535 return false. In either case, set
3536 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3538 static bool
3540 non_integral_constant thing)
3541 {
3544 {
3546 {
3549 {
3552 "ISO C++ forbids using a floating-point literal "
3557 "enumeration type cannot appear in a "
3648 }
3652 }
3653 }
3655 }
3657 /* Emit a diagnostic for an invalid type name. This function commits
3658 to the current active tentative parse, if any. (Otherwise, the
3659 problematic construct might be encountered again later, resulting
3660 in duplicate error messages.) LOCATION is the location of ID. */
3662 static void
3664 location_t location)
3665 {
3668 /* Try to lookup the identifier. */
3675 /* If the lookup was ambiguous, an error will already have
3676 been issued. */
3678 /* If the lookup found a template-name, it means that the user forgot
3679 to specify an argument list. Emit a useful error message. */
3681 {
3682 auto_diagnostic_group d;
3685 decl);
3690 }
3694 /* Something like 'unsigned A a;' */
3697 {
3698 /* Issue an error message. */
3699 auto_diagnostic_group d;
3700 name_hint hint;
3704 {
3710 }
3711 else
3713 /* If we're in a template class, it's possible that the user was
3714 referring to a type from a base class. For example:
3716 template <typename T> struct A { typedef T X; };
3717 template <typename T> struct B : public A<T> { X x; };
3719 The user should have said "typename A<T>::X". */
3728 {
3731 id);
3734 id);
3735 else
3738 }
3755 {
3758 {
3762 {
3763 /* Go from a particular instantiation of the
3764 template (which will have an empty TYPE_FIELDs),
3765 to the main version. */
3771 {
3776 }
3777 }
3778 }
3779 found:;
3780 }
3781 }
3782 /* Here we diagnose qualified-ids where the scope is actually correct,
3783 but the identifier does not resolve to a valid type name. */
3785 {
3787 {
3788 auto_diagnostic_group d;
3789 name_hint hint;
3798 {
3801 "%qE in namespace %qE does not name a template"
3804 else
3808 }
3810 {
3813 "%qE in namespace %qE does not name a template"
3816 else
3818 "%qE in namespace %qE does not name a template"
3821 }
3822 else
3823 {
3826 "%qE in namespace %qE does not name a type"
3829 else
3833 }
3836 }
3839 {
3840 /* A<T>::A<T>() */
3841 auto_diagnostic_group d;
3847 }
3850 {
3855 "need %<typename%> before %<%T::%D::%E%> because "
3859 id,
3862 else
3866 }
3868 {
3869 auto_diagnostic_group d;
3881 else
3887 }
3888 else
3890 }
3891 }
3893 /* Check for a common situation where a type-name should be present,
3894 but is not, and issue a sensible error message. Returns true if an
3895 invalid type-name was detected.
3897 The situation handled by this function are variable declarations of the
3898 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3899 Usually, `ID' should name a type, but if we got here it means that it
3900 does not. We try to emit the best possible error message depending on
3901 how exactly the id-expression looks like. */
3903 static bool
3905 {
3906 tree id;
3909 /* Avoid duplicate error about ambiguous lookup. */
3911 {
3915 }
3924 /* If the next token is a (, this is a function with no explicit return
3925 type, i.e. constructor, destructor or conversion op. */
3928 {
3931 }
3935 /* Emit a diagnostic for the invalid type. */
3937 out:
3938 /* If we aren't in the middle of a declarator (i.e. in a
3939 parameter-declaration-clause), skip to the end of the declaration;
3940 there's no point in trying to process it. */
3944 }
3946 /* Consume tokens up to, and including, the next non-nested closing `)'.
3947 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3948 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3949 found an unnested token of that type. */
3951 static int
3954 cpp_ttype or_ttype,
3956 {
3967 {
3970 /* Have we found what we're looking for before the closing paren? */
3976 {
3980 /* FALLTHRU */
3982 /* If we've run out of tokens, then there is no closing `)'. */
3985 /* This is good for lambda expression capture-lists. */
3995 /* This matches the processing in skip_to_end_of_statement. */
4015 {
4019 }
4029 condop_depth--;
4035 /* FALLTHROUGH */
4038 /* We fell into a pragma. Skip it, and continue. */
4044 }
4046 /* Consume the token. */
4048 }
4049 }
4051 /* Consume tokens up to, and including, the next non-nested closing `)'.
4052 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
4053 are doing error recovery. Returns -1 if OR_COMMA is true and we
4054 found an unnested token of that type. */
4056 static int
4061 {
4065 }
4067 /* Consume tokens until we reach the end of the current statement.
4068 Normally, that will be just before consuming a `;'. However, if a
4069 non-nested `}' comes first, then we stop before consuming that. */
4071 static void
4073 {
4076 /* Unwind generic function template scope if necessary. */
4081 {
4085 {
4089 /* FALLTHRU */
4091 /* If we've run out of tokens, stop. */
4095 /* If the next token is a `;', we have reached the end of the
4096 statement. */
4102 /* If this is a non-nested '}', stop before consuming it.
4103 That way, when confronted with something like:
4105 { 3 + }
4107 we stop before consuming the closing '}', even though we
4108 have not yet reached a `;'. */
4112 /* If it is the closing '}' for a block that we have
4113 scanned, stop -- but only after consuming the token.
4114 That way given:
4116 void f g () { ... }
4117 typedef int I;
4119 we will stop after the body of the erroneously declared
4120 function, but before consuming the following `typedef'
4121 declaration. */
4123 {
4126 }
4136 /* FALLTHROUGH */
4139 /* We fell into a pragma. Skip it, and continue or return. */
4147 }
4149 /* Consume the token. */
4151 }
4152 }
4154 /* This function is called at the end of a statement or declaration.
4155 If the next token is a semicolon, it is consumed; otherwise, error
4156 recovery is attempted. */
4158 static void
4160 {
4161 /* Look for the trailing `;'. */
4163 {
4164 /* If there is additional (erroneous) input, skip to the end of
4165 the statement. */
4167 /* If the next token is now a `;', consume it. */
4170 }
4171 }
4173 /* Skip tokens until we have consumed an entire block, or until we
4174 have consumed a non-nested `;'. */
4176 static void
4178 {
4181 /* Unwind generic function template scope if necessary. */
4186 {
4190 {
4194 /* FALLTHRU */
4196 /* If we've run out of tokens, stop. */
4200 /* Stop if this is an unnested ';'. */
4206 /* Stop if this is an unnested '}', or closes the outermost
4207 nesting level. */
4208 nesting_depth--;
4216 /* Nest. */
4217 nesting_depth++;
4223 /* FALLTHROUGH */
4226 /* Skip it, and continue or return. */
4234 }
4236 /* Consume the token. */
4238 }
4239 }
4241 /* Skip tokens until a non-nested closing curly brace is the next
4242 token, or there are no more tokens. Return true in the first case,
4243 false otherwise. */
4245 static bool
4247 {
4251 {
4255 {
4259 /* FALLTHRU */
4261 /* If we've run out of tokens, stop. */
4265 /* If the next token is a non-nested `}', then we have reached
4266 the end of the current block. */
4272 /* If it the next token is a `{', then we are entering a new
4273 block. Consume the entire block. */
4279 }
4281 /* Consume the token. */
4283 }
4284 }
4286 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
4287 parameter is the PRAGMA token, allowing us to purge the entire pragma
4288 sequence. PRAGMA_TOK can be NULL, if we're speculatively scanning
4289 forwards (not error recovery). */
4291 static void
4293 {
4296 do
4297 {
4298 /* The preprocessor makes sure that a PRAGMA_EOL token appears
4299 before an EOF token, even when the EOF is on the pragma line.
4300 We should never get here without being inside a deferred
4301 pragma. */
4304 }
4308 {
4312 {
4314 /* Put the current source position back where it was before this
4315 lexer was pushed. */
4317 }
4318 }
4319 }
4321 /* Require pragma end of line, resyncing with it as necessary. The
4322 arguments are as for cp_parser_skip_to_pragma_eol. */
4324 static void
4326 {
4332 {
4334 /* Put the current source position back where it was before this
4335 lexer was pushed. */
4337 }
4338 }
4340 /* This is a simple wrapper around make_typename_type. When the id is
4341 an unresolved identifier node, we can provide a superior diagnostic
4342 using cp_parser_diagnose_invalid_type_name. */
4344 static tree
4346 location_t id_location)
4347 {
4348 tree result;
4350 {
4356 }
4358 }
4360 /* This is a wrapper around the
4361 make_{pointer,ptrmem,reference}_declarator functions that decides
4362 which one to call based on the CODE and CLASS_TYPE arguments. The
4363 CODE argument should be one of the values returned by
4364 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
4365 appertain to the pointer or reference. */
4369 cp_cv_quals cv_qualifiers,
4371 tree attributes)
4372 {
4379 else
4389 }
4391 /* Create a new C++ parser. */
4395 {
4396 /* Initialize the binops_by_token so that we can get the tree
4397 directly from the token. */
4405 /* For now, we always accept GNU extensions. */
4408 /* The `>' token is a greater-than operator, not the end of a
4409 template-id. */
4414 /* We are not parsing a constant-expression. */
4419 /* Local variable names are not forbidden. */
4422 /* We are not processing an `extern "C"' declaration. */
4425 /* We are not processing a declarator. */
4428 /* We are not processing a template-argument-list. */
4431 /* We are not in an iteration statement. */
4434 /* We are not in a switch statement. */
4437 /* We are not parsing a type-id inside an expression. */
4440 /* String literals should be translated to the execution character set. */
4443 /* We are not parsing a function body. */
4446 /* We can correct until told otherwise. */
4449 /* The unparsed function queue is empty. */
4452 /* There are no classes being defined. */
4455 /* No template parameters apply. */
4458 /* Special parsing data structures. */
4462 /* Disallow OpenMP array sections in expressions. */
4465 /* Not declaring an implicit function template. */
4471 /* Allow constrained-type-specifiers. */
4474 /* We haven't yet seen an 'extern "C"'. */
4478 }
4480 /* Create a cp_lexer structure which will emit the tokens in CACHE
4481 and push it onto the parser's lexer stack. This is used for delayed
4482 parsing of in-class method bodies and default arguments, and should
4483 not be confused with tentative parsing. */
4484 static void
4486 {
4491 /* Move the current source position to that of the first token in the
4492 new lexer. */
4494 }
4496 /* Pop the top lexer off the parser stack. This is never used for the
4497 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4498 static void
4500 {
4505 /* Put the current source position back where it was before this
4506 lexer was pushed. */
4508 }
4510 /* Lexical conventions [gram.lex] */
4512 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4513 identifier. */
4515 static cp_expr
4517 {
4520 /* Look for the identifier. */
4522 /* Return the value. */
4525 else
4527 }
4529 /* Worker for cp_parser_string_literal, cp_parser_userdef_string_literal
4530 and cp_parser_unevaluated_string_literal.
4531 Do not call this directly; use either of the above.
4533 Parse a sequence of adjacent string constants. Return a
4534 TREE_STRING representing the combined, nul-terminated string
4535 constant. If TRANSLATE is true, translate the string to the
4536 execution character set. If WIDE_OK is true, a wide string is
4537 valid here. If UDL_OK is true, a string literal with user-defined
4538 suffix can be used in this context. If UNEVAL is true, diagnose
4539 numeric and conditional escape sequences in it if pedantic.
4541 C++98 [lex.string] says that if a narrow string literal token is
4542 adjacent to a wide string literal token, the behavior is undefined.
4543 However, C99 6.4.5p4 says that this results in a wide string literal.
4544 We follow C99 here, for consistency with the C front end.
4546 This code is largely lifted from lex_string() in c-lex.cc.
4548 FUTURE: ObjC++ will need to handle @-strings here. */
4550 static cp_expr
4554 {
4555 tree value;
4563 tree string_tree;
4569 {
4572 }
4577 {
4579 {
4583 }
4587 }
4588 else
4589 {
4592 }
4595 /* Try to avoid the overhead of creating and destroying an obstack
4596 for the common case of just one string. */
4599 {
4607 {
4611 }
4612 else
4616 }
4617 else
4618 {
4624 do
4625 {
4627 count++;
4632 {
4635 {
4638 }
4641 {
4646 }
4648 }
4649 else
4653 {
4657 {
4661 "concatenation of string literals with "
4663 }
4664 }
4673 {
4675 {
4679 }
4683 }
4684 else
4685 {
4689 }
4690 }
4693 /* A string literal built by concatenation has its caret=start at
4694 the start of the initial string, and its finish at the finish of
4695 the final string literal. */
4699 }
4702 {
4705 }
4711 {
4715 {
4719 }
4722 {
4730 else
4742 }
4747 {
4752 else
4754 }
4755 }
4756 else
4757 /* cpp_interpret_string has issued an error. */
4761 {
4764 }
4767 }
4769 /* Parse a sequence of adjacent string constants. Return a TREE_STRING
4770 representing the combined, nul-terminated string constant. If
4771 TRANSLATE is true, translate the string to the execution character set.
4772 If WIDE_OK is true, a wide string is valid here.
4774 This function issues an error if a user defined string literal is
4775 encountered; use cp_parser_userdef_string_literal if UDLs are allowed. */
4779 {
4784 }
4786 /* Parse a string literal or user defined string literal.
4788 user-defined-string-literal :
4789 string-literal ud-suffix
4791 If LOOKUP_UDLIT, perform a lookup for a suitable template function. */
4795 {
4799 }
4801 /* Parse an unevaluated string literal.
4803 unevaluated-string:
4804 string-literal */
4808 {
4813 }
4815 /* Look up a literal operator with the name and the exact arguments. */
4817 static tree
4819 {
4825 {
4829 {
4836 {
4846 }
4850 /* May be this should be sufficient_parms_p instead,
4851 depending on how exactly should user-defined literals
4852 work in presence of default arguments on the literal
4853 operator parameters. */
4856 }
4857 }
4860 }
4862 /* Parse a user-defined char constant. Returns a call to a user-defined
4863 literal operator taking the character as an argument. */
4865 static cp_expr
4867 {
4875 /* Build up a call to the user-defined operator */
4876 /* Lookup the name we got back from the id-expression. */
4877 releasing_vec args;
4881 {
4885 }
4888 }
4890 /* A subroutine of cp_parser_userdef_numeric_literal to
4891 create a char... template parameter pack from a string node. */
4893 static tree
4895 {
4896 tree charvec;
4903 /* Fill in CHARVEC with all of the parameters. */
4906 {
4915 }
4917 /* Build the argument packs. */
4923 }
4925 /* A subroutine of cp_parser_userdef_numeric_literal to
4926 create a char... template parameter pack from a string node. */
4928 static tree
4930 {
4931 tree charvec;
4942 /* First template parm is character type. */
4945 /* Fill in CHARVEC with all of the parameters. */
4952 /* Build the argument packs. */
4958 }
4960 /* Parse a user-defined numeric constant. returns a call to a user-defined
4961 literal operator. */
4963 static cp_expr
4965 {
4975 /* Look for a literal operator taking the exact type of numeric argument
4976 as the literal value. */
4977 releasing_vec args;
4981 {
4983 tf_warning_or_error);
4986 {
4989 long_long_unsigned_type_node);
4990 }
4991 else
4992 {
4996 long_double_type_node);
5000 }
5003 }
5005 /* If the numeric argument didn't work, look for a raw literal
5006 operator taking a const char* argument consisting of the number
5007 in string format. */
5012 {
5014 tf_warning_or_error);
5016 }
5018 /* If the raw literal didn't work, look for a non-type template
5019 function with parameter pack char.... Call the function with
5020 template parameter characters representing the number. */
5024 {
5027 {
5029 num_string);
5031 }
5034 tf_warning_or_error);
5036 }
5038 /* In C++14 the standard library defines complex number suffixes that
5039 conflict with GNU extensions. Prefer them if <complex> is #included. */
5049 {
5053 {
5054 /* No <complex>, so pedwarn and use GNU semantics. */
5057 }
5058 }
5060 bool complained
5067 {
5069 "(from %<<complex>%>) to enable the C++14 user-defined literal "
5074 }
5081 else
5082 {
5083 /* Use the built-in semantics. */
5084 tree type;
5086 {
5089 else
5091 }
5099 }
5102 /* Avoid repeated diagnostics. */
5105 }
5107 /* Parse a user-defined string constant. Returns a call to a user-defined
5108 literal operator taking a character pointer and the length of the string
5109 as arguments. */
5111 static tree
5113 {
5119 tree decl;
5121 /* Build up a call to the user-defined operator. */
5122 /* Lookup the name we got back from the id-expression. */
5123 releasing_vec args;
5130 tf_warning_or_error);
5132 /* Look for a suitable template function, either (C++20) with a single
5133 parameter of class type, or (N3599) with typename parameter CharT and
5134 parameter pack CharT... */
5138 {
5139 /* Use resolve_nondeduced_context to try to choose one form of template
5140 or the other. */
5147 else
5148 {
5153 }
5157 tf_warning_or_error);
5158 }
5163 }
5166 /* Basic concepts [gram.basic] */
5168 /* Parse a translation-unit.
5170 translation-unit:
5171 declaration-seq [opt] */
5173 static void
5175 {
5178 /* Create the declarator obstack. */
5180 /* Create the error declarator. */
5182 /* Create the empty parameter list. */
5184 UNKNOWN_LOCATION);
5185 /* Remember where the base of the declarator obstack lies. */
5197 /* Parse until EOF. */
5199 {
5202 /* If we're entering or exiting a region that's implicitly
5203 extern "C", modify the lang context appropriately. This is
5204 so horrible. Please die. */
5207 {
5211 else
5213 }
5219 {
5220 /* Top-level module declarations are ok, and change the
5221 portion of file we're in. Top-level import declarations
5222 are significant for the import portions. */
5227 {
5230 }
5232 {
5233 mp_state
5236 }
5238 {
5243 }
5244 else
5248 {
5251 {
5254 "global module fragment contents must be"
5256 }
5257 }
5258 }
5260 /* This relies on the ordering of module_parse values. */
5262 /* We're no longer in the import portion of a named module. */
5268 {
5271 /* If the next token is now a `;', consume it. */
5274 }
5275 else
5277 }
5279 /* Get rid of the token array; we don't need it any more. */
5283 /* The EOF should have reset this. */
5286 /* Make sure the declarator obstack was fully cleaned up. */
5289 }
5291 /* Return the appropriate tsubst flags for parsing, possibly in N3276
5292 decltype context. */
5296 {
5301 }
5303 /* We're about to parse a collection of statements. If we're currently
5304 parsing tentatively, set up a firewall so that any nested
5305 cp_parser_commit_to_tentative_parse won't affect the current context. */
5307 static cp_token_position
5309 {
5316 }
5318 /* We've finished parsing the collection of statements. Wrap up the
5319 firewall and replace the relevant tokens with the parsed form. */
5321 static void
5323 tree expr)
5324 {
5328 /* Finish the firewall level. */
5330 /* And remember the result of the parse for when we try again. */
5336 }
5338 /* Like the above functions, but let the user modify the tokens. Used by
5339 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
5340 later parses, so it makes sense to localize the effects of
5341 cp_parser_commit_to_tentative_parse. */
5343 struct tentative_firewall
5344 {
5349 {
5350 /* If we're currently parsing tentatively, start a committed level as a
5351 firewall and then an inner tentative parse. */
5353 {
5357 }
5358 }
5361 {
5363 {
5364 /* Finish the inner tentative parse and the firewall, propagating any
5365 uncommitted error state to the outer tentative parse. */
5371 }
5372 }
5373 };
5375 /* Some tokens naturally come in pairs e.g.'(' and ')'.
5376 This class is for tracking such a matching pair of symbols.
5377 In particular, it tracks the location of the first token,
5378 so that if the second token is missing, we can highlight the
5379 location of the first token when notifying the user about the
5380 problem. */
5383 class token_pair
5384 {
5386 /* token_pair's ctor. */
5389 /* If the next token is the opening symbol for this pair, consume it and
5390 return true.
5391 Otherwise, issue an error and return false.
5392 In either case, record the location of the opening token. */
5395 {
5399 }
5401 /* Consume the next token from PARSER, recording its location as
5402 that of the opening token within the pair. */
5405 {
5410 }
5412 /* If the next token is the closing symbol for this pair, consume it
5413 and return it.
5414 Otherwise, issue an error, highlighting the location of the
5415 corresponding opening token, and return NULL. */
5418 {
5421 m_open_loc);
5422 }
5427 location_t m_open_loc;
5428 };
5430 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
5432 struct matching_paren_traits
5433 {
5438 };
5440 /* "matching_parens" is a token_pair<T> class for tracking matching
5441 pairs of parentheses. */
5445 /* Traits for token_pair<T> for tracking matching pairs of braces. */
5447 struct matching_brace_traits
5448 {
5453 };
5455 /* "matching_braces" is a token_pair<T> class for tracking matching
5456 pairs of braces. */
5461 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
5462 enclosing parentheses. */
5464 static cp_expr
5466 {
5470 /* Consume the '('. */
5472 matching_parens parens;
5474 /* Start the statement-expression. */
5476 /* Parse the compound-statement. */
5478 /* Finish up. */
5480 /* Consume the ')'. */
5488 }
5490 /* Expressions [gram.expr] */
5492 /* Parse a fold-operator.
5494 fold-operator:
5495 - * / % ^ & | = < > << >>
5496 = -= *= /= %= ^= &= |= <<= >>=
5497 == != <= >= && || , .* ->*
5499 This returns the tree code corresponding to the matched operator
5500 as an int. When the current token matches a compound assignment
5501 operator, the resulting tree code is the negative value of the
5502 non-assignment operator. */
5504 static int
5506 {
5508 {
5548 }
5549 }
5551 /* Returns true if CODE indicates a binary expression, which is not allowed in
5552 the LHS of a fold-expression. More codes will need to be added to use this
5553 function in other contexts. */
5555 static bool
5557 {
5559 {
5592 }
5593 }
5595 /* If the next token is a suitable fold operator, consume it and return as
5596 the function above. */
5598 static int
5600 {
5606 }
5608 /* Parse a fold-expression.
5610 fold-expression:
5611 ( ... folding-operator cast-expression)
5612 ( cast-expression folding-operator ... )
5613 ( cast-expression folding operator ... folding-operator cast-expression)
5615 Note that the '(' and ')' are matched in primary expression. */
5617 static cp_expr
5619 {
5620 cp_id_kind pidk;
5624 // Left fold.
5626 {
5633 {
5636 }
5644 }
5649 {
5652 }
5655 {
5658 }
5661 /* The operands of a fold-expression are cast-expressions, so binary or
5662 conditional expressions are not allowed. We check this here to avoid
5663 tentative parsing. */
5675 // Right fold.
5677 {
5680 }
5683 {
5686 }
5689 // Binary left or right fold.
5695 }
5697 /* Parse a primary-expression.
5699 primary-expression:
5700 literal
5701 this
5702 ( expression )
5703 id-expression
5704 lambda-expression (C++11)
5706 GNU Extensions:
5708 primary-expression:
5709 ( compound-statement )
5710 __builtin_va_arg ( assignment-expression , type-id )
5711 __builtin_offsetof ( type-id , offsetof-expression )
5713 C++ Extensions:
5714 __has_nothrow_assign ( type-id )
5715 __has_nothrow_constructor ( type-id )
5716 __has_nothrow_copy ( type-id )
5717 __has_trivial_assign ( type-id )
5718 __has_trivial_constructor ( type-id )
5719 __has_trivial_copy ( type-id )
5720 __has_trivial_destructor ( type-id )
5721 __has_virtual_destructor ( type-id )
5722 __is_abstract ( type-id )
5723 __is_base_of ( type-id , type-id )
5724 __is_class ( type-id )
5725 __is_empty ( type-id )
5726 __is_enum ( type-id )
5727 __is_final ( type-id )
5728 __is_literal_type ( type-id )
5729 __is_pod ( type-id )
5730 __is_polymorphic ( type-id )
5731 __is_std_layout ( type-id )
5732 __is_trivial ( type-id )
5733 __is_union ( type-id )
5735 Objective-C++ Extension:
5737 primary-expression:
5738 objc-expression
5740 literal:
5741 __null
5743 ADDRESS_P is true iff this expression was immediately preceded by
5744 "&" and therefore might denote a pointer-to-member. CAST_P is true
5745 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5746 true iff this expression is a template argument.
5748 Returns a representation of the expression. Upon return, *IDK
5749 indicates what kind of id-expression (if any) was present. */
5751 static cp_expr
5758 {
5761 /* Assume the primary expression is not an id-expression. */
5764 /* Peek at the next token. */
5767 {
5768 /* literal:
5769 integer-literal
5770 character-literal
5771 floating-literal
5772 string-literal
5773 boolean-literal
5774 pointer-literal
5775 user-defined-literal */
5787 {
5791 }
5792 /* Floating-point literals are only allowed in an integral
5793 constant expression if they are cast to an integral or
5794 enumeration type. */
5800 {
5801 /* CAST_P will be set even in invalid code like "int(2.7 +
5802 ...)". Therefore, we have to check that the next token
5803 is sure to end the cast. */
5805 {
5810 enumerator-definition. */
5812 /* The curly brace at the end of an enum-specifier. */
5814 /* The end of a statement. */
5816 /* The end of the cast-expression. */
5818 /* The end of an array bound. */
5820 /* The closing ">" in a template-argument-list. */
5823 /* C++0x only: A ">>" treated like two ">" tokens,
5824 in a template-argument-list. */
5829 }
5831 /* If we are within a cast, then the constraint that the
5832 cast is to an integral or enumeration type will be
5833 checked at that point. If we are not within a cast, then
5834 this code is invalid. */
5837 }
5858 /* ??? Should wide strings be allowed when parser->translate_strings_p
5859 is false (i.e. in attributes)? If not, we can kill the third
5860 argument to cp_parser_string_literal. */
5865 else
5872 /* If we see `( { ' then we are looking at the beginning of
5873 a GNU statement-expression. */
5876 {
5877 /* Statement-expressions are not allowed by the standard. */
5881 /* And they're not allowed outside of a function-body; you
5882 cannot, for example, write:
5884 int i = ({ int j = 3; j + 1; });
5886 at class or namespace scope. */
5889 {
5891 "statement-expressions are not allowed outside "
5897 }
5898 else
5900 }
5901 /* Otherwise it's a normal parenthesized expression. */
5902 {
5903 cp_expr expr;
5908 /* Consume the `('. */
5909 matching_parens parens;
5911 /* Within a parenthesized expression, a `>' token is always
5912 the greater-than operator. */
5913 saved_greater_than_is_operator_p
5918 /* Left fold expression. */
5920 else
5921 /* Parse the parenthesized expression. */
5926 {
5931 "fold-expressions only available with %<-std=c++17%> "
5933 }
5934 else
5935 /* Let the front end know that this expression was
5936 enclosed in parentheses. This matters in case, for
5937 example, the expression is of the form `A::B', since
5938 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5939 not. */
5942 /* DR 705: Wrapping an unqualified name in parentheses
5943 suppresses arg-dependent lookup. We want to pass back
5944 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5945 (c++/37862), but none of the others. */
5949 /* The `>' token might be the end of a template-id or
5950 template-parameter-list now. */
5951 parser->greater_than_is_operator_p
5954 /* Consume the `)'. */
5966 }
5969 {
5971 {
5972 /* We might have an Objective-C++ message. */
5975 /* If that works out, we're done ... */
5978 /* ... else, fall though to see if it's a lambda. */
5979 }
5981 /* Don't warn about a failed tentative parse. */
5986 }
5990 /* We have an Objective-C++ string literal. */
5997 {
5998 /* These two are the boolean literals. */
6006 /* The `__null' literal. */
6011 /* The `nullptr' literal. */
6016 /* Recognize the `this' keyword. */
6020 {
6024 }
6025 /* Pointers cannot appear in constant-expressions. */
6030 /* The `operator' keyword can be the beginning of an
6031 id-expression. */
6038 {
6039 non_integral_constant name;
6041 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
6042 __func__ are the names of variables -- but they are
6043 treated specially. Therefore, they are handled here,
6044 rather than relying on the generic id-expression logic
6045 below. Grammatically, these names are id-expressions.
6047 Consume the token. */
6051 {
6063 }
6068 /* Look up the name. */
6070 }
6073 {
6074 tree expression;
6075 tree type;
6076 location_t type_location;
6077 location_t start_loc
6079 /* The `__builtin_va_arg' construct is used to handle
6080 `va_arg'. Consume the `__builtin_va_arg' token. */
6082 /* Look for the opening `('. */
6083 matching_parens parens;
6085 /* Now, parse the assignment-expression. */
6087 /* Look for the `,'. */
6090 /* Parse the type-id. */
6091 {
6094 }
6095 /* Look for the closing `)'. */
6096 location_t finish_loc
6099 /* Using `va_arg' in a constant-expression is not
6100 allowed. */
6102 NIC_VA_ARG))
6104 /* Construct a location of the form:
6105 __builtin_va_arg (v, int)
6106 ~~~~~~~~~~~~~~~~~~~~~^~~~
6107 with the caret at the type, ranging from the start of the
6108 "__builtin_va_arg" token to the close paren. */
6109 location_t combined_loc
6112 }
6117 // C++ concepts
6121 /* Objective-C++ expressions. */
6131 "%<omp_all_memory%> may only be used in OpenMP "
6139 {
6144 }
6145 /* FALLTHRU */
6149 }
6151 /* An id-expression can start with either an identifier, a
6152 `::' as the beginning of a qualified-id, or the "operator"
6153 keyword. */
6157 /* FALLTHRU */
6161 {
6162 id_expression:
6163 cp_expr id_expression;
6164 cp_expr decl;
6170 /* Parse the id-expression. */
6171 id_expression
6188 /* If we have a template-id, then no further lookup is
6189 required. If the template-id was for a template-class, we
6190 will sometimes have a TYPE_DECL at this point. */
6194 /* Look up the name. */
6195 else
6196 {
6197 tree ambiguous_decls;
6199 /* If we already know that this lookup is ambiguous, then
6200 we've already issued an error message; there's no reason
6201 to check again. */
6204 {
6207 }
6210 none_type,
6211 template_p,
6216 /* If the lookup was ambiguous, an error will already have
6217 been issued. */
6221 /* In Objective-C++, we may have an Objective-C 2.0
6222 dot-syntax for classes here. */
6227 {
6228 tree component;
6235 component);
6236 /* Build a location of the form:
6237 expr.component
6238 ~~~~~^~~~~~~~~
6239 with caret at the start of the component name (at
6240 input_location), ranging from the start of the id_expression
6241 to the end of the component name. */
6242 location_t combined_loc
6247 }
6249 /* In Objective-C++, an instance variable (ivar) may be preferred
6250 to whatever cp_parser_lookup_name() found.
6251 Call objc_lookup_ivar. To avoid exposing cp_expr to the
6252 rest of c-family, we have to do a little extra work to preserve
6253 any location information in cp_expr "decl". Given that
6254 objc_lookup_ivar is implemented in "c-family" and "objc", we
6255 have a trip through the pure "tree" type, rather than cp_expr.
6256 Naively copying it back to "decl" would implicitly give the
6257 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
6258 store an EXPR_LOCATION. Hence we only update "decl" (and
6259 hence its location_t) if we get back a different tree node. */
6261 id_expression);
6265 /* If name lookup gives us a SCOPE_REF, then the
6266 qualifying scope was dependent. */
6268 {
6269 /* At this point, we do not know if DECL is a valid
6270 integral constant expression. We assume that it is
6271 in fact such an expression, so that code like:
6273 template <int N> struct A {
6274 int a[B<N>::i];
6275 };
6277 is accepted. At template-instantiation time, we
6278 will check that B<N>::i is actually a constant. */
6280 }
6281 /* Check to see if DECL is a local variable in a context
6282 where that is forbidden. */
6285 /* DR 2082 permits local variables in unevaluated contexts
6286 within a default argument. */
6288 {
6296 }
6297 }
6299 decl = (finish_id_expression
6301 idk,
6306 template_arg_p,
6311 /* Build a location for an id-expression of the form:
6312 ::ns::id
6313 ~~~~~~^~
6314 or:
6315 id
6316 ^~
6317 i.e. from the start of the first token to the end of the final
6318 token, with the caret at the start of the unqualified-id. */
6322 location_t combined_loc
6327 }
6329 /* Anything else is an error. */
6333 }
6334 }
6342 {
6345 }
6347 /* Complain about missing template keyword when naming a dependent
6348 member template. */
6350 static void
6352 {
6359 "expected %qs keyword before dependent "
6362 }
6364 /* Parse an id-expression.
6366 id-expression:
6367 unqualified-id
6368 qualified-id
6370 qualified-id:
6371 :: [opt] nested-name-specifier template [opt] unqualified-id
6372 :: identifier
6373 :: operator-function-id
6374 :: template-id
6376 Return a representation of the unqualified portion of the
6377 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
6378 a `::' or nested-name-specifier.
6380 Often, if the id-expression was a qualified-id, the caller will
6381 want to make a SCOPE_REF to represent the qualified-id. This
6382 function does not do this in order to avoid wastefully creating
6383 SCOPE_REFs when they are not required.
6385 If TEMPLATE_KEYWORD_P is true, then we have just seen the
6386 `template' keyword.
6388 If CHECK_DEPENDENCY_P is false, then names are looked up inside
6389 uninstantiated templates.
6391 If *TEMPLATE_P is non-NULL, it is set to true iff the
6392 `template' keyword is used to explicitly indicate that the entity
6393 named is a template.
6395 If DECLARATOR_P is true, the id-expression is appearing as part of
6396 a declarator, rather than as part of an expression. */
6398 static cp_expr
6405 {
6409 /* Assume the `template' keyword was not used. */
6413 /* Look for the optional `::' operator. */
6414 global_scope_p
6415 = (!template_keyword_p
6420 /* Look for the optional nested-name-specifier. */
6421 nested_name_specifier_p
6424 check_dependency_p,
6426 declarator_p,
6427 template_keyword_p)
6433 /* Peek at the next token. */
6436 /* If there is a nested-name-specifier, then we are looking at
6437 the first qualified-id production. */
6439 {
6440 tree saved_object_scope;
6441 tree saved_qualifying_scope;
6443 /* See if the next token is the `template' keyword. */
6447 /* Name lookup we do during the processing of the
6448 unqualified-id might obliterate SCOPE. */
6451 /* Process the final unqualified-id. */
6453 check_dependency_p,
6454 declarator_p,
6456 /* Restore the SAVED_SCOPE for our caller. */
6460 }
6461 /* Otherwise, if we are in global scope, then we are looking at one
6462 of the other qualified-id productions. */
6464 {
6465 /* If it's an identifier, and the next token is not a "<", then
6466 we can avoid the template-id case. This is an optimization
6467 for this common case. */
6469 && !cp_parser_nth_token_starts_template_argument_list_p
6474 /* Try a template-id. */
6478 declarator_p);
6479 /* If that worked, we're done. */
6483 /* Peek at the next token. (Changes in the token buffer may
6484 have invalidated the pointer obtained above.) */
6488 {
6495 {
6498 }
6499 /* Fall through. */
6504 }
6505 }
6506 else
6507 {
6512 declarator_p,
6513 optional_p);
6514 }
6517 && warn_missing_template_keyword
6518 && !template_keyword_p
6519 /* Don't warn if we're looking inside templates. */
6520 && check_dependency_p
6521 /* In a template argument list a > could be closing
6522 the enclosing targs. */
6525 /* Don't confuse an ill-formed constructor declarator for a missing
6526 template keyword in a return type. */
6530 OPT_Wmissing_template_keyword))
6531 {
6534 /* An operator after the > suggests that the > ends a
6535 template-id; a name or literal suggests that the > is an
6536 operator. */
6540 }
6543 }
6545 /* Parse an unqualified-id.
6547 unqualified-id:
6548 identifier
6549 operator-function-id
6550 conversion-function-id
6551 ~ class-name
6552 template-id
6554 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
6555 keyword, in a construct like `A::template ...'.
6557 Returns a representation of unqualified-id. For the `identifier'
6558 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
6559 production a BIT_NOT_EXPR is returned; the operand of the
6560 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
6561 other productions, see the documentation accompanying the
6562 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
6563 names are looked up in uninstantiated templates. If DECLARATOR_P
6564 is true, the unqualified-id is appearing as part of a declarator,
6565 rather than as part of an expression. */
6567 static cp_expr
6573 {
6576 /* Peek at the next token. */
6580 {
6582 {
6583 tree id;
6585 /* We don't know yet whether or not this will be a
6586 template-id. */
6588 /* Try a template-id. */
6590 check_dependency_p,
6591 declarator_p);
6592 /* If it worked, we're done. */
6595 /* Otherwise, it's an ordinary identifier. */
6597 }
6601 check_dependency_p,
6602 declarator_p);
6605 {
6606 tree type_decl;
6607 tree qualifying_scope;
6608 tree object_scope;
6609 tree scope;
6613 /* Consume the `~' token. */
6615 /* Parse the class-name. The standard, as written, seems to
6616 say that:
6618 template <typename T> struct S { ~S (); };
6619 template <typename T> S<T>::~S() {}
6621 is invalid, since `~' must be followed by a class-name, but
6622 `S<T>' is dependent, and so not known to be a class.
6623 That's not right; we need to look in uninstantiated
6624 templates. A further complication arises from:
6626 template <typename T> void f(T t) {
6627 t.T::~T();
6628 }
6630 Here, it is not possible to look up `T' in the scope of `T'
6631 itself. We must look in both the current scope, and the
6632 scope of the containing complete expression.
6634 Yet another issue is:
6636 struct S {
6637 int S;
6638 ~S();
6639 };
6641 S::~S() {}
6643 The standard does not seem to say that the `S' in `~S'
6644 should refer to the type `S' and not the data member
6645 `S::S'. */
6647 /* DR 244 says that we look up the name after the "~" in the
6648 same scope as we looked up the qualifying name. That idea
6649 isn't fully worked out; it's more complicated than that. */
6654 /* Check for invalid scopes. */
6656 {
6660 }
6662 {
6666 scope);
6671 }
6673 {
6679 }
6685 /* Create a location with caret == start at the tilde,
6686 finishing at the end of the peeked token, e.g:
6687 ~token
6688 ^~~~~~. */
6689 location_t loc
6692 /* If the name is of the form "X::~X" it's OK even if X is a
6693 typedef. */
6702 {
6705 }
6707 /* ~auto means the destructor of whatever the object is. */
6709 {
6712 "%<~auto%> only available with "
6716 }
6718 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
6719 declarator-id of a constructor or destructor. */
6722 {
6726 }
6728 /* If there was an explicit qualification (S::~T), first look
6729 in the scope given by the qualification (i.e., S).
6731 Note: in the calls to cp_parser_class_name below we pass
6732 typename_type so that lookup finds the injected-class-name
6733 rather than the constructor. */
6737 {
6742 typename_type,
6745 declarator_p);
6748 }
6749 /* In "N::S::~S", look in "N" as well. */
6751 {
6756 type_decl
6760 typename_type,
6763 declarator_p);
6766 }
6767 /* In "p->S::~T", look in the scope given by "*p" as well. */
6769 {
6774 type_decl
6778 typename_type,
6781 declarator_p);
6784 }
6785 /* Look in the surrounding context. */
6787 {
6793 type_decl
6797 typename_type,
6800 declarator_p);
6803 {
6804 /* We couldn't find a type with this name. If we're parsing
6805 tentatively, fail and try something else. */
6807 {
6810 }
6811 /* Otherwise, accept it and check for a match at instantiation
6812 time. */
6817 }
6818 }
6819 /* If an error occurred, assume that the name of the
6820 destructor is the same as the name of the qualifying
6821 class. That allows us to keep parsing after running
6822 into ill-formed destructor names. */
6828 /* Check that destructor name and scope match. */
6830 {
6837 }
6839 /* [class.dtor]
6841 A typedef-name that names a class shall not be used as the
6842 identifier in the declarator for a destructor declaration. */
6849 type_decl);
6852 }
6856 {
6857 cp_expr id;
6859 /* This could be a template-id, so we try that first. */
6861 /* Try a template-id. */
6864 declarator_p);
6865 /* If that worked, we're done. */
6868 /* We still don't know whether we're looking at an
6869 operator-function-id or a conversion-function-id. */
6871 /* Try an operator-function-id. */
6873 /* If that didn't work, try a conversion-function-id. */
6878 }
6879 /* Fall through. */
6886 }
6887 }
6889 /* Check [temp.names]/5: A name prefixed by the keyword template shall
6890 be a template-id or the name shall refer to a class template or an
6891 alias template. */
6893 static void
6895 {
6905 /* Alias templates are also OK. */
6912 name);
6913 }
6915 /* Parse an (optional) nested-name-specifier.
6917 nested-name-specifier: [C++98]
6918 class-or-namespace-name :: nested-name-specifier [opt]
6919 class-or-namespace-name :: template nested-name-specifier [opt]
6921 nested-name-specifier: [C++0x]
6922 type-name ::
6923 namespace-name ::
6924 nested-name-specifier identifier ::
6925 nested-name-specifier template [opt] simple-template-id ::
6927 PARSER->SCOPE should be set appropriately before this function is
6928 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6929 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6930 in name lookups.
6932 Sets PARSER->SCOPE to the class (TYPE) or namespace
6933 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6934 it unchanged if there is no nested-name-specifier. Returns the new
6935 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6937 If CHECK_DEPENDENCY_P is FALSE, names are looked up in dependent scopes.
6939 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6940 part of a declaration and/or decl-specifier. */
6942 static tree
6949 {
6954 /* Remember where the nested-name-specifier starts. */
6957 {
6960 }
6963 {
6964 tree new_scope;
6965 tree old_scope;
6966 tree saved_qualifying_scope;
6968 /* Spot cases that cannot be the beginning of a
6969 nested-name-specifier. */
6972 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6973 the already parsed nested-name-specifier. */
6975 {
6976 /* Grab the nested-name-specifier and continue the loop. */
6978 /* If we originally encountered this nested-name-specifier
6979 with CHECK_DEPENDENCY_P set to true, we will not have
6980 resolved TYPENAME_TYPEs, so we must do so here. */
6982 && !check_dependency_p
6984 {
6989 }
6992 }
6994 /* Spot cases that cannot be the beginning of a
6995 nested-name-specifier. On the second and subsequent times
6996 through the loop, we look for the `template' keyword. */
6998 ;
6999 /* A template-id can start a nested-name-specifier. */
7001 ;
7002 /* DR 743: decltype can be used in a nested-name-specifier. */
7004 ;
7005 else
7006 {
7007 /* If the next token is not an identifier, then it is
7008 definitely not a type-name or namespace-name. */
7011 /* If the following token is neither a `<' (to begin a
7012 template-id), nor a `::', then we are not looking at a
7013 nested-name-specifier. */
7019 /* name:name is a valid sequence in an Objective C message. */
7021 {
7025 "found %<:%> in nested-name-specifier, "
7028 }
7031 && !cp_parser_nth_token_starts_template_argument_list_p
7034 }
7036 /* The nested-name-specifier is optional, so we parse
7037 tentatively. */
7040 /* Look for the optional `template' keyword, if this isn't the
7041 first time through the loop. */
7043 {
7045 /* DR1710: "In a qualified-id used as the name in
7046 a typename-specifier, elaborated-type-specifier, using-declaration,
7047 or class-or-decltype, an optional keyword template appearing at
7048 the top level is ignored." */
7050 && typename_keyword_p
7053 }
7055 /* Save the old scope since the name lookup we are about to do
7056 might destroy it. */
7059 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
7060 look up names in "X<T>::I" in order to determine that "Y" is
7061 a template. So, if we have a typename at this point, we make
7062 an effort to look through it. */
7064 && !check_dependency_p
7065 && !typename_keyword_p
7070 /* Parse the qualifying entity. */
7071 new_scope
7073 typename_keyword_p,
7074 template_keyword_p,
7075 check_dependency_p,
7076 type_p,
7077 is_declaration);
7078 /* Look for the `::' token. */
7081 /* If we found what we wanted, we keep going; otherwise, we're
7082 done. */
7084 {
7087 /* Restore the OLD_SCOPE since it was valid before the
7088 failed attempt at finding the last
7089 class-or-namespace-name. */
7093 /* If the next token is a decltype, and the one after that is a
7094 `::', then the decltype has failed to resolve to a class or
7095 enumeration type. Give this error even when parsing
7096 tentatively since it can't possibly be valid--and we're going
7097 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
7098 won't get another chance.*/
7102 {
7108 dtype);
7111 /* As below. */
7114 }
7118 {
7119 /* If we have a non-type template-id followed by ::, it can't
7120 possibly be valid. */
7125 {
7128 {
7135 else
7138 }
7139 else
7140 {
7146 else
7147 {
7148 /* Variable template. */
7152 }
7153 }
7160 /* As below. */
7164 }
7165 }
7169 /* If the next token is an identifier, and the one after
7170 that is a `::', then any valid interpretation would have
7171 found a class-or-namespace-name. */
7177 {
7180 {
7182 {
7183 tree decl;
7184 tree ambiguous_decls;
7187 none_type,
7196 decl);
7198 {
7199 // cp_parser_lookup_name has the same diagnostic,
7200 // thus make sure to emit it at most once.
7203 {
7208 }
7210 }
7211 else
7212 {
7214 cp_parser_name_lookup_error
7217 else
7218 cp_parser_name_lookup_error
7221 }
7222 }
7225 /* Treat this as a successful nested-name-specifier
7226 due to:
7228 [basic.lookup.qual]
7230 If the name found is not a class-name (clause
7231 _class_) or namespace-name (_namespace.def_), the
7232 program is ill-formed. */
7234 }
7236 }
7238 }
7239 /* We've found one valid nested-name-specifier. */
7241 /* Name lookup always gives us a DECL. */
7244 /* Uses of "template" must be followed by actual templates. */
7247 /* If it is a class scope, try to complete it; we are about to
7248 be looking up names inside the class. */
7250 /* Since checking types for dependency can be expensive,
7251 avoid doing it if the type is already complete. */
7253 /* Do not try to complete dependent types. */
7255 {
7257 /* If it is a typedef to current class, use the current
7258 class instead, as the typedef won't have any names inside
7259 it yet. */
7263 }
7264 /* Make sure we look in the right scope the next time through
7265 the loop. */
7267 }
7269 /* If parsing tentatively, replace the sequence of tokens that makes
7270 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
7271 token. That way, should we re-parse the token stream, we will
7272 not have to repeat the effort required to do the parse, nor will
7273 we issue duplicate error messages. */
7275 {
7279 /* Reset the contents of the START token. */
7281 /* Retrieve any deferred checks. Do not pop this access checks yet
7282 so the memory will not be reclaimed during token replacing below. */
7291 /* Purge all subsequent tokens. */
7293 }
7299 }
7301 /* Parse a nested-name-specifier. See
7302 cp_parser_nested_name_specifier_opt for details. This function
7303 behaves identically, except that it will an issue an error if no
7304 nested-name-specifier is present. */
7306 static tree
7312 {
7313 tree scope;
7315 /* Look for the nested-name-specifier. */
7317 typename_keyword_p,
7318 check_dependency_p,
7319 type_p,
7320 is_declaration);
7321 /* If it was not present, issue an error message. */
7323 {
7326 }
7329 }
7331 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
7332 this is either a class-name or a namespace-name (which corresponds
7333 to the class-or-namespace-name production in the grammar). For
7334 C++0x, it can also be a type-name that refers to an enumeration
7335 type or a simple-template-id.
7337 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
7338 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
7339 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
7340 TYPE_P is TRUE iff the next name should be taken as a class-name,
7341 even the same name is declared to be another entity in the same
7342 scope.
7344 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
7345 specified by the class-or-namespace-name. If neither is found the
7346 ERROR_MARK_NODE is returned. */
7348 static tree
7355 {
7356 tree saved_scope;
7357 tree saved_qualifying_scope;
7358 tree saved_object_scope;
7359 tree scope;
7363 /* DR 743: decltype can appear in a nested-name-specifier. */
7365 {
7369 {
7372 }
7376 }
7378 /* Before we try to parse the class-name, we must save away the
7379 current PARSER->SCOPE since cp_parser_class_name will destroy
7380 it. */
7384 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
7385 there is no need to look for a namespace-name. */
7386 only_class_p = template_keyword_p
7391 typename_keyword_p,
7392 template_keyword_p,
7394 check_dependency_p,
7396 is_declaration,
7399 /* If that didn't work, try for a namespace-name. */
7401 {
7402 /* Restore the saved scope. */
7406 /* If we are not looking at an identifier followed by the scope
7407 resolution operator, then this is not part of a
7408 nested-name-specifier. (Note that this function is only used
7409 to parse the components of a nested-name-specifier.) */
7414 }
7417 }
7419 /* Return true if we are looking at a compound-literal, false otherwise. */
7421 static bool
7423 {
7426 /* Skip tokens until the next token is a closing parenthesis.
7427 If we find the closing `)', and the next token is a `{', then
7428 we are looking at a compound-literal. */
7429 bool compound_literal_p
7434 /* Roll back the tokens we skipped. */
7438 }
7440 /* Return true if EXPR is the integer constant zero or a complex constant
7441 of zero, without any folding, but ignoring location wrappers. */
7443 bool
7445 {
7448 }
7450 /* Parse a postfix-expression.
7452 postfix-expression:
7453 primary-expression
7454 postfix-expression [ expression ]
7455 postfix-expression ( expression-list [opt] )
7456 simple-type-specifier ( expression-list [opt] )
7457 typename :: [opt] nested-name-specifier identifier
7458 ( expression-list [opt] )
7459 typename :: [opt] nested-name-specifier template [opt] template-id
7460 ( expression-list [opt] )
7461 postfix-expression . template [opt] id-expression
7462 postfix-expression -> template [opt] id-expression
7463 postfix-expression . pseudo-destructor-name
7464 postfix-expression -> pseudo-destructor-name
7465 postfix-expression ++
7466 postfix-expression --
7467 dynamic_cast < type-id > ( expression )
7468 static_cast < type-id > ( expression )
7469 reinterpret_cast < type-id > ( expression )
7470 const_cast < type-id > ( expression )
7471 typeid ( expression )
7472 typeid ( type-id )
7474 GNU Extension:
7476 postfix-expression:
7477 ( type-id ) { initializer-list , [opt] }
7479 This extension is a GNU version of the C99 compound-literal
7480 construct. (The C99 grammar uses `type-name' instead of `type-id',
7481 but they are essentially the same concept.)
7483 If ADDRESS_P is true, the postfix expression is the operand of the
7484 `&' operator. CAST_P is true if this expression is the target of a
7485 cast.
7487 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
7488 class member access expressions [expr.ref].
7490 Returns a representation of the expression. */
7492 static cp_expr
7496 {
7498 location_t loc;
7504 /* Peek at the next token. */
7509 /* Some of the productions are determined by keywords. */
7512 {
7517 {
7518 tree type;
7519 cp_expr expression;
7523 /* All of these can be handled in the same way from the point
7524 of view of parsing. Begin by consuming the token
7525 identifying the cast. */
7528 /* New types cannot be defined in the cast. */
7530 parser->type_definition_forbidden_message
7533 /* Look for the opening `<'. */
7535 /* Parse the type to which we are casting. */
7539 NULL);
7541 /* Look for the closing `>'. */
7543 /* Restore the old message. */
7546 bool saved_greater_than_is_operator_p
7550 /* And the expression which is being cast. */
7551 matching_parens parens;
7555 RT_CLOSE_PAREN);
7559 parser->greater_than_is_operator_p
7562 /* Only type conversions to integral or enumeration types
7563 can be used in constant-expressions. */
7566 {
7569 }
7571 /* Construct a location e.g. :
7572 reinterpret_cast <int *> (expr)
7573 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
7574 ranging from the start of the "*_cast" token to the final closing
7575 paren, with the caret at the start. */
7579 {
7581 postfix_expression
7583 tf_warning_or_error);
7586 postfix_expression
7588 tf_warning_or_error);
7591 postfix_expression
7593 tf_warning_or_error);
7596 postfix_expression
7598 tf_warning_or_error);
7602 }
7603 }
7607 {
7608 tree type;
7612 /* Consume the `typeid' token. */
7614 /* Look for the `(' token. */
7615 matching_parens parens;
7617 /* Types cannot be defined in a `typeid' expression. */
7619 parser->type_definition_forbidden_message
7621 /* We can't be sure yet whether we're looking at a type-id or an
7622 expression. */
7624 /* Try a type-id first. */
7629 /* Look for the `)' token. Otherwise, we can't be sure that
7630 we're not looking at an expression: consider `typeid (int
7631 (3))', for example. */
7633 /* If all went well, simply lookup the type-id. */
7636 /* Otherwise, fall back to the expression variant. */
7637 else
7638 {
7639 tree expression;
7641 /* Look for an expression. */
7643 /* Compute its typeid. */
7645 /* Look for the `)' token. */
7647 }
7648 /* Restore the saved message. */
7650 /* `typeid' may not appear in an integral constant expression. */
7654 /* Construct a location e.g. :
7655 typeid (expr)
7656 ^~~~~~~~~~~~~
7657 ranging from the start of the "typeid" token to the final closing
7658 paren, with the caret at the start. */
7660 {
7661 location_t typeid_loc
7665 }
7666 }
7670 {
7671 tree type;
7672 /* The syntax permitted here is the same permitted for an
7673 elaborated-type-specifier. */
7680 }
7688 {
7696 {
7699 }
7705 {
7708 postfix_expression
7710 else
7711 {
7715 }
7721 tf_warning_or_error);
7722 else
7723 {
7727 }
7735 else
7736 {
7740 }
7745 postfix_expression
7749 postfix_expression
7752 else
7753 {
7757 }
7762 {
7766 }
7767 else
7768 {
7769 postfix_expression
7771 }
7776 }
7778 }
7781 {
7782 tree expression;
7783 tree type;
7784 /* Consume the `__builtin_convertvector' token. */
7786 /* Look for the opening `('. */
7787 matching_parens parens;
7789 /* Now, parse the assignment-expression. */
7791 /* Look for the `,'. */
7793 location_t type_location
7795 /* Parse the type-id. */
7796 {
7799 }
7800 /* Look for the closing `)'. */
7802 postfix_expression
7804 tf_warning_or_error);
7806 }
7809 {
7810 tree expression;
7811 tree type;
7812 /* Consume the `__builtin_bit_cast' token. */
7814 /* Look for the opening `('. */
7815 matching_parens parens;
7817 location_t type_location
7819 /* Parse the type-id. */
7820 {
7823 }
7824 /* Look for the `,'. */
7826 /* Now, parse the assignment-expression. */
7828 /* Look for the closing `)'. */
7830 postfix_expression
7832 tf_warning_or_error);
7834 }
7837 {
7838 tree type;
7840 /* If the next thing is a simple-type-specifier, we may be
7841 looking at a functional cast. We could also be looking at
7842 an id-expression. So, we try the functional cast, and if
7843 that doesn't work we fall back to the primary-expression. */
7845 /* Look for the simple-type-specifier. */
7849 CP_PARSER_FLAGS_NONE);
7851 /* Parse the cast itself. */
7853 postfix_expression
7855 /* If that worked, we're done. */
7859 /* If the functional-cast didn't work out, try a
7860 compound-literal. */
7863 {
7868 matching_parens parens;
7871 /* Avoid calling cp_parser_type_id pointlessly, see comment
7872 in cp_parser_cast_expression about c++/29234. */
7875 else
7876 {
7877 /* Parse the type. */
7883 }
7885 /* If things aren't going well, there's no need to
7886 keep going. */
7888 /* Parse the brace-enclosed initializer list. */
7890 /* If that worked, we're definitely looking at a
7891 compound-literal expression. */
7893 {
7894 /* Warn the user that a compound literal is not
7895 allowed in standard C++. */
7898 /* For simplicity, we disallow compound literals in
7899 constant-expressions. We could
7900 allow compound literals of integer type, whose
7901 initializer was a constant, in constant
7902 expressions. Permitting that usage, as a further
7903 extension, would not change the meaning of any
7904 currently accepted programs. (Of course, as
7905 compound literals are not part of ISO C++, the
7906 standard has nothing to say.) */
7908 NIC_NCC))
7909 {
7912 }
7913 /* Form the representation of the compound-literal. */
7914 postfix_expression
7919 }
7920 }
7922 /* It must be a primary-expression. */
7923 postfix_expression
7926 decltype_p,
7928 }
7930 }
7932 /* Note that we don't need to worry about calling build_cplus_new on a
7933 class-valued CALL_EXPR in decltype when it isn't the end of the
7934 postfix-expression; unary_complex_lvalue will take care of that for
7935 all these cases. */
7937 /* Keep looping until the postfix-expression is complete. */
7939 {
7943 /* It is not a Koenig lookup function call. */
7944 postfix_expression
7947 /* Peek at the next token. */
7951 {
7954 {
7956 "two consecutive %<[%> shall "
7959 }
7960 postfix_expression
7962 postfix_expression,
7964 decltype_p);
7973 /* postfix-expression ( expression-list [opt] ) */
7974 {
7986 tree stripped_expression
7988 is_builtin_constant_p
7991 {
7992 /* The whole point of __builtin_constant_p is to allow
7993 non-constant expressions to appear as arguments. */
7994 saved_integral_constant_expression_p
7996 saved_non_integral_constant_expression_p
7999 }
8002 BUILT_IN_CLASSIFY_TYPE))
8003 {
8004 /* __builtin_classify_type (type) */
8011 NULL);
8014 cp_unevaluated uev;
8016 matching_parens parens;
8021 {
8023 {
8031 }
8032 else
8033 {
8034 postfix_expression
8037 }
8039 }
8040 }
8041 args = (cp_parser_parenthesized_expression_list
8048 {
8049 parser->integral_constant_expression_p
8051 parser->non_integral_constant_expression_p
8053 }
8056 {
8059 }
8061 /* Function calls are not permitted in
8062 constant-expressions. */
8065 NIC_FUNC_CALL))
8066 {
8070 }
8075 {
8077 /* In C++20, we may need to perform ADL for a template
8078 name. */
8081 {
8083 {
8086 postfix_expression
8088 complain);
8089 }
8090 else
8091 postfix_expression
8093 }
8094 /* We do not perform argument-dependent lookup if
8095 normal lookup finds a non-function, in accordance
8096 with the expected resolution of DR 218. */
8099 {
8100 /* Do not do argument dependent lookup if regular
8101 lookup finds a member function or a block-scope
8102 function declaration. [basic.lookup.argdep]/3 */
8106 {
8112 {
8115 }
8116 }
8119 {
8122 postfix_expression
8124 complain);
8125 }
8126 }
8127 }
8129 /* Temporarily set input_location to the combined location
8130 with call expression range, as e.g. build_out_target_exprs
8131 called from convert_default_arg relies on input_location,
8132 so updating it only when the call is fully built results
8133 in inconsistencies between location handling in templates
8134 and outside of templates. */
8137 close_paren_loc);
8143 postfix_expression = (build_offset_ref_call_from_tree
8145 complain));
8146 else
8147 /* All other function calls. */
8148 {
8153 {
8157 }
8159 postfix_expression
8161 disallow_virtual,
8162 koenig_p,
8163 complain);
8164 }
8169 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
8173 }
8178 /* postfix-expression . template [opt] id-expression
8179 postfix-expression . pseudo-destructor-name
8180 postfix-expression -> template [opt] id-expression
8181 postfix-expression -> pseudo-destructor-name */
8183 /* Consume the `.' or `->' operator. */
8186 postfix_expression
8188 postfix_expression,
8195 /* postfix-expression ++ */
8196 /* Consume the `++' token. */
8198 /* Generate a representation for the complete expression. */
8199 postfix_expression
8201 POSTINCREMENT_EXPR);
8202 /* Increments may not appear in constant-expressions. */
8210 /* postfix-expression -- */
8211 /* Consume the `--' token. */
8213 /* Generate a representation for the complete expression. */
8214 postfix_expression
8216 POSTDECREMENT_EXPR);
8217 /* Decrements may not appear in constant-expressions. */
8228 return is_member_access
8229 ? postfix_expression
8231 else
8233 }
8234 }
8235 }
8237 /* Helper function for cp_parser_parenthesized_expression_list and
8238 cp_parser_postfix_open_square_expression. Parse a single element
8239 of parenthesized expression list. */
8241 static cp_expr
8245 {
8249 /* Parse the next assignment-expression. */
8251 {
8252 /* A braced-init-list. */
8257 ? &expr_non_constant_p
8261 }
8263 {
8269 }
8270 else
8273 /* If we have an ellipsis, then this is an expression expansion. */
8276 {
8277 /* Consume the `...'. */
8280 /* Build the argument pack. */
8282 }
8284 }
8286 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8287 by cp_parser_builtin_offsetof. We're looking for
8289 postfix-expression [ expression ]
8290 postfix-expression [ braced-init-list ] (C++11)
8291 postfix-expression [ expression-list[opt] ] (C++23)
8293 FOR_OFFSETOF is set if we're being called in that context, which
8294 changes how we deal with integer constant expressions. */
8296 static tree
8298 tree postfix_expression,
8301 {
8308 /* Consume the `[' token. */
8318 /* Parse the index expression. */
8319 /* ??? For offsetof, there is a question of what to allow here. If
8320 offsetof is not being used in an integral constant expression context,
8321 then we *could* get the right answer by computing the value at runtime.
8322 If we are in an integral constant expression context, then we might
8323 could accept any constant expression; hard to say without analysis.
8324 Rather than open the barn door too wide right away, allow only integer
8325 constant expressions here. */
8330 {
8335 {
8337 {
8338 cp_expr expr
8340 /*cast_p=*/
8342 /*allow_exp_p=*/
8344 /*non_cst_p=*/
8345 NULL);
8352 else
8355 /* If the next token isn't a `,', then we are done. */
8360 {
8363 }
8365 /* Otherwise, consume the `,' and keep going. */
8367 }
8370 }
8372 {
8376 }
8377 else
8381 }
8389 {
8393 }
8396 {
8400 {
8402 {
8403 cp_expr expr
8405 /*cast_p=*/
8407 /*allow_exp_p=*/
8409 /*non_cst_p=*/
8410 NULL);
8414 else
8418 {
8422 }
8423 }
8424 else
8425 length
8429 }
8434 {
8437 }
8438 else
8442 length);
8443 }
8447 /* Look for the closing `]'. */
8450 /* Build the ARRAY_REF. */
8453 tf_warning_or_error
8456 /* When not doing offsetof, array references are not permitted in
8457 constant-expressions. */
8463 }
8465 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
8466 dereference of incomplete type, returns true if error_mark_node should
8467 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
8468 and *DEPENDENT_P. */
8470 bool
8473 {
8474 /* In a template, be permissive by treating an object expression
8475 of incomplete type as dependent (after a pedwarn). */
8476 diagnostic_t kind = (processing_template_decl
8480 {
8492 /* Don't emit any diagnostic for OVERLOADs. */
8496 /* Avoid clobbering e.g. DECLs. */
8500 }
8512 {
8515 }
8517 }
8519 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8520 by cp_parser_builtin_offsetof. We're looking for
8522 postfix-expression . template [opt] id-expression
8523 postfix-expression . pseudo-destructor-name
8524 postfix-expression -> template [opt] id-expression
8525 postfix-expression -> pseudo-destructor-name
8527 FOR_OFFSETOF is set if we're being called in that context. That sorta
8528 limits what of the above we'll actually accept, but nevermind.
8529 TOKEN_TYPE is the "." or "->" token, which will already have been
8530 removed from the stream. */
8532 static tree
8535 cp_expr postfix_expression,
8537 location_t location)
8538 {
8539 tree name;
8545 /* If this is a `->' operator, dereference the pointer. */
8548 tf_warning_or_error);
8549 /* Check to see whether or not the expression is type-dependent and
8550 not the current instantiation. */
8552 /* The identifier following the `->' or `.' is not qualified. */
8558 /* Enter the scope corresponding to the type of the object
8559 given by the POSTFIX_EXPRESSION. */
8561 {
8563 /* According to the standard, no expression should ever have
8564 reference type. Unfortunately, we do not currently match
8565 the standard in this respect in that our internal representation
8566 of an expression may have reference type even when the standard
8567 says it does not. Therefore, we have to manually obtain the
8568 underlying type here. */
8570 /* The type of the POSTFIX_EXPRESSION must be complete. */
8571 /* Unlike the object expression in other contexts, *this is not
8572 required to be of complete type for purposes of class member
8573 access (5.2.5) outside the member function body. */
8577 {
8583 }
8586 {
8587 /* Let the name lookup machinery know that we are processing a
8588 class member access expression. */
8590 /* If something went wrong, we want to be able to discern that case,
8591 as opposed to the case where there was no SCOPE due to the type
8592 of expression being dependent. */
8595 /* If the SCOPE was erroneous, make the various semantic analysis
8596 functions exit quickly -- and without issuing additional error
8597 messages. */
8600 }
8601 }
8604 {
8606 /* If we don't have a (type-dependent) object of class type, use
8607 typeof to figure out the type of the object. */
8611 }
8613 /* Assume this expression is not a pseudo-destructor access. */
8616 /* If the SCOPE is a scalar type, then, if this is a valid program,
8617 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
8618 is type dependent, it can be pseudo-destructor-name or something else.
8619 Try to parse it as pseudo-destructor-name first. */
8621 {
8622 tree s;
8623 tree type;
8626 /* Parse the pseudo-destructor-name. */
8635 {
8637 postfix_expression
8640 }
8641 }
8644 {
8645 /* If the SCOPE is not a scalar type, we are looking at an
8646 ordinary class member access expression, rather than a
8647 pseudo-destructor-name. */
8650 /* Parse the id-expression. */
8651 name = (cp_parser_id_expression
8658 /* In general, build a SCOPE_REF if the member name is qualified.
8659 However, if the name was not dependent and has already been
8660 resolved; there is no need to build the SCOPE_REF. For example;
8662 struct X { void f(); };
8663 template <typename T> void f(T* t) { t->X::f(); }
8665 Even though "t" is dependent, "X::f" is not and has been resolved
8666 to a BASELINK; there is no need to include scope information. */
8668 /* But we do need to remember that there was an explicit scope for
8669 virtual function calls. */
8673 /* If the name is a template-id that names a type, we will get a
8674 TYPE_DECL here. That is invalid code. */
8676 {
8679 }
8680 else
8681 {
8683 {
8685 {
8689 }
8690 else
8693 name,
8694 template_p);
8698 }
8700 adjust_result_of_qualified_name_lookup
8702 postfix_expression
8704 template_p,
8705 tf_warning_or_error);
8706 /* Build a location e.g.:
8707 ptr->access_expr
8708 ~~~^~~~~~~~~~~~~
8709 where the caret is at the deref token, ranging from
8710 the start of postfix_expression to the end of the access expr. */
8711 location_t combined_loc
8714 }
8715 }
8717 /* We no longer need to look up names in the scope of the object on
8718 the left-hand side of the `.' or `->' operator. */
8721 /* Outside of offsetof, these operators may not appear in
8722 constant-expressions. */
8724 && (cp_parser_non_integral_constant_expression
8729 }
8731 /* Parse a parenthesized expression-list.
8733 expression-list:
8734 assignment-expression
8735 expression-list, assignment-expression
8737 attribute-list:
8738 expression-list
8739 identifier
8740 identifier, expression-list
8742 CAST_P is true if this expression is the target of a cast.
8744 ALLOW_EXPANSION_P is true if this expression allows expansion of an
8745 argument pack.
8747 WRAP_LOCATIONS_P is true if expressions within this list for which
8748 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
8749 their source locations.
8751 Returns a vector of trees. Each element is a representation of an
8752 assignment-expression. NULL is returned if the ( and or ) are
8753 missing. An empty, but allocated, vector is returned on no
8754 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
8755 if we are parsing an attribute list for an attribute that wants a
8756 plain identifier argument, normal_attr for an attribute that wants
8757 an expression, or non_attr if we aren't parsing an attribute list. If
8758 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
8759 not all of the expressions in the list were constant.
8760 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
8761 will be written to with the location of the closing parenthesis. If
8762 an error occurs, it may or may not be written to. */
8772 {
8777 /* Assume all the expressions will be constant. */
8781 matching_parens parens;
8787 /* Within a parenthesized expression, a `>' token is always
8788 the greater-than operator. */
8789 saved_greater_than_is_operator_p
8798 /* Consume expressions until there are no more. */
8801 {
8802 /* At the beginning of attribute lists, check to see if the
8803 next token is an identifier. */
8811 else
8812 expr
8814 allow_expansion_p,
8815 non_constant_p);
8820 /* Add it to the list. We add error_mark_node
8821 expressions to the list, so that we can still tell if
8822 the correct form for a parenthesized expression-list
8823 is found. That gives better errors. */
8829 /* After the first item, attribute lists look the same as
8830 expression lists. */
8833 get_comma:;
8834 /* If the next token isn't a `,', then we are done. */
8838 /* Otherwise, consume the `,' and keep going. */
8840 }
8846 {
8849 skip_comma:;
8850 /* We try and resync to an unnested comma, as that will give the
8851 user better diagnostics. */
8859 {
8860 parser->greater_than_is_operator_p
8864 }
8865 }
8867 parser->greater_than_is_operator_p
8872 }
8874 /* Parse a pseudo-destructor-name.
8876 pseudo-destructor-name:
8877 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
8878 :: [opt] nested-name-specifier template template-id :: ~ type-name
8879 :: [opt] nested-name-specifier [opt] ~ type-name
8881 If either of the first two productions is used, sets *SCOPE to the
8882 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
8883 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
8884 or ERROR_MARK_NODE if the parse fails. */
8886 static void
8888 tree object,
8891 {
8894 /* Handle ~auto. */
8898 {
8901 "%<~auto%> only available with "
8908 }
8910 /* Assume that things will not work out. */
8913 /* Look for the optional `::' operator. */
8915 /* Look for the optional nested-name-specifier. */
8916 nested_name_specifier_p
8923 /* Now, if we saw a nested-name-specifier, we might be doing the
8924 second production. */
8927 {
8928 /* Consume the `template' keyword. */
8930 /* Parse the template-id. */
8934 class_type,
8936 /* Look for the `::' token. */
8938 }
8939 /* If the next token is not a `~', then there might be some
8940 additional qualification. */
8942 {
8943 /* At this point, we're looking for "type-name :: ~". The type-name
8944 must not be a class-name, since this is a pseudo-destructor. So,
8945 it must be either an enum-name, or a typedef-name -- both of which
8946 are just identifiers. So, we peek ahead to check that the "::"
8947 and "~" tokens are present; if they are not, then we can avoid
8948 calling type_name. */
8952 {
8955 }
8957 /* Look for the type-name. */
8962 /* Look for the `::' token. */
8964 }
8965 else
8968 /* Look for the `~'. */
8971 /* Once we see the ~, this has to be a pseudo-destructor. */
8975 /* Look for the type-name again. We are not responsible for
8976 checking that it matches the first type-name. */
8978 }
8980 /* Parse a unary-expression.
8982 unary-expression:
8983 postfix-expression
8984 ++ cast-expression
8985 -- cast-expression
8986 await-expression
8987 unary-operator cast-expression
8988 sizeof unary-expression
8989 sizeof ( type-id )
8990 alignof ( type-id ) [C++0x]
8991 new-expression
8992 delete-expression
8994 GNU Extensions:
8996 unary-expression:
8997 __extension__ cast-expression
8998 __alignof__ unary-expression
8999 __alignof__ ( type-id )
9000 alignof unary-expression [C++0x]
9001 __real__ cast-expression
9002 __imag__ cast-expression
9003 && identifier
9004 sizeof ( type-id ) { initializer-list , [opt] }
9005 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
9006 __alignof__ ( type-id ) { initializer-list , [opt] }
9008 ADDRESS_P is true iff the unary-expression is appearing as the
9009 operand of the `&' operator. CAST_P is true if this expression is
9010 the target of a cast.
9012 Returns a representation of the expression. */
9014 static cp_expr
9017 {
9021 /* Peek at the next token. */
9023 /* Some keywords give away the kind of expression. */
9025 {
9029 {
9032 {
9040 /* Consume the token. */
9042 /* Parse the operand. */
9045 /* Construct a location e.g. :
9046 alignof (expr)
9047 ^~~~~~~~~~~~~~
9048 with start == caret at the start of the "alignof"/"sizeof"
9049 token, with the endpoint at the final closing paren. */
9050 location_t compound_loc
9056 else
9057 {
9058 /* ISO C++ defines alignof only with types, not with
9059 expressions. So pedwarn if alignof is used with a non-
9060 type expression. However, __alignof__ is ok. */
9063 "ISO C++ does not allow %<alignof%> "
9068 }
9069 /* For SIZEOF_EXPR, just issue diagnostics, but keep
9070 SIZEOF_EXPR with the original operand. */
9072 {
9074 {
9076 {
9079 error_mark_node));
9081 }
9082 else
9087 }
9088 }
9093 }
9105 {
9106 /* The saved value of the PEDANTIC flag. */
9108 tree expr;
9110 /* Save away the PEDANTIC flag. */
9112 /* Parse the cast-expression. */
9114 /* Restore the PEDANTIC flag. */
9118 }
9122 {
9123 tree expression;
9125 /* Consume the `__real__' or `__imag__' token. */
9127 /* Parse the cast-expression. */
9129 /* Create the complete representation. */
9134 tf_warning_or_error);
9135 }
9143 {
9144 tree expr;
9153 matching_parens parens;
9157 parser->type_definition_forbidden_message
9160 saved_integral_constant_expression_p
9162 saved_non_integral_constant_expression_p
9166 saved_greater_than_is_operator_p
9178 parser->greater_than_is_operator_p
9181 parser->integral_constant_expression_p
9183 parser->non_integral_constant_expression_p
9190 /* Construct a location of the form:
9191 noexcept (expr)
9192 ^~~~~~~~~~~~~~~
9193 with start == caret, finishing at the close-paren. */
9194 location_t noexcept_loc
9198 noexcept_loc);
9199 }
9202 {
9203 tree expr;
9206 /* Consume the `co_await' token. */
9208 /* Parse its cast-expression. */
9213 /* Handle [expr.await]. */
9215 }
9219 }
9220 }
9222 /* Look for the `:: new' and `:: delete', which also signal the
9223 beginning of a new-expression, or delete-expression,
9224 respectively. If the next token is `::', then it might be one of
9225 these. */
9227 {
9230 /* See if the token after the `::' is one of the keywords in
9231 which we're interested. */
9233 /* If it's `new', we have a new-expression. */
9236 /* Similarly, for `delete'. */
9239 }
9241 /* Look for a unary operator. */
9243 /* The `++' and `--' operators can be handled similarly, even though
9244 they are not technically unary-operators in the grammar. */
9246 {
9251 /* Handle the GNU address-of-label extension. */
9254 {
9255 tree identifier;
9256 tree expression;
9259 /* Consume the '&&' token. */
9261 /* Look for the identifier. */
9263 /* Construct a location of the form:
9264 &&label
9265 ^~~~~~~
9266 with caret==start at the "&&", finish at the end of the label. */
9267 location_t combined_loc
9269 /* Create an expression representing the address. */
9274 NIC_ADDR_LABEL))
9277 }
9278 }
9280 {
9281 cp_expr cast_expression;
9287 /* Consume the operator token. */
9291 /* Parse the cast-expression. */
9292 cast_expression
9297 pidk);
9299 /* Make a location:
9300 OP_TOKEN CAST_EXPRESSION
9301 ^~~~~~~~~~~~~~~~~~~~~~~~~
9302 with start==caret at the operator token, and
9303 extending to the end of the cast_expression. */
9306 /* Now, build an appropriate representation. */
9308 {
9313 complain);
9314 /* TODO: build_x_indirect_ref does not always honor the
9315 location, so ensure it is set. */
9321 /* Fall through. */
9324 cast_expression,
9326 /* TODO: build_x_unary_op does not always honor the location,
9327 so ensure it is set. */
9335 /* Fall through. */
9337 /* Immediately fold negation of a constant, unless the constant is 0
9338 (since -0 == 0) or it would overflow. */
9340 {
9341 tree stripped_expr
9346 {
9349 stripped_expr);
9351 {
9354 }
9355 }
9356 }
9357 /* Fall through. */
9366 }
9370 non_constant_p))
9374 }
9378 decltype_p,
9379 pidk);
9380 }
9382 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
9383 unary-operator, the corresponding tree code is returned. */
9385 static enum tree_code
9387 {
9389 {
9410 }
9411 }
9413 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
9414 Returns a representation of the expression. */
9416 static tree
9418 {
9421 /* Consume the __builtin_has_attribute token. */
9424 matching_parens parens;
9428 /* Types cannot be defined in a `sizeof' expression. Save away the
9429 old message. */
9433 parser->type_definition_forbidden_message
9435 parser->type_definition_forbidden_message_arg
9438 /* The restrictions on constant-expressions do not apply inside
9439 sizeof expressions. */
9440 bool saved_integral_constant_expression_p
9442 bool saved_non_integral_constant_expression_p
9446 /* Do not actually evaluate the expression. */
9452 /* We can't be sure yet whether we're looking at a type-id or an
9453 expression. */
9458 /* Look for the type-id. */
9464 /* If the type-id production did not work out, then we must be
9465 looking at an expression. */
9471 /* Go back to evaluating expressions. */
9475 /* And restore the old one. */
9478 parser->integral_constant_expression_p
9480 parser->non_integral_constant_expression_p
9483 /* Consume the comma if it's there. */
9485 {
9489 }
9491 /* Parse the attribute specification. */
9495 {
9501 else
9502 {
9503 /* Fold constant expressions used in attributes first. */
9506 /* Finally, see if OPER has been declared with ATTR. */
9508 }
9511 }
9512 else
9513 {
9516 }
9518 /* Construct a location e.g. :
9519 __builtin_has_attribute (oper, attr)
9520 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
9521 with start == caret at the start of the built-in token,
9522 and with the endpoint at the final closing paren. */
9523 location_t compound_loc
9530 }
9532 /* Parse a new-expression.
9534 new-expression:
9535 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
9536 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
9538 Returns a representation of the expression. */
9540 static tree
9542 {
9545 tree type;
9548 tree ret;
9552 /* Look for the optional `::' operator. */
9553 global_scope_p
9557 /* Look for the `new' operator. */
9559 /* There's no easy way to tell a new-placement from the
9560 `( type-id )' construct. */
9562 /* Look for a new-placement. */
9564 /* If that didn't work out, there's no new-placement. */
9566 {
9570 }
9572 /* If the next token is a `(', then we have a parenthesized
9573 type-id. */
9575 {
9579 /* Consume the `('. */
9580 matching_parens parens;
9583 /* Parse the type-id. */
9584 parser->type_definition_forbidden_message
9586 {
9589 }
9592 /* Look for the closing `)'. */
9595 /* There should not be a direct-new-declarator in this production,
9596 but GCC used to allowed this, so we check and emit a sensible error
9597 message for this case. */
9599 {
9605 }
9606 }
9607 /* Otherwise, there must be a new-type-id. */
9608 else
9611 /* If the next token is a `(' or '{', then we have a new-initializer. */
9616 else
9619 /* A new-expression may not appear in an integral constant
9620 expression. */
9623 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
9624 of a new-type-id or type-id of a new-expression, the new-expression shall
9625 contain a new-initializer of the form ( assignment-expression )".
9626 Additionally, consistently with the spirit of DR 1467, we want to accept
9627 'new auto { 2 }' too. */
9633 {
9635 "initialization of new-expression for type %<auto%> "
9638 }
9639 else
9640 {
9641 /* Construct a location e.g.:
9642 ptr = new int[100]
9643 ^~~~~~~~~~~~
9644 with caret == start at the start of the "new" token, and the end
9645 at the end of the final token we consumed. */
9648 /* Create a representation of the new-expression. */
9651 }
9659 }
9661 /* Parse a new-placement.
9663 new-placement:
9664 ( expression-list )
9666 Returns the same representation as for an expression-list. */
9670 {
9673 /* Parse the expression-list. */
9674 expression_list = (cp_parser_parenthesized_expression_list
9683 }
9685 /* Parse a new-type-id.
9687 new-type-id:
9688 type-specifier-seq new-declarator [opt]
9690 Returns the TYPE allocated. If the new-type-id indicates an array
9691 type, *NELTS is set to the number of elements in the last array
9692 bound; the TYPE will not include the last array bound. */
9694 static tree
9696 {
9697 cp_decl_specifier_seq type_specifier_seq;
9703 /* The type-specifier sequence must not contain type definitions.
9704 (It cannot contain declarations of new types either, but if they
9705 are not definitions we will catch that because they are not
9706 complete.) */
9708 parser->type_definition_forbidden_message
9710 /* Parse the type-specifier-seq. */
9715 /* Restore the old message. */
9721 /* Parse the new-declarator. */
9724 /* Determine the number of elements in the last array dimension, if
9725 any. */
9727 /* Skip down to the last array dimension. */
9732 {
9735 }
9740 {
9743 }
9746 {
9755 else
9757 }
9760 }
9762 /* Parse an (optional) new-declarator.
9764 new-declarator:
9765 ptr-operator new-declarator [opt]
9766 direct-new-declarator
9768 Returns the declarator. */
9772 {
9775 cp_cv_quals cv_quals;
9777 /* We don't know if there's a ptr-operator next, or not. */
9779 /* Look for a ptr-operator. */
9781 /* If that worked, look for more new-declarators. */
9783 {
9786 /* Parse another optional declarator. */
9789 declarator = cp_parser_make_indirect_declarator
9793 }
9795 /* If the next token is a `[', there is a direct-new-declarator. */
9800 }
9802 /* Parse a direct-new-declarator.
9804 direct-new-declarator:
9805 [ expression ]
9806 direct-new-declarator [constant-expression]
9808 */
9812 {
9817 {
9818 tree expression;
9821 /* Look for the opening `['. */
9827 else
9829 /* The standard requires that the expression have integral
9830 type. DR 74 adds enumeration types. We believe that the
9831 real intent is that these expressions be handled like the
9832 expression in a `switch' condition, which also allows
9833 classes with a single conversion to integral or
9834 enumeration type. */
9836 {
9837 expression
9839 expression,
9842 {
9844 "expression in new-declarator must have integral "
9847 }
9848 }
9850 /* Look for the closing `]'. */
9853 /* Add this bound to the declarator. */
9856 /* If the next token is not a `[', then there are no more
9857 bounds. */
9861 }
9864 }
9866 /* Parse a new-initializer.
9868 new-initializer:
9869 ( expression-list [opt] )
9870 braced-init-list
9872 Returns a representation of the expression-list. */
9876 {
9880 {
9886 }
9887 else
9888 expression_list = (cp_parser_parenthesized_expression_list
9894 }
9896 /* Parse a delete-expression.
9898 delete-expression:
9899 :: [opt] delete cast-expression
9900 :: [opt] delete [ ] cast-expression
9902 Returns a representation of the expression. */
9904 static tree
9906 {
9909 tree expression;
9912 /* Look for the optional `::' operator. */
9913 global_scope_p
9917 /* Look for the `delete' keyword. */
9919 /* See if the array syntax is in use. */
9921 {
9922 /* Consume the `[' token. */
9924 /* Look for the `]' token. */
9926 /* Remember that this is the `[]' construct. */
9928 }
9929 else
9932 /* Parse the cast-expression. */
9935 /* A delete-expression may not appear in an integral constant
9936 expression. */
9940 /* Construct a location e.g.:
9941 delete [ ] ptr
9942 ^~~~~~~~~~~~~~
9943 with caret == start at the start of the "delete" token, and
9944 the end at the end of the final token we consumed. */
9951 }
9953 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
9954 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
9955 0 otherwise. */
9957 static int
9959 {
9962 {
10004 /* In ((type ()) () the last () isn't a valid cast-expression,
10005 so the whole must be parsed as postfix-expression. */
10010 /* '[' may start a primary-expression in obj-c++ and in C++11,
10011 as a lambda-expression, eg, '(void)[]{}'. */
10018 /* '++' and '--' may or may not start a cast-expression:
10020 struct T { void operator++(int); };
10021 void f() { (T())++; }
10023 vs
10025 int a;
10026 (int)++a; */
10031 }
10032 }
10034 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
10035 in the order: const_cast, static_cast, reinterpret_cast.
10037 Don't suggest dynamic_cast.
10039 Return the first legal cast kind found, or NULL otherwise. */
10043 {
10044 tree trial;
10046 /* Reuse the parser logic by attempting to build the various kinds of
10047 cast, with "complain" disabled.
10048 Identify the first such cast that is valid. */
10050 /* Don't attempt to run such logic within template processing. */
10054 /* First try const_cast. */
10059 /* If that fails, try static_cast. */
10064 /* Finally, try reinterpret_cast. */
10066 tf_none);
10070 /* No such cast possible. */
10072 }
10074 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
10075 suggesting how to convert a C-style cast of the form:
10077 (DST_TYPE)ORIG_EXPR
10079 to a C++-style cast.
10081 The primary range of RICHLOC is asssumed to be that of the original
10082 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
10083 of the parens in the C-style cast. */
10085 static void
10088 tree dst_type)
10089 {
10090 /* This function is non-trivial, so bail out now if the warning isn't
10091 going to be emitted. */
10095 /* Try to find a legal C++ cast, trying them in order:
10096 const_cast, static_cast, reinterpret_cast. */
10101 /* Replace the open paren with "CAST_SUGGESTION<". */
10102 pretty_printer pp;
10107 /* Replace the close paren with "> (". */
10110 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
10112 }
10115 /* Parse a cast-expression.
10117 cast-expression:
10118 unary-expression
10119 ( type-id ) cast-expression
10121 ADDRESS_P is true iff the unary-expression is appearing as the
10122 operand of the `&' operator. CAST_P is true if this expression is
10123 the target of a cast.
10125 Returns a representation of the expression. */
10127 static cp_expr
10130 {
10131 /* If it's a `(', then we might be looking at a cast. */
10133 {
10139 /* There's no way to know yet whether or not this is a cast.
10140 For example, `(int (3))' is a unary-expression, while `(int)
10141 3' is a cast. So, we resort to parsing tentatively. */
10143 /* Types may not be defined in a cast. */
10145 parser->type_definition_forbidden_message
10147 /* Consume the `('. */
10148 matching_parens parens;
10153 /* A very tricky bit is that `(struct S) { 3 }' is a
10154 compound-literal (which we permit in C++ as an extension).
10155 But, that construct is not a cast-expression -- it is a
10156 postfix-expression. (The reason is that `(struct S) { 3 }.i'
10157 is legal; if the compound-literal were a cast-expression,
10158 you'd need an extra set of parentheses.) But, if we parse
10159 the type-id, and it happens to be a class-specifier, then we
10160 will commit to the parse at that point, because we cannot
10161 undo the action that is done when creating a new class. So,
10162 then we cannot back up and do a postfix-expression.
10164 Another tricky case is the following (c++/29234):
10166 struct S { void operator () (); };
10168 void foo ()
10169 {
10170 ( S()() );
10171 }
10173 As a type-id we parse the parenthesized S()() as a function
10174 returning a function, groktypename complains and we cannot
10175 back up in this case either.
10177 Therefore, we scan ahead to the closing `)', and check to see
10178 if the tokens after the `)' can start a cast-expression. Otherwise
10179 we are dealing with an unary-expression, a postfix-expression
10180 or something else.
10182 Yet another tricky case, in C++11, is the following (c++/54891):
10184 (void)[]{};
10186 The issue is that usually, besides the case of lambda-expressions,
10187 the parenthesized type-id cannot be followed by '[', and, eg, we
10188 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
10189 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
10190 we don't commit, we try a cast-expression, then an unary-expression.
10192 Save tokens so that we can put them back. */
10195 /* We may be looking at a cast-expression. */
10198 cast_expression
10201 /* Roll back the tokens we skipped. */
10203 /* If we aren't looking at a cast-expression, simulate an error so
10204 that the call to cp_parser_error_occurred below returns true. */
10207 else
10208 {
10211 /* Look for the type-id. */
10213 /* Look for the closing `)'. */
10218 }
10220 /* Restore the saved message. */
10223 /* At this point this can only be either a cast or a
10224 parenthesized ctor such as `(T ())' that looks like a cast to
10225 function returning T. */
10227 {
10228 /* Only commit if the cast-expression doesn't start with
10229 '++', '--', or '[' in C++11. */
10237 pidk);
10240 {
10241 /* Warn about old-style casts, if so requested. */
10246 {
10252 }
10254 /* Only type conversions to integral or enumeration types
10255 can be used in constant-expressions. */
10258 NIC_CAST))
10261 /* Perform the cast. */
10262 /* Make a location:
10263 (TYPE) EXPR
10264 ^~~~~~~~~~~
10265 with start==caret at the open paren, extending to the
10266 end of "expr". */
10268 open_paren_loc,
10272 }
10273 }
10274 else
10276 }
10278 /* If we get here, then it's not a cast, so it must be a
10279 unary-expression. */
10282 }
10284 /* Parse a binary expression of the general form:
10286 pm-expression:
10287 cast-expression
10288 pm-expression .* cast-expression
10289 pm-expression ->* cast-expression
10291 multiplicative-expression:
10292 pm-expression
10293 multiplicative-expression * pm-expression
10294 multiplicative-expression / pm-expression
10295 multiplicative-expression % pm-expression
10297 additive-expression:
10298 multiplicative-expression
10299 additive-expression + multiplicative-expression
10300 additive-expression - multiplicative-expression
10302 shift-expression:
10303 additive-expression
10304 shift-expression << additive-expression
10305 shift-expression >> additive-expression
10307 relational-expression:
10308 shift-expression
10309 relational-expression < shift-expression
10310 relational-expression > shift-expression
10311 relational-expression <= shift-expression
10312 relational-expression >= shift-expression
10314 GNU Extension:
10316 relational-expression:
10317 relational-expression <? shift-expression
10318 relational-expression >? shift-expression
10320 equality-expression:
10321 relational-expression
10322 equality-expression == relational-expression
10323 equality-expression != relational-expression
10325 and-expression:
10326 equality-expression
10327 and-expression & equality-expression
10329 exclusive-or-expression:
10330 and-expression
10331 exclusive-or-expression ^ and-expression
10333 inclusive-or-expression:
10334 exclusive-or-expression
10335 inclusive-or-expression | exclusive-or-expression
10337 logical-and-expression:
10338 inclusive-or-expression
10339 logical-and-expression && inclusive-or-expression
10341 logical-or-expression:
10342 logical-and-expression
10343 logical-or-expression || logical-and-expression
10345 All these are implemented with a single function like:
10347 binary-expression:
10348 simple-cast-expression
10349 binary-expression <token> binary-expression
10351 CAST_P is true if this expression is the target of a cast.
10353 The binops_by_token map is used to get the tree codes for each <token> type.
10354 binary-expressions are associated according to a precedence table. */
10356 #define TOKEN_PRECEDENCE(token) \
10357 (((token->type == CPP_GREATER \
10358 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
10359 && !parser->greater_than_is_operator_p) \
10360 ? PREC_NOT_OPERATOR \
10361 : binops_by_token[token->type].prec)
10363 static cp_expr
10369 {
10370 cp_parser_expression_stack stack;
10373 cp_parser_expression_stack_entry current;
10374 cp_expr rhs;
10378 tree overload;
10380 /* Parse the first expression. */
10391 {
10392 /* Get an operator token. */
10398 {
10400 "%<>>%> operator is treated"
10404 }
10409 /* This is a fold-expression; handle it later. */
10412 /* Popping an entry off the stack means we completed a subexpression:
10413 - either we found a token which is not an operator (`>' where it is not
10414 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
10415 will happen repeatedly;
10416 - or, we found an operator which has lower priority. This is the case
10417 where the recursive descent *ascends*, as in `3 * 4 + 5' after
10418 parsing `3 * 4'. */
10420 {
10423 else
10425 }
10427 get_rhs:
10432 /* We used the operator token. */
10435 /* For "false && x" or "true || x", x will never be executed;
10436 disable warnings while evaluating it. */
10441 {
10444 }
10446 /* Extract another operand. It may be the RHS of this expression
10447 or the LHS of a new, higher priority expression. */
10452 /* Get another operator token. Look up its precedence to avoid
10453 building a useless (immediately popped) stack entry for common
10454 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
10461 {
10462 /* ... and prepare to parse the RHS of the new, higher priority
10463 expression. Since precedence levels on the stack are
10464 monotonically increasing, we do not have to care about
10465 stack overflows. */
10474 pop:
10476 /* If the stack is not empty, we have parsed into LHS the right side
10477 (`4' in the example above) of an expression we had suspended.
10478 We can use the information on the stack to recover the LHS (`3')
10479 from the stack together with the tree code (`MULT_EXPR'), and
10480 the precedence of the higher level subexpression
10481 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
10482 which will be used to actually build the additive expression. */
10487 }
10489 /* Undo the disabling of warnings done above. */
10491 {
10494 }
10499 /* Avoid warning for !!x == y. */
10504 /* Avoid warning for !b == y where b is boolean. */
10508 /* Avoid warning for !!b == y where b is boolean. */
10520 /* Don't warn for named "xor" (as opposed to '^'). */
10524 check_for_xor_used_as_pow
10537 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
10538 ERROR_MARK for everything that is not a binary expression.
10539 This makes warn_about_parentheses miss some warnings that
10540 involve unary operators. For unary expressions we should
10541 pass the correct tree_code unless the unary expression was
10542 surrounded by parentheses.
10543 */
10547 {
10550 else
10551 {
10554 current.lhs
10557 == tcc_comparison
10561 }
10562 }
10563 else
10564 {
10570 /* TODO: build_x_binary_op doesn't always honor the location. */
10572 }
10575 /* If the binary operator required the use of an overloaded operator,
10576 then this expression cannot be an integral constant-expression.
10577 An overloaded operator can be used even if both operands are
10578 otherwise permissible in an integral constant-expression if at
10579 least one of the operands is of enumeration type. */
10583 NIC_OVERLOADED))
10585 }
10588 }
10590 static cp_expr
10595 {
10598 }
10600 /* Parse the `? expression : assignment-expression' part of a
10601 conditional-expression. The LOGICAL_OR_EXPR is the
10602 logical-or-expression that started the conditional-expression.
10603 Returns a representation of the entire conditional-expression.
10605 This routine is used by cp_parser_assignment_expression
10606 and cp_parser_conditional_expression.
10608 ? expression : assignment-expression
10610 GNU Extensions:
10612 ? : assignment-expression */
10614 static tree
10616 {
10618 cp_expr assignment_expr;
10622 /* Consume the `?' token. */
10627 {
10630 /* Implicit true clause. */
10632 c_inhibit_evaluation_warnings +=
10635 }
10636 else
10637 {
10640 /* Parse the expression. */
10641 c_inhibit_evaluation_warnings +=
10644 c_inhibit_evaluation_warnings +=
10648 }
10650 /* The next token should be a `:'. */
10652 /* Parse the assignment-expression. */
10654 c_inhibit_evaluation_warnings -=
10657 /* Make a location:
10658 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
10659 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
10660 with the caret at the "?", ranging from the start of
10661 the logical_or_expr to the end of the assignment_expr. */
10666 /* Build the conditional-expression. */
10668 expr,
10669 assignment_expr,
10670 tf_warning_or_error);
10671 }
10673 /* Parse a conditional-expression.
10675 conditional-expression:
10676 logical-or-expression
10677 logical-or-expression ? expression : assignment-expression
10679 GNU Extensions:
10681 logical-or-expression ? : assignment-expression */
10683 static cp_expr
10685 {
10688 /* If the next token is a `?' then we're actually looking at
10689 a conditional-expression; otherwise we're done. */
10693 }
10695 /* Parse an assignment-expression.
10697 assignment-expression:
10698 conditional-expression
10699 logical-or-expression assignment-operator assignment_expression
10700 throw-expression
10701 yield-expression
10703 CAST_P is true if this expression is the target of a cast.
10704 DECLTYPE_P is true if this expression is the operand of decltype.
10706 Returns a representation for the expression. */
10708 static cp_expr
10711 {
10712 cp_expr expr;
10714 /* If the next token is the `throw' keyword, then we're looking at
10715 a throw-expression. */
10718 /* If the next token is the `co_yield' keyword, then we're looking at
10719 a yield-expression. */
10722 /* Otherwise, it must be that we are looking at a
10723 logical-or-expression. */
10724 else
10725 {
10726 /* Parse the binary expressions (logical-or-expression). */
10728 decltype_p,
10730 /* If the next token is a `?' then we're actually looking at a
10731 conditional-expression. */
10734 else
10735 {
10738 /* If it's an assignment-operator, we're using the second
10739 production. */
10740 enum tree_code assignment_operator
10743 {
10744 /* Parse the right-hand side of the assignment. */
10750 /* An assignment may not appear in a
10751 constant-expression. */
10753 NIC_ASSIGNMENT))
10755 /* Build the assignment expression. Its default
10756 location:
10757 LHS = RHS
10758 ~~~~^~~~~
10759 is the location of the '=' token as the
10760 caret, ranging from the start of the lhs to the
10761 end of the rhs. */
10766 assignment_operator,
10769 /* TODO: build_x_modify_expr doesn't honor the location,
10770 so we must set it here. */
10772 }
10773 }
10774 }
10777 }
10779 /* Parse an (optional) assignment-operator.
10781 assignment-operator: one of
10782 = *= /= %= += -= >>= <<= &= ^= |=
10784 GNU Extension:
10786 assignment-operator: one of
10787 <?= >?=
10789 If the next token is an assignment operator, the corresponding tree
10790 code is returned, and the token is consumed. For example, for
10791 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
10792 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
10793 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
10794 operator, ERROR_MARK is returned. */
10796 static enum tree_code
10798 {
10802 /* Peek at the next token. */
10806 {
10852 /* Nothing else is an assignment operator. */
10854 }
10856 /* An operator followed by ... is a fold-expression, handled elsewhere. */
10861 /* If it was an assignment operator, consume it. */
10866 }
10868 /* Parse an expression.
10870 expression:
10871 assignment-expression
10872 expression , assignment-expression
10874 CAST_P is true if this expression is the target of a cast.
10875 DECLTYPE_P is true if this expression is the immediate operand of decltype,
10876 except possibly parenthesized or on the RHS of a comma (N3276).
10877 WARN_COMMA_P is true if a comma should be diagnosed.
10879 Returns a representation of the expression. */
10881 static cp_expr
10884 {
10889 {
10890 cp_expr assignment_expression;
10892 /* Parse the next assignment-expression. */
10893 assignment_expression
10896 /* We don't create a temporary for a call that is the immediate operand
10897 of decltype or on the RHS of a comma. But when we see a comma, we
10898 need to create a temporary for a call on the LHS. */
10903 assignment_expression
10907 /* If this is the first assignment-expression, we can just
10908 save it away. */
10911 else
10912 {
10913 /* Create a location with caret at the comma, ranging
10914 from the start of the LHS to the end of the RHS. */
10922 }
10923 /* If the next token is not a comma, or we're in a fold-expression, then
10924 we are done with the expression. */
10928 /* Consume the `,'. */
10931 {
10932 /* [depr.comma.subscript]: A comma expression appearing as
10933 the expr-or-braced-init-list of a subscripting expression
10934 is deprecated. A parenthesized comma expression is not
10935 deprecated. */
10937 "top-level comma expression in array subscript "
10940 }
10942 /* A comma operator cannot appear in a constant-expression. */
10945 }
10948 }
10950 /* Parse a constant-expression.
10952 constant-expression:
10953 conditional-expression
10955 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
10956 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
10957 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
10958 is false, NON_CONSTANT_P should be NULL. If ALLOW_NON_CONSTANT_P is
10959 greater than 1, this isn't really a constant-expression, only a
10960 potentially constant-evaluated expression. If STRICT_P is true,
10961 only parse a conditional-expression, otherwise parse an
10962 assignment-expression. See below for rationale. */
10964 static cp_expr
10969 {
10970 /* It might seem that we could simply parse the
10971 conditional-expression, and then check to see if it were
10972 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
10973 one that the compiler can figure out is constant, possibly after
10974 doing some simplifications or optimizations. The standard has a
10975 precise definition of constant-expression, and we must honor
10976 that, even though it is somewhat more restrictive.
10978 For example:
10980 int i[(2, 3)];
10982 is not a legal declaration, because `(2, 3)' is not a
10983 constant-expression. The `,' operator is forbidden in a
10984 constant-expression. However, GCC's constant-folding machinery
10985 will fold this operation to an INTEGER_CST for `3'. */
10987 /* Save the old settings. */
10988 bool saved_integral_constant_expression_p
10990 bool saved_allow_non_integral_constant_expression_p
10992 bool saved_non_integral_constant_expression_p
10994 /* We are now parsing a constant-expression. */
10996 parser->allow_non_integral_constant_expression_p
11000 /* A manifestly constant-evaluated expression is evaluated even in an
11001 unevaluated operand. */
11004 /* Although the grammar says "conditional-expression", when not STRICT_P,
11005 we parse an "assignment-expression", which also permits
11006 "throw-expression" and the use of assignment operators. In the case
11007 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
11008 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
11009 actually essential that we look for an assignment-expression.
11010 For example, cp_parser_initializer_clauses uses this function to
11011 determine whether a particular assignment-expression is in fact
11012 constant. */
11013 cp_expr expression;
11016 else
11018 /* Restore the old settings. */
11019 parser->integral_constant_expression_p
11021 parser->allow_non_integral_constant_expression_p
11025 {
11026 /* Require an rvalue constant expression here; that's what our
11027 callers expect. Reference constant expressions are handled
11028 separately in e.g. cp_parser_template_argument. */
11037 }
11040 parser->non_integral_constant_expression_p
11044 }
11046 /* Parse __builtin_offsetof.
11048 offsetof-expression:
11049 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
11051 offsetof-member-designator:
11052 id-expression
11053 | offsetof-member-designator "." id-expression
11054 | offsetof-member-designator "[" expression "]"
11055 | offsetof-member-designator "->" id-expression */
11057 static cp_expr
11059 {
11061 tree type;
11062 cp_expr expr;
11063 cp_id_kind dummy;
11065 location_t finish_loc;
11067 /* We're about to accept non-integral-constant things, but will
11068 definitely yield an integral constant expression. Save and
11069 restore these values around our local parsing. */
11075 /* Consume the "__builtin_offsetof" token. */
11077 /* Consume the opening `('. */
11078 matching_parens parens;
11080 /* Parse the type-id. */
11082 {
11084 parser->type_definition_forbidden_message
11088 }
11089 /* Look for the `,'. */
11093 /* Build the (type *)null that begins the traditional offsetof macro. */
11094 tree object_ptr
11098 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
11102 {
11105 {
11107 /* offsetof-member-designator "[" expression "]" */
11113 /* offsetof-member-designator "->" identifier */
11116 /* FALLTHRU */
11119 /* offsetof-member-designator "." identifier */
11127 /* Consume the ")" token. */
11133 /* Error. We know the following require will fail, but
11134 that gives the proper error message. */
11139 }
11140 }
11142 success:
11143 /* Make a location of the form:
11144 __builtin_offsetof (struct s, f)
11145 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
11146 with caret at the type-id, ranging from the start of the
11147 "_builtin_offsetof" token to the close paren. */
11149 /* The result will be an INTEGER_CST, so we need to explicitly
11150 preserve the location. */
11153 failure:
11159 }
11161 /* Parse a builtin trait expression or type. */
11163 static cp_expr
11165 {
11172 /* Get location of initial token. */
11175 /* Consume the token. */
11178 matching_parens parens;
11181 else
11185 {
11194 }
11196 /* __type_pack_element takes an expression as its first argument and uses
11197 template-id syntax instead of function call syntax (for consistency
11198 with Clang). We special case these properties of __type_pack_element
11199 here and elsewhere. */
11201 else
11202 {
11205 }
11211 {
11215 {
11217 {
11219 "trailing argument to %<__type_pack_element%> "
11222 }
11223 }
11225 }
11227 {
11230 {
11233 }
11237 }
11239 {
11242 {
11246 {
11249 }
11253 }
11257 }
11261 /* cp_parser_enclosed_template_argument_list above already took care
11263 else
11266 /* Construct a location of the form:
11267 __is_trivially_copyable(_Tp)
11268 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
11269 with start == caret, finishing at the close-paren. */
11272 /* Complete the trait expression, which may mean either processing
11273 the trait expr now or saving it for template instantiation. */
11275 {
11283 else
11285 }
11286 }
11288 /* Parse a lambda expression.
11290 lambda-expression:
11291 lambda-introducer lambda-declarator [opt] compound-statement
11292 lambda-introducer < template-parameter-list > requires-clause [opt]
11293 lambda-declarator [opt] compound-statement
11295 Returns a representation of the expression. */
11297 static cp_expr
11299 {
11301 tree type;
11309 {
11310 /* C++20 allows lambdas in unevaluated context, but one in the type of a
11311 non-type parameter is nonsensical.
11313 Distinguish a lambda in the parameter type from a lambda in the
11314 default argument by looking at local_variables_forbidden_p, which is
11315 only set in default arguments. */
11317 {
11322 }
11323 }
11325 {
11327 {
11329 "lambda-expression in unevaluated context"
11332 }
11334 }
11336 {
11338 {
11342 }
11344 }
11346 /* We may be in the middle of deferred access check. Disable
11347 it now. */
11361 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
11364 /* Now that we've started the type, add the capture fields for any
11365 explicit captures. */
11368 {
11369 /* Inside the class, surrounding template-parameter-lists do not apply. */
11370 unsigned int saved_num_template_parameter_lists
11374 bool fully_implicit_function_template_p
11378 bool auto_is_implicit_function_template_parm_p
11391 /* The body of a lambda in a discarded statement is not discarded. */
11395 /* Similarly the body of a lambda in immediate function context is not
11396 in immediate function context. */
11400 /* By virtue of defining a local class, a lambda expression has access to
11401 the private variables of enclosing classes. */
11414 {
11417 }
11419 /* The capture list was built up in reverse order; fix that now. */
11434 parser->fully_implicit_function_template_p
11438 parser->auto_is_implicit_function_template_parm_p
11441 }
11443 /* This field is only used during parsing of the lambda. */
11446 /* This lambda shouldn't have any proxies left at this point. */
11448 /* And now that we're done, push proxies for an enclosing lambda. */
11451 /* Update the lambda expression to a range. */
11458 else
11466 }
11468 /* Parse the beginning of a lambda expression.
11470 lambda-introducer:
11471 [ lambda-capture [opt] ]
11473 LAMBDA_EXPR is the current representation of the lambda expression. */
11475 static void
11477 {
11478 /* Need commas after the first capture. */
11481 /* Eat the leading `['. */
11484 /* Record default capture mode. "[&" "[=" "[&," "[=," */
11494 {
11500 }
11506 {
11508 tree capture_id;
11509 tree capture_init_expr;
11513 enum capture_kind_type
11514 {
11515 BY_COPY,
11516 BY_REFERENCE
11517 };
11521 {
11524 }
11528 else
11531 /* Possibly capture `this'. */
11533 {
11538 "explicit by-copy capture of %<this%> "
11539 "with by-copy capture default only available with "
11545 this_identifier);
11546 else
11551 }
11553 /* Possibly capture `*this'. */
11556 {
11560 "%<*this%> capture only available with "
11567 this_identifier);
11568 else
11573 }
11575 /* But reject `&this'. */
11578 {
11584 }
11586 /* Remember whether we want to capture as a reference or not. */
11588 {
11591 }
11596 {
11600 "pack init-capture only available with "
11604 }
11606 /* Early C++20 drafts had ...& instead of &...; be forgiving. */
11609 {
11614 }
11616 /* Get the identifier. */
11621 /* Would be nice to have a cp_parser_skip_to_closing_x for general
11622 delimiters, but I modified this to stop on unnested ']' as well. It
11623 was already changed to stop on unnested '}', so the
11624 "closing_parenthesis" name is no more misleading with my change. */
11625 {
11631 }
11633 /* Find the initializer for this capture. */
11637 {
11638 /* An explicit initializer exists. */
11641 "lambda capture initializers "
11649 {
11652 }
11655 }
11656 else
11657 {
11660 /* Turn the identifier into an id-expression. */
11661 capture_init_expr
11666 {
11669 }
11672 {
11675 capture_init_expr);
11680 }
11683 {
11686 capture_init_expr))
11690 }
11692 capture_init_expr
11693 = finish_id_expression
11695 capture_init_expr,
11709 {
11714 {
11715 /* If what follows is an initializer, the second '...' is
11716 invalid. But for cases like [...xs...], the first one
11717 is invalid. */
11724 }
11725 }
11726 }
11730 {
11735 capture_id);
11739 "capture of %qD redundant with by-reference capture "
11741 }
11743 /* Check for duplicates.
11744 Optimize for the zero or one explicit captures cases and only create
11745 the hash_set after adding second capture. */
11753 else
11754 {
11757 }
11763 else
11768 /* If there is any qualification still in effect, clear it
11769 now; we will be starting fresh with the next capture. */
11773 }
11776 }
11778 /* Parse the (optional) middle of a lambda expression.
11780 lambda-declarator:
11781 ( parameter-declaration-clause ) lambda-specifiers requires-clause [opt]
11782 lambda-specifiers (C++23)
11784 lambda-specifiers:
11785 decl-specifier-seq [opt] noexcept-specifier [opt]
11786 attribute-specifier-seq [opt] trailing-return-type [opt]
11788 LAMBDA_EXPR is the current representation of the lambda expression. */
11790 static bool
11792 {
11793 /* 5.1.1.4 of the standard says:
11794 If a lambda-expression does not include a lambda-declarator, it is as if
11795 the lambda-declarator were ().
11796 This means an empty parameter list, no attributes, and no exception
11797 specification. */
11808 cp_decl_specifier_seq lambda_specs;
11810 /* A lambda op() is const unless explicitly 'mutable'. */
11813 /* The template-parameter-list is optional, but must begin with
11814 an opening angle if present. */
11816 {
11820 "lambda templates are only available with "
11828 /* We may have a constrained generic lambda; parse the requires-clause
11829 immediately after the template-parameter-list and combine with any
11830 shorthand constraints present. */
11833 {
11838 }
11840 /* We just processed one more parameter list. */
11842 }
11844 /* Committee discussion supports allowing attributes here. */
11847 /* The parameter-declaration-clause is optional (unless
11848 template-parameter-list was given), but must begin with an
11849 opening parenthesis if present. */
11851 {
11852 matching_parens parens;
11857 /* Parse parameters. */
11858 param_list
11859 = cp_parser_parameter_declaration_clause
11862 /* Default arguments shall not be specified in the
11863 parameter-declaration-clause of a lambda-declarator. */
11868 OPT_Wc__14_extensions,
11873 }
11877 /* In the decl-specifier-seq of the lambda-declarator, each
11878 decl-specifier shall either be mutable or constexpr. */
11882 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
11886 {
11888 "parameter declaration before lambda declaration "
11889 "specifiers only optional with %<-std=c++2b%> or "
11892 }
11895 {
11897 }
11899 {
11904 else
11905 {
11908 }
11909 }
11913 {
11915 "parameter declaration before lambda transaction "
11916 "qualifier only optional with %<-std=c++2b%> or "
11919 }
11921 /* Parse optional exception specification. */
11922 exception_spec
11926 {
11928 "parameter declaration before lambda exception "
11929 "specification only optional with %<-std=c++2b%> or "
11932 }
11934 /* GCC 8 accepted attributes here, and this is the place for standard C++11
11935 attributes that appertain to the function type. */
11938 else
11941 /* Parse optional trailing return type. */
11943 {
11946 "parameter declaration before lambda trailing "
11947 "return type only optional with %<-std=c++2b%> or "
11951 }
11953 /* Also allow GNU attributes at the very end of the declaration, the usual
11954 place for GNU attributes. */
11959 {
11960 /* Parse optional trailing requires clause. */
11963 /* The function parameters must be in scope all the way until after the
11964 trailing-return-type in case of decltype. */
11966 }
11968 /* Create the function call operator.
11970 Messing with declarators like this is no uglier than building up the
11971 FUNCTION_DECL by hand, and this is less likely to get out of sync with
11972 other code. */
11973 {
11974 cp_decl_specifier_seq return_type_specs;
11976 tree fco;
11983 {
11987 else
11989 "lambda only available with %<-std=c++17%> or "
11991 }
11996 {
12000 }
12008 VIRT_SPEC_UNSPECIFIED,
12009 REF_QUAL_NONE,
12010 tx_qual,
12011 exception_spec,
12012 return_type,
12013 trailing_requires_clause,
12014 std_attrs,
12015 UNKNOWN_LOCATION);
12018 declarator,
12021 {
12025 /* Give the object parameter a different name. */
12028 }
12030 {
12034 }
12044 }
12045 }
12047 /* Parse the body of a lambda expression, which is simply
12049 compound-statement
12051 but which requires special handling.
12052 LAMBDA_EXPR is the current representation of the lambda expression. */
12054 static void
12056 {
12058 unsigned char local_variables_forbidden_p
12062 /* The body of a lambda-expression is not a subexpression of the enclosing
12063 expression. */
12064 cp_evaluated ev;
12068 else
12069 /* Still increment function_depth so that we don't GC in the
12070 middle of an expression. */
12078 /* Clear this in case we're in the middle of a default argument. */
12082 {
12087 /* Originally C++11 required us to peek for 'return expr'; and
12088 process it specially here to deduce the return type. N3638
12089 removed the need for that. */
12093 }
12100 else
12102 }
12104 /* Statements [gram.stmt.stmt] */
12106 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
12108 static void
12110 {
12114 /* A concept is never expanded normally. */
12120 }
12122 struct cp_omp_attribute_data
12123 {
12126 c_omp_directive_kind kind;
12127 };
12129 /* Handle omp::directive and omp::sequence attributes in ATTRS
12130 (if any) at the start of a statement or in attribute-declaration. */
12132 static tree
12134 {
12145 {
12146 cnt++;
12148 {
12154 {
12156 "mixing OpenMP directives with attribute and pragma "
12160 }
12162 {
12166 }
12169 {
12177 else
12180 }
12186 {
12188 "unknown OpenMP directive name in %qs attribute "
12192 }
12195 {
12196 /* ordered is C_OMP_DIR_CONSTRUCT only if it doesn't contain
12197 depend/doacross clause. */
12210 }
12212 {
12213 /* error with at(execution) clause is C_OMP_DIR_STANDALONE. */
12217 paren_depth++;
12219 paren_depth--;
12230 {
12233 }
12234 }
12239 }
12240 cp_omp_attribute_data v = {};
12243 }
12244 else
12257 {
12262 }
12263 else
12264 {
12266 {
12269 }
12270 }
12273 {
12275 "OpenMP construct among %<omp::directive%> attributes"
12276 " requires all %<omp::directive%> attributes on the"
12279 }
12281 {
12283 "multiple OpenMP standalone directives among"
12284 " %<omp::directive%> attributes must be all within the"
12287 }
12293 {
12295 "standalone OpenMP directives in %<omp::directive%> attribute"
12298 }
12300 {
12304 {
12306 "mixing OpenMP directives with attribute and pragma "
12309 }
12310 }
12314 tokens++;
12319 {
12326 cp_token tok = {};
12334 tok = {};
12339 }
12340 cp_token tok = {};
12352 /* Move the current source position to that of the first token in the
12353 new lexer. */
12356 }
12358 /* True if and only if the name is one of the contract types. */
12360 static bool
12362 {
12366 }
12368 /* Handle omp::directive and omp::sequence attributes in *PATTRS
12369 (if any) at the start or after declaration-id of a declaration. */
12371 static void
12375 {
12386 {
12388 {
12395 {
12403 else
12406 }
12416 {
12418 {
12421 }
12423 {
12425 "mixing OpenMP directives with attribute and "
12428 }
12429 }
12430 }
12431 }
12434 {
12439 else
12442 }
12447 {
12456 }
12458 }
12460 /* Parse a statement.
12462 statement:
12463 labeled-statement
12464 expression-statement
12465 compound-statement
12466 selection-statement
12467 iteration-statement
12468 jump-statement
12469 declaration-statement
12470 try-block
12472 C++11:
12474 statement:
12475 labeled-statement
12476 attribute-specifier-seq (opt) expression-statement
12477 attribute-specifier-seq (opt) compound-statement
12478 attribute-specifier-seq (opt) selection-statement
12479 attribute-specifier-seq (opt) iteration-statement
12480 attribute-specifier-seq (opt) jump-statement
12481 declaration-statement
12482 attribute-specifier-seq (opt) try-block
12484 init-statement:
12485 expression-statement
12486 simple-declaration
12487 alias-declaration
12489 TM Extension:
12491 statement:
12492 atomic-statement
12494 IN_COMPOUND is true when the statement is nested inside a
12495 cp_parser_compound_statement.
12497 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12498 is a (possibly labeled) if statement which is not enclosed in braces
12499 and has an else clause. This is used to implement -Wparentheses.
12501 CHAIN is a vector of if-else-if conditions.
12503 Note that this version of parsing restricts assertions to be attached to
12504 empty statements. */
12506 static void
12510 {
12516 /* A copy of IN_COMPOUND which is set to false after seeing a label.
12517 This matters for certain pragmas. */
12520 restart:
12523 /* There is no statement yet. */
12530 /* In obj-c++, seeing '[[' might be the either the beginning of
12531 c++11 attributes, or a nested objc-message-expression. So
12532 let's parse the c++11 attributes tentatively. */
12538 {
12541 }
12544 /* Peek at the next token. */
12547 /* If we have contracts, check that they're valid in this context. */
12549 {
12557 /* Check that assertions are null statements. */
12561 }
12567 {
12571 {
12598 }
12604 {
12606 std_attrs);
12608 }
12609 }
12612 /* Remember the location of the first token in the statement. */
12616 /* If this is a keyword, then that will often determine what kind of
12617 statement we have. */
12619 {
12623 {
12626 /* Looks like a labeled-statement with a case label.
12627 Parse the label, and then use tail recursion to parse
12628 the statement. */
12657 /* Objective-C++ exception-handling constructs. */
12673 /* This must be a namespace alias definition. */
12675 {
12676 /* Attributes should be parsed as part of the
12677 declaration, so let's un-parse them. */
12680 }
12698 /* It might be a keyword like `int' that can start a
12699 declaration-statement. */
12701 }
12702 }
12704 {
12705 /* If the next token is a `:', then we are looking at a
12706 labeled-statement. */
12709 {
12710 /* Looks like a labeled-statement with an ordinary label.
12711 Parse the label, and then use tail recursion to parse
12712 the statement. */
12716 /* If there's no statement, it's not a labeled-statement, just
12717 a label. That's allowed in C++23, but only if we're at the
12718 end of a compound-statement. */
12721 {
12725 "label at end of compound statement only available "
12728 }
12732 }
12733 }
12734 /* Anything that starts with a `{' must be a compound-statement. */
12736 {
12739 }
12740 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
12741 a statement all its own. */
12743 {
12744 do_pragma:;
12747 /* Only certain OpenMP pragmas are attached to statements, and thus
12748 are considered statements themselves. All others are not. In
12749 the context of a compound, accept the pragma as a "statement" and
12750 return so that we can check for a close brace. Otherwise we
12751 require a real statement and must go back and read one. */
12753 {
12757 }
12765 {
12767 {
12774 }
12777 }
12785 }
12787 {
12790 }
12792 /* Everything else must be a declaration-statement or an
12793 expression-statement. Try for the declaration-statement
12794 first, unless we are looking at a `;', in which case we know that
12795 we have an expression-statement. */
12797 {
12799 {
12801 /* Attributes should be parsed as part of the declaration,
12802 so let's un-parse them. */
12807 /* Try to parse the declaration-statement. */
12810 /* If that worked, we're done. */
12813 /* It didn't work, restore the post-attribute position. */
12815 {
12818 {
12823 i++;
12825 {
12831 /* Don't handle OpenMP attribs on keywords that
12832 always start a declaration statement but don't
12833 accept attribute before it and therefore
12834 the tentative cp_parser_declaration_statement
12835 fails to parse because of that. */
12840 }
12843 {
12845 std_attrs
12846 = cp_parser_handle_statement_omp_attributes
12852 }
12853 }
12854 }
12855 }
12856 /* All preceding labels have been parsed at this point. */
12862 /* Look for an expression-statement instead. */
12866 attrs_loc);
12868 /* Handle [[fallthrough]];. */
12870 {
12871 /* The next token after the fallthrough attribute is ';'. */
12873 {
12874 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12876 IFN_FALLTHROUGH,
12879 }
12880 else
12884 }
12886 /* Handle [[assert: ...]]; */
12888 {
12889 /* Add the assertion as a statement in the current block. */
12893 }
12894 }
12896 /* Set the line number for the statement. */
12900 /* Allow "[[fallthrough]];" or "[[assume(cond)]];", but warn otherwise. */
12904 }
12906 /* Append ATTR to attribute list ATTRS. */
12908 tree
12910 {
12916 }
12918 /* Parse the label for a labeled-statement, i.e.
12920 label:
12921 attribute-specifier-seq[opt] identifier :
12922 attribute-specifier-seq[opt] case constant-expression :
12923 attribute-specifier-seq[opt] default :
12925 labeled-statement:
12926 label statement
12928 GNU Extension:
12929 case constant-expression ... constant-expression : statement
12931 When a label is parsed without errors, the label is added to the
12932 parse tree by the finish_* functions, so this function doesn't
12933 have to return the label. */
12935 static void
12937 {
12942 /* The next token should be an identifier. */
12946 {
12949 }
12951 /* Remember whether this case or a user-defined label is allowed to fall
12952 through to. */
12957 {
12959 {
12963 /* Consume the `case' token. */
12965 /* Parse the constant-expression. */
12972 {
12973 /* Consume the `...' token. */
12979 /* We don't need to emit warnings here, as the common code
12980 will do this for us. */
12981 }
12982 else
12986 {
12989 {
12992 }
12993 }
12994 else
12997 expr);
12998 }
13002 /* Consume the `default' token. */
13006 {
13009 {
13012 }
13013 }
13014 else
13019 /* Anything else must be an ordinary label. */
13024 }
13026 /* Require the `:' token. */
13029 /* An ordinary label may optionally be followed by attributes.
13030 However, this is only permitted if the attributes are then
13031 followed by a semicolon. This is because, for backward
13032 compatibility, when parsing
13033 lab: __attribute__ ((unused)) int i;
13034 we want the attribute to attach to "i", not "lab". */
13037 {
13038 tree attrs;
13042 /* And fallthrough always binds to the expression-statement. */
13047 ;
13048 else
13050 }
13056 }
13058 /* Parse an expression-statement.
13060 expression-statement:
13061 expression [opt] ;
13063 Returns the new EXPR_STMT -- or NULL_TREE if the expression
13064 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
13065 indicates whether this expression-statement is part of an
13066 expression statement. */
13068 static tree
13070 {
13075 /* There might be attribute fallthrough. */
13078 /* If the next token is a ';', then there is no expression
13079 statement. */
13081 {
13085 {
13086 /* If we ran into a problem, make sure we complained. */
13091 }
13092 }
13096 /* Handle [[fallthrough]];. */
13098 {
13099 /* The next token after the fallthrough attribute is ';'. */
13101 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
13104 else
13108 }
13110 /* Allow "[[fallthrough]];", but warn otherwise. */
13115 /* Give a helpful message for "A<T>::type t;" and the like. */
13118 {
13125 {
13126 /* A::A a; */
13131 }
13132 }
13134 /* Consume the final `;'. */
13139 /* This is the final expression statement of a statement
13140 expression. */
13146 }
13148 /* Parse a compound-statement.
13150 compound-statement:
13151 { statement-seq [opt] label-seq [opt] }
13153 label-seq:
13154 label
13155 label-seq label
13157 GNU extension:
13159 compound-statement:
13160 { label-declaration-seq [opt] statement-seq [opt] }
13162 label-declaration-seq:
13163 label-declaration
13164 label-declaration-seq label-declaration
13166 Returns a tree representing the statement. */
13168 static tree
13171 {
13172 tree compound_stmt;
13173 matching_braces braces;
13175 /* Consume the `{'. */
13182 /* Begin the compound-statement. */
13184 /* If the next keyword is `__label__' we have a label declaration. */
13187 /* Parse an (optional) statement-seq. */
13190 /* Consume the `}'. */
13193 /* Finish the compound-statement. */
13197 }
13199 /* Diagnose errors related to imperfectly nested loops in an OMP
13200 loop construct. This function is called when such code is seen.
13201 Only issue one such diagnostic no matter how much invalid
13202 intervening code there is in the loop.
13203 FIXME: maybe the location associated with the diagnostic should
13204 be the current parser token instead of the location of the outer loop
13205 nest. */
13207 static void
13209 {
13218 /* Only diagnose errors related to perfect nesting once. */
13220 {
13222 {
13224 "inner loops must be perfectly nested in "
13227 }
13229 {
13231 "inner loops must be perfectly nested with "
13234 }
13236 {
13238 "inner loops must be perfectly nested with "
13241 }
13242 /* TODO: Also reject loops with TILE directive. */
13245 }
13246 }
13248 /* Parse an (optional) statement-seq.
13250 statement-seq:
13251 statement
13252 statement-seq [opt] statement */
13254 static void
13256 {
13259 bool in_omp_loop_block
13262 /* Scan statements until there aren't any more. */
13264 {
13267 /* If we are looking at a `}', then we have run out of
13268 statements; the same is true if we have reached the end
13269 of file, or have stumbled upon a stray '@end'. */
13276 /* If we are in a compound statement and find 'else' then
13277 something went wrong. */
13279 {
13282 else
13283 {
13286 }
13287 }
13289 /* Handle special cases for OMP FOR canonical loop syntax. */
13291 {
13295 {
13296 /* Found the nested loop. */
13300 }
13302 {
13303 /* Prior to implementing the OpenMP 5.1 syntax for canonical
13304 loop form, GCC used to accept an empty statements as not
13305 being intervening code. Continue to do that, as an
13306 extension. */
13307 /* FIXME: Maybe issue a warning or something here? */
13309 }
13311 /* The nested compound statement may contain the next loop, or
13312 it might just be intervening code. */
13313 {
13317 }
13318 else
13319 {
13320 /* This must be intervening code. */
13322 /* Defer calling check_omp_intervening_code on pragmas until
13323 cp_parser_statement, because we can't know until we parse
13324 it whether or not the pragma is a statement. */
13329 }
13331 }
13333 /* Parse the statement. */
13335 }
13336 }
13338 /* Return true if this is the C++20 version of range-based-for with
13339 init-statement. */
13341 static bool
13343 {
13346 /* Save tokens so that we can put them back. */
13349 /* There has to be an unnested ; followed by an unnested :. */
13352 CPP_SEMICOLON,
13356 /* We found the semicolon, eat it now. */
13359 /* Now look for ':' that is not nested in () or {}. */
13362 CPP_COLON,
13365 out:
13366 /* Roll back the tokens we skipped. */
13370 }
13372 /* Return true if we're looking at (init; cond), false otherwise. */
13374 static bool
13376 {
13377 /* Save tokens so that we can put them back. */
13380 /* Look for ';' that is not nested in () or {}. */
13383 CPP_SEMICOLON,
13386 /* Roll back the tokens we skipped. */
13390 }
13392 /* Parse a selection-statement.
13394 selection-statement:
13395 if ( init-statement [opt] condition ) statement
13396 if ( init-statement [opt] condition ) statement else statement
13397 switch ( init-statement [opt] condition ) statement
13399 Returns the new IF_STMT or SWITCH_STMT.
13401 If IF_P is not NULL, *IF_P is set to indicate whether the statement
13402 is a (possibly labeled) if statement which is not enclosed in
13403 braces and has an else clause. This is used to implement
13404 -Wparentheses.
13406 CHAIN is a vector of if-else-if conditions. This is used to implement
13407 -Wduplicated-cond. */
13409 static tree
13412 {
13415 token_indent_info guard_tinfo;
13420 /* Peek at the next token. */
13424 /* See what kind of keyword it is. */
13427 {
13430 {
13431 tree statement;
13432 tree condition;
13437 RID_CONSTEXPR))
13438 {
13443 "%<if constexpr%> only available with "
13445 }
13448 {
13450 RID_CONSTEVAL))
13454 RID_CONSTEVAL))
13455 {
13458 }
13459 }
13461 {
13465 "%<if consteval%> only available with "
13476 {
13479 }
13485 {
13486 location_t before_loc
13492 }
13496 /* If the next token is `else', parse the else-clause. */
13498 RID_ELSE))
13499 {
13503 /* Consume the `else' keyword. */
13509 {
13513 }
13517 guard_tinfo);
13520 {
13521 location_t before_loc
13526 }
13529 }
13533 {
13537 }
13541 }
13543 /* Look for the `('. */
13544 matching_parens parens;
13546 {
13549 }
13551 /* Begin the selection-statement. */
13553 {
13556 }
13557 else
13560 /* Parse the optional init-statement. */
13562 {
13563 tree decl;
13566 OPT_Wc__17_extensions,
13567 "init-statement in selection statements only available "
13570 /* A non-empty init-statement can have arbitrary side
13571 effects. */
13574 }
13576 /* Parse the condition. */
13578 /* Look for the `)'. */
13584 {
13588 /* Add the condition. */
13595 /* Parse the then-clause. */
13599 /* Outside a template, the non-selected branch of a constexpr
13600 if is a 'discarded statement', i.e. unevaluated. */
13605 {
13608 }
13611 guard_tinfo);
13618 {
13622 }
13624 /* If the next token is `else', parse the else-clause. */
13626 RID_ELSE))
13627 {
13631 {
13634 }
13636 guard_tinfo
13638 /* Consume the `else' keyword. */
13641 {
13643 RID_IF)
13645 {
13646 /* We've got "if (COND) else if (COND2)". Start
13647 the condition chain and add COND as the first
13648 element. */
13652 {
13653 /* Wrap it in a NOP_EXPR so that we can set the
13654 location of the condition. */
13656 condition);
13659 }
13660 }
13662 RID_IF))
13663 /* This is if-else without subsequent if. Zap the
13664 condition chain; we would have already warned at
13665 this point. */
13667 }
13669 /* Parse the else-clause. */
13675 /* If we are currently parsing a then-clause, then
13676 IF_P will not be NULL. We set it to true to
13677 indicate that this if statement has an else clause.
13678 This may trigger the Wparentheses warning below
13679 when we get back up to the parent if statement. */
13684 {
13688 }
13689 }
13690 else
13691 {
13692 /* This if statement does not have an else clause. If
13693 NESTED_IF is true, then the then-clause has an if
13694 statement which does have an else clause. We warn
13695 about the potential ambiguity. */
13698 "suggest explicit braces to avoid ambiguous"
13701 /* We don't need the condition chain anymore. */
13703 }
13705 /* Now we're all done with the if-statement. */
13707 }
13708 else
13709 {
13713 /* Add the condition. */
13716 /* Parse the body of the switch-statement. */
13722 guard_tinfo);
13726 /* Now we're all done with the switch-statement. */
13728 }
13731 }
13737 }
13738 }
13740 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
13741 If we have seen at least one decl-specifier, and the next token is not
13742 a parenthesis (after "int (" we might be looking at a functional cast)
13743 neither we are dealing with a concept-check expression then we must be
13744 looking at a declaration. */
13746 static void
13749 {
13758 }
13760 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
13761 The declarator shall not specify a function or an array. Returns
13762 TRUE if the declarator is valid, FALSE otherwise. */
13764 static bool
13767 location_t loc)
13768 {
13772 {
13777 else
13785 }
13786 else
13788 }
13790 /* Parse a condition.
13792 condition:
13793 expression
13794 type-specifier-seq declarator = initializer-clause
13795 type-specifier-seq declarator braced-init-list
13797 GNU Extension:
13799 condition:
13800 type-specifier-seq declarator asm-specification [opt]
13801 attributes [opt] = assignment-expression
13803 Returns the expression that should be tested. */
13805 static tree
13807 {
13808 cp_decl_specifier_seq type_specifiers;
13812 /* Try the declaration first. */
13814 /* New types are not allowed in the type-specifier-seq for a
13815 condition. */
13817 parser->type_definition_forbidden_message
13819 /* Parse the type-specifier-seq. */
13821 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
13824 /* Restore the saved message. */
13827 /* Gather the attributes that were provided with the
13828 decl-specifiers. */
13833 /* If all is well, we might be looking at a declaration. */
13835 {
13836 tree decl;
13837 tree asm_specification;
13838 tree attributes;
13843 /* Parse the declarator. */
13845 CP_PARSER_FLAGS_NONE,
13851 /* Parse the attributes. */
13853 /* Parse the asm-specification. */
13855 /* If the next token is not an `=' or '{', then we might still be
13856 looking at an expression. For example:
13858 if (A(a).x)
13860 looks like a decl-specifier-seq and a declarator -- but then
13861 there is no `=', so this is an expression. */
13866 /* If we did see an `=' or '{', then we are looking at a declaration
13867 for sure. */
13869 {
13870 tree pushed_scope;
13877 /* Create the declaration. */
13884 /* Parse the initializer. */
13886 {
13890 }
13892 {
13893 /* Consume the `='. */
13897 }
13898 else
13899 {
13902 }
13906 /* Process the initializer. */
13909 asm_specification,
13910 flags);
13916 }
13917 }
13918 /* If we didn't even get past the declarator successfully, we are
13919 definitely not looking at a declaration. */
13920 else
13923 /* Otherwise, we are looking at an expression. */
13925 }
13927 /* Parses a for-statement or range-for-statement until the closing ')',
13928 not included. */
13930 static tree
13932 {
13936 /* Begin the for-statement. */
13939 /* Maybe parse the optional init-statement in a range-based for loop. */
13941 /* Checked for diagnostic purposes only. */
13943 {
13944 tree dummy;
13947 {
13949 OPT_Wc__20_extensions,
13950 "range-based %<for%> loops with initializer only "
13953 }
13954 }
13956 /* Parse the initialization. */
13962 else
13964 }
13966 static tree
13969 {
13970 /* Normal for loop */
13973 tree stmt;
13976 /* The init-statement has already been parsed in
13977 cp_parser_init_statement, so no work is needed here. */
13980 /* If there's a condition, process it. */
13984 {
13988 }
13990 {
13994 }
13996 /* Look for the `;'. */
13999 /* If there's an expression, process it. */
14005 }
14007 /* Tries to parse a range-based for-statement:
14009 range-based-for:
14010 decl-specifier-seq declarator : expression
14012 The decl-specifier-seq declarator and the `:' are already parsed by
14013 cp_parser_init_statement. If processing_template_decl it returns a
14014 newly created RANGE_FOR_STMT; if not, it is converted to a
14015 regular FOR_STMT. */
14017 static tree
14020 {
14026 /* Get the range declaration momentarily out of the way so that
14027 the range expression doesn't clash with it. */
14029 {
14031 {
14033 /* For decomposition declaration get all of the corresponding
14034 declarations out of the way. */
14038 {
14046 {
14052 }
14053 }
14054 }
14056 {
14061 }
14062 }
14066 else
14069 /* Put the range declaration(s) back into scope. */
14071 {
14075 }
14077 /* finish_omp_for has its own code for the following, so just
14078 return the range_expr instead. */
14082 /* If in template, STMT is converted to a normal for-statement
14083 at instantiation. If not, it is done just ahead. */
14085 {
14097 /* do_auto_deduction doesn't mess with template init-lists. */
14100 }
14101 else
14102 {
14106 }
14108 }
14110 /* Subroutine of cp_convert_range_for: given the initializer expression,
14111 builds up the range temporary. */
14113 static tree
14115 {
14116 /* Find out the type deduced by the declaration
14117 `auto &&__range = range_expr'. */
14122 /* Create the __range variable. */
14129 }
14131 /* Used by cp_parser_range_for in template context: we aren't going to
14132 do a full conversion yet, but we still need to resolve auto in the
14133 type of the for-range-declaration if present. This is basically
14134 a shortcut version of cp_convert_range_for. */
14136 static void
14138 {
14141 {
14144 iter_type = (cp_parser_perform_range_for_lookup
14147 {
14149 iter_type);
14152 tf_warning_or_error);
14155 tf_warning_or_error,
14156 adc_variable_type);
14159 }
14160 }
14161 }
14163 /* Warns when the loop variable should be changed to a reference type to
14164 avoid unnecessary copying. I.e., from
14166 for (const auto x : range)
14168 where range returns a reference, to
14170 for (const auto &x : range)
14172 if this version doesn't make a copy.
14174 This function also warns when the loop variable is initialized with
14175 a value of a different type resulting in a copy:
14177 int arr[10];
14178 for (const double &x : arr)
14180 DECL is the RANGE_DECL; EXPR is the *__for_begin expression.
14181 This function is never called when processing_template_decl is on. */
14183 static void
14185 {
14197 {
14200 {
14201 auto_diagnostic_group d;
14203 "loop variable %qD of type %qT binds to a temporary "
14206 {
14208 TYPE_QUAL_CONST);
14213 }
14214 }
14216 }
14220 /* Since small trivially copyable types are cheap to copy, we suppress the
14221 warning for them. 64B is a common size of a cache line. */
14227 /* If we can initialize a reference directly, suggest that to avoid the
14228 copy. */
14231 {
14232 auto_diagnostic_group d;
14236 {
14240 }
14241 }
14242 }
14244 /* Converts a range-based for-statement into a normal
14245 for-statement, as per the definition.
14247 for (RANGE_DECL : RANGE_EXPR)
14248 BLOCK
14250 should be equivalent to:
14252 {
14253 auto &&__range = RANGE_EXPR;
14254 for (auto __begin = BEGIN_EXPR, __end = END_EXPR;
14255 __begin != __end;
14256 ++__begin)
14257 {
14258 RANGE_DECL = *__begin;
14259 BLOCK
14260 }
14261 }
14263 If RANGE_EXPR is an array:
14264 BEGIN_EXPR = __range
14265 END_EXPR = __range + ARRAY_SIZE(__range)
14266 Else if RANGE_EXPR has a member 'begin' or 'end':
14267 BEGIN_EXPR = __range.begin()
14268 END_EXPR = __range.end()
14269 Else:
14270 BEGIN_EXPR = begin(__range)
14271 END_EXPR = end(__range);
14273 If __range has a member 'begin' but not 'end', or vice versa, we must
14274 still use the second alternative (it will surely fail, however).
14275 When calling begin()/end() in the third alternative we must use
14276 argument dependent lookup, but always considering 'std' as an associated
14277 namespace. */
14279 tree
14283 {
14291 /* If an error happened previously do nothing or else a lot of
14292 unhelpful errors would be issued. */
14294 else
14295 {
14296 tree range_temp;
14300 /* Can't bind a reference to an array of runtime bound. */
14302 else
14303 {
14308 LOOKUP_ONLYCONVERTING);
14310 }
14313 }
14315 /* The new for initialization statement. */
14317 iter_type);
14323 LOOKUP_ONLYCONVERTING);
14333 LOOKUP_ONLYCONVERTING);
14337 /* The new for condition. */
14344 /* The new increment expression. */
14347 tf_warning_or_error);
14350 /* The declaration is initialized with *__begin inside the loop body. */
14362 }
14364 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
14365 We need to solve both at the same time because the method used
14366 depends on the existence of members begin or end.
14367 Returns the type deduced for the iterator expression. */
14369 static tree
14371 {
14373 {
14376 }
14379 {
14384 }
14386 {
14387 /* If RANGE is an array, we will use pointer arithmetic. */
14390 range,
14394 }
14395 else
14396 {
14397 /* If it is not an array, we must do a bit of magic. */
14407 tf_warning_or_error);
14410 tf_warning_or_error);
14413 {
14414 /* Use the member functions. */
14417 }
14418 else
14419 {
14420 /* Use global functions with ADL. */
14421 releasing_vec vec;
14426 tf_warning_or_error);
14428 tf_warning_or_error);
14430 tf_warning_or_error);
14432 tf_warning_or_error);
14433 }
14435 /* Last common checks. */
14437 {
14438 /* If one of the expressions is an error do no more checks. */
14441 }
14444 /* Can happen, when, eg, in a template context, Koenig lookup
14445 can't resolve begin/end (c++/58503). */
14447 else
14448 {
14450 /* The unqualified type of the __begin and __end temporaries should
14451 be the same, as required by the multiple auto declaration. */
14453 {
14460 /* P0184R0 allows __begin and __end to have different types,
14461 but make sure they are comparable so we can give a better
14463 else
14467 }
14469 }
14470 }
14471 }
14473 /* Helper function for cp_parser_perform_range_for_lookup.
14474 Builds a tree for RANGE.IDENTIFIER(). */
14476 static tree
14478 {
14486 releasing_vec vec;
14490 tf_warning_or_error);
14492 }
14494 /* Parse an iteration-statement.
14496 iteration-statement:
14497 while ( condition ) statement
14498 do statement while ( expression ) ;
14499 for ( init-statement condition [opt] ; expression [opt] )
14500 statement
14502 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
14504 static tree
14507 {
14510 tree statement;
14512 token_indent_info guard_tinfo;
14514 /* Peek at the next token. */
14521 /* Remember whether or not we are already within an iteration
14522 statement. */
14525 /* Special case for OMP loop intervening code. Parsing of permitted
14526 collapsed loop nests is handled elsewhere. */
14528 {
14532 }
14534 /* See what kind of keyword it is. */
14537 {
14539 {
14540 tree condition;
14542 /* Begin the while-statement. */
14544 /* Look for the `('. */
14545 matching_parens parens;
14547 /* Parse the condition. */
14550 /* Look for the `)'. */
14552 /* Parse the dependent statement. */
14558 /* We're done with the while-statement. */
14560 }
14564 {
14565 tree expression;
14567 /* Begin the do-statement. */
14569 /* Parse the body of the do-statement. */
14576 /* Look for the `while' keyword. */
14578 /* Look for the `('. */
14579 matching_parens parens;
14581 /* Parse the expression. */
14583 /* We're done with the do-statement. */
14585 /* Look for the `)'. */
14587 /* Look for the `;'. */
14589 }
14593 {
14594 /* Look for the `('. */
14595 matching_parens parens;
14600 /* Look for the `)'. */
14603 /* Parse the body of the for-statement. */
14610 /* We're done with the for-statement. */
14612 }
14619 }
14622 }
14624 /* Parse an init-statement or the declarator of a range-based-for.
14625 Returns true if a range-based-for declaration is seen.
14627 init-statement:
14628 expression-statement
14629 simple-declaration
14630 alias-declaration */
14632 static bool
14634 {
14635 /* If the next token is a `;', then we have an empty
14636 expression-statement. Grammatically, this is also a
14637 simple-declaration, but an invalid one, because it does not
14638 declare anything. Therefore, if we did not handle this case
14639 specially, we would issue an error message about an invalid
14640 declaration. */
14642 {
14646 /* A colon is used in range-based for. */
14649 /* We're going to speculatively look for a declaration, falling back
14650 to an expression, if necessary. */
14654 {
14660 OPT_Wc__23_extensions,
14661 "alias-declaration in init-statement only "
14663 }
14664 else
14665 /* Parse the declaration. */
14668 decl);
14671 {
14672 /* It is a range-for, consume the ':'. */
14677 OPT_Wc__11_extensions,
14678 "range-based %<for%> loops only available with "
14680 }
14682 /* The ';' is not consumed yet because we told
14683 cp_parser_simple_declaration not to. */
14688 /* If the tentative parse failed, then we shall need to look for an
14689 expression-statement. */
14690 }
14691 /* If we are here, it is an expression-statement. */
14694 }
14696 /* Parse a jump-statement.
14698 jump-statement:
14699 break ;
14700 continue ;
14701 return expression [opt] ;
14702 return braced-init-list ;
14703 coroutine-return-statement;
14704 goto identifier ;
14706 GNU extension:
14708 jump-statement:
14709 goto * expression ;
14711 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
14713 static tree
14715 {
14721 /* Peek at the next token. */
14726 /* See what kind of keyword it is. */
14729 {
14733 {
14750 }
14756 {
14760 /* Fall through. */
14770 }
14776 {
14777 tree expr;
14780 {
14784 }
14787 else
14788 /* If the next token is a `;', then there is no
14789 expression. */
14791 /* Build the return-statement, check co-return first, since type
14792 deduction is not valid there. */
14797 else
14799 /* Look for the final `;'. */
14801 }
14808 {
14812 }
14814 /* Create the goto-statement. */
14816 {
14817 /* Issue a warning about this use of a GNU extension. */
14819 /* Consume the '*' token. */
14821 /* Parse the dependent expression. */
14823 }
14824 else
14826 /* Look for the final `;'. */
14833 }
14836 }
14838 /* Parse a declaration-statement.
14840 declaration-statement:
14841 block-declaration */
14843 static void
14845 {
14848 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14851 /* Parse the block-declaration. */
14854 /* Free any declarators allocated. */
14856 }
14858 /* Some dependent statements (like `if (cond) statement'), are
14859 implicitly in their own scope. In other words, if the statement is
14860 a single statement (as opposed to a compound-statement), it is
14861 none-the-less treated as if it were enclosed in braces. Any
14862 declarations appearing in the dependent statement are out of scope
14863 after control passes that point. This function parses a statement,
14864 but ensures that is in its own scope, even if it is not a
14865 compound-statement.
14867 If IF_P is not NULL, *IF_P is set to indicate whether the statement
14868 is a (possibly labeled) if statement which is not enclosed in
14869 braces and has an else clause. This is used to implement
14870 -Wparentheses.
14872 CHAIN is a vector of if-else-if conditions. This is used to implement
14873 -Wduplicated-cond.
14875 Returns the new statement. */
14877 static tree
14881 {
14882 tree statement;
14885 token_indent_info body_tinfo
14891 /* Mark if () ; with a special NOP_EXPR. */
14893 {
14904 }
14905 /* if a compound is opened, we simply parse the statement directly. */
14908 /* If the token is not a `{', then we must take special action. */
14909 else
14910 {
14911 /* Create a compound-statement. */
14913 /* Parse the dependent-statement. */
14916 /* Finish the dummy compound-statement. */
14918 }
14920 token_indent_info next_tinfo
14929 /* Return the statement. */
14931 }
14933 /* For some dependent statements (like `while (cond) statement'), we
14934 have already created a scope. Therefore, even if the dependent
14935 statement is a compound-statement, we do not want to create another
14936 scope. */
14938 static void
14941 {
14942 /* If the token is a `{', then we must take special action. */
14944 {
14945 token_indent_info body_tinfo
14951 token_indent_info next_tinfo
14960 }
14961 else
14962 {
14963 /* Avoid calling cp_parser_compound_statement, so that we
14964 don't create a new scope. Do everything else by hand. */
14965 matching_braces braces;
14967 /* If the next keyword is `__label__' we have a label declaration. */
14970 /* Parse an (optional) statement-seq. */
14973 }
14974 }
14976 /* Modules */
14978 /* Parse a module-name or module-partition.
14980 module-name:
14981 module-name-qualifier [opt] identifier
14983 module-partition:
14984 : module-name-qualifier [opt] identifier
14986 module-name-qualifier:
14987 identifier .
14988 module-name-qualifier identifier .
14990 Returns a pointer to the module object, or NULL on failure.
14991 For PARTITION_P, PARENT is the module this is a partition of. */
14996 {
15002 {
15004 {
15007 else
15010 }
15018 }
15021 }
15023 /* Parse a module-partition. Defers to cp_parser_module_name. */
15027 {
15029 }
15031 /* Named module-declaration
15032 __module ; PRAGMA_EOL
15033 __module : private ; PRAGMA_EOL (unimplemented)
15034 [__export] __module module-name module-partition [opt]
15035 attr-spec-seq-opt ; PRAGMA_EOL
15036 */
15038 static module_parse
15041 {
15042 /* We're a pseudo pragma. */
15047 {
15051 }
15054 {
15055 /* Start global module fragment. */
15060 }
15065 {
15073 {
15076 }
15077 else
15079 "private module fragment only permitted in purview"
15081 }
15083 {
15084 /* Neither the first declaration, nor in a GMF. */
15087 skip_eol:
15089 }
15090 else
15091 {
15104 }
15107 }
15109 /* Import-declaration
15110 __import module-name attr-spec-seq-opt ; PRAGMA_EOL
15111 __import module-partition attr-spec-seq-opt ; PRAGMA_EOL
15112 __import header-name attr-spec-seq-opt ; PRAGMA_EOL
15113 */
15115 static void
15118 {
15119 /* We're a pseudo pragma. */
15124 {
15127 note_lexer:
15129 " disambiguation, to prevent this being considered a"
15131 skip_eol:
15133 }
15135 {
15138 }
15139 else
15140 {
15144 {
15147 }
15149 {
15150 /* An import specifying a module-partition shall only appear after the
15151 module-declaration in a module unit: [module.import]/4. */
15156 else
15159 }
15160 else
15173 {
15174 /* Module-purview imports must not be from source inclusion
15175 [cpp.import]/7 */
15184 }
15187 }
15188 }
15190 /* export-declaration.
15192 export declaration
15193 export { declaration-seq-opt } */
15195 static void
15197 {
15216 {
15223 }
15224 else
15225 {
15226 /* Explicitly check if the next tokens might be a
15227 module-directive line, so we can give a clearer error message
15228 about why the directive will be rejected. */
15235 }
15238 }
15240 /* Declarations [gram.dcl.dcl] */
15242 /* Parse an optional declaration-sequence. TOP_LEVEL is true, if this
15243 is the top-level declaration sequence. That affects whether we
15244 deal with module-preamble.
15246 declaration-seq:
15247 declaration
15248 declaration-seq declaration */
15250 static void
15252 {
15254 {
15260 else
15262 }
15263 }
15265 /* Parse a declaration.
15267 declaration:
15268 block-declaration
15269 function-definition
15270 template-declaration
15271 explicit-instantiation
15272 explicit-specialization
15273 linkage-specification
15274 namespace-definition
15276 C++17:
15277 deduction-guide
15279 modules:
15280 (all these are only allowed at the outermost level, check
15281 that semantically, for better diagnostics)
15282 module-declaration
15283 module-export-declaration
15284 module-import-declaration
15285 export-declaration
15287 GNU extension:
15289 declaration:
15290 __extension__ declaration */
15292 static void
15294 {
15297 /* Check for the `__extension__' keyword. */
15299 {
15300 /* Parse the qualified declaration. */
15302 /* Restore the PEDANTIC flag. */
15306 }
15308 /* Try to figure out what kind of declaration is present. */
15314 {
15316 /* A declaration consisting of a single semicolon is invalid
15317 * before C++11. Allow it unless we're being pedantic. */
15321 }
15325 CPP_SEMICOLON))
15326 {
15331 {
15334 std_attrs);
15336 {
15339 {
15341 CPP_PRAGMA));
15343 }
15345 }
15346 }
15354 }
15356 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
15361 /* Conditionally, allow attributes to precede a linkage specification. */
15363 {
15371 {
15373 /* We might have already been here. */
15375 {
15383 }
15386 }
15387 else
15388 {
15391 }
15392 }
15393 /* If we already had some attributes, and we've added more, then prepend.
15394 Otherwise attributes just contains any that we just read. */
15396 {
15400 }
15402 /* If the next token is `extern' and the following token is a string
15403 literal, then we have a linkage specification. */
15407 /* If the next token is `template', then we have either a template
15408 declaration, an explicit instantiation, or an explicit
15409 specialization. */
15411 {
15412 /* `template <>' indicates a template specialization. */
15416 /* `template <' indicates a template declaration. */
15419 /* Anything else must be an explicit instantiation. */
15420 else
15422 }
15423 /* If the next token is `export', it's new-style modules or
15424 old-style template. */
15426 {
15429 else
15431 }
15433 {
15438 // In module purview this will be ill-formed.
15444 else
15446 }
15447 /* If the next token is `extern', 'static' or 'inline' and the one
15448 after that is `template', we have a GNU extended explicit
15449 instantiation directive. */
15456 /* If the next token is `namespace', check for a named or unnamed
15457 namespace definition. */
15466 /* An unnamed namespace definition. */
15470 /* An inline (associated) namespace definition. */
15474 /* Objective-C++ declaration/definition. */
15481 /* At this point we may have a template declared by a concept
15482 introduction. */
15487 else
15488 /* Try to parse a block-declaration, or a function-definition. */
15491 /* Free any declarators allocated. */
15493 }
15495 /* Parse a namespace-scope declaration. */
15497 static void
15499 {
15503 /* A top-level declaration can consist solely of a #pragma. A
15504 nested declaration cannot, so this is done here and not in
15505 cp_parser_declaration. (A #pragma at block scope is
15506 handled in cp_parser_statement.) */
15508 else
15509 /* Parse the declaration itself. */
15511 }
15513 /* Parse a block-declaration.
15515 block-declaration:
15516 simple-declaration
15517 asm-definition
15518 namespace-alias-definition
15519 using-declaration
15520 using-directive
15522 GNU Extension:
15524 block-declaration:
15525 __extension__ block-declaration
15527 C++0x Extension:
15529 block-declaration:
15530 static_assert-declaration
15532 If STATEMENT_P is TRUE, then this block-declaration is occurring as
15533 part of a declaration-statement. */
15535 static void
15538 {
15541 /* Check for the `__extension__' keyword. */
15543 {
15544 /* Parse the qualified declaration. */
15546 /* Restore the PEDANTIC flag. */
15550 }
15552 /* Peek at the next token to figure out which kind of declaration is
15553 present. */
15556 /* If the next keyword is `asm', we have an asm-definition. */
15558 {
15562 }
15563 /* If the next keyword is `namespace', we have a
15564 namespace-alias-definition. */
15567 /* If the next keyword is `using', we have a
15568 using-declaration, a using-directive, or an alias-declaration. */
15570 {
15575 /* If the token after `using' is `namespace', then we have a
15576 using-directive. */
15582 /* If the second token after 'using' is '=', then we have an
15583 alias-declaration. */
15589 /* Otherwise, it's a using-declaration. */
15590 else
15593 }
15594 /* If the next keyword is `__label__' we have a misplaced label
15595 declaration. */
15597 {
15601 /* If the next token is now a `;', consume it. */
15604 }
15605 /* If the next token is `static_assert' we have a static assertion. */
15608 else
15609 {
15614 /* If the next tokens after attributes is `using namespace', then we have
15615 a using-directive. */
15619 RID_NAMESPACE))
15620 {
15624 }
15625 /* If the next token after attributes is `asm', then we have
15626 an asm-definition. */
15628 {
15632 }
15633 /* Anything else must be a simple-declaration. */
15634 else
15637 }
15638 }
15640 /* Parse a simple-declaration.
15642 simple-declaration:
15643 decl-specifier-seq [opt] init-declarator-list [opt] ;
15644 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15645 brace-or-equal-initializer ;
15647 init-declarator-list:
15648 init-declarator
15649 init-declarator-list , init-declarator
15651 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
15652 function-definition as a simple-declaration.
15654 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15655 parsed declaration if it is an uninitialized single declarator not followed
15656 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15657 if present, will not be consumed. */
15659 static void
15663 {
15664 cp_decl_specifier_seq decl_specifiers;
15673 /* Defer access checks until we know what is being declared; the
15674 checks for names appearing in the decl-specifier-seq should be
15675 done as if we were in the scope of the thing being declared. */
15678 /* Parse the decl-specifier-seq. We have to keep track of whether
15679 or not the decl-specifier-seq declares a named class or
15680 enumeration type, since that is the only case in which the
15681 init-declarator-list is allowed to be empty.
15683 [dcl.dcl]
15685 In a simple-declaration, the optional init-declarator-list can be
15686 omitted only when declaring a class or enumeration, that is when
15687 the decl-specifier-seq contains either a class-specifier, an
15688 elaborated-type-specifier, or an enum-specifier. */
15690 CP_PARSER_FLAGS_OPTIONAL,
15693 /* We no longer need to defer access checks. */
15696 cp_omp_declare_simd_data odsd;
15702 /* In a block scope, a valid declaration must always have a
15703 decl-specifier-seq. By not trying to parse declarators, we can
15704 resolve the declaration/expression ambiguity more quickly. */
15707 {
15710 }
15712 /* If the next two tokens are both identifiers, the code is
15713 erroneous. The usual cause of this situation is code like:
15715 T t;
15717 where "T" should name a type -- but does not. */
15720 {
15721 /* If parsing tentatively, we should commit; we really are
15722 looking at a declaration. */
15724 /* Give up. */
15726 }
15730 /* Look for C++17 decomposition declaration. */
15738 {
15739 tree decl
15741 maybe_range_for_decl,
15744 /* The next token should be either a `,' or a `;'. */
15746 /* If it's a `;', we are done. */
15750 {
15754 }
15755 /* Anything else is an error. */
15756 else
15757 {
15758 /* If we have already issued an error message we don't need
15759 to issue another one. */
15764 /* Skip tokens until we reach the end of the statement. */
15766 /* If the next token is now a `;', consume it. */
15770 }
15771 }
15772 else
15775 tree last_type;
15777 /* NULL_TREE if both variable and function declaration are allowed,
15778 error_mark_node if function declaration are not allowed and
15779 a FUNCTION_DECL that should be diagnosed if it is followed by
15780 variable declarations. */
15781 tree auto_function_declaration;
15784 auto_specifier_p
15788 /* Keep going until we hit the `;' at the end of the simple
15789 declaration. */
15792 CPP_SEMICOLON))
15793 {
15796 tree decl;
15800 {
15801 /* If we are processing next declarator, comma is expected */
15806 {
15810 }
15811 }
15812 else
15815 /* Parse the init-declarator. */
15817 CP_PARSER_FLAGS_NONE,
15820 function_definition_allowed_p,
15822 declares_class_or_enum,
15824 maybe_range_for_decl,
15828 /* If an error occurred while parsing tentatively, exit quickly.
15829 (That usually happens when in the body of a function; each
15830 statement is treated as a declaration-statement until proven
15831 otherwise.) */
15836 {
15837 /* If the init-declarator-list contains more than one
15838 init-declarator, they shall all form declarations of
15839 variables. */
15843 {
15845 "non-variable %qD in declaration with more than one "
15849 }
15850 }
15854 {
15858 {
15859 /* If the list of declarators contains more than one declarator,
15860 the type of each declared variable is determined as described
15861 above. If the type deduced for the template parameter U is not
15862 the same in each deduction, the program is ill-formed. */
15867 }
15868 else
15870 }
15872 /* Handle function definitions specially. */
15874 {
15875 /* If the next token is a `,', then we are probably
15876 processing something like:
15878 void f() {}, *p;
15880 which is erroneous. */
15882 {
15885 "mixing"
15887 }
15888 /* Otherwise, we're done with the list of declarators. */
15889 else
15890 {
15894 }
15895 }
15898 /* The next token should be either a `,' or a `;'. */
15900 /* If it's a `,', there are more declarators to come. */
15903 /* If it's a `;', we are done. */
15907 {
15912 }
15913 /* Anything else is an error. */
15914 else
15915 {
15916 /* If we have already issued an error message we don't need
15917 to issue another one. */
15919 /* grokfndecl sets DECL_INITIAL to error_mark_node for
15920 functions. */
15924 /* Skip tokens until we reach the end of the statement. */
15926 /* If the next token is now a `;', consume it. */
15930 }
15931 /* After the first time around, a function-definition is not
15932 allowed -- even if it was OK at first. For example:
15934 int i, f() {}
15936 is not valid. */
15938 }
15940 /* Issue an error message if no declarators are present, and the
15941 decl-specifier-seq does not itself declare a class or
15942 enumeration: [dcl.dcl]/3. */
15944 {
15946 {
15950 /* Ensure an error is issued anyway when finish_decltype_type,
15951 called via cp_parser_decl_specifier_seq, returns a class or
15952 an enumeration (c++/51786). */
15955 }
15956 /* Perform any deferred access checks. */
15958 }
15960 /* Consume the `;'. */
15961 finish:
15965 {
15971 }
15973 done:
15976 }
15978 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
15979 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15980 initializer ; */
15982 static tree
15987 {
15992 /* Parse the identifier-list. */
15996 {
16004 }
16008 {
16014 else
16015 {
16018 }
16019 }
16023 "structured bindings only available with "
16026 tree pushed_scope;
16033 NULL_TREE);
16040 cp_expr e;
16041 cp_decl_specifier_seq decl_specs;
16048 {
16052 else
16053 {
16056 }
16057 tree elt_pushed_scope;
16063 {
16064 /* Ensure we've diagnosed redeclaration if we aren't creating
16065 a new VAR_DECL. */
16068 }
16069 else
16073 }
16076 {
16079 }
16083 {
16091 || (is_direct_init
16094 {
16098 }
16101 {
16107 }
16108 }
16110 {
16113 /* Ensure DECL_VALUE_EXPR is created for all the decls but
16114 the underlying DECL. */
16116 }
16122 {
16125 }
16128 }
16130 /* Names of storage classes. */
16133 cp_storage_class_name[] = {
16135 };
16137 /* Parse a decl-specifier-seq.
16139 decl-specifier-seq:
16140 decl-specifier-seq [opt] decl-specifier
16141 decl-specifier attribute-specifier-seq [opt] (C++11)
16143 decl-specifier:
16144 storage-class-specifier
16145 type-specifier
16146 function-specifier
16147 friend
16148 typedef
16150 GNU Extension:
16152 decl-specifier:
16153 attributes
16155 Concepts Extension:
16157 decl-specifier:
16158 concept
16160 Set *DECL_SPECS to a representation of the decl-specifier-seq.
16162 The parser flags FLAGS is used to control type-specifier parsing.
16164 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
16165 flags:
16167 1: one of the decl-specifiers is an elaborated-type-specifier
16168 (i.e., a type declaration)
16169 2: one of the decl-specifiers is an enum-specifier or a
16170 class-specifier (i.e., a type definition)
16172 */
16174 static void
16176 cp_parser_flags flags,
16179 {
16183 cp_decl_spec ds;
16185 /* Clear DECL_SPECS. */
16188 /* Assume no class or enumeration type is declared. */
16191 /* Keep reading specifiers until there are no more to read. */
16193 {
16198 /* Peek at the next token. */
16201 /* Save the first token of the decl spec list for error
16202 reporting. */
16205 /* Handle attributes. */
16208 {
16209 /* Parse the attributes. */
16212 /* In a sequence of declaration specifiers, c++11 attributes
16213 appertain to the type that precede them. In that case
16214 [dcl.spec]/1 says:
16216 The attribute-specifier-seq affects the type only for
16217 the declaration it appears in, not other declarations
16218 involving the same type.
16220 But for now let's force the user to position the
16221 attribute either at the beginning of the declaration or
16222 after the declarator-id, which would clearly mean that it
16223 applies to the declarator. */
16225 {
16227 /* The c++11 attribute is at the beginning of the
16228 declaration. It appertains to the entity being
16230 else
16231 {
16233 {
16236 }
16238 {
16239 /* This is an attribute following a
16240 class-specifier. */
16245 }
16246 else
16247 {
16248 decl_specs->std_attributes
16252 }
16254 }
16255 }
16257 decl_specs->attributes
16262 }
16263 /* Special case for "this" specifier, indicating a parm is an xobj parm.
16264 The "this" specifier must be the first specifier in the declaration,
16265 after any attributes. */
16267 {
16271 }
16273 /* Assume we will find a decl-specifier keyword. */
16275 /* If the next token is an appropriate keyword, we can simply
16276 add it to the list. */
16278 {
16279 /* decl-specifier:
16280 friend
16281 constexpr
16282 constinit */
16285 {
16290 }
16291 else
16292 {
16294 /* Consume the token. */
16296 }
16321 /* Warn for concept as a decl-specifier. We'll rewrite these as
16322 concept declarations later. */
16324 {
16329 else
16332 }
16334 /* In C++20 a concept definition is just 'concept name = expr;'
16335 Support that syntax as a TS extension by pretending we've seen
16336 the 'bool' specifier. */
16340 {
16344 }
16347 /* function-specifier:
16348 inline
16349 virtual
16350 explicit */
16357 /* decl-specifier:
16358 typedef */
16361 /* Consume the token. */
16367 /* A constructor declarator cannot appear in a typedef. */
16369 /* The "typedef" keyword can only occur in a declaration; we
16370 may as well commit at this point. */
16374 {
16384 }
16387 /* storage-class-specifier:
16388 auto
16389 register
16390 static
16391 extern
16392 mutable
16394 GNU Extension:
16395 thread */
16398 {
16399 /* Consume the token. */
16402 /* Complain about `auto' as a storage specifier, if
16403 we're complaining about C++0x compatibility. */
16407 "%<auto%> changes meaning in C++11; "
16410 /* Set the storage class anyway. */
16412 token);
16413 }
16414 else
16415 /* C++0x auto type-specifier. */
16423 /* Consume the token. */
16426 token);
16429 /* Consume the token. */
16435 /* We did not yet find a decl-specifier yet. */
16438 }
16450 {
16456 "%qD only valid in lambda with %<-std=c++23%> or "
16458 }
16463 /* Constructors are a special case. The `S' in `S()' is not a
16464 decl-specifier; it is the beginning of the declarator. */
16465 constructor_p
16466 = (!found_decl_spec
16467 && constructor_possible_p
16468 && (cp_parser_constructor_declarator_p
16470 ds_friend))));
16472 /* If we don't have a DECL_SPEC yet, then we must be looking at
16473 a type-specifier. */
16475 {
16478 tree type_spec;
16483 type_spec
16485 decl_specs,
16491 /* If this type-specifier referenced a user-defined type
16492 (a typedef, class-name, etc.), then we can't allow any
16493 more such type-specifiers henceforth.
16495 [dcl.spec]
16497 The longest sequence of decl-specifiers that could
16498 possibly be a type name is taken as the
16499 decl-specifier-seq of a declaration. The sequence shall
16500 be self-consistent as described below.
16502 [dcl.type]
16504 As a general rule, at most one type-specifier is allowed
16505 in the complete decl-specifier-seq of a declaration. The
16506 only exceptions are the following:
16508 -- const or volatile can be combined with any other
16509 type-specifier.
16511 -- signed or unsigned can be combined with char, long,
16512 short, or int.
16514 -- ..
16516 Example:
16518 typedef char* Pc;
16519 void g (const int Pc);
16521 Here, Pc is *not* part of the decl-specifier seq; it's
16522 the declarator. Therefore, once we see a type-specifier
16523 (other than a cv-qualifier), we forbid any additional
16524 user-defined types. We *do* still allow things like `int
16525 int' to be considered a decl-specifier-seq, and issue the
16526 error message later. */
16529 /* A constructor declarator cannot follow a type-specifier. */
16531 {
16539 }
16540 }
16542 /* If we still do not have a DECL_SPEC, then there are no more
16543 decl-specifiers. */
16548 {
16552 "standard attributes must precede the decl-specifiers to "
16553 "apply to the declaration, or follow them to apply to "
16555 }
16558 /* After we see one decl-specifier, further decl-specifiers are
16559 always optional. */
16561 }
16563 /* Don't allow a friend specifier with a class definition. */
16568 }
16570 /* Parse an (optional) storage-class-specifier.
16572 storage-class-specifier:
16573 auto
16574 register
16575 static
16576 extern
16577 mutable
16579 GNU Extension:
16581 storage-class-specifier:
16582 thread
16584 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
16586 static tree
16588 {
16590 {
16594 /* Fall through for C++98. */
16602 /* Consume the token. */
16607 }
16608 }
16610 /* Parse an (optional) function-specifier.
16612 function-specifier:
16613 inline
16614 virtual
16615 explicit
16617 C++20 Extension:
16618 explicit(constant-expression)
16620 Returns an IDENTIFIER_NODE corresponding to the keyword used.
16621 Updates DECL_SPECS, if it is non-NULL. */
16623 static tree
16626 {
16629 {
16635 /* 14.5.2.3 [temp.mem]
16637 A member function template shall not be virtual. */
16641 else
16646 {
16648 /* If we see '(', it's C++20 explicit(bool). */
16649 tree expr;
16651 {
16652 matching_parens parens;
16655 /* New types are not allowed in an explicit-specifier. */
16658 parser->type_definition_forbidden_message
16663 "%<explicit(bool)%> only available with %<-std=c++20%> "
16666 /* Parse the constant-expression. */
16669 /* Restore the saved message. */
16672 }
16673 else
16674 /* The explicit-specifier explicit without a constant-expression is
16675 equivalent to the explicit-specifier explicit(true). */
16678 /* [dcl.fct.spec]
16679 "the constant-expression, if supplied, shall be a contextually
16680 converted constant expression of type bool." */
16682 /* We could evaluate it -- mark the decl as appropriate. */
16688 /* The expression was value-dependent. Remember it so that we can
16689 substitute it later. */
16692 }
16696 }
16698 /* Consume the token. */
16700 }
16702 /* Parse a linkage-specification.
16704 linkage-specification:
16705 extern string-literal { declaration-seq [opt] }
16706 extern string-literal declaration */
16708 static void
16710 {
16711 /* Look for the `extern' keyword. */
16712 cp_token *extern_token
16715 /* Look for the string-literal. */
16717 tree linkage;
16720 else
16724 /* Transform the literal into an identifier. If the literal is a
16725 wide-character string, or contains embedded NULs, then we can't
16726 handle it as the user wants. */
16730 {
16732 /* Assume C++ linkage. */
16734 }
16735 else
16738 /* We're now using the new linkage. */
16743 /* Preserve the location of the innermost linkage specification,
16744 tracking the locations of nested specifications via a local. */
16745 location_t saved_location
16747 /* Construct a location ranging from the start of the "extern" to
16748 the end of the string-literal, with the caret at the start, e.g.:
16749 extern "C" {
16750 ^~~~~~~~~~
16751 */
16752 parser->innermost_linkage_specification_location
16757 /* If the next token is a `{', then we're using the first
16758 production. */
16760 {
16764 /* Consume the `{' token. */
16765 matching_braces braces;
16767 /* Parse the declarations. */
16769 /* Look for the closing `}'. */
16771 }
16772 /* Otherwise, there's just one declaration. */
16773 else
16774 {
16777 saved_in_unbraced_linkage_specification_p
16781 parser->in_unbraced_linkage_specification_p
16783 }
16785 /* We're done with the linkage-specification. */
16789 /* Restore location of parent linkage specification, if any. */
16791 }
16793 /* Parse a static_assert-declaration.
16795 static_assert-declaration:
16796 static_assert ( constant-expression , string-literal ) ;
16797 static_assert ( constant-expression ) ; (C++17)
16798 static_assert ( constant-expression, conditional-expression ) ; (C++26)
16800 If MEMBER_P, this static_assert is a class member. */
16802 static void
16804 {
16805 cp_expr condition;
16806 location_t token_loc;
16807 tree message;
16809 /* Peek at the `static_assert' token so we can keep track of exactly
16810 where the static assertion started. */
16813 /* Look for the `static_assert' keyword. */
16815 RT_STATIC_ASSERT))
16818 /* We know we are in a static assertion; commit to any tentative
16819 parse. */
16823 /* Parse the `(' starting the static assertion condition. */
16824 matching_parens parens;
16827 /* Parse the constant-expression. Allow a non-constant expression
16828 here in order to give better diagnostics in finish_static_assert. */
16829 condition
16835 {
16838 "%<static_assert%> without a message "
16840 /* Eat the ')' */
16845 }
16846 else
16847 {
16848 /* Parse the separating `,'. */
16851 /* Parse the message expression. */
16854 {
16862 }
16864 {
16868 "%<static_assert%> with non-string message only "
16874 message);
16875 }
16878 else
16882 /* A `)' completes the static assertion. */
16888 }
16890 /* A semicolon terminates the declaration. */
16893 /* Get the location for the static assertion. Use that of the
16894 condition if available, otherwise, use that of the "static_assert"
16895 token. */
16900 /* Complete the static assertion, which may mean either processing
16901 the static assert now or saving it for template instantiation. */
16904 }
16906 /* Parse the expression in decltype ( expression ). */
16908 static tree
16911 {
16913 tree expr;
16915 /* First, try parsing an id-expression. */
16926 {
16929 cp_id_kind idk;
16933 /* Lookup the name we got back from the id-expression. */
16943 {
16944 /* Complete lookup of the id-expression. */
16945 expr = (finish_id_expression
16958 {
16959 /* We found an id-expression, but it was something that we
16960 should not have found. This is an error, not something
16961 we can recover from, so report the error we found and
16962 we'll recover as gracefully as possible. */
16967 }
16968 }
16973 /* We have an id-expression. */
16975 }
16978 {
16979 /* Abort the id-expression parse. */
16982 /* Parsing tentatively, again. */
16985 /* Parse a class member access. */
16993 /* We have an id-expression. */
16995 }
16998 /* We have parsed the complete id-expression or member access. */
17000 else
17001 {
17002 /* Abort our attempt to parse an id-expression or member access
17003 expression. */
17006 /* Parse a full expression. */
17009 }
17012 }
17014 /* Parse a `decltype' type. Returns the type.
17016 decltype-specifier:
17017 decltype ( expression )
17018 C++14:
17019 decltype ( auto ) */
17021 static tree
17023 {
17028 {
17029 /* Already parsed. */
17032 }
17034 /* Look for the `decltype' token. */
17038 /* Parse the opening `('. */
17039 matching_parens parens;
17043 /* Since we're going to preserve any side-effects from this parse, set up a
17044 firewall to protect our callers from cp_parser_commit_to_tentative_parse
17045 in the expression. */
17048 /* If in_declarator_p, a reparse as an expression might succeed (60361).
17049 Otherwise, commit now for better diagnostics. */
17060 {
17061 /* decltype (auto) */
17064 {
17066 "%<decltype(auto)%> type specifier only available with "
17069 }
17070 }
17071 else
17072 {
17073 /* decltype (expression) */
17075 /* Types cannot be defined in a `decltype' expression. Save away the
17076 old message and set the new one. */
17078 parser->type_definition_forbidden_message
17081 /* The restrictions on constant-expressions do not apply inside
17082 decltype expressions. */
17083 bool saved_integral_constant_expression_p
17085 bool saved_non_integral_constant_expression_p
17089 /* Within a parenthesized expression, a `>' token is always
17090 the greater-than operator. */
17091 bool saved_greater_than_is_operator_p
17095 /* Don't synthesize an implicit template type parameter here. This
17096 could happen with C++23 code like
17098 void f(decltype(new auto{0}));
17100 where we want to deduce the auto right away so that the parameter
17101 is of type 'int *'. */
17105 /* Do not actually evaluate the expression. */
17108 /* Do not warn about problems with the expression. */
17114 /* Go back to evaluating expressions. */
17118 /* The `>' token might be the end of a template-id or
17119 template-parameter-list now. */
17120 parser->greater_than_is_operator_p
17123 /* Restore the old message and the integral constant expression
17124 flags. */
17126 parser->integral_constant_expression_p
17128 parser->non_integral_constant_expression_p
17130 }
17132 /* Parse to the closing `)'. */
17134 {
17138 }
17140 /* If we got a parse error while tentative, bail out now. */
17142 {
17145 }
17148 /* Build auto. */
17150 else
17152 tf_warning_or_error);
17154 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
17155 it again. */
17172 }
17174 /* Special member functions [gram.special] */
17176 /* Parse a conversion-function-id.
17178 conversion-function-id:
17179 operator conversion-type-id
17181 Returns an IDENTIFIER_NODE representing the operator. */
17183 static tree
17185 {
17186 tree type;
17187 tree saved_scope;
17188 tree saved_qualifying_scope;
17189 tree saved_object_scope;
17192 /* Look for the `operator' token. */
17195 /* When we parse the conversion-type-id, the current scope will be
17196 reset. However, we need that information in able to look up the
17197 conversion function later, so we save it here. */
17201 /* We must enter the scope of the class so that the names of
17202 entities declared within the class are available in the
17203 conversion-type-id. For example, consider:
17205 struct S {
17206 typedef int I;
17207 operator I();
17208 };
17210 S::operator I() { ... }
17212 In order to see that `I' is a type-name in the definition, we
17213 must be in the scope of `S'. */
17216 /* Parse the conversion-type-id. */
17218 /* Leave the scope of the class, if any. */
17221 /* Restore the saved scope. */
17225 /* If the TYPE is invalid, indicate failure. */
17229 }
17231 /* Parse a conversion-type-id:
17233 conversion-type-id:
17234 type-specifier-seq conversion-declarator [opt]
17236 Returns the TYPE specified. */
17238 static tree
17240 {
17241 tree attributes;
17242 cp_decl_specifier_seq type_specifiers;
17244 tree type_specified;
17247 /* Parse the attributes. */
17251 parser->type_definition_forbidden_message
17254 /* Parse the type-specifiers. DR 2413 clarifies that `typename' is
17255 optional in conversion-type-id. */
17263 /* If that didn't work, stop. */
17266 /* Parse the conversion-declarator. */
17274 /* Don't give this error when parsing tentatively. This happens to
17275 work because we always parse this definitively once. */
17278 {
17280 {
17283 }
17287 }
17290 }
17292 /* Parse an (optional) conversion-declarator.
17294 conversion-declarator:
17295 ptr-operator conversion-declarator [opt]
17297 */
17301 {
17304 cp_cv_quals cv_quals;
17306 /* We don't know if there's a ptr-operator next, or not. */
17308 /* Try the ptr-operator. */
17311 /* If it worked, look for more conversion-declarators. */
17313 {
17316 /* Parse another optional declarator. */
17319 declarator = cp_parser_make_indirect_declarator
17323 }
17326 }
17328 /* Parse an (optional) ctor-initializer.
17330 ctor-initializer:
17331 : mem-initializer-list */
17333 static void
17335 {
17336 /* If the next token is not a `:', then there is no
17337 ctor-initializer. */
17339 {
17340 /* Do default initialization of any bases and members. */
17344 }
17346 /* Consume the `:' token. */
17348 /* And the mem-initializer-list. */
17350 }
17352 /* Parse a mem-initializer-list.
17354 mem-initializer-list:
17355 mem-initializer ... [opt]
17356 mem-initializer ... [opt] , mem-initializer-list */
17358 static void
17360 {
17365 /* Let the semantic analysis code know that we are starting the
17366 mem-initializer-list. */
17371 /* Loop through the list. */
17373 {
17374 tree mem_initializer;
17377 /* Parse the mem-initializer. */
17379 /* If the next token is a `...', we're expanding member initializers. */
17385 {
17386 /* Consume the `...'. */
17390 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
17391 can be expanded but members cannot. */
17394 {
17399 }
17401 /* Construct the pack expansion type. */
17404 }
17407 {
17411 }
17412 /* Look for a target constructor. */
17416 {
17419 {
17423 }
17425 }
17426 /* Add it to the list, unless it was erroneous. */
17428 {
17431 }
17432 /* If the next token is not a `,', we're done. */
17435 /* Consume the `,' token. */
17437 }
17439 /* Perform semantic analysis. */
17442 }
17444 /* Parse a mem-initializer.
17446 mem-initializer:
17447 mem-initializer-id ( expression-list [opt] )
17448 mem-initializer-id braced-init-list
17450 GNU extension:
17452 mem-initializer:
17453 ( expression-list [opt] )
17455 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
17456 class) or FIELD_DECL (for a non-static data member) to initialize;
17457 the TREE_VALUE is the expression-list. An empty initialization
17458 list is represented by void_list_node. */
17460 static tree
17462 {
17463 tree mem_initializer_id;
17464 tree expression_list;
17465 tree member;
17468 /* Find out what is being initialized. */
17470 {
17474 }
17475 else
17476 {
17480 }
17486 {
17492 }
17493 else
17494 {
17506 }
17519 /* We can't attach the source location of this initializer directly to
17520 the list node, so we instead attach it to a dummy EMPTY_CLASS_EXPR
17521 within the TREE_TYPE of the list node. */
17522 location_t loc
17529 }
17531 /* Parse a mem-initializer-id.
17533 mem-initializer-id:
17534 :: [opt] nested-name-specifier [opt] class-name
17535 decltype-specifier (C++11)
17536 identifier
17538 Returns a TYPE indicating the class to be initialized for the first
17539 production (and the second in C++11). Returns an IDENTIFIER_NODE
17540 indicating the data member to be initialized for the last production. */
17542 static tree
17544 {
17548 tree id;
17552 /* `typename' is not allowed in this context ([temp.res]). */
17554 {
17556 "keyword %<typename%> not allowed in this context (a qualified "
17559 }
17560 /* Look for the optional `::' operator. */
17561 global_scope_p
17565 /* Look for the optional nested-name-specifier. The simplest way to
17566 implement:
17568 [temp.res]
17570 The keyword `typename' is not permitted in a base-specifier or
17571 mem-initializer; in these contexts a qualified name that
17572 depends on a template-parameter is implicitly assumed to be a
17573 type name.
17575 is to assume that we have seen the `typename' keyword at this
17576 point. */
17577 nested_name_specifier_p
17586 /* If there is a `::' operator or a nested-name-specifier, then we
17587 are definitely looking for a class-name. */
17592 typename_type,
17596 /* Otherwise, we could also be looking for an ordinary identifier. */
17599 /* Try a decltype-specifier. */
17601 else
17602 /* Otherwise, try a class-name. */
17606 none_type,
17610 /* If we found one, we're done. */
17613 /* Otherwise, look for an ordinary identifier. */
17615 }
17617 /* Overloading [gram.over] */
17619 /* Parse an operator-function-id.
17621 operator-function-id:
17622 operator operator
17624 Returns an IDENTIFIER_NODE for the operator which is a
17625 human-readable spelling of the identifier, e.g., `operator +'. */
17627 static cp_expr
17629 {
17631 /* Look for the `operator' keyword. */
17634 /* And then the name of the operator itself. */
17636 }
17638 /* Return an identifier node for a user-defined literal operator.
17639 The suffix identifier is chained to the operator name identifier. */
17641 tree
17643 {
17644 tree identifier;
17652 }
17654 /* Parse an operator.
17656 operator:
17657 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
17658 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
17659 || ++ -- , ->* -> () []
17661 GNU Extensions:
17663 operator:
17664 <? >? <?= >?=
17666 Returns an IDENTIFIER_NODE for the operator which is a
17667 human-readable spelling of the identifier, e.g., `operator +'. */
17669 static cp_expr
17671 {
17676 /* Peek at the next token. */
17681 /* Figure out which operator we have. */
17686 {
17688 {
17689 /* The keyword should be either `new', `delete' or `co_await'. */
17696 else
17699 /* Consume the `new', `delete' or co_await token. */
17702 /* Peek at the next token. */
17704 /* If it's a `[' token then this is the array variant of the
17705 operator. */
17708 {
17709 /* Consume the `[' token. */
17711 /* Look for the `]' token. */
17716 }
17719 }
17882 /* Consume the `?'. */
17884 /* Look for the matching `:'. */
17890 {
17891 /* Consume the `('. */
17892 matching_parens parens;
17894 /* Look for the matching `)'. */
17901 }
17904 /* Consume the `['. */
17906 /* Look for the matching `]'. */
17917 /* FALLTHRU */
17926 {
17927 tree string_tree;
17933 /* Consume the string. */
17939 {
17943 }
17944 else
17945 {
17947 /* Look for the suffix identifier. */
17950 {
17953 }
17955 {
17959 }
17960 else
17961 {
17964 }
17965 }
17970 {
17973 }
17976 {
17979 }
17981 {
17984 }
17985 /* Generate a location of the form:
17986 "" _suffix_identifier
17987 ^~~~~~~~~~~~~~~~~~~~~
17988 with caret == start at the start token, finish at the end of the
17989 suffix identifier. */
17990 location_t combined_loc
17993 }
17996 /* Anything else is an error. */
17998 }
18000 /* If we have selected an identifier, we need to consume the
18001 operator token. */
18003 {
18007 }
18008 /* Otherwise, no valid operator name was present. */
18009 else
18010 {
18013 }
18017 }
18019 /* Parse a template-declaration.
18021 template-declaration:
18022 export [opt] template < template-parameter-list > declaration
18024 If MEMBER_P is TRUE, this template-declaration occurs within a
18025 class-specifier.
18027 The grammar rule given by the standard isn't correct. What
18028 is really meant is:
18030 template-declaration:
18031 export [opt] template-parameter-list-seq
18032 decl-specifier-seq [opt] init-declarator [opt] ;
18033 export [opt] template-parameter-list-seq
18034 function-definition
18036 template-parameter-list-seq:
18037 template-parameter-list-seq [opt]
18038 template < template-parameter-list >
18040 Concept Extensions:
18042 template-parameter-list-seq:
18043 template < template-parameter-list > requires-clause [opt]
18045 requires-clause:
18046 requires logical-or-expression */
18048 static void
18050 {
18051 /* Check for `export'. */
18053 {
18054 /* Consume the `export' token. */
18056 /* Warn that this use of export is deprecated. */
18061 else
18063 }
18066 }
18068 /* Parse a template-parameter-list.
18070 template-parameter-list:
18071 template-parameter
18072 template-parameter-list , template-parameter
18074 Returns a TREE_LIST. Each node represents a template parameter.
18075 The nodes are connected via their TREE_CHAINs. */
18077 static tree
18079 {
18082 /* Don't create wrapper nodes within a template-parameter-list,
18083 since we don't want to have different types based on the
18084 spelling location of constants and decls within them. */
18085 auto_suppress_location_wrappers sentinel;
18089 /* The loop below parses the template parms. We first need to know
18090 the total number of template parms to be able to compute proper
18091 canonical types of each dependent type. So after the loop, when
18092 we know the total number of template parms,
18093 end_template_parm_list computes the proper canonical types and
18094 fixes up the dependent types accordingly. */
18096 {
18097 tree parameter;
18100 location_t parm_loc;
18102 /* Parse the template-parameter. */
18107 /* Add it to the list. */
18110 parm_loc,
18111 parameter,
18112 is_non_type,
18113 is_parameter_pack);
18114 else
18115 {
18118 }
18120 /* If the next token is not a `,', we're done. */
18123 /* Otherwise, consume the `,' token. */
18125 }
18128 }
18130 /* Parse a introduction-list.
18132 introduction-list:
18133 introduced-parameter
18134 introduction-list , introduced-parameter
18136 introduced-parameter:
18137 ...[opt] identifier
18139 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
18140 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
18141 WILDCARD_DECL will also have DECL_NAME set and token location in
18142 DECL_SOURCE_LOCATION. */
18144 static tree
18146 {
18150 {
18159 /* Build placeholder. */
18167 /* If the next token is not a `,', we're done. */
18170 /* Otherwise, consume the `,' token. */
18172 }
18174 /* Convert the vec into a TREE_VEC. */
18177 tree parm;
18183 }
18185 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
18186 is an abstract declarator. */
18190 {
18195 }
18197 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
18198 is an abstract declarator. */
18202 {
18206 else
18208 }
18210 /* Returns true if TYPE would declare a constrained constrained-parameter. */
18214 {
18219 }
18221 /* Returns true if PARM declares a constrained-parameter. */
18225 {
18227 }
18229 /* Check that the type parameter is only a declarator-id, and that its
18230 type is not cv-qualified. */
18232 bool
18235 {
18240 {
18243 }
18245 /* Don't allow cv-qualified type parameters. */
18248 {
18251 }
18254 }
18256 /* Finish parsing/processing a template type parameter and checking
18257 various restrictions. */
18261 tree id,
18263 {
18266 else
18268 }
18270 static tree
18272 {
18273 /* FIXME: This should probably be copied, and we may need to adjust
18274 the template parameter depths. */
18284 }
18286 /* Finish parsing/processing a template template parameter by borrowing
18287 the template parameter list from the prototype parameter. */
18289 static tree
18291 tree proto,
18292 tree id,
18294 {
18298 }
18300 /* Create a new non-type template parameter from the given PARM
18301 declarator. */
18303 static tree
18306 {
18312 }
18314 /* Build a constrained template parameter based on the PARMDECL
18315 declarator. The type of PARMDECL is the constrained type, which
18316 refers to the prototype template parameter that ultimately
18317 specifies the type of the declared parameter. */
18319 static tree
18323 {
18329 /* Build the parameter. Return an error if the declarator was invalid. */
18330 tree parm;
18335 parmdecl);
18336 else
18341 /* Finish the parameter decl and create a node attaching the
18342 default argument and constraint. */
18347 }
18349 /* Returns true if the parsed type actually represents the declaration
18350 of a type template-parameter. */
18352 static bool
18354 {
18357 }
18359 /* Returns true if the parsed type actually represents the declaration of
18360 a template template-parameter. */
18362 static bool
18364 {
18367 }
18369 /* Parse a default argument for a type template-parameter.
18370 Note that diagnostics are handled in cp_parser_template_parameter. */
18372 static tree
18374 {
18377 /* Consume the `=' token. */
18382 /* Tell cp_parser_lambda_expression this is a default argument. */
18386 /* Parse the default-argument. */
18389 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18390 NULL);
18394 {
18398 }
18401 }
18403 /* Parse a default argument for a template template-parameter. */
18405 static tree
18407 {
18412 /* Consume the `='. */
18414 /* Parse the id-expression. */
18416 /* save token before parsing the id-expression, for error
18417 reporting */
18419 tree default_argument
18427 /* If the id-expression was a template-id that refers to
18428 a template-class, we already have the declaration here,
18429 so no further lookup is needed. */
18430 ;
18431 else
18432 /* Look up the name. */
18433 default_argument
18435 none_type,
18441 /* See if the default argument is valid. */
18445 }
18447 /* Parse a template-parameter.
18449 template-parameter:
18450 type-parameter
18451 parameter-declaration
18453 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
18454 the parameter. The TREE_PURPOSE is the default value, if any.
18455 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
18456 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
18457 set to true iff this parameter is a parameter pack. */
18459 static tree
18462 {
18465 tree parm;
18467 /* Assume it is a type parameter or a template parameter. */
18469 /* Assume it not a parameter pack. */
18471 /* Peek at the next token. */
18473 /* If it is `template', we have a type-parameter. */
18476 /* If it is `class' or `typename' we do not know yet whether it is a
18477 type parameter or a non-type parameter. Consider:
18479 template <typename T, typename T::X X> ...
18481 or:
18483 template <class C, class D*> ...
18485 Here, the first parameter is a type parameter, and the second is
18486 a non-type parameter. We can tell by looking at the token after
18487 the identifier -- if it is a `,', `=', or `>' then we have a type
18488 parameter. */
18490 {
18491 /* Peek at the token after `class' or `typename'. */
18493 /* If it's an ellipsis, we have a template type parameter
18494 pack. */
18497 /* If it's an identifier, skip it. */
18500 /* Now, see if the token looks like the end of a template
18501 parameter. */
18506 }
18508 /* Otherwise, it is a non-type parameter or a constrained parameter.
18510 [temp.param]
18512 When parsing a default template-argument for a non-type
18513 template-parameter, the first non-nested `>' is taken as the end
18514 of the template parameter-list rather than a greater-than
18515 operator. */
18516 parameter_declarator
18518 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18525 /* If the parameter declaration is marked as a parameter pack, set
18526 *IS_PARAMETER_PACK to notify the caller. */
18531 {
18532 /* Can happen in some cases of erroneous input (c++/34892). */
18534 /* Consume the `...' for better error recovery. */
18536 }
18538 /* The parameter may have been constrained type parameter. */
18541 parameter_declarator,
18542 is_non_type);
18544 // Now we're sure that the parameter is a non-type parameter.
18555 }
18557 /* Parse a type-parameter.
18559 type-parameter:
18560 class identifier [opt]
18561 class identifier [opt] = type-id
18562 typename identifier [opt]
18563 typename identifier [opt] = type-id
18564 template < template-parameter-list > class identifier [opt]
18565 template < template-parameter-list > class identifier [opt]
18566 = id-expression
18568 GNU Extension (variadic templates):
18570 type-parameter:
18571 class ... identifier [opt]
18572 typename ... identifier [opt]
18574 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
18575 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
18576 the declaration of the parameter.
18578 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
18580 static tree
18582 {
18584 tree parameter;
18586 /* Look for a keyword to tell us what kind of parameter this is. */
18592 {
18595 {
18596 tree identifier;
18597 tree default_argument;
18599 /* If the next token is an ellipsis, we have a template
18600 argument pack. */
18602 {
18603 /* Consume the `...' token. */
18608 }
18610 /* If the next token is an identifier, then it names the
18611 parameter. */
18614 else
18617 /* Create the parameter. */
18620 /* If the next token is an `=', we have a default argument. */
18622 {
18623 default_argument
18626 /* Template parameter packs cannot have default
18627 arguments. */
18629 {
18632 "template parameter pack %qD cannot have a "
18634 else
18636 "template parameter packs cannot have "
18639 }
18642 }
18643 else
18646 /* Create the combined representation of the parameter and the
18647 default argument. */
18649 }
18653 {
18654 tree identifier;
18655 tree default_argument;
18657 /* Look for the `<'. */
18659 /* Parse the template-parameter-list. */
18661 /* Look for the `>'. */
18664 /* If template requirements are present, parse them. */
18666 {
18671 }
18673 /* Look for the `class' or 'typename' keywords. */
18675 /* If the next token is an ellipsis, we have a template
18676 argument pack. */
18678 {
18679 /* Consume the `...' token. */
18684 }
18685 /* If the next token is an `=', then there is a
18686 default-argument. If the next token is a `>', we are at
18687 the end of the parameter-list. If the next token is a `,',
18688 then we are at the end of this parameter. */
18692 {
18694 /* Treat invalid names as if the parameter were nameless. */
18697 }
18698 else
18701 /* Create the template parameter. */
18703 identifier);
18705 /* If the next token is an `=', then there is a
18706 default-argument. */
18708 {
18709 default_argument
18712 /* Template parameter packs cannot have default
18713 arguments. */
18715 {
18718 "template parameter pack %qD cannot "
18720 identifier);
18721 else
18725 }
18726 }
18727 else
18730 /* Create the combined representation of the parameter and the
18731 default argument. */
18733 }
18739 }
18742 }
18744 /* Parse a template-id.
18746 template-id:
18747 template-name < template-argument-list [opt] >
18749 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
18750 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
18751 returned. Otherwise, if the template-name names a function, or set
18752 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
18753 names a class, returns a TYPE_DECL for the specialization.
18755 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
18756 uninstantiated templates. */
18758 static tree
18764 {
18765 tree templ;
18766 tree arguments;
18767 tree template_id;
18772 /* If the next token corresponds to a template-id, there is no need
18773 to reparse it. */
18777 {
18780 }
18782 /* Avoid performing name lookup if there is no possibility of
18783 finding a template-id. */
18786 && !cp_parser_nth_token_starts_template_argument_list_p
18788 {
18791 }
18793 /* Remember where the template-id starts. */
18799 /* Parse the template-name. */
18802 check_dependency_p,
18803 is_declaration,
18804 tag_type,
18807 /* Push any access checks inside the firewall we're about to create. */
18813 /* Since we're going to preserve any side-effects from this parse, set up a
18814 firewall to protect our callers from cp_parser_commit_to_tentative_parse
18815 in the template arguments. */
18819 /* If we find the sequence `[:' after a template-name, it's probably
18820 a digraph-typo for `< ::'. Substitute the tokens and check if we can
18821 parse correctly the argument list. */
18828 {
18830 /* Change `:' into `::'. */
18832 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
18833 CPP_LESS. */
18836 /* Parse the arguments. */
18839 {
18840 /* If we couldn't parse an argument list, then we revert our changes
18841 and return simply an error. Maybe this is not a template-id
18842 after all. */
18847 }
18848 /* Otherwise, emit an error about the invalid digraph, but continue
18849 parsing because we got our argument list. */
18852 {
18855 "%<<:%> is an alternate spelling for %<[%>."
18858 {
18860 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
18863 }
18864 }
18865 }
18866 else
18867 {
18868 /* Look for the `<' that starts the template-argument-list. */
18870 {
18873 }
18874 /* Parse the arguments. */
18879 && !template_keyword_p
18882 {
18883 /* This didn't go well. */
18885 {
18886 /* C++20 says that "function-name < a;" is now ill-formed. */
18888 {
18891 "operand of %<<%> is ill-formed in C++20; wrap the "
18893 }
18894 else
18895 /* We expect "f<targs>" to be followed by "(args)". */
18899 /* Purge all subsequent tokens. */
18901 }
18902 else
18906 }
18907 }
18909 /* Set the location to be of the form:
18910 template-name < template-argument-list [opt] >
18911 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
18912 with caret == start at the start of the template-name,
18913 ranging until the closing '>'. */
18914 location_t combined_loc
18917 /* Check for concepts autos where they don't belong. We could
18918 identify types in some cases of identifier TEMPL, looking ahead
18919 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
18920 types. We reject them in functions, but if what we have is an
18921 identifier, even with none_type we can't conclude it's NOT a
18922 type, we have to wait for template substitution. */
18925 /* Build a representation of the specialization. */
18928 TEMPLATE_ID_EXPR,
18932 {
18933 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
18934 template (rather than some instantiation thereof) only if
18935 is not nested within some other construct. For example, in
18936 "template <typename T> void f(T) { A<T>::", A<T> is just an
18937 instantiation of A. */
18938 bool entering_scope
18941 template_id
18943 }
18945 {
18946 /* The caller will decide whether this is a concept check or type
18947 constraint. */
18950 }
18952 {
18956 }
18959 {
18960 /* Some type template in dependent scope. */
18963 TEMPLATE_ID_EXPR,
18966 }
18967 else
18968 {
18969 /* If it's not a class-template or a template-template, it should be
18970 a function-template. */
18976 }
18978 /* If parsing tentatively, replace the sequence of tokens that makes
18979 up the template-id with a CPP_TEMPLATE_ID token. That way,
18980 should we re-parse the token stream, we will not have to repeat
18981 the effort required to do the parse, nor will we issue duplicate
18982 error messages about problems during instantiation of the
18983 template. */
18985 /* Don't do this if we had a parse error in a declarator; re-parsing
18986 might succeed if a name changes meaning (60361). */
18990 {
18991 /* Reset the contents of the START_OF_ID token. */
18995 /* Retrieve any deferred checks. Do not pop this access checks yet
18996 so the memory will not be reclaimed during token replacing below. */
19003 /* Purge all subsequent tokens. */
19006 /* ??? Can we actually assume that, if template_id ==
19007 error_mark_node, we will have issued a diagnostic to the
19008 user, as opposed to simply marking the tentative parse as
19009 failed? */
19012 }
19016 }
19018 /* Like cp_parser_template_id, called in non-type context. */
19020 static tree
19025 {
19030 /* We didn't check the arguments in cp_parser_template_id; do that now. */
19033 }
19035 /* Parse a template-name.
19037 template-name:
19038 identifier
19040 The standard should actually say:
19042 template-name:
19043 identifier
19044 operator-function-id
19046 A defect report has been filed about this issue.
19048 A conversion-function-id cannot be a template name because they cannot
19049 be part of a template-id. In fact, looking at this code:
19051 a.operator K<int>()
19053 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
19054 It is impossible to call a templated conversion-function-id with an
19055 explicit argument list, since the only allowed template parameter is
19056 the type to which it is converting.
19058 If TEMPLATE_KEYWORD_P is true, then we have just seen the
19059 `template' keyword, in a construction like:
19061 T::template f<3>()
19063 In that case `f' is taken to be a template-name, even though there
19064 is no way of knowing for sure.
19066 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
19067 name refers to a set of overloaded functions, at least one of which
19068 is a template, or an IDENTIFIER_NODE with the name of the template,
19069 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
19070 names are looked up inside uninstantiated templates. */
19072 static tree
19079 {
19080 tree identifier;
19081 tree decl;
19084 /* If the next token is `operator', then we have either an
19085 operator-function-id or a conversion-function-id. */
19087 {
19088 /* We don't know whether we're looking at an
19089 operator-function-id or a conversion-function-id. */
19091 /* Try an operator-function-id. */
19093 /* If that didn't work, try a conversion-function-id. */
19095 {
19098 }
19099 }
19100 /* Look for the identifier. */
19101 else
19104 /* If we didn't find an identifier, we don't have a template-id. */
19108 /* If the name immediately followed the `template' keyword, then it
19109 is a template-name. However, if the next token is not `<', then
19110 we do not treat it as a template-name, since it is not being used
19111 as part of a template-id. This enables us to handle constructs
19112 like:
19114 template <typename T> struct S { S(); };
19115 template <typename T> S<T>::S();
19117 correctly. We would treat `S' as a template -- if it were `S<T>'
19118 -- but we do not if there is no `<'. */
19122 {
19123 /* In a declaration, in a dependent context, we pretend that the
19124 "template" keyword was present in order to improve error
19125 recovery. For example, given:
19127 template <typename T> void f(T::X<int>);
19129 we want to treat "X<int>" as a template-id. */
19131 && !template_keyword_p
19133 && check_dependency_p
19135 /* Do not do this for dtors (or ctors), since they never
19136 need the template keyword before their name. */
19138 {
19141 /* Explain what went wrong. */
19143 identifier);
19146 /* If parsing tentatively, find the location of the "<" token. */
19149 /* Parse the template arguments so that we can issue error
19150 messages about them. */
19153 /* Skip tokens until we find a good place from which to
19154 continue parsing. */
19159 /* If parsing tentatively, permanently remove the
19160 template argument list. That will prevent duplicate
19161 error messages from being issued about the missing
19162 "template" keyword. */
19169 }
19171 /* If the "template" keyword is present, then there is generally
19172 no point in doing name-lookup, so we just return IDENTIFIER.
19173 But, if the qualifying scope is non-dependent then we can
19174 (and must) do name-lookup normally. */
19176 {
19182 {
19183 /* We're optimizing away the call to cp_parser_lookup_name, but
19184 we still need to do this. */
19188 }
19189 }
19190 }
19192 /* cp_parser_lookup_name clears OBJECT_TYPE. */
19196 /* Look up the name. */
19198 tag_type,
19201 check_dependency_p,
19207 /* 13.3 [temp.names] A < is interpreted as the delimiter of a
19208 template-argument-list if it follows a name that is not a
19209 conversion-function-id and
19210 - that follows the keyword template or a ~ after a nested-name-specifier or
19211 in a class member access expression, or
19212 - for which name lookup finds the injected-class-name of a class template
19213 or finds any declaration of a template, or
19214 - that is an unqualified name for which name lookup either finds one or
19215 more functions or finds nothing, or
19216 - that is a terminal name in a using-declarator (9.9), in a declarator-id
19217 (9.3.4), or in a type-only context other than a nested-name-specifier
19218 (13.8). */
19220 /* Handle injected-class-name. */
19223 /* If DECL is a template, then the name was a template-name. */
19225 {
19228 {
19230 tree attr;
19233 else
19236 {
19239 }
19242 {
19245 }
19246 }
19247 }
19248 else
19249 {
19250 /* Look through an overload set for any templates. */
19258 /* "an unqualified name for which name lookup either finds one or more
19259 functions or finds nothing". */
19262 && !scope
19265 {
19266 /* The "more functions" case. Just use the OVERLOAD as normally.
19267 We don't use is_overloaded_fn here to avoid considering
19268 BASELINKs. */
19270 /* Name lookup found one function. */
19272 /* Name lookup found nothing. */
19275 }
19277 /* "that follows the keyword template"..."in a type-only context" */
19285 {
19286 /* The name does not name a template. */
19289 }
19292 /* cp_parser_template_id can only handle some TYPE_DECLs. */
19295 /* Repeat the lookup at instantiation time. */
19297 }
19300 }
19302 /* Parse a template-argument-list.
19304 template-argument-list:
19305 template-argument ... [opt]
19306 template-argument-list , template-argument ... [opt]
19308 Returns a TREE_VEC containing the arguments. */
19310 static tree
19312 {
19317 /* Don't create location wrapper nodes within a template-argument-list. */
19318 auto_suppress_location_wrappers sentinel;
19322 /* Even if the template-id appears in an integral
19323 constant-expression, the contents of the argument list do
19324 not. */
19330 /* Parse the arguments. */
19332 do
19333 {
19335 /* Consume the comma. */
19338 /* Parse the template-argument. */
19341 /* If the next token is an ellipsis, we're expanding a template
19342 argument pack. */
19344 {
19346 {
19350 }
19351 /* Consume the `...' token. */
19354 /* Make the argument into a TYPE_PACK_EXPANSION or
19355 EXPR_PACK_EXPANSION. */
19357 }
19360 }
19375 }
19377 /* Parse a template-argument.
19379 template-argument:
19380 assignment-expression
19381 type-id
19382 id-expression
19384 The representation is that of an assignment-expression, type-id, or
19385 id-expression -- except that the qualified id-expression is
19386 evaluated, so that the value returned is either a DECL or an
19387 OVERLOAD.
19389 Although the standard says "assignment-expression", it forbids
19390 throw-expressions or assignments in the template argument.
19391 Therefore, we use "conditional-expression" instead. */
19393 static tree
19395 {
19396 tree argument;
19402 cp_id_kind idk;
19404 /* There's really no way to know what we're looking at, so we just
19405 try each alternative in order.
19407 [temp.arg]
19409 In a template-argument, an ambiguity between a type-id and an
19410 expression is resolved to a type-id, regardless of the form of
19411 the corresponding template-parameter.
19413 Therefore, we try a type-id first. */
19416 /* If there was no error parsing the type-id but the next token is a
19417 '>>', our behavior depends on which dialect of C++ we're
19418 parsing. In C++98, we probably found a typo for '> >'. But there
19419 are type-id which are also valid expressions. For instance:
19421 struct X { int operator >> (int); };
19422 template <int V> struct Foo {};
19423 Foo<X () >> 5> r;
19425 Here 'X()' is a valid type-id of a function type, but the user just
19426 wanted to write the expression "X() >> 5". Thus, we remember that we
19427 found a valid type-id, but we still try to parse the argument as an
19428 expression to see what happens.
19430 In C++0x, the '>>' will be considered two separate '>'
19431 tokens. */
19435 /* Similarly for >= which
19436 cp_parser_next_token_ends_template_argument_p treats for
19437 diagnostics purposes as mistyped > =, but can be valid
19438 after a type-id. */
19440 {
19443 }
19444 else
19445 {
19446 /* If the next token isn't a `,' or a `>', then this argument wasn't
19447 really finished. This means that the argument is not a valid
19448 type-id. */
19451 /* If that worked, we're done. */
19454 }
19455 /* We're still not sure what the argument will be. */
19457 /* Try a template. */
19465 /* If the next token isn't a `,' or a `>', then this argument wasn't
19466 really finished. */
19470 {
19471 /* Figure out what is being referred to. If the id-expression
19472 was for a class template specialization, then we will have a
19473 TYPE_DECL at this point. There is no need to do name lookup
19474 at this point in that case. */
19477 none_type,
19486 }
19488 {
19494 }
19495 /* It must be a non-type argument. In C++17 any constant-expression is
19496 allowed. */
19500 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
19502 -- an integral constant-expression of integral or enumeration
19503 type; or
19505 -- the name of a non-type template-parameter; or
19507 -- the name of an object or function with external linkage...
19509 -- the address of an object or function with external linkage...
19511 -- a pointer to member... */
19512 /* Look for a non-type template parameter. */
19514 {
19526 }
19528 /* If the next token is "&", the argument must be the address of an
19529 object or function with external linkage. */
19532 {
19535 }
19536 /* See if we might have an id-expression. */
19543 {
19546 address_p,
19553 else
19554 {
19555 tree probe;
19558 {
19559 /* Strip the dereference temporarily. */
19562 }
19564 /* If we're in a template, we represent a qualified-id referring
19565 to a static data member as a SCOPE_REF even if the scope isn't
19566 dependent so that we can check access control later. */
19571 {
19572 /* A variable without external linkage might still be a
19573 valid constant-expression, so no error is issued here
19574 if the external-linkage check fails. */
19577 }
19579 /* All overloaded functions are allowed; if the external
19580 linkage test does not pass, an error will be issued
19581 later. */
19582 ;
19586 /* A pointer-to-member. */
19587 ;
19589 ;
19590 else
19594 {
19598 else
19601 }
19602 }
19603 }
19604 /* If the argument started with "&", there are no other valid
19605 alternatives at this point. */
19607 {
19610 }
19612 general_expr:
19613 /* If the argument wasn't successfully parsed as a type-id followed
19614 by '>>', the argument can only be a constant expression now.
19615 Otherwise, we try parsing the constant-expression tentatively,
19616 because the argument could really be a type-id. */
19622 else
19623 {
19624 /* In C++20, we can encounter a braced-init-list. */
19629 /* With C++17 generalized non-type template arguments we need to handle
19630 lvalue constant expressions, too. */
19633 }
19641 /* We did our best to parse the argument as a non type-id, but that
19642 was the only alternative that matched (albeit with a '>' after
19643 it). We can assume it's just a typo from the user, and a
19644 diagnostic will then be issued. */
19646 }
19648 /* Parse an explicit-instantiation.
19650 explicit-instantiation:
19651 template declaration
19653 Although the standard says `declaration', what it really means is:
19655 explicit-instantiation:
19656 template decl-specifier-seq [opt] declarator [opt] ;
19658 Things like `template int S<int>::i = 5, int S<double>::j;' are not
19659 supposed to be allowed. A defect report has been filed about this
19660 issue.
19662 GNU Extension:
19664 explicit-instantiation:
19665 storage-class-specifier template
19666 decl-specifier-seq [opt] declarator [opt] ;
19667 function-specifier template
19668 decl-specifier-seq [opt] declarator [opt] ; */
19670 static void
19672 {
19674 cp_decl_specifier_seq decl_specifiers;
19679 /* Look for an (optional) storage-class-specifier or
19680 function-specifier. */
19682 {
19683 extension_specifier
19686 extension_specifier
19689 }
19691 /* Look for the `template' keyword. */
19693 /* Let the front end know that we are processing an explicit
19694 instantiation. */
19696 /* [temp.explicit] says that we are supposed to ignore access
19697 control while processing explicit instantiation directives. */
19699 /* Parse a decl-specifier-seq. */
19701 CP_PARSER_FLAGS_OPTIONAL,
19705 cp_omp_declare_simd_data odsd;
19711 /* If there was exactly one decl-specifier, and it declared a class,
19712 and there's no declarator, then we have an explicit type
19713 instantiation. */
19715 {
19718 /* Turn access control back on for names used during
19719 template instantiation. */
19724 }
19725 else
19726 {
19728 tree decl;
19730 /* Parse the declarator. */
19731 declarator
19733 CP_PARSER_FLAGS_NONE,
19744 {
19747 "explicit instantiation shall not use"
19751 "explicit instantiation shall not use"
19755 "explicit instantiation shall not use"
19760 /* Turn access control back on for names used during
19761 template instantiation. */
19763 /* Do the explicit instantiation. */
19765 }
19766 else
19767 {
19769 /* Skip the body of the explicit instantiation. */
19771 }
19772 }
19773 /* We're done with the instantiation. */
19779 }
19781 /* Parse an explicit-specialization.
19783 explicit-specialization:
19784 template < > declaration
19786 Although the standard says `declaration', what it really means is:
19788 explicit-specialization:
19789 template <> decl-specifier [opt] init-declarator [opt] ;
19790 template <> function-definition
19791 template <> explicit-specialization
19792 template <> template-declaration */
19794 static void
19796 {
19799 /* Look for the `template' keyword. */
19801 /* Look for the `<'. */
19803 /* Look for the `>'. */
19805 /* We have processed another parameter list. */
19808 /* [temp]
19810 A template ... explicit specialization ... shall not have C
19811 linkage. */
19814 {
19818 /* Give it C++ linkage to avoid confusing other parts of the
19819 front end. */
19821 }
19823 /* Let the front end know that we are beginning a specialization. */
19825 {
19826 /* If the next keyword is `template', we need to figure out
19827 whether or not we're looking a template-declaration. */
19829 {
19834 else
19836 }
19837 else
19838 /* Parse the dependent declaration. */
19844 }
19846 /* We're done with the specialization. */
19849 /* For the erroneous case of a template with C linkage, we pushed an
19850 implicit C++ linkage scope; exit that scope now. */
19854 /* We're done with this parameter list. */
19856 }
19858 /* Preserve the attributes across a garbage collect (by making it a GC
19859 root), which can occur when parsing a member function. */
19863 /* Parse a type-specifier.
19865 type-specifier:
19866 simple-type-specifier
19867 class-specifier
19868 enum-specifier
19869 elaborated-type-specifier
19870 cv-qualifier
19872 GNU Extension:
19874 type-specifier:
19875 __complex__
19877 Returns a representation of the type-specifier. For a
19878 class-specifier, enum-specifier, or elaborated-type-specifier, a
19879 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
19881 The parser flags FLAGS is used to control type-specifier parsing.
19883 If IS_DECLARATION is TRUE, then this type-specifier is appearing
19884 in a decl-specifier-seq.
19886 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
19887 class-specifier, enum-specifier, or elaborated-type-specifier, then
19888 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
19889 if a type is declared; 2 if it is defined. Otherwise, it is set to
19890 zero.
19892 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
19893 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
19894 is set to FALSE. */
19896 static tree
19898 cp_parser_flags flags,
19903 {
19909 /* Assume this type-specifier does not declare a new type. */
19912 /* And that it does not specify a cv-qualifier. */
19915 /* Peek at the next token. */
19918 /* If we're looking at a keyword, we can use that to guide the
19919 production we choose. */
19922 {
19927 /* Look for the enum-specifier. */
19929 /* If that worked, we're done. */
19931 {
19936 type_spec,
19937 token,
19940 }
19941 else
19944 /* Any of these indicate either a class-specifier, or an
19945 elaborated-type-specifier. */
19952 /* Parse tentatively so that we can back up if we don't find a
19953 class-specifier. */
19957 /* Look for the class-specifier. */
19962 /* If that worked, we're done. */
19964 {
19969 type_spec,
19970 token,
19973 }
19975 /* Fall through. */
19976 elaborated_type_specifier:
19977 /* We're declaring (not defining) a class or enum. */
19981 /* Fall through. */
19983 /* Look for an elaborated-type-specifier. */
19984 type_spec
19985 = (cp_parser_elaborated_type_specifier
19988 is_declaration));
19991 type_spec,
19992 token,
20015 /* The `__complex__' keyword is a GNU extension. */
20021 }
20023 /* Handle simple keywords. */
20025 {
20027 {
20030 }
20032 }
20034 /* If we do not already have a type-specifier, assume we are looking
20035 at a simple-type-specifier. */
20037 decl_specs,
20038 flags);
20040 /* If we didn't find a type-specifier, and a type-specifier was not
20041 optional in this context, issue an error message. */
20043 {
20046 }
20049 }
20051 /* Parse a simple-type-specifier.
20053 simple-type-specifier:
20054 :: [opt] nested-name-specifier [opt] type-name
20055 :: [opt] nested-name-specifier template template-id
20056 char
20057 wchar_t
20058 bool
20059 short
20060 int
20061 long
20062 signed
20063 unsigned
20064 float
20065 double
20066 void
20068 C++11 Extension:
20070 simple-type-specifier:
20071 auto
20072 decltype ( expression )
20073 char16_t
20074 char32_t
20075 __underlying_type ( type-id )
20077 C++17 extension:
20079 nested-name-specifier(opt) template-name
20081 GNU Extension:
20083 simple-type-specifier:
20084 __int128
20085 __typeof__ unary-expression
20086 __typeof__ ( type-id )
20087 __typeof__ ( type-id ) { initializer-list , [opt] }
20089 Concepts Extension:
20091 simple-type-specifier:
20092 constrained-type-specifier
20094 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
20095 appropriately updated. */
20097 static tree
20100 cp_parser_flags flags)
20101 {
20106 /* Peek at the next token. */
20109 /* If we're looking at a keyword, things are easy. */
20111 {
20149 {
20152 /* Check if the alternate "__intN__" form has been used instead of
20153 "__intN". */
20157 }
20179 CASE_RID_FLOATN_NX:
20194 {
20195 /* The 'auto' might be the placeholder return type for a function decl
20196 with trailing return type. */
20205 {
20207 {
20214 }
20217 {
20220 }
20223 }
20227 {
20230 }
20233 {
20236 }
20237 else
20241 {
20244 "use of %<auto%> in lambda parameter declaration "
20245 "only available with "
20247 }
20250 "use of %<auto%> in template argument "
20254 "use of %<auto%> in parameter declaration "
20258 "use of %<auto%> in parameter declaration "
20259 "only available with "
20261 }
20262 else
20267 /* Since DR 743, decltype can either be a simple-type-specifier by
20268 itself or begin a nested-name-specifier. Parsing it will replace
20269 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
20270 handling below decide what to do. */
20276 /* Consume the `typeof' token. */
20278 /* Parse the operand to `typeof'. */
20280 /* If it is not already a TYPE, take its type. */
20286 token,
20292 /* If token is a type-yielding built-in traits, parse it. */
20295 {
20299 token,
20303 }
20306 }
20308 /* If token is an already-parsed decltype not followed by ::,
20309 it's a simple-type-specifier. */
20312 {
20315 {
20317 token,
20319 /* Remember that we are handling a decltype in order to
20320 implement the resolution of DR 1510 when the argument
20321 isn't instantiation dependent. */
20323 }
20326 }
20328 /* If the type-specifier was for a built-in type, we're done. */
20330 {
20331 /* Record the type. */
20338 type,
20339 token,
20344 /* Consume the token. */
20350 /* There is no valid C++ program where a non-template type is
20351 followed by a "<". That usually indicates that the user thought
20352 that the type was a template. */
20357 }
20359 /* The type-specifier must be a user-defined type. */
20361 {
20367 /* Don't gobble tokens or issue error messages if this is an
20368 optional type-specifier. */
20372 /* Remember current tentative parsing state -- if we know we need
20373 a type, we can give better diagnostics here. */
20378 /* Look for the optional `::' operator. */
20379 global_p
20383 /* Look for the nested-name specifier. */
20384 qualified_p
20391 /* If we have seen a nested-name-specifier, and the next token
20392 is `template', then we are using the template-id production. */
20395 {
20396 /* Look for the template-id. */
20400 none_type,
20402 /* If the template-id did not name a type, we are out of
20403 luck. */
20405 {
20406 /* ...unless we pretend we have seen 'typename'. */
20410 else
20411 {
20414 }
20415 }
20416 }
20417 /* DR 1812: A < following a qualified-id in a typename-specifier
20418 could safely be assumed to begin a template argument list, so
20419 the template keyword should be optional. */
20421 && qualified_p
20422 && typename_p
20424 {
20430 none_type,
20432 /* This is handled below, so back off. */
20443 }
20445 /* Otherwise, look for a type-name. */
20447 {
20456 }
20459 {
20460 /* Try for a type-constraint with template arguments. We check
20461 decl_specs here to avoid trying this for a functional cast. */
20468 none_type,
20471 {
20476 /* Perhaps it's a concept-check expression. */
20478 }
20479 else
20484 }
20487 {
20488 /* Try class template argument deduction or type-constraint without
20489 template arguments. */
20493 {
20494 location_t loc
20497 none_type,
20509 else
20510 {
20515 }
20516 }
20517 else
20519 }
20521 /* If it didn't work out, we don't have a TYPE. */
20526 /* Keep track of all name-lookups performed in class scopes. */
20528 && !global_p
20529 && !qualified_p
20536 token,
20538 }
20540 /* If we didn't get a type-name, issue an error message. */
20542 {
20545 }
20548 {
20549 /* See if TYPE is an Objective-C type, and if so, parse and
20550 accept any protocol references following it. Do this before
20551 the cp_parser_check_for_invalid_template_id() call, because
20552 Objective-C types can be followed by '<...>' which would
20553 enclose protocol names rather than template arguments, and so
20554 everything is fine. */
20557 {
20561 /* Clobber the "unqualified" type previously entered into
20562 DECL_SPECS with the new, improved protocol-qualified version. */
20567 }
20569 /* There is no valid C++ program where a non-template type is
20570 followed by a "<". That usually indicates that the user
20571 thought that the type was a template. */
20573 none_type,
20575 }
20578 }
20580 /* Parse the remainder of a placholder-type-specifier.
20582 placeholder-type-specifier:
20583 type-constraint_opt auto
20584 type-constraint_opt decltype(auto)
20586 The raw form of the constraint is parsed in cp_parser_simple_type_specifier
20587 and passed as TMPL. This function converts TMPL to an actual type-constraint,
20588 parses the placeholder type, and performs some contextual syntactic analysis.
20590 LOC provides the location of the template name.
20592 TENTATIVE is true if the type-specifier parsing is tentative; in that case,
20593 don't give an error if TMPL isn't a valid type-constraint, as the template-id
20594 might actually be a concept-check,
20596 Note that the Concepts TS allows the auto or decltype(auto) to be
20597 omitted in a constrained-type-specifier. */
20599 static tree
20602 {
20608 /* Get the arguments as written for subsequent analysis. */
20611 {
20614 }
20615 else
20616 /* A concept-name with no arguments can't be an expression. */
20621 /* Get the concept and prototype parameter for the constraint. */
20628 /* As per the standard, require auto or decltype(auto), except in some
20629 cases (template parameter lists, -fconcepts-ts enabled). */
20632 {
20636 {
20638 matching_parens parens;
20642 }
20643 }
20645 /* A type constraint constrains a contextually determined type or type
20646 parameter pack. However, the Concepts TS does allow concepts
20647 to introduce non-type and template template parameters. */
20649 {
20652 {
20654 {
20657 }
20659 }
20660 }
20662 /* In a template parameter list, a type-parameter can be introduced
20663 by type-constraints alone. */
20665 {
20666 /* In a default argument we may not be creating new parameters. */
20668 {
20669 /* If this assert turns out to be false, do error() instead. */
20672 }
20674 }
20676 /* Diagnose issues placeholder issues. */
20680 {
20682 /* Perhaps it's a concept-check expression (c++/91073). */
20689 /* Fall through. This is an error of omission. */
20690 }
20692 {
20693 /* A trailing return type only allows type-constraints. */
20696 }
20698 /* In a parameter-declaration-clause, a placeholder-type-specifier
20699 results in an invented template parameter. */
20701 {
20703 {
20709 }
20712 }
20714 /* Determine if the type should be deduced using template argument
20715 deduction or decltype deduction. Note that the latter is always
20716 used for type-constraints in trailing return types. */
20721 /* Otherwise, this is the type of a variable or return type. */
20724 else
20726 }
20728 /* Parse a type-name.
20730 type-name:
20731 class-name
20732 enum-name
20733 typedef-name
20734 simple-template-id [in c++0x]
20736 enum-name:
20737 identifier
20739 typedef-name:
20740 identifier
20742 Concepts:
20744 type-name:
20745 concept-name
20746 partial-concept-id
20748 concept-name:
20749 identifier
20751 Returns a TYPE_DECL for the type. */
20753 static tree
20755 {
20756 tree type_decl;
20758 /* We can't know yet whether it is a class-name or not. */
20760 /* Try a class-name. */
20762 typename_keyword_p,
20764 none_type,
20768 /* If it's not a class-name, keep looking. */
20770 {
20772 /* It must be a typedef-name or an enum-name. */
20776 /* It is either a simple-template-id representing an
20777 instantiation of an alias template... */
20781 none_type,
20783 /* Note that this must be an instantiation of an alias template
20784 because [temp.names]/6 says:
20786 A template-id that names an alias template specialization
20787 is a type-name.
20789 Whereas [temp.names]/7 says:
20791 A simple-template-id that names a class template
20792 specialization is a class-name.
20794 With concepts, this could also be a partial-concept-id that
20795 declares a non-type template parameter. */
20800 else
20804 /* ... Or a typedef-name or an enum-name. */
20806 }
20809 }
20811 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
20812 or a concept-name.
20814 enum-name:
20815 identifier
20817 typedef-name:
20818 identifier
20820 concept-name:
20821 identifier
20823 Returns a TYPE_DECL for the type. */
20825 static tree
20827 {
20828 tree type_decl;
20829 tree identifier;
20836 /* Look up the type-name. */
20843 {
20844 /* See if this is an Objective-C type. */
20849 }
20851 /* Issue an error if we did not find a type-name. */
20853 /* In Objective-C, we have the complication that class names are
20854 normally type names and start declarations (eg, the
20855 "NSObject" in "NSObject *object;"), but can be used in an
20856 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
20857 is an expression. So, a classname followed by a dot is not a
20858 valid type-name. */
20861 {
20866 }
20867 /* Remember that the name was used in the definition of the
20868 current class so that we can check later to see if the
20869 meaning would have been different after the class was
20870 entirely defined. */
20876 }
20878 /* Parse an elaborated-type-specifier. Note that the grammar given
20879 here incorporates the resolution to DR68.
20881 elaborated-type-specifier:
20882 class-key :: [opt] nested-name-specifier [opt] identifier
20883 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
20884 enum-key :: [opt] nested-name-specifier [opt] identifier
20885 typename :: [opt] nested-name-specifier identifier
20886 typename :: [opt] nested-name-specifier template [opt]
20887 template-id
20889 GNU extension:
20891 elaborated-type-specifier:
20892 class-key attributes :: [opt] nested-name-specifier [opt] identifier
20893 class-key attributes :: [opt] nested-name-specifier [opt]
20894 template [opt] template-id
20895 enum attributes :: [opt] nested-name-specifier [opt] identifier
20897 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
20898 declared `friend'. If IS_DECLARATION is TRUE, then this
20899 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
20900 something is being declared.
20902 Returns the TYPE specified. */
20904 static tree
20908 {
20910 tree identifier;
20913 tree globalscope;
20916 /* For class and enum types the location of the class-key or enum-key. */
20918 /* For a scoped enum, the 'class' or 'struct' keyword id. */
20921 /* See if we're looking at the `enum' keyword. */
20923 {
20924 /* Consume the `enum' token. */
20926 /* Remember that it's an enumeration type. */
20928 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
20929 enums) is used here. */
20933 {
20941 /* Consume the `struct' or `class' and parse it anyway. */
20943 /* Create a combined location for the whole scoped-enum-key. */
20945 }
20946 else
20949 /* Parse the attributes. */
20951 }
20952 /* Or, it might be `typename'. */
20954 RID_TYPENAME))
20955 {
20956 /* Consume the `typename' token. */
20958 /* Remember that it's a `typename' type. */
20960 }
20961 /* Otherwise it must be a class-key. */
20962 else
20963 {
20968 /* Parse the attributes. */
20970 }
20972 /* Look for the `::' operator. */
20975 /* Look for the nested-name-specifier. */
20976 tree nested_name_specifier;
20978 {
20979 nested_name_specifier
20984 is_declaration);
20987 }
20988 else
20989 /* Even though `typename' is not present, the proposed resolution
20990 to Core Issue 180 says that in `class A<T>::B', `B' should be
20991 considered a type-name, even if `A<T>' is dependent. */
20992 nested_name_specifier
20997 is_declaration);
20998 /* For everything but enumeration types, consider a template-id.
20999 For an enumeration type, consider only a plain identifier. */
21001 {
21003 tree decl;
21005 /* Allow the `template' keyword. */
21007 /* If we didn't see `template', we don't know if there's a
21008 template-id or not. */
21011 /* The `template' keyword must follow a nested-name-specifier. */
21013 {
21017 }
21019 /* Parse the template-id. */
21023 tag_type,
21024 is_declaration);
21025 /* If we didn't find a template-id, look for an ordinary
21026 identifier. */
21028 ;
21029 /* We can get here when cp_parser_template_id, called by
21030 cp_parser_class_name with tag_type == none_type, succeeds
21031 and caches a BASELINK. Then, when called again here,
21032 instead of failing and returning an error_mark_node
21033 returns it (see template/typename17.C in C++11).
21034 ??? Could we diagnose this earlier? */
21036 {
21039 }
21040 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
21041 in effect, then we must assume that, upon instantiation, the
21042 template will correspond to a class. */
21046 typename_type,
21048 /* If the `typename' keyword is in effect and DECL is not a type
21049 decl, then type is non existent. */
21051 ;
21053 {
21057 /* If the next token is a semicolon, this must be a specialization,
21058 instantiation, or friend declaration. Check the scope while we
21059 still know whether or not we had a nested-name-specifier. */
21064 }
21067 }
21070 {
21075 {
21078 }
21080 /* For a `typename', we needn't call xref_tag. */
21086 /* Template parameter lists apply only if we are not within a
21087 function parameter list. */
21088 bool template_parm_lists_apply
21097 /* Look up a qualified name in the usual way. */
21099 {
21100 tree decl;
21101 tree ambiguous_decls;
21104 tag_type,
21111 /* If the lookup was ambiguous, an error will already have been
21112 issued. */
21116 /* If we are parsing friend declaration, DECL may be a
21117 TEMPLATE_DECL tree node here. However, we need to check
21118 whether this TEMPLATE_DECL results in valid code. Consider
21119 the following example:
21121 namespace N {
21122 template <class T> class C {};
21123 }
21124 class X {
21125 template <class T> friend class N::C; // #1, valid code
21126 };
21127 template <class T> class Y {
21128 friend class N::C; // #2, invalid code
21129 };
21131 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
21132 name lookup of `N::C'. We see that friend declaration must
21133 be template for the code to be valid. Note that
21134 processing_template_decl does not work here since it is
21135 always 1 for the above two cases. */
21137 decl = (cp_parser_maybe_treat_template_as_class
21142 {
21144 identifier,
21147 }
21150 {
21154 allow_template);
21158 }
21160 /* Forward declarations of nested types, such as
21162 class C1::C2;
21163 class C1::C2::C3;
21165 are invalid unless all components preceding the final '::'
21166 are complete. If all enclosing types are complete, these
21167 declarations become merely pointless.
21169 Invalid forward declarations of nested types are errors
21170 caught elsewhere in parsing. Those that are pointless arrive
21171 here. */
21179 }
21180 else
21181 {
21182 /* An elaborated-type-specifier sometimes introduces a new type and
21183 sometimes names an existing type. Normally, the rule is that it
21184 introduces a new type only if there is not an existing type of
21185 the same name already in scope. For example, given:
21187 struct S {};
21188 void f() { struct S s; }
21190 the `struct S' in the body of `f' is the same `struct S' as in
21191 the global scope; the existing definition is used. However, if
21192 there were no global declaration, this would introduce a new
21193 local class named `S'.
21195 An exception to this rule applies to the following code:
21197 namespace N { struct S; }
21199 Here, the elaborated-type-specifier names a new type
21200 unconditionally; even if there is already an `S' in the
21201 containing scope this declaration names a new type.
21202 This exception only applies if the elaborated-type-specifier
21203 forms the complete declaration:
21205 [class.name]
21207 A declaration consisting solely of `class-key identifier ;' is
21208 either a redeclaration of the name in the current scope or a
21209 forward declaration of the identifier as a class name. It
21210 introduces the name into the current scope.
21212 We are in this situation precisely when the next token is a `;'.
21214 An exception to the exception is that a `friend' declaration does
21215 *not* name a new type; i.e., given:
21217 struct S { friend struct T; };
21219 `T' is not a new type in the scope of `S'.
21221 Also, `new struct S' or `sizeof (struct S)' never results in the
21222 definition of a new type; a new type can only be declared in a
21223 declaration context. */
21225 TAG_how how;
21228 /* Friends have special name lookup rules. */
21232 CPP_SEMICOLON))
21233 /* This is a `class-key identifier ;' */
21235 else
21239 (template_parm_lists_apply
21242 /* An unqualified name was used to reference this type, so
21243 there were no qualifying templates. */
21253 }
21254 }
21259 /* Allow attributes on forward declarations of classes. */
21261 {
21272 {
21276 }
21279 else
21281 "attributes ignored on elaborated-type-specifier that is "
21283 }
21287 else
21288 {
21289 /* Diagnose class/struct/union mismatches. IS_DECLARATION is false
21290 for alias definition. */
21294 decl_class);
21296 /* Indicate whether this class was declared as a `class' or as a
21297 `struct'. */
21300 }
21302 /* A "<" cannot follow an elaborated type specifier. If that
21303 happens, the user was probably trying to form a template-id. */
21308 }
21310 /* Parse an enum-specifier.
21312 enum-specifier:
21313 enum-head { enumerator-list [opt] }
21314 enum-head { enumerator-list , } [C++0x]
21316 enum-head:
21317 enum-key identifier [opt] enum-base [opt]
21318 enum-key nested-name-specifier identifier enum-base [opt]
21320 enum-key:
21321 enum
21322 enum class [C++0x]
21323 enum struct [C++0x]
21325 enum-base: [C++0x]
21326 : type-specifier-seq
21328 opaque-enum-specifier:
21329 enum-key identifier enum-base [opt] ;
21331 GNU Extensions:
21332 enum-key attributes[opt] identifier [opt] enum-base [opt]
21333 { enumerator-list [opt] }attributes[opt]
21334 enum-key attributes[opt] identifier [opt] enum-base [opt]
21335 { enumerator-list, }attributes[opt] [C++0x]
21337 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
21338 if the token stream isn't an enum-specifier after all. */
21340 static tree
21342 {
21343 tree identifier;
21345 tree prev_scope;
21347 tree attributes;
21358 /* Parse tentatively so that we can back up if we don't find a
21359 enum-specifier. */
21362 /* Caller guarantees that the current token is 'enum', an identifier
21363 possibly follows, and the token after that is an opening brace.
21364 If we don't have an identifier, fabricate an anonymous name for
21365 the enumeration being defined. */
21368 /* Parse the "class" or "struct", which indicates a scoped
21369 enumeration type in C++0x. */
21372 {
21376 /* Consume the `struct' or `class' token. */
21380 }
21384 /* Clear the qualification. */
21389 /* Figure out in what scope the declaration is being placed. */
21395 nested_name_specifier
21403 {
21404 tree name;
21408 enum_type,
21413 input_location);
21415 {
21418 {
21419 /* Are template enums allowed in ISO? */
21423 /* ignore a typename reference, for it will be solved by name
21424 in start_enum. */
21426 }
21427 }
21430 else
21431 {
21436 }
21437 }
21438 else
21439 {
21442 else
21443 {
21449 }
21450 }
21453 /* Check for the `:' that denotes a specified underlying type in C++0x.
21454 Note that a ':' could also indicate a bitfield width, however. */
21457 {
21458 cp_decl_specifier_seq type_specifiers;
21460 /* Consume the `:'. */
21464 auto tdf
21468 /* Parse the type-specifier-seq. */
21474 /* At this point this is surely not elaborated type specifier. */
21483 /* If that didn't work, stop. */
21485 {
21491 }
21492 }
21494 /* Look for the `{' but don't consume it yet. */
21496 {
21498 {
21504 }
21505 /* An opaque-enum-specifier must have a ';' here. */
21508 {
21511 OPT_Welaborated_enum_base,
21512 "declaration of enumeration with "
21513 "fixed underlying type and no enumerator list is "
21515 else
21517 }
21518 }
21524 {
21526 {
21530 }
21533 }
21535 /* Issue an error message if type-definitions are forbidden here. */
21538 else
21539 /* Create the new type. We do this before consuming the opening
21540 brace so the enum will be recorded as being on the line of its
21541 tag (or the 'enum' keyword, if there is no tag). */
21545 /* If the next token is not '{' it is an opaque-enum-specifier or an
21546 elaborated-type-specifier. */
21548 {
21553 {
21554 /* The following catches invalid code such as:
21555 enum class S<int>::E { A, B, C }; */
21563 {
21567 nested_name_specifier);
21569 }
21572 {
21574 "%qT for enum declaration does not name a class "
21577 }
21578 /* If that scope does not contain the scope in which the
21579 class was originally declared, the program is invalid. */
21581 nested_name_specifier))
21582 {
21585 "declaration of %qD in namespace %qD which does not "
21588 else
21590 "declaration of %qD in %qD which does not "
21594 }
21595 /* If that scope is the scope where the declaration is being placed
21596 the program is invalid. */
21600 {
21604 }
21605 }
21610 /* Consume the opening brace. */
21611 matching_braces braces;
21618 {
21622 }
21623 else
21624 {
21630 }
21634 /* If the next token is not '}', then there are some enumerators. */
21636 {
21638 /* Don't warn for enum {} a; here. */
21642 }
21643 else
21644 {
21645 /* We've seen a '{' so we know we're in an enum-specifier.
21646 Commit to any tentative parse to get syntax errors. */
21649 }
21651 /* Consume the final '}'. */
21656 }
21657 else
21658 {
21659 /* If a ';' follows, then it is an opaque-enum-specifier
21660 and additional restrictions apply. */
21662 {
21669 }
21670 }
21672 /* Look for trailing attributes to apply to this enumeration, and
21673 apply them if appropriate. */
21675 {
21678 trailing_attr,
21680 }
21682 /* Finish up the enumeration. */
21684 {
21689 }
21692 {
21694 {
21697 }
21700 }
21702 }
21704 /* Parse an enumerator-list. The enumerators all have the indicated
21705 TYPE.
21707 enumerator-list:
21708 enumerator-definition
21709 enumerator-list , enumerator-definition */
21711 static void
21713 {
21715 {
21716 /* Parse an enumerator-definition. */
21719 /* If the next token is not a ',', we've reached the end of
21720 the list. */
21723 /* Otherwise, consume the `,' and keep going. */
21725 /* If the next token is a `}', there is a trailing comma. */
21727 {
21732 }
21733 }
21734 }
21736 /* Parse an enumerator-definition. The enumerator has the indicated
21737 TYPE.
21739 enumerator-definition:
21740 enumerator
21741 enumerator = constant-expression
21743 enumerator:
21744 identifier
21746 GNU Extensions:
21748 enumerator-definition:
21749 enumerator attributes [opt]
21750 enumerator attributes [opt] = constant-expression */
21752 static void
21754 {
21755 tree identifier;
21756 tree value;
21757 location_t loc;
21759 /* Save the input location because we are interested in the location
21760 of the identifier and not the location of the explicit value. */
21763 /* Look for the identifier. */
21768 /* Parse any specified attributes. */
21771 /* If the next token is an '=', then there is an explicit value. */
21773 {
21774 /* Consume the `=' token. */
21776 /* Parse the value. */
21778 }
21779 else
21782 /* If we are processing a template, make sure the initializer of the
21783 enumerator doesn't contain any bare template parameter pack. */
21785 {
21786 /* In a lambda it should work, but doesn't currently. */
21788 {
21791 }
21792 }
21796 /* Create the enumerator. */
21798 }
21800 /* Parse a namespace-name.
21802 namespace-name:
21803 original-namespace-name
21804 namespace-alias
21806 Returns the NAMESPACE_DECL for the namespace. */
21808 static tree
21810 {
21811 tree identifier;
21812 tree namespace_decl;
21816 /* Get the name of the namespace. */
21821 /* Look up the identifier in the currently active scope. Look only
21822 for namespaces, due to:
21824 [basic.lookup.udir]
21826 When looking up a namespace-name in a using-directive or alias
21827 definition, only namespace names are considered.
21829 And:
21831 [basic.lookup.qual]
21833 During the lookup of a name preceding the :: scope resolution
21834 operator, object, function, and enumerator names are ignored.
21836 (Note that cp_parser_qualifying_entity only calls this
21837 function if the token after the name is the scope resolution
21838 operator.) */
21840 none_type,
21846 /* If it's not a namespace, issue an error. */
21849 {
21851 {
21852 auto_diagnostic_group d;
21853 name_hint hint;
21857 identifier,
21860 {
21866 }
21867 else
21869 identifier);
21870 }
21871 else
21874 }
21877 }
21879 /* Parse a namespace-definition.
21881 namespace-definition:
21882 named-namespace-definition
21883 unnamed-namespace-definition
21885 named-namespace-definition:
21886 original-namespace-definition
21887 extension-namespace-definition
21889 original-namespace-definition:
21890 namespace identifier { namespace-body }
21892 extension-namespace-definition:
21893 namespace original-namespace-name { namespace-body }
21895 unnamed-namespace-definition:
21896 namespace { namespace-body } */
21898 static void
21900 {
21901 tree identifier;
21911 {
21914 }
21916 /* Look for the `namespace' keyword. */
21917 cp_token* token
21920 /* Parse any specified attributes before the identifier. */
21924 {
21928 RID_INLINE);
21930 {
21934 "definitions only available with %<-std=c++20%> or "
21937 }
21940 {
21945 "standard attributes on namespaces must precede "
21948 /* Parse any attributes specified after the identifier. */
21950 }
21953 {
21954 /* Don't forget that the innermost namespace might have been
21955 marked as inline. Use |= because we cannot overwrite
21956 IS_INLINE in case the outermost namespace is inline, but
21957 there are no nested inlines. */
21960 }
21964 "nested namespace definitions only available with "
21967 /* Nested namespace names can create new namespaces (unlike
21968 other qualified-ids). */
21973 else
21976 }
21988 /* Start the namespace. */
21995 /* Look for the `{' to validate starting the namespace. */
21996 matching_braces braces;
21998 {
21999 /* Parse the body of the namespace. */
22002 /* Look for the final `}'. */
22004 }
22009 /* Pop the nested namespace definitions. */
22012 }
22014 /* Parse a namespace-body.
22016 namespace-body:
22017 declaration-seq [opt] */
22019 static void
22021 {
22023 }
22025 /* Parse a namespace-alias-definition.
22027 namespace-alias-definition:
22028 namespace identifier = qualified-namespace-specifier ; */
22030 static void
22032 {
22033 tree identifier;
22034 tree namespace_specifier;
22038 /* Look for the `namespace' keyword. */
22040 /* Look for the identifier. */
22044 /* Look for the `=' token. */
22047 {
22049 /* Skip the definition. */
22054 }
22056 /* Look for the qualified-namespace-specifier. */
22057 namespace_specifier
22060 /* Look for the `;' token. */
22063 /* Register the alias in the symbol table. */
22065 }
22067 /* Parse a qualified-namespace-specifier.
22069 qualified-namespace-specifier:
22070 :: [opt] nested-name-specifier [opt] namespace-name
22072 Returns a NAMESPACE_DECL corresponding to the specified
22073 namespace. */
22075 static tree
22077 {
22078 /* Look for the optional `::'. */
22082 /* Look for the optional nested-name-specifier. */
22090 }
22092 /* Subroutine of cp_parser_using_declaration. */
22094 static tree
22096 {
22099 {
22100 /* Create the USING_DECL. */
22109 /* Add it to the list of members in this class. */
22111 }
22112 else
22115 }
22117 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
22118 access declaration.
22120 using-declaration:
22121 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
22122 using :: unqualified-id ;
22124 access-declaration:
22125 qualified-id ;
22127 */
22129 static bool
22132 {
22136 tree identifier;
22137 tree qscope;
22142 {
22145 }
22146 else
22147 {
22148 /* Look for the `using' keyword. */
22151 again:
22152 /* Peek at the next token. */
22154 /* See if it's `typename'. */
22156 {
22157 /* Remember that we've seen it. */
22159 /* Consume the `typename' token. */
22161 }
22162 }
22164 /* Look for the optional global scope qualification. */
22165 global_scope_p
22170 /* If we saw `typename', or didn't see `::', then there must be a
22171 nested-name-specifier present. */
22173 {
22179 {
22182 }
22183 }
22184 /* Otherwise, we could be in either of the two productions. In that
22185 case, treat the nested-name-specifier as optional. */
22186 else
22200 /* If the qualifying scope of an access-declaration isn't a class
22201 or enumeration type then it can't be valid. */
22205 /* Something has already gone wrong; there's no need to parse
22206 further. Since an error has occurred, the return value of
22207 cp_parser_parse_definitely will be false, as required. */
22211 /* Parse the unqualified-id. */
22219 {
22224 }
22226 {
22230 "pack expansion in using-declaration only available "
22233 /* A parameter pack can appear in the qualifying scope, and/or in the
22234 terminal name (if naming a conversion function). Logically they're
22235 part of a single pack expansion of the overall USING_DECL, but we
22236 express them as separate pack expansions within the USING_DECL since
22237 we can't create a pack expansion over a USING_DECL. */
22240 {
22243 }
22247 {
22251 }
22253 {
22254 /* Issue an error in terms using a SCOPE_REF that includes both
22255 components. */
22256 tree name
22261 }
22262 }
22264 /* The function we call to handle a using-declaration is different
22265 depending on what scope we are in. */
22267 ;
22270 /* [namespace.udecl]
22272 A using declaration shall not name a template-id. */
22275 else
22276 {
22280 {
22283 }
22284 }
22288 {
22292 "comma-separated list in using-declaration only available "
22295 }
22297 /* Look for the final `;'. */
22302 "access declarations are deprecated "
22303 "in favour of using-declarations; "
22307 }
22309 /* C++20 using enum declaration.
22311 using-enum-declaration :
22312 using elaborated-enum-specifier ; */
22314 static void
22316 {
22319 /* Using cp_parser_elaborated_type_specifier rejects typedef-names, which
22320 breaks one of the motivating examples in using-enum-5.C.
22321 cp_parser_simple_type_specifier seems to be closer to what we actually
22322 want, though that hasn't been properly specified yet. */
22324 /* Consume 'enum'. */
22330 tree type = (cp_parser_simple_type_specifier
22337 {
22340 }
22344 /* The elaborated-enum-specifier shall not name a dependent type and the type
22345 shall have a reachable enum-specifier. */
22359 {
22361 auto_diagnostic_group g;
22365 ;
22368 else
22370 }
22372 /* A using-enum-declaration introduces the enumerator names of the named
22373 enumeration as if by a using-declaration for each enumerator. */
22377 }
22379 /* Parse an alias-declaration.
22381 alias-declaration:
22382 using identifier attribute-specifier-seq [opt] = type-id */
22384 static tree
22386 {
22390 cp_decl_specifier_seq decl_specs;
22394 /* Look for the `using' keyword. */
22395 cp_token *using_token
22417 /* Now we are going to parse the type-id of the declaration. */
22419 /*
22420 [dcl.type]/3 says:
22422 "A type-specifier-seq shall not define a class or enumeration
22423 unless it appears in the type-id of an alias-declaration (7.1.3) that
22424 is not the declaration of a template-declaration."
22426 In other words, if we currently are in an alias template, the
22427 type-id should not define a type.
22429 So let's set parser->type_definition_forbidden_message in that
22430 case; cp_parser_check_type_definition (called by
22431 cp_parser_class_specifier) will then emit an error if a type is
22432 defined in the type-id. */
22434 {
22438 }
22443 /* Restore the error message if need be. */
22449 {
22452 }
22454 /* A typedef-name can also be introduced by an alias-declaration. The
22455 identifier following the using keyword becomes a typedef-name. It has
22456 the same semantics as if it were introduced by the typedef
22457 specifier. In particular, it does not define a new type and it shall
22458 not appear in the type-id. */
22463 {
22466 ds_attribute,
22467 attrs_token);
22468 }
22470 ds_typedef,
22471 using_token);
22473 ds_alias,
22474 using_token);
22481 id_location,
22491 else
22502 /* If decl is a template, return its TEMPLATE_DECL so that it gets
22503 added into the symbol table; otherwise, return the TYPE_DECL. */
22507 {
22511 }
22514 }
22516 /* Parse a using-directive.
22518 using-directive:
22519 attribute-specifier-seq [opt] using namespace :: [opt]
22520 nested-name-specifier [opt] namespace-name ; */
22522 static void
22524 {
22525 tree namespace_decl;
22528 {
22529 /* Error during attribute parsing that resulted in skipping
22530 to next semicolon. */
22533 }
22535 /* Look for the `using' keyword. */
22537 /* And the `namespace' keyword. */
22539 /* Look for the optional `::' operator. */
22541 /* And the optional nested-name-specifier. */
22547 /* Get the namespace being used. */
22550 /* And any specified GNU attributes. */
22554 /* Update the symbol table. */
22557 /* Look for the final `;'. */
22559 }
22561 /* Parse an asm-definition.
22563 asm-qualifier:
22564 volatile
22565 inline
22566 goto
22568 asm-qualifier-list:
22569 asm-qualifier
22570 asm-qualifier-list asm-qualifier
22572 asm-definition:
22573 asm ( string-literal ) ;
22575 GNU Extension:
22577 asm-definition:
22578 asm asm-qualifier-list [opt] ( string-literal ) ;
22579 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt] ) ;
22580 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22581 : asm-operand-list [opt] ) ;
22582 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22583 : asm-operand-list [opt]
22584 : asm-clobber-list [opt] ) ;
22585 asm asm-qualifier-list [opt] ( string-literal : : asm-operand-list [opt]
22586 : asm-clobber-list [opt]
22587 : asm-goto-list ) ;
22589 The form with asm-goto-list is valid if and only if the asm-qualifier-list
22590 contains goto, and is the only allowed form in that case. No duplicates are
22591 allowed in an asm-qualifier-list. */
22593 static void
22595 {
22600 tree asm_stmt;
22608 /* Look for the `asm' keyword. */
22611 /* In C++20, unevaluated inline assembly is permitted in constexpr
22612 functions. */
22617 "function only available with %<-std=c++20%> or "
22620 /* Handle the asm-qualifier-list. */
22628 {
22632 {
22635 {
22639 }
22640 else
22641 {
22646 }
22652 {
22656 }
22657 else
22666 {
22670 }
22671 else
22686 }
22688 }
22695 {
22698 }
22700 /* Look for the opening `('. */
22703 /* Look for the string. */
22707 {
22711 }
22713 /* If we're allowing GNU extensions, check for the extended assembly
22714 syntax. Unfortunately, the `:' tokens need not be separated by
22715 a space in C, and so, for compatibility, we tolerate that here
22716 too. Doing that means that we have to treat the `::' operator as
22717 two `:' tokens. */
22722 {
22727 /* The extended syntax was used. */
22730 /* Look for outputs. */
22732 {
22733 /* Consume the `:'. */
22735 /* Parse the output-operands. */
22737 CPP_COLON)
22739 CPP_SCOPE)
22741 CPP_CLOSE_PAREN))
22742 {
22746 }
22747 }
22748 /* If the next token is `::', there are no outputs, and the
22749 next token is the beginning of the inputs. */
22751 /* The inputs are coming next. */
22754 /* Look for inputs. */
22757 {
22758 /* Consume the `:' or `::'. */
22760 /* Parse the output-operands. */
22762 CPP_COLON)
22764 CPP_SCOPE)
22766 CPP_CLOSE_PAREN))
22767 {
22771 }
22772 }
22774 /* The clobbers are coming next. */
22777 /* Look for clobbers. */
22780 {
22782 /* Consume the `:' or `::'. */
22784 /* Parse the clobbers. */
22786 CPP_COLON)
22788 CPP_CLOSE_PAREN))
22790 }
22792 /* The labels are coming next. */
22795 /* Look for labels. */
22798 {
22800 /* Consume the `:' or `::'. */
22802 /* Parse the labels. */
22804 }
22808 }
22812 /* Look for the closing `)'. */
22820 {
22821 /* Create the ASM_EXPR. */
22823 {
22826 /* If the extended syntax was not used, mark the ASM_EXPR. */
22828 {
22834 }
22835 }
22836 else
22838 }
22843 }
22845 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
22846 type that comes from the decl-specifier-seq. */
22848 static tree
22850 {
22853 {
22866 }
22869 }
22871 /* Warn about the most vexing parse syntactic ambiguity, i.e., warn when
22872 a construct looks like a variable definition but is actually a function
22873 declaration. DECL_SPECIFIERS is the decl-specifier-seq and DECLARATOR
22874 is the declarator for this function declaration. */
22876 static void
22879 {
22880 /* Only warn if we are declaring a function at block scope. */
22884 /* And only if there is no storage class specified. */
22896 /* Don't warn when the whole declarator (not just the declarator-id!)
22897 was parenthesized. That is, don't warn for int(n()) but do warn
22898 for int(f)(). */
22902 tree type;
22904 {
22909 /* If the return type is void there is no ambiguity. */
22912 }
22914 /* Code like long f(); will have null ->type. If we have any
22915 type-specifiers, pretend we've seen int. */
22917 else
22920 auto_diagnostic_group d;
22925 /* The T t() case. */
22927 {
22929 "empty parentheses were disambiguated as a function "
22931 {
22932 /* () means value-initialization (C++03 and up); {} (C++11 and up)
22933 means value-initialization or aggregate-initialization, nothing
22934 means default-initialization. We can only suggest removing the
22935 parentheses/adding {} if T has a default constructor. */
22937 {
22943 {
22947 else
22950 }
22951 }
22952 }
22954 }
22956 /* If we had (...) or the parameter-list wasn't parenthesized,
22957 we're done. */
22961 /* The T t(X()) case. */
22963 {
22965 "parentheses were disambiguated as a function "
22967 {
22969 /* {}-initialization means that we can use an initializer-list
22970 constructor if no default constructor is available, so don't
22971 suggest using {} for classes that have an initializer_list
22972 constructor. */
22974 {
22979 }
22980 else
22981 {
22985 }
22986 }
22987 }
22988 /* The T t(X(), X()) case. */
22990 "parentheses were disambiguated as a function "
22992 {
22995 {
23000 }
23001 }
23002 }
23004 /* If DECLARATOR with DECL_SPECS is a function declarator that has
23005 the form of a deduction guide, tag it as such. CTOR_DTOR_OR_CONV_P
23006 has the same meaning as in cp_parser_declarator. */
23008 static void
23013 {
23019 {
23027 {
23031 }
23032 }
23033 }
23035 /* Declarators [gram.dcl.decl] */
23037 /* Parse an init-declarator.
23039 init-declarator:
23040 declarator initializer [opt]
23042 GNU Extension:
23044 init-declarator:
23045 declarator asm-specification [opt] attributes [opt] initializer [opt]
23047 function-definition:
23048 decl-specifier-seq [opt] declarator ctor-initializer [opt]
23049 function-body
23050 decl-specifier-seq [opt] declarator function-try-block
23052 GNU Extension:
23054 function-definition:
23055 __extension__ function-definition
23057 TM Extension:
23059 function-definition:
23060 decl-specifier-seq [opt] declarator function-transaction-block
23062 The parser flags FLAGS is used to control type-specifier parsing.
23064 The DECL_SPECIFIERS apply to this declarator. Returns a
23065 representation of the entity declared. If MEMBER_P is TRUE, then
23066 this declarator appears in a class scope. The new DECL created by
23067 this declarator is returned.
23069 The CHECKS are access checks that should be performed once we know
23070 what entity is being declared (and, therefore, what classes have
23071 befriended it).
23073 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
23074 for a function-definition here as well. If the declarator is a
23075 declarator for a function-definition, *FUNCTION_DEFINITION_P will
23076 be TRUE upon return. By that point, the function-definition will
23077 have been completely parsed.
23079 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
23080 is FALSE.
23082 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
23083 parsed declaration if it is an uninitialized single declarator not followed
23084 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
23085 if present, will not be consumed. If returned, this declarator will be
23086 created with SD_INITIALIZED but will not call cp_finish_decl.
23088 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
23089 and there is an initializer, the pointed location_t is set to the
23090 location of the '=' or `(', or '{' in C++11 token introducing the
23091 initializer. */
23093 static tree
23095 cp_parser_flags flags,
23105 {
23109 tree prefix_attributes;
23111 tree asm_specification;
23112 tree initializer;
23114 tree scope;
23116 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
23117 initialized with "= ..", CPP_OPEN_PAREN if initialized with
23118 "(...)". */
23133 /* Assume that this is not the declarator for a function
23134 definition. */
23138 /* Default arguments are only permitted for function parameters. */
23142 /* Defer access checks while parsing the declarator; we cannot know
23143 what names are accessible until we know what is being
23144 declared. */
23149 /* Parse the declarator. */
23150 declarator
23155 /* Gather up the deferred checks. */
23160 /* If the DECLARATOR was erroneous, there's no need to go
23161 further. */
23165 /* Check that the number of template-parameter-lists is OK. */
23175 /* Figure out what scope the entity declared by the DECLARATOR is
23176 located in. `grokdeclarator' sometimes changes the scope, so
23177 we compute it now. */
23180 /* Perform any lookups in the declared type which were thought to be
23181 dependent, but are not in the scope of the declarator. */
23182 decl_specifiers->type
23185 /* If we're allowing GNU extensions, look for an
23186 asm-specification. */
23188 {
23189 /* Look for an asm-specification. */
23192 }
23193 else
23196 /* Gather the attributes that were provided with the
23197 decl-specifiers. */
23200 /* Look for attributes. */
23204 /* Peek at the next token. */
23210 {
23211 /* Handle C++17 deduction guides. Note that class-scope
23212 non-template deduction guides are instead handled in
23213 cp_parser_member_declaration. */
23215 decl_specifiers,
23216 declarator,
23222 /* Check to see if the token indicates the start of a
23223 function-definition. */
23225 {
23227 {
23228 /* If a function-definition should not appear here, issue an
23229 error message. */
23233 }
23235 location_t func_brace_location
23238 /* Neither attributes nor an asm-specification are allowed
23239 on a function-definition. */
23242 "an %<asm%> specification is not allowed "
23246 "attributes are not allowed "
23248 /* This is a function-definition. */
23251 /* Parse the function definition. */
23254 decl_specifiers,
23255 declarator,
23256 prefix_attributes);
23257 else
23258 decl =
23259 (cp_parser_function_definition_from_specifiers_and_declarator
23263 {
23264 /* This is where the prologue starts... */
23267 }
23270 }
23271 }
23273 {
23274 /* A non-template declaration involving a function parameter list
23275 containing an implicit template parameter will be made into a
23276 template. If the resulting declaration is not going to be an
23277 actual function then finish the template scope here to prevent it.
23278 An error message will be issued once we have a decl to talk about.
23280 FIXME probably we should do type deduction rather than create an
23281 implicit template, but the standard currently doesn't allow it. */
23284 }
23286 /* [dcl.dcl]
23288 Only in function declarations for constructors, destructors, type
23289 conversions, and deduction guides can the decl-specifier-seq be omitted.
23291 We explicitly postpone this check past the point where we handle
23292 function-definitions because we tolerate function-definitions
23293 that are missing their return types in some modes. */
23295 {
23299 }
23301 /* An `=' or an '{' in C++11, indicate an initializer. An '(' may indicate
23302 an initializer as well. */
23306 {
23307 /* Don't get fooled into thinking that F(i)(1)(2) is an initializer.
23308 It isn't; it's an expression. (Here '(i)' would have already been
23309 parsed as a declarator.) */
23312 {
23319 /* If this is an initializer, only a ',' or ';' can follow: either
23320 we have another init-declarator, or we're at the end of an
23321 init-declarator-list which can only be followed by a ';'. */
23326 /* Not an init-declarator. */
23328 }
23340 {
23346 }
23347 }
23348 else
23349 {
23350 /* If the init-declarator isn't initialized and isn't followed by a
23351 `,' or `;', it's not a valid init-declarator. */
23354 {
23357 else
23358 {
23362 }
23363 }
23366 }
23368 /* Because start_decl has side-effects, we should only call it if we
23369 know we're going ahead. By this point, we know that we cannot
23370 possibly be looking at any other construct. */
23373 /* Enter the newly declared entry in the symbol table. If we're
23374 processing a declaration in a class-specifier, we wait until
23375 after processing the initializer. */
23377 {
23385 /* Adjust location of decl if declarator->id_loc is more appropriate:
23386 set, and decl wasn't merged with another decl, in which case its
23387 location would be different from input_location, and more accurate. */
23392 }
23394 /* Enter the SCOPE. That way unqualified names appearing in the
23395 initializer will be looked up in SCOPE. */
23398 /* Perform deferred access control checks, now that we know in which
23399 SCOPE the declared entity resides. */
23401 {
23404 /* If the entity being declared is a function, pretend that we
23405 are in its scope. If it is a `friend', it may have access to
23406 things that would not otherwise be accessible. */
23408 {
23411 }
23413 /* Perform access checks for template parameters. */
23416 /* Perform the access control checks for the declarator and the
23417 decl-specifiers. */
23420 /* Restore the saved value. */
23423 }
23425 /* Parse the initializer. */
23430 {
23432 {
23435 else
23436 {
23437 /* If the declaration was erroneous, we don't really
23438 know what the user intended, so just silently
23439 consume the initializer. */
23446 }
23447 }
23448 else
23449 {
23450 /* We want to record the extra mangling scope for in-class
23451 initializers of class members and initializers of static
23452 data member templates and namespace-scope initializers.
23453 The former involves deferring parsing of the initializer
23454 until end of class as with default arguments. So right
23455 here we only handle the latter two. */
23459 && !member_p
23472 }
23473 }
23475 /* The old parser allows attributes to appear after a parenthesized
23476 initializer. Mark Mitchell proposed removing this functionality
23477 on the GCC mailing lists on 2002-08-13. This parser accepts the
23478 attributes -- but ignores them. Made a permerror in GCC 8. */
23484 {
23487 {
23491 }
23492 }
23494 /* And now complain about a non-function implicit template. */
23499 /* For an in-class declaration, use `grokfield' to create the
23500 declaration. */
23502 {
23504 {
23507 }
23516 }
23518 /* Finish processing the declaration. But, skip member
23519 declarations. */
23521 {
23524 asm_specification,
23525 /* If the initializer is in parentheses, then this is
23526 a direct-initialization, which means that an
23527 `explicit' constructor is OK. Otherwise, an
23528 `explicit' constructor cannot be used. */
23531 }
23534 /* Core issue #226 (C++0x only): A default template-argument
23535 shall not be specified in a friend class template
23536 declaration. */
23545 {
23548 else
23550 }
23557 }
23559 /* Parse a declarator.
23561 declarator:
23562 direct-declarator
23563 ptr-operator declarator
23565 abstract-declarator:
23566 ptr-operator abstract-declarator [opt]
23567 direct-abstract-declarator
23569 GNU Extensions:
23571 declarator:
23572 attributes [opt] direct-declarator
23573 attributes [opt] ptr-operator declarator
23575 abstract-declarator:
23576 attributes [opt] ptr-operator abstract-declarator [opt]
23577 attributes [opt] direct-abstract-declarator
23579 The parser flags FLAGS is used to control type-specifier parsing.
23581 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
23582 detect constructors, destructors, deduction guides, or conversion operators.
23583 It is set to -1 if the declarator is a name, and +1 if it is a
23584 function. Otherwise it is set to zero. Usually you just want to
23585 test for >0, but internally the negative value is used.
23587 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
23588 a decl-specifier-seq unless it declares a constructor, destructor,
23589 or conversion. It might seem that we could check this condition in
23590 semantic analysis, rather than parsing, but that makes it difficult
23591 to handle something like `f()'. We want to notice that there are
23592 no decl-specifiers, and therefore realize that this is an
23593 expression, not a declaration.)
23595 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
23596 the declarator is a direct-declarator of the form "(...)".
23598 MEMBER_P is true iff this declarator is a member-declarator.
23600 FRIEND_P is true iff this declarator is a friend.
23602 STATIC_P is true iff the keyword static was seen. */
23606 cp_parser_declarator_kind dcl_kind,
23607 cp_parser_flags flags,
23611 {
23614 cp_cv_quals cv_quals;
23615 tree class_type;
23618 /* Assume this is not a constructor, destructor, or type-conversion
23619 operator. */
23626 /* Check for the ptr-operator production. */
23628 /* Parse the ptr-operator. */
23634 /* If that worked, then we have a ptr-operator. */
23636 {
23637 /* If a ptr-operator was found, then this declarator was not
23638 parenthesized. */
23641 /* The dependent declarator is optional if we are parsing an
23642 abstract-declarator. */
23646 /* Parse the dependent declarator. */
23652 /* If we are parsing an abstract-declarator, we must handle the
23653 case where the dependent declarator is absent. */
23658 declarator = cp_parser_make_indirect_declarator
23660 }
23661 /* Everything else is a direct-declarator. */
23662 else
23663 {
23666 CPP_OPEN_PAREN);
23670 }
23675 }
23677 /* Parse a direct-declarator or direct-abstract-declarator.
23679 direct-declarator:
23680 declarator-id
23681 direct-declarator ( parameter-declaration-clause )
23682 cv-qualifier-seq [opt]
23683 ref-qualifier [opt]
23684 exception-specification [opt]
23685 direct-declarator [ constant-expression [opt] ]
23686 ( declarator )
23688 direct-abstract-declarator:
23689 direct-abstract-declarator [opt]
23690 ( parameter-declaration-clause )
23691 cv-qualifier-seq [opt]
23692 ref-qualifier [opt]
23693 exception-specification [opt]
23694 direct-abstract-declarator [opt] [ constant-expression [opt] ]
23695 ( abstract-declarator )
23697 Returns a representation of the declarator. DCL_KIND is
23698 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
23699 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
23700 we are parsing a direct-declarator. It is
23701 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
23702 of ambiguity we prefer an abstract declarator, as per
23703 [dcl.ambig.res].
23704 The parser flags FLAGS is used to control type-specifier parsing.
23705 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
23706 as for cp_parser_declarator. */
23710 cp_parser_declarator_kind dcl_kind,
23711 cp_parser_flags flags,
23714 {
23725 {
23726 /* Peek at the next token. */
23729 {
23730 /* This is either a parameter-declaration-clause, or a
23731 parenthesized declarator. When we know we are parsing a
23732 named declarator, it must be a parenthesized declarator
23733 if FIRST is true. For instance, `(int)' is a
23734 parameter-declaration-clause, with an omitted
23735 direct-abstract-declarator. But `((*))', is a
23736 parenthesized abstract declarator. Finally, when T is a
23737 template parameter `(T)' is a
23738 parameter-declaration-clause, and not a parenthesized
23739 named declarator.
23741 We first try and parse a parameter-declaration-clause,
23742 and then try a nested declarator (if FIRST is true).
23744 It is not an error for it not to be a
23745 parameter-declaration-clause, even when FIRST is
23746 false. Consider,
23748 int i (int);
23749 int i (3);
23751 The first is the declaration of a function while the
23752 second is the definition of a variable, including its
23753 initializer.
23755 Having seen only the parenthesis, we cannot know which of
23756 these two alternatives should be selected. Even more
23757 complex are examples like:
23759 int i (int (a));
23760 int i (int (3));
23762 The former is a function-declaration; the latter is a
23763 variable initialization.
23765 Thus again, we try a parameter-declaration-clause, and if
23766 that fails, we back out and return. */
23769 {
23770 tree params;
23775 /* In a member-declarator, the only valid interpretation
23776 of a parenthesis is the start of a
23777 parameter-declaration-clause. (It is invalid to
23778 initialize a static data member with a parenthesized
23779 initializer; only the "=" form of initialization is
23780 permitted.) */
23784 /* Consume the `('. */
23786 matching_parens parens;
23789 {
23790 /* If this is going to be an abstract declarator, we're
23791 in a declarator and we can't have default args. */
23794 }
23798 /* Parse the parameter-declaration-clause. */
23799 params
23801 const location_t parens_end
23804 /* Consume the `)'. */
23807 /* For code like
23808 int x(auto(42));
23809 A a(auto(i), 42);
23810 we have synthesized an implicit template parameter and marked
23811 what we thought was a function as an implicit function template.
23812 But now, having seen the whole parameter list, we know it's not
23813 a function declaration, so undo that. */
23816 /* Don't do this for the inner (). */
23820 /* If all went well, parse the cv-qualifier-seq,
23821 ref-qualifier and the exception-specification. */
23823 {
23824 cp_cv_quals cv_quals;
23825 cp_virt_specifiers virt_specifiers;
23826 cp_ref_qualifier ref_qual;
23827 tree exception_specification;
23828 tree late_return;
23829 tree attrs;
23832 unsigned char local_variables_forbidden_p
23834 /* 'this' is not allowed in static member functions. */
23844 /* Parse the cv-qualifier-seq. */
23846 /* Parse the ref-qualifier. */
23848 /* Parse the tx-qualifier. */
23854 /* DR 1207: 'this' is in scope after the cv-quals. */
23857 /* If it turned out that this is e.g. a pointer to a
23858 function, we don't want to delay noexcept parsing. */
23862 /* Parse the exception-specification. */
23863 exception_specification
23865 flags);
23869 cp_omp_declare_simd_data odsd;
23871 && declarator
23874 {
23878 }
23880 /* In here, we handle cases where attribute is used after
23881 the function declaration. For example:
23882 void func (int x) __attribute__((vector(..))); */
23885 late_return
23887 requires_clause);
23891 /* Parse the virt-specifier-seq. */
23895 parens_start,
23896 parens_end);
23897 /* Create the function-declarator. */
23899 params,
23900 cv_quals,
23901 virt_specifiers,
23902 ref_qual,
23903 tx_qual,
23904 exception_specification,
23905 late_return,
23906 requires_clause,
23907 attrs,
23908 parens_loc);
23910 /* Any subsequent parameter lists are to do with
23911 return type, so are not those of the declared
23912 function. */
23918 /* Restore the state of local_variables_forbidden_p. */
23919 parser->local_variables_forbidden_p
23921 }
23923 /* Remove the function parms from scope. */
23927 /* Repeat the main loop. */
23929 }
23931 /* If this is the first, we can try a parenthesized
23932 declarator. */
23934 {
23941 /* Consume the `('. */
23942 matching_parens parens;
23944 /* Parse the nested declarator. */
23947 declarator
23949 ctor_dtor_or_conv_p,
23955 /* Expect a `)'. */
23963 }
23964 /* Otherwise, we must be done. */
23965 else
23967 }
23971 {
23972 /* Parse an array-declarator. */
23982 /* Consume the `['. */
23984 /* Peek at the next token. */
23986 /* If the next token is `]', then there is no
23987 constant-expression. */
23989 {
23991 bounds
24003 {
24004 /* Normally, the array bound must be an integral constant
24005 expression. However, as an extension, we allow VLAs
24006 in function scopes as long as they aren't part of a
24007 parameter declaration. */
24011 }
24014 {
24015 /* Remember this wasn't a constant-expression. */
24018 }
24019 }
24020 else
24022 /* Look for the closing `]'. */
24024 {
24027 }
24032 }
24034 {
24035 {
24036 tree qualifying_scope;
24037 tree unqualified_name;
24038 tree attrs;
24039 special_function_kind sfk;
24044 /* Parse a declarator-id */
24047 {
24050 /* If we see an ellipsis, we should be looking at a
24051 parameter pack. */
24053 {
24054 /* Consume the `...' */
24058 }
24059 }
24062 unqualified_name
24066 {
24070 {
24071 /* Check whether an error occurred. */
24074 /* We already consumed the ellipsis to mark a
24075 parameter pack, but we have no way to report it,
24076 so abort the tentative parse. We will be exiting
24077 immediately anyway. */
24079 }
24080 else
24086 && (qualifying_scope
24088 {
24091 }
24092 }
24097 {
24102 }
24108 {
24109 /* In the declaration of a member of a template class
24110 outside of the class itself, the SCOPE will sometimes
24111 be a TYPENAME_TYPE. For example, given:
24113 template <typename T>
24114 int S<T>::R::i = 3;
24116 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
24117 this context, we must resolve S<T>::R to an ordinary
24118 type, rather than a typename type.
24120 The reason we normally avoid resolving TYPENAME_TYPEs
24121 is that a specialization of `S' might render
24122 `S<T>::R' not a type. However, if `S' is
24123 specialized, then this `i' will not be used, so there
24124 is no harm in resolving the types here. */
24125 tree type;
24127 /* Resolve the TYPENAME_TYPE. */
24130 /* If that failed, the declarator is invalid. */
24132 {
24135 "cannot define member of dependent typedef "
24137 else
24142 }
24144 }
24149 {
24150 tree class_type;
24155 else
24159 {
24163 {
24164 /* We do not attempt to print the declarator
24165 here because we do not have enough
24166 information about its original syntactic
24167 form. */
24171 }
24174 {
24178 "use %<%T::%D%> instead of %<%T::%D%> to "
24180 class_type,
24185 }
24187 }
24190 {
24197 for an unnamed type, even if the type
24198 got a name for linkage purposes. */
24200 /* Handle correctly (c++/19200):
24202 struct S {
24203 struct T{};
24204 friend void S(T);
24205 };
24207 and also:
24209 namespace N {
24210 void S();
24211 }
24213 struct S {
24214 friend void N::S();
24215 }; */
24218 class_type))
24227 }
24228 }
24230 unqualified_name,
24238 /* We're looking for this case in [temp.res]:
24239 A qualified-id is assumed to name a type if [...]
24240 - it is a decl-specifier of the decl-specifier-seq of a
24241 parameter-declaration in a declarator of a function or
24242 function template declaration, ... */
24248 {
24249 /* ...whose declarator-id is qualified. If it isn't, never
24250 assume the parameters to refer to types. */
24253 else
24254 {
24255 /* Now we have something like
24256 template <typename T> int C::x(S::p);
24257 which can be a function template declaration or a
24258 variable template definition. If name lookup for
24259 the declarator-id C::x finds one or more function
24260 templates, assume S::p to name a type. Otherwise,
24261 don't. */
24262 tree decl
24264 none_type,
24272 /* Allow
24273 template<typename T>
24274 A<T>::A(T::type) { } */
24277 qualifying_scope)))
24279 }
24280 }
24281 }
24283 handle_declarator:;
24286 {
24287 /* Any names that appear after the declarator-id for a
24288 member are looked up in the containing scope. */
24290 {
24291 /* But declarations with qualified-ids can't appear in a
24292 function. */
24296 }
24298 }
24302 /* Default args are only allowed on function
24303 declarations. */
24305 else
24309 }
24310 /* We're done. */
24311 else
24313 }
24315 /* For an abstract declarator, we might wind up with nothing at this
24316 point. That's an error; the declarator is not optional. */
24320 {
24321 /* Record overly parenthesized declarator so we can give a
24322 diagnostic about confusing decl/expr disambiguation. */
24324 {
24325 /* If the open and close parens are on different lines, this
24326 is probably a formatting thing, so ignore. */
24331 }
24336 }
24338 /* If we entered a scope, we must exit it now. */
24346 }
24348 /* Parse a ptr-operator.
24350 ptr-operator:
24351 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24352 * cv-qualifier-seq [opt]
24353 &
24354 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
24355 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24357 GNU Extension:
24359 ptr-operator:
24360 & cv-qualifier-seq [opt]
24362 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
24363 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
24364 an rvalue reference. In the case of a pointer-to-member, *TYPE is
24365 filled in with the TYPE containing the member. *CV_QUALS is
24366 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
24367 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
24368 Note that the tree codes returned by this function have nothing
24369 to do with the types of trees that will be eventually be created
24370 to represent the pointer or reference type being parsed. They are
24371 just constants with suggestive names. */
24372 static enum tree_code
24377 {
24382 /* Assume that it's not a pointer-to-member. */
24384 /* And that there are no cv-qualifiers. */
24387 /* Peek at the next token. */
24390 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
24400 {
24401 /* Consume the `*', `&' or `&&'. */
24404 /* A `*' can be followed by a cv-qualifier-seq, and so can a
24405 `&', if we are allowing GNU extensions. (The only qualifier
24406 that can legally appear after `&' is `restrict', but that is
24407 enforced during semantic analysis. */
24415 }
24416 else
24417 {
24418 /* Try the pointer-to-member case. */
24420 /* Look for the optional `::' operator. */
24423 /* Look for the nested-name specifier. */
24430 /* If we found it, and the next token is a `*', then we are
24431 indeed looking at a pointer-to-member operator. */
24434 {
24435 /* Indicate that the `*' operator was used. */
24443 else
24444 {
24445 /* The type of which the member is a member is given by the
24446 current SCOPE. */
24448 /* The next name will not be qualified. */
24452 /* Look for optional c++11 attributes. */
24456 /* Look for the optional cv-qualifier-seq. */
24458 }
24459 }
24460 /* If that didn't work we don't have a ptr-operator. */
24463 }
24466 }
24468 /* Parse an (optional) cv-qualifier-seq.
24470 cv-qualifier-seq:
24471 cv-qualifier cv-qualifier-seq [opt]
24473 cv-qualifier:
24474 const
24475 volatile
24477 GNU Extension:
24479 cv-qualifier:
24480 __restrict__
24482 Returns a bitmask representing the cv-qualifiers. */
24484 static cp_cv_quals
24486 {
24490 {
24492 cp_cv_quals cv_qualifier;
24494 /* Peek at the next token. */
24496 /* See if it's a cv-qualifier. */
24498 {
24514 }
24520 {
24525 }
24526 else
24527 {
24530 }
24531 }
24534 }
24536 /* Parse an (optional) ref-qualifier
24538 ref-qualifier:
24539 &
24540 &&
24542 Returns cp_ref_qualifier representing ref-qualifier. */
24544 static cp_ref_qualifier
24546 {
24549 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
24554 {
24559 {
24571 }
24576 {
24579 }
24580 else
24581 {
24584 }
24585 }
24588 }
24590 /* Parse an optional tx-qualifier.
24592 tx-qualifier:
24593 transaction_safe
24594 transaction_safe_dynamic */
24596 static tree
24598 {
24601 {
24606 {
24610 {
24613 {
24616 }
24617 else
24619 }
24620 }
24621 }
24623 }
24625 /* Parse an (optional) virt-specifier-seq.
24627 virt-specifier-seq:
24628 virt-specifier virt-specifier-seq [opt]
24630 virt-specifier:
24631 override
24632 final
24634 Returns a bitmask representing the virt-specifiers. */
24636 static cp_virt_specifiers
24638 {
24642 {
24644 cp_virt_specifiers virt_specifier;
24646 /* Peek at the next token. */
24648 /* See if it's a virt-specifier-qualifier. */
24652 {
24655 }
24657 {
24660 }
24662 {
24664 }
24665 else
24669 {
24674 }
24675 else
24676 {
24679 }
24680 }
24682 }
24684 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
24685 is in scope even though it isn't real. */
24687 void
24689 {
24690 tree this_parm;
24693 {
24694 /* We don't clear this between NSDMIs. Is it already what we want? */
24701 }
24704 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
24706 current_class_ref
24709 }
24711 /* Return true iff our current scope is a non-static data member
24712 initializer. */
24714 bool
24716 {
24717 /* We recognize NSDMI context by the context-less 'this' pointer set up
24718 by the function above. */
24724 }
24726 /* True if we're parsing a function declarator. */
24728 bool
24730 {
24731 /* this_entity is NULL for a function parameter scope while parsing the
24732 declarator; it is set when parsing the body of the function. */
24735 }
24737 /* Parse a late-specified return type, if any. This is not a separate
24738 non-terminal, but part of a function declarator, which looks like
24740 -> trailing-type-specifier-seq abstract-declarator(opt)
24742 Returns the type indicated by the type-id.
24744 In addition to this, parse any queued up #pragma omp declare simd
24745 clauses, and #pragma acc routine clauses.
24747 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
24748 function. */
24750 static tree
24753 {
24757 && declarator
24761 && declarator
24764 /* Peek at the next token. */
24766 /* A late-specified return type is indicated by an initial '->'. */
24775 {
24776 /* Consume the ->. */
24780 }
24782 /* Function declarations may be followed by a trailing
24783 requires-clause. */
24787 declarator->attributes
24791 declarator->attributes
24796 }
24798 /* Parse a declarator-id.
24800 declarator-id:
24801 id-expression
24802 :: [opt] nested-name-specifier [opt] type-name
24804 In the `id-expression' case, the value returned is as for
24805 cp_parser_id_expression if the id-expression was an unqualified-id.
24806 If the id-expression was a qualified-id, then a SCOPE_REF is
24807 returned. The first operand is the scope (either a NAMESPACE_DECL
24808 or TREE_TYPE), but the second is still just a representation of an
24809 unqualified-id. */
24811 static tree
24813 {
24814 tree id;
24815 /* The expression must be an id-expression. Assume that qualified
24816 names are the names of types so that:
24818 template <class T>
24819 int S<T>::R::i = 3;
24821 will work; we must treat `S<T>::R' as the name of a type.
24822 Similarly, assume that qualified names are templates, where
24823 required, so that:
24825 template <class T>
24826 int S<T>::R<T>::i = 3;
24828 will work, too. */
24834 optional_p);
24838 }
24840 /* Parse a type-id.
24842 type-id:
24843 type-specifier-seq abstract-declarator [opt]
24845 The parser flags FLAGS is used to control type-specifier parsing.
24847 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
24849 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24850 i.e. we've just seen "->".
24852 Returns the TYPE specified. */
24854 static tree
24858 {
24859 cp_decl_specifier_seq type_specifier_seq;
24862 /* Parse the type-specifier-seq. */
24865 is_trailing_return,
24873 /* A bare template name as a template argument is a template template
24874 argument, not a placeholder, so fail parsing it as a type argument. */
24875 {
24879 }
24883 /* There might or might not be an abstract declarator. */
24885 /* Look for the declarator. */
24886 abstract_declarator
24893 /* Check to see if there really was a declarator. */
24898 /* The concepts TS allows 'auto' as a type-id. */
24901 /* DR 625 prohibits use of auto as a template-argument. We allow 'auto'
24902 outside the template-argument-list context here only for the sake of
24903 diagnostic: grokdeclarator then can emit a better error message for
24904 e.g. using T = auto. */
24910 && !auto_typeid_ok
24911 /* None of the valid uses of 'auto' in C++14 involve the type-id
24912 nonterminal, but it is valid in a trailing-return-type. */
24915 {
24916 /* A type-id with type 'auto' is only ok if the abstract declarator
24917 is a function declarator with a late-specified return type.
24919 A type-id with 'auto' is also valid in a trailing-return-type
24920 in a compound-requirement. */
24927 else
24928 {
24930 {
24933 {
24934 auto_diagnostic_group g;
24938 tmpl);
24940 tmpl);
24941 }
24944 auto_node);
24945 else
24947 }
24949 }
24950 }
24953 is_template_arg);
24954 }
24956 /* Wrapper for cp_parser_type_id_1. */
24958 static tree
24961 {
24963 }
24965 /* Wrapper for cp_parser_type_id_1. */
24967 static tree
24969 {
24970 tree r;
24972 parser->type_definition_forbidden_message
24977 }
24979 /* Wrapper for cp_parser_type_id_1. */
24981 static tree
24983 {
24986 }
24988 /* Parse a type-specifier-seq.
24990 type-specifier-seq:
24991 type-specifier type-specifier-seq [opt]
24993 GNU extension:
24995 type-specifier-seq:
24996 attributes type-specifier-seq [opt]
24998 The parser flags FLAGS is used to control type-specifier parsing.
25000 If IS_DECLARATION is true, we are at the start of a "condition" or
25001 exception-declaration, so we might be followed by a declarator-id.
25003 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
25004 i.e. we've just seen "->".
25006 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
25008 static void
25010 cp_parser_flags flags,
25014 {
25018 /* Clear the TYPE_SPECIFIER_SEQ. */
25022 /* In the context of a trailing return type, enum E { } is an
25023 elaborated-type-specifier followed by a function-body, not an
25024 enum-specifier. */
25028 /* Parse the type-specifiers and attributes. */
25030 {
25031 tree type_specifier;
25034 /* Check for attributes first. */
25036 {
25037 /* GNU attributes at the end of a declaration apply to the
25038 declaration as a whole, not to the trailing return type. So look
25039 ahead to see if these attributes are at the end. */
25042 {
25048 }
25049 type_specifier_seq->attributes
25053 }
25055 /* record the token of the beginning of the type specifier seq,
25056 for error reporting purposes*/
25060 /* Look for the type-specifier. */
25062 flags,
25063 type_specifier_seq,
25065 NULL,
25068 {
25069 /* If the first type-specifier could not be found, this is not a
25070 type-specifier-seq at all. */
25072 {
25073 /* Set in_declarator_p to avoid skipping to the semicolon. */
25085 }
25086 /* If subsequent type-specifiers could not be found, the
25087 type-specifier-seq is complete. */
25089 }
25092 /* The standard says that a condition can be:
25094 type-specifier-seq declarator = assignment-expression
25096 However, given:
25098 struct S {};
25099 if (int S = ...)
25101 we should treat the "S" as a declarator, not as a
25102 type-specifier. The standard doesn't say that explicitly for
25103 type-specifier-seq, but it does say that for
25104 decl-specifier-seq in an ordinary declaration. Perhaps it
25105 would be clearer just to allow a decl-specifier-seq here, and
25106 then add a semantic restriction that if any decl-specifiers
25107 that are not type-specifiers appear, the program is invalid. */
25110 }
25111 }
25113 /* Return whether the function currently being declared has an associated
25114 template parameter list. */
25116 static bool
25118 {
25131 }
25133 /* Parse a parameter-declaration-clause.
25135 parameter-declaration-clause:
25136 parameter-declaration-list [opt] ... [opt]
25137 parameter-declaration-list , ...
25139 The parser flags FLAGS is used to control type-specifier parsing.
25141 Returns a representation for the parameter declarations. A return
25142 value of NULL indicates a parameter-declaration-clause consisting
25143 only of an ellipsis. */
25145 static tree
25147 cp_parser_flags flags)
25148 {
25149 tree parameters;
25157 && !processing_template_parmlist
25158 && !processing_explicit_instantiation
25159 /* default_arg_ok_p tracks whether this is a parameter-clause for an
25160 actual function or a random abstract declarator. */
25166 /* Peek at the next token. */
25168 /* Check for trivial parameter-declaration-clauses. */
25170 {
25171 /* Consume the `...' token. */
25174 }
25176 /* There are no parameters. */
25178 /* Check for `(void)', too, which is a special case. */
25182 {
25183 /* Consume the `void' token. */
25185 /* There are no parameters. */
25187 }
25189 /* A vector of parameters that haven't been pushed yet. */
25192 /* Parse the parameter-declaration-list. */
25195 /* If a parse error occurred while parsing the
25196 parameter-declaration-list, then the entire
25197 parameter-declaration-clause is erroneous. */
25201 /* Peek at the next token. */
25203 /* If it's a `,', the clause should terminate with an ellipsis. */
25205 {
25206 /* Consume the `,'. */
25208 /* Expect an ellipsis. */
25209 ellipsis_p
25211 }
25212 /* It might also be `...' if the optional trailing `,' was
25213 omitted. */
25215 {
25216 /* Consume the `...' token. */
25218 /* And remember that we saw it. */
25220 }
25221 else
25224 /* A valid parameter-declaration-clause can only be followed by a ')'.
25225 So it's time to push all the parameters we have seen now that we
25226 know we have a valid declaration. Note that here we may not have
25227 committed yet, nor should we. Pushing here will detect the error
25228 of redefining a parameter. */
25230 {
25234 /* Delayed checking of auto parameters. */
25239 {
25243 }
25244 }
25246 /* Finish the parameter list. */
25251 }
25253 /* Parse a parameter-declaration-list.
25255 parameter-declaration-list:
25256 parameter-declaration
25257 parameter-declaration-list , parameter-declaration
25259 The parser flags FLAGS is used to control type-specifier parsing.
25260 PENDING_DECLS is a vector of parameters that haven't been pushed yet.
25262 Returns a representation of the parameter-declaration-list, as for
25263 cp_parser_parameter_declaration_clause. However, the
25264 `void_list_node' is never appended to the list. */
25266 static tree
25268 cp_parser_flags flags,
25270 {
25276 /* The special considerations that apply to a function within an
25277 unbraced linkage specifications do not apply to the parameters
25278 to the function. */
25279 saved_in_unbraced_linkage_specification_p
25283 /* Look for more parameters. */
25285 {
25290 /* Parse the parameter. */
25291 parameter
25296 /* We don't know yet if the enclosing context is unavailable or deprecated,
25297 so wait and deal with it in grokparms if appropriate. */
25301 {
25304 PARM,
25309 }
25313 /* If a parse error occurred parsing the parameter declaration,
25314 then the entire parameter-declaration-list is erroneous. */
25316 {
25319 }
25326 {
25327 /* We cannot always pushdecl while parsing tentatively because
25328 it may have side effects and we can't be sure yet if we're
25329 parsing a declaration, e.g.:
25331 S foo(int(x), int(x), int{x});
25333 where it's not clear if we're dealing with a constructor call
25334 or a function declaration until we've seen the last argument
25335 which breaks it up.
25336 It's safe to pushdecl so long as it doesn't result in a clash
25337 with an already-pushed parameter. But we don't delay pushing
25338 different parameters to handle
25340 S foo(int(i), decltype(i) j = 42);
25342 which is valid. */
25345 /* See if PARAMETERS already contains a parameter with the same
25346 DECL_NAME as DECL. */
25352 }())
25354 else
25356 }
25359 {
25363 }
25365 /* Add the new parameter to the list. */
25369 /* If the parameters were parenthesized, it's the case of
25370 T foo(X(x)) which looks like a variable definition but
25371 is a function declaration. */
25375 /* Peek at the next token. */
25378 /* These are for Objective-C++ */
25381 /* The parameter-declaration-list is complete. */
25384 {
25387 /* Peek at the next token. */
25389 /* If it's an ellipsis, then the list is complete. */
25392 /* Otherwise, there must be more parameters. Consume the
25393 `,'. */
25395 /* When parsing something like:
25397 int i(float f, double d)
25399 we can tell after seeing the declaration for "f" that we
25400 are not looking at an initialization of a variable "i",
25401 but rather at the declaration of a function "i".
25403 Due to the fact that the parsing of template arguments
25404 (as specified to a template-id) requires backtracking we
25405 cannot use this technique when inside a template argument
25406 list. */
25410 /* However, a parameter-declaration of the form
25411 "float(f)" (which is a valid declaration of a
25412 parameter "f") can also be interpreted as an
25413 expression (the conversion of "f" to "float"). */
25416 }
25417 else
25418 {
25426 }
25427 }
25429 parser->in_unbraced_linkage_specification_p
25432 /* Reset implicit_template_scope if we are about to leave the function
25433 parameter list that introduced it. Note that for out-of-line member
25434 definitions, there will be one or more class scopes before we get to
25435 the template parameter scope. */
25439 {
25443 {
25446 }
25447 }
25450 }
25452 /* Parse a parameter declaration.
25454 parameter-declaration:
25455 decl-specifier-seq ... [opt] declarator
25456 decl-specifier-seq declarator = assignment-expression
25457 decl-specifier-seq ... [opt] abstract-declarator [opt]
25458 decl-specifier-seq abstract-declarator [opt] = assignment-expression
25460 The parser flags FLAGS is used to control type-specifier parsing.
25462 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
25463 declares a template parameter. (In that case, a non-nested `>'
25464 token encountered during the parsing of the assignment-expression
25465 is not interpreted as a greater-than operator.)
25467 Returns a representation of the parameter, or NULL if an error
25468 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
25469 true iff the declarator is of the form "(p)". */
25473 cp_parser_flags flags,
25476 {
25478 cp_decl_specifier_seq decl_specifiers;
25480 tree default_argument;
25485 /* In a template parameter, `>' is not an operator.
25487 [temp.param]
25489 When parsing a default template-argument for a non-type
25490 template-parameter, the first non-nested `>' is taken as the end
25491 of the template parameter-list rather than a greater-than
25492 operator. */
25494 /* Type definitions may not appear in parameter types. */
25496 parser->type_definition_forbidden_message
25503 /* Parse the declaration-specifiers. */
25506 flags,
25510 /* [dcl.spec.auto.general]: "A placeholder-type-specifier of the form
25511 type-constraint opt auto can be used as a decl-specifier of the
25512 decl-specifier-seq of a parameter-declaration of a function declaration
25513 or lambda-expression..." but we must not synthesize an implicit template
25514 type parameter in its declarator. That is, in "void f(auto[auto{10}]);"
25515 we want to synthesize only the first auto. */
25519 /* Complain about missing 'typename' or other invalid type names. */
25524 /* If an error occurred, there's no reason to attempt to parse the
25525 rest of the declaration. */
25527 {
25530 }
25532 /* Peek at the next token. */
25535 /* If the next token is a `)', `,', `=', `>', or `...', then there
25536 is no declarator. However, when variadic templates are enabled,
25537 there may be a declarator following `...'. */
25542 {
25546 }
25547 /* Otherwise, there should be a declarator. */
25548 else
25549 {
25553 /* After seeing a decl-specifier-seq, if the next token is not a
25554 "(" or "{", there is no possibility that the code is a valid
25555 expression. Therefore, if parsing tentatively, we commit at
25556 this point. */
25558 /* In an expression context, having seen:
25560 (int((char ...
25562 we cannot be sure whether we are looking at a
25563 function-type (taking a "char" as a parameter) or a cast
25564 of some object of type "char" to "int". */
25568 {
25570 {
25573 /* This is a CTAD expression, not a parameter declaration. */
25575 }
25576 else
25578 }
25579 /* Parse the declarator. */
25582 CP_PARSER_DECLARATOR_EITHER,
25583 CP_PARSER_FLAGS_NONE,
25585 parenthesized_p,
25590 /* After the declarator, allow more attributes. */
25591 decl_specifiers.attributes
25595 /* If the declarator is a template parameter pack, remember that and
25596 clear the flag in the declarator itself so we don't get errors
25597 from grokdeclarator. */
25599 {
25602 }
25603 }
25605 /* If the next token is an ellipsis, and we have not seen a declarator
25606 name, and if either the type of the declarator contains parameter
25607 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
25608 for, eg, abbreviated integral type names), then we actually have a
25609 parameter pack expansion expression. Otherwise, leave the ellipsis
25610 for a C-style variadic function. */
25613 /* If a function parameter pack was specified and an implicit template
25614 parameter was introduced during cp_parser_parameter_declaration,
25615 change any implicit parameters introduced into packs. */
25620 {
25628 }
25631 {
25642 {
25643 /* Consume the `...'. */
25647 /* Build a pack expansion type */
25652 else
25654 }
25655 }
25657 /* The restriction on defining new types applies only to the type
25658 of the parameter, not to the default argument. */
25661 /* If the next token is `=', then process a default argument. */
25663 {
25668 /* If we are defining a class, then the tokens that make up the
25669 default argument must be saved and processed later. */
25675 /* A constrained-type-specifier may declare a type
25676 template-parameter. */
25678 default_argument
25681 /* A constrained-type-specifier may declare a
25682 template-template-parameter. */
25684 default_argument
25687 /* Outside of a class definition, we can just parse the
25688 assignment-expression. */
25689 else
25690 default_argument
25694 {
25696 "default arguments are only "
25698 }
25700 || template_parameter_pack_p
25703 {
25704 /* Find the name of the parameter pack. */
25711 template_parm_p
25717 else
25719 template_parm_p
25726 }
25727 }
25728 else
25735 {
25736 /* Xobj parameters can not have default arguments, thus
25737 we can reuse the default argument field to flag the param as such. */
25739 }
25741 /* Generate a location for the parameter, ranging from the start of the
25742 initial token to the end of the final token (using input_location for
25743 the latter, set up by cp_lexer_set_source_position_from_token when
25744 consuming tokens).
25746 If we have a identifier, then use it for the caret location, e.g.
25748 extern int callee (int one, int (*two)(int, int), float three);
25749 ~~~~~~^~~~~~~~~~~~~~
25751 otherwise, reuse the start location for the caret location e.g.:
25753 extern int callee (int one, int (*)(int, int), float three);
25754 ^~~~~~~~~~~~~~~~~
25756 */
25762 input_location);
25765 declarator,
25766 default_argument,
25767 param_loc,
25768 template_parameter_pack_p);
25769 }
25771 /* Parse a default argument and return it.
25773 TEMPLATE_PARM_P is true if this is a default argument for a
25774 non-type template parameter. */
25775 static tree
25777 {
25782 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
25783 set correctly. */
25790 /* Local variable names (and the `this' keyword) may not
25791 appear in a default argument. */
25794 /* Parse the assignment-expression. */
25799 /* The "this" pointer is not valid in a default argument. */
25801 {
25806 }
25808 /* Restore the "this" pointer. */
25810 {
25813 }
25822 }
25824 /* Parse a function-body.
25826 function-body:
25827 compound_statement */
25829 static void
25831 {
25835 }
25837 /* Parse a ctor-initializer-opt followed by a function-body. Return
25838 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
25839 is true we are parsing a function-try-block. */
25841 static void
25844 {
25846 const bool check_body_p
25854 {
25857 "function-try-block body of %<constexpr%> constructor only "
25859 else
25861 "function-try-block body of %<constexpr%> function only "
25863 }
25865 /* Begin the function body. */
25867 /* Parse the optional ctor-initializer. */
25870 /* If we're parsing a constexpr constructor definition, we need
25871 to check that the constructor body is indeed empty. However,
25872 before we get to cp_parser_function_body lot of junk has been
25873 generated, so we can't just check that we have an empty block.
25874 Rather we take a snapshot of the outermost block, and check whether
25875 cp_parser_function_body changed its state. */
25877 {
25881 }
25882 /* Parse the function-body. */
25886 /* Finish the function body. */
25888 }
25890 /* Parse an initializer.
25892 initializer:
25893 = initializer-clause
25894 ( expression-list )
25896 Returns an expression representing the initializer. If no
25897 initializer is present, NULL_TREE is returned.
25899 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
25900 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
25901 set to TRUE if there is no initializer present. If there is an
25902 initializer, and it is not a constant-expression, *NON_CONSTANT_P
25903 is set to true; otherwise it is set to false. */
25905 static tree
25908 {
25910 tree init;
25912 /* Peek at the next token. */
25915 /* Let our caller know whether or not this initializer was
25916 parenthesized. */
25919 /* Assume that the initializer is constant. */
25924 {
25925 /* Consume the `='. */
25927 /* Parse the initializer-clause. */
25929 }
25931 {
25936 non_constant_p);
25941 }
25943 {
25948 }
25949 else
25950 {
25951 /* Anything else is an error. */
25954 }
25960 }
25962 /* Parse an initializer-clause.
25964 initializer-clause:
25965 assignment-expression
25966 braced-init-list
25968 Returns an expression representing the initializer.
25970 If the `assignment-expression' production is used the value
25971 returned is simply a representation for the expression.
25973 Otherwise, calls cp_parser_braced_list. */
25975 static cp_expr
25977 {
25978 cp_expr initializer;
25980 /* Assume the expression is constant. */
25984 /* If it is not a `{', then we are looking at an
25985 assignment-expression. */
25987 {
25988 initializer
25991 non_constant_p);
25992 }
25993 else
25997 }
25999 /* Parse a brace-enclosed initializer list.
26001 braced-init-list:
26002 { initializer-list , [opt] }
26003 { designated-initializer-list , [opt] }
26004 { }
26006 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
26007 the elements of the initializer-list (or NULL, if the last
26008 production is used). The TREE_TYPE for the CONSTRUCTOR will be
26009 NULL_TREE. There is no way to detect whether or not the optional
26010 trailing `,' was provided. NON_CONSTANT_P is as for
26011 cp_parser_initializer. */
26013 static cp_expr
26015 {
26016 tree initializer;
26020 /* Consume the `{' token. */
26021 matching_braces braces;
26023 /* Create a CONSTRUCTOR to represent the braced-initializer. */
26025 /* If it's not a `}', then there is a non-trivial initializer. */
26027 {
26029 /* Parse the initializer list. */
26033 /* A trailing `,' token is allowed. */
26036 }
26039 /* Now, there should be a trailing `}'. */
26046 /* Build a location of the form:
26047 { ... }
26048 ^~~~~~~
26049 with caret==start at the open brace, finish at the close brace. */
26053 }
26055 /* Consume tokens up to, but not including, the next non-nested closing `]'.
26056 Returns true iff we found a closing `]'. */
26058 static bool
26060 {
26064 {
26068 {
26072 /* FALLTHRU */
26075 /* If we've run out of tokens, then there is no closing `]'. */
26089 }
26091 /* Consume the current token, skipping it. */
26093 }
26094 }
26096 /* Consume tokens up to, and including, the next non-nested closing `]'.
26097 Returns true iff we found a closing `]'. */
26099 static bool
26101 {
26106 }
26108 /* Return true if we are looking at an array-designator, false otherwise. */
26110 static bool
26112 {
26113 /* Consume the `['. */
26118 /* Skip tokens until the next token is a closing square bracket.
26119 If we find the closing `]', and the next token is a `=', then
26120 we are looking at an array designator. */
26121 bool array_designator_p
26125 /* Roll back the tokens we skipped. */
26129 }
26131 /* Parse an initializer-list.
26133 initializer-list:
26134 initializer-clause ... [opt]
26135 initializer-list , initializer-clause ... [opt]
26137 C++20 Extension:
26139 designated-initializer-list:
26140 designated-initializer-clause
26141 designated-initializer-list , designated-initializer-clause
26143 designated-initializer-clause:
26144 designator brace-or-equal-initializer
26146 designator:
26147 . identifier
26149 GNU Extension:
26151 initializer-list:
26152 designation initializer-clause ...[opt]
26153 initializer-list , designation initializer-clause ...[opt]
26155 designation:
26156 . identifier =
26157 identifier :
26158 [ constant-expression ] =
26160 Returns a vec of constructor_elt. The VALUE of each elt is an expression
26161 for the initializer. If the INDEX of the elt is non-NULL, it is the
26162 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
26163 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
26164 are any designators. */
26169 {
26174 /* Assume all of the expressions are constant. */
26181 /* Parse the rest of the list. */
26183 {
26185 tree designator;
26186 tree initializer;
26191 /* Handle the C++20 syntax, '. id ='. */
26199 {
26202 "C++ designated initializers only available with "
26204 /* Consume the `.'. */
26206 /* Consume the identifier. */
26209 /* Consume the `='. */
26211 else
26213 }
26214 /* Also, if the next token is an identifier and the following one is a
26215 colon, we are looking at the GNU designated-initializer
26216 syntax. */
26221 {
26222 /* Warn the user that they are using an extension. */
26225 /* Consume the identifier. */
26227 /* Consume the `:'. */
26229 }
26230 /* Also handle C99 array designators, '[ const ] ='. */
26234 {
26235 /* In C++11, [ could start a lambda-introducer. */
26241 {
26244 }
26245 else
26246 {
26251 }
26256 && (!require_potential_rvalue_constant_expression
26260 /* Warn the user that they are using an extension. */
26263 }
26264 else
26268 {
26271 }
26275 {
26279 }
26283 /* Parse the initializer. */
26286 ? &clause_non_constant_p
26288 /* If any clause is non-constant, so is the entire initializer. */
26293 /* This uses |= rather than = because C_I_D_I could have been set in
26294 cp_parser_functional_cast so we must be careful not to clear the
26295 flag. */
26298 /* If we have an ellipsis, this is an initializer pack
26299 expansion. */
26301 {
26304 /* Consume the `...'. */
26311 /* Turn the initializer into an initializer expansion. */
26313 }
26315 /* Add it to the vector. */
26318 /* If the next token is not a comma, we have reached the end of
26319 the list. */
26323 /* Peek at the next token. */
26325 /* If the next token is a `}', then we're still done. An
26326 initializer-clause can have a trailing `,' after the
26327 initializer-list and before the closing `}'. */
26331 /* Suppress location wrappers in a long initializer to save memory
26332 (14179). The cutoff is chosen arbitrarily. */
26336 /* Look one level down because it's easy. Looking deeper would require
26337 passing down a nelts pointer, and I don't think multi-level massive
26338 initializers are common enough to justify this. */
26344 /* Consume the `,' token. */
26346 }
26348 /* The same identifier shall not appear in multiple designators
26349 of a designated-initializer-list. */
26351 {
26356 {
26358 {
26360 "%<.%s%> designator used multiple times in "
26364 }
26365 else
26367 }
26371 }
26377 }
26379 /* Classes [gram.class] */
26381 /* Parse a class-name.
26383 class-name:
26384 identifier
26385 template-id
26387 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
26388 to indicate that names looked up in dependent types should be
26389 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
26390 keyword has been used to indicate that the name that appears next
26391 is a template. TAG_TYPE indicates the explicit tag given before
26392 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
26393 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
26394 is the class being defined in a class-head. If ENUM_OK is TRUE,
26395 enum-names are also accepted.
26397 Returns the TYPE_DECL representing the class. */
26399 static tree
26408 {
26409 tree decl;
26412 /* All class-names start with an identifier. */
26415 {
26418 }
26420 /* PARSER->SCOPE can be cleared when parsing the template-arguments
26421 to a template-id, so we save it here. Consider object scope too,
26422 so that make_typename_type below can use it (cp_parser_template_name
26423 considers object scope also). This may happen with code like
26425 p->template A<T>::a()
26427 where we first want to look up A<T>::a in the class of the object
26428 expression, as per [basic.lookup.classref]. */
26430 /* This only checks parser->scope to avoid duplicate errors; if
26431 ->object_type is erroneous, go on to give a parse error. */
26435 /* Any name names a type if we're following the `typename' keyword
26436 in a qualified name where the enclosing scope is type-dependent. */
26441 /* Handle the common case (an identifier, but not a template-id)
26442 efficiently. */
26445 {
26449 /* Look for the identifier. */
26453 /* If the next token isn't an identifier, we are certainly not
26454 looking at a class-name. */
26457 /* If we know this is a type-name, there's no need to look it
26458 up. */
26461 else
26462 {
26463 tree ambiguous_decls;
26464 /* If we already know that this lookup is ambiguous, then
26465 we've already issued an error message; there's no reason
26466 to check again. */
26468 {
26471 }
26472 /* If the next token is a `::', then the name must be a type
26473 name.
26475 [basic.lookup.qual]
26477 During the lookup for a name preceding the :: scope
26478 resolution operator, object, function, and enumerator
26479 names are ignored. */
26482 /* Look up the name. */
26484 tag_type,
26487 check_dependency_p,
26491 {
26495 }
26496 }
26497 }
26498 else
26499 {
26500 /* Try a template-id. */
26502 check_dependency_p,
26503 tag_type,
26504 is_declaration);
26507 }
26511 /* If this is a typename, create a TYPENAME_TYPE. */
26513 {
26518 }
26522 /* Check to see that it is really the name of a class. */
26526 /* Situations like this:
26528 template <typename T> struct A {
26529 typename T::template X<int>::I i;
26530 };
26532 are problematic. Is `T::template X<int>' a class-name? The
26533 standard does not seem to be definitive, but there is no other
26534 valid interpretation of the following `::'. Therefore, those
26535 names are considered class-names. */
26536 {
26540 }
26545 /* In Objective-C 2.0, a classname followed by '.' starts a
26546 dot-syntax expression, and it's not a type-name. */
26558 }
26560 /* Make sure that any member-function parameters are in scope.
26561 For instance, a function's noexcept-specifier can use the function's
26562 parameters:
26564 struct S {
26565 void fn (int p) noexcept(noexcept(p));
26566 };
26568 so we need to make sure name lookup can find them. This is used
26569 when we delay parsing of the noexcept-specifier. */
26571 static void
26573 {
26580 {
26584 }
26585 }
26587 /* Undo the effects of inject_parm_decls. */
26589 static void
26591 {
26594 }
26596 /* Parse a class-specifier.
26598 class-specifier:
26599 class-head { member-specification [opt] }
26601 Returns the TREE_TYPE representing the class. */
26603 tree
26605 {
26608 tree type;
26622 /* Parse the class-head. */
26625 /* If the class-head was a semantic disaster, skip the entire body
26626 of the class. */
26628 {
26632 }
26634 /* Look for the `{'. */
26635 matching_braces braces;
26637 {
26640 }
26645 /* Issue an error message if type-definitions are forbidden here. */
26647 /* Remember that we are defining one more class. */
26649 /* Inside the class, surrounding template-parameter-lists do not
26650 apply. */
26651 saved_num_template_parameter_lists
26654 /* We are not in a function body. */
26657 /* Or in a loop. */
26660 /* Or in a switch. */
26663 /* We are not immediately inside an extern "lang" block. */
26664 saved_in_unbraced_linkage_specification_p
26667 /* 'this' from an enclosing non-static member function is unavailable. */
26673 /* Start the class. */
26675 {
26677 /* SCOPE must be a scope nested inside current scope. */
26681 else
26683 }
26687 /* If the type is erroneous, skip the entire body of the class. */
26689 else
26690 /* Parse the member-specification. */
26693 /* Look for the trailing `}'. */
26695 /* Look for trailing attributes to apply to this class. */
26703 /* We've finished a type definition. Check for the common syntax
26704 error of forgetting a semicolon after the definition. We need to
26705 be careful, as we can't just check for not-a-semicolon and be done
26706 with it; the user might have typed:
26708 class X { } c = ...;
26709 class X { } *p = ...;
26711 and so forth. Instead, enumerate all the possible tokens that
26712 might follow this production; if we don't see one of them, then
26713 complain and silently insert the semicolon. */
26714 {
26719 /* Don't try to parse c++11 attributes here. As per the
26720 grammar, that should be a task for
26721 cp_parser_decl_specifier_seq. */
26725 {
26737 /* While it's legal for type qualifiers and storage class
26738 specifiers to follow type definitions in the grammar, only
26739 compiler testsuites contain code like that. Assume that if
26740 we see such code, then what we're really seeing is a case
26741 like:
26743 class X { }
26744 const <type> var = ...;
26746 or
26748 class Y { }
26749 static <type> func (...) ...
26751 i.e. the qualifier or specifier applies to the next
26752 declaration. To do so, however, we need to look ahead one
26753 more token to see if *that* token is a type specifier.
26755 This code could be improved to handle:
26757 class Z { }
26758 static const <type> var = ...; */
26761 {
26764 /* Handling user-defined types here would be nice, but very
26765 tricky. */
26766 want_semicolon
26769 }
26773 }
26775 /* If we don't have a type, then something is very wrong and we
26776 shouldn't try to do anything clever. Likewise for not seeing the
26777 closing brace. */
26779 {
26780 /* Locate the closing brace. */
26781 cp_token_position prev
26786 /* We want to suggest insertion of a ';' immediately *after* the
26787 closing brace, so, if we can, offset the location by 1 column. */
26794 /* If we successfully offset the location, suggest the fix-it. */
26807 else
26810 /* Unget one token and smash it to look as though we encountered
26811 a semicolon in the input stream. */
26816 }
26817 }
26819 /* If this class is not itself within the scope of another class,
26820 then we need to parse the bodies of all of the queued function
26821 definitions. Note that the queued functions defined in a class
26822 are not always processed immediately following the
26823 class-specifier for that class. Consider:
26825 struct A {
26826 struct B { void f() { sizeof (A); } };
26827 };
26829 If `f' were processed before the processing of `A' were
26830 completed, there would be no way to compute the size of `A'.
26831 Note that the nesting we are interested in here is lexical --
26832 not the semantic nesting given by TYPE_CONTEXT. In particular,
26833 for:
26835 struct A { struct B; };
26836 struct A::B { void f() { } };
26838 there is no need to delay the parsing of `A::B::f'. */
26840 {
26841 tree decl;
26848 {
26849 /* Skip default arguments, NSDMIs, etc, in order to improve
26850 error recovery (c++/71169, c++/71832). */
26854 }
26856 /* In a first pass, parse default arguments to the functions.
26857 Then, in a second pass, parse the bodies of the functions.
26858 This two-phased approach handles cases like:
26860 struct S {
26861 void f() { g(); }
26862 void g(int i = 3);
26863 };
26865 */
26867 {
26869 /* If there are default arguments that have not yet been processed,
26870 take care of them now. */
26872 {
26877 }
26878 /* Make sure that any template parameters are in scope. */
26880 /* Parse the default argument expressions. */
26882 /* Remove any template parameters from the symbol table. */
26884 }
26887 /* If there are noexcept-specifiers that have not yet been processed,
26888 take care of them now. Do this before processing NSDMIs as they
26889 may depend on noexcept-specifiers already having been processed. */
26891 {
26894 {
26899 }
26904 /* Make sure that any template parameters are in scope. */
26907 /* Make sure that any member-function parameters are in scope.
26908 This function doesn't expect ccp to be set. */
26912 /* 'this' is not allowed in static member functions. */
26913 unsigned char local_variables_forbidden_p
26918 /* Now we can parse the noexcept-specifier. */
26924 /* Update the fn's type directly -- it might have escaped
26925 beyond this decl :( */
26927 /* Update any instantiations we've already created. We must
26928 keep the new noexcept-specifier wrapped in a DEFERRED_NOEXCEPT
26929 so that maybe_instantiate_noexcept can tsubst the NOEXCEPT_EXPR
26930 in the pattern. */
26935 /* Restore the state of local_variables_forbidden_p. */
26938 /* The finish_struct call above performed various override checking,
26939 but it skipped unparsed noexcept-specifier operands. Now that we
26940 have resolved them, check again. */
26943 /* Remove any member-function parameters from the symbol table. */
26946 /* Remove any template parameters from the symbol table. */
26948 }
26951 /* Now parse any NSDMIs. */
26953 {
26956 {
26961 }
26964 }
26967 /* Now contract attributes. */
26969 {
26972 {
26977 }
26981 /* Make sure that any template parameters are in scope. */
26984 /* Make sure that any member-function parameters are in scope.
26985 This function doesn't expect ccp to be set. */
26989 /* 'this' is not allowed in static member functions. */
26990 unsigned char local_variables_forbidden_p
26995 /* Now we can parse contract conditions. */
26997 {
27000 }
27002 /* Restore the state of local_variables_forbidden_p. */
27005 /* Remove any member-function parameters from the symbol table. */
27008 /* Remove any template parameters from the symbol table. */
27011 /* Perform any deferred contract matching. */
27013 }
27021 /* Now parse the body of the functions. */
27023 {
27024 /* OpenMP UDRs need to be parsed before all other functions. */
27031 }
27032 else
27036 }
27038 /* Put back any saved access checks. */
27041 /* Restore saved state. */
27045 parser->num_template_parameter_lists
27047 parser->in_unbraced_linkage_specification_p
27053 }
27055 /* Parse a class-head.
27057 class-head:
27058 class-key identifier [opt] base-clause [opt]
27059 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
27060 class-key nested-name-specifier [opt] template-id
27061 base-clause [opt]
27063 class-virt-specifier:
27064 final
27066 GNU Extensions:
27067 class-key attributes identifier [opt] base-clause [opt]
27068 class-key attributes nested-name-specifier identifier base-clause [opt]
27069 class-key attributes nested-name-specifier [opt] template-id
27070 base-clause [opt]
27072 Upon return BASES is initialized to the list of base classes (or
27073 NULL, if there are none) in the same form returned by
27074 cp_parser_base_clause.
27076 Returns the TYPE of the indicated class. Sets
27077 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
27078 involving a nested-name-specifier was used, and FALSE otherwise.
27080 Returns error_mark_node if this is not a class-head.
27082 Returns NULL_TREE if the class-head is syntactically valid, but
27083 semantically invalid in a way that means we should skip the entire
27084 body of the class. */
27086 static tree
27089 {
27090 tree nested_name_specifier;
27094 tree attributes;
27095 tree bases;
27105 /* Assume no nested-name-specifier will be present. */
27107 /* Assume no template parameter lists will be used in defining the
27108 type. */
27112 /* Look for the class-key. */
27119 /* Parse the attributes. */
27124 /* If the next token is `::', that is invalid -- but sometimes
27125 people do try to write:
27127 struct ::S {};
27129 Handle this gracefully by accepting the extra qualifier, and then
27130 issuing an error about it later if this really is a
27131 class-head. If it turns out just to be an elaborated type
27132 specifier, remain silent. */
27136 /* It is OK to define an inaccessible class; for example:
27138 class A { class B; };
27139 class A::B {};
27141 So we want to ignore access when parsing the class name.
27142 However, we might be tentatively parsing what is really an
27143 elaborated-type-specifier naming a template-id, e.g.
27145 struct C<&D::m> c;
27147 In this case the tentative parse as a class-head will fail, but not
27148 before cp_parser_template_id splices in a CPP_TEMPLATE_ID token.
27149 Since dk_no_check is sticky, we must instead use dk_deferred so that
27150 any such CPP_TEMPLATE_ID token created during this tentative parse
27151 will correctly capture the access checks imposed by the template-id . */
27154 /* Determine the name of the class. Begin by looking for an
27155 optional nested-name-specifier. */
27157 nested_name_specifier
27163 /* If there was a nested-name-specifier, then there *must* be an
27164 identifier. */
27169 {
27171 /* Although the grammar says `identifier', it really means
27172 `class-name' or `template-name'. You are only allowed to
27173 define a class that has already been declared with this
27174 syntax.
27176 The proposed resolution for Core Issue 180 says that wherever
27177 you see `class T::X' you should treat `X' as a type-name.
27179 We do not know if we will see a class-name, or a
27180 template-name. We look for a class-name first, in case the
27181 class-name is a template-id; if we looked for the
27182 template-name first we would stop after the template-name. */
27189 class_type,
27193 /* If that didn't work, ignore the nested-name-specifier. */
27195 {
27201 }
27202 /* If we could not find a corresponding TYPE, treat this
27203 declaration like an unqualified declaration. */
27206 /* Otherwise, count the number of templates used in TYPE and its
27207 containing scopes. */
27208 else
27210 }
27211 /* Otherwise, the identifier is optional. */
27212 else
27213 {
27214 /* We don't know whether what comes next is a template-id,
27215 an identifier, or nothing at all. */
27217 /* Check for a template-id. */
27222 class_key,
27224 /* If that didn't work, it could still be an identifier. */
27226 {
27228 {
27231 }
27232 else
27234 }
27235 else
27236 {
27239 }
27240 }
27245 {
27247 class_key,
27249 }
27252 /* If it's not a `:' or a `{' then we can't really be looking at a
27253 class-head, since a class-head only appears as part of a
27254 class-specifier. We have to detect this situation before calling
27255 xref_tag, since that has irreversible side-effects. */
27257 {
27261 }
27263 /* At this point, we're going ahead with the class-specifier, even
27264 if some other problem occurs. */
27267 {
27272 }
27273 /* Issue the error about the overly-qualified name now. */
27275 {
27280 }
27282 {
27287 }
27289 {
27290 tree scope;
27293 /* [temp.names]: in a qualified-id formed by a class-head-name, the
27294 keyword template shall not appear at the top level. */
27298 /* Reject typedef-names in class heads. */
27300 {
27303 type);
27306 }
27308 /* Figure out in what scope the declaration is being placed. */
27310 /* If that scope does not contain the scope in which the
27311 class was originally declared, the program is invalid. */
27313 {
27316 "declaration of %qD in namespace %qD which does not "
27319 else
27325 }
27326 /* [dcl.meaning]
27328 A declarator-id shall not be qualified except for the
27329 definition of a ... nested class outside of its class
27330 ... [or] the definition or explicit instantiation of a
27331 class member of a namespace outside of its namespace. */
27335 }
27336 /* An explicit-specialization must be preceded by "template <>". If
27337 it is not, try to recover gracefully. */
27340 && !processing_template_parmlist
27342 {
27343 /* Build a location of this form:
27344 struct typename <ARGS>
27345 ^~~~~~~~~~~~~~~~~~~~~~
27346 with caret==start at the start token, and
27347 finishing at the end of the type. */
27348 location_t reported_loc
27350 class_head_start_location,
27356 "an explicit specialization must be preceded by"
27359 /* Take the same action that would have been taken by
27360 cp_parser_explicit_specialization. */
27363 }
27364 /* There must be no "return" statements between this point and the
27365 end of this function; set "type "to the correct return value and
27366 use "goto done;" to return. */
27367 /* Make sure that the right number of template parameters were
27368 present. */
27370 template_id_p,
27373 {
27374 /* If something went wrong, there is no point in even trying to
27375 process the class-definition. */
27378 }
27380 /* Look up the type. */
27382 {
27386 {
27390 }
27391 else
27392 {
27396 /* Check the scope while we still know whether or not we had a
27397 nested-name-specifier. */
27400 }
27403 }
27405 {
27408 /* Given:
27410 template <typename T> struct S { struct T };
27411 template <typename T> struct S<T>::T { };
27413 we will get a TYPENAME_TYPE when processing the definition of
27414 `S::T'. We need to resolve it to the actual type before we
27415 try to define it. */
27417 {
27420 {
27423 }
27424 }
27428 {
27431 }
27433 /* Enter the scope indicated by the nested-name-specifier. */
27435 /* Get the canonical version of this type. */
27437 /* Call push_template_decl if it seems like we should be defining a
27438 template either from the template headers or the type we're
27439 defining, so that we diagnose both extra and missing headers. */
27443 {
27446 {
27449 }
27450 }
27454 }
27456 {
27457 /* If the class was unnamed, create a dummy name. */
27465 }
27467 /* Diagnose class/struct/union mismatches. */
27471 /* Indicate whether this class was declared as a `class' or as a
27472 `struct'. */
27476 /* If this type was already complete, and we see another definition,
27477 that's an error. Likewise if the type is already being defined:
27478 this can happen, eg, when it's defined from within an expression
27479 (c++/84605). */
27482 {
27484 type);
27486 type);
27489 }
27494 {
27497 {
27498 /* In a lambda this should work, but doesn't currently. */
27501 }
27503 /* Apply attributes now, before any use of the class as a template
27504 argument in its base list. */
27507 }
27509 /* Associate constraints with the type. */
27513 /* We will have entered the scope containing the class; the names of
27514 base classes should be looked up in that context. For example:
27516 struct A { struct B {}; struct C; };
27517 struct A::C : B {};
27519 is valid. */
27521 /* Get the list of base-classes, if there is one. Defer access checking
27522 until the entire list has been seen, as per [class.access.general]. */
27525 {
27531 }
27532 else
27535 /* If we're really defining a class, process the base classes.
27536 If they're invalid, fail. */
27540 /* Now that all bases have been seen and attached to the class, check
27541 accessibility of the types named in the base-clause. This must be
27542 done relative to the class scope, so that we accept e.g.
27544 struct A { protected: struct B {}; };
27545 struct C : A::B, A {}; // OK: A::B is accessible via base A
27547 as per [class.access.general]. */
27554 done:
27555 /* Leave the scope given by the nested-name-specifier. We will
27556 enter the class scope itself while processing the members. */
27561 {
27564 }
27570 out:
27573 }
27575 /* Parse a class-key.
27577 class-key:
27578 class
27579 struct
27580 union
27582 Returns the kind of class-key specified, or none_type to indicate
27583 error. */
27585 static enum tag_types
27587 {
27591 /* Look for the class-key. */
27596 /* Check to see if the TOKEN is a class-key. */
27601 }
27603 /* Parse a type-parameter-key.
27605 type-parameter-key:
27606 class
27607 typename
27608 */
27610 static void
27612 {
27613 /* Look for the type-parameter-key. */
27617 {
27621 /* typename is not allowed in a template template parameter
27622 by the standard until C++17. */
27624 "ISO C++ forbids typename key in template template parameter;"
27626 }
27627 else
27631 }
27633 /* Parse an (optional) member-specification.
27635 member-specification:
27636 member-declaration member-specification [opt]
27637 access-specifier : member-specification [opt] */
27639 static void
27641 {
27643 {
27647 /* Peek at the next token. */
27649 /* If it's a `}', or EOF then we've seen all the members. */
27655 /* See if this token is a keyword. */
27658 {
27662 /* Consume the access-specifier. */
27664 /* Remember which access-specifier is active. */
27666 /* Look for the `:'. */
27671 /* Accept #pragmas at class scope. */
27673 {
27676 }
27678 /* Otherwise, the next construction must be a
27679 member-declaration. */
27681 }
27682 }
27683 }
27685 /* Parse a member-declaration.
27687 member-declaration:
27688 decl-specifier-seq [opt] member-declarator-list [opt] ;
27689 function-definition ; [opt]
27690 :: [opt] nested-name-specifier template [opt] unqualified-id ;
27691 using-declaration
27692 template-declaration
27693 alias-declaration
27695 member-declarator-list:
27696 member-declarator
27697 member-declarator-list , member-declarator
27699 member-declarator:
27700 declarator pure-specifier [opt]
27701 declarator constant-initializer [opt]
27702 identifier [opt] : constant-expression
27704 GNU Extensions:
27706 member-declaration:
27707 __extension__ member-declaration
27709 member-declarator:
27710 declarator attributes [opt] pure-specifier [opt]
27711 declarator attributes [opt] constant-initializer [opt]
27712 identifier [opt] attributes [opt] : constant-expression
27714 C++0x Extensions:
27716 member-declaration:
27717 static_assert-declaration */
27719 static void
27721 {
27722 cp_decl_specifier_seq decl_specifiers;
27723 tree prefix_attributes;
27724 tree decl;
27733 /* Check for the `__extension__' keyword. */
27735 {
27736 /* Recurse. */
27738 /* Restore the old value of the PEDANTIC flag. */
27742 }
27744 /* Check for a template-declaration. */
27746 {
27747 /* An explicit specialization here is an error condition, and we
27748 expect the specialization handler to detect and report this. */
27752 else
27756 }
27757 /* Check for a template introduction. */
27761 /* Check for a using-declaration. */
27763 {
27765 /* Parse the using-declaration. */
27769 else
27770 {
27771 tree decl;
27775 /* Note that if we actually see the '=' token after the
27776 identifier, cp_parser_alias_declaration commits the
27777 tentative parse. In that case, we really expect an
27778 alias-declaration. Otherwise, we expect a using
27779 declaration. */
27780 alias_decl_expected =
27786 else
27789 }
27791 }
27793 /* Check for @defs. */
27795 {
27800 {
27805 }
27807 }
27809 /* If the next token is `static_assert' we have a static assertion. */
27811 {
27814 }
27818 cp_omp_declare_simd_data odsd;
27822 /* Parse the decl-specifier-seq. */
27825 (CP_PARSER_FLAGS_OPTIONAL
27835 /* Check for an invalid type-name. */
27839 /* If there is no declarator, then the decl-specifier-seq should
27840 specify a type. */
27842 {
27843 /* If there was no decl-specifier-seq, and the next token is a
27844 `;', then we have something like:
27846 struct S { ; };
27848 [class.mem]
27850 Each member-declaration shall declare at least one member
27851 name of the class. */
27853 {
27856 {
27860 }
27861 }
27862 else
27863 {
27864 /* See if this declaration is a friend. */
27866 /* If there were decl-specifiers, check to see if there was
27867 a class-declaration. */
27870 /* Nested classes have already been added to the class, but
27871 a `friend' needs to be explicitly registered. */
27873 {
27874 /* If the `friend' keyword was present, the friend must
27875 be introduced with a class-key. */
27878 "in C++03 a class-key must be used "
27880 /* In this case:
27882 template <typename T> struct A {
27883 friend struct A<T>::B;
27884 };
27886 A<T>::B will be represented by a TYPENAME_TYPE, and
27887 therefore not recognized by check_tag_decl. */
27889 {
27893 }
27894 /* Warn if an attribute cannot appear here, as per
27895 [dcl.attr.grammar]/5. But not when declares_class_or_enum:
27896 we ignore attributes in elaborated-type-specifiers. */
27899 {
27904 "that appertains to a friend declaration that "
27906 }
27909 "friend declaration does not name a class or "
27911 else
27914 }
27915 /* If there is no TYPE, an error message will already have
27916 been issued. */
27918 ;
27919 /* An anonymous aggregate has to be handled specially; such
27920 a declaration really declares a data member (with a
27921 particular type), as opposed to a nested class. */
27923 {
27924 /* C++11 9.5/6. */
27927 "a storage class on an anonymous aggregate "
27930 /* Remove constructors and such from TYPE, now that we
27931 know it is an anonymous aggregate. */
27933 /* And make the corresponding data member. */
27936 /* Add it to the class. */
27938 }
27939 else
27940 cp_parser_check_access_in_redeclaration
27943 }
27944 }
27945 else
27946 {
27949 /* Clear attributes from the decl_specifiers but keep them
27950 around as prefix attributes that apply them to the entity
27951 being declared. */
27959 /* See if these declarations will be friends. */
27962 /* Keep going until we hit the `;' at the end of the
27963 declaration. */
27965 {
27967 tree first_attribute;
27968 tree initializer;
27971 /* Peek at the next token. */
27974 /* The following code wants to know early if it is a bit-field
27975 or some other declaration. Attributes can appear before
27976 the `:' token. Skip over them without consuming any tokens
27977 to peek if they are followed by `:'. */
27982 {
27983 size_t n
27986 }
27988 /* Check for a bitfield declaration. */
27994 {
27995 tree identifier;
27996 tree width;
27998 location_t id_location
28003 else
28006 /* Look for attributes that apply to the bitfield. */
28009 /* Consume the `:' token. */
28012 /* Get the width of the bitfield. */
28016 /* In C++20 and as extension for C++11 and above we allow
28017 default member initializers for bit-fields. */
28022 CPP_OPEN_BRACE)))
28023 {
28024 location_t loc
28029 "default member initializers for bit-fields "
28030 "only available with %<-std=c++20%> or "
28035 {
28039 }
28040 }
28041 else
28042 {
28043 /* Look for attributes that apply to the bitfield after
28044 the `:' token and width. This is where GCC used to
28045 parse attributes in the past, pedwarn if there is
28046 a std attribute. */
28049 "ISO C++ allows bit-field attributes only "
28053 }
28057 /* Remember which attributes are prefix attributes and
28058 which are not. */
28060 /* Combine the attributes. */
28063 /* Create the bitfield declaration. */
28066 identifier,
28067 sfk_none,
28068 id_location)
28072 attributes);
28073 }
28074 else
28075 {
28077 tree asm_specification;
28081 /* We can't delay parsing for friends,
28082 alias-declarations, and typedefs, even though the
28083 standard seems to require it. */
28088 /* Parse the declarator. */
28089 declarator
28091 flags,
28097 /* If something went wrong parsing the declarator, make sure
28098 that we at least consume some tokens. */
28100 {
28101 /* Skip to the end of the statement. */
28103 /* If the next token is not a semicolon, that is
28104 probably because we just skipped over the body of
28105 a function. So, we consume a semicolon if
28106 present, but do not issue an error message if it
28107 is not present. */
28109 CPP_SEMICOLON))
28112 }
28114 /* Handle class-scope non-template C++17 deduction guides. */
28117 declarator,
28121 cp_parser_check_for_definition_in_return_type
28125 /* Look for an asm-specification. */
28127 /* Look for attributes that apply to the declaration. */
28129 /* Remember which attributes are prefix attributes and
28130 which are not. */
28132 /* Combine the attributes. */
28135 /* If it's an `=', then we have a constant-initializer or a
28136 pure-specifier. It is not correct to parse the
28137 initializer before registering the member declaration
28138 since the member declaration should be in scope while
28139 its initializer is processed. However, the rest of the
28140 front end does not yet provide an interface that allows
28141 us to handle this correctly. */
28143 {
28144 /* In [class.mem]:
28146 A pure-specifier shall be used only in the declaration of
28147 a virtual function.
28149 A member-declarator can contain a constant-initializer
28150 only if it declares a static member of integral or
28151 enumeration type.
28153 Therefore, if the DECLARATOR is for a function, we look
28154 for a pure-specifier; otherwise, we look for a
28155 constant-initializer. When we call `grokfield', it will
28156 perform more stringent semantics checks. */
28169 {
28170 /* Don't require a constant rvalue in C++11, since we
28171 might want a reference constant. We'll enforce
28172 constancy later. */
28174 /* Parse the initializer. */
28176 }
28177 else
28178 /* Parse the initializer. */
28180 }
28183 {
28184 declarator->init_loc
28188 else
28190 }
28191 /* Detect invalid bit-field cases such as
28193 int *p : 4;
28194 int &&r : 3;
28196 and similar. */
28198 /* If there were no type specifiers, it was a
28199 constructor. */
28201 {
28202 /* This is called for a decent diagnostic only. */
28211 /* Avoid "extra ;" pedwarns. */
28213 CPP_SEMICOLON))
28216 }
28217 /* Otherwise, there is no initializer. */
28218 else
28221 /* See if we are probably looking at a function
28222 definition. We are certainly not looking at a
28223 member-declarator. Calling `grokfield' has
28224 side-effects, so we must not do it unless we are sure
28225 that we are looking at a member-declarator. */
28228 {
28229 /* The grammar does not allow a pure-specifier to be
28230 used when a member function is defined. (It is
28231 possible that this fact is an oversight in the
28232 standard, since a pure function may be defined
28233 outside of the class-specifier. */
28239 declarator,
28240 attributes);
28244 /* If the member was not a friend, declare it here. */
28247 /* Peek at the next token. */
28249 /* If the next token is a semicolon, consume it. */
28251 {
28252 location_t semicolon_loc
28257 "extra %<;%> after in-class "
28259 }
28261 }
28262 else
28266 /* Create the declaration. */
28272 {
28275 else
28277 }
28278 }
28283 /* Reset PREFIX_ATTRIBUTES. */
28285 {
28290 }
28292 /* If there is any qualification still in effect, clear it
28293 now; we will be starting fresh with the next declarator. */
28297 /* If it's a `,', then there are more declarators. */
28299 {
28302 {
28308 }
28309 }
28310 /* If the next token isn't a `;', then we have a parse error. */
28312 CPP_SEMICOLON))
28313 {
28314 /* The next token might be a ways away from where the
28315 actual semicolon is missing. Find the previous token
28316 and use that for our error position. */
28323 /* Assume that the user meant to provide a semicolon. If
28324 we were to cp_parser_skip_to_end_of_statement, we might
28325 skip to a semicolon inside a member function definition
28326 and issue nonsensical error messages. */
28328 }
28331 {
28332 /* Add DECL to the list of members. */
28334 /* Explicitly include, eg, NSDMIs, for better error
28335 recovery (c++/58650). */
28343 /* Add DECL to the queue of NSDMI to be parsed later. */
28345 }
28349 }
28350 }
28353 out:
28356 }
28358 /* Parse a pure-specifier.
28360 pure-specifier:
28361 = 0
28363 Returns INTEGER_ZERO_NODE if a pure specifier is found.
28364 Otherwise, ERROR_MARK_NODE is returned. */
28366 static tree
28368 {
28371 /* Look for the `=' token. */
28374 /* Look for the `0' token. */
28383 /* Accept = default or = delete in c++0x mode. */
28386 {
28389 }
28391 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
28393 {
28398 }
28400 {
28403 }
28406 }
28408 /* Parse a constant-initializer.
28410 constant-initializer:
28411 = constant-expression
28413 Returns a representation of the constant-expression. */
28415 static tree
28417 {
28418 /* Look for the `=' token. */
28422 /* It is invalid to write:
28424 struct S { static const int i = { 7 }; };
28426 */
28428 {
28431 /* Consume the opening brace. */
28432 matching_braces braces;
28434 /* Skip the initializer. */
28436 /* Look for the trailing `}'. */
28440 }
28443 }
28445 /* Derived classes [gram.class.derived] */
28447 /* Parse a base-clause.
28449 base-clause:
28450 : base-specifier-list
28452 base-specifier-list:
28453 base-specifier ... [opt]
28454 base-specifier-list , base-specifier ... [opt]
28456 Returns a TREE_LIST representing the base-classes, in the order in
28457 which they were declared. The representation of each node is as
28458 described by cp_parser_base_specifier.
28460 In the case that no bases are specified, this function will return
28461 NULL_TREE, not ERROR_MARK_NODE. */
28463 static tree
28465 {
28468 /* Look for the `:' that begins the list. */
28471 /* Scan the base-specifier-list. */
28473 {
28475 tree base;
28478 /* Look for the base-specifier. */
28480 /* Look for the (optional) ellipsis. */
28482 {
28483 /* Consume the `...'. */
28487 }
28489 /* Add BASE to the front of the list. */
28491 {
28493 /* Make this a pack expansion type. */
28497 {
28500 }
28501 }
28502 /* Peek at the next token. */
28504 /* If it's not a comma, then the list is complete. */
28507 /* Consume the `,'. */
28509 }
28511 /* PARSER->SCOPE may still be non-NULL at this point, if the last
28512 base class had a qualified name. However, the next name that
28513 appears is certainly not qualified. */
28519 }
28521 /* Parse a base-specifier.
28523 base-specifier:
28524 :: [opt] nested-name-specifier [opt] class-name
28525 virtual access-specifier [opt] :: [opt] nested-name-specifier
28526 [opt] class-name
28527 access-specifier virtual [opt] :: [opt] nested-name-specifier
28528 [opt] class-name
28530 Returns a TREE_LIST. The TREE_PURPOSE will be one of
28531 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
28532 indicate the specifiers provided. The TREE_VALUE will be a TYPE
28533 (or the ERROR_MARK_NODE) indicating the type that was specified. */
28535 static tree
28537 {
28545 tree type;
28547 /* Process the optional `virtual' and `access-specifier'. */
28549 {
28550 /* Peek at the next token. */
28552 /* Process `virtual'. */
28554 {
28556 /* If `virtual' appears more than once, issue an error. */
28558 {
28562 }
28566 /* Consume the `virtual' token. */
28574 /* If more than one access specifier appears, issue an
28575 error. */
28578 {
28582 }
28586 /* Consume the access-specifier. */
28594 }
28595 }
28596 /* It is not uncommon to see programs mechanically, erroneously, use
28597 the 'typename' keyword to denote (dependent) qualified types
28598 as base classes. */
28600 {
28605 else
28607 "keyword %<typename%> not allowed in this context "
28610 }
28612 /* Look for the optional `::' operator. */
28614 /* Look for the nested-name-specifier. The simplest way to
28615 implement:
28617 [temp.res]
28619 The keyword `typename' is not permitted in a base-specifier or
28620 mem-initializer; in these contexts a qualified name that
28621 depends on a template-parameter is implicitly assumed to be a
28622 type name.
28624 is to pretend that we have seen the `typename' keyword at this
28625 point. */
28631 /* If the base class is given by a qualified name, assume that names
28632 we see are type names or templates, as appropriate. */
28638 /* DR 950 allows decltype as a base-specifier. */
28640 else
28641 {
28642 /* Otherwise, look for the class-name. */
28644 class_scope_p,
28645 template_p,
28646 typename_type,
28651 }
28657 }
28659 /* Exception handling [gram.exception] */
28661 /* Save the tokens that make up the noexcept-specifier for a member-function.
28662 Returns a DEFERRED_PARSE. */
28664 static tree
28666 {
28668 /* We want everything up to, including, the final ')'. */
28672 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
28673 to carry the information we will need. */
28675 /* Save away the noexcept-specifier; we will process it when the
28676 class is complete. */
28681 }
28683 /* Used for late processing of noexcept-specifiers of member-functions.
28684 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
28685 we saved for later; parse it now. DECL is the declaration of the
28686 member function. */
28688 static tree
28690 {
28691 /* Make sure we've gotten something that hasn't been parsed yet. */
28696 /* Push the saved tokens for the noexcept-specifier onto the parser's
28697 lexer stack. */
28701 /* Parse the cached noexcept-specifier. */
28702 tree parsed_arg
28704 CP_PARSER_FLAGS_NONE,
28709 /* Revert to the main lexer. */
28712 /* Restore the queue. */
28715 /* And we're done. */
28717 }
28719 /* Perform late checking of overriding function with respect to their
28720 noexcept-specifiers. FNDECL is the member function that potentially
28721 overrides some virtual function with the same signature. */
28723 static void
28725 {
28727 tree base_binfo;
28733 {
28742 }
28743 }
28745 /* Parse an (optional) noexcept-specification.
28747 noexcept-specification:
28748 noexcept ( constant-expression ) [opt]
28750 If no noexcept-specification is present, returns NULL_TREE.
28751 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
28752 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
28753 there are no parentheses. CONSUMED_EXPR will be set accordingly.
28754 Otherwise, returns a noexcept specification unless RETURN_COND is true,
28755 in which case a boolean condition is returned instead. The parser flags
28756 FLAGS is used to control parsing. QUALS are qualifiers indicating whether
28757 the (member) function is `const'. */
28759 static tree
28761 cp_parser_flags flags,
28765 {
28769 /* Peek at the next token. */
28772 /* Is it a noexcept-specification? */
28774 {
28775 tree expr;
28777 /* [class.mem]/6 says that a noexcept-specifer (within the
28778 member-specification of the class) is a complete-class context of
28779 a class. So, if the noexcept-specifier has the optional expression,
28780 just save the tokens, and reparse this after we're done with the
28781 class. */
28785 /* No need to delay parsing for a number literal or true/false. */
28797 {
28798 matching_parens parens;
28802 {
28803 /* Types may not be defined in an exception-specification. */
28805 parser->type_definition_forbidden_message
28809 expr
28815 {
28818 }
28820 /* Restore the saved message. */
28822 }
28823 else
28824 {
28827 }
28830 }
28831 else
28832 {
28836 }
28838 /* We cannot build a noexcept-spec right away because this will check
28839 that expr is a constexpr. */
28842 else
28844 }
28845 else
28847 }
28849 /* Parse an (optional) exception-specification.
28851 exception-specification:
28852 throw ( type-id-list [opt] )
28854 Returns a TREE_LIST representing the exception-specification. The
28855 TREE_VALUE of each node is a type. The parser flags FLAGS is used to
28856 control parsing. QUALS are qualifiers indicating whether the (member)
28857 function is `const'. */
28859 static tree
28861 cp_parser_flags flags)
28862 {
28864 tree type_id_list;
28867 /* Peek at the next token. */
28870 /* Is it a noexcept-specification? */
28871 type_id_list
28879 /* If it's not `throw', then there's no exception-specification. */
28885 /* Consume the `throw'. */
28888 /* Look for the `('. */
28889 matching_parens parens;
28892 /* Peek at the next token. */
28894 /* If it's not a `)', then there is a type-id-list. */
28896 {
28897 /* Types may not be defined in an exception-specification. */
28899 parser->type_definition_forbidden_message
28901 /* Parse the type-id-list. */
28903 /* Restore the saved message. */
28907 {
28911 }
28914 "dynamic exception specifications are deprecated in "
28916 }
28917 /* In C++17, throw() is equivalent to noexcept (true). throw()
28918 is deprecated in C++11 and above as well, but is still widely used,
28919 so don't warn about it yet. */
28922 else
28925 /* Look for the `)'. */
28929 }
28931 /* Parse an (optional) type-id-list.
28933 type-id-list:
28934 type-id ... [opt]
28935 type-id-list , type-id ... [opt]
28937 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
28938 in the order that the types were presented. */
28940 static tree
28942 {
28946 {
28948 tree type;
28952 /* Get the next type-id. */
28954 /* Check for invalid 'auto'. */
28956 {
28960 }
28961 /* Parse the optional ellipsis. */
28963 {
28964 /* Consume the `...'. */
28967 /* Turn the type into a pack expansion expression. */
28969 }
28970 /* Add it to the list. */
28972 /* Peek at the next token. */
28974 /* If it is not a `,', we are done. */
28977 /* Consume the `,'. */
28979 }
28982 }
28984 /* Parse a try-block.
28986 try-block:
28987 try compound-statement handler-seq */
28989 static tree
28991 {
28992 tree try_block;
28999 "%<try%> in %<constexpr%> function only "
29009 }
29011 /* Parse a function-try-block.
29013 function-try-block:
29014 try ctor-initializer [opt] function-body handler-seq */
29016 static void
29018 {
29019 tree compound_stmt;
29020 tree try_block;
29022 /* Look for the `try' keyword. */
29025 /* Let the rest of the front end know where we are. */
29027 /* Parse the function-body. */
29028 cp_parser_ctor_initializer_opt_and_function_body
29030 /* We're done with the `try' part. */
29032 /* Parse the handlers. */
29034 /* We're done with the handlers. */
29036 }
29038 /* Parse a handler-seq.
29040 handler-seq:
29041 handler handler-seq [opt] */
29043 static void
29045 {
29047 {
29050 /* Parse the handler. */
29052 /* Peek at the next token. */
29054 /* If it's not `catch' then there are no more handlers. */
29057 }
29058 }
29060 /* Parse a handler.
29062 handler:
29063 catch ( exception-declaration ) compound-statement */
29065 static void
29067 {
29068 tree handler;
29069 tree declaration;
29073 matching_parens parens;
29080 }
29082 /* Parse an exception-declaration.
29084 exception-declaration:
29085 type-specifier-seq declarator
29086 type-specifier-seq abstract-declarator
29087 type-specifier-seq
29088 ...
29090 Returns a VAR_DECL for the declaration, or NULL_TREE if the
29091 ellipsis variant is used. */
29093 static tree
29095 {
29096 cp_decl_specifier_seq type_specifiers;
29100 /* If it's an ellipsis, it's easy to handle. */
29102 {
29103 /* Consume the `...' token. */
29106 }
29108 /* Types may not be defined in exception-declarations. */
29110 parser->type_definition_forbidden_message
29113 /* Parse the type-specifier-seq. */
29118 /* If it's a `)', then there is no declarator. */
29121 else
29123 CP_PARSER_FLAGS_NONE,
29130 /* Restore the saved message. */
29137 }
29139 /* Parse a throw-expression.
29141 throw-expression:
29142 throw assignment-expression [opt]
29144 Returns a THROW_EXPR representing the throw-expression. */
29146 static tree
29148 {
29149 tree expression;
29155 /* Figure out whether or not there is an assignment-expression
29156 following the "throw" keyword. */
29164 else
29167 /* Construct a location e.g.:
29168 throw x
29169 ^~~~~~~
29170 with caret == start at the start of the "throw" token, and
29171 the end at the end of the final token we consumed. */
29177 }
29179 /* Parse a yield-expression.
29181 yield-expression:
29182 co_yield assignment-expression
29183 co_yield braced-init-list
29185 Returns a CO_YIELD_EXPR representing the yield-expression. */
29187 static tree
29189 {
29190 tree expr;
29198 {
29200 /* ??? : probably a moot point? */
29203 }
29204 else
29211 }
29213 /* GNU Extensions */
29215 /* Parse an (optional) asm-specification.
29217 asm-specification:
29218 asm ( string-literal )
29220 If the asm-specification is present, returns a STRING_CST
29221 corresponding to the string-literal. Otherwise, returns
29222 NULL_TREE. */
29224 static tree
29226 {
29227 /* Peek at the next token. */
29229 /* If the next token isn't the `asm' keyword, then there's no
29230 asm-specification. */
29234 /* Consume the `asm' token. */
29236 /* Look for the `('. */
29237 matching_parens parens;
29240 /* Look for the string-literal. */
29245 /* Look for the `)'. */
29249 }
29251 /* Parse an asm-operand-list.
29253 asm-operand-list:
29254 asm-operand
29255 asm-operand-list , asm-operand
29257 asm-operand:
29258 string-literal ( expression )
29259 [ string-literal ] string-literal ( expression )
29261 Returns a TREE_LIST representing the operands. The TREE_VALUE of
29262 each node is the expression. The TREE_PURPOSE is itself a
29263 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
29264 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
29265 is a STRING_CST for the string literal before the parenthesis. Returns
29266 ERROR_MARK_NODE if any of the operands are invalid. */
29268 static tree
29270 {
29275 {
29276 tree name;
29279 {
29280 /* Consume the `[' token. */
29282 /* Read the operand name. */
29287 /* Look for the closing `]'. */
29289 }
29290 else
29292 /* Look for the string-literal. */
29297 /* Look for the `('. */
29298 matching_parens parens;
29300 /* Parse the expression. */
29302 /* Look for the `)'. */
29310 /* Add this operand to the list. */
29312 expression,
29313 asm_operands);
29314 /* If the next token is not a `,', there are no more
29315 operands. */
29318 /* Consume the `,'. */
29320 }
29323 }
29325 /* Parse an asm-clobber-list.
29327 asm-clobber-list:
29328 string-literal
29329 asm-clobber-list , string-literal
29331 Returns a TREE_LIST, indicating the clobbers in the order that they
29332 appeared. The TREE_VALUE of each node is a STRING_CST. */
29334 static tree
29336 {
29340 {
29341 /* Look for the string literal. */
29345 /* Add it to the list. */
29347 /* If the next token is not a `,', then the list is
29348 complete. */
29351 /* Consume the `,' token. */
29353 }
29356 }
29358 /* Parse an asm-label-list.
29360 asm-label-list:
29361 identifier
29362 asm-label-list , identifier
29364 Returns a TREE_LIST, indicating the labels in the order that they
29365 appeared. The TREE_VALUE of each node is a label. */
29367 static tree
29369 {
29373 {
29376 /* Look for the identifier. */
29379 {
29382 {
29388 }
29389 }
29390 /* If the next token is not a `,', then the list is
29391 complete. */
29394 /* Consume the `,' token. */
29396 }
29399 }
29401 /* Return TRUE iff the next tokens in the stream are possibly the
29402 beginning of a GNU extension attribute. */
29404 static bool
29406 {
29408 }
29410 /* Return TRUE iff the next tokens in the stream are possibly the
29411 beginning of a standard C++-11 attribute specifier. */
29413 static bool
29415 {
29417 }
29419 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29420 beginning of a standard C++-11 attribute specifier. */
29422 static bool
29424 {
29432 }
29434 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29435 beginning of a GNU extension attribute. */
29437 static bool
29439 {
29443 }
29445 /* Return true iff the next tokens can be the beginning of either a
29446 GNU attribute list, or a standard C++11 attribute sequence. */
29448 static bool
29450 {
29453 }
29455 /* Return true iff the next Nth tokens can be the beginning of either
29456 a GNU attribute list, or a standard C++11 attribute sequence. */
29458 static bool
29460 {
29463 }
29465 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
29466 of GNU attributes, or return NULL. */
29468 static tree
29470 {
29473 {
29478 else
29480 }
29482 }
29484 /* Parse an (optional) series of attributes.
29486 attributes:
29487 attributes attribute
29489 attribute:
29490 __attribute__ (( attribute-list [opt] ))
29492 The return value is as for cp_parser_gnu_attribute_list. */
29494 static tree
29496 {
29503 {
29505 tree attribute_list;
29508 /* Peek at the next token. */
29510 /* If it's not `__attribute__', then we're done. */
29514 /* Consume the `__attribute__' keyword. */
29516 /* Look for the two `(' tokens. */
29517 matching_parens outer_parens;
29520 matching_parens inner_parens;
29524 /* Peek at the next token. */
29527 /* Parse the attribute-list. */
29529 else
29530 /* If the next token is a `)', then there is no attribute
29531 list. */
29534 /* Look for the two `)' tokens. */
29542 /* Add these new attributes to the list. */
29544 }
29547 }
29549 /* Parse a GNU attribute-list.
29551 attribute-list:
29552 attribute
29553 attribute-list , attribute
29555 attribute:
29556 identifier
29557 identifier ( identifier )
29558 identifier ( identifier , expression-list )
29559 identifier ( expression-list )
29561 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
29562 to an attribute. The TREE_PURPOSE of each node is the identifier
29563 indicating which attribute is in use. The TREE_VALUE represents
29564 the arguments, if any. */
29566 static tree
29568 {
29572 /* Don't create wrapper nodes within attributes: the
29573 handlers don't know how to handle them. */
29574 auto_suppress_location_wrappers sentinel;
29578 {
29580 tree identifier;
29581 tree attribute;
29583 /* Look for the identifier. We also allow keywords here; for
29584 example `__attribute__ ((const))' is legal. */
29588 {
29591 /* Consume the token, but save it since we need it for the
29592 SIMD enabled function parsing. */
29595 /* Save away the identifier that indicates which attribute
29596 this is. */
29598 /* For keywords, use the canonical spelling, not the
29599 parsed identifier. */
29606 /* Peek at the next token. */
29608 /* If it's an `(', then parse the attribute arguments. */
29610 {
29616 vec = cp_parser_parenthesized_expression_list
29622 else
29623 {
29626 }
29627 /* Save the arguments away. */
29629 }
29632 {
29633 /* Add this attribute to the list. */
29636 }
29639 }
29640 /* Unless EXACTLY_ONE is set look for more attributes.
29641 If the next token isn't a `,', we're done. */
29645 /* Consume the comma and keep going. */
29647 }
29650 /* We built up the list in reverse order. */
29652 }
29654 /* Parse arguments of omp::directive attribute.
29656 ( directive-name ,[opt] clause-list[opt] )
29658 For directive just remember the first/last tokens for subsequent
29659 parsing. */
29661 static void
29663 {
29666 {
29672 }
29675 {
29681 }
29692 }
29694 /* Parse arguments of omp::sequence attribute.
29696 ( omp::[opt] directive-attr [ , omp::[opt] directive-attr ]... ) */
29698 static void
29700 {
29701 matching_parens parens;
29703 do
29704 {
29709 {
29713 }
29718 else
29723 {
29732 }
29736 UNKNOWN_LOCATION);
29739 else
29744 }
29749 }
29751 /* Parse a standard C++11 attribute.
29753 The returned representation is a TREE_LIST which TREE_PURPOSE is
29754 the scoped name of the attribute, and the TREE_VALUE is its
29755 arguments list.
29757 Note that the scoped name of the attribute is itself a TREE_LIST
29758 which TREE_PURPOSE is the namespace of the attribute, and
29759 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
29760 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
29761 and which TREE_PURPOSE is directly the attribute name.
29763 Clients of the attribute code should use get_attribute_namespace
29764 and get_attribute_name to get the actual namespace and name of
29765 attributes, regardless of their being GNU or C++11 attributes.
29767 attribute:
29768 attribute-token attribute-argument-clause [opt]
29770 attribute-token:
29771 identifier
29772 attribute-scoped-token
29774 attribute-scoped-token:
29775 attribute-namespace :: identifier
29777 attribute-namespace:
29778 identifier
29780 attribute-argument-clause:
29781 ( balanced-token-seq )
29783 balanced-token-seq:
29784 balanced-token [opt]
29785 balanced-token-seq balanced-token
29787 balanced-token:
29788 ( balanced-token-seq )
29789 [ balanced-token-seq ]
29790 { balanced-token-seq }. */
29792 static tree
29794 {
29801 /* First, parse name of the attribute, a.k.a attribute-token. */
29818 {
29819 /* We are seeing a scoped attribute token. */
29834 else
29835 {
29839 }
29845 NULL_TREE);
29847 }
29849 {
29853 NULL_TREE);
29854 }
29855 else
29856 {
29859 NULL_TREE);
29861 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
29862 but no longer: we have to be able to tell [[noreturn]] and
29863 __attribute__((noreturn)) apart. */
29864 /* C++14 deprecated attribute is equivalent to GNU's. */
29867 /* C++17 fallthrough attribute is equivalent to GNU's. */
29870 /* C++23 assume attribute is equivalent to GNU's. */
29873 /* Transactional Memory TS optimize_for_synchronized attribute is
29874 equivalent to GNU transaction_callable. */
29878 /* Transactional Memory attributes are GNU attributes. */
29881 }
29883 /* Now parse the optional argument clause of the attribute. */
29886 {
29892 {
29894 attr_id);
29896 }
29898 }
29900 {
29904 /* Maybe we don't expect to see any arguments for this attribute. */
29908 {
29910 attr_id);
29916 }
29920 /* The assume attribute needs special handling of the argument. */
29924 /* A GNU attribute that takes an identifier in parameter. */
29932 /* If this is a fake attribute created to handle -Wno-attributes,
29933 we must skip parsing the arguments. */
29935 {
29937 {
29939 {
29942 }
29944 {
29949 }
29951 {
29957 }
29958 }
29960 /* For unknown attributes, just skip balanced tokens instead of
29961 trying to parse the arguments. Set TREE_VALUE (attribute) to
29962 error_mark_node to distinguish skipped arguments from attributes
29963 with no arguments. */
29968 }
29970 vec = cp_parser_parenthesized_expression_list
29976 else
29977 {
29979 /* e.g. [[attr()]]. */
29982 attr_id);
29985 }
29989 else
29991 }
29994 }
29996 /* Warn if the attribute ATTRIBUTE appears more than once in the
29997 attribute-list ATTRIBUTES. This used to be enforced for certain
29998 attributes, but the restriction was removed in P2156.
29999 LOC is the location of ATTRIBUTE. Returns true if ATTRIBUTE was not
30000 found in ATTRIBUTES. */
30002 static bool
30004 {
30013 {
30018 }
30020 }
30022 /* Parse a list of standard C++-11 attributes.
30024 attribute-list:
30025 attribute [opt]
30026 attribute-list , attribute[opt]
30027 attribute ...
30028 attribute-list , attribute ...
30029 */
30031 static tree
30033 {
30038 {
30044 {
30046 {
30049 }
30050 }
30053 {
30059 {
30063 }
30065 {
30070 }
30072 }
30076 }
30079 }
30081 /* Optionally parse a C++20 contract role. A NULL return means that no
30082 contract role was specified.
30084 contract-role:
30085 % default
30086 % identifier
30088 If the identifier does not name a known contract role, it will
30089 be assumed to be default. Returns the identifier for the role
30090 token. */
30092 static tree
30094 {
30104 else
30105 {
30108 }
30111 /* FIXME: Warn about invalid/unknown roles? */
30113 }
30115 /* Parse an optional contract mode.
30117 contract-mode:
30118 contract-semantic
30119 [contract-level] [contract-role]
30121 contract-semantic:
30122 check_never_continue
30123 check_maybe_continue
30124 check_always_continue
30126 contract-level:
30127 default
30128 audit
30129 axiom
30131 contract-role:
30132 default
30133 identifier
30135 This grammar is taken from P1332R0. During parsing, this sets options
30136 on the MODE object to determine the configuration of the contract.
30138 Returns a tree containing the identifiers used in the configuration.
30139 This is either an IDENTIFIER with the literal semantic or a TREE_LIST
30140 whose TREE_VALUE is the contract-level and whose TREE_PURPOSE is the
30141 contract-role, if any. NULL_TREE is returned if no information is
30142 given (i.e., all defaults selected). */
30144 static tree
30147 {
30148 /* The mode is empty; the level and role are default. */
30152 /* There is only a role; the level is default. */
30154 {
30157 }
30159 /* Otherwise, match semantic or level. */
30163 tree config_id;
30165 {
30168 /* Either a named level, a concrete semantic, or an identifier
30169 for a postcondition. */
30174 /* The identifier is the return value for a postcondition. */
30178 }
30180 {
30183 }
30184 else
30185 {
30186 /* We got some other token other than a ':'. */
30189 }
30191 /* Consume the literal semantic or level token. */
30195 {
30197 "expected contract level: "
30200 }
30202 /* We matched an explicit semantic. */
30204 {
30206 {
30210 }
30212 }
30214 /* We matched a level, there may be a role; otherwise this is default. */
30216 {
30219 }
30222 }
30224 static tree
30226 {
30230 }
30232 static bool
30234 {
30236 }
30238 /* Parse a standard C++20 contract attribute specifier.
30240 contract-attribute-specifier:
30241 [ [ assert contract-level [opt] : conditional-expression ] ]
30242 [ [ pre contract-level [opt] : conditional-expression ] ]
30243 [ [ post contract-level [opt] identifier [opt] : conditional-expression ] ]
30245 For free functions, we cannot determine the type of the postcondition
30246 identifier because the we haven't called grokdeclarator yet. In those
30247 cases we parse the postcondition as if the identifier was declared as
30248 'auto <identifier>'. We then instantiate the postcondition once the
30249 return type is known.
30251 For member functions, contracts are in the complete-class context, so the
30252 parse is deferred. We also have the return type avaialable (unless it's
30253 deduced), so we don't need to parse the postcondition in terms of a
30254 placeholder. */
30256 static tree
30258 {
30266 /* Parse the optional mode. */
30269 /* Check for postcondition identifiers. */
30270 cp_expr identifier;
30278 /* Defer the parsing of pre/post contracts inside class definitions. */
30279 tree contract;
30281 current_class_type &&
30283 {
30284 /* Skip until we reach an unenclose ']'. If we ran into an unnested ']'
30285 that doesn't close the attribute, return an error and let the attribute
30286 handling code emit an error for missing ']]'. */
30290 CPP_CLOSE_SQUARE,
30297 /* Build a deferred-parse node. */
30302 /* And its corresponding contract. */
30304 }
30305 else
30306 {
30307 /* Enable location wrappers when parsing contracts. */
30310 /* Build a fake variable for the result identifier. */
30313 {
30317 }
30319 /* Parse the condition, ensuring that parameters or the return variable
30320 aren't flagged for use outside the body of a function. */
30325 /* Try to recover from errors by scanning up to the end of the
30326 attribute. Sometimes we get partially parsed expressions, so
30327 we need to search the condition for errors. */
30331 /* Build the contract. */
30334 /* Leave our temporary scope for the postcondition result. */
30336 {
30339 }
30340 }
30343 {
30346 }
30349 }
30351 /* Parse a contract condition for a deferred contract. */
30354 tree fn,
30355 tree attribute)
30356 {
30359 /* Make sure we've gotten something that hasn't been parsed yet or that
30360 we're not parsing an invalid contract. */
30369 /* Build a fake variable for the result identifier. */
30372 {
30373 /* TODO: Can we guarantee that the identifier has a location? */
30377 {
30380 }
30385 }
30387 /* 'this' is not allowed in preconditions of constructors or in postconditions
30388 of destructors. Note that the previous value of this variable is
30389 established by the calling function, so we need to save it here. */
30394 {
30397 }
30401 /* Push the saved tokens onto the parser's lexer stack. */
30405 /* Parse the condition, ensuring that parameters or the return variable
30406 aren't flagged for use outside the body of a function. */
30411 /* Revert to the main lexer. */
30414 /* Restore the queue. */
30420 /* Commit to changes. */
30423 /* Leave our temporary scope for the postcondition result. */
30425 {
30428 }
30429 }
30431 /* Parse a standard C++-11 attribute specifier.
30433 attribute-specifier:
30434 [ [ attribute-using-prefix [opt] attribute-list ] ]
30435 contract-attribute-specifier
30436 alignment-specifier
30438 attribute-using-prefix:
30439 using attribute-namespace :
30441 alignment-specifier:
30442 alignas ( type-id ... [opt] )
30443 alignas ( alignment-expression ... [opt] ).
30445 Extensions for contracts:
30447 contract-attribute-specifier:
30448 [ [ assert : contract-mode [opt] : conditional-expression ] ]
30449 [ [ pre : contract-mode [opt] : conditional-expression ] ]
30450 [ [ post : contract-mode [opt] identifier [opt] :
30451 conditional-expression ] ]
30453 Return void_list_node if the current token doesn't start an
30454 attribute-specifier to differentiate from NULL_TREE returned e.g.
30455 for [ [ ] ]. */
30457 static tree
30459 {
30465 {
30474 {
30477 }
30479 /* Handle contract-attribute-specs specially. */
30481 {
30486 }
30489 {
30500 {
30503 "attribute using prefix only available "
30509 }
30510 else
30512 }
30516 finish_attrs:
30520 else
30521 /* Warn about parsing c++11 attribute in non-c++11 mode, only
30522 when we are sure that we have actually parsed them. */
30524 }
30525 else
30526 {
30527 tree alignas_expr;
30529 /* Look for an alignment-specifier. */
30540 matching_parens parens;
30548 {
30555 }
30560 /* Handle alignas (pack...). */
30562 {
30565 }
30567 /* Something went wrong, so don't build the attribute. */
30571 /* Missing ')' means the code cannot possibly be valid; go ahead
30572 and commit to make sure we issue a hard error. */
30580 /* Build the C++-11 representation of an 'aligned'
30581 attribute. */
30582 attributes
30585 }
30588 }
30590 /* Parse a standard C++-11 attribute-specifier-seq.
30592 attribute-specifier-seq:
30593 attribute-specifier-seq [opt] attribute-specifier */
30595 static tree
30597 {
30601 /* Don't create wrapper nodes within attributes: the
30602 handlers don't know how to handle them. */
30603 auto_suppress_location_wrappers sentinel;
30606 {
30610 /* Accept [[]][[]]; for which cp_parser_std_attribute_spec
30611 returns NULL_TREE as there are no attributes. */
30619 else
30622 }
30625 }
30627 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
30628 return index of the first token after balanced-token, or N on failure. */
30630 static size_t
30632 {
30635 do
30637 {
30641 /* FALLTHRU */
30643 /* Ran out of tokens. */
30665 }
30668 }
30670 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
30671 return index of the first token after the GNU attribute tokens, or N on
30672 failure. */
30674 static size_t
30676 {
30678 {
30690 }
30692 }
30694 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
30695 next token), return index of the first token after the standard C++11
30696 attribute tokens, or N on failure. */
30698 static size_t
30700 {
30702 {
30705 {
30712 }
30715 {
30720 }
30721 else
30723 }
30725 }
30727 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
30728 as the next token), return index of the first token after the attribute
30729 tokens, or N on failure. */
30731 static size_t
30733 {
30737 }
30739 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
30740 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
30741 current value of the PEDANTIC flag, regardless of whether or not
30742 the `__extension__' keyword is present. The caller is responsible
30743 for restoring the value of the PEDANTIC flag. */
30745 static bool
30747 {
30748 /* Save the old value of the PEDANTIC flag. */
30752 {
30753 /* Consume the `__extension__' token. */
30755 /* We're not being pedantic while the `__extension__' keyword is
30756 in effect. */
30760 }
30763 }
30765 /* Parse a label declaration.
30767 label-declaration:
30768 __label__ label-declarator-seq ;
30770 label-declarator-seq:
30771 identifier , label-declarator-seq
30772 identifier */
30774 static void
30776 {
30777 /* Look for the `__label__' keyword. */
30781 {
30782 tree identifier;
30784 /* Look for an identifier. */
30786 /* If we failed, stop. */
30789 /* Declare it as a label. */
30791 /* If the next token is a `;', stop. */
30794 /* Look for the `,' separating the label declarations. */
30796 }
30798 /* Look for the final `;'. */
30800 }
30802 // -------------------------------------------------------------------------- //
30803 // Concept definitions
30805 static tree
30807 {
30808 /* A concept definition is an unevaluated context. */
30809 cp_unevaluated u;
30816 {
30820 }
30825 {
30829 }
30831 processing_constraint_expression_sentinel parsing_constraint;
30836 /* Consume the trailing ';'. Diagnose the problem if it isn't there,
30837 but continue as if it were. */
30841 }
30843 // -------------------------------------------------------------------------- //
30844 // Requires Clause
30846 /* Diagnose an expression that should appear in ()'s within a requires-clause
30847 and suggest where to place those parentheses. */
30849 static void
30851 {
30853 }
30855 static void
30857 {
30862 }
30864 /* Characterizes the likely kind of expression intended by a mis-written
30865 primary constraint. */
30866 enum primary_constraint_error
30867 {
30868 pce_ok,
30869 pce_maybe_operator,
30870 pce_maybe_postfix
30871 };
30873 /* Returns true if the token(s) following a primary-expression in a
30874 constraint-logical-* expression would require parentheses. */
30876 static primary_constraint_error
30878 {
30881 {
30886 {
30887 /* An equal sign may be part of the definition of a function,
30888 and not an assignment operator, when parsing the expression
30889 for a trailing requires-clause. For example:
30891 template<typename T>
30892 struct S {
30893 S() requires C<T> = default;
30894 };
30896 Don't try to reparse this a binary operator. */
30902 }
30904 /* Arithmetic operators. */
30910 /* Bitwise operators. */
30916 /* Relational operators. */
30924 /* Pointer-to-member. */
30927 /* Assignment operators. */
30938 /* Conditional operator */
30940 /* Unenclosed binary or conditional operator. */
30944 {
30945 /* A primary constraint that precedes the parameter-list of a
30946 lambda expression is followed by an open paren.
30948 []<typename T> requires C (T a, T b) { ... }
30950 Don't try to re-parse this as a postfix expression. */
30955 }
30957 {
30958 /* A primary-constraint-expression followed by a '[[' is not a
30959 postfix expression. */
30964 }
30968 /* Unenclosed postfix operator. */
30972 /* A primary constraint that precedes the lambda-declarator of a
30973 lambda expression is followed by trailing return type.
30975 []<typename T> requires C -> void {}
30977 Don't try to re-parse this as a postfix expression in
30978 C++23 and later. In C++20 ( needs to come in between but we
30979 allow it to be omitted with pedwarn. */
30982 /* Unenclosed postfix operator. */
30984 }
30985 }
30987 /* Returns true if the next token begins a unary expression, preceded by
30988 an operator or keyword. */
30990 static bool
30992 {
30995 {
31006 {
31008 {
31024 }
31025 }
31029 }
31032 }
31034 /* Parse a primary expression within a constraint. */
31036 static cp_expr
31038 {
31039 /* If this looks like a unary expression, parse it as such, but diagnose
31040 it as ill-formed; it requires parens. */
31042 {
31046 }
31049 cp_id_kind idk;
31060 {
31061 /* The primary-expression could be part of an unenclosed non-logical
31062 compound expression. */
31064 }
31066 {
31069 }
31071 /* Retry the parse at a lower precedence. If that succeeds, diagnose the
31072 error, but return the expression as if it were valid. */
31077 else
31080 {
31083 }
31085 /* Otherwise, something has gone very wrong, and we can't generate a more
31086 meaningful diagnostic or recover. */
31089 }
31091 /* Parse a constraint-logical-and-expression.
31093 constraint-logical-and-expression:
31094 primary-expression
31095 constraint-logical-and-expression '&&' primary-expression */
31097 static cp_expr
31099 {
31102 {
31106 }
31108 }
31110 /* Parse a constraint-logical-or-expression.
31112 constraint-logical-or-expression:
31113 constraint-logical-and-expression
31114 constraint-logical-or-expression '||' constraint-logical-and-expression */
31116 static cp_expr
31118 {
31121 {
31125 }
31127 }
31129 /* Parse the expression after a requires-clause. This has a different grammar
31130 than that in the concepts TS. */
31132 static tree
31134 {
31135 processing_constraint_expression_sentinel parsing_constraint;
31142 }
31144 /* Parse a expression after a requires clause.
31146 constraint-expression:
31147 logical-or-expression
31149 The required logical-or-expression must be a constant expression. Note
31150 that we don't check that the expression is constepxr here. We defer until
31151 we analyze constraints and then, we only check atomic constraints. */
31153 static tree
31155 {
31156 processing_constraint_expression_sentinel parsing_constraint;
31165 }
31167 /* Optionally parse a requires clause:
31169 requires-clause:
31170 `requires` constraint-logical-or-expression.
31171 [ConceptsTS]
31172 `requires constraint-expression.
31174 LAMBDA_P is true when the requires-clause is parsed before the
31175 parameter-list of a lambda-declarator. */
31177 static tree
31179 {
31180 /* A requires clause is an unevaluated context. */
31181 cp_unevaluated u;
31185 {
31188 {
31190 "%<requires%> only available with "
31192 /* Parse and discard the requires-clause. */
31195 }
31197 }
31201 {
31202 /* An opening brace following the start of a requires-clause is
31203 ill-formed; the user likely forgot the second `requires' that
31204 would start a requires-expression. */
31209 /* Don't consume the `requires', so that it's reused as the start of a
31210 requires-expression. */
31211 }
31212 else
31217 else
31219 }
31221 /*---------------------------------------------------------------------------
31222 Requires expressions
31223 ---------------------------------------------------------------------------*/
31225 /* Parse a requires expression
31227 requirement-expression:
31228 'requires' requirement-parameter-list [opt] requirement-body */
31230 static tree
31232 {
31236 /* Avoid committing to outer tentative parse. */
31239 /* This is definitely a requires-expression. */
31243 {
31244 /* Local parameters are delared as variables within the scope
31245 of the expression. They are not visible past the end of
31246 the expression. Expressions within the requires-expression
31247 are unevaluated. */
31248 struct scope_sentinel
31249 {
31251 {
31255 }
31258 {
31261 }
31264 /* Parse the optional parameter list. */
31266 {
31270 }
31271 else
31274 /* Parse the requirement body. */
31280 }
31282 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
31283 the parm chain. */
31288 {
31289 /* Perform semantic processing now to diagnose any invalid types and
31290 expressions. */
31295 }
31297 }
31299 /* Parse a parameterized requirement.
31301 requirement-parameter-list:
31302 '(' parameter-declaration-clause ')' */
31304 static tree
31306 {
31307 matching_parens parens;
31311 tree parms = (cp_parser_parameter_declaration_clause
31317 /* Modify the declared parameters by removing their context
31318 so they don't refer to the enclosing scope and explicitly
31319 indicating that they are constraint variables. */
31321 {
31326 {
31329 }
31330 }
31333 }
31335 /* Parse the body of a requirement.
31337 requirement-body:
31338 '{' requirement-list '}' */
31339 static tree
31341 {
31342 matching_braces braces;
31352 }
31354 /* Parse a sequence of requirements.
31356 requirement-seq:
31357 requirement
31358 requirement-seq requirement */
31360 static tree
31362 {
31364 do
31365 {
31369 }
31373 /* If there are no valid requirements, this is not a valid expression. */
31377 /* Reverse the order of requirements so they are analyzed in order. */
31379 }
31381 /* Parse a syntactic requirement or type requirement.
31383 requirement:
31384 simple-requirement
31385 compound-requirement
31386 type-requirement
31387 nested-requirement */
31389 static tree
31391 {
31395 {
31396 /* It's probably a type-requirement. */
31401 /* No, maybe it's something like typename T::type(); */
31406 /* Non-tentative for the error. */
31408 }
31411 else
31413 }
31415 /* Parse a simple requirement.
31417 simple-requirement:
31418 expression ';' */
31420 static tree
31422 {
31433 /* Sometimes we don't get locations, so use the cached token location
31434 as a reasonable approximation. */
31439 {
31442 {
31445 }
31447 {
31451 "if a concept-id is a valid expression; add "
31453 }
31455 }
31458 }
31460 /* Parse a type requirement
31462 type-requirement
31463 nested-name-specifier [opt] required-type-name ';'
31465 required-type-name:
31466 type-name
31467 'template' [opt] simple-template-id */
31469 static tree
31471 {
31475 // Save the scope before parsing name specifiers.
31486 tree type;
31488 {
31497 }
31498 else
31518 }
31520 /* Parse a compound requirement
31522 compound-requirement:
31523 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
31525 static tree
31527 {
31528 /* Parse an expression enclosed in '{ }'s. */
31529 matching_braces braces;
31540 {
31544 }
31546 /* If the expression was invalid, skip the remainder of the requirement. */
31548 {
31552 }
31554 /* Parse the optional noexcept. */
31557 {
31560 }
31562 /* Parse the optional trailing return type. */
31565 {
31571 /* C++20 allows either a type-id or a type-constraint. Parsing
31572 a type-id will subsume the parsing for a type-constraint but
31573 allow for more syntactic forms (e.g., const C<T>*). */
31582 /* Check that we haven't written something like 'const C<T>*'. */
31584 {
31586 {
31591 }
31592 }
31594 /* P1452R2 removed the trailing-return-type option. */
31597 }
31609 }
31611 /* Parse a nested requirement. This is the same as a requires clause.
31613 nested-requirement:
31614 requires-clause */
31616 static tree
31618 {
31630 }
31632 /* Support Functions */
31634 /* Return the appropriate prefer_type argument for lookup_name based on
31635 tag_type. */
31639 {
31641 {
31645 }
31646 }
31648 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
31649 NAME should have one of the representations used for an
31650 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
31651 is returned. If PARSER->SCOPE is a dependent type, then a
31652 SCOPE_REF is returned.
31654 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
31655 returned; the name was already resolved when the TEMPLATE_ID_EXPR
31656 was formed. Abstractly, such entities should not be passed to this
31657 function, because they do not need to be looked up, but it is
31658 simpler to check for this special case here, rather than at the
31659 call-sites.
31661 In cases not explicitly covered above, this function returns a
31662 DECL, OVERLOAD, or baselink representing the result of the lookup.
31663 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
31664 is returned.
31666 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
31667 (e.g., "struct") that was used. In that case bindings that do not
31668 refer to types are ignored.
31670 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
31671 ignored. If IS_TEMPLATE IS 2, the 'template' keyword was specified.
31673 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
31674 are ignored.
31676 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
31677 types.
31679 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
31680 TREE_LIST of candidates if name-lookup results in an ambiguity, and
31681 NULL_TREE otherwise. */
31683 static cp_expr
31690 location_t name_location)
31691 {
31692 tree decl;
31695 /* Assume that the lookup will be unambiguous. */
31699 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
31700 no longer valid. Note that if we are parsing tentatively, and
31701 the parse fails, OBJECT_TYPE will be automatically restored. */
31707 /* A template-id has already been resolved; there is no lookup to
31708 do. */
31712 {
31716 }
31718 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
31719 it should already have been checked to make sure that the name
31720 used matches the type being destroyed. */
31722 {
31723 tree type;
31725 /* Figure out to which type this destructor applies. */
31730 else
31732 /* If that's not a class type, there is no destructor. */
31736 /* In a non-static member function, check implicit this->. */
31739 tf_warning_or_error);
31748 }
31750 /* By this point, the NAME should be an ordinary identifier. If
31751 the id-expression was a qualified name, the qualifying scope is
31752 stored in PARSER->SCOPE at this point. */
31755 /* Perform the lookup. */
31757 {
31763 /* If the SCOPE is dependent, the lookup must be deferred until
31764 the template is instantiated -- unless we are explicitly
31765 looking up names in uninstantiated templates. Even then, we
31766 cannot look up the name if the scope is not a class type; it
31767 might, for example, be a template type parameter. */
31772 /* Defer lookup. */
31774 else
31775 {
31778 /* If PARSER->SCOPE is a dependent type, then it must be a
31779 class type, and we must not be checking dependencies;
31780 otherwise, we would have processed this lookup above. So
31781 that PARSER->SCOPE is not considered a dependent base by
31782 lookup_member, we must enter the scope here. */
31786 /* If the PARSER->SCOPE is a template specialization, it
31787 may be instantiated during name lookup. In that case,
31788 errors may be issued. Even if we rollback the current
31789 tentative parse, those errors are valid. */
31794 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
31795 lookup result and the nested-name-specifier nominates a class C:
31796 * if the name specified after the nested-name-specifier, when
31797 looked up in C, is the injected-class-name of C (Clause 9), or
31798 * if the name specified after the nested-name-specifier is the
31799 same as the identifier or the simple-template-id's template-
31800 name in the last component of the nested-name-specifier,
31801 the name is instead considered to name the constructor of
31802 class C. [ Note: for example, the constructor is not an
31803 acceptable lookup result in an elaborated-type-specifier so
31804 the constructor would not be used in place of the
31805 injected-class-name. --end note ] Such a constructor name
31806 shall be used only in the declarator-id of a declaration that
31807 names a constructor or in a using-declaration. */
31817 }
31819 /* If the scope is a dependent type and either we deferred lookup or
31820 we did lookup but didn't find the name, rememeber the name. */
31823 {
31825 {
31826 tree type;
31828 /* The resolution to Core Issue 180 says that `struct
31829 A::B' should be considered a type-name, even if `A'
31830 is dependent. */
31835 }
31839 CPP_CLOSE_PAREN)))
31843 else
31846 is_template);
31847 }
31850 }
31852 {
31855 /* Look up the name in the scope of the OBJECT_TYPE, unless the
31856 OBJECT_TYPE is not a class. */
31858 /* If the OBJECT_TYPE is a template specialization, it may
31859 be instantiated during name lookup. In that case, errors
31860 may be issued. Even if we rollback the current tentative
31861 parse, those errors are valid. */
31863 name,
31866 tf_warning_or_error);
31867 else
31870 /* If we didn't find a member and have dependent bases, the member lookup
31871 is now dependent. */
31878 /* Look it up in the enclosing context. DR 141: When looking for a
31879 template-name after -> or ., only consider class templates. */
31881 /* DR 141: When looking in the
31882 current enclosing context for a
31883 template-name after -> or ., only
31884 consider class templates. */
31888 /* If we did unqualified lookup of a dependent member-qualified name and
31889 found something, do we want to use it? P1787 clarified that we need
31890 to look in the object scope first even if it's dependent, but for now
31891 let's still use it in some cases.
31892 FIXME remember unqualified lookup result to use if member lookup fails
31893 at instantiation time. */
31895 {
31897 /* Only use the unqualified class template lookup if we're actually
31898 looking at a template arg list. */
31901 }
31903 /* If we know we're looking for a type (e.g. A in p->A::x),
31904 mock up a typename. */
31906 {
31908 typename_type);
31910 }
31914 }
31915 else
31916 {
31921 }
31923 /* If the lookup failed, let our caller know. */
31927 /* If we have resolved the name of a member declaration, check to
31928 see if the declaration is accessible. When the name resolves to
31929 set of overloaded functions, accessibility is checked when
31930 overload resolution is done. If we have a TREE_LIST, then the lookup
31931 is either ambiguous or it found multiple injected-class-names, the
31932 accessibility of which is trivially satisfied.
31934 During an explicit instantiation, access is not checked at all,
31935 as per [temp.explicit]. */
31938 tf_warning_or_error);
31940 /* Pull out the template from an injected-class-name (or multiple). */
31944 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
31946 {
31949 /* The error message we have to print is too complicated for
31950 cp_parser_error, so we incorporate its actions directly. */
31952 {
31954 name);
31956 }
31958 }
31969 }
31971 /* Like cp_parser_lookup_name, but for use in the typical case where
31972 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
31973 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
31975 static tree
31977 {
31979 none_type,
31984 location);
31985 }
31987 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
31988 the current context, return the TYPE_DECL. If TAG_NAME_P is
31989 true, the DECL indicates the class being defined in a class-head,
31990 or declared in an elaborated-type-specifier.
31992 Otherwise, return DECL. */
31994 static tree
31996 {
31997 /* If the TEMPLATE_DECL is being declared as part of a class-head,
31998 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
32000 struct A {
32001 template <typename T> struct B;
32002 };
32004 template <typename T> struct A::B {};
32006 Similarly, in an elaborated-type-specifier:
32008 namespace N { struct X{}; }
32010 struct A {
32011 template <typename T> friend struct N::X;
32012 };
32014 However, if the DECL refers to a class type, and we are in
32015 the scope of the class, then the name lookup automatically
32016 finds the TYPE_DECL created by build_self_reference rather
32017 than a TEMPLATE_DECL. For example, in:
32019 template <class T> struct S {
32020 S s;
32021 };
32023 there is no need to handle such case. */
32029 }
32031 /* If too many, or too few, template-parameter lists apply to the
32032 declarator, issue an error message. Returns TRUE if all went well,
32033 and FALSE otherwise. */
32035 static bool
32038 location_t declarator_location)
32039 {
32041 {
32043 {
32052 {
32053 /* If the DECLARATOR has the form `X<y>' then it uses one
32054 additional level of template parameters. */
32057 }
32059 return cp_parser_check_template_parameters
32061 declarator);
32062 }
32078 }
32080 }
32082 /* NUM_TEMPLATES were used in the current declaration. If that is
32083 invalid, return FALSE and issue an error messages. Otherwise,
32084 return TRUE. If DECLARATOR is non-NULL, then we are checking a
32085 declarator and we can print more accurate diagnostics. */
32087 static bool
32091 location_t location,
32093 {
32094 /* If there are the same number of template classes and parameter
32095 lists, that's OK. */
32098 /* If there are more, but only one more, and the name ends in an identifier,
32099 then we are declaring a primary template. That's OK too. */
32107 /* If there are more template classes than parameter lists, we have
32108 something like:
32110 template <class T> void S<T>::R<T>::f (); */
32112 {
32122 else
32125 }
32126 /* Otherwise, there are too many template parameter lists. We have
32127 something like:
32129 template <class T> template <class U> void S::f(); */
32132 }
32134 /* Parse an optional `::' token indicating that the following name is
32135 from the global namespace. If so, PARSER->SCOPE is set to the
32136 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
32137 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
32138 Returns the new value of PARSER->SCOPE, if the `::' token is
32139 present, and NULL_TREE otherwise. */
32141 static tree
32143 {
32146 /* Peek at the next token. */
32148 /* If we're looking at a `::' token then we're starting from the
32149 global namespace, not our current location. */
32151 {
32152 /* Consume the `::' token. */
32154 /* Set the SCOPE so that we know where to start the lookup. */
32160 }
32162 {
32166 }
32169 }
32171 /* Returns TRUE if the upcoming token sequence is the start of a
32172 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
32173 declarator is preceded by the `friend' specifier. The parser flags FLAGS
32174 is used to control type-specifier parsing. */
32176 static bool
32179 {
32182 tree nested_name_specifier;
32185 /* The common case is that this is not a constructor declarator, so
32186 try to avoid doing lots of work if at all possible. It's not
32187 valid declare a constructor at function scope. */
32190 /* And only certain tokens can begin a constructor declarator. */
32195 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
32196 declarator-id of a constructor or destructor. */
32200 /* Parse tentatively; we are going to roll back all of the tokens
32201 consumed here. */
32203 /* Assume that we are looking at a constructor declarator. */
32206 /* Look for the optional `::' operator. */
32209 /* Look for the nested-name-specifier. */
32210 nested_name_specifier
32217 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
32220 {
32225 }
32231 /* Outside of a class-specifier, there must be a
32232 nested-name-specifier. Except in C++17 mode, where we
32233 might be declaring a guiding declaration. */
32240 /* If we have a class scope, this is easy; DR 147 says that S::S always
32241 names the constructor, and no other qualified name could. */
32244 {
32254 }
32255 /* If we still think that this might be a constructor-declarator,
32256 look for a class-name. */
32258 {
32259 /* If we have:
32261 template <typename T> struct S {
32262 S();
32263 };
32265 we must recognize that the nested `S' names a class. */
32269 tree type_decl;
32273 none_type,
32280 {
32286 none_type,
32291 else
32293 }
32295 /* If there was no class-name, then this is not a constructor.
32296 Otherwise, if we are in a class-specifier and we aren't
32297 handling a friend declaration, check that its type matches
32298 current_class_type (c++/38313). Note: error_mark_node
32299 is left alone for error recovery purposes. */
32301 && (outside_class_specifier_p
32307 /* If we're still considering a constructor, we have to see a `(',
32308 to begin the parameter-declaration-clause, followed by either a
32309 `)', an `...', or a decl-specifier. We need to check for a
32310 type-specifier to avoid being fooled into thinking that:
32312 S (f) (int);
32314 is a constructor. (It is actually a function named `f' that
32315 takes one parameter (of type `int') and returns a value of type
32316 `S'. */
32324 /* A parameter declaration begins with a decl-specifier,
32325 which is either the "attribute" keyword, a storage class
32326 specifier, or (usually) a type-specifier. */
32328 /* GNU attributes can actually appear both at the start of
32329 a parameter and parenthesized declarator.
32330 S (__attribute__((unused)) int);
32331 is a constructor, but
32332 S (__attribute__((unused)) foo) (int);
32333 is a function declaration. [[attribute]] can appear in the
32334 first form too, but not in the second form. */
32336 {
32337 tree type;
32343 {
32347 }
32349 /* Names appearing in the type-specifier should be looked up
32350 in the scope of the class. */
32354 {
32357 {
32361 {
32364 }
32365 }
32367 }
32369 /* Inside the constructor parameter list, surrounding
32370 template-parameter-lists do not apply. */
32371 saved_num_template_parameter_lists
32375 /* Look for the type-specifier. It's not optional, but its typename
32376 might be. Unless this is a friend declaration; we don't want to
32377 treat
32379 friend S (T::fn)(int);
32381 as a constructor, but with P0634, we might assume a type when
32382 looking for the type-specifier. It is actually a function named
32383 `T::fn' that takes one parameter (of type `int') and returns a
32384 value of type `S'. Constructors can be friends, but they must
32385 use a qualified name.
32387 Parse with an empty set of declaration specifiers since we're
32388 trying to match a decl-specifier-seq of the first parameter.
32389 This must be non-null so that cp_parser_simple_type_specifier
32390 will recognize a constrained placeholder type such as:
32391 'C<int> auto' where C is a type concept. */
32392 cp_decl_specifier_seq ctor_specs;
32402 parser->num_template_parameter_lists
32405 /* Leave the scope of the class. */
32410 }
32411 }
32413 /* We did not really want to consume any tokens. */
32417 }
32419 /* Parse the definition of the function given by the DECL_SPECIFIERS,
32420 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
32421 they must be performed once we are in the scope of the function.
32423 Returns the function defined. */
32425 static tree
32426 cp_parser_function_definition_from_specifiers_and_declarator
32429 tree attributes,
32431 {
32432 tree fn;
32435 /* Begin the function-definition. */
32438 /* The things we're about to see are not directly qualified by any
32439 template headers we've seen thus far. */
32442 /* If there were names looked up in the decl-specifier-seq that we
32443 did not check, check them now. We must wait until we are in the
32444 scope of the function to perform the checks, since the function
32445 might be a friend. */
32449 {
32454 }
32457 {
32458 /* Skip the entire function. */
32461 }
32463 {
32464 /* Seen already, skip it. An error message has already been output. */
32468 /* If this is a function from a class, pop the nested class. */
32471 }
32472 else
32473 {
32478 }
32481 }
32483 /* Parse the part of a function-definition that follows the
32484 declarator. INLINE_P is TRUE iff this function is an inline
32485 function defined within a class-specifier.
32487 Returns the function defined. */
32489 static tree
32492 {
32493 tree fn;
32498 bool fully_implicit_function_template_p
32501 tree implicit_template_parms
32504 cp_binding_level* implicit_template_scope
32510 /* If the next token is `return', then the code may be trying to
32511 make use of the "named return value" extension that G++ used to
32512 support. */
32515 {
32516 /* Consume the `return' keyword. */
32518 /* Look for the identifier that indicates what value is to be
32519 returned. */
32521 /* Issue an error message. */
32524 /* Skip tokens until we reach the start of the function body. */
32526 {
32533 }
32534 }
32535 /* The `extern' in `extern "C" void f () { ... }' does not apply to
32536 anything declared inside `f'. */
32537 saved_in_unbraced_linkage_specification_p
32540 /* Inside the function, surrounding template-parameter-lists do not
32541 apply. */
32542 saved_num_template_parameter_lists
32546 /* If the next token is `try', `__transaction_atomic', or
32547 `__transaction_relaxed`, then we are looking at either function-try-block
32548 or function-transaction-block. Note that all of these include the
32549 function-body. */
32553 RID_TRANSACTION_RELAXED))
32557 else
32558 cp_parser_ctor_initializer_opt_and_function_body
32561 /* Finish the function. */
32565 && !inline_p
32571 /* Generate code for it, if necessary. */
32574 /* Restore the saved values. */
32575 parser->in_unbraced_linkage_specification_p
32577 parser->num_template_parameter_lists
32581 parser->fully_implicit_function_template_p
32583 parser->implicit_template_parms
32585 parser->implicit_template_scope
32592 }
32594 /* Parse a template-declaration body (following argument list). */
32596 static void
32598 tree parameter_list,
32600 {
32604 /* We just processed one more parameter list. */
32607 /* Get the deferred access checks from the parameter list. These
32608 will be checked once we know what is being declared, as for a
32609 member template the checks must be performed in the scope of the
32610 class containing the member. */
32613 /* Tentatively parse for a new template parameter list, which can either be
32614 the template keyword or a template introduction. */
32623 /* -fconcept-ts 'concept bool' syntax is handled below, in
32624 cp_parser_single_declaration. */
32626 else
32627 {
32630 checks,
32631 member_p,
32635 /* If this is a member template declaration, let the front
32636 end know. */
32638 {
32643 }
32648 }
32649 /* We are done with the current parameter list. */
32654 /* Finish up. */
32657 /* Check the template arguments for a literal operator template. */
32661 {
32665 else
32666 {
32669 {
32676 /* OK, C++20 string literal operator template. We don't need
32677 to warn in lower dialects here because we will have already
32682 }
32684 {
32693 else
32694 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
32696 "ISO C++ did not adopt string literal operator templa"
32698 }
32699 else
32701 }
32703 {
32706 "template %qD has invalid parameter list; expected "
32707 "non-type template parameter pack %<<char...>%> or "
32709 decl);
32710 else
32712 "template %qD has invalid parameter list; expected "
32714 decl);
32715 }
32716 }
32718 /* Register member declarations. */
32721 /* If DECL is a function template, we must return to parse it later.
32722 (Even though there is no definition, there might be default
32723 arguments that need handling.) */
32727 }
32729 /* Parse a template introduction header for a template-declaration. Returns
32730 false if tentative parse fails. */
32732 static bool
32734 {
32744 /* In classes don't parse valid unnamed bitfields as invalid
32745 template introductions. */
32749 /* Look for the optional `::' operator. */
32752 /* Look for the nested-name-specifier. */
32762 /* Look up the concept for which we will be matching
32763 template parameters. */
32775 /* Look for opening brace for introduction. */
32776 matching_braces braces;
32785 /* Build vector of placeholder parameters and grab
32786 matching identifiers. */
32789 /* Look for closing brace for introduction. */
32793 /* The introduction-list shall not be empty. */
32796 {
32797 /* In cp_parser_introduction_list we have already issued an error. */
32799 }
32802 {
32806 }
32808 /* Build and associate the constraint. */
32813 introduction_list,
32814 introduction_loc);
32816 {
32823 member_p);
32825 }
32831 }
32833 /* Parse a normal template-declaration following the template keyword. */
32835 static void
32837 {
32838 tree parameter_list;
32842 /* Look for the `<' token. */
32846 {
32847 /* 14.5.2.2 [temp.mem]
32849 A local class shall not have member templates. */
32854 }
32855 /* [temp]
32857 A template ... shall not have C linkage. */
32859 {
32862 /* Give it C++ linkage to avoid confusing other parts of the
32863 front end. */
32866 }
32867 else
32870 /* We cannot perform access checks on the template parameter
32871 declarations until we know what is being declared, just as we
32872 cannot check the decl-specifier list. */
32875 /* If the next token is `>', then we have an invalid
32876 specialization. Rather than complain about an invalid template
32877 parameter, issue an error message here. */
32879 {
32883 }
32884 else
32885 {
32886 /* Parse the template parameters. */
32888 }
32890 /* Look for the `>'. */
32893 /* Manage template requirements */
32895 {
32900 }
32903 member_p);
32905 /* For the erroneous case of a template with C linkage, we pushed an
32906 implicit C++ linkage scope; exit that scope now. */
32909 }
32911 /* Parse a template-declaration, assuming that the `export' (and
32912 `extern') keywords, if present, has already been scanned. MEMBER_P
32913 is as for cp_parser_template_declaration. */
32915 static bool
32917 {
32919 {
32923 }
32928 }
32930 /* Perform the deferred access checks from a template-parameter-list.
32931 CHECKS is a TREE_LIST of access checks, as returned by
32932 get_deferred_access_checks. */
32934 static void
32935 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
32936 {
32940 }
32942 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
32943 `function-definition' sequence that follows a template header.
32944 If MEMBER_P is true, this declaration appears in a class scope.
32946 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
32947 *FRIEND_P is set to TRUE iff the declaration is a friend. */
32949 static tree
32955 {
32958 cp_decl_specifier_seq decl_specifiers;
32962 /* This function is only used when processing a template
32963 declaration. */
32967 /* Defer access checks until we know what is being declared. */
32970 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
32971 alternative. */
32974 (CP_PARSER_FLAGS_OPTIONAL
32979 cp_omp_declare_simd_data odsd;
32988 /* There are no template typedefs. */
32990 {
32994 }
32996 /* Gather up the access checks that occurred the
32997 decl-specifier-seq. */
33000 /* Check for the declaration of a template class. */
33002 {
33005 {
33008 /* In this case:
33010 struct C {
33011 friend template <typename T> struct A<T>::B;
33012 };
33014 A<T>::B will be represented by a TYPENAME_TYPE, and
33015 therefore not recognized by shadow_tag. */
33017 && !decl
33024 else
33027 /* If this is a declaration, but not a definition, associate
33028 any constraints with the type declaration. Constraints
33029 are associated with definitions in cp_parser_class_specifier. */
33033 /* Perform access checks for template parameters. */
33036 /* Give a helpful diagnostic for
33037 template <class T> struct A { } a;
33038 if we aren't already recovering from an error. */
33041 {
33043 "a class template declaration must not declare "
33047 }
33048 }
33049 }
33051 /* Complain about missing 'typename' or other invalid type names. */
33054 {
33055 /* cp_parser_parse_and_diagnose_invalid_type_name calls
33056 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
33057 the rest of this declaration. */
33060 }
33062 /* If it's not a template class, try for a template function. If
33063 the next token is a `;', then this declaration does not declare
33064 anything. But, if there were errors in the decl-specifiers, then
33065 the error might well have come from an attempted class-specifier.
33066 In that case, there's no need to warn about a missing declarator. */
33070 {
33072 /* We don't delay parsing for friends, though CWG 2510 may change
33073 that. */
33077 flags,
33079 checks,
33081 member_p,
33082 declares_class_or_enum,
33086 /* 7.1.1-1 [dcl.stc]
33088 A storage-class-specifier shall not be specified in an explicit
33089 specialization... */
33091 && explicit_specialization_p
33093 {
33097 }
33101 }
33103 /* Look for a trailing `;' after the declaration. */
33109 out:
33112 /* Clear any current qualification; whatever comes next is the start
33113 of something new. */
33121 }
33123 /* Parse a cast-expression that is not the operand of a unary "&". */
33125 static cp_expr
33127 {
33130 }
33132 /* Parse a functional cast to TYPE. Returns an expression
33133 representing the cast. */
33135 static cp_expr
33137 {
33139 tree expression_list;
33140 cp_expr cast;
33148 {
33158 /* Create a location of the form:
33159 type_name{i, f}
33160 ^~~~~~~~~~~~~~~
33161 with caret == start at the start of the type name,
33162 finishing at the closing brace. */
33167 }
33176 else
33177 {
33180 }
33182 /* Create a location of the form:
33183 float(i)
33184 ^~~~~~~~
33185 with caret == start at the start of the type name,
33186 finishing at the closing paren. */
33190 tf_warning_or_error);
33192 /* [expr.const]/1: In an integral constant expression "only type
33193 conversions to integral or enumeration type can be used". */
33199 NIC_CONSTRUCTOR))
33203 }
33205 /* Save the tokens that make up the body of a member function defined
33206 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
33207 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
33208 specifiers applied to the declaration. Returns the FUNCTION_DECL
33209 for the member function. */
33211 static tree
33215 tree attributes)
33216 {
33219 tree fn;
33222 /* Create the FUNCTION_DECL. */
33226 /* If something went badly wrong, bail out now. */
33228 {
33229 /* If there's a function-body, skip it. */
33234 }
33236 /* Remember it, if there are default args to post process. */
33239 /* Save away the tokens that make up the body of the
33240 function. */
33246 RID_TRANSACTION_ATOMIC))
33247 {
33249 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
33256 {
33262 }
33263 else
33266 {
33270 }
33271 }
33273 /* Handle function try blocks. */
33275 {
33278 }
33279 /* We can have braced-init-list mem-initializers before the fn body. */
33281 {
33284 {
33285 /* cache_group will stop after an un-nested { } pair, too. */
33289 /* variadic mem-inits have ... after the ')'. */
33292 }
33293 }
33295 /* Handle function try blocks. */
33301 /* Save away the inline definition; we will process it when the
33302 class is complete. */
33306 /* We need to know that this was defined in the class, so that
33307 friend templates are handled correctly. */
33310 /* Add FN to the queue of functions to be parsed later. */
33314 }
33316 /* Save the tokens that make up the in-class initializer for a non-static
33317 data member. Returns a DEFERRED_PARSE. */
33319 static tree
33321 {
33323 }
33325 /* Parse a template-argument-list, as well as the trailing ">" (but
33326 not the opening "<"). See cp_parser_template_argument_list for the
33327 return value. */
33329 static tree
33331 {
33332 tree arguments;
33333 tree saved_scope;
33334 tree saved_qualifying_scope;
33335 tree saved_object_scope;
33338 /* [temp.names]
33340 When parsing a template-id, the first non-nested `>' is taken as
33341 the end of the template-argument-list rather than a greater-than
33342 operator. */
33343 saved_greater_than_is_operator_p
33346 /* Parsing the argument list may modify SCOPE, so we save it
33347 here. */
33351 /* We need to evaluate the template arguments, even though this
33352 template-id may be nested within a "sizeof". */
33353 cp_evaluated ev;
33354 /* Parse the template-argument-list itself. */
33359 {
33362 }
33363 else
33365 /* Look for the `>' that ends the template-argument-list. If we find
33366 a '>>' instead, it's probably just a typo. */
33368 {
33370 {
33371 /* In C++0x, a `>>' in a template argument list or cast
33372 expression is considered to be two separate `>'
33373 tokens. So, change the current token to a `>', but don't
33374 consume it: it will be consumed later when the outer
33375 template argument list (or cast expression) is parsed.
33376 Note that this replacement of `>' for `>>' is necessary
33377 even if we are parsing tentatively: in the tentative
33378 case, after calling
33379 cp_parser_enclosed_template_argument_list we will always
33380 throw away all of the template arguments and the first
33381 closing `>', either because the template argument list
33382 was erroneous or because we are replacing those tokens
33383 with a CPP_TEMPLATE_ID token. The second `>' (which will
33384 not have been thrown away) is needed either to close an
33385 outer template argument list or to complete a new-style
33386 cast. */
33389 }
33391 {
33392 /* If we're in a nested template argument list, the '>>' has
33393 to be a typo for '> >'. We emit the error message, but we
33394 continue parsing and we push a '>' as next token, so that
33395 the argument list will be parsed correctly. Note that the
33396 global source location is still on the token before the
33397 '>>', so we need to say explicitly where we want it. */
33405 }
33406 else
33407 {
33408 /* If this is not a nested template argument list, the '>>'
33409 is a typo for '>'. Emit an error message and continue.
33410 Same deal about the token location, but here we can get it
33411 right by consuming the '>>' before issuing the diagnostic. */
33414 "spurious %<>>%>, use %<>%> to terminate "
33416 }
33417 }
33418 /* Similarly for >>= and >=. */
33421 {
33427 {
33430 }
33432 {
33435 else
33438 }
33439 else
33440 {
33443 }
33449 }
33450 else
33452 /* The `>' token might be a greater-than operator again now. */
33453 parser->greater_than_is_operator_p
33455 /* Restore the SAVED_SCOPE. */
33461 }
33463 /* MEMBER_FUNCTION is a member function, or a friend. If default
33464 arguments, or the body of the function have not yet been parsed,
33465 parse them now. */
33467 static void
33469 {
33472 /* If this member is a template, get the underlying
33473 FUNCTION_DECL. */
33477 /* There should not be any class definitions in progress at this
33478 point; the bodies of members are only parsed outside of all class
33479 definitions. */
33481 /* While we're parsing the member functions we might encounter more
33482 classes. We want to handle them right away, but we don't want
33483 them getting mixed up with functions that are currently in the
33484 queue. */
33487 /* Make sure that any template parameters are in scope. */
33490 /* If the body of the function has not yet been parsed, parse it
33491 now. Except if the tokens have been purged (PR c++/39751). */
33494 {
33495 tree function_scope;
33498 /* The function is no longer pending; we are processing it. */
33503 /* If this is a local class, enter the scope of the containing
33504 function. */
33509 /* Push the body of the function onto the lexer stack. */
33512 /* Let the front end know that we going to be defining this
33513 function. */
33517 /* #pragma omp declare reduction needs special parsing. */
33519 {
33524 }
33525 else
33526 /* Now, parse the body of the function. */
33530 /* Leave the scope of the containing function. */
33534 }
33536 /* Remove any template parameters from the symbol table. */
33539 /* Restore the queue. */
33541 }
33543 /* If DECL contains any default args, remember it on the unparsed
33544 functions queue. */
33546 static void
33548 {
33549 tree probe;
33552 probe;
33555 {
33559 }
33561 /* Remember if there is a noexcept-specifier to post process. */
33566 /* Contracts are deferred. */
33569 {
33572 }
33573 }
33575 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
33576 which is either a FIELD_DECL or PARM_DECL. Parse it and return
33577 the result. For a PARM_DECL, PARMTYPE is the corresponding type
33578 from the parameter-type-list. */
33580 static tree
33583 {
33585 tree parsed_arg;
33590 /* Push the saved tokens for the default argument onto the parser's
33591 lexer stack. */
33597 /* Parse the default argument. */
33608 {
33609 /* In a non-template class, check conversions now. In a template,
33610 we'll wait and instantiate these as needed. */
33613 tf_warning_or_error);
33616 else
33618 }
33620 /* If the token stream has not been completely used up, then
33621 there was extra junk after the end of the default
33622 argument. */
33624 {
33627 else
33629 }
33631 /* Revert to the main lexer. */
33635 }
33637 /* FIELD is a non-static data member with an initializer which we saved for
33638 later; parse it now. */
33640 static void
33642 {
33643 tree def;
33650 NULL_TREE);
33656 }
33658 /* FN is a FUNCTION_DECL which may contains a parameter with an
33659 unparsed DEFERRED_PARSE. Parse the default args now. This function
33660 assumes that the current scope is the scope in which the default
33661 argument should be processed. */
33663 static void
33665 {
33668 /* While we're parsing the default args, we might (due to the
33669 statement expression extension) encounter more classes. We want
33670 to handle them right away, but we don't want them getting mixed
33671 up with default args that are currently in the queue. */
33674 /* Local variable names (and the `this' keyword) may not appear
33675 in a default argument. */
33683 /* Gather the PARM_DECLs into a vec so we can keep track of them when
33684 pushdecl clears DECL_CHAIN. */
33685 releasing_vec parms;
33695 {
33697 tree parsed_arg;
33706 /* This can happen for a friend declaration for a function
33707 already declared with default arguments. */
33710 parsed_arg
33712 default_arg,
33716 /* Update any instantiations we've already created. */
33719 }
33723 /* Restore DECL_CHAINs after clobbering by pushdecl. */
33726 {
33729 }
33733 /* Make sure no default arg is missing. */
33736 /* Restore the state of local_variables_forbidden_p. */
33739 /* Restore the queue. */
33741 }
33743 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
33745 sizeof ... ( identifier )
33747 where the 'sizeof' token has already been consumed. */
33749 static tree
33751 {
33752 /* Consume the `...'. */
33756 matching_parens parens;
33760 else
33768 /* The name is not qualified. */
33788 }
33790 /* Parse the operand of `sizeof' (or a similar operator). Returns
33791 either a TYPE or an expression, depending on the form of the
33792 input. The KEYWORD indicates which kind of expression we have
33793 encountered. */
33795 static tree
33797 {
33804 /* If it's a `...', then we are computing the length of a parameter
33805 pack. */
33810 /* Types cannot be defined in a `sizeof' expression. Save away the
33811 old message. */
33814 parser->type_definition_forbidden_message
33816 parser->type_definition_forbidden_message_arg
33819 /* The restrictions on constant-expressions do not apply inside
33820 sizeof expressions. */
33821 saved_integral_constant_expression_p
33823 saved_non_integral_constant_expression_p
33830 /* Do not actually evaluate the expression. */
33833 /* If it's a `(', then we might be looking at the type-id
33834 construction. */
33836 {
33841 /* We can't be sure yet whether we're looking at a type-id or an
33842 expression. */
33845 matching_parens parens;
33848 /* Note: as a GNU Extension, compound literals are considered
33849 postfix-expressions as they are in C99, so they are valid
33850 arguments to sizeof. See comment in cp_parser_cast_expression
33851 for details. */
33854 else
33855 {
33858 /* Look for the type-id. */
33860 /* Look for the closing `)'. */
33863 }
33865 /* If all went well, then we're done. */
33868 else
33869 {
33870 /* Commit to the tentative_firewall so we get syntax errors. */
33874 }
33875 }
33876 else
33879 /* Go back to evaluating expressions. */
33883 /* And restore the old one. */
33886 parser->integral_constant_expression_p
33888 parser->non_integral_constant_expression_p
33892 }
33894 /* If the current declaration has no declarator, return true. */
33896 static bool
33898 {
33899 /* If the next token is a `;' or a `,' then there is no
33900 declarator. */
33903 }
33905 /* Update the DECL_SPECS to reflect the storage class indicated by
33906 KEYWORD. */
33908 static void
33913 {
33914 cp_storage_class storage_class;
33917 {
33935 }
33938 {
33942 }
33944 {
33951 else
33958 }
33963 {
33966 }
33971 /* A storage class specifier cannot be applied alongside a typedef
33972 specifier. If there is a typedef specifier present then set
33973 conflicting_specifiers_p which will trigger an error later
33974 on in grokdeclarator. */
33977 {
33984 }
33985 }
33987 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
33988 is true, the type is a class or enum definition. */
33990 static void
33992 tree type_spec,
33995 {
33998 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
33999 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
34000 this is what happened. In system headers, we ignore these
34001 declarations so that G++ can work with system headers that are not
34002 C++-safe. */
34004 && !type_definition_p
34017 {
34020 ds_redefined_builtin_type_spec,
34021 token);
34023 {
34027 }
34028 }
34031 else
34032 {
34037 }
34038 }
34040 /* True iff TOKEN is the GNU keyword __thread. */
34042 static bool
34044 {
34047 }
34049 /* Set the location for a declarator specifier and check if it is
34050 duplicated.
34052 DECL_SPECS is the sequence of declarator specifiers onto which to
34053 set the location.
34055 DS is the single declarator specifier to set which location is to
34056 be set onto the existing sequence of declarators.
34058 LOCATION is the location for the declarator specifier to
34059 consider. */
34061 static void
34064 {
34073 {
34077 }
34078 else
34079 {
34081 {
34085 else
34086 {
34089 OPT_Wlong_long,
34091 }
34092 }
34094 {
34098 {
34102 }
34103 else
34104 {
34107 }
34108 }
34109 else
34110 {
34111 /* These correspond to cp-tree.h:cp_decl_spec,
34112 changes here should also be reflected there. */
34131 "this"
34132 };
34136 }
34137 }
34138 }
34140 /* Return true iff the declarator specifier DS is present in the
34141 sequence of declarator specifiers DECL_SPECS. */
34143 bool
34145 cp_decl_spec ds)
34146 {
34153 }
34155 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
34156 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
34158 static bool
34160 {
34162 }
34164 /* Issue an error message indicating that TOKEN_DESC was expected.
34165 If KEYWORD is true, it indicated this function is called by
34166 cp_parser_require_keword and the required token can only be
34167 a indicated keyword.
34169 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
34170 within any error as the location of an "opening" token matching
34171 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
34172 RT_CLOSE_PAREN). */
34174 static void
34176 required_token token_desc,
34178 location_t matching_location)
34179 {
34185 {
34260 }
34263 {
34265 {
34343 }
34344 }
34348 }
34351 /* If the next token is of the indicated TYPE, consume it. Otherwise,
34352 issue an error message indicating that TOKEN_DESC was expected.
34354 Returns the token consumed, if the token had the appropriate type.
34355 Otherwise, returns NULL.
34357 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
34358 within any error as the location of an "opening" token matching
34359 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
34360 RT_CLOSE_PAREN). */
34365 required_token token_desc,
34366 location_t matching_location)
34367 {
34370 else
34371 {
34372 /* Output the MESSAGE -- unless we're parsing tentatively. */
34375 matching_location);
34377 }
34378 }
34380 /* Skip an entire parameter list from start to finish. The next token must
34381 be the initial "<" of the parameter list. Returns true on success and
34382 false otherwise. */
34384 static bool
34386 {
34387 /* Consume the "<" because cp_parser_skip_to_end_of_template_parameter_list
34388 requires it. */
34391 }
34393 /* Ensure we are at the end of a template parameter list. If we are, return.
34394 If we are not, something has gone wrong, in which case issue an error and
34395 skip to end of the parameter list. */
34397 static void
34399 {
34400 /* Are we ready, yet? If not, issue error message. */
34405 }
34407 /* You should only call this function from inside a template parameter list
34408 (i.e. the current token should at least be the initial "<" of the
34409 parameter list). If you are skipping the entire list, it may be better to
34410 use cp_parser_skip_entire_template_parameter_list.
34412 Tokens are skipped until the final ">" is found, or if we see
34413 '{', '}', ';', or if we find an unbalanced ')' or ']'.
34415 Returns true if we successfully reached the end, and false if
34416 something unexpected happened (e.g. end of file). */
34418 static bool
34420 {
34421 /* Current level of '< ... >'. */
34423 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
34426 /* Skip tokens until the desired token is found. */
34428 {
34429 /* Peek at the next token. */
34431 {
34439 /* C++0x views the `>>' operator as two `>' tokens, but
34440 C++98 does not. */
34443 {
34444 /* We've hit a `>>' where the first `>' closes the
34445 template argument list, and the second `>' is
34446 spurious. Just consume the `>>' and stop; we've
34447 already produced at least one error. */
34450 }
34451 /* Fall through for C++0x, so we handle the second `>' in
34452 the `>>'. */
34457 {
34458 /* We've reached the token we want, consume it and stop. */
34461 }
34480 /* The '>' was probably forgotten, don't look further. */
34485 }
34487 /* Consume this token. */
34489 }
34490 }
34492 /* If the next token is the indicated keyword, consume it. Otherwise,
34493 issue an error message indicating that TOKEN_DESC was expected.
34495 Returns the token consumed, if the token had the appropriate type.
34496 Otherwise, returns NULL. */
34501 required_token token_desc)
34502 {
34506 {
34508 UNKNOWN_LOCATION);
34510 }
34513 }
34515 /* Returns TRUE iff TOKEN is a token that can begin the body of a
34516 function-definition. */
34518 static bool
34520 {
34523 /* A ctor-initializer begins with a `:'. */
34525 /* A function-try-block begins with `try'. */
34527 /* A function-transaction-block begins with `__transaction_atomic'
34528 or `__transaction_relaxed'. */
34531 /* The named return value extension begins with `return'. */
34533 }
34535 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
34536 definition. */
34538 static bool
34540 {
34547 }
34549 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
34550 C++0x) ending a template-argument. */
34552 static bool
34554 {
34562 /* For better diagnostics, treat >>= like that too, that
34563 shouldn't appear non-nested in template arguments. */
34565 }
34567 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
34568 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
34570 static bool
34573 {
34579 /* Check for the sequence `<::' in the original code. It would be lexed as
34580 `[:', where `[' is a digraph, and there is no whitespace before
34581 `:'. */
34583 {
34588 }
34590 }
34592 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
34593 or none_type otherwise. */
34595 static enum tag_types
34597 {
34599 {
34609 }
34610 }
34612 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
34613 or none_type otherwise or if the token is null. */
34615 static enum tag_types
34617 {
34622 {
34630 }
34631 }
34633 /* Diagnose redundant enum-keys. */
34635 static void
34638 {
34644 /* Look up the NAME to see if it unambiguously refers to the TYPE. */
34649 /* The enum-key is redundant for uses of the TYPE that are not
34650 declarations and for which name lookup returns just the type
34651 itself. */
34659 {
34660 /* Avoid issuing the diagnostic for apparently redundant (unscoped)
34661 enum tag in shared C/C++ code in files (such as headers) included
34662 in the main source file. */
34665 LRK_MACRO_DEFINITION_LOCATION,
34669 }
34677 }
34679 /* Describes the set of declarations of a struct, class, or class template
34680 or its specializations. Used for -Wmismatched-tags. */
34682 class class_decl_loc_t
34683 {
34688 {
34690 }
34692 /* Constructs an object for a single declaration of a class with
34693 CLASS_KEY at the current location in the current function (or
34694 at another scope). KEY_REDUNDANT is true if the class-key may
34695 be omitted in the current context without an ambiguity with
34696 another symbol with the same name.
34697 DEF_P is true for a class declaration that is a definition.
34698 CURLOC is the associated location. */
34702 {
34705 key_redundant);
34707 }
34709 /* Copy, assign, and destroy the object. Necessary because LOCVEC
34710 isn't safely copyable and assignable and doesn't release storage
34711 on its own. */
34715 { }
34718 {
34726 }
34729 {
34731 }
34733 /* Issues -Wmismatched-tags for a single class. */
34736 /* Issues -Wmismatched-tags for all classes. */
34739 /* Adds TYPE_DECL to the collection of class decls and diagnoses
34740 redundant tags (if -Wredundant-tags is enabled). */
34743 /* Either adds this decl to the collection of class decls
34744 or diagnoses it, whichever is appropriate. */
34750 {
34752 }
34755 {
34757 }
34760 {
34762 }
34765 {
34767 }
34769 /* True if a definition for the class has been seen. */
34771 {
34773 }
34775 /* The location of a single mention of a class type with the given
34776 class-key. */
34777 struct class_key_loc_t
34778 {
34781 { }
34783 /* The function the type is mentioned in. */
34784 tree func;
34785 /* The exact location. */
34786 location_t loc;
34787 /* The class-key used in the mention of the type. */
34788 tag_types class_key;
34789 /* True when the class-key could be omitted at this location
34790 without an ambiguity with another symbol of the same name. */
34792 };
34793 /* Avoid using auto_vec here since it's not safe to copy due to pr90904. */
34795 /* LOCVEC index of the definition or UINT_MAX if none exists. */
34797 /* The class-key the class was last declared with or none_type when
34798 it has been declared with a mismatched key. */
34799 tag_types def_class_key;
34801 /* A mapping between a TYPE_DECL for a class and the class_decl_loc_t
34802 description above. */
34805 };
34809 /* Issue an error message if the CLASS_KEY does not match the TYPE.
34810 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34811 is set for a declaration of class TYPE and clear for a reference to
34812 it that is not a declaration of it. */
34814 static void
34818 {
34824 {
34828 type))
34832 }
34837 /* Only consider the true class-keys below and ignore typename_type,
34838 etc. that are not C++ class-keys. */
34845 }
34847 /* Returns the template or specialization of one to which the RECORD_TYPE
34848 TYPE corresponds. */
34850 static tree
34852 {
34855 /* Determine the template or its partial specialization to which TYPE
34856 corresponds. */
34865 }
34868 /* Adds the class TYPE to the collection of class decls and diagnoses
34869 redundant tags (if -Wredundant-tags is enabled).
34870 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34871 is set for a (likely, based on syntactic context) declaration of class
34872 TYPE and clear for a reference to it that is not a declaration of it. */
34874 void
34877 {
34880 /* Look up the NAME to see if it unambiguously refers to the TYPE
34881 and set KEY_REDUNDANT if so. */
34886 /* The class-key is redundant for uses of the CLASS_TYPE that are
34887 neither definitions of it nor declarations, and for which name
34888 lookup returns just the type itself. */
34899 {
34900 /* Avoid issuing the diagnostic for apparently redundant struct
34901 and union class-keys in shared C/C++ code in files (such as
34902 headers) included in the main source file. */
34905 LRK_MACRO_DEFINITION_LOCATION,
34909 }
34911 /* Set if a declaration of TYPE has previously been seen or if it must
34912 exist in a precompiled header. */
34916 {
34919 {
34920 /* TYPE_DECL is the first declaration or definition of the type
34921 (outside precompiled headers -- see below). Just create
34922 a new entry for it and return unless it's a declaration
34923 involving a template that may need to be diagnosed by
34924 -Wredundant-tags. */
34928 }
34929 else
34930 {
34931 /* TYPE was previously defined in some unknown precompiled header.
34932 Simply add a record of its definition at an unknown location and
34933 proceed below to add a reference to it at the current location.
34934 (Declarations in precompiled headers that are not definitions
34935 are ignored.) */
34936 tag_types def_key
34941 }
34942 }
34944 /* A prior declaration of TYPE_DECL has been seen. */
34947 {
34954 type);
34955 }
34958 /* Do nothing if this is the first declaration of the type. */
34962 /* Do nothing if the class-key in this declaration matches
34963 the definition. */
34967 def_p);
34968 }
34970 /* Either adds this DECL corresponding to the TYPE_DECL to the collection
34971 of class decls or diagnoses it, whichever is appropriate. */
34973 void
34975 tag_types class_key,
34978 {
34979 /* Reset the CLASS_KEY associated with this type on mismatch.
34980 This is an optimization that lets the diagnostic code skip
34981 over classes that use the same class-key in all declarations. */
34985 /* Set IDXDEF to the index of the vector corresponding to
34986 the definition. */
34990 /* Append a record of this declaration to the vector. */
34992 redundant);
34998 /* As a space optimization diagnose declarations of a class
34999 whose definition has been seen and purge the LOCVEC of
35000 all entries except the definition. */
35003 {
35009 }
35010 else
35011 /* Pop the entry pushed above for this declaration. */
35013 }
35015 /* Issues -Wmismatched-tags for a single class. */
35017 void
35019 {
35023 /* Number of uses of the class. */
35026 /* The class (or template) declaration guiding the decisions about
35027 the diagnostic. For ordinary classes it's the same as THIS. For
35028 uses of instantiations of templates other than their declarations
35029 it points to the record for the declaration of the corresponding
35030 primary template or partial specialization. */
35035 {
35036 /* For implicit instantiations of a primary template look up
35037 the primary or partial specialization and use it as
35038 the expected class-key rather than using the class-key of
35039 the first reference to the instantiation. The primary must
35040 be (and inevitably is) at index zero. */
35043 /* It's possible that we didn't find SPEC. Consider:
35045 template<typename T> struct A {
35046 template<typename U> struct W { };
35047 };
35048 struct A<int>::W<int> w; // #1
35050 where while parsing A and #1 we've stashed
35051 A<T>
35052 A<T>::W<U>
35053 A<int>::W<int>
35054 into CLASS2LOC. If TYPE is A<int>::W<int>, specialization_of
35055 will yield A<int>::W<U> which may be in CLASS2LOC if we had
35056 an A<int> class specialization, but otherwise won't be in it.
35057 So try to look up A<T>::W<U>. */
35059 {
35062 }
35063 /* Now we really should have found something. */
35065 }
35066 /* Skip declarations that consistently use the same class-key. */
35070 /* Set if a definition for the class has been seen. */
35073 /* The index of the declaration whose class-key this declaration
35074 is expected to match. It's either the class-key of the class
35075 definition if one exists or the first declaration otherwise. */
35078 /* The class-key the class is expected to be declared with: it's
35079 either the key used in its definition or the first declaration
35080 if no definition has been provided.
35081 For implicit instantiations of a primary template it's
35082 the class-key used to declare the primary with. The primary
35083 must be at index zero. */
35087 /* Advance IDX to the first declaration that either is not
35088 a definition or that doesn't match the first declaration
35089 if no definition is provided. */
35094 /* Save the current function before changing it below. */
35096 /* Set the function declaration to print in diagnostic context. */
35104 auto_diagnostic_group d;
35105 /* Issue a warning for the first mismatched declaration.
35106 Avoid using "%#qT" since the class-key for the same type will
35107 be the same regardless of which one was used in the declaraion. */
35111 {
35112 /* Suggest how to avoid the warning for each instance since
35113 the guidance may be different depending on context. */
35115 (key_redundant_p
35118 xpectkstr);
35120 /* Also point to the first declaration or definition that guided
35121 the decision to issue the warning above. */
35123 (def_p
35127 }
35129 /* Issue warnings for the remaining inconsistent declarations. */
35131 {
35133 /* Skip over the declarations that match either the definition
35134 if one was provided or the first declaration. */
35140 /* Set the function declaration to print in diagnostic context. */
35145 /* Suggest how to avoid the warning for each instance since
35146 the guidance may be different depending on context. */
35148 (key_redundant_p
35151 xpectkstr);
35152 }
35154 /* Restore the current function in case it was replaced above. */
35156 }
35158 /* Issues -Wmismatched-tags for all classes. Called at the end
35159 of processing a translation unit, after declarations of all class
35160 types and their uses have been recorded. */
35162 void
35164 {
35165 /* CLASS2LOC should be empty if both -Wmismatched-tags and
35166 -Wredundant-tags are disabled. */
35168 || warn_redundant_tags
35171 /* Save the current function before changing on return. It should
35172 be null at this point. */
35176 {
35177 /* Iterate over the collected class/struct/template declarations. */
35180 {
35184 }
35185 }
35188 }
35190 /* Issue an error message if DECL is redeclared with different
35191 access than its original declaration [class.access.spec/3].
35192 This applies to nested classes, nested class templates and
35193 enumerations [class.mem/1]. */
35195 static void
35197 {
35208 }
35210 /* Look for the `template' keyword, as a syntactic disambiguator.
35211 Return TRUE iff it is present, in which case it will be
35212 consumed. */
35214 static bool
35216 {
35218 {
35219 /* In C++98 the `template' keyword can only be used within templates;
35220 outside templates the parser can always figure out what is a
35221 template and what is not. In C++11, per the resolution of DR 468,
35222 `template' is allowed in cases where it is not strictly necessary. */
35225 {
35228 "in C++98 %<template%> (as a disambiguator) is only "
35230 /* If this part of the token stream is rescanned, the same
35231 error message would be generated. So, we purge the token
35232 from the stream. */
35235 }
35236 else
35237 {
35238 /* Consume the `template' keyword. */
35241 }
35242 }
35244 }
35246 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
35247 set PARSER->SCOPE, and perform other related actions. */
35249 static void
35251 {
35254 /* Get the stored value. */
35256 /* Set the scope from the stored value. */
35261 }
35263 /* Consume tokens up through a non-nested END token. Returns TRUE if we
35264 encounter the end of a block before what we were looking for. */
35266 static bool
35270 {
35272 {
35275 /* Abort a parenthesized expression if we encounter a semicolon. */
35279 /* If we've reached the end of the file, stop. */
35285 /* We've hit the end of an enclosing block, so there's been some
35286 kind of syntax error. */
35289 /* Consume the token. */
35291 /* See if it starts a new group. */
35293 {
35295 /* In theory this should probably check end == '}', but
35296 cp_parser_save_member_function_body needs it to exit
35297 after either '}' or ')' when called with ')'. */
35300 }
35302 {
35306 }
35311 }
35312 }
35314 /* Like above, for caching a default argument or NSDMI. Both of these are
35315 terminated by a non-nested comma, but it can be unclear whether or not a
35316 comma is nested in a template argument list unless we do more parsing.
35317 In order to handle this ambiguity, when we encounter a ',' after a '<'
35318 we try to parse what follows as a parameter-declaration-list (in the
35319 case of a default argument) or a member-declarator (in the case of an
35320 NSDMI). If that succeeds, then we stop caching. */
35322 static tree
35324 {
35329 tree default_argument;
35331 /* Add tokens until we have processed the entire default
35332 argument. We add the range [first_token, token). */
35335 {
35336 /* For list-initialization, this is straightforward. */
35339 }
35341 {
35344 /* Peek at the next token. */
35346 /* What we do depends on what token we have. */
35348 {
35349 /* In valid code, a default argument must be
35350 immediately followed by a `,' `)', or `...'. */
35353 {
35354 /* If we've seen a '<', we might be in a
35355 template-argument-list. Until Core issue 325 is
35356 resolved, we don't know how this situation ought
35357 to be handled, so try to DTRT. We check whether
35358 what comes after the comma is a valid parameter
35359 declaration list. If it is, then the comma ends
35360 the default argument; otherwise the default
35361 argument continues. */
35365 /* Set ITALP so cp_parser_parameter_declaration_list
35366 doesn't decide to commit to this parse. */
35373 {
35374 /* Parse declarators until we reach a non-comma or
35375 somthing that cannot be an initializer.
35376 Just checking whether we're looking at a single
35377 declarator is insufficient. Consider:
35378 int var = tuple<T,U>::x;
35379 The template parameter 'U' looks exactly like a
35380 declarator. */
35381 do
35382 {
35386 CP_PARSER_FLAGS_NONE,
35395 }
35397 /* If we met an '=' or ';' then the original comma
35398 was the end of the NSDMI. Otherwise assume
35399 we're still in the NSDMI. */
35402 }
35403 else
35404 {
35407 tree t = cp_parser_parameter_declaration_list
35413 }
35420 }
35421 /* FALLTHRU */
35424 /* If we run into a non-nested `;', `}', or `]',
35425 then the code is invalid -- but the default
35426 argument is certainly over. */
35431 /* Handle correctly int n = sizeof ... ( p ); */
35434 /* Update DEPTH, if necessary. */
35449 /* This might be the comparison operator, or it might
35450 start a template argument list. */
35457 /* Fall through for C++0x, which treats the `>>'
35458 operator like two `>' tokens in certain
35459 cases. */
35464 {
35465 /* This might be an operator, or it might close a
35466 template argument list. But if a previous '<'
35467 started a template argument list, this will have
35468 closed it, so we can't be in one anymore. */
35472 }
35475 /* If we run out of tokens, issue an error message. */
35483 /* In these cases, we should look for template-ids.
35484 For example, if the default argument is
35485 `X<int, double>()', we need to do name lookup to
35486 figure out whether or not `X' is a template; if
35487 so, the `,' does not end the default argument.
35489 That is not yet done. */
35494 }
35496 /* If we've reached the end, stop. */
35500 /* Add the token to the token block. */
35502 }
35504 /* Create a DEFERRED_PARSE to represent the unparsed default
35505 argument. */
35512 }
35514 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
35516 location_t
35518 {
35523 }
35525 /* Begin parsing tentatively. We always save tokens while parsing
35526 tentatively so that if the tentative parsing fails we can restore the
35527 tokens. */
35529 static void
35531 {
35532 /* Enter a new parsing context. */
35534 /* Begin saving tokens. */
35536 /* In order to avoid repetitive access control error messages,
35537 access checks are queued up until we are no longer parsing
35538 tentatively. */
35540 }
35542 /* Commit to the currently active tentative parse. */
35544 static void
35546 {
35550 /* Mark all of the levels as committed. */
35553 {
35560 }
35561 }
35563 /* Commit to the topmost currently active tentative parse.
35565 Note that this function shouldn't be called when there are
35566 irreversible side-effects while in a tentative state. For
35567 example, we shouldn't create a permanent entry in the symbol
35568 table, or issue an error message that might not apply if the
35569 tentative parse is aborted. */
35571 static void
35573 {
35578 {
35586 }
35587 }
35589 /* Abort the currently active tentative parse. All consumed tokens
35590 will be rolled back, and no diagnostics will be issued. */
35592 static void
35594 {
35598 /* Now, pretend that we want to see if the construct was
35599 successfully parsed. */
35601 }
35603 /* Stop parsing tentatively. If a parse error has occurred, restore the
35604 token stream. Otherwise, commit to the tokens we have consumed.
35605 Returns true if no error occurred; false otherwise. */
35607 static bool
35609 {
35613 /* Remember whether or not an error occurred, since we are about to
35614 destroy that information. */
35616 /* Remove the topmost context from the stack. */
35619 /* If no parse errors occurred, commit to the tentative parse. */
35621 {
35622 /* Commit to the tokens read tentatively, unless that was
35623 already done. */
35628 }
35629 /* Otherwise, if errors occurred, roll back our state so that things
35630 are just as they were before we began the tentative parse. */
35631 else
35632 {
35635 }
35636 /* Add the context to the front of the free list. */
35641 }
35643 /* Returns true if we are parsing tentatively and are not committed to
35644 this tentative parse. */
35646 static bool
35648 {
35651 }
35653 /* Returns nonzero iff an error has occurred during the most recent
35654 tentative parse. */
35656 static bool
35658 {
35661 }
35663 /* Returns nonzero if GNU extensions are allowed. */
35665 static bool
35667 {
35669 }
35670 \f
35671 /* Objective-C++ Productions */
35674 /* Parse an Objective-C expression, which feeds into a primary-expression
35675 above.
35677 objc-expression:
35678 objc-message-expression
35679 objc-string-literal
35680 objc-encode-expression
35681 objc-protocol-expression
35682 objc-selector-expression
35684 Returns a tree representation of the expression. */
35686 static cp_expr
35688 {
35689 /* Try to figure out what kind of declaration is present. */
35693 {
35703 {
35715 }
35716 /* FALLTHRU */
35722 }
35725 }
35727 /* Parse an Objective-C message expression.
35729 objc-message-expression:
35730 [ objc-message-receiver objc-message-args ]
35732 Returns a representation of an Objective-C message. */
35734 static tree
35736 {
35749 /* Construct a location e.g.
35750 [self func1:5]
35751 ^~~~~~~~~~~~~~
35752 ranging from the '[' to the ']', with the caret at the start. */
35758 }
35760 /* Parse an objc-message-receiver.
35762 objc-message-receiver:
35763 expression
35764 simple-type-specifier
35766 Returns a representation of the type or expression. */
35768 static tree
35770 {
35771 tree rcv;
35773 /* An Objective-C message receiver may be either (1) a type
35774 or (2) an expression. */
35778 /* If that worked out, fine. */
35785 CP_PARSER_FLAGS_NONE);
35792 }
35794 /* Parse the arguments and selectors comprising an Objective-C message.
35796 objc-message-args:
35797 objc-selector
35798 objc-selector-args
35799 objc-selector-args , objc-comma-args
35801 objc-selector-args:
35802 objc-selector [opt] : assignment-expression
35803 objc-selector-args objc-selector [opt] : assignment-expression
35805 objc-comma-args:
35806 assignment-expression
35807 objc-comma-args , assignment-expression
35809 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
35810 selector arguments and TREE_VALUE containing a list of comma
35811 arguments. */
35813 static tree
35815 {
35821 {
35827 /* Detect if we have a unary selector. */
35836 sel_args
35841 }
35843 /* Handle non-selector arguments, if any. */
35845 {
35846 tree arg;
35851 addl_args
35856 }
35859 {
35862 }
35865 }
35867 /* Parse an Objective-C encode expression.
35869 objc-encode-expression:
35870 @encode objc-typename
35872 Returns an encoded representation of the type argument. */
35874 static cp_expr
35876 {
35877 tree type;
35882 matching_parens parens;
35889 {
35893 }
35895 /* This happens if we find @encode(T) (where T is a template
35896 typename or something dependent on a template typename) when
35897 parsing a template. In that case, we can't compile it
35898 immediately, but we rather create an AT_ENCODE_EXPR which will
35899 need to be instantiated when the template is used.
35900 */
35902 {
35906 }
35909 /* Build a location of the form:
35910 @encode(int)
35911 ^~~~~~~~~~~~
35912 with caret==start at the @ token, finishing at the close paren. */
35916 }
35918 /* Parse an Objective-C @defs expression. */
35920 static tree
35922 {
35923 tree name;
35926 matching_parens parens;
35932 }
35934 /* Parse an Objective-C protocol expression.
35936 objc-protocol-expression:
35937 @protocol ( identifier )
35939 Returns a representation of the protocol expression. */
35941 static tree
35943 {
35944 tree proto;
35948 matching_parens parens;
35953 /* Build a location of the form:
35954 @protocol(prot)
35955 ^~~~~~~~~~~~~~~
35956 with caret==start at the @ token, finishing at the close paren. */
35961 }
35963 /* Parse an Objective-C selector expression.
35965 objc-selector-expression:
35966 @selector ( objc-method-signature )
35968 objc-method-signature:
35969 objc-selector
35970 objc-selector-seq
35972 objc-selector-seq:
35973 objc-selector :
35974 objc-selector-seq objc-selector :
35976 Returns a representation of the method selector. */
35978 static tree
35980 {
35987 matching_parens parens;
35993 {
36002 {
36003 /* Detect if we have a unary selector. */
36005 {
36008 }
36009 else
36010 {
36012 }
36013 }
36018 {
36019 sel_seq
36022 sel_seq
36025 }
36026 else
36027 sel_seq
36032 }
36034 finish_selector:
36038 /* Build a location of the form:
36039 @selector(func)
36040 ^~~~~~~~~~~~~~~
36041 with caret==start at the @ token, finishing at the close paren. */
36044 /* TODO: objc_build_selector_expr doesn't always honor the location. */
36047 }
36049 /* Parse a list of identifiers.
36051 objc-identifier-list:
36052 identifier
36053 objc-identifier-list , identifier
36055 Returns a TREE_LIST of identifier nodes. */
36057 static tree
36059 {
36060 tree identifier;
36061 tree list;
36072 {
36079 identifier));
36081 }
36084 }
36086 /* Parse an Objective-C alias declaration.
36088 objc-alias-declaration:
36089 @compatibility_alias identifier identifier ;
36091 This function registers the alias mapping with the Objective-C front end.
36092 It returns nothing. */
36094 static void
36096 {
36104 }
36106 /* Parse an Objective-C class forward-declaration.
36108 objc-class-declaration:
36109 @class objc-identifier-list ;
36111 The function registers the forward declarations with the Objective-C
36112 front end. It returns nothing. */
36114 static void
36116 {
36119 {
36120 tree id;
36130 else
36132 }
36134 }
36136 /* Parse a list of Objective-C protocol references.
36138 objc-protocol-refs-opt:
36139 objc-protocol-refs [opt]
36141 objc-protocol-refs:
36142 < objc-identifier-list >
36144 Returns a TREE_LIST of identifiers, if any. */
36146 static tree
36148 {
36152 {
36156 }
36159 }
36161 /* Parse a Objective-C visibility specification. */
36163 static void
36165 {
36169 {
36184 }
36186 /* Eat '@private'/'@protected'/'@public'. */
36188 }
36190 /* Parse an Objective-C method type. Return 'true' if it is a class
36191 (+) method, and 'false' if it is an instance (-) method. */
36195 {
36198 else
36200 }
36202 /* Parse an Objective-C protocol qualifier. */
36204 static tree
36206 {
36219 {
36224 }
36227 }
36229 /* Parse an Objective-C typename. */
36231 static tree
36233 {
36237 {
36240 matching_parens parens;
36244 /* An ObjC type name may consist of just protocol qualifiers, in which
36245 case the type shall default to 'id'. */
36247 {
36250 /* If the type could not be parsed, an error has already
36251 been produced. For error recovery, behave as if it had
36252 not been specified, which will use the default type
36253 'id'. */
36255 {
36257 /* We need to skip to the closing parenthesis as
36258 cp_parser_type_id() does not seem to do it for
36259 us. */
36264 }
36265 }
36269 }
36272 }
36274 /* Check to see if TYPE refers to an Objective-C selector name. */
36276 static bool
36278 {
36284 }
36286 /* Parse an Objective-C selector. */
36288 static tree
36290 {
36294 {
36297 }
36299 /* C++ operator names are allowed to appear in ObjC selectors. */
36301 {
36314 }
36315 }
36317 /* Parse an Objective-C params list. */
36319 static tree
36321 {
36327 {
36337 /* Detect if we have a unary selector. */
36340 {
36343 }
36347 {
36348 /* Something went quite wrong. There should be a colon
36349 here, but there is not. Stop parsing parameters. */
36351 }
36353 /* New ObjC allows attributes on parameters too. */
36358 params
36361 type_name,
36362 identifier,
36363 parm_attr));
36366 }
36369 {
36372 }
36374 /* We allow tail attributes for the method. */
36376 {
36384 }
36387 {
36390 }
36392 }
36394 /* Parse the non-keyword Objective-C params. */
36396 static tree
36399 {
36405 {
36407 tree parm;
36413 {
36418 }
36420 /* TODO: parse attributes for tail parameters. */
36430 }
36432 /* We allow tail attributes for the method. */
36434 {
36436 {
36441 }
36442 else
36443 /* We have an error, but parse the attributes, so that we can
36444 carry on. */
36450 }
36453 }
36455 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
36457 static void
36459 {
36462 /* If the next token is `extern' and the following token is a string
36463 literal, then we have a linkage specification. */
36465 && cp_parser_is_pure_string_literal
36468 /* Handle #pragma, if any. */
36471 /* Allow stray semicolons. */
36474 /* Mark methods as optional or required, when building protocols. */
36476 {
36479 }
36481 {
36484 }
36487 /* Other stray characters must generate errors. */
36489 {
36493 }
36494 /* Finally, try to parse a block-declaration, or a function-definition. */
36495 else
36497 }
36499 /* Parse a method signature. */
36501 static tree
36503 {
36519 }
36521 static bool
36523 {
36524 tree tattr;
36529 /* If the attributes are followed by a method introducer, this is not allowed.
36530 Dump the attributes and flag the situation. */
36535 /* Otherwise, the attributes introduce some interstitial code, possibly so
36536 rewind to allow that check. */
36539 }
36541 /* Parse an Objective-C method prototype list. */
36543 static void
36545 {
36549 {
36551 {
36556 else
36560 {
36564 }
36567 }
36573 OPT_Wattributes,
36575 else
36576 /* Allow for interspersed non-ObjC++ code. */
36580 }
36584 else
36588 }
36590 /* Parse an Objective-C method definition list. */
36592 static void
36594 {
36596 {
36600 {
36603 }
36605 {
36608 }
36610 {
36614 tree attribute;
36618 else
36619 {
36623 /* For historical reasons, we accept an optional semicolon. */
36629 tree meth
36633 }
36634 }
36635 /* The following case will be removed once @synthesize is
36636 completely implemented. */
36647 else
36648 /* Allow for interspersed non-ObjC++ code. */
36650 }
36653 }
36655 /* Parse Objective-C ivars. */
36657 static void
36659 {
36670 {
36671 cp_decl_specifier_seq declspecs;
36673 tree prefix_attributes;
36681 CP_PARSER_FLAGS_OPTIONAL,
36685 /* auto, register, static, extern, mutable. */
36687 {
36690 }
36692 /* thread_local. */
36694 {
36697 }
36699 /* typedef. */
36701 {
36704 }
36709 /* Keep going until we hit the `;' at the end of the
36710 declaration. */
36712 {
36717 /* Check for a (possibly unnamed) bitfield declaration. */
36725 {
36726 /* Get the name of the bitfield. */
36731 eat_colon:
36733 /* Get the width of the bitfield. */
36734 width
36736 }
36737 else
36738 {
36739 /* Parse the declarator. */
36740 declarator
36742 CP_PARSER_FLAGS_NONE,
36748 }
36750 /* Look for attributes that apply to the ivar. */
36752 /* Remember which attributes are prefix attributes and
36753 which are not. */
36755 /* Combine the attributes. */
36759 /* Create the bitfield declaration. */
36762 else
36767 /* Add the instance variable. */
36771 /* Reset PREFIX_ATTRIBUTES. */
36773 {
36778 }
36783 {
36786 }
36788 }
36792 }
36797 /* Do not consume the RID_AT_END, so it will be read again as terminating
36798 the @interface of @implementation. */
36802 /* For historical reasons, we accept an optional semicolon. */
36805 }
36807 /* Parse an Objective-C protocol declaration. */
36809 static void
36811 {
36817 {
36822 }
36824 /* See if we have a forward declaration or a definition. */
36827 /* Try a forward declaration first. */
36829 {
36831 {
36832 tree id;
36842 else
36844 }
36846 }
36848 /* Ok, we got a full-fledged definition (or at least should). */
36849 else
36850 {
36855 }
36856 }
36858 /* Parse an Objective-C superclass or category. */
36860 static void
36865 {
36871 {
36874 }
36876 {
36877 matching_parens parens;
36880 /* If there is no category name, and this is an @interface, we
36881 have a class extension. */
36883 {
36886 }
36887 else
36891 }
36892 }
36894 /* Parse an Objective-C class interface. */
36896 static void
36898 {
36906 {
36907 /* It's hard to recover because even if valid @interface stuff
36908 is to follow, we can't compile it (or validate it) if we
36909 don't even know which class it refers to. Let's assume this
36910 was a stray '@interface' token in the stream and skip it.
36911 */
36913 }
36918 /* We have either a class or a category on our hands. */
36921 else
36922 {
36924 /* Handle instance variable declarations, if any. */
36927 }
36930 }
36932 /* Parse an Objective-C class implementation. */
36934 static void
36936 {
36943 {
36944 /* It's hard to recover because even if valid @implementation
36945 stuff is to follow, we can't compile it (or validate it) if
36946 we don't even know which class it refers to. Let's assume
36947 this was a stray '@implementation' token in the stream and
36948 skip it.
36949 */
36951 }
36955 /* We have either a class or a category on our hands. */
36958 else
36959 {
36961 /* Handle instance variable declarations, if any. */
36964 }
36967 }
36969 /* Consume the @end token and finish off the implementation. */
36971 static void
36973 {
36976 }
36978 /* Parse an Objective-C declaration. */
36980 static void
36982 {
36983 /* Try to figure out what kind of declaration is present. */
36988 {
37004 }
37007 {
37030 }
37031 }
37033 /* Parse an Objective-C try-catch-finally statement.
37035 objc-try-catch-finally-stmt:
37036 @try compound-statement objc-catch-clause-seq [opt]
37037 objc-finally-clause [opt]
37039 objc-catch-clause-seq:
37040 objc-catch-clause objc-catch-clause-seq [opt]
37042 objc-catch-clause:
37043 @catch ( objc-exception-declaration ) compound-statement
37045 objc-finally-clause:
37046 @finally compound-statement
37048 objc-exception-declaration:
37049 parameter-declaration
37050 '...'
37052 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
37054 Returns NULL_TREE.
37056 PS: This function is identical to c_parser_objc_try_catch_finally_statement
37057 for C. Keep them in sync. */
37059 static tree
37061 {
37062 location_t location;
37063 tree stmt;
37068 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
37069 node, lest it get absorbed into the surrounding block. */
37075 {
37079 matching_parens parens;
37085 {
37086 /* We have "@catch (...)" (where the '...' are literally
37087 what is in the code). Skip the '...'.
37088 parameter_declaration is set to NULL_TREE, and
37089 objc_being_catch_clauses() knows that that means
37090 '...'. */
37093 }
37094 else
37095 {
37096 /* We have "@catch (NSException *exception)" or something
37097 like that. Parse the parameter declaration. */
37102 else
37107 }
37110 else
37111 {
37112 /* If there was no open parenthesis, we are recovering from
37113 an error, and we are trying to figure out what mistake
37114 the user has made. */
37116 /* If there is an immediate closing parenthesis, the user
37117 probably forgot the opening one (ie, they typed "@catch
37118 NSException *e)". Parse the closing parenthesis and keep
37119 going. */
37123 /* If these is no immediate closing parenthesis, the user
37124 probably doesn't know that parenthesis are required at
37125 all (ie, they typed "@catch NSException *e"). So, just
37126 forget about the closing parenthesis and keep going. */
37127 }
37131 }
37133 {
37136 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
37137 node, lest it get absorbed into the surrounding block. */
37141 }
37144 }
37146 /* Parse an Objective-C synchronized statement.
37148 objc-synchronized-stmt:
37149 @synchronized ( expression ) compound-statement
37151 Returns NULL_TREE. */
37153 static tree
37155 {
37156 location_t location;
37163 matching_parens parens;
37168 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
37169 node, lest it get absorbed into the surrounding block. */
37174 }
37176 /* Parse an Objective-C throw statement.
37178 objc-throw-stmt:
37179 @throw assignment-expression [opt] ;
37181 Returns a constructed '@throw' statement. */
37183 static tree
37185 {
37197 }
37199 /* Parse an Objective-C statement. */
37201 static tree
37203 {
37204 /* Try to figure out what kind of declaration is present. */
37208 {
37219 }
37222 }
37224 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
37225 look ahead to see if an objc keyword follows the attributes. This
37226 is to detect the use of prefix attributes on ObjC @interface and
37227 @protocol. */
37229 static bool
37231 {
37236 {
37240 else
37243 }
37246 }
37248 /* This routine is a minimal replacement for
37249 c_parser_struct_declaration () used when parsing the list of
37250 types/names or ObjC++ properties. For example, when parsing the
37251 code
37253 @property (readonly) int a, b, c;
37255 this function is responsible for parsing "int a, int b, int c" and
37256 returning the declarations as CHAIN of DECLs.
37258 TODO: Share this code with cp_parser_objc_class_ivars. It's very
37259 similar parsing. */
37260 static tree
37262 {
37264 cp_decl_specifier_seq declspecs;
37266 tree prefix_attributes;
37269 CP_PARSER_FLAGS_NONE,
37276 /* auto, register, static, extern, mutable. */
37278 {
37281 }
37283 /* thread_local. */
37285 {
37288 }
37290 /* typedef. */
37292 {
37295 }
37300 /* Keep going until we hit the `;' at the end of the declaration. */
37302 {
37307 /* Parse the declarator. */
37309 CP_PARSER_FLAGS_NONE,
37312 /* Look for attributes that apply to the ivar. */
37314 /* Remember which attributes are prefix attributes and
37315 which are not. */
37317 /* Combine the attributes. */
37327 /* Reset PREFIX_ATTRIBUTES. */
37329 {
37334 }
37341 {
37344 }
37345 else
37347 }
37349 }
37351 /* Parse an Objective-C @property declaration. The syntax is:
37353 objc-property-declaration:
37354 '@property' objc-property-attributes[opt] struct-declaration ;
37356 objc-property-attributes:
37357 '(' objc-property-attribute-list ')'
37359 objc-property-attribute-list:
37360 objc-property-attribute
37361 objc-property-attribute-list, objc-property-attribute
37363 objc-property-attribute
37364 'getter' = identifier
37365 'setter' = identifier
37366 'readonly'
37367 'readwrite'
37368 'assign'
37369 'retain'
37370 'copy'
37371 'nonatomic'
37373 For example:
37374 @property NSString *name;
37375 @property (readonly) id object;
37376 @property (retain, nonatomic, getter=getTheName) id name;
37377 @property int a, b, c;
37379 PS: This function is identical to
37380 c_parser_objc_at_property_declaration for C. Keep them in sync. */
37381 static void
37383 {
37384 /* Parse the optional attribute list.
37386 A list of parsed, but not verified, attributes. */
37392 /* Parse the optional attribute list... */
37394 {
37395 /* Eat the '('. */
37396 matching_parens parens;
37401 /* Allow empty @property attribute lists, but with a warning. */
37403 location_t attr_comb;
37405 {
37409 }
37410 else
37412 {
37419 {
37426 }
37437 /* Account for accepting the 'class' keyword in this context. */
37439 else
37443 enum objc_property_attribute_kind prop_kind
37445 property_attribute_info *prop
37449 tree meth_name;
37451 {
37456 attr_name);
37457 else
37465 {
37468 attr_name);
37471 }
37479 {
37482 attr_name);
37485 }
37487 /* Get the end of the method name, and consume the name. */
37490 /* Because method names may contain C++ keywords, we have a
37491 routine to fetch them (this also consumes the token). */
37495 {
37497 {
37499 attr_end);
37503 }
37504 else
37505 {
37509 }
37511 attr_end);
37512 }
37513 else
37515 attr_end);
37517 /* Updated location including all that was successfully
37518 parsed. */
37521 }
37523 /* If we see a comma here, then keep going - even if we already
37524 saw a syntax error. For simple mistakes e.g. (asign, getter=x)
37525 this makes a more useful output and avoid spurious warnings
37526 about missing attributes that are, in fact, specified after the
37527 one with the syntax error. */
37530 else
37532 }
37538 }
37540 /* 'properties' is the list of properties that we read. Usually a
37541 single one, but maybe more (eg, in "@property int a, b, c;" there
37542 are three).
37543 TODO: Update this parsing so that it accepts (erroneous) bitfields so
37544 that we can issue a meaningful and consistent (between C/C++) error
37545 message from objc_add_property_declaration (). */
37552 else
37553 {
37554 /* Comma-separated properties are chained together in reverse order;
37555 add them one by one. */
37559 prop_attr_list);
37560 }
37563 }
37565 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
37567 objc-synthesize-declaration:
37568 @synthesize objc-synthesize-identifier-list ;
37570 objc-synthesize-identifier-list:
37571 objc-synthesize-identifier
37572 objc-synthesize-identifier-list, objc-synthesize-identifier
37574 objc-synthesize-identifier
37575 identifier
37576 identifier = identifier
37578 For example:
37579 @synthesize MyProperty;
37580 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
37582 PS: This function is identical to c_parser_objc_at_synthesize_declaration
37583 for C. Keep them in sync.
37584 */
37585 static void
37587 {
37589 location_t loc;
37594 {
37598 {
37601 }
37603 {
37607 {
37610 }
37611 }
37612 else
37617 else
37619 }
37622 }
37624 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
37626 objc-dynamic-declaration:
37627 @dynamic identifier-list ;
37629 For example:
37630 @dynamic MyProperty;
37631 @dynamic MyProperty, AnotherProperty;
37633 PS: This function is identical to c_parser_objc_at_dynamic_declaration
37634 for C. Keep them in sync.
37635 */
37636 static void
37638 {
37640 location_t loc;
37645 {
37646 tree property;
37649 {
37652 }
37656 else
37658 }
37661 }
37663 \f
37664 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
37666 /* Returns name of the next clause.
37667 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
37668 the token is not consumed. Otherwise appropriate pragma_omp_clause is
37669 returned and the token is consumed. */
37671 static pragma_omp_clause
37673 {
37689 {
37694 {
37915 }
37916 }
37922 }
37924 /* Validate that a clause of the given type does not already exist. */
37926 static void
37929 {
37932 }
37934 /* OpenMP 2.5:
37935 variable-list:
37936 identifier
37937 variable-list , identifier
37939 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
37940 colon). An opening parenthesis will have been consumed by the caller.
37942 If KIND is nonzero, create the appropriate node and install the decl
37943 in OMP_CLAUSE_DECL and add the node to the head of the list.
37945 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
37946 return the list created.
37948 COLON can be NULL if only closing parenthesis should end the list,
37949 or pointer to bool which will receive false if the list is terminated
37950 by closing parenthesis or true if the list is terminated by colon.
37952 The optional ALLOW_DEREF argument is true if list items can use the deref
37953 (->) operator. */
37955 struct omp_dim
37956 {
37958 location_t loc;
37962 };
37964 static tree
37968 {
37974 {
37977 }
37979 {
37984 /* This condition doesn't include OMP_CLAUSE_DEPEND or
37985 OMP_CLAUSE_AFFINITY since lvalue ("locator list") parsing for those is
37986 handled further down the function. */
37991 {
37997 /* This code rewrites a parsed expression containing various tree
37998 codes used to represent array accesses into a more uniform nest of
37999 OMP_ARRAY_SECTION nodes before it is processed by
38000 semantics.cc:handle_omp_array_sections_1. It might be more
38001 efficient to move this logic to that function instead, analysing
38002 the parsed expression directly rather than this preprocessed
38003 form. */
38006 {
38008 {
38013 }
38018 {
38023 {
38026 }
38028 {
38032 }
38034 {
38039 }
38040 }
38042 /* Bare references have their own special handling, so remove
38043 the explicit dereference added by convert_from_reference. */
38050 }
38052 {
38055 /* If we have "*foo" and
38056 - it's an indirection of a reference, "unconvert" it, i.e.
38057 strip the indirection (to just "foo").
38058 - it's an indirection of a pointer, turn it into
38059 "foo[0:1]". */
38065 integer_one_node);
38066 }
38068 {
38075 }
38081 }
38085 {
38091 }
38095 {
38096 cp_id_kind idk;
38099 }
38104 CPP_CLOSE_PAREN)))
38105 {
38108 }
38109 else
38110 {
38117 {
38122 }
38126 else
38129 {
38135 }
38136 }
38140 ;
38142 {
38144 {
38146 /* The OpenACC cache directive explicitly only allows "array
38147 elements or subarrays". */
38149 {
38153 }
38154 /* FALLTHROUGH. */
38158 start_component_ref:
38161 {
38162 cpp_ttype ttype
38165 location_t loc
38170 decl = (cp_parser_postfix_dot_deref_expression
38173 }
38174 /* FALLTHROUGH. */
38184 {
38192 {
38195 /* Later handling is not prepared to see through these. */
38197 }
38199 parser->colon_corrects_to_scope_p
38202 {
38205 }
38206 else
38207 {
38208 /* Look for `:'. */
38210 {
38215 }
38218 else
38221 CPP_CLOSE_SQUARE))
38222 {
38224 /* Later handling is not prepared to see through these. */
38226 }
38227 }
38228 /* Look for the closing `]'. */
38230 RT_CLOSE_SQUARE))
38231 {
38236 }
38239 }
38244 && !array_section_p
38247 {
38249 {
38253 }
38255 }
38256 else
38264 }
38267 {
38271 {
38272 depend_lvalue:
38276 }
38277 else
38279 }
38281 build_clause:
38286 }
38287 else
38290 get_comma:
38294 }
38300 {
38304 }
38307 {
38310 /* Try to resync to an unnested comma. Copied from
38311 cp_parser_parenthesized_expression_list. */
38312 skip_comma:
38321 }
38324 }
38326 /* Similarly, but expect leading and trailing parenthesis. This is a very
38327 common case for omp clauses. */
38329 static tree
38332 {
38334 {
38336 {
38342 }
38343 else
38345 list);
38346 }
38350 map_lvalue);
38352 }
38354 /* OpenACC 2.0:
38355 copy ( variable-list )
38356 copyin ( variable-list )
38357 copyout ( variable-list )
38358 create ( variable-list )
38359 delete ( variable-list )
38360 present ( variable-list )
38362 OpenACC 2.6:
38363 no_create ( variable-list )
38364 attach ( variable-list )
38365 detach ( variable-list ) */
38367 static tree
38369 tree list)
38370 {
38373 {
38411 /* "The 'host' clause is a synonym for the 'self' clause." */
38417 }
38425 }
38427 /* OpenACC 2.0:
38428 deviceptr ( variable-list ) */
38430 static tree
38432 {
38436 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
38437 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
38438 variable-list must only allow for pointer variables. */
38441 {
38448 }
38451 }
38453 /* OpenACC 2.5:
38454 auto
38455 finalize
38456 independent
38457 nohost
38458 seq */
38460 static tree
38462 tree list)
38463 {
38470 }
38472 /* OpenACC:
38473 num_gangs ( expression )
38474 num_workers ( expression )
38475 vector_length ( expression ) */
38477 static tree
38480 {
38483 matching_parens parens;
38491 {
38496 }
38504 }
38506 /* OpenACC:
38508 gang [( gang-arg-list )]
38509 worker [( [num:] int-expr )]
38510 vector [( [length:] int-expr )]
38512 where gang-arg is one of:
38514 [num:] int-expr
38515 static: size-expr
38517 and size-expr may be:
38519 *
38520 int-expr
38521 */
38523 static tree
38525 omp_clause_code kind,
38527 {
38536 {
38537 matching_parens parens;
38540 do
38541 {
38545 /* Gang static argument. */
38548 {
38556 {
38559 }
38561 /* Check for the '*' argument. */
38565 CPP_CLOSE_PAREN)))
38566 {
38571 {
38574 }
38576 }
38577 }
38578 /* Worker num: argument and vector length: arguments. */
38582 {
38585 }
38587 /* Now collect the actual argument. */
38589 {
38592 }
38604 {
38607 }
38609 }
38614 }
38628 cleanup_error:
38631 }
38633 /* OpenACC 2.0:
38634 tile ( size-expr-list ) */
38636 static tree
38638 {
38642 /* Collapse and tile are mutually exclusive. (The spec doesn't say
38643 so, but the spec authors never considered such a case and have
38644 differing opinions on what it might mean, including 'not
38645 allowed'.) */
38648 clause_loc);
38653 do
38654 {
38661 {
38664 }
38665 else
38669 }
38672 /* Consume the trailing ')'. */
38680 }
38682 /* OpenACC 2.0
38683 Parse wait clause or directive parameters. */
38685 static tree
38687 {
38697 {
38699 {
38702 }
38704 }
38711 {
38715 {
38718 else
38719 {
38726 }
38727 }
38728 }
38731 }
38733 /* OpenACC:
38734 wait [( int-expr-list )] */
38736 static tree
38738 {
38743 else
38744 {
38750 }
38753 }
38755 /* OpenMP 3.0:
38756 collapse ( constant-expression ) */
38758 static tree
38760 {
38762 location_t loc;
38763 HOST_WIDE_INT n;
38766 matching_parens parens;
38784 {
38787 }
38796 }
38798 /* OpenMP 2.5:
38799 default ( none | shared )
38801 OpenMP 5.1:
38802 default ( private | firstprivate )
38804 OpenACC:
38805 default ( none | present ) */
38807 static tree
38810 {
38812 tree c;
38814 matching_parens parens;
38818 {
38821 }
38823 {
38828 {
38855 }
38858 }
38859 else
38860 {
38861 invalid_kind:
38864 else
38867 }
38884 }
38886 /* OpenMP 3.1:
38887 final ( expression ) */
38889 static tree
38891 {
38894 matching_parens parens;
38913 }
38915 /* OpenMP 5.1:
38916 indirect [( expression )]
38917 */
38919 static tree
38921 location_t location)
38922 {
38923 tree t;
38926 {
38927 matching_parens parens;
38942 }
38943 else
38953 }
38955 /* OpenMP 2.5:
38956 if ( expression )
38958 OpenMP 4.5:
38959 if ( directive-name-modifier : expression )
38961 directive-name-modifier:
38962 parallel | task | taskloop | target data | target | target update
38963 | target enter data | target exit data
38965 OpenMP 5.0:
38966 directive-name-modifier:
38967 ... | simd | cancel */
38969 static tree
38972 {
38976 matching_parens parens;
38981 {
38997 {
39000 {
39013 else
39014 {
39015 location_t loc
39020 }
39023 {
39025 {
39030 }
39032 {
39033 location_t loc
39037 }
39038 }
39039 }
39040 }
39042 {
39044 {
39047 }
39048 else
39049 {
39051 {
39052 location_t loc
39055 }
39057 }
39058 }
39059 }
39071 {
39074 {
39077 {
39089 }
39091 p);
39093 }
39095 {
39098 else
39101 }
39104 {
39108 }
39109 }
39117 }
39119 /* OpenMP 3.1:
39120 mergeable */
39122 static tree
39125 {
39126 tree c;
39129 location);
39134 }
39136 /* OpenMP 2.5:
39137 nowait */
39139 static tree
39142 {
39143 tree c;
39150 }
39152 /* OpenMP 2.5:
39153 num_threads ( expression ) */
39155 static tree
39157 location_t location)
39158 {
39161 matching_parens parens;
39181 }
39183 /* OpenMP 4.5:
39184 num_tasks ( expression )
39186 OpenMP 5.1:
39187 num_tasks ( strict : expression ) */
39189 static tree
39191 location_t location)
39192 {
39195 matching_parens parens;
39202 {
39205 {
39209 }
39210 }
39229 }
39231 /* OpenMP 4.5:
39232 grainsize ( expression )
39234 OpenMP 5.1:
39235 grainsize ( strict : expression ) */
39237 static tree
39239 location_t location)
39240 {
39243 matching_parens parens;
39250 {
39253 {
39257 }
39258 }
39277 }
39279 /* OpenMP 4.5:
39280 priority ( expression ) */
39282 static tree
39284 location_t location)
39285 {
39288 matching_parens parens;
39308 }
39310 /* OpenMP 4.5:
39311 hint ( expression ) */
39313 static tree
39315 {
39318 matching_parens parens;
39325 {
39333 }
39346 }
39348 /* OpenMP 5.1:
39349 filter ( integer-expression ) */
39351 static tree
39353 {
39356 matching_parens parens;
39374 }
39376 /* OpenMP 4.5:
39377 defaultmap ( tofrom : scalar )
39379 OpenMP 5.0:
39380 defaultmap ( implicit-behavior [ : variable-category ] ) */
39382 static tree
39384 location_t location)
39385 {
39389 enum omp_clause_defaultmap_kind category
39392 matching_parens parens;
39399 {
39400 invalid_behavior:
39402 "%<tofrom%>, %<firstprivate%>, %<none%> "
39405 }
39406 else
39407 {
39410 }
39413 {
39417 else
39424 else
39433 else
39440 else
39447 else
39456 else
39462 }
39466 {
39471 {
39472 invalid_category:
39476 }
39481 {
39487 else
39494 else
39501 else
39507 }
39510 }
39523 {
39533 {
39551 }
39554 p);
39555 else
39559 }
39566 out_err:
39571 }
39573 /* OpenMP 5.0:
39574 order ( concurrent )
39576 OpenMP 5.1:
39577 order ( order-modifier : concurrent )
39579 order-modifier:
39580 reproducible
39581 unconstrained */
39583 static tree
39585 {
39591 matching_parens parens;
39597 {
39604 else
39605 {
39609 }
39612 }
39614 {
39617 }
39618 else
39619 {
39622 }
39624 {
39627 }
39639 out_err:
39644 }
39646 /* OpenMP 5.0:
39647 bind ( teams | parallel | thread ) */
39649 static tree
39651 location_t location)
39652 {
39653 tree c;
39657 matching_parens parens;
39662 {
39663 invalid:
39667 }
39668 else
39669 {
39672 }
39683 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
39689 out_err:
39694 }
39696 /* OpenMP 2.5:
39697 ordered
39699 OpenMP 4.5:
39700 ordered ( constant-expression ) */
39702 static tree
39705 {
39707 HOST_WIDE_INT n;
39713 {
39714 matching_parens parens;
39731 {
39733 "ordered argument needs positive constant integer "
39736 }
39737 }
39743 }
39745 /* OpenMP 2.5:
39746 reduction ( reduction-operator : variable-list )
39748 reduction-operator:
39749 One of: + * - & ^ | && ||
39751 OpenMP 3.1:
39753 reduction-operator:
39754 One of: + * - & ^ | && || min max
39756 OpenMP 4.0:
39758 reduction-operator:
39759 One of: + * - & ^ | && ||
39760 id-expression
39762 OpenMP 5.0:
39763 reduction ( reduction-modifier, reduction-operator : variable-list )
39764 in_reduction ( reduction-operator : variable-list )
39765 task_reduction ( reduction-operator : variable-list ) */
39767 static tree
39770 {
39780 {
39783 {
39786 }
39789 {
39797 {
39800 }
39801 }
39802 }
39805 {
39815 }
39819 else
39820 {
39831 {
39861 }
39862 else
39863 {
39865 resync_fail:
39870 }
39871 }
39877 NULL);
39879 {
39886 }
39889 }
39891 /* OpenMP 2.5:
39892 schedule ( schedule-kind )
39893 schedule ( schedule-kind , expression )
39895 schedule-kind:
39896 static | dynamic | guided | runtime | auto
39898 OpenMP 4.5:
39899 schedule ( schedule-modifier : schedule-kind )
39900 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
39902 schedule-modifier:
39903 simd
39904 monotonic
39905 nonmonotonic */
39907 static tree
39909 {
39913 matching_parens parens;
39921 {
39930 else
39936 {
39939 }
39940 else
39941 {
39944 }
39945 }
39950 {
39955 {
39976 }
39977 }
39982 else
39988 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
39990 {
39994 }
39997 {
40012 else
40017 }
40029 invalid_kind:
40031 resync_fail:
40036 }
40038 /* OpenMP 3.0:
40039 untied */
40041 static tree
40044 {
40045 tree c;
40052 }
40054 /* OpenMP 4.0:
40055 inbranch
40056 notinbranch */
40058 static tree
40061 {
40066 }
40068 /* OpenMP 4.0:
40069 parallel
40070 for
40071 sections
40072 taskgroup */
40074 static tree
40078 {
40082 }
40084 /* OpenMP 4.5:
40085 nogroup */
40087 static tree
40090 {
40095 }
40097 /* OpenMP 4.5:
40098 simd
40099 threads */
40101 static tree
40105 {
40110 }
40112 /* OpenMP 4.0:
40113 num_teams ( expression )
40115 OpenMP 5.1:
40116 num_teams ( expression : expression ) */
40118 static tree
40120 location_t location)
40121 {
40124 matching_parens parens;
40135 {
40139 }
40156 }
40158 /* OpenMP 4.0:
40159 thread_limit ( expression ) */
40161 static tree
40163 location_t location)
40164 {
40167 matching_parens parens;
40187 }
40189 /* OpenMP 4.0:
40190 aligned ( variable-list )
40191 aligned ( variable-list : constant-expression ) */
40193 static tree
40195 {
40199 matching_parens parens;
40207 {
40217 }
40223 }
40225 /* OpenMP 5.0:
40226 allocate ( variable-list )
40227 allocate ( expression : variable-list )
40229 OpenMP 5.1:
40230 allocate ( allocator-modifier : variable-list )
40231 allocate ( allocator-modifier , allocator-modifier : variable-list )
40233 allocator-modifier:
40234 allocator ( expression )
40235 align ( expression ) */
40237 static tree
40239 {
40243 matching_parens parens;
40253 {
40259 matching_parens parens2;
40263 {
40267 }
40268 else
40269 {
40273 }
40277 {
40280 }
40284 }
40285 else
40288 {
40294 }
40297 {
40304 }
40305 else
40306 {
40310 }
40317 {
40320 }
40323 }
40325 /* OpenMP 2.5:
40326 lastprivate ( variable-list )
40328 OpenMP 5.0:
40329 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
40331 static tree
40333 {
40341 {
40346 {
40350 }
40351 }
40360 }
40362 /* OpenMP 4.0:
40363 linear ( variable-list )
40364 linear ( variable-list : expression )
40366 OpenMP 4.5:
40367 linear ( modifier ( variable-list ) )
40368 linear ( modifier ( variable-list ) : expression )
40370 modifier:
40371 val
40372 ref
40373 uval
40375 OpenMP 5.2:
40376 linear ( variable-list : modifiers-list )
40378 modifiers:
40379 val
40380 ref
40381 uval
40382 step ( expression ) */
40384 static tree
40387 {
40393 matching_parens parens;
40398 {
40409 {
40412 }
40413 else
40415 }
40420 else
40421 {
40430 }
40433 {
40437 {
40447 {
40451 }
40455 CPP_CLOSE_PAREN)))
40457 }
40461 {
40463 {
40474 {
40480 }
40482 {
40483 location_t step_loc
40486 matching_parens parens2;
40488 {
40494 CPP_CLOSE_PAREN))
40495 {
40496 cp_token *token
40504 tok_loc);
40506 {
40509 }
40512 }
40518 }
40519 else
40521 }
40522 else
40525 {
40528 }
40530 }
40533 }
40537 {
40548 {
40551 }
40554 }
40565 }
40568 {
40572 }
40575 }
40577 /* OpenMP 4.0:
40578 safelen ( constant-expression ) */
40580 static tree
40582 location_t location)
40583 {
40586 matching_parens parens;
40605 }
40607 /* OpenMP 4.0:
40608 simdlen ( constant-expression ) */
40610 static tree
40612 location_t location)
40613 {
40616 matching_parens parens;
40635 }
40637 /* OpenMP 4.5:
40638 vec:
40639 identifier [+/- integer]
40640 vec , identifier [+/- integer]
40641 */
40643 static tree
40646 {
40650 {
40653 }
40656 {
40662 {
40665 {
40673 }
40674 }
40675 }
40678 {
40685 else
40686 {
40687 t = cp_parser_lookup_name_simple
40692 id_loc);
40693 }
40699 {
40702 }
40706 {
40709 }
40713 {
40716 }
40719 add_to_vector:
40721 {
40725 }
40732 }
40735 {
40742 }
40744 }
40746 /* OpenMP 5.0:
40747 detach ( event-handle ) */
40749 static tree
40751 {
40752 matching_parens parens;
40768 else
40769 {
40772 else
40777 }
40790 }
40792 /* OpenMP 5.0:
40793 iterators ( iterators-definition )
40795 iterators-definition:
40796 iterator-specifier
40797 iterator-specifier , iterators-definition
40799 iterator-specifier:
40800 identifier = range-specification
40801 iterator-type identifier = range-specification
40803 range-specification:
40804 begin : end
40805 begin : end : step */
40807 static tree
40809 {
40813 matching_parens parens;
40817 bool saved_colon_corrects_to_scope_p
40819 bool saved_colon_doesnt_start_class_def_p
40822 do
40823 {
40824 tree iter_type;
40828 else
40829 {
40832 parser->type_definition_forbidden_message
40838 }
40842 {
40845 }
40865 {
40868 }
40883 {
40886 }
40888 }
40892 parser->colon_doesnt_start_class_def_p
40902 }
40904 /* OpenMP 5.0:
40905 affinity ( [aff-modifier :] variable-list )
40906 aff-modifier:
40907 iterator ( iterators-definition ) */
40909 static tree
40911 {
40914 matching_parens parens;
40919 {
40924 CPP_OPEN_PAREN)));
40926 {
40929 }
40931 {
40935 {
40943 }
40944 }
40945 }
40949 {
40952 {
40957 }
40958 }
40960 }
40962 /* OpenMP 4.0:
40963 depend ( depend-kind : variable-list )
40965 depend-kind:
40966 in | out | inout
40968 OpenMP 4.5:
40969 depend ( source )
40971 depend ( sink : vec )
40973 OpenMP 5.0:
40974 depend ( depend-modifier , depend-kind: variable-list )
40976 depend-kind:
40977 in | out | inout | mutexinoutset | depobj
40979 depend-modifier:
40980 iterator ( iterators-definition ) */
40982 static tree
40984 {
40989 matching_parens parens;
40993 do
40994 {
41002 {
41007 }
41024 else
41027 }
41035 {
41040 }
41043 {
41054 }
41060 {
41066 }
41067 else
41068 {
41073 {
41077 else
41079 }
41082 {
41087 }
41088 }
41091 invalid_kind:
41093 resync_fail:
41100 }
41102 /* OpenMP 5.2:
41103 doacross ( source : )
41104 doacross ( source : omp_cur_iteration )
41106 doacross ( sink : vec )
41107 doacross ( sink : omp_cur_iteration - logical_iteration ) */
41109 static tree
41111 {
41112 tree nlist;
41115 matching_parens parens;
41120 {
41121 invalid_kind:
41123 resync_fail:
41128 }
41137 else
41146 {
41148 {
41153 }
41158 }
41159 else
41167 }
41169 /* OpenMP 4.0:
41170 from ( variable-list )
41171 to ( variable-list )
41173 OpenMP 5.1:
41174 from ( [present :] variable-list )
41175 to ( [present :] variable-list ) */
41177 static tree
41179 tree list)
41180 {
41190 {
41194 }
41202 }
41204 /* OpenMP 4.0:
41205 map ( map-kind : variable-list )
41206 map ( variable-list )
41208 map-kind:
41209 alloc | to | from | tofrom
41211 OpenMP 4.5:
41212 map-kind:
41213 alloc | to | from | tofrom | release | delete
41215 map ( always [,] map-kind: variable-list )
41217 OpenMP 5.0:
41218 map ( [map-type-modifier[,] ...] map-kind: variable-list )
41220 map-type-modifier:
41221 always | close */
41223 static tree
41225 {
41236 {
41238 {
41241 }
41244 pos++;
41245 pos++;
41246 }
41252 {
41255 {
41258 }
41262 {
41264 {
41271 }
41273 }
41275 {
41277 {
41284 }
41286 }
41288 {
41290 {
41297 }
41299 }
41300 else
41301 {
41309 }
41312 }
41316 {
41340 else
41341 {
41347 }
41350 }
41353 {
41357 }
41359 /* We introduce a scope here so that errors parsing e.g. "always", "close"
41360 tokens do not propagate to later directives that might use them
41361 legally. */
41371 }
41373 /* OpenMP 4.0:
41374 device ( expression )
41376 OpenMP 5.0:
41377 device ( [device-modifier :] integer-expression )
41379 device-modifier:
41380 ancestor | device_num */
41382 static tree
41384 location_t location)
41385 {
41389 matching_parens parens;
41395 {
41399 {
41402 /* A requires directive with the reverse_offload clause must be
41403 specified. */
41405 {
41407 "preceded by %<requires%> directive "
41411 }
41412 }
41414 ;
41415 else
41416 {
41420 }
41423 }
41442 }
41444 /* OpenMP 4.0:
41445 dist_schedule ( static )
41446 dist_schedule ( static , expression ) */
41448 static tree
41450 location_t location)
41451 {
41454 matching_parens parens;
41465 {
41476 }
41480 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
41481 "dist_schedule", location); */
41487 invalid_kind:
41489 resync_fail:
41494 }
41496 /* OpenMP 4.0:
41497 proc_bind ( proc-bind-kind )
41499 proc-bind-kind:
41500 primary | master | close | spread
41501 where OpenMP 5.1 added 'primary' and deprecated the alias 'master'. */
41503 static tree
41505 location_t location)
41506 {
41507 tree c;
41514 {
41526 else
41528 }
41529 else
41538 location);
41543 invalid_kind:
41545 resync_fail:
41550 }
41552 /* OpenMP 5.0:
41553 device_type ( host | nohost | any ) */
41555 static tree
41557 location_t location)
41558 {
41559 tree c;
41566 {
41576 else
41578 }
41579 else
41588 location);
41593 invalid_kind:
41595 resync_fail:
41600 }
41602 /* OpenACC:
41603 async [( int-expr )] */
41605 static tree
41607 {
41614 {
41615 matching_parens parens;
41624 }
41634 }
41636 /* OpenACC 2.7:
41637 self [( expression )] */
41639 static tree
41641 {
41642 tree t;
41645 {
41646 matching_parens parens;
41651 {
41656 }
41657 }
41658 else
41663 {
41666 }
41672 }
41674 /* Parse all OpenACC clauses. The set clauses allowed by the directive
41675 is a bitmask in MASK. Return the list of clauses found. */
41677 static tree
41681 {
41685 /* Don't create location wrapper nodes within OpenACC clauses. */
41686 auto_suppress_location_wrappers sentinel;
41689 {
41690 location_t here;
41691 pragma_omp_clause c_kind;
41692 omp_clause_code code;
41703 {
41710 clauses);
41763 clauses);
41768 clauses);
41786 clauses);
41791 clauses);
41804 clauses);
41811 clauses);
41817 clauses);
41825 clauses);
41829 clauses
41836 /* OpenACC compute construct */
41838 else
41839 /* OpenACC 'update' directive */
41845 clauses);
41854 clauses);
41860 OMP_CLAUSE_VECTOR,
41867 clauses);
41876 OMP_CLAUSE_WORKER,
41882 }
41887 {
41888 /* Remove the invalid clause(s) from the list to avoid
41889 confusing the rest of the compiler. */
41892 }
41893 }
41895 saw_error:
41903 }
41905 /* Parse all OpenMP clauses. The set clauses allowed by the directive
41906 is a bitmask in MASK. Return the list of clauses found.
41907 FINISH_P set if finish_omp_clauses should be called.
41908 NESTED non-zero if clauses should be terminated by closing paren instead
41909 of end of pragma. If it is 2, additionally commas are required in between
41910 the clauses. */
41912 static tree
41916 {
41921 /* Don't create location wrapper nodes within OpenMP clauses. */
41922 auto_suppress_location_wrappers sentinel;
41925 {
41926 pragma_omp_clause c_kind;
41934 {
41939 "clauses in %<simd%> trait should be separated "
41941 }
41947 {
41964 clauses);
41983 clauses);
42003 clauses);
42008 clauses);
42013 clauses);
42018 clauses);
42027 clauses
42078 clauses);
42082 clauses
42094 clauses);
42098 clauses
42100 OMP_CLAUSE_TASK_REDUCTION,
42116 clauses);
42121 OMP_CLAUSE_NOTINBRANCH,
42130 {
42131 clause_not_first:
42135 }
42164 {
42166 clauses);
42170 }
42171 else
42173 clauses);
42178 clauses);
42183 clauses);
42205 {
42210 }
42271 clauses
42277 clauses
42284 clauses);
42290 }
42295 {
42296 /* Remove the invalid clause(s) from the list to avoid
42297 confusing the rest of the compiler. */
42300 }
42301 }
42302 saw_error:
42306 {
42309 else
42311 }
42313 }
42315 /* OpenMP 2.5:
42316 structured-block:
42317 statement
42319 In practice, we're also interested in adding the statement to an
42320 outer node. So it is convenient if we work around the fact that
42321 cp_parser_statement calls add_stmt. */
42323 static unsigned
42325 {
42328 /* Only move the values to IN_OMP_BLOCK if they weren't false.
42329 This preserves the "not within loop or switch" style error messages
42330 for nonsense cases like
42331 void foo() {
42332 #pragma omp single
42333 break;
42334 }
42335 */
42340 }
42342 static void
42344 {
42346 }
42348 static tree
42350 {
42359 }
42361 /* OpenMP 5.x:
42362 # pragma omp allocate (list) clauses
42364 OpenMP 5.0 clause:
42365 allocator (omp_allocator_handle_t expression)
42367 OpenMP 5.1 additional clause:
42368 align (constant-expression)] */
42370 static void
42372 {
42378 do
42379 {
42386 matching_parens parens;
42392 {
42395 }
42400 {
42403 }
42405 {
42408 /* FIXME: Remove when adding check to semantics.cc; cf FIXME below. */
42412 {
42414 "positive constant power of two integer "
42417 }
42419 {
42422 {
42427 {
42429 "positive constant power of two integer "
42432 }
42433 }
42434 }
42435 }
42437 {
42440 }
42441 else
42442 {
42445 }
42452 {
42455 }
42457 /* FIXME: When implementing properly, delete the align/allocate expr error
42458 check above and add one in semantics.cc (to properly handle templates).
42459 Base this on the allocator/align modifiers check for the 'allocate' clause
42460 in semantics.cc's finish_omp_clauses. */
42462 }
42464 /* OpenMP 2.5:
42465 # pragma omp atomic new-line
42466 expression-stmt
42468 expression-stmt:
42469 x binop= expr | x++ | ++x | x-- | --x
42470 binop:
42471 +, *, -, /, &, ^, |, <<, >>
42473 where x is an lvalue expression with scalar type.
42475 OpenMP 3.1:
42476 # pragma omp atomic new-line
42477 update-stmt
42479 # pragma omp atomic read new-line
42480 read-stmt
42482 # pragma omp atomic write new-line
42483 write-stmt
42485 # pragma omp atomic update new-line
42486 update-stmt
42488 # pragma omp atomic capture new-line
42489 capture-stmt
42491 # pragma omp atomic capture new-line
42492 capture-block
42494 read-stmt:
42495 v = x
42496 write-stmt:
42497 x = expr
42498 update-stmt:
42499 expression-stmt | x = x binop expr
42500 capture-stmt:
42501 v = expression-stmt
42502 capture-block:
42503 { v = x; update-stmt; } | { update-stmt; v = x; }
42505 OpenMP 4.0:
42506 update-stmt:
42507 expression-stmt | x = x binop expr | x = expr binop x
42508 capture-stmt:
42509 v = update-stmt
42510 capture-block:
42511 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
42513 OpenMP 5.1:
42514 # pragma omp atomic compare new-line
42515 conditional-update-atomic
42517 # pragma omp atomic compare capture new-line
42518 conditional-update-capture-atomic
42520 conditional-update-atomic:
42521 cond-expr-stmt | cond-update-stmt
42522 cond-expr-stmt:
42523 x = expr ordop x ? expr : x;
42524 x = x ordop expr ? expr : x;
42525 x = x == e ? d : x;
42526 cond-update-stmt:
42527 if (expr ordop x) { x = expr; }
42528 if (x ordop expr) { x = expr; }
42529 if (x == e) { x = d; }
42530 ordop:
42531 <, >
42532 conditional-update-capture-atomic:
42533 v = cond-expr-stmt
42534 { v = x; cond-expr-stmt }
42535 { cond-expr-stmt v = x; }
42536 { v = x; cond-update-stmt }
42537 { cond-update-stmt v = x; }
42538 if (x == e) { x = d; } else { v = x; }
42539 { r = x == e; if (r) { x = d; } }
42540 { r = x == e; if (r) { x = d; } else { v = x; } }
42542 where x, r and v are lvalue expressions with scalar type,
42543 expr, e and d are expressions with scalar type and e might be
42544 the same as v. */
42546 static void
42548 {
42564 {
42570 {
42575 enum omp_memory_order new_memory_order
42591 {
42595 }
42603 {
42604 matching_parens parens;
42611 {
42621 }
42624 {
42628 else
42630 }
42631 else
42641 }
42653 {
42657 }
42658 else
42659 {
42662 "%<capture%>, %<compare%>, %<weak%>, %<fail%>, "
42663 "%<seq_cst%>, %<acq_rel%>, %<release%>, "
42665 }
42667 {
42669 {
42670 /* OpenACC permits 'update capture'. */
42677 else
42679 }
42681 {
42684 else
42686 }
42688 {
42691 else
42693 }
42695 {
42698 else
42700 }
42702 {
42705 else
42707 }
42710 }
42711 }
42713 }
42719 {
42723 else
42725 }
42727 {
42731 }
42733 {
42736 }
42738 {
42741 }
42745 {
42746 omp_requires_mask
42751 {
42761 {
42763 "%<acquire%> clause implicitly provided by a "
42766 }
42767 else
42772 {
42774 "%<release%> clause implicitly provided by a "
42777 }
42778 else
42783 {
42793 }
42797 }
42798 }
42799 else
42801 {
42804 {
42808 }
42814 {
42818 }
42824 }
42826 memory_order
42831 {
42841 else
42846 {
42847 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
42848 opcode. */
42853 }
42857 {
42860 }
42864 else
42865 {
42873 {
42877 }
42878 }
42881 }
42883 restart:
42885 {
42888 matching_parens parens;
42892 tree cmp_expr;
42895 else
42903 {
42909 }
42911 ;
42913 {
42917 }
42920 {
42922 "expected %<==%>, %<<%> or %<>%> comparison in %<if%> "
42925 }
42936 {
42939 }
42944 else
42957 {
42959 {
42962 }
42964 {
42969 }
42970 else
42972 }
42977 {
42982 }
42983 else
42984 {
42985 bad_if:
42989 }
42992 {
42996 {
43000 }
43028 /* Signal to c_finish_omp_atomic that in
43029 if (x == e) { x = d; } else { v = x; }
43030 case the store to v should be conditional. */
43032 }
43034 {
43037 }
43043 }
43047 {
43054 /* FALLTHROUGH */
43066 /* FALLTHROUGH */
43083 /* Undo effects of boolean_increment for post {in,de}crement. */
43085 /* FALLTHRU */
43089 {
43090 /* Undo effects of boolean_increment. */
43092 {
43093 /* This is pre or post increment. */
43098 && !structured_block
43104 }
43105 }
43106 /* FALLTHRU */
43109 {
43112 }
43114 {
43149 {
43153 }
43158 {
43164 {
43169 }
43171 {
43185 {
43187 {
43192 }
43193 else
43195 }
43200 || !structured_block
43201 || v
43207 {
43209 {
43215 }
43216 }
43224 {
43228 cond_expr:
43230 bool saved_colon_corrects_to_scope_p
43234 parser->colon_corrects_to_scope_p
43239 {
43241 {
43243 {
43247 }
43249 {
43250 opcode
43254 }
43255 }
43256 else
43257 {
43260 {
43261 opcode
43266 }
43267 }
43268 }
43270 "invalid form of "
43273 }
43277 }
43282 {
43289 }
43293 }
43297 {
43300 {
43308 }
43310 {
43315 }
43359 }
43362 {
43364 "invalid form of "
43367 }
43378 {
43380 {
43382 "invalid form of "
43385 }
43387 }
43393 }
43400 }
43401 stmt_done:
43403 {
43416 }
43418 {
43422 }
43423 done:
43425 {
43428 }
43436 invalid_compare:
43438 /* FALLTHRU */
43439 saw_error:
43444 {
43448 {
43452 }
43453 }
43454 }
43457 /* OpenMP 2.5:
43458 # pragma omp barrier new-line */
43460 static void
43462 {
43465 }
43467 /* OpenMP 2.5:
43468 # pragma omp critical [(name)] new-line
43469 structured-block
43471 OpenMP 4.5:
43472 # pragma omp critical [(name) [hint(expression)]] new-line
43473 structured-block */
43475 #define OMP_CRITICAL_CLAUSE_MASK \
43476 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
43478 static tree
43480 {
43484 {
43485 matching_parens parens;
43501 }
43508 }
43510 /* OpenMP 5.0:
43511 # pragma omp depobj ( depobj ) depobj-clause new-line
43513 depobj-clause:
43514 depend (dependence-type : locator)
43515 destroy
43516 update (dependence-type)
43518 OpenMP 5.2 additionally:
43519 destroy ( depobj )
43521 dependence-type:
43522 in
43523 out
43524 inout
43525 mutexinout */
43527 static void
43529 {
43531 matching_parens parens;
43533 {
43536 }
43551 {
43557 {
43558 /* Don't create location wrapper nodes within the depend clause. */
43559 auto_suppress_location_wrappers sentinel;
43565 }
43567 {
43569 matching_parens c_parens;
43572 {
43579 "the %<destroy%> expression %qE should be the same "
43586 }
43587 }
43589 {
43590 matching_parens c_parens;
43592 {
43593 location_t c2_loc
43596 {
43611 }
43613 {
43617 }
43623 }
43624 else
43626 }
43627 }
43629 {
43632 }
43636 }
43639 /* OpenMP 2.5:
43640 # pragma omp flush flush-vars[opt] new-line
43642 flush-vars:
43643 ( variable-list )
43645 OpenMP 5.0:
43646 # pragma omp flush memory-order-clause new-line */
43648 static void
43650 {
43656 {
43667 else
43669 "expected %<seq_cst%>, %<acq_rel%>, %<release%> or "
43672 }
43674 {
43677 "%<flush%> list specified together with memory order "
43680 }
43684 }
43686 /* Helper function, to parse omp for increment expression. */
43688 static tree
43690 {
43695 {
43698 }
43701 {
43713 }
43715 /* If decl is an iterator, preserve LHS and RHS of the relational
43716 expr until finish_omp_for. */
43727 }
43729 /* Helper function, to parse omp for increment expression. */
43731 static tree
43733 {
43737 cp_id_kind idk;
43741 {
43750 }
43759 {
43764 }
43771 {
43775 }
43788 do
43789 {
43796 {
43798 {
43801 else
43804 }
43805 else
43810 }
43811 }
43815 {
43821 }
43822 else
43826 }
43828 /* Parse the initialization statement of an OpenMP for loop. Range-for
43829 is handled separately in cp_convert_omp_range_for.
43831 On entry SL is the current statement list. Parsing of some forms
43832 of initialization pops this list and stores its contents in either INIT
43833 or THIS_PRE_BODY, and sets SL to null. Initialization for class
43834 iterators is added directly to SL and it is not popped until later.
43836 On return, DECL is set if the initialization is by binding the
43837 iteration variable. If the initialization is by assignment, REAL_DECL
43838 is set to point to a variable in an outer scope. ORIG_INIT is set
43839 if the iteration variable is of class type; this is a copy saved for
43840 error checking in finish_omp_for.
43842 Return true if the resulting construct should have an
43843 OMP_CLAUSE_PRIVATE added to it. */
43845 static tree
43853 {
43859 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
43861 init-expr:
43862 var = lb
43863 integer-type var = lb
43864 random-access-iterator-type var = lb
43865 pointer-type var = lb
43866 */
43867 cp_decl_specifier_seq type_specifiers;
43869 /* First, try to parse as an initialized declaration. See
43870 cp_parser_condition, from whence the bulk of this is copied. */
43878 {
43879 /* If parsing a type specifier seq succeeded, then this
43880 MUST be a initialized declaration. */
43885 CP_PARSER_DECLARATOR_NAMED,
43886 CP_PARSER_FLAGS_NONE,
43898 else
43899 {
43909 {
43911 CPP_OPEN_PAREN))
43914 else
43915 /* Trigger an error. */
43920 }
43924 {
43932 {
43935 auto_node);
43940 }
43943 asm_specification,
43944 LOOKUP_ONLYCONVERTING);
43947 /* In the case of a class iterator, do not pop sl here.
43948 Both class initialization and finalization must happen in
43949 the enclosing init block scope. For now set the init
43950 expression to null; it'll be filled in properly in
43951 finish_omp_for before stuffing it in the OMP_FOR. */
43955 {
43959 {
43961 /* Move lambda DECL_EXPRs to the enclosing block. */
43963 {
43967 {
43971 }
43973 }
43975 {
43980 }
43981 }
43982 }
43983 }
43984 else
43985 /* This is an initialized declaration of non-class,
43986 non-parameterized type iteration variable. */
43987 {
43988 /* Consume '='. */
43992 non_class:
43995 else
43998 asm_specification,
43999 LOOKUP_ONLYCONVERTING);
44002 }
44006 }
44007 }
44008 else
44009 {
44010 cp_id_kind idk;
44011 /* If parsing a type specifier sequence failed, then
44012 this MUST be a simple expression. */
44018 && decl
44021 {
44032 {
44037 }
44042 }
44044 && decl
44047 {
44048 tree rhs;
44057 tf_warning_or_error));
44060 }
44061 else
44062 {
44067 {
44071 }
44072 }
44075 }
44077 }
44079 /* Helper for cp_parser_omp_loop_nest, handle one range-for loop
44080 including introducing new temporaries for the range start and end,
44081 doing auto deduction, and processing decomposition variables.
44083 This function is also called from pt.cc during template instantiation.
44084 In that case SL is NULL_TREE, otherwise it is the current statement
44085 list. */
44086 void
44090 {
44096 {
44100 /* do_auto_deduction doesn't mess with template init-lists. */
44102 {
44106 {
44111 {
44116 }
44117 }
44119 }
44124 {
44127 }
44129 }
44134 /* If an error happened previously do nothing or else a lot of
44135 unhelpful errors would be issued. */
44137 else
44138 {
44139 tree range_temp;
44143 /* Can't bind a reference to an array of runtime bound. */
44145 else
44146 {
44152 LOOKUP_ONLYCONVERTING);
44155 }
44158 }
44169 LOOKUP_ONLYCONVERTING);
44171 /* The new for initialization statement. */
44179 else
44180 {
44183 }
44186 LOOKUP_ONLYCONVERTING);
44188 /* The new for condition. */
44191 else
44197 /* The new increment expression. */
44200 else
44203 tf_warning_or_error);
44207 /* Defer popping sl here. */
44211 {
44216 {
44222 }
44223 }
44227 {
44231 {
44235 {
44241 }
44242 }
44243 }
44245 /* The output ORIG_DECL is not a decl. Instead, it is a tree structure
44246 that holds decls for variables implementing the iterator, represented
44247 as a TREE_LIST whose TREE_CHAIN is a vector. The first two elements
44248 of the vector are decls of scratch variables for the range start and
44249 end that will eventually be bound in the implicit scope surrounding
44250 the whole loop nest. The remaining elements are decls of derived
44251 decomposition variables that are bound inside the loop body. This
44252 structure is further mangled by finish_omp_for into the form required
44253 for the OMP_FOR_ORIG_DECLS field of the OMP_FOR tree node. */\
44262 {
44264 {
44265 /* If cp_finish_decomp was called with processing_template_decl
44266 temporarily set to 1, then decomp names will have deduced
44267 name but the DECL_VALUE_EXPR will be dependent. Hide those
44268 from folding of other loop initializers e.g. for warning
44269 purposes until cp_finish_omp_range_for. */
44274 }
44277 }
44279 }
44281 /* Helper for cp_parser_omp_for_loop, finalize part of range for
44282 inside of the collapsed body. */
44284 void
44286 {
44293 {
44298 {
44299 /* Undo temporary clearing of DECL_HAS_VALUE_EXPR_P done
44300 by cp_convert_omp_range_for above. */
44304 {
44308 }
44309 }
44310 }
44312 /* The declaration is initialized with *__begin inside the loop body. */
44320 }
44322 /* Return true if next tokens contain a standard attribute that contains
44323 omp::directive (DIRECTIVE). */
44325 static bool
44328 {
44336 {
44344 }
44349 location_t last_loc
44358 {
44360 {
44364 cnt++;
44368 {
44372 }
44373 }
44374 }
44376 {
44379 }
44381 {
44383 "%<[[omp::directive(%s)]]%> must be the only specified "
44387 }
44392 }
44394 /* Parse an OpenMP structured block sequence. KIND is the corresponding
44395 separating directive. */
44397 static tree
44400 {
44406 {
44419 kind == PRAGMA_OMP_SCAN
44424 }
44428 }
44431 /* OpenMP 5.0:
44433 scan-loop-body:
44434 { structured-block scan-directive structured-block } */
44436 static void
44438 {
44442 matching_braces braces;
44449 else
44450 {
44452 "%<#pragma omp scan%> with zero preceding executable "
44455 }
44461 {
44471 {
44478 }
44480 {
44483 }
44484 else
44489 }
44490 else
44496 else
44497 {
44500 "%<#pragma omp scan%> with zero succeeding executable "
44503 }
44505 clauses);
44509 }
44512 /* This function parses a single level of a loop nest, invoking itself
44513 recursively if necessary.
44515 loop-nest :: for (...) loop-body
44516 loop-body :: loop-nest
44517 | { [intervening-code] loop-body [intervening-code] }
44518 | final-loop-body
44519 intervening-code :: structured-block-sequence
44520 final-loop-body :: structured-block
44522 For a collapsed loop nest, only a single OMP_FOR is built, pulling out
44523 all the iterator information from the inner loops into vectors in the
44524 parser->omp_for_parse_state structure.
44526 In the "range for" case, it is transformed into a regular "for" iterator
44527 by introducing some temporary variables for the begin/end,
44528 as well as bindings of the actual iteration variables which are
44529 injected into the body of the loop.
44531 Initialization code for iterator variables may end up either in the
44532 init vector (simple assignments), in omp_for_parse_state->pre_body
44533 (decl_exprs for iterators bound in the for statement), or in the
44534 scope surrounding this level of loop initialization.
44536 The scopes of class iterator variables and their finalizers need to
44537 be adjusted after parsing so that all of the initialization happens
44538 in a scope surrounding all of the intervening and body code. For
44539 this reason we separately store the initialization and body blocks
44540 for each level of loops in the omp_for_parse_state structure and
44541 reassemble/reorder them in cp_parser_omp_for. See additional
44542 comments there about the use of placeholders, etc. */
44544 static tree
44546 {
44551 tree init_scope;
44556 location_t loc;
44564 /* We have already matched the FOR token but not consumed it yet. */
44568 /* Forbid break/continue in the loop initializer, condition, and
44569 increment expressions. */
44573 /* We are not in intervening code now. */
44576 /* Don't create location wrapper nodes within an OpenMP "for"
44577 statement. */
44578 auto_suppress_location_wrappers sentinel;
44580 matching_parens parens;
44587 integer_zero_node);
44590 /* The init_block acts as a container for this level of loop goo. */
44594 /* Wrap a scope around this entire level of loop to hold bindings
44595 of loop iteration variables. We can't insert them directly
44596 in the containing scope because that would cause their visibility to
44597 be incorrect with respect to intervening code after this loop.
44598 We will combine the nested init_scopes in postprocessing after the
44599 entire loop is parsed. */
44602 /* Now we need another level of statement list container to capture the
44603 initialization (and possible finalization) bits. In some cases this
44604 container may be popped off during initializer parsing to store code in
44605 INIT or THIS_PRE_BODY, depending on the form of initialization. If
44606 we have a class iterator we will pop it at the end of parsing this
44607 level, so the cleanups are handled correctly. */
44611 {
44612 /* Save tokens so that we can put them back. */
44615 /* Look for ':' that is not nested in () or {}. */
44616 is_range_for
44619 CPP_COLON,
44620 /*consume_paren=*/
44623 /* Roll back the tokens we skipped. */
44627 {
44628 bool saved_colon_corrects_to_scope_p
44631 /* A colon is used in range-based for. */
44634 /* Parse the declaration. */
44636 /*function_definition_allowed_p=*/
44638 parser->colon_corrects_to_scope_p
44652 "%<ordered%> clause with parameter on "
44656 }
44657 }
44659 add_private_clause
44665 /* If the iteration variable was introduced via a declaration in the
44666 for statement, DECL points at it. Otherwise DECL is null and
44667 REAL_DECL is a variable previously declared in an outer scope.
44668 Make REAL_DECL point at the iteration variable no matter where it
44669 was introduced. */
44673 /* Some clauses treat iterator variables specially. */
44678 {
44684 {
44688 }
44691 {
44692 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
44696 {
44700 }
44701 else
44702 {
44705 }
44707 }
44708 else
44709 {
44714 }
44715 }
44718 {
44719 tree c;
44721 {
44730 decl);
44735 decl);
44736 }
44738 {
44745 else
44750 {
44753 /* For linear, signal that we need to fill up
44754 the so far unknown linear step. */
44757 }
44758 }
44759 }
44768 {
44769 /* If decl is an iterator, preserve the operator on decl
44770 until finish_omp_for. */
44772 && ((processing_template_decl
44777 else
44780 }
44782 parse_close_paren:
44788 /* We've parsed all the for (...) stuff now. Store the bits. */
44794 {
44797 }
44799 {
44801 omp_for_parse_state->orig_declv
44804 }
44811 /* Start a nested block for the loop body. */
44813 integer_zero_node);
44821 {
44825 }
44828 {
44829 /* This is the open brace in the loop-body grammar production. Rather
44830 than trying to special-case braces, just parse it as a compound
44831 statement and handle the nested loop-body case there. Note that
44832 when we see a further open brace inside the compound statement
44833 loop-body, we don't know whether it is the start of intervening
44834 code that is a compound statement, or a level of braces
44835 surrounding a nested loop-body. Use the WANT_NESTED_LOOP state
44836 bit to ensure we have only one nested loop at each level. */
44843 {
44844 /* We have already parsed the whole loop body and not found a
44845 nested loop. */
44849 }
44851 }
44852 else
44853 {
44854 /* This is the final-loop-body case in the grammar: we have something
44855 that is not a FOR and not an open brace. */
44857 {
44858 /* If we were expecting a nested loop, give an error and mark
44859 that parsing has failed, and try to recover by parsing the
44860 body as regular code without further collapsing. */
44864 }
44867 /* Generate the parts of range for that belong in the loop body,
44868 to be executed on every iteration. This includes setting the
44869 user-declared decomposition variables from the compiler-generated
44870 temporaries that are the real iteration variables for OMP_FOR.
44871 FIXME: Not sure if this is correct with respect to visibility
44872 of the variables from intervening code. However, putting this
44873 code in each level of loop instead of all around the innermost
44874 body also makes the decomposition variables visible to the
44875 inner for init/bound/step exressions, which is not supposed to
44876 happen and causes test failures. */
44879 {
44884 }
44886 /* Now parse the final-loop-body for the innermost loop. */
44890 else
44893 }
44898 /* Pop and remember the body block. Add the body placeholder
44899 to the surrounding statement list instead. This is just a unique
44900 token that will be replaced when we reassemble the generated
44901 code for the entire omp for statement. */
44906 /* Pop and remember the init block. */
44913 /* Return the init placeholder rather than the remembered init block.
44914 Again, this is just a unique cookie that will be used to reassemble
44915 code pieces when the entire omp for statement has been parsed. */
44917 }
44919 /* Worker for find_structured_blocks. *TP points to a STATEMENT_LIST
44920 and ITER is the element that is or contains a nested loop. This
44921 function moves the statements before and after ITER into
44922 OMP_STRUCTURED_BLOCKs and modifies *TP. */
44923 static void
44925 {
44929 {
44934 TSI_SAME_STMT);
44935 i++;
44937 }
44938 else
44939 {
44943 }
44948 TSI_SAME_STMT);
44949 }
44951 /* Helper to find and mark structured blocks in intervening code for a
44952 single loop level with markers for later error checking. *TP is the
44953 piece of code to be marked and INNER is the inner loop placeholder.
44954 Returns true if INNER was found (recursively) in *TP. */
44955 static bool
44957 {
44963 {
44965 {
44967 /* The normal case is that there is no intervening code and we
44968 do not have to insert any OMP_STRUCTURED_BLOCK markers. */
44970 {
44974 }
44975 }
44977 }
44982 else
44984 }
44986 /* Helpers used for relinking tree structures: In tree rooted at
44987 CONTEXT, replace ORIG with REPLACEMENT. If FLATTEN is true, try to combine
44988 nested BIND_EXPRs. Gives an assertion if it fails to find ORIG. */
44991 tree orig;
44992 tree repl;
44994 };
44996 static tree
44999 {
45002 {
45005 }
45006 /* Remove redundant BIND_EXPRs with no bindings even when not specifically
45007 trying to flatten. */
45012 {
45015 }
45019 {
45021 {
45022 /* Merge binding lists for two directly nested BIND_EXPRs,
45023 keeping the outer one. */
45028 }
45030 /* There might be a statement list containing cleanup_points
45031 etc between the two levels of BIND_EXPR. We can still merge
45032 them, again keeping the outer BIND_EXPR. */
45035 {
45038 {
45043 }
45044 }
45045 }
45047 }
45049 static void
45051 {
45064 }
45066 /* Walker to patch up the BLOCK_NODE hierarchy after the above surgery.
45067 *DP is is the parent block. */
45069 static tree
45071 {
45074 /* BIND_EXPR_BLOCK may be null if the expression is not a
45075 full-expression; if there's no block, no patching is necessary
45076 for this node. */
45078 {
45081 {
45085 }
45090 }
45093 }
45095 /* Parse the restricted form of the for statement allowed by OpenMP. */
45097 static tree
45100 {
45101 tree ret;
45109 tree result;
45116 {
45119 }
45122 {
45125 }
45132 {
45138 }
45144 {
45147 }
45149 /* Initialize parse state for recursive descent. */
45174 /* Bomb out early if there was an error (not enough loops, etc). */
45176 {
45179 }
45181 /* Relink the init and body blocks that were built during parsing. At
45182 this point we have a structure nested like
45183 init 0
45184 body 0
45185 init 1
45186 body 1
45187 init 2
45188 body 2
45189 and we want to turn it into
45190 init 0
45191 init 1
45192 init 2
45193 omp_for
45194 body 0
45195 body 1
45196 body 2
45197 We also need to flatten the init blocks, as some code for later
45198 processing of combined directives gets confused otherwise. */
45205 /* First insert markers for structured blocks for intervening code in
45206 the loop bodies. */
45208 {
45212 }
45214 /* Do the substitution from the inside out. */
45216 {
45223 }
45225 /* Generate the OMP_FOR. Note finish_omp_for adds the OMP_FOR
45226 (and possibly other stuff) to the current statement list but
45227 returns a pointer to the OMP_FOR itself, or null in case of error. */
45235 /* Check for errors involving lb/ub/incr expressions referencing
45236 variables declared in intervening code. */
45242 {
45243 /* Splice the omp_for into the nest of init blocks. */
45248 /* Some later processing for combined directives assumes
45249 that the BIND_EXPR containing range for variables appears
45250 at top level in the OMP_FOR body. Fix that up if it's
45251 not the case, e.g. because there is intervening code. */
45255 /* Clean up the block subblock/superblock links. Per comment in
45256 begin_compound_stmt, "we don't build BLOCK nodes when processing
45257 templates", so skip this step in that case. */
45259 {
45263 }
45265 /* Finally record the result. */
45267 }
45271 }
45273 /* Helper function for OpenMP parsing, split clauses and call
45274 finish_omp_clauses on each of the set of clauses afterwards. */
45276 static void
45279 {
45285 i == C_OMP_CLAUSE_SPLIT_TARGET
45287 }
45289 /* OpenMP 5.0:
45290 #pragma omp loop loop-clause[optseq] new-line
45291 for-loop */
45293 #define OMP_LOOP_CLAUSE_MASK \
45294 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
45298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
45299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
45301 static tree
45305 {
45316 {
45319 }
45331 }
45333 /* OpenMP 4.0:
45334 #pragma omp simd simd-clause[optseq] new-line
45335 for-loop */
45337 #define OMP_SIMD_CLAUSE_MASK \
45338 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
45339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
45340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
45341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
45342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
45346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
45348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
45350 static tree
45354 {
45365 {
45368 }
45380 }
45382 /* OpenMP 2.5:
45383 #pragma omp for for-clause[optseq] new-line
45384 for-loop
45386 OpenMP 4.0:
45387 #pragma omp for simd for-simd-clause[optseq] new-line
45388 for-loop */
45390 #define OMP_FOR_CLAUSE_MASK \
45391 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
45395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
45397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
45398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
45399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
45400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
45403 static tree
45407 {
45414 /* parallel for{, simd} disallows nowait clause, but for
45415 target {teams distribute ,}parallel for{, simd} it should be accepted. */
45418 /* Composite distribute parallel for{, simd} disallows ordered clause. */
45423 {
45428 {
45452 }
45453 }
45455 {
45458 }
45460 /* Composite distribute parallel for disallows linear clause. */
45467 {
45470 }
45482 }
45487 /* OpenMP 2.5:
45488 # pragma omp master new-line
45489 structured-block */
45491 static tree
45495 {
45503 {
45508 {
45528 }
45529 }
45531 {
45534 }
45537 {
45541 }
45542 else
45547 }
45549 /* OpenMP 5.1:
45550 # pragma omp masked masked-clauses new-line
45551 structured-block */
45553 #define OMP_MASKED_CLAUSE_MASK \
45554 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FILTER)
45556 static tree
45560 {
45569 {
45574 {
45595 }
45596 }
45598 {
45601 }
45606 {
45609 }
45613 clauses);
45614 }
45616 /* OpenMP 2.5:
45617 # pragma omp ordered new-line
45618 structured-block
45620 OpenMP 4.5:
45621 # pragma omp ordered ordered-clauses new-line
45622 structured-block */
45624 #define OMP_ORDERED_CLAUSE_MASK \
45625 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
45626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
45628 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
45629 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DOACROSS))
45632 static bool
45635 {
45643 {
45648 {
45650 {
45653 }
45655 {
45657 "%qs clause may only be used in compound "
45661 }
45662 tree clauses
45664 OMP_ORDERED_DEPEND_CLAUSE_MASK,
45668 }
45669 }
45671 tree clauses
45682 }
45684 /* OpenMP 2.5:
45686 section-scope:
45687 { section-sequence }
45689 section-sequence:
45690 section-directive[opt] structured-block
45691 section-sequence section-directive structured-block */
45693 static tree
45695 {
45700 matching_braces braces;
45707 != PRAGMA_OMP_SECTION
45709 {
45711 PRAGMA_OMP_SECTION);
45714 }
45717 {
45727 {
45731 }
45733 {
45736 }
45739 PRAGMA_OMP_SECTION);
45742 }
45753 }
45755 /* OpenMP 2.5:
45756 # pragma omp sections sections-clause[optseq] newline
45757 sections-scope */
45759 #define OMP_SECTIONS_CLAUSE_MASK \
45760 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45767 static tree
45770 {
45782 {
45785 }
45792 }
45794 /* OpenMP 2.5:
45795 # pragma omp parallel parallel-clause[optseq] new-line
45796 structured-block
45797 # pragma omp parallel for parallel-for-clause[optseq] new-line
45798 structured-block
45799 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
45800 structured-block
45802 OpenMP 4.0:
45803 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
45804 structured-block */
45806 #define OMP_PARALLEL_CLAUSE_MASK \
45807 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
45811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
45813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
45815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
45818 static tree
45822 {
45829 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
45835 {
45843 if_p);
45847 if_p);
45850 block);
45855 }
45856 /* When combined with distribute, parallel has to be followed by for.
45857 #pragma omp target parallel is allowed though. */
45861 {
45865 }
45867 {
45871 {
45885 block);
45888 /* masked does have just filter clause, but during gimplification
45889 isn't represented by a gimplification omp context, so for
45890 #pragma omp parallel masked don't set OMP_PARALLEL_COMBINED,
45891 so that
45892 #pragma omp parallel masked
45893 #pragma omp taskloop simd lastprivate (x)
45894 isn't confused with
45895 #pragma omp parallel masked taskloop simd lastprivate (x) */
45899 }
45901 {
45915 block);
45918 /* master doesn't have any clauses and during gimplification
45919 isn't represented by a gimplification omp context, so for
45920 #pragma omp parallel master don't set OMP_PARALLEL_COMBINED,
45921 so that
45922 #pragma omp parallel master
45923 #pragma omp taskloop simd lastprivate (x)
45924 isn't confused with
45925 #pragma omp parallel master taskloop simd lastprivate (x) */
45929 }
45931 {
45946 block);
45951 }
45953 {
45956 }
45958 {
45968 block);
45971 }
45972 }
45974 {
45977 }
45982 {
45985 }
45994 }
45996 /* OpenMP 2.5:
45997 # pragma omp single single-clause[optseq] new-line
45998 structured-block */
46000 #define OMP_SINGLE_CLAUSE_MASK \
46001 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46002 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
46004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46007 static tree
46009 {
46020 }
46022 /* OpenMP 5.1:
46023 # pragma omp scope scope-clause[optseq] new-line
46024 structured-block */
46026 #define OMP_SCOPE_CLAUSE_MASK \
46027 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46033 static tree
46035 {
46046 }
46048 /* OpenMP 3.0:
46049 # pragma omp task task-clause[optseq] new-line
46050 structured-block */
46052 #define OMP_TASK_CLAUSE_MASK \
46053 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
46055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
46056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
46059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
46060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
46061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
46063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
46065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DETACH) \
46066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_AFFINITY))
46068 static tree
46070 {
46082 }
46084 /* OpenMP 3.0:
46085 # pragma omp taskwait new-line
46087 OpenMP 5.0:
46088 # pragma omp taskwait taskwait-clause[opt] new-line */
46090 #define OMP_TASKWAIT_CLAUSE_MASK \
46091 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46094 static void
46096 {
46097 tree clauses
46102 {
46109 }
46110 else
46112 }
46114 /* OpenMP 3.1:
46115 # pragma omp taskyield new-line */
46117 static void
46119 {
46122 }
46124 /* OpenMP 4.0:
46125 # pragma omp taskgroup new-line
46126 structured-block
46128 OpenMP 5.0:
46129 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
46131 #define OMP_TASKGROUP_CLAUSE_MASK \
46132 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
46135 static tree
46137 {
46138 tree clauses
46143 if_p),
46144 clauses);
46145 }
46148 /* OpenMP 2.5:
46149 # pragma omp threadprivate (variable-list) */
46151 static void
46153 {
46154 tree vars;
46160 }
46162 /* OpenMP 4.0:
46163 # pragma omp cancel cancel-clause[optseq] new-line */
46165 #define OMP_CANCEL_CLAUSE_MASK \
46166 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
46167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
46168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
46169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
46170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
46172 static void
46174 {
46178 }
46180 /* OpenMP 4.0:
46181 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
46183 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
46184 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
46185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
46186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
46187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
46189 static bool
46192 {
46193 tree clauses;
46197 {
46202 {
46205 }
46206 }
46208 {
46212 }
46215 {
46220 else
46224 }
46227 OMP_CANCELLATION_POINT_CLAUSE_MASK,
46229 pragma_tok);
46232 }
46234 /* OpenMP 4.0:
46235 #pragma omp distribute distribute-clause[optseq] new-line
46236 for-loop */
46238 #define OMP_DISTRIBUTE_CLAUSE_MASK \
46239 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
46242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
46243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
46245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
46247 static tree
46251 {
46260 {
46268 else
46271 {
46277 {
46281 else
46284 }
46290 else
46304 }
46305 }
46307 {
46310 }
46315 {
46318 }
46330 }
46332 /* OpenMP 4.0:
46333 # pragma omp teams teams-clause[optseq] new-line
46334 structured-block */
46336 #define OMP_TEAMS_CLAUSE_MASK \
46337 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
46340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
46341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
46342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
46343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
46346 static tree
46350 {
46359 {
46363 {
46389 }
46391 {
46417 }
46418 }
46420 {
46423 }
46428 {
46431 }
46441 }
46443 /* OpenMP 4.0:
46444 # pragma omp target data target-data-clause[optseq] new-line
46445 structured-block */
46447 #define OMP_TARGET_DATA_CLAUSE_MASK \
46448 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
46452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
46454 static tree
46456 {
46458 omp_requires_mask
46461 tree clauses
46467 {
46470 {
46496 "%<#pragma omp target data%> with map-type other "
46497 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
46501 }
46506 }
46509 {
46512 "%<#pragma omp target data%> must contain at least "
46513 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
46516 }
46527 }
46529 /* OpenMP 4.5:
46530 # pragma omp target enter data target-enter-data-clause[optseq] new-line
46531 structured-block */
46533 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
46534 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46540 static bool
46543 {
46546 {
46551 {
46554 }
46555 }
46557 {
46561 }
46564 {
46570 }
46573 omp_requires_mask
46576 tree clauses
46582 {
46585 {
46619 "%<#pragma omp target enter data%> with map-type other "
46623 }
46625 }
46628 {
46631 "%<#pragma omp target enter data%> must contain at least "
46634 }
46642 }
46644 /* OpenMP 4.5:
46645 # pragma omp target exit data target-enter-data-clause[optseq] new-line
46646 structured-block */
46648 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
46649 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46655 static bool
46658 {
46661 {
46666 {
46669 }
46670 }
46672 {
46676 }
46679 {
46685 }
46688 omp_requires_mask
46691 tree clauses
46699 {
46702 {
46736 "%<#pragma omp target exit data%> with map-type other "
46737 "than %<from%>, %<tofrom%>, %<release%> or %<delete%> "
46741 }
46743 }
46746 {
46749 "%<#pragma omp target exit data%> must contain at least "
46752 }
46760 }
46762 /* OpenMP 4.0:
46763 # pragma omp target update target-update-clause[optseq] new-line */
46765 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
46766 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
46767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
46768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46773 static bool
46776 {
46778 {
46784 }
46786 tree clauses
46791 {
46793 "%<#pragma omp target update%> must contain at least one "
46796 }
46799 omp_requires_mask
46808 }
46810 /* OpenMP 4.0:
46811 # pragma omp target target-clause[optseq] new-line
46812 structured-block */
46814 #define OMP_TARGET_CLAUSE_MASK \
46815 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
46820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
46823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
46825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
46826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR)\
46827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HAS_DEVICE_ADDR))
46829 static bool
46832 {
46834 omp_requires_mask
46838 {
46850 {
46858 {
46859 tree stmt;
46861 {
46864 OMP_TARGET_CLAUSE_MASK,
46869 OMP_TARGET_CLAUSE_MASK,
46874 OMP_TARGET_CLAUSE_MASK,
46879 }
46881 }
46886 {
46890 if_p);
46895 if_p);
46900 if_p);
46904 }
46910 /* For combined target teams, ensure the num_teams and
46911 thread_limit clause expressions are evaluated on the host,
46912 before entering the target construct. */
46921 {
46924 tf_none);
46931 OMP_CLAUSE_FIRSTPRIVATE);
46936 }
46941 }
46943 {
46946 }
46948 {
46952 }
46954 {
46957 }
46959 {
46962 }
46964 {
46967 }
46968 }
46970 {
46973 }
46980 {
46986 }
46995 }
46997 /* OpenACC 2.0:
46998 # pragma acc cache (variable-list) new-line
46999 */
47001 static tree
47003 {
47004 /* Don't create location wrapper nodes within 'OMP_CLAUSE__CACHE_'
47005 clauses. */
47006 auto_suppress_location_wrappers sentinel;
47022 }
47024 /* OpenACC 2.0:
47025 # pragma acc data oacc-data-clause[optseq] new-line
47026 structured-block */
47028 #define OACC_DATA_CLAUSE_MASK \
47029 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
47030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
47031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
47035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
47036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
47037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
47039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
47041 static tree
47043 {
47056 }
47058 /* OpenACC 2.0:
47059 # pragma acc host_data <clauses> new-line
47060 structured-block */
47062 #define OACC_HOST_DATA_CLAUSE_MASK \
47063 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) \
47064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) )
47067 static tree
47069 {
47077 {
47081 }
47089 }
47091 /* OpenACC 2.0:
47092 # pragma acc declare oacc-data-clause[optseq] new-line
47093 */
47095 #define OACC_DECLARE_CLAUSE_MASK \
47096 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
47097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
47101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
47102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
47103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
47105 static tree
47107 {
47117 {
47121 }
47124 {
47128 {
47132 }
47135 {
47147 {
47149 "%qD must be a global variable in "
47151 decl);
47154 }
47159 {
47163 }
47165 {
47167 "invalid use of %<extern%> variable %qD "
47171 }
47173 {
47175 "invalid use of %<global%> variable %qD "
47179 }
47181 }
47184 /* This seems to ignore the existence of cleanup scopes?
47185 What is the meaning for local extern decls? The local
47186 extern is in this scope, but it is referring to a decl that
47187 is namespace scope. */
47190 {
47193 }
47195 {
47197 "%qD must be a variable declared in the same scope as "
47201 }
47204 {
47206 /* We need to mark the aliased decl, as that is the entity
47207 that is being referred to. This won't work for
47208 dependent variables, but it didn't work for them before
47209 DECL_LOCAL_DECL_P was a thing either. But then
47210 dependent local extern variable decls are as rare as
47211 hen's teeth. */
47219 {
47224 }
47226 tree id;
47229 else
47235 {
47238 {
47241 {
47245 }
47246 }
47247 }
47248 }
47249 }
47262 }
47264 /* OpenACC 2.0:
47265 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
47267 or
47269 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
47271 LOC is the location of the #pragma token.
47272 */
47274 #define OACC_ENTER_DATA_CLAUSE_MASK \
47275 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
47277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
47278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
47282 #define OACC_EXIT_DATA_CLAUSE_MASK \
47283 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
47285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
47287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
47288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
47289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
47291 static tree
47294 {
47303 {
47308 }
47315 else
47320 {
47324 }
47332 }
47334 /* OpenACC 2.0:
47335 # pragma acc loop oacc-loop-clause[optseq] new-line
47336 structured-block */
47338 #define OACC_LOOP_CLAUSE_MASK \
47339 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
47340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
47341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
47342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
47343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
47344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
47345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
47346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
47347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
47348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
47350 static tree
47353 {
47363 {
47369 }
47376 /* Later processing of combined acc loop constructs gets confused
47377 by an extra level of empty nested BIND_EXPRs, so flatten them. */
47386 }
47388 /* OpenACC 2.0:
47389 # pragma acc kernels oacc-kernels-clause[optseq] new-line
47390 structured-block
47392 or
47394 # pragma acc parallel oacc-parallel-clause[optseq] new-line
47395 structured-block
47397 OpenACC 2.6:
47399 # pragma acc serial oacc-serial-clause[optseq] new-line
47400 */
47402 #define OACC_KERNELS_CLAUSE_MASK \
47403 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
47404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
47405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
47406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
47410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
47411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
47413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
47414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
47415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
47416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
47417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
47418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
47420 #define OACC_PARALLEL_CLAUSE_MASK \
47421 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
47422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
47423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
47424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
47428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
47429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
47430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
47432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
47433 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
47434 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
47435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
47436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
47437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
47438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
47439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
47441 #define OACC_SERIAL_CLAUSE_MASK \
47442 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
47443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
47444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
47445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
47446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
47447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
47448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
47449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
47450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
47452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
47453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
47454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
47455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
47456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
47457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
47459 static tree
47462 {
47463 omp_clause_mask mask;
47466 {
47484 }
47487 {
47491 {
47494 tree clauses;
47499 }
47500 }
47511 }
47513 /* OpenACC 2.0:
47514 # pragma acc update oacc-update-clause[optseq] new-line
47515 */
47517 #define OACC_UPDATE_CLAUSE_MASK \
47518 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
47519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
47520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
47521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
47522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
47523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
47524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
47526 static tree
47528 {
47535 {
47537 "%<#pragma acc update%> must contain at least one "
47540 }
47548 }
47550 /* OpenACC 2.0:
47551 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
47553 LOC is the location of the #pragma token.
47554 */
47556 #define OACC_WAIT_CLAUSE_MASK \
47557 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
47559 static tree
47561 {
47575 }
47577 /* OpenMP 4.0:
47578 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
47580 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
47581 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
47582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
47583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
47584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
47585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
47586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
47588 static void
47592 {
47594 cp_omp_declare_simd_data data;
47596 {
47604 /* It is safe to take the address of a local variable; it will only be
47605 used while this scope is live. */
47607 }
47609 {
47611 "%<#pragma omp declare %s%> followed by "
47616 }
47618 /* Store away all pragma tokens. */
47627 {
47631 {
47644 }
47649 "%<#pragma omp declare %s%> not immediately followed by "
47654 }
47655 }
47657 /* OpenMP 5.0:
47659 trait-selector:
47660 trait-selector-name[([trait-score:]trait-property[,trait-property[,...]])]
47662 trait-score:
47663 score(score-expression)
47665 Note that this function returns a list of trait selectors for the
47666 trait-selector-set SET. */
47668 static tree
47671 {
47673 do
47674 {
47675 tree selector;
47679 else
47680 {
47683 }
47685 enum omp_ts_code sel
47689 {
47690 /* Per the spec, "Implementations can ignore specified selectors
47691 that are not those described in this section"; however, we
47692 must record such selectors because they cause match failures. */
47694 OPT_Wopenmp,
47704 {
47707 }
47708 else
47710 }
47718 tree t;
47721 {
47723 {
47727 }
47729 matching_parens parens;
47736 {
47743 {
47747 matching_parens parens2;
47756 "%<score%> cannot be specified in traits "
47760 {
47771 else
47773 }
47774 }
47775 else
47779 }
47782 {
47786 {
47790 properties);
47791 }
47792 else
47793 {
47796 }
47799 do
47800 {
47805 {
47808 }
47813 else
47814 {
47818 }
47824 else
47826 }
47830 /* FIXME: this is bogus, the expression need
47831 not be constant. */
47834 {
47841 else
47843 properties);
47844 }
47845 else
47850 {
47852 {
47854 "selector may not be specified in "
47857 }
47858 properties
47860 OMP_DECLARE_SIMD_CLAUSE_MASK,
47862 }
47864 {
47865 /* FIXME: The "requires" selector was added in OpenMP 5.1.
47866 Currently only the now-deprecated syntax
47867 from OpenMP 5.0 is supported. */
47871 }
47872 else
47877 }
47883 }
47887 {
47890 }
47896 else
47898 }
47902 }
47904 /* OpenMP 5.0:
47906 trait-set-selector[,trait-set-selector[,...]]
47908 trait-set-selector:
47909 trait-set-selector-name = { trait-selector[, trait-selector[, ...]] }
47911 trait-set-selector-name:
47912 constructor
47913 device
47914 implementation
47915 user */
47917 static tree
47920 {
47922 do
47923 {
47926 setp
47931 {
47934 }
47941 matching_braces braces;
47945 tree selectors
47948 {
47951 }
47959 else
47961 }
47967 }
47969 /* Assumption clauses:
47970 OpenMP 5.1
47971 absent (directive-name-list)
47972 contains (directive-name-list)
47973 holds (expression)
47974 no_openmp
47975 no_openmp_routines
47976 no_parallelism */
47978 static void
47981 {
47996 {
48009 {
48014 }
48016 {
48021 }
48023 {
48028 }
48030 {
48032 matching_parens parens;
48034 {
48046 }
48047 }
48049 {
48051 matching_parens parens;
48053 {
48054 do
48055 {
48058 location_t dloc
48061 {
48062 tree id;
48067 CPP_KEYWORD))
48068 {
48069 enum rid rid
48073 }
48074 else
48077 }
48080 else
48081 {
48094 else
48095 {
48100 "mentioned in both %<absent%> and "
48108 ? &absent_head
48111 "mentioned multiple times in %qs "
48118 }
48121 }
48124 else
48126 }
48133 }
48134 }
48136 {
48143 }
48144 else
48145 {
48149 }
48150 }
48152 }
48154 /* OpenMP 5.1
48155 # pragma omp assume clauses[optseq] new-line */
48157 static void
48159 {
48162 }
48164 /* OpenMP 5.1
48165 # pragma omp assumes clauses[optseq] new-line */
48167 static bool
48169 {
48172 }
48174 /* Finalize #pragma omp declare variant after a fndecl has been parsed, and put
48175 that into "omp declare variant base" attribute. */
48177 static tree
48179 tree attrs)
48180 {
48181 matching_parens parens;
48183 {
48184 fail:
48187 }
48192 cp_expr varid
48200 tree variant;
48207 else
48208 {
48209 tree ambiguous_decls;
48217 }
48221 {
48223 variant
48231 }
48246 {
48249 }
48261 {
48263 match_loc);
48272 }
48277 }
48280 /* Finalize #pragma omp declare simd clauses after direct declarator has
48281 been parsed, and put that into "omp declare simd" attribute. */
48283 static tree
48285 {
48291 {
48296 }
48301 {
48312 {
48315 pragma_tok);
48323 }
48324 else
48325 {
48327 attrs
48329 }
48331 }
48335 {
48341 {
48343 {
48350 {
48358 else
48361 }
48367 {
48369 "unknown OpenMP directive name in "
48374 }
48378 {
48380 "OpenMP directive other than %<declare simd%> "
48381 "or %<declare variant%> appertains to a "
48384 }
48387 {
48389 "mixing OpenMP directives with attribute and "
48392 }
48397 {
48400 }
48402 cp_token tok = {};
48410 tok = {};
48415 tok = {};
48427 /* Move the current source position to that of the first token
48428 in the new lexer. */
48438 {
48446 pragma_tok);
48450 cl);
48455 }
48456 else
48457 {
48459 attrs
48461 attrs);
48462 }
48465 }
48467 }
48468 else
48470 }
48476 }
48478 /* D should be DEFERRED_PARSE from omp::decl attribute. If it contains
48479 a threadprivate, groupprivate, allocate or declare target directive,
48480 return true and parse it for DECL. */
48482 bool
48484 {
48490 {
48498 else
48501 }
48507 {
48509 "unknown OpenMP directive name in "
48512 }
48514 /* && dir->id != PRAGMA_OMP_GROUPPRIVATE */
48528 cp_token tok = {};
48536 tok = {};
48541 tok = {};
48553 /* Move the current source position to that of the first token in the
48554 new lexer. */
48559 }
48561 /* Helper for cp_parser_omp_declare_target, handle one to or link clause
48562 on #pragma omp declare target. Return false if errors were reported. */
48564 static bool
48567 {
48570 tree id;
48572 {
48575 }
48576 else
48579 {
48582 "%qD specified both in declare target %<link%> and %qs"
48584 else
48586 "%qD specified both in declare target %<link%> and "
48589 }
48591 {
48598 {
48601 {
48605 }
48606 }
48607 }
48611 {
48615 {
48618 }
48619 }
48621 {
48625 {
48628 }
48629 }
48631 {
48635 {
48639 }
48640 }
48642 }
48644 /* OpenMP 4.0:
48645 # pragma omp declare target new-line
48646 declarations and definitions
48647 # pragma omp end declare target new-line
48649 OpenMP 4.5:
48650 # pragma omp declare target ( extended-list ) new-line
48652 # pragma omp declare target declare-target-clauses[seq] new-line */
48654 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
48655 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
48656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ENTER) \
48657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
48658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE) \
48659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INDIRECT))
48661 static void
48663 {
48671 clauses
48676 {
48678 clauses);
48681 }
48682 else
48683 {
48684 cp_omp_declare_target_attr a
48689 }
48691 {
48696 }
48698 {
48713 }
48719 "%<device_type%> clause must specify 'any' when used with "
48721 }
48723 /* OpenMP 5.1
48724 # pragma omp begin assumes clauses[optseq] new-line
48726 # pragma omp begin declare target clauses[optseq] new-line */
48728 #define OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK \
48729 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE) \
48730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INDIRECT))
48732 static void
48734 {
48738 {
48741 }
48743 {
48747 {
48750 }
48752 {
48754 tree clauses
48756 OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK,
48758 pragma_tok);
48762 {
48767 }
48768 cp_omp_declare_target_attr a
48771 }
48772 else
48773 {
48776 }
48777 }
48779 {
48784 }
48785 else
48786 {
48789 }
48790 }
48792 /* OpenMP 4.0:
48793 # pragma omp end declare target new-line
48795 OpenMP 5.1:
48796 # pragma omp end assumes new-line */
48798 static void
48800 {
48804 {
48807 }
48809 {
48813 {
48816 }
48819 else
48820 {
48824 }
48828 "%<#pragma omp end declare target%> without corresponding "
48829 "%<#pragma omp declare target%> or "
48831 else
48832 {
48833 cp_omp_declare_target_attr
48836 {
48839 "%qs in attribute syntax terminated "
48844 else
48846 "%qs in pragma syntax terminated "
48851 }
48852 }
48853 }
48855 {
48862 else
48863 {
48864 cp_omp_begin_assumes_data
48867 {
48870 "%qs in attribute syntax terminated "
48873 else
48875 "%qs in pragma syntax terminated "
48878 }
48879 }
48880 }
48881 else
48882 {
48886 }
48887 }
48889 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
48890 expression and optional initializer clause of
48891 #pragma omp declare reduction. We store the expression(s) as
48892 either 3, 6 or 7 special statements inside of the artificial function's
48893 body. The first two statements are DECL_EXPRs for the artificial
48894 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
48895 expression that uses those variables.
48896 If there was any INITIALIZER clause, this is followed by further statements,
48897 the fourth and fifth statements are DECL_EXPRs for the artificial
48898 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
48899 constructor variant (first token after open paren is not omp_priv),
48900 then the sixth statement is a statement with the function call expression
48901 that uses the OMP_PRIV and optionally OMP_ORIG variable.
48902 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
48903 to initialize the OMP_PRIV artificial variable and there is seventh
48904 statement, a DECL_EXPR of the OMP_PRIV statement again. */
48906 static bool
48908 {
48920 tree combiner;
48941 {
48944 }
48947 {
48949 matching_parens parens;
48955 {
48958 }
48974 {
48978 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
48982 == CPP_CLOSE_PAREN
48985 {
48989 }
48995 }
48996 else
48997 {
48999 /* Don't create location wrapper nodes here. */
49000 auto_suppress_location_wrappers sentinel;
49015 {
49020 }
49022 tree arg;
49035 }
49048 }
49052 UNKNOWN_LOCATION);
49055 }
49057 /* OpenMP 4.0
49058 #pragma omp declare reduction (reduction-id : typename-list : expression) \
49059 initializer-clause[opt] new-line
49061 initializer-clause:
49062 initializer (omp_priv initializer)
49063 initializer (function-name (argument-list)) */
49065 static void
49068 {
49078 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
49085 {
49117 }
49129 /* Types may not be defined in declare reduction type list. */
49132 parser->type_definition_forbidden_message
49138 saved_colon_doesnt_start_class_def_p
49143 {
49147 ;
49165 else
49170 else
49172 }
49174 /* Restore the saved message. */
49177 parser->colon_doesnt_start_class_def_p
49182 {
49183 fail:
49186 }
49192 {
49193 tree fntype
49196 NULL_TREE);
49213 {
49217 }
49223 {
49226 }
49228 {
49230 {
49236 }
49243 }
49244 else
49245 {
49248 /* We should never meet a matched duplicate decl. */
49250 }
49255 else
49258 {
49261 }
49269 else
49270 {
49274 }
49279 {
49287 }
49295 }
49299 done:
49300 /* Free any declarators allocated. */
49302 }
49304 /* OpenMP 4.0
49305 #pragma omp declare simd declare-simd-clauses[optseq] new-line
49306 #pragma omp declare reduction (reduction-id : typename-list : expression) \
49307 initializer-clause[opt] new-line
49308 #pragma omp declare target new-line
49310 OpenMP 5.0
49311 #pragma omp declare variant (identifier) match (context-selector) */
49313 static bool
49316 {
49318 {
49323 {
49328 }
49330 {
49335 }
49338 {
49341 context);
49343 }
49345 {
49348 }
49350 {
49354 }
49355 }
49360 }
49362 /* OpenMP 5.0
49363 #pragma omp requires clauses[optseq] new-line */
49365 static bool
49367 {
49372 {
49378 {
49393 {
49396 matching_parens parens;
49398 {
49400 {
49405 this_req
49408 this_req
49411 this_req
49414 this_req
49417 this_req
49419 }
49421 {
49423 "expected %<acq_rel%>, %<acquire%>, "
49426 {
49433 CPP_CLOSE_PAREN))
49436 }
49437 }
49438 else
49445 /*consume_paren=*/
49449 {
49452 }
49453 }
49455 }
49456 else
49457 {
49459 "%<unified_shared_memory%>, "
49460 "%<dynamic_allocators%>, "
49461 "%<reverse_offload%> "
49465 }
49469 {
49471 {
49478 }
49480 {
49484 }
49487 {
49490 this_req
49492 (omp_requires_mask
49494 }
49498 "lexically after first %<atomic%> construct "
49501 omp_requires_mask
49504 }
49505 }
49507 }
49513 }
49516 /* OpenMP 5.1:
49517 #pragma omp nothing new-line */
49519 static void
49521 {
49523 }
49526 /* OpenMP 5.1
49527 #pragma omp error clauses[optseq] new-line */
49529 static bool
49532 {
49540 {
49553 };
49561 {
49564 }
49566 {
49571 }
49575 matching_parens parens;
49577 {
49579 {
49583 else
49585 tf_warning_or_error,
49586 LOOKUP_NORMAL);
49587 }
49588 else
49589 {
49591 {
49599 }
49601 {
49606 {
49613 CPP_CLOSE_PAREN))
49616 }
49617 }
49618 else
49620 }
49626 /*consume_paren=*/
49630 {
49632 {
49635 }
49636 else
49638 }
49640 {
49642 {
49645 }
49646 else
49648 }
49649 }
49650 else
49652 }
49662 {
49664 {
49668 }
49669 tree fndecl
49678 }
49685 {
49689 }
49693 else
49697 }
49699 /* OpenMP 4.5:
49700 #pragma omp taskloop taskloop-clause[optseq] new-line
49701 for-loop
49703 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
49704 for-loop */
49706 #define OMP_TASKLOOP_CLAUSE_MASK \
49707 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
49708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
49709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
49710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
49711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
49712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
49713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
49714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
49715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
49716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
49717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
49718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
49719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
49720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
49721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
49722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
49723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
49725 static tree
49729 {
49736 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
49737 clause. */
49742 {
49747 {
49771 }
49772 }
49774 {
49777 }
49782 {
49785 }
49792 if_p);
49798 }
49801 /* OpenACC 2.0:
49802 # pragma acc routine oacc-routine-clause[optseq] new-line
49803 function-definition
49805 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
49806 */
49808 #define OACC_ROUTINE_CLAUSE_MASK \
49809 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
49810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
49811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
49812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
49813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NOHOST) )
49815 /* Parse the OpenACC routine pragma. This has an optional '( name )'
49816 component, which must resolve to a declared namespace-scope
49817 function. The clauses are either processed directly (for a named
49818 function), or defered until the immediatley following declaration
49819 is parsed. */
49821 static void
49824 {
49826 /* The checking for "another pragma following this one" in the "no optional
49827 '( name )'" case makes sure that we dont re-enter. */
49830 cp_oacc_routine_data data;
49836 /* It is safe to take the address of a local variable; it will only be
49837 used while this scope is live. */
49840 /* Look for optional '( name )'. */
49842 {
49843 matching_parens parens;
49846 /* We parse the name as an id-expression. If it resolves to
49847 anything other than a non-overloaded function at namespace
49848 scope, it's an error. */
49864 {
49868 }
49870 data.clauses
49874 /* The clauses are in reverse order; fix that to make later diagnostic
49875 emission easier. */
49881 {
49886 }
49888 /* Perhaps we should use the same rule as declarations in different
49889 namespaces? */
49891 {
49896 }
49899 {
49903 }
49907 }
49909 {
49910 /* Store away all pragma tokens. */
49918 /* Emit a helpful diagnostic if there's another pragma following this
49919 one. */
49921 {
49924 /* ..., and then just keep going. */
49926 }
49928 /* We only have to consider the pragma_external case here. */
49933 else
49936 }
49937 }
49939 /* Finalize #pragma acc routine clauses after direct declarator has
49940 been parsed. */
49942 static tree
49944 {
49949 {
49951 "%<#pragma acc routine%> not immediately followed by "
49954 }
49970 /* The clauses are in reverse order; fix that to make later diagnostic
49971 emission easier. */
49974 /* Later, cp_finalize_oacc_routine will process the clauses. */
49978 }
49980 /* Apply any saved OpenACC routine clauses to a just-parsed
49981 declaration. */
49983 static void
49985 {
49987 {
49988 /* Keep going if we're in error reporting mode. */
49994 {
49996 {
49998 "%<#pragma acc routine%> not immediately followed by"
50002 }
50006 }
50008 int compatible
50013 {
50016 }
50018 {
50019 }
50020 else
50021 {
50023 {
50032 }
50034 /* Set the routine's level of parallelism. */
50038 /* Add an "omp declare target" attribute. */
50043 }
50044 }
50045 }
50047 /* Main entry point to OpenMP statement pragmas. */
50049 static void
50051 {
50052 tree stmt;
50057 {
50085 if_p);
50105 if_p);
50110 if_p);
50115 if_p);
50120 if_p);
50125 if_p);
50130 if_p);
50142 if_p);
50156 if_p);
50161 if_p);
50168 }
50171 }
50172 \f
50173 /* Transactional Memory parsing routines. */
50175 /* Parse a transaction attribute.
50177 txn-attribute:
50178 attribute
50179 [ [ identifier ] ]
50181 We use this instead of cp_parser_attributes_opt for transactions to avoid
50182 the pedwarn in C++98 mode. */
50184 static tree
50186 {
50201 {
50205 /* For keywords, use the canonical spelling,
50206 not the parsed identifier. */
50210 }
50211 else
50215 error1:
50218 }
50220 /* Parse a __transaction_atomic or __transaction_relaxed statement.
50222 transaction-statement:
50223 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
50224 compound-statement
50225 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
50226 */
50228 static tree
50230 {
50241 else
50242 {
50246 }
50248 /* Parse a noexcept specification. */
50252 {
50253 /* cancel-and-throw is unimplemented. */
50256 }
50257 else
50259 CP_PARSER_FLAGS_NONE,
50264 /* Keep track if we're in the lexical scope of an outer transaction. */
50276 }
50278 /* Parse a __transaction_atomic or __transaction_relaxed expression.
50280 transaction-expression:
50281 __transaction_atomic txn-noexcept-spec[opt] ( expression )
50282 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
50283 */
50285 static tree
50287 {
50300 keyword == RID_TRANSACTION_RELAXED
50314 /* Set this early. This might mean that we allow transaction_cancel in
50315 an expression that we find out later actually has to be a constexpr.
50316 However, we expect that cxx_constant_value will be able to deal with
50317 this; also, if the noexcept has no constexpr, then what we parse next
50318 really is a transaction's body. */
50321 /* Parse a noexcept specification. */
50323 CP_PARSER_FLAGS_NONE,
50330 {
50331 matching_parens parens;
50338 }
50339 else
50340 {
50341 /* The only expression that is available got parsed for the noexcept
50342 already. noexcept is true then. */
50345 }
50354 }
50356 /* Parse a function-transaction-block.
50358 function-transaction-block:
50359 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
50360 function-body
50361 __transaction_atomic txn-attribute[opt] function-try-block
50362 __transaction_relaxed ctor-initializer[opt] function-body
50363 __transaction_relaxed function-try-block
50364 */
50366 static void
50368 {
50383 else
50384 {
50388 }
50396 else
50397 cp_parser_ctor_initializer_opt_and_function_body
50403 }
50405 /* Parse a __transaction_cancel statement.
50407 cancel-statement:
50408 __transaction_cancel txn-attribute[opt] ;
50409 __transaction_cancel txn-attribute[opt] throw-expression ;
50411 ??? Cancel and throw is not yet implemented. */
50413 static tree
50415 {
50421 RT_TRANSACTION_CANCEL);
50428 /* ??? Parse cancel-and-throw here. */
50433 {
50437 }
50439 {
50443 }
50445 {
50448 {
50454 }
50455 }
50457 {
50461 }
50467 }
50468 \f
50470 /* Special handling for the first token or line in the file. The first
50471 thing in the file might be #pragma GCC pch_preprocess, which loads a
50472 PCH file, which is a GC collection point. So we need to handle this
50473 first pragma without benefit of an existing lexer structure.
50475 Always returns one token to the caller in *FIRST_TOKEN. This is
50476 either the true first token of the file, or the first token after
50477 the initial pragma. */
50479 static void
50481 {
50489 {
50493 }
50495 /* Skip to the end of the pragma. */
50497 {
50500 do
50503 }
50505 /* Now actually load the PCH file. */
50509 /* Read one more token to return to our caller. We have to do this
50510 after reading the PCH file in, since its pointers have to be
50511 live. */
50513 }
50515 /* Parse a pragma GCC ivdep. */
50517 static bool
50519 {
50522 }
50524 /* Parse a pragma GCC unroll. */
50526 static tree
50528 {
50534 }
50536 /* Parse a pragma GCC novector. */
50538 static bool
50540 {
50543 }
50545 /* Normal parsing of a pragma token. Here we can (and must) use the
50546 regular lexer. */
50548 static bool
50550 {
50553 tree stmt;
50565 {
50571 }
50575 {
50583 {
50594 }
50599 {
50610 }
50615 {
50626 }
50631 {
50643 }
50648 {
50660 }
50665 {
50677 }
50696 {
50702 }
50710 {
50716 }
50724 {
50729 }
50735 {
50741 }
50749 {
50755 }
50797 {
50799 "%<#pragma omp requires%> may only be used at file or "
50803 }
50808 {
50810 "%<#pragma omp assumes%> may only be used at file or "
50814 }
50850 "%<#pragma omp scan%> may only be used in "
50856 "%<#pragma omp section%> may only be used in "
50863 {
50870 {
50882 }
50885 {
50888 pragma_str);
50890 }
50894 do
50895 {
50897 {
50899 {
50904 }
50906 {
50911 }
50913 {
50918 }
50922 }
50925 }
50932 {
50935 }
50938 }
50945 bad_stmt:
50948 }
50952 }
50954 /* Helper for pragma_lex in preprocess-only mode; in this mode, we have not
50955 populated the lexer with any tokens (the tokens rather being read by
50956 c-ppoutput.c's machinery), so we need to read enough tokens now to handle
50957 a pragma. */
50958 static void
50960 {
50965 /* Read the rest of the tokens comprising the pragma line. */
50967 do
50968 {
50975 }
50977 /* The interface the pragma parsers have to the lexer. */
50979 enum cpp_ttype
50981 {
50997 else
50998 {
51002 }
51005 }
51007 void
51009 {
51010 /* We have already read all the tokens, so we just need to discard
51011 them here. */
51015 }
51017 \f
51018 /* External interface. */
51020 /* Parse one entire translation unit. */
51022 void
51024 {
51032 /* cp_lexer_new_main is called before doing any GC allocation
51033 because tokenization might load a PCH file. */
51042 }
51044 /* Create an identifier for a generic parameter type (a synthesized
51045 template parameter implied by `auto' or a concept identifier). */
51048 static tree
51050 {
51054 }
51056 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
51057 (creating a new template parameter list if necessary). Returns the newly
51058 created template type parm. */
51060 static tree
51062 {
51063 /* A requires-clause is not a function and cannot have placeholders. */
51065 {
51068 }
51072 /* We are either continuing a function template that already contains implicit
51073 template parameters, creating a new fully-implicit function template, or
51074 extending an existing explicit function template with implicit template
51075 parameters. */
51083 {
51087 }
51088 else
51089 {
51090 /* Roll back to the existing template parameter scope (in the case of
51091 extending an explicit function template) or introduce a new template
51092 parameter scope ahead of the function parameter scope (or class scope
51093 in the case of out-of-line member definitions). The function scope is
51094 added back after template parameter synthesis below. */
51099 {
51102 }
51104 {
51105 /* If not defining a class, then any class scope is a scope level in
51106 an out-of-line member definition. In this case simply wind back
51107 beyond the first such scope to inject the template parameter list.
51108 Otherwise wind back to the class being defined. The latter can
51109 occur in class member friend declarations such as:
51111 class A {
51112 void foo (auto);
51113 };
51114 class B {
51115 friend void A::foo (auto);
51116 };
51118 The template parameter list synthesized for the friend declaration
51119 must be injected in the scope of 'B'. This can also occur in
51120 erroneous cases such as:
51122 struct A {
51123 struct B {
51124 void foo (auto);
51125 };
51126 void B::foo (auto) {}
51127 };
51129 Here the attempted definition of 'B::foo' within 'A' is ill-formed
51130 but, nevertheless, the template parameter list synthesized for the
51131 declarator should be injected into the scope of 'A' as if the
51132 ill-formed template was specified explicitly. */
51135 {
51138 }
51139 }
51145 {
51146 /* Introduce a new template parameter list for implicit template
51147 parameters. */
51151 parser->implicit_template_scope
51158 }
51159 else
51160 {
51161 /* Synthesize implicit template parameters at the end of the explicit
51162 template parameter list. */
51169 parser->implicit_template_parms
51171 }
51172 }
51174 /* Synthesize a new template parameter and track the current template
51175 parameter chain with implicit_template_parms. */
51181 /* Synthesize the type template parameter. */
51189 /* Attach the constraint to the parm before processing. */
51192 tree new_parm
51194 input_location,
51195 node,
51198 // Process_template_parm returns the list of parms, and
51199 // parser->implicit_template_parms holds the final node of the parm
51200 // list. We really want to manipulate the newly appended element.
51207 // Record the last implicit parm node
51210 /* Mark the synthetic declaration "virtual". This is used when
51211 comparing template-heads to determine if whether an abbreviated
51212 function template is equivalent to an explicit template.
51214 Note that DECL_ARTIFICIAL is used elsewhere for template
51215 parameters. */
51221 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
51224 /* If creating a fully implicit function template, start the new implicit
51225 template parameter list with this synthesized type, otherwise grow the
51226 current template parameter list. */
51229 {
51235 }
51236 else
51237 {
51242 }
51244 /* If the new parameter was constrained, we need to add that to the
51245 constraints in the template parameter list. */
51247 {
51251 }
51256 }
51258 /* Finish the declaration of a fully implicit function template. Such a
51259 template has no explicit template parameter list so has not been through the
51260 normal template head and tail processing. synthesize_implicit_template_parm
51261 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
51262 provided if the declaration is a class member such that its template
51263 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
51264 form is returned. Otherwise NULL_TREE is returned. */
51266 static tree
51268 {
51273 {
51277 }
51289 }
51291 /* Like finish_fully_implicit_template, but to be used in error
51292 recovery, rearranging scopes so that we restore the state we had
51293 before synthesize_implicit_template_parm inserted the implement
51294 template parms scope. */
51296 static void
51298 {
51303 {
51312 }
51313 else
51319 }
51321 /* Helper function for diagnostics that have complained about things
51322 being used with 'extern "C"' linkage.
51324 Attempt to issue a note showing where the 'extern "C"' linkage began. */
51326 void
51328 {
51332 }