| blob | 7811d582b072a66e683dcf547e4437a20b5503fa |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2023 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_MEMORY
52 \f
53 /* The lexer. */
55 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
56 and c-lex.cc) and the C++ parser. */
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
185 RT_CO_YIELD /* co_yield */
186 };
188 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
189 reverting it on destruction. */
191 class type_id_in_expr_sentinel
192 {
202 };
204 /* Prototypes. */
210 static void cp_lexer_destroy
212 static int cp_lexer_saving_tokens
216 static void cp_lexer_get_preprocessor_token
224 static bool cp_lexer_next_token_is_not
226 static bool cp_lexer_next_token_is_keyword
230 static void cp_lexer_purge_token
232 static void cp_lexer_purge_tokens_after
234 static void cp_lexer_save_tokens
236 static void cp_lexer_commit_tokens
238 static void cp_lexer_rollback_tokens
240 static void cp_lexer_print_token
244 static void cp_lexer_start_debugging
246 static void cp_lexer_stop_debugging
251 static tree cp_parser_late_noexcept_specifier
253 static void noexcept_override_late_checks
256 static void cp_parser_initial_pragma
259 static bool cp_parser_omp_declare_reduction_exprs
261 static void cp_finalize_oacc_routine
264 static void check_omp_intervening_code
268 /* Manifest constants. */
269 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
270 #define CP_SAVED_TOKEN_STACK 5
272 /* Variables. */
274 /* The stream to which debugging output should be written. */
277 /* Nonzero if we are parsing an unevaluated operand: an operand to
278 sizeof, typeof, or alignof. */
281 /* Dump up to NUM tokens in BUFFER to FILE starting with token
282 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
283 first token in BUFFER. If NUM is 0, dump all the tokens. If
284 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
285 highlighted by surrounding it in [[ ]]. */
287 static void
291 {
308 {
311 }
316 {
323 nprinted++;
333 {
343 }
344 }
347 {
350 }
353 }
356 /* Dump all tokens in BUFFER to stderr. */
358 void
360 {
362 }
364 DEBUG_FUNCTION void
366 {
368 }
370 DEBUG_FUNCTION void
372 {
375 else
377 }
380 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
381 description for T. */
383 static void
385 {
387 {
390 }
391 }
394 /* Dump parser context C to FILE. */
396 static void
398 {
403 }
406 /* Print the stack of parsing contexts to FILE starting with FIRST. */
408 static void
410 {
416 {
419 }
420 }
423 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
425 static void
427 {
430 }
433 /* Print an unparsed function entry UF to FILE. */
435 static void
437 {
440 tree fn;
445 i++)
446 {
452 }
457 {
460 }
466 {
469 }
471 }
474 /* Print the stack of unparsed member functions S to FILE. */
476 static void
479 {
485 {
488 }
489 }
492 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
493 the given PARSER. If FILE is NULL, the output is printed on stderr. */
495 static void
497 {
509 next_token);
510 }
513 /* Dump debugging information for the given PARSER. If FILE is NULL,
514 the output is printed on stderr. */
516 void
518 {
521 expanded_location eloc;
586 parser->type_definition_forbidden_message_arg
602 }
604 DEBUG_FUNCTION void
606 {
608 }
610 DEBUG_FUNCTION void
612 {
615 else
617 }
619 /* Allocate memory for a new lexer object and return it. */
623 {
624 /* Allocate the memory. */
627 /* Initially we are not debugging. */
632 /* Create the buffer. */
636 }
638 /* Return TRUE if token is the start of a module declaration that will be
639 terminated by a CPP_PRAGMA_EOL token. */
642 {
646 }
648 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
649 PRAGMA_NONE. */
651 static enum pragma_kind
653 {
656 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
658 }
660 /* Handle early pragmas such as #pragma GCC diagnostic, which needs to be done
661 during preprocessing for the case of preprocessing-related diagnostics. This
662 is called immediately after pushing the CPP_PRAGMA_EOL token onto
663 lexer->buffer. */
665 static void
667 {
671 /* Back up to the start of the pragma so pragma_lex () can parse it when
672 c-pragma lib asks it to. */
676 {
681 }
687 /* Dispatch it. */
688 const unsigned int id
693 /* Reset to normal state. */
695 }
697 /* The parser. */
701 /* Create a new main C++ lexer, the lexer that gets tokens from the
702 preprocessor, and also create the main parser. */
706 {
707 cp_token token;
709 /* It's possible that parsing the first pragma will load a PCH file,
710 which is a GC collection point. So we have to do that before
711 allocating any memory. */
717 /* Put the first token in the buffer. */
724 /* Create the parser now, so we can use it to handle early pragmas. */
728 /* Get the remaining tokens from the preprocessor. */
730 {
732 /* Process the previous token. */
736 /* Check for early pragmas that need to be handled now. */
742 }
750 {
751 /* Set the EOF token's location to be the just after the previous
752 token's range. That way 'at-eof' diagnostics point at something
753 meaninful. */
757 }
762 /* Subsequent preprocessor diagnostics should use compiler
763 diagnostic functions to get the compiler source location. */
770 }
772 /* Create a lexer and parser to be used during preprocess-only mode.
773 This will be filled with tokens to parse when needed by pragma_lex (). */
774 void
776 {
779 }
781 /* Create a new lexer whose token stream is primed with the tokens in
782 CACHE. When these tokens are exhausted, no new tokens will be read. */
786 {
791 /* We do not own the buffer. */
794 /* Insert an EOF token. */
805 /* Initially we are not debugging. */
811 }
813 /* Frees all resources associated with LEXER. */
815 static void
817 {
820 else
821 {
822 /* Restore the token we overwrite with EOF. */
825 }
828 }
830 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
831 be used. The point of this flag is to help the compiler to fold away calls
832 to cp_lexer_debugging_p within this source file at compile time, when the
833 lexer is not being debugged. */
835 #define LEXER_DEBUGGING_ENABLED_P false
837 /* Returns nonzero if debugging information should be output. */
841 {
846 }
851 {
853 }
857 {
859 }
863 {
865 }
869 {
871 }
875 {
878 /* Skip past purged tokens. */
880 {
882 tp--;
883 }
886 }
888 /* Same as above, but return NULL when the lexer doesn't own the token
889 buffer or if the next_token is at the start of the token
890 vector or if all previous tokens are purged. */
894 {
897 {
900 /* Skip past purged tokens. */
902 {
905 tp--;
906 }
908 }
911 }
913 /* Overload for make_location, taking the lexer to mean the location of the
914 previous token. */
918 {
921 }
923 /* Overload for make_location taking tokens instead of locations. */
927 {
929 }
931 /* nonzero if we are presently saving tokens. */
935 {
937 }
939 /* Store the next token from the preprocessor in *TOKEN. Return true
940 if we reach EOF. If LEXER is NULL, assume we are handling an
941 initial #pragma pch_preprocess, and thus want the lexer to return
942 processed strings.
944 Diagnostics issued from this function must have their controlling option (if
945 any) in c.opt annotated as a libcpp option via the CppReason property. */
947 static void
949 {
952 /* Get a new token from the preprocessor. */
953 token->type
955 flags);
960 /* Usually never see a zero, but just in case ... */
963 /* On some systems, some header files are surrounded by an
964 implicit extern "C" block. Set a flag in the token if it
965 comes from such a header. */
970 /* Check to see if this token is a keyword. */
972 {
974 {
975 /* Mark this token as a keyword. */
977 /* Record which keyword. */
979 }
980 else
981 {
985 /* These are outside the CXX11 range. */
989 {
990 /* Warn about the C++11 keyword (but still treat it as
991 an identifier). */
996 /* Clear out the C_RID_CODE so we don't warn about this
997 particular identifier-turned-keyword again. */
999 }
1003 {
1004 /* Warn about the C++20 keyword (but still treat it as
1005 an identifier). */
1010 /* Clear out the C_RID_CODE so we don't warn about this
1011 particular identifier-turned-keyword again. */
1013 }
1016 }
1017 }
1019 {
1020 /* This only happens in Objective-C++; it must be a keyword. */
1023 {
1024 /* Replace 'class' with '@class', 'private' with '@private',
1025 etc. This prevents confusion with the C++ keyword
1026 'class', and makes the tokens consistent with other
1027 Objective-C 'AT' keywords. For example '@class' is
1028 reported as RID_AT_CLASS which is consistent with
1029 '@synchronized', which is reported as
1030 RID_AT_SYNCHRONIZED.
1031 */
1041 }
1042 }
1043 }
1045 /* Update the globals input_location and the input file stack from TOKEN. */
1048 {
1050 }
1052 /* Update the globals input_location and the input file stack from LEXER. */
1055 {
1058 }
1060 /* Return a pointer to the next token in the token stream, but do not
1061 consume it. */
1065 {
1067 {
1071 }
1073 }
1075 /* Return true if the next token has the indicated TYPE. */
1079 {
1081 }
1083 /* Return true if the next token does not have the indicated TYPE. */
1087 {
1089 }
1091 /* Return true if the next token is the indicated KEYWORD. */
1095 {
1097 }
1101 {
1103 }
1107 {
1109 }
1111 /* Return true if KEYWORD can start a decl-specifier. */
1113 bool
1115 {
1117 {
1118 /* auto specifier: storage-class-specifier in C++,
1119 simple-type-specifier in C++0x. */
1121 /* Storage classes. */
1127 /* Elaborated type specifiers. */
1133 /* Simple type specifiers. */
1147 CASE_RID_FLOATN_NX:
1149 /* CV qualifiers. */
1152 /* Function specifiers. */
1155 /* friend/typdef/inline specifiers. */
1159 /* GNU extensions. */
1161 /* C++11 extensions. */
1164 /* C++20 extensions. */
1169 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
1170 case RID_##CODE:
1172 #undef DEFTRAIT_TYPE
1181 }
1182 }
1184 /* Return true if the next token is a keyword for a decl-specifier. */
1186 static bool
1188 {
1193 }
1195 /* Returns TRUE iff the token T begins a decltype type. */
1197 static bool
1199 {
1202 }
1204 /* Returns TRUE iff the next token begins a decltype type. */
1206 static bool
1208 {
1211 }
1213 /* Called when processing a token with tree_check_value; perform or defer the
1214 associated checks and return the value. */
1216 static tree
1218 {
1219 /* Perform any access checks that were deferred. */
1224 {
1230 }
1231 /* Return the stored value. */
1233 }
1235 /* Return a pointer to the Nth token in the token stream. If N is 1,
1236 then this is precisely equivalent to cp_lexer_peek_token (except
1237 that it is not inline). One would like to disallow that case, but
1238 there is one case (cp_parser_nth_token_starts_template_id) where
1239 the caller passes a variable for N and it might be 1. */
1243 {
1246 /* N is 1-based, not zero-based. */
1256 {
1260 }
1263 {
1266 }
1269 }
1271 /* Return the next token, and advance the lexer's next_token pointer
1272 to point to the next non-purged token. */
1276 {
1279 do
1280 {
1283 }
1288 /* Provide debugging output. */
1290 {
1294 }
1297 }
1299 /* Permanently remove the next token from the token stream, and
1300 advance the next_token pointer to refer to the next non-purged
1301 token. */
1303 static void
1305 {
1314 do
1315 tok++;
1318 }
1320 /* Permanently remove all tokens after TOK, up to, but not
1321 including, the token that will be returned next by
1322 cp_lexer_peek_token. */
1324 static void
1326 {
1332 {
1337 }
1338 }
1340 /* Begin saving tokens. All tokens consumed after this point will be
1341 preserved. */
1343 static void
1345 {
1346 /* Provide debugging output. */
1351 }
1353 /* Commit to the portion of the token stream most recently saved. */
1355 static void
1357 {
1358 /* Provide debugging output. */
1363 }
1365 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1366 to the token stream. Stop saving tokens. */
1368 static void
1370 {
1371 /* Provide debugging output. */
1376 }
1378 /* Determines what saved_token_sentinel does when going out of scope. */
1381 STS_COMMIT,
1382 STS_ROLLBACK,
1383 STS_DONOTHING
1384 };
1386 /* RAII wrapper around the above functions, with sanity checking (the token
1387 stream should be the same at the point of instantiation as it is at the
1388 point of destruction).
1390 Creating a variable saves tokens. MODE determines what happens when the
1391 object is destroyed. STS_COMMIT commits tokens (default),
1392 STS_ROLLBACK rolls-back and STS_DONOTHING does nothing. Calling
1393 rollback() will immediately roll-back tokens and set MODE to
1394 STS_DONOTHING. */
1396 struct saved_token_sentinel
1397 {
1400 saved_token_sentinel_mode mode;
1404 {
1407 }
1409 {
1411 cp_lexer_set_source_position_from_token
1414 }
1416 {
1423 }
1424 };
1426 /* Print a representation of the TOKEN on the STREAM. */
1428 static void
1430 {
1431 /* We don't use cpp_type2name here because the parser defines
1432 a few tokens of its own. */
1434 /* cpplib-defined token types */
1435 #define OP(e, s) #e,
1436 #define TK(e, s) #e,
1437 TTYPE_TABLE
1438 #undef OP
1439 #undef TK
1440 /* C++ parser token types - see "Manifest constants", above. */
1444 };
1446 /* For some tokens, print the associated data. */
1448 {
1450 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1451 For example, `struct' is mapped to an INTEGER_CST. */
1454 /* fall through */
1472 /* If we have a name for the token, print it out. Otherwise, we
1473 simply give the numeric code. */
1476 else
1479 }
1480 }
1482 DEBUG_FUNCTION void
1484 {
1487 }
1489 DEBUG_FUNCTION void
1491 {
1494 else
1496 }
1499 /* Start emitting debugging information. */
1501 static void
1503 {
1510 }
1512 /* Stop emitting debugging information. */
1514 static void
1516 {
1523 }
1525 /* Create a new cp_token_cache, representing a range of tokens. */
1529 {
1534 }
1536 /* Diagnose if #pragma omp declare simd isn't followed immediately
1537 by function declaration or definition. */
1541 {
1543 {
1548 }
1549 }
1551 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1552 and put that into "omp declare simd" attribute. */
1556 {
1558 {
1560 {
1563 }
1565 {
1568 }
1569 }
1570 }
1572 /* Similarly, but for use in declaration parsing functions
1573 which call cp_parser_handle_directive_omp_attributes. */
1577 {
1584 "%<declare %s%> directive not immediately followed by "
1588 }
1590 /* Diagnose if #pragma acc routine isn't followed immediately by function
1591 declaration or definition. */
1595 {
1597 {
1599 "%<#pragma acc routine%> not immediately followed by "
1602 }
1603 }
1604 \f
1605 /* Decl-specifiers. */
1607 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1609 static void
1611 {
1613 }
1615 /* Declarators. */
1617 /* Nothing other than the parser should be creating declarators;
1618 declarators are a semi-syntactic representation of C++ entities.
1619 Other parts of the front end that need to create entities (like
1620 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1634 /* An erroneous declarator. */
1637 /* The obstack on which declarators and related data structures are
1638 allocated. */
1641 /* Alloc BYTES from the declarator memory pool. */
1645 {
1647 }
1649 /* Allocate a declarator of the indicated KIND. Clear fields that are
1650 common to all declarators. */
1654 {
1668 }
1670 /* Make a declarator for a generalized identifier. If
1671 QUALIFYING_SCOPE is non-NULL, the identifier is
1672 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1673 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1674 is, if any. */
1679 {
1682 /* It is valid to write:
1684 class C { void f(); };
1685 typedef C D;
1686 void D::f();
1688 The standard is not clear about whether `typedef const C D' is
1689 legal; as of 2002-09-15 the committee is considering that
1690 question. EDG 3.0 allows that syntax. Therefore, we do as
1691 well. */
1706 }
1708 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1709 of modifiers such as const or volatile to apply to the pointer
1710 type, represented as identifiers. ATTRIBUTES represent the attributes that
1711 appertain to the pointer or reference. */
1713 cp_declarator *
1715 tree attributes)
1716 {
1724 {
1728 }
1729 else
1735 }
1737 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1738 represent the attributes that appertain to the pointer or
1739 reference. */
1741 cp_declarator *
1744 {
1752 {
1756 }
1757 else
1763 }
1765 /* Like make_pointer_declarator -- but for a pointer to a non-static
1766 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1767 appertain to the pointer or reference. */
1769 cp_declarator *
1772 tree attributes)
1773 {
1782 {
1785 }
1786 else
1792 }
1794 /* Make a declarator for the function given by TARGET, with the
1795 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1796 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1797 indicates what exceptions can be thrown. STD_ATTRS contains
1798 attributes that appertain to the function type. */
1800 cp_declarator *
1802 tree parms,
1803 cp_cv_quals cv_qualifiers,
1804 cp_virt_specifiers virt_specifiers,
1805 cp_ref_qualifier ref_qualifier,
1806 tree tx_qualifier,
1807 tree exception_specification,
1808 tree late_return_type,
1809 tree requires_clause,
1810 tree std_attrs,
1811 location_t parens_loc)
1812 {
1827 {
1831 }
1832 else
1838 }
1840 /* Make a declarator for an array of BOUNDS elements, each of which is
1841 defined by ELEMENT. */
1843 cp_declarator *
1845 {
1852 {
1856 }
1857 else
1861 }
1863 /* Determine whether the declarator we've seen so far can be a
1864 parameter pack, when followed by an ellipsis. */
1865 static bool
1867 {
1869 /* We already saw an ellipsis. */
1872 /* Search for a declarator name, or any other declarator that goes
1873 after the point where the ellipsis could appear in a parameter
1874 pack. If we find any of these, then this declarator cannot be
1875 made into a parameter pack. */
1878 {
1880 {
1893 }
1894 }
1897 }
1901 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1902 DECLARATOR and DEFAULT_ARGUMENT. */
1904 cp_parameter_declarator *
1907 tree default_argument,
1908 location_t loc,
1910 {
1918 else
1926 }
1928 /* Returns true iff DECLARATOR is a declaration for a function. */
1930 static bool
1932 {
1934 {
1943 }
1945 }
1947 /* The parser. */
1949 /* Overview
1950 --------
1952 A cp_parser parses the token stream as specified by the C++
1953 grammar. Its job is purely parsing, not semantic analysis. For
1954 example, the parser breaks the token stream into declarators,
1955 expressions, statements, and other similar syntactic constructs.
1956 It does not check that the types of the expressions on either side
1957 of an assignment-statement are compatible, or that a function is
1958 not declared with a parameter of type `void'.
1960 The parser invokes routines elsewhere in the compiler to perform
1961 semantic analysis and to build up the abstract syntax tree for the
1962 code processed.
1964 The parser (and the template instantiation code, which is, in a
1965 way, a close relative of parsing) are the only parts of the
1966 compiler that should be calling push_scope and pop_scope, or
1967 related functions. The parser (and template instantiation code)
1968 keeps track of what scope is presently active; everything else
1969 should simply honor that. (The code that generates static
1970 initializers may also need to set the scope, in order to check
1971 access control correctly when emitting the initializers.)
1973 Methodology
1974 -----------
1976 The parser is of the standard recursive-descent variety. Upcoming
1977 tokens in the token stream are examined in order to determine which
1978 production to use when parsing a non-terminal. Some C++ constructs
1979 require arbitrary look ahead to disambiguate. For example, it is
1980 impossible, in the general case, to tell whether a statement is an
1981 expression or declaration without scanning the entire statement.
1982 Therefore, the parser is capable of "parsing tentatively." When the
1983 parser is not sure what construct comes next, it enters this mode.
1984 Then, while we attempt to parse the construct, the parser queues up
1985 error messages, rather than issuing them immediately, and saves the
1986 tokens it consumes. If the construct is parsed successfully, the
1987 parser "commits", i.e., it issues any queued error messages and
1988 the tokens that were being preserved are permanently discarded.
1989 If, however, the construct is not parsed successfully, the parser
1990 rolls back its state completely so that it can resume parsing using
1991 a different alternative.
1993 Future Improvements
1994 -------------------
1996 The performance of the parser could probably be improved substantially.
1997 We could often eliminate the need to parse tentatively by looking ahead
1998 a little bit. In some places, this approach might not entirely eliminate
1999 the need to parse tentatively, but it might still speed up the average
2000 case. */
2002 /* Flags that are passed to some parsing functions. These values can
2003 be bitwise-ored together. */
2005 enum
2006 {
2007 /* No flags. */
2009 /* The construct is optional. If it is not present, then no error
2010 should be issued. */
2012 /* When parsing a type-specifier, treat user-defined type-names
2013 as non-type identifiers. */
2015 /* When parsing a type-specifier, do not try to parse a class-specifier
2016 or enum-specifier. */
2018 /* When parsing a decl-specifier-seq, only allow type-specifier or
2019 constexpr. */
2021 /* When parsing a decl-specifier-seq, only allow mutable, constexpr or
2022 for C++20 consteval or for C++23 static. */
2024 /* When parsing a decl-specifier-seq, allow missing typename. */
2026 /* When parsing of the noexcept-specifier should be delayed. */
2028 /* When parsing a consteval declarator. */
2030 };
2032 /* This type is used for parameters and variables which hold
2033 combinations of the above flags. */
2036 /* The different kinds of declarators we want to parse. */
2038 enum cp_parser_declarator_kind
2039 {
2040 /* We want an abstract declarator. */
2041 CP_PARSER_DECLARATOR_ABSTRACT,
2042 /* We want a named declarator. */
2043 CP_PARSER_DECLARATOR_NAMED,
2044 /* We don't mind, but the name must be an unqualified-id. */
2045 CP_PARSER_DECLARATOR_EITHER
2046 };
2048 /* The precedence values used to parse binary expressions. The minimum value
2049 of PREC must be 1, because zero is reserved to quickly discriminate
2050 binary operators from other tokens. */
2052 enum cp_parser_prec
2053 {
2054 PREC_NOT_OPERATOR,
2055 PREC_LOGICAL_OR_EXPRESSION,
2056 PREC_LOGICAL_AND_EXPRESSION,
2057 PREC_INCLUSIVE_OR_EXPRESSION,
2058 PREC_EXCLUSIVE_OR_EXPRESSION,
2059 PREC_AND_EXPRESSION,
2060 PREC_EQUALITY_EXPRESSION,
2061 PREC_RELATIONAL_EXPRESSION,
2062 PREC_SPACESHIP_EXPRESSION,
2063 PREC_SHIFT_EXPRESSION,
2064 PREC_ADDITIVE_EXPRESSION,
2065 PREC_MULTIPLICATIVE_EXPRESSION,
2066 PREC_PM_EXPRESSION,
2067 NUM_PREC_VALUES = PREC_PM_EXPRESSION
2068 };
2070 /* A mapping from a token type to a corresponding tree node type, with a
2071 precedence value. */
2073 struct cp_parser_binary_operations_map_node
2074 {
2075 /* The token type. */
2077 /* The corresponding tree code. */
2079 /* The precedence of this operator. */
2081 };
2083 struct cp_parser_expression_stack_entry
2084 {
2085 /* Left hand side of the binary operation we are currently
2086 parsing. */
2087 cp_expr lhs;
2088 /* Original tree code for left hand side, if it was a binary
2089 expression itself (used for -Wparentheses). */
2091 /* Tree code for the binary operation we are parsing. */
2093 /* Precedence of the binary operation we are parsing. */
2095 /* Location of the binary operation we are parsing. */
2096 location_t loc;
2097 /* Flags from the operator token. */
2099 };
2101 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
2102 entries because precedence levels on the stack are monotonically
2103 increasing. */
2107 /* Used for parsing OMP for loops.
2109 Some notes on flags used for context:
2110 parser->omp_for_parse_state is non-null anywhere inside the OMP FOR
2111 construct, except for the final-loop-body.
2112 The want_nested_loop flag is true if inside a {} sequence where
2113 a loop-nest (or another {} sequence containing a loop-nest) is expected,
2114 but has not yet been seen. It's false when parsing intervening code
2115 statements or their substatements that cannot contain a loop-nest.
2116 The in_intervening_code flag is true when parsing any intervening code,
2117 including substatements, and whether or not want_nested_loop is true.
2119 And, about error handling:
2120 The saw_intervening_code flag is set if the loop is not perfectly
2121 nested, even in the usual case where this is not an error.
2122 perfect_nesting_fail is set if an error has been diagnosed because an
2123 imperfectly-nested loop was found where a perfectly-nested one is
2124 required (we diagnose this only once).
2125 fail is set if any kind of structural error in the loop nest
2126 has been found and diagnosed.
2127 */
2131 tree pre_body;
2132 tree orig_declv;
2136 location_t for_loc;
2137 releasing_vec init_blockv;
2138 releasing_vec body_blockv;
2139 releasing_vec init_placeholderv;
2140 releasing_vec body_placeholderv;
2148 tree clauses;
2150 tree ordered_cl;
2151 };
2153 /* Prototypes. */
2155 /* Constructors and destructors. */
2160 /* Class variables. */
2164 /* The operator-precedence table used by cp_parser_binary_expression.
2165 Transformed into an associative array (binops_by_token) by
2166 cp_parser_new. */
2201 };
2203 /* The same as binops, but initialized by cp_parser_new so that
2204 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
2205 for speed. */
2208 /* Constructors and destructors. */
2210 /* Construct a new context. The context below this one on the stack
2211 is given by NEXT. */
2215 {
2218 /* Allocate the storage. */
2220 {
2221 /* Pull the first entry from the free list. */
2225 }
2226 else
2229 /* No errors have occurred yet in this context. */
2231 /* If this is not the bottommost context, copy information that we
2232 need from the previous context. */
2234 {
2235 /* If, in the NEXT context, we are parsing an `x->' or `x.'
2236 expression, then we are parsing one in this context, too. */
2238 /* Thread the stack. */
2240 }
2243 }
2245 /* Managing the unparsed function queues. */
2247 #define unparsed_funs_with_default_args \
2248 parser->unparsed_queues->last ().funs_with_default_args
2249 #define unparsed_funs_with_definitions \
2250 parser->unparsed_queues->last ().funs_with_definitions
2251 #define unparsed_nsdmis \
2252 parser->unparsed_queues->last ().nsdmis
2253 #define unparsed_noexcepts \
2254 parser->unparsed_queues->last ().noexcepts
2255 #define unparsed_contracts \
2256 parser->unparsed_queues->last ().contracts
2258 static void
2260 {
2261 cp_unparsed_functions_entry e
2264 }
2266 static void
2268 {
2271 }
2273 /* Prototypes. */
2275 /* Routines to parse various constructs.
2277 Those that return `tree' will return the error_mark_node (rather
2278 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2279 Sometimes, they will return an ordinary node if error-recovery was
2280 attempted, even though a parse error occurred. So, to check
2281 whether or not a parse error occurred, you should always use
2282 cp_parser_error_occurred. If the construct is optional (indicated
2283 either by an `_opt' in the name of the function that does the
2284 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2285 the construct is not present. */
2287 /* Lexical conventions [gram.lex] */
2289 static tree finish_userdef_string_literal
2292 /* Basic concepts [gram.basic] */
2296 /* Expressions [gram.expr] */
2298 static cp_expr cp_parser_primary_expression
2300 static cp_expr cp_parser_id_expression
2302 static cp_expr cp_parser_unqualified_id
2304 static tree cp_parser_nested_name_specifier_opt
2306 static tree cp_parser_nested_name_specifier
2308 static tree cp_parser_qualifying_entity
2310 static cp_expr cp_parser_postfix_expression
2312 static tree cp_parser_postfix_open_square_expression
2314 static tree cp_parser_postfix_dot_deref_expression
2319 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2321 static void cp_parser_pseudo_destructor_name
2323 static cp_expr cp_parser_unary_expression
2325 static enum tree_code cp_parser_unary_operator
2327 static tree cp_parser_has_attribute_expression
2329 static tree cp_parser_new_expression
2333 static tree cp_parser_new_type_id
2341 static tree cp_parser_delete_expression
2343 static cp_expr cp_parser_cast_expression
2345 static cp_expr cp_parser_binary_expression
2347 static tree cp_parser_question_colon_clause
2350 static cp_expr cp_parser_assignment_expression
2352 static enum tree_code cp_parser_assignment_operator_opt
2354 static cp_expr cp_parser_expression
2356 static cp_expr cp_parser_constant_expression
2358 static cp_expr cp_parser_builtin_offsetof
2360 static cp_expr cp_parser_lambda_expression
2362 static void cp_parser_lambda_introducer
2364 static bool cp_parser_lambda_declarator_opt
2366 static void cp_parser_lambda_body
2369 /* Statements [gram.stmt.stmt] */
2371 static void cp_parser_statement
2373 static void cp_parser_label_for_labeled_statement
2375 static tree cp_parser_expression_statement
2377 static tree cp_parser_compound_statement
2379 static void cp_parser_statement_seq_opt
2381 static tree cp_parser_selection_statement
2383 static tree cp_parser_condition
2385 static tree cp_parser_iteration_statement
2387 static bool cp_parser_init_statement
2389 static tree cp_parser_for
2391 static tree cp_parser_c_for
2393 static tree cp_parser_range_for
2395 static void do_range_for_auto_deduction
2397 static tree cp_parser_perform_range_for_lookup
2399 static tree cp_parser_range_for_member_function
2401 static tree cp_parser_jump_statement
2403 static void cp_parser_declaration_statement
2406 static tree cp_parser_implicitly_scoped_statement
2408 static void cp_parser_already_scoped_statement
2411 /* State of module-declaration parsing. */
2412 enum module_parse
2413 {
2416 _MP_UNUSED,
2426 };
2428 static module_parse cp_parser_module_declaration
2430 static void cp_parser_import_declaration
2433 /* Declarations [gram.dcl.dcl] */
2435 static void cp_parser_declaration_seq_opt
2437 static void cp_parser_declaration
2439 static void cp_parser_toplevel_declaration
2441 static void cp_parser_block_declaration
2443 static void cp_parser_simple_declaration
2445 static void cp_parser_decl_specifier_seq
2447 static tree cp_parser_storage_class_specifier_opt
2449 static tree cp_parser_function_specifier_opt
2451 static tree cp_parser_type_specifier
2454 static tree cp_parser_simple_type_specifier
2456 static tree cp_parser_placeholder_type_specifier
2458 static tree cp_parser_type_name
2460 static tree cp_parser_nonclass_name
2462 static tree cp_parser_elaborated_type_specifier
2464 static tree cp_parser_enum_specifier
2466 static void cp_parser_enumerator_list
2468 static void cp_parser_enumerator_definition
2470 static tree cp_parser_namespace_name
2472 static void cp_parser_namespace_definition
2474 static void cp_parser_namespace_body
2476 static tree cp_parser_qualified_namespace_specifier
2478 static void cp_parser_namespace_alias_definition
2480 static bool cp_parser_using_declaration
2482 static void cp_parser_using_directive
2484 static void cp_parser_using_enum
2486 static tree cp_parser_alias_declaration
2488 static void cp_parser_asm_definition
2490 static void cp_parser_linkage_specification
2492 static void cp_parser_static_assert
2494 static tree cp_parser_decltype
2496 static tree cp_parser_decomposition_declaration
2499 /* Declarators [gram.dcl.decl] */
2501 static tree cp_parser_init_declarator
2511 static enum tree_code cp_parser_ptr_operator
2513 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2515 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2517 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2519 static tree cp_parser_tx_qualifier_opt
2521 static tree cp_parser_late_return_type_opt
2523 static tree cp_parser_declarator_id
2525 static tree cp_parser_type_id
2527 static tree cp_parser_template_type_arg
2530 static tree cp_parser_type_id_1
2532 static void cp_parser_type_specifier_seq
2534 static tree cp_parser_parameter_declaration_clause
2536 static tree cp_parser_parameter_declaration_list
2540 static tree cp_parser_default_argument
2542 static void cp_parser_function_body
2544 static tree cp_parser_initializer
2546 static cp_expr cp_parser_initializer_clause
2548 static cp_expr cp_parser_braced_list
2553 static void cp_parser_ctor_initializer_opt_and_function_body
2556 static tree cp_parser_late_parsing_omp_declare_simd
2559 static tree cp_parser_late_parsing_oacc_routine
2562 static tree synthesize_implicit_template_parm
2564 static tree finish_fully_implicit_template
2566 static void abort_fully_implicit_template
2569 /* Classes [gram.class] */
2571 static tree cp_parser_class_name
2573 static tree cp_parser_class_specifier
2575 static tree cp_parser_class_head
2577 static enum tag_types cp_parser_class_key
2579 static void cp_parser_type_parameter_key
2581 static void cp_parser_member_specification_opt
2583 static void cp_parser_member_declaration
2585 static tree cp_parser_pure_specifier
2587 static tree cp_parser_constant_initializer
2590 /* Derived classes [gram.class.derived] */
2592 static tree cp_parser_base_clause
2594 static tree cp_parser_base_specifier
2597 /* Special member functions [gram.special] */
2599 static tree cp_parser_conversion_function_id
2601 static tree cp_parser_conversion_type_id
2605 static void cp_parser_ctor_initializer_opt
2607 static void cp_parser_mem_initializer_list
2609 static tree cp_parser_mem_initializer
2611 static tree cp_parser_mem_initializer_id
2614 /* Overloading [gram.over] */
2616 static cp_expr cp_parser_operator_function_id
2618 static cp_expr cp_parser_operator
2621 /* Templates [gram.temp] */
2623 static void cp_parser_template_declaration
2625 static tree cp_parser_template_parameter_list
2627 static tree cp_parser_template_parameter
2629 static tree cp_parser_type_parameter
2631 static tree cp_parser_template_id
2633 static tree cp_parser_template_id_expr
2635 static tree cp_parser_template_name
2637 static tree cp_parser_template_argument_list
2639 static tree cp_parser_template_argument
2641 static void cp_parser_explicit_instantiation
2643 static void cp_parser_explicit_specialization
2646 /* Exception handling [gram.except] */
2648 static tree cp_parser_try_block
2650 static void cp_parser_function_try_block
2652 static void cp_parser_handler_seq
2654 static void cp_parser_handler
2656 static tree cp_parser_exception_declaration
2658 static tree cp_parser_throw_expression
2660 static tree cp_parser_exception_specification_opt
2662 static tree cp_parser_type_id_list
2664 static tree cp_parser_noexcept_specification_opt
2667 /* GNU Extensions */
2669 static tree cp_parser_asm_specification_opt
2671 static tree cp_parser_asm_operand_list
2673 static tree cp_parser_asm_clobber_list
2675 static tree cp_parser_asm_label_list
2677 static bool cp_next_tokens_can_be_attribute_p
2679 static bool cp_next_tokens_can_be_gnu_attribute_p
2681 static bool cp_next_tokens_can_be_std_attribute_p
2683 static bool cp_nth_tokens_can_be_std_attribute_p
2685 static bool cp_nth_tokens_can_be_gnu_attribute_p
2687 static bool cp_nth_tokens_can_be_attribute_p
2689 static tree cp_parser_attributes_opt
2691 static tree cp_parser_gnu_attributes_opt
2693 static tree cp_parser_gnu_attribute_list
2695 static tree cp_parser_std_attribute
2697 static tree cp_parser_std_attribute_spec
2699 static tree cp_parser_std_attribute_spec_seq
2701 static size_t cp_parser_skip_std_attribute_spec_seq
2703 static size_t cp_parser_skip_attributes_opt
2705 static bool cp_parser_extension_opt
2707 static void cp_parser_label_declaration
2710 /* Concept Extensions */
2712 static tree cp_parser_concept_definition
2714 static tree cp_parser_constraint_expression
2716 static tree cp_parser_requires_clause_opt
2718 static tree cp_parser_requires_expression
2720 static tree cp_parser_requirement_parameter_list
2722 static tree cp_parser_requirement_body
2724 static tree cp_parser_requirement_seq
2726 static tree cp_parser_requirement
2728 static tree cp_parser_simple_requirement
2730 static tree cp_parser_compound_requirement
2732 static tree cp_parser_type_requirement
2734 static tree cp_parser_nested_requirement
2737 /* Transactional Memory Extensions */
2739 static tree cp_parser_transaction
2741 static tree cp_parser_transaction_expression
2743 static void cp_parser_function_transaction
2745 static tree cp_parser_transaction_cancel
2748 /* Coroutine extensions. */
2750 static tree cp_parser_yield_expression
2753 /* Contracts */
2755 static void cp_parser_late_contract_condition
2759 pragma_external,
2760 pragma_member,
2761 pragma_objc_icode,
2762 pragma_stmt,
2763 pragma_compound
2764 };
2765 static bool cp_parser_pragma
2768 /* Objective-C++ Productions */
2770 static tree cp_parser_objc_message_receiver
2772 static tree cp_parser_objc_message_args
2774 static tree cp_parser_objc_message_expression
2776 static cp_expr cp_parser_objc_encode_expression
2778 static tree cp_parser_objc_defs_expression
2780 static tree cp_parser_objc_protocol_expression
2782 static tree cp_parser_objc_selector_expression
2784 static cp_expr cp_parser_objc_expression
2786 static bool cp_parser_objc_selector_p
2788 static tree cp_parser_objc_selector
2790 static tree cp_parser_objc_protocol_refs_opt
2792 static void cp_parser_objc_declaration
2794 static tree cp_parser_objc_statement
2796 static bool cp_parser_objc_valid_prefix_attributes
2798 static void cp_parser_objc_at_property_declaration
2800 static void cp_parser_objc_at_synthesize_declaration
2802 static void cp_parser_objc_at_dynamic_declaration
2804 static tree cp_parser_objc_struct_declaration
2807 /* Utility Routines */
2809 static cp_expr cp_parser_lookup_name
2811 static tree cp_parser_lookup_name_simple
2813 static tree cp_parser_maybe_treat_template_as_class
2815 static bool cp_parser_check_declarator_template_parameters
2817 static bool cp_parser_check_template_parameters
2819 static cp_expr cp_parser_simple_cast_expression
2821 static tree cp_parser_global_scope_opt
2823 static bool cp_parser_constructor_declarator_p
2825 static tree cp_parser_function_definition_from_specifiers_and_declarator
2827 static tree cp_parser_function_definition_after_declarator
2829 static bool cp_parser_template_declaration_after_export
2831 static void cp_parser_perform_template_parameter_access_checks
2833 static tree cp_parser_single_declaration
2835 static cp_expr cp_parser_functional_cast
2837 static tree cp_parser_save_member_function_body
2839 static tree cp_parser_save_nsdmi
2841 static tree cp_parser_enclosed_template_argument_list
2843 static void cp_parser_save_default_args
2845 static void cp_parser_late_parsing_for_member
2847 static tree cp_parser_late_parse_one_default_arg
2849 static void cp_parser_late_parsing_nsdmi
2851 static void cp_parser_late_parsing_default_args
2853 static tree cp_parser_sizeof_operand
2855 static cp_expr cp_parser_trait
2857 static bool cp_parser_declares_only_class_p
2859 static void cp_parser_set_storage_class
2861 static void cp_parser_set_decl_spec_type
2863 static void set_and_check_decl_spec_loc
2866 static bool cp_parser_friend_p
2868 static void cp_parser_required_error
2874 static bool cp_parser_token_starts_function_definition_p
2876 static bool cp_parser_next_token_starts_class_definition_p
2878 static bool cp_parser_next_token_ends_template_argument_p
2880 static bool cp_parser_nth_token_starts_template_argument_list_p
2882 static enum tag_types cp_parser_token_is_class_key
2884 static enum tag_types cp_parser_token_is_type_parameter_key
2887 static void cp_parser_check_class_key
2889 static void cp_parser_check_access_in_redeclaration
2891 static bool cp_parser_optional_template_keyword
2893 static void cp_parser_pre_parsed_nested_name_specifier
2895 static bool cp_parser_cache_group
2897 static tree cp_parser_cache_defarg
2899 static void cp_parser_parse_tentatively
2901 static void cp_parser_commit_to_tentative_parse
2903 static void cp_parser_commit_to_topmost_tentative_parse
2905 static void cp_parser_abort_tentative_parse
2907 static bool cp_parser_parse_definitely
2911 static bool cp_parser_uncommitted_to_tentative_parse_p
2913 static void cp_parser_error
2915 static void cp_parser_name_lookup_error
2917 static bool cp_parser_simulate_error
2919 static bool cp_parser_check_type_definition
2921 static void cp_parser_check_for_definition_in_return_type
2923 static void cp_parser_check_for_invalid_template_id
2925 static bool cp_parser_non_integral_constant_expression
2927 static void cp_parser_diagnose_invalid_type_name
2929 static bool cp_parser_parse_and_diagnose_invalid_type_name
2931 static int cp_parser_skip_to_closing_parenthesis
2933 static void cp_parser_skip_to_end_of_statement
2935 static void cp_parser_consume_semicolon_at_end_of_statement
2937 static void cp_parser_skip_to_end_of_block_or_statement
2939 static bool cp_parser_skip_to_closing_brace
2941 static bool cp_parser_skip_entire_template_parameter_list
2943 static void cp_parser_require_end_of_template_parameter_list
2945 static bool cp_parser_skip_to_end_of_template_parameter_list
2947 static void cp_parser_skip_to_pragma_eol
2949 static bool cp_parser_error_occurred
2951 static bool cp_parser_allow_gnu_extensions_p
2953 static bool cp_parser_is_pure_string_literal
2955 static bool cp_parser_is_string_literal
2957 static bool cp_parser_is_keyword
2959 static tree cp_parser_make_typename_type
2963 static bool cp_parser_compound_literal_p
2965 static bool cp_parser_array_designator_p
2967 static bool cp_parser_init_statement_p
2969 static bool cp_parser_skip_up_to_closing_square_bracket
2971 static bool cp_parser_skip_to_closing_square_bracket
2976 // -------------------------------------------------------------------------- //
2977 // Unevaluated Operand Guard
2978 //
2979 // Implementation of an RAII helper for unevaluated operand parsing.
2981 {
2984 }
2987 {
2990 }
2992 // -------------------------------------------------------------------------- //
2993 // Tentative Parsing
2995 /* Returns nonzero if we are parsing tentatively. */
2999 {
3001 }
3003 /* Returns nonzero if TOKEN is a string literal. */
3005 static bool
3007 {
3013 }
3015 /* Returns nonzero if TOKEN is a string literal
3016 of a user-defined string literal. */
3018 static bool
3020 {
3027 }
3029 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
3031 static bool
3033 {
3035 }
3037 /* Helper function for cp_parser_error.
3038 Having peeked a token of kind TOK1_KIND that might signify
3039 a conflict marker, peek successor tokens to determine
3040 if we actually do have a conflict marker.
3041 Specifically, we consider a run of 7 '<', '=' or '>' characters
3042 at the start of a line as a conflict marker.
3043 These come through the lexer as three pairs and a single,
3044 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
3045 If it returns true, *OUT_LOC is written to with the location/range
3046 of the marker. */
3048 static bool
3051 {
3062 /* It must be at the start of the line. */
3067 /* We have a conflict marker. Construct a location of the form:
3068 <<<<<<<
3069 ^~~~~~~
3070 with start == caret, finishing at the end of the marker. */
3075 }
3077 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
3078 RT_CLOSE_PAREN. */
3082 {
3084 {
3092 }
3093 }
3095 /* Attempt to convert TOKEN_DESC from a required_token to an
3096 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
3098 static enum cpp_ttype
3100 {
3102 {
3123 /* Use CPP_EOF as a "no completions possible" code. */
3125 }
3126 }
3129 /* Subroutine of cp_parser_error and cp_parser_required_error.
3131 Issue a diagnostic of the form
3132 FILE:LINE: MESSAGE before TOKEN
3133 where TOKEN is the next token in the input stream. MESSAGE
3134 (specified by the caller) is usually of the form "expected
3135 OTHER-TOKEN".
3137 This bypasses the check for tentative passing, and potentially
3138 adds material needed by cp_parser_required_error.
3140 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
3141 suggesting insertion of the missing token.
3143 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
3144 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
3145 location. */
3147 static void
3149 required_token missing_token_desc,
3150 location_t matching_location)
3151 {
3153 /* This diagnostic makes more sense if it is tagged to the line
3154 of the token we just peeked at. */
3158 {
3163 }
3165 /* If this is actually a conflict marker, report it as such. */
3169 {
3170 location_t loc;
3172 {
3175 /* Consume tokens until the end of the source line. */
3177 {
3191 }
3193 }
3194 }
3196 auto_diagnostic_group d;
3203 {
3204 /* Potentially supply a fix-it hint, suggesting to add the
3205 missing token immediately after the *previous* token.
3206 This may move the primary location within richloc. */
3210 prev_token_loc);
3212 /* If matching_location != UNKNOWN_LOCATION, highlight it.
3213 Attempt to consolidate diagnostics by printing it as a
3214 secondary range within the main diagnostic. */
3216 added_matching_location
3218 }
3220 /* If we were parsing a string-literal and there is an unknown name
3221 token right after, then check to see if that could also have been
3222 a literal string by checking the name against a list of known
3223 standard string literal constants defined in header files. If
3224 there is one, then add that as an hint to the error message. */
3225 name_hint h;
3229 {
3236 token_name,
3237 header_hint));
3238 }
3240 /* Actually emit the error. */
3242 /* Because c_parser_error does not understand
3243 CPP_KEYWORD, keywords are treated like
3244 identifiers. */
3249 {
3250 /* If we weren't able to consolidate matching_location, then
3251 print it as a secondary diagnostic. */
3256 }
3257 }
3259 /* If not parsing tentatively, issue a diagnostic of the form
3260 FILE:LINE: MESSAGE before TOKEN
3261 where TOKEN is the next token in the input stream. MESSAGE
3262 (specified by the caller) is usually of the form "expected
3263 OTHER-TOKEN". */
3265 static void
3267 {
3270 }
3272 /* Issue an error about name-lookup failing. NAME is the
3273 IDENTIFIER_NODE DECL is the result of
3274 the lookup (as returned from cp_parser_lookup_name). DESIRED is
3275 the thing that we hoped to find. */
3277 static void
3279 tree name,
3280 tree decl,
3281 name_lookup_error desired,
3282 location_t location)
3283 {
3284 /* If name lookup completely failed, tell the user that NAME was not
3285 declared. */
3287 {
3300 else
3302 }
3304 {
3306 {
3323 }
3324 }
3326 {
3328 {
3338 name);
3342 }
3343 }
3344 else
3345 {
3347 {
3360 }
3361 }
3362 }
3364 /* If we are parsing tentatively, remember that an error has occurred
3365 during this tentative parse. Returns true if the error was
3366 simulated; false if a message should be issued by the caller. */
3368 static bool
3370 {
3372 {
3375 }
3377 }
3379 /* This function is called when a type is defined. If type
3380 definitions are forbidden at this point, an error message is
3381 issued. */
3383 static bool
3385 {
3386 /* If types are forbidden here, issue a message. */
3388 {
3389 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3390 or %qs in the message need to be interpreted. */
3394 }
3396 }
3398 /* This function is called when the DECLARATOR is processed. The TYPE
3399 was a type defined in the decl-specifiers. If it is invalid to
3400 define a type in the decl-specifiers for DECLARATOR, an error is
3401 issued. TYPE_LOCATION is the location of TYPE and is used
3402 for error reporting. */
3404 static void
3407 {
3408 /* [dcl.fct] forbids type definitions in return types.
3409 Unfortunately, it's not easy to know whether or not we are
3410 processing a return type until after the fact. */
3418 {
3423 type);
3424 }
3425 }
3427 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3428 "<" in any valid C++ program. If the next token is indeed "<",
3429 issue a message warning the user about what appears to be an
3430 invalid attempt to form a template-id. LOCATION is the location
3431 of the type-specifier (TYPE) */
3433 static void
3435 tree type,
3437 location_t location)
3438 {
3442 {
3448 {
3451 else
3453 }
3454 else
3456 /* Remember the location of the invalid "<". */
3459 /* Consume the "<". */
3461 /* Parse the template arguments. */
3463 /* Permanently remove the invalid template arguments so that
3464 this error message is not issued again. */
3467 }
3468 }
3470 /* If parsing an integral constant-expression, issue an error message
3471 about the fact that THING appeared and return true. Otherwise,
3472 return false. In either case, set
3473 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3475 static bool
3477 non_integral_constant thing)
3478 {
3481 {
3483 {
3486 {
3489 "ISO C++ forbids using a floating-point literal "
3494 "enumeration type cannot appear in a "
3585 }
3589 }
3590 }
3592 }
3594 /* Emit a diagnostic for an invalid type name. This function commits
3595 to the current active tentative parse, if any. (Otherwise, the
3596 problematic construct might be encountered again later, resulting
3597 in duplicate error messages.) LOCATION is the location of ID. */
3599 static void
3601 location_t location)
3602 {
3605 /* Try to lookup the identifier. */
3612 /* If the lookup was ambiguous, an error will already have
3613 been issued. */
3615 /* If the lookup found a template-name, it means that the user forgot
3616 to specify an argument list. Emit a useful error message. */
3618 {
3619 auto_diagnostic_group d;
3622 decl);
3627 }
3631 /* Something like 'unsigned A a;' */
3634 {
3635 /* Issue an error message. */
3636 auto_diagnostic_group d;
3637 name_hint hint;
3641 {
3647 }
3648 else
3650 /* If we're in a template class, it's possible that the user was
3651 referring to a type from a base class. For example:
3653 template <typename T> struct A { typedef T X; };
3654 template <typename T> struct B : public A<T> { X x; };
3656 The user should have said "typename A<T>::X". */
3665 {
3668 id);
3671 id);
3672 else
3675 }
3692 {
3695 {
3699 {
3700 /* Go from a particular instantiation of the
3701 template (which will have an empty TYPE_FIELDs),
3702 to the main version. */
3708 {
3713 }
3714 }
3715 }
3716 found:;
3717 }
3718 }
3719 /* Here we diagnose qualified-ids where the scope is actually correct,
3720 but the identifier does not resolve to a valid type name. */
3722 {
3724 {
3725 auto_diagnostic_group d;
3726 name_hint hint;
3735 {
3738 "%qE in namespace %qE does not name a template"
3741 else
3745 }
3747 {
3750 "%qE in namespace %qE does not name a template"
3753 else
3755 "%qE in namespace %qE does not name a template"
3758 }
3759 else
3760 {
3763 "%qE in namespace %qE does not name a type"
3766 else
3770 }
3773 }
3776 {
3777 /* A<T>::A<T>() */
3778 auto_diagnostic_group d;
3784 }
3787 {
3792 "need %<typename%> before %<%T::%D::%E%> because "
3796 id,
3799 else
3803 }
3805 {
3806 auto_diagnostic_group d;
3818 else
3824 }
3825 else
3827 }
3828 }
3830 /* Check for a common situation where a type-name should be present,
3831 but is not, and issue a sensible error message. Returns true if an
3832 invalid type-name was detected.
3834 The situation handled by this function are variable declarations of the
3835 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3836 Usually, `ID' should name a type, but if we got here it means that it
3837 does not. We try to emit the best possible error message depending on
3838 how exactly the id-expression looks like. */
3840 static bool
3842 {
3843 tree id;
3846 /* Avoid duplicate error about ambiguous lookup. */
3848 {
3852 }
3861 /* If the next token is a (, this is a function with no explicit return
3862 type, i.e. constructor, destructor or conversion op. */
3865 {
3868 }
3872 /* Emit a diagnostic for the invalid type. */
3874 out:
3875 /* If we aren't in the middle of a declarator (i.e. in a
3876 parameter-declaration-clause), skip to the end of the declaration;
3877 there's no point in trying to process it. */
3881 }
3883 /* Consume tokens up to, and including, the next non-nested closing `)'.
3884 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3885 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3886 found an unnested token of that type. */
3888 static int
3891 cpp_ttype or_ttype,
3893 {
3904 {
3907 /* Have we found what we're looking for before the closing paren? */
3913 {
3917 /* FALLTHRU */
3919 /* If we've run out of tokens, then there is no closing `)'. */
3922 /* This is good for lambda expression capture-lists. */
3932 /* This matches the processing in skip_to_end_of_statement. */
3952 {
3956 }
3966 condop_depth--;
3972 /* FALLTHROUGH */
3975 /* We fell into a pragma. Skip it, and continue. */
3981 }
3983 /* Consume the token. */
3985 }
3986 }
3988 /* Consume tokens up to, and including, the next non-nested closing `)'.
3989 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3990 are doing error recovery. Returns -1 if OR_COMMA is true and we
3991 found an unnested token of that type. */
3993 static int
3998 {
4002 }
4004 /* Consume tokens until we reach the end of the current statement.
4005 Normally, that will be just before consuming a `;'. However, if a
4006 non-nested `}' comes first, then we stop before consuming that. */
4008 static void
4010 {
4013 /* Unwind generic function template scope if necessary. */
4018 {
4022 {
4026 /* FALLTHRU */
4028 /* If we've run out of tokens, stop. */
4032 /* If the next token is a `;', we have reached the end of the
4033 statement. */
4039 /* If this is a non-nested '}', stop before consuming it.
4040 That way, when confronted with something like:
4042 { 3 + }
4044 we stop before consuming the closing '}', even though we
4045 have not yet reached a `;'. */
4049 /* If it is the closing '}' for a block that we have
4050 scanned, stop -- but only after consuming the token.
4051 That way given:
4053 void f g () { ... }
4054 typedef int I;
4056 we will stop after the body of the erroneously declared
4057 function, but before consuming the following `typedef'
4058 declaration. */
4060 {
4063 }
4073 /* FALLTHROUGH */
4076 /* We fell into a pragma. Skip it, and continue or return. */
4084 }
4086 /* Consume the token. */
4088 }
4089 }
4091 /* This function is called at the end of a statement or declaration.
4092 If the next token is a semicolon, it is consumed; otherwise, error
4093 recovery is attempted. */
4095 static void
4097 {
4098 /* Look for the trailing `;'. */
4100 {
4101 /* If there is additional (erroneous) input, skip to the end of
4102 the statement. */
4104 /* If the next token is now a `;', consume it. */
4107 }
4108 }
4110 /* Skip tokens until we have consumed an entire block, or until we
4111 have consumed a non-nested `;'. */
4113 static void
4115 {
4118 /* Unwind generic function template scope if necessary. */
4123 {
4127 {
4131 /* FALLTHRU */
4133 /* If we've run out of tokens, stop. */
4137 /* Stop if this is an unnested ';'. */
4143 /* Stop if this is an unnested '}', or closes the outermost
4144 nesting level. */
4145 nesting_depth--;
4153 /* Nest. */
4154 nesting_depth++;
4160 /* FALLTHROUGH */
4163 /* Skip it, and continue or return. */
4171 }
4173 /* Consume the token. */
4175 }
4176 }
4178 /* Skip tokens until a non-nested closing curly brace is the next
4179 token, or there are no more tokens. Return true in the first case,
4180 false otherwise. */
4182 static bool
4184 {
4188 {
4192 {
4196 /* FALLTHRU */
4198 /* If we've run out of tokens, stop. */
4202 /* If the next token is a non-nested `}', then we have reached
4203 the end of the current block. */
4209 /* If it the next token is a `{', then we are entering a new
4210 block. Consume the entire block. */
4216 }
4218 /* Consume the token. */
4220 }
4221 }
4223 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
4224 parameter is the PRAGMA token, allowing us to purge the entire pragma
4225 sequence. PRAGMA_TOK can be NULL, if we're speculatively scanning
4226 forwards (not error recovery). */
4228 static void
4230 {
4233 do
4234 {
4235 /* The preprocessor makes sure that a PRAGMA_EOL token appears
4236 before an EOF token, even when the EOF is on the pragma line.
4237 We should never get here without being inside a deferred
4238 pragma. */
4241 }
4245 {
4249 {
4251 /* Put the current source position back where it was before this
4252 lexer was pushed. */
4254 }
4255 }
4256 }
4258 /* Require pragma end of line, resyncing with it as necessary. The
4259 arguments are as for cp_parser_skip_to_pragma_eol. */
4261 static void
4263 {
4269 {
4271 /* Put the current source position back where it was before this
4272 lexer was pushed. */
4274 }
4275 }
4277 /* This is a simple wrapper around make_typename_type. When the id is
4278 an unresolved identifier node, we can provide a superior diagnostic
4279 using cp_parser_diagnose_invalid_type_name. */
4281 static tree
4283 location_t id_location)
4284 {
4285 tree result;
4287 {
4293 }
4295 }
4297 /* This is a wrapper around the
4298 make_{pointer,ptrmem,reference}_declarator functions that decides
4299 which one to call based on the CODE and CLASS_TYPE arguments. The
4300 CODE argument should be one of the values returned by
4301 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
4302 appertain to the pointer or reference. */
4306 cp_cv_quals cv_qualifiers,
4308 tree attributes)
4309 {
4316 else
4326 }
4328 /* Create a new C++ parser. */
4332 {
4333 /* Initialize the binops_by_token so that we can get the tree
4334 directly from the token. */
4342 /* For now, we always accept GNU extensions. */
4345 /* The `>' token is a greater-than operator, not the end of a
4346 template-id. */
4351 /* We are not parsing a constant-expression. */
4356 /* Local variable names are not forbidden. */
4359 /* We are not processing an `extern "C"' declaration. */
4362 /* We are not processing a declarator. */
4365 /* We are not processing a template-argument-list. */
4368 /* We are not in an iteration statement. */
4371 /* We are not in a switch statement. */
4374 /* We are not parsing a type-id inside an expression. */
4377 /* String literals should be translated to the execution character set. */
4380 /* We are not parsing a function body. */
4383 /* We can correct until told otherwise. */
4386 /* The unparsed function queue is empty. */
4389 /* There are no classes being defined. */
4392 /* No template parameters apply. */
4395 /* Special parsing data structures. */
4399 /* Not declaring an implicit function template. */
4405 /* Allow constrained-type-specifiers. */
4408 /* We haven't yet seen an 'extern "C"'. */
4412 }
4414 /* Create a cp_lexer structure which will emit the tokens in CACHE
4415 and push it onto the parser's lexer stack. This is used for delayed
4416 parsing of in-class method bodies and default arguments, and should
4417 not be confused with tentative parsing. */
4418 static void
4420 {
4425 /* Move the current source position to that of the first token in the
4426 new lexer. */
4428 }
4430 /* Pop the top lexer off the parser stack. This is never used for the
4431 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4432 static void
4434 {
4439 /* Put the current source position back where it was before this
4440 lexer was pushed. */
4442 }
4444 /* Lexical conventions [gram.lex] */
4446 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4447 identifier. */
4449 static cp_expr
4451 {
4454 /* Look for the identifier. */
4456 /* Return the value. */
4459 else
4461 }
4463 /* Worker for cp_parser_string_literal and cp_parser_userdef_string_literal.
4464 Do not call this directly; use either of the above.
4466 Parse a sequence of adjacent string constants. Return a
4467 TREE_STRING representing the combined, nul-terminated string
4468 constant. If TRANSLATE is true, translate the string to the
4469 execution character set. If WIDE_OK is true, a wide string is
4470 valid here. If UDL_OK is true, a string literal with user-defined
4471 suffix can be used in this context.
4473 C++98 [lex.string] says that if a narrow string literal token is
4474 adjacent to a wide string literal token, the behavior is undefined.
4475 However, C99 6.4.5p4 says that this results in a wide string literal.
4476 We follow C99 here, for consistency with the C front end.
4478 This code is largely lifted from lex_string() in c-lex.cc.
4480 FUTURE: ObjC++ will need to handle @-strings here. */
4482 static cp_expr
4486 {
4487 tree value;
4495 tree string_tree;
4501 {
4504 }
4509 {
4511 {
4515 }
4519 }
4520 else
4521 {
4524 }
4527 /* Try to avoid the overhead of creating and destroying an obstack
4528 for the common case of just one string. */
4531 {
4539 {
4543 }
4544 else
4548 }
4549 else
4550 {
4556 do
4557 {
4559 count++;
4564 {
4567 {
4570 }
4573 {
4578 }
4580 }
4581 else
4585 {
4589 {
4593 "concatenation of string literals with "
4595 }
4596 }
4605 {
4607 {
4611 }
4615 }
4616 else
4617 {
4621 }
4622 }
4625 /* A string literal built by concatenation has its caret=start at
4626 the start of the initial string, and its finish at the finish of
4627 the final string literal. */
4631 }
4634 {
4637 }
4641 {
4645 {
4649 }
4652 {
4660 else
4672 }
4677 {
4682 else
4684 }
4685 }
4686 else
4687 /* cpp_interpret_string has issued an error. */
4691 {
4694 }
4697 }
4699 /* Parse a sequence of adjacent string constants. Return a TREE_STRING
4700 representing the combined, nul-terminated string constant. If
4701 TRANSLATE is true, translate the string to the execution character set.
4702 If WIDE_OK is true, a wide string is valid here.
4704 This function issues an error if a user defined string literal is
4705 encountered; use cp_parser_userdef_string_literal if UDLs are allowed. */
4709 {
4713 }
4715 /* Parse a string literal or user defined string literal.
4717 user-defined-string-literal :
4718 string-literal ud-suffix
4720 If LOOKUP_UDLIT, perform a lookup for a suitable template function. */
4724 {
4727 lookup_udlit);
4728 }
4730 /* Look up a literal operator with the name and the exact arguments. */
4732 static tree
4734 {
4740 {
4744 {
4751 {
4761 }
4765 /* May be this should be sufficient_parms_p instead,
4766 depending on how exactly should user-defined literals
4767 work in presence of default arguments on the literal
4768 operator parameters. */
4771 }
4772 }
4775 }
4777 /* Parse a user-defined char constant. Returns a call to a user-defined
4778 literal operator taking the character as an argument. */
4780 static cp_expr
4782 {
4790 /* Build up a call to the user-defined operator */
4791 /* Lookup the name we got back from the id-expression. */
4792 releasing_vec args;
4796 {
4800 }
4803 }
4805 /* A subroutine of cp_parser_userdef_numeric_literal to
4806 create a char... template parameter pack from a string node. */
4808 static tree
4810 {
4811 tree charvec;
4818 /* Fill in CHARVEC with all of the parameters. */
4821 {
4830 }
4832 /* Build the argument packs. */
4838 }
4840 /* A subroutine of cp_parser_userdef_numeric_literal to
4841 create a char... template parameter pack from a string node. */
4843 static tree
4845 {
4846 tree charvec;
4857 /* First template parm is character type. */
4860 /* Fill in CHARVEC with all of the parameters. */
4867 /* Build the argument packs. */
4873 }
4875 /* Parse a user-defined numeric constant. returns a call to a user-defined
4876 literal operator. */
4878 static cp_expr
4880 {
4890 /* Look for a literal operator taking the exact type of numeric argument
4891 as the literal value. */
4892 releasing_vec args;
4896 {
4898 tf_warning_or_error);
4901 {
4904 long_long_unsigned_type_node);
4905 }
4906 else
4907 {
4911 long_double_type_node);
4915 }
4918 }
4920 /* If the numeric argument didn't work, look for a raw literal
4921 operator taking a const char* argument consisting of the number
4922 in string format. */
4927 {
4929 tf_warning_or_error);
4931 }
4933 /* If the raw literal didn't work, look for a non-type template
4934 function with parameter pack char.... Call the function with
4935 template parameter characters representing the number. */
4939 {
4942 {
4944 num_string);
4946 }
4949 tf_warning_or_error);
4951 }
4953 /* In C++14 the standard library defines complex number suffixes that
4954 conflict with GNU extensions. Prefer them if <complex> is #included. */
4964 {
4968 {
4969 /* No <complex>, so pedwarn and use GNU semantics. */
4972 }
4973 }
4975 bool complained
4982 {
4984 "(from %<<complex>%>) to enable the C++14 user-defined literal "
4989 }
4996 else
4997 {
4998 /* Use the built-in semantics. */
4999 tree type;
5001 {
5004 else
5006 }
5014 }
5017 /* Avoid repeated diagnostics. */
5020 }
5022 /* Parse a user-defined string constant. Returns a call to a user-defined
5023 literal operator taking a character pointer and the length of the string
5024 as arguments. */
5026 static tree
5028 {
5034 tree decl;
5036 /* Build up a call to the user-defined operator. */
5037 /* Lookup the name we got back from the id-expression. */
5038 releasing_vec args;
5045 tf_warning_or_error);
5047 /* Look for a suitable template function, either (C++20) with a single
5048 parameter of class type, or (N3599) with typename parameter CharT and
5049 parameter pack CharT... */
5053 {
5054 /* Use resolve_nondeduced_context to try to choose one form of template
5055 or the other. */
5062 else
5063 {
5068 }
5072 tf_warning_or_error);
5073 }
5078 }
5081 /* Basic concepts [gram.basic] */
5083 /* Parse a translation-unit.
5085 translation-unit:
5086 declaration-seq [opt] */
5088 static void
5090 {
5093 /* Create the declarator obstack. */
5095 /* Create the error declarator. */
5097 /* Create the empty parameter list. */
5099 UNKNOWN_LOCATION);
5100 /* Remember where the base of the declarator obstack lies. */
5112 /* Parse until EOF. */
5114 {
5117 /* If we're entering or exiting a region that's implicitly
5118 extern "C", modify the lang context appropriately. This is
5119 so horrible. Please die. */
5122 {
5126 else
5128 }
5134 {
5135 /* Top-level module declarations are ok, and change the
5136 portion of file we're in. Top-level import declarations
5137 are significant for the import portions. */
5142 {
5145 }
5147 {
5148 mp_state
5151 }
5153 {
5158 }
5159 else
5163 {
5166 {
5169 "global module fragment contents must be"
5171 }
5172 }
5173 }
5175 /* This relies on the ordering of module_parse values. */
5177 /* We're no longer in the import portion of a named module. */
5183 {
5186 /* If the next token is now a `;', consume it. */
5189 }
5190 else
5192 }
5194 /* Get rid of the token array; we don't need it any more. */
5198 /* The EOF should have reset this. */
5201 /* Make sure the declarator obstack was fully cleaned up. */
5204 }
5206 /* Return the appropriate tsubst flags for parsing, possibly in N3276
5207 decltype context. */
5211 {
5216 }
5218 /* We're about to parse a collection of statements. If we're currently
5219 parsing tentatively, set up a firewall so that any nested
5220 cp_parser_commit_to_tentative_parse won't affect the current context. */
5222 static cp_token_position
5224 {
5231 }
5233 /* We've finished parsing the collection of statements. Wrap up the
5234 firewall and replace the relevant tokens with the parsed form. */
5236 static void
5238 tree expr)
5239 {
5243 /* Finish the firewall level. */
5245 /* And remember the result of the parse for when we try again. */
5251 }
5253 /* Like the above functions, but let the user modify the tokens. Used by
5254 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
5255 later parses, so it makes sense to localize the effects of
5256 cp_parser_commit_to_tentative_parse. */
5258 struct tentative_firewall
5259 {
5264 {
5265 /* If we're currently parsing tentatively, start a committed level as a
5266 firewall and then an inner tentative parse. */
5268 {
5272 }
5273 }
5276 {
5278 {
5279 /* Finish the inner tentative parse and the firewall, propagating any
5280 uncommitted error state to the outer tentative parse. */
5286 }
5287 }
5288 };
5290 /* Some tokens naturally come in pairs e.g.'(' and ')'.
5291 This class is for tracking such a matching pair of symbols.
5292 In particular, it tracks the location of the first token,
5293 so that if the second token is missing, we can highlight the
5294 location of the first token when notifying the user about the
5295 problem. */
5298 class token_pair
5299 {
5301 /* token_pair's ctor. */
5304 /* If the next token is the opening symbol for this pair, consume it and
5305 return true.
5306 Otherwise, issue an error and return false.
5307 In either case, record the location of the opening token. */
5310 {
5314 }
5316 /* Consume the next token from PARSER, recording its location as
5317 that of the opening token within the pair. */
5320 {
5325 }
5327 /* If the next token is the closing symbol for this pair, consume it
5328 and return it.
5329 Otherwise, issue an error, highlighting the location of the
5330 corresponding opening token, and return NULL. */
5333 {
5336 m_open_loc);
5337 }
5342 location_t m_open_loc;
5343 };
5345 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
5347 struct matching_paren_traits
5348 {
5353 };
5355 /* "matching_parens" is a token_pair<T> class for tracking matching
5356 pairs of parentheses. */
5360 /* Traits for token_pair<T> for tracking matching pairs of braces. */
5362 struct matching_brace_traits
5363 {
5368 };
5370 /* "matching_braces" is a token_pair<T> class for tracking matching
5371 pairs of braces. */
5376 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
5377 enclosing parentheses. */
5379 static cp_expr
5381 {
5384 /* Consume the '('. */
5386 matching_parens parens;
5388 /* Start the statement-expression. */
5390 /* Parse the compound-statement. */
5392 /* Finish up. */
5394 /* Consume the ')'. */
5402 }
5404 /* Expressions [gram.expr] */
5406 /* Parse a fold-operator.
5408 fold-operator:
5409 - * / % ^ & | = < > << >>
5410 = -= *= /= %= ^= &= |= <<= >>=
5411 == != <= >= && || , .* ->*
5413 This returns the tree code corresponding to the matched operator
5414 as an int. When the current token matches a compound assignment
5415 operator, the resulting tree code is the negative value of the
5416 non-assignment operator. */
5418 static int
5420 {
5422 {
5462 }
5463 }
5465 /* Returns true if CODE indicates a binary expression, which is not allowed in
5466 the LHS of a fold-expression. More codes will need to be added to use this
5467 function in other contexts. */
5469 static bool
5471 {
5473 {
5506 }
5507 }
5509 /* If the next token is a suitable fold operator, consume it and return as
5510 the function above. */
5512 static int
5514 {
5520 }
5522 /* Parse a fold-expression.
5524 fold-expression:
5525 ( ... folding-operator cast-expression)
5526 ( cast-expression folding-operator ... )
5527 ( cast-expression folding operator ... folding-operator cast-expression)
5529 Note that the '(' and ')' are matched in primary expression. */
5531 static cp_expr
5533 {
5534 cp_id_kind pidk;
5536 // Left fold.
5538 {
5544 {
5547 }
5554 }
5559 {
5562 }
5565 {
5568 }
5571 /* The operands of a fold-expression are cast-expressions, so binary or
5572 conditional expressions are not allowed. We check this here to avoid
5573 tentative parsing. */
5585 // Right fold.
5590 {
5593 }
5596 // Binary left or right fold.
5601 }
5603 /* Parse a primary-expression.
5605 primary-expression:
5606 literal
5607 this
5608 ( expression )
5609 id-expression
5610 lambda-expression (C++11)
5612 GNU Extensions:
5614 primary-expression:
5615 ( compound-statement )
5616 __builtin_va_arg ( assignment-expression , type-id )
5617 __builtin_offsetof ( type-id , offsetof-expression )
5619 C++ Extensions:
5620 __has_nothrow_assign ( type-id )
5621 __has_nothrow_constructor ( type-id )
5622 __has_nothrow_copy ( type-id )
5623 __has_trivial_assign ( type-id )
5624 __has_trivial_constructor ( type-id )
5625 __has_trivial_copy ( type-id )
5626 __has_trivial_destructor ( type-id )
5627 __has_virtual_destructor ( type-id )
5628 __is_abstract ( type-id )
5629 __is_base_of ( type-id , type-id )
5630 __is_class ( type-id )
5631 __is_empty ( type-id )
5632 __is_enum ( type-id )
5633 __is_final ( type-id )
5634 __is_literal_type ( type-id )
5635 __is_pod ( type-id )
5636 __is_polymorphic ( type-id )
5637 __is_std_layout ( type-id )
5638 __is_trivial ( type-id )
5639 __is_union ( type-id )
5641 Objective-C++ Extension:
5643 primary-expression:
5644 objc-expression
5646 literal:
5647 __null
5649 ADDRESS_P is true iff this expression was immediately preceded by
5650 "&" and therefore might denote a pointer-to-member. CAST_P is true
5651 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5652 true iff this expression is a template argument.
5654 Returns a representation of the expression. Upon return, *IDK
5655 indicates what kind of id-expression (if any) was present. */
5657 static cp_expr
5664 {
5667 /* Assume the primary expression is not an id-expression. */
5670 /* Peek at the next token. */
5673 {
5674 /* literal:
5675 integer-literal
5676 character-literal
5677 floating-literal
5678 string-literal
5679 boolean-literal
5680 pointer-literal
5681 user-defined-literal */
5693 {
5697 }
5698 /* Floating-point literals are only allowed in an integral
5699 constant expression if they are cast to an integral or
5700 enumeration type. */
5706 {
5707 /* CAST_P will be set even in invalid code like "int(2.7 +
5708 ...)". Therefore, we have to check that the next token
5709 is sure to end the cast. */
5711 {
5716 enumerator-definition. */
5718 /* The curly brace at the end of an enum-specifier. */
5720 /* The end of a statement. */
5722 /* The end of the cast-expression. */
5724 /* The end of an array bound. */
5726 /* The closing ">" in a template-argument-list. */
5729 /* C++0x only: A ">>" treated like two ">" tokens,
5730 in a template-argument-list. */
5735 }
5737 /* If we are within a cast, then the constraint that the
5738 cast is to an integral or enumeration type will be
5739 checked at that point. If we are not within a cast, then
5740 this code is invalid. */
5743 }
5764 /* ??? Should wide strings be allowed when parser->translate_strings_p
5765 is false (i.e. in attributes)? If not, we can kill the third
5766 argument to cp_parser_string_literal. */
5771 else
5778 /* If we see `( { ' then we are looking at the beginning of
5779 a GNU statement-expression. */
5782 {
5783 /* Statement-expressions are not allowed by the standard. */
5787 /* And they're not allowed outside of a function-body; you
5788 cannot, for example, write:
5790 int i = ({ int j = 3; j + 1; });
5792 at class or namespace scope. */
5795 {
5797 "statement-expressions are not allowed outside "
5803 }
5804 else
5806 }
5807 /* Otherwise it's a normal parenthesized expression. */
5808 {
5809 cp_expr expr;
5814 /* Consume the `('. */
5815 matching_parens parens;
5817 /* Within a parenthesized expression, a `>' token is always
5818 the greater-than operator. */
5819 saved_greater_than_is_operator_p
5824 /* Left fold expression. */
5826 else
5827 /* Parse the parenthesized expression. */
5832 {
5837 "fold-expressions only available with %<-std=c++17%> "
5839 }
5840 else
5841 /* Let the front end know that this expression was
5842 enclosed in parentheses. This matters in case, for
5843 example, the expression is of the form `A::B', since
5844 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5845 not. */
5848 /* DR 705: Wrapping an unqualified name in parentheses
5849 suppresses arg-dependent lookup. We want to pass back
5850 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5851 (c++/37862), but none of the others. */
5855 /* The `>' token might be the end of a template-id or
5856 template-parameter-list now. */
5857 parser->greater_than_is_operator_p
5860 /* Consume the `)'. */
5872 }
5875 {
5877 {
5878 /* We might have an Objective-C++ message. */
5881 /* If that works out, we're done ... */
5884 /* ... else, fall though to see if it's a lambda. */
5885 }
5887 /* Don't warn about a failed tentative parse. */
5892 }
5896 /* We have an Objective-C++ string literal. */
5903 {
5904 /* These two are the boolean literals. */
5912 /* The `__null' literal. */
5917 /* The `nullptr' literal. */
5922 /* Recognize the `this' keyword. */
5926 {
5930 }
5931 /* Pointers cannot appear in constant-expressions. */
5936 /* The `operator' keyword can be the beginning of an
5937 id-expression. */
5944 {
5945 non_integral_constant name;
5947 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5948 __func__ are the names of variables -- but they are
5949 treated specially. Therefore, they are handled here,
5950 rather than relying on the generic id-expression logic
5951 below. Grammatically, these names are id-expressions.
5953 Consume the token. */
5957 {
5969 }
5974 /* Look up the name. */
5976 }
5979 {
5980 tree expression;
5981 tree type;
5982 location_t type_location;
5983 location_t start_loc
5985 /* The `__builtin_va_arg' construct is used to handle
5986 `va_arg'. Consume the `__builtin_va_arg' token. */
5988 /* Look for the opening `('. */
5989 matching_parens parens;
5991 /* Now, parse the assignment-expression. */
5993 /* Look for the `,'. */
5996 /* Parse the type-id. */
5997 {
6000 }
6001 /* Look for the closing `)'. */
6002 location_t finish_loc
6005 /* Using `va_arg' in a constant-expression is not
6006 allowed. */
6008 NIC_VA_ARG))
6010 /* Construct a location of the form:
6011 __builtin_va_arg (v, int)
6012 ~~~~~~~~~~~~~~~~~~~~~^~~~
6013 with the caret at the type, ranging from the start of the
6014 "__builtin_va_arg" token to the close paren. */
6015 location_t combined_loc
6018 }
6023 #define DEFTRAIT_EXPR(CODE, NAME, ARITY) \
6024 case RID_##CODE:
6026 #undef DEFTRAIT_EXPR
6029 // C++ concepts
6033 /* Objective-C++ expressions. */
6043 "%<omp_all_memory%> may only be used in OpenMP "
6051 {
6056 }
6057 /* FALLTHRU */
6061 }
6063 /* An id-expression can start with either an identifier, a
6064 `::' as the beginning of a qualified-id, or the "operator"
6065 keyword. */
6070 {
6071 id_expression:
6072 cp_expr id_expression;
6073 cp_expr decl;
6079 /* Parse the id-expression. */
6080 id_expression
6097 /* If we have a template-id, then no further lookup is
6098 required. If the template-id was for a template-class, we
6099 will sometimes have a TYPE_DECL at this point. */
6103 /* Look up the name. */
6104 else
6105 {
6106 tree ambiguous_decls;
6108 /* If we already know that this lookup is ambiguous, then
6109 we've already issued an error message; there's no reason
6110 to check again. */
6113 {
6116 }
6119 none_type,
6120 template_p,
6125 /* If the lookup was ambiguous, an error will already have
6126 been issued. */
6130 /* In Objective-C++, we may have an Objective-C 2.0
6131 dot-syntax for classes here. */
6136 {
6137 tree component;
6144 component);
6145 /* Build a location of the form:
6146 expr.component
6147 ~~~~~^~~~~~~~~
6148 with caret at the start of the component name (at
6149 input_location), ranging from the start of the id_expression
6150 to the end of the component name. */
6151 location_t combined_loc
6156 }
6158 /* In Objective-C++, an instance variable (ivar) may be preferred
6159 to whatever cp_parser_lookup_name() found.
6160 Call objc_lookup_ivar. To avoid exposing cp_expr to the
6161 rest of c-family, we have to do a little extra work to preserve
6162 any location information in cp_expr "decl". Given that
6163 objc_lookup_ivar is implemented in "c-family" and "objc", we
6164 have a trip through the pure "tree" type, rather than cp_expr.
6165 Naively copying it back to "decl" would implicitly give the
6166 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
6167 store an EXPR_LOCATION. Hence we only update "decl" (and
6168 hence its location_t) if we get back a different tree node. */
6170 id_expression);
6174 /* If name lookup gives us a SCOPE_REF, then the
6175 qualifying scope was dependent. */
6177 {
6178 /* At this point, we do not know if DECL is a valid
6179 integral constant expression. We assume that it is
6180 in fact such an expression, so that code like:
6182 template <int N> struct A {
6183 int a[B<N>::i];
6184 };
6186 is accepted. At template-instantiation time, we
6187 will check that B<N>::i is actually a constant. */
6189 }
6190 /* Check to see if DECL is a local variable in a context
6191 where that is forbidden. */
6194 /* DR 2082 permits local variables in unevaluated contexts
6195 within a default argument. */
6197 {
6205 }
6206 }
6208 decl = (finish_id_expression
6210 idk,
6215 template_arg_p,
6220 /* Build a location for an id-expression of the form:
6221 ::ns::id
6222 ~~~~~~^~
6223 or:
6224 id
6225 ^~
6226 i.e. from the start of the first token to the end of the final
6227 token, with the caret at the start of the unqualified-id. */
6231 location_t combined_loc
6236 }
6238 /* Anything else is an error. */
6242 }
6243 }
6251 {
6254 }
6256 /* Complain about missing template keyword when naming a dependent
6257 member template. */
6259 static void
6261 {
6268 "expected %qs keyword before dependent "
6271 }
6273 /* Parse an id-expression.
6275 id-expression:
6276 unqualified-id
6277 qualified-id
6279 qualified-id:
6280 :: [opt] nested-name-specifier template [opt] unqualified-id
6281 :: identifier
6282 :: operator-function-id
6283 :: template-id
6285 Return a representation of the unqualified portion of the
6286 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
6287 a `::' or nested-name-specifier.
6289 Often, if the id-expression was a qualified-id, the caller will
6290 want to make a SCOPE_REF to represent the qualified-id. This
6291 function does not do this in order to avoid wastefully creating
6292 SCOPE_REFs when they are not required.
6294 If TEMPLATE_KEYWORD_P is true, then we have just seen the
6295 `template' keyword.
6297 If CHECK_DEPENDENCY_P is false, then names are looked up inside
6298 uninstantiated templates.
6300 If *TEMPLATE_P is non-NULL, it is set to true iff the
6301 `template' keyword is used to explicitly indicate that the entity
6302 named is a template.
6304 If DECLARATOR_P is true, the id-expression is appearing as part of
6305 a declarator, rather than as part of an expression. */
6307 static cp_expr
6314 {
6318 /* Assume the `template' keyword was not used. */
6322 /* Look for the optional `::' operator. */
6323 global_scope_p
6324 = (!template_keyword_p
6329 /* Look for the optional nested-name-specifier. */
6330 nested_name_specifier_p
6333 check_dependency_p,
6335 declarator_p,
6336 template_keyword_p)
6342 /* Peek at the next token. */
6345 /* If there is a nested-name-specifier, then we are looking at
6346 the first qualified-id production. */
6348 {
6349 tree saved_object_scope;
6350 tree saved_qualifying_scope;
6352 /* See if the next token is the `template' keyword. */
6356 /* Name lookup we do during the processing of the
6357 unqualified-id might obliterate SCOPE. */
6360 /* Process the final unqualified-id. */
6362 check_dependency_p,
6363 declarator_p,
6365 /* Restore the SAVED_SCOPE for our caller. */
6369 }
6370 /* Otherwise, if we are in global scope, then we are looking at one
6371 of the other qualified-id productions. */
6373 {
6374 /* If it's an identifier, and the next token is not a "<", then
6375 we can avoid the template-id case. This is an optimization
6376 for this common case. */
6378 && !cp_parser_nth_token_starts_template_argument_list_p
6383 /* Try a template-id. */
6387 declarator_p);
6388 /* If that worked, we're done. */
6392 /* Peek at the next token. (Changes in the token buffer may
6393 have invalidated the pointer obtained above.) */
6397 {
6404 {
6407 }
6408 /* Fall through. */
6413 }
6414 }
6415 else
6416 {
6421 declarator_p,
6422 optional_p);
6423 }
6426 && warn_missing_template_keyword
6427 && !template_keyword_p
6428 /* Don't warn if we're looking inside templates. */
6429 && check_dependency_p
6430 /* In a template argument list a > could be closing
6431 the enclosing targs. */
6434 /* Don't confuse an ill-formed constructor declarator for a missing
6435 template keyword in a return type. */
6439 OPT_Wmissing_template_keyword))
6440 {
6443 /* An operator after the > suggests that the > ends a
6444 template-id; a name or literal suggests that the > is an
6445 operator. */
6449 }
6452 }
6454 /* Parse an unqualified-id.
6456 unqualified-id:
6457 identifier
6458 operator-function-id
6459 conversion-function-id
6460 ~ class-name
6461 template-id
6463 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
6464 keyword, in a construct like `A::template ...'.
6466 Returns a representation of unqualified-id. For the `identifier'
6467 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
6468 production a BIT_NOT_EXPR is returned; the operand of the
6469 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
6470 other productions, see the documentation accompanying the
6471 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
6472 names are looked up in uninstantiated templates. If DECLARATOR_P
6473 is true, the unqualified-id is appearing as part of a declarator,
6474 rather than as part of an expression. */
6476 static cp_expr
6482 {
6485 /* Peek at the next token. */
6489 {
6491 {
6492 tree id;
6494 /* We don't know yet whether or not this will be a
6495 template-id. */
6497 /* Try a template-id. */
6499 check_dependency_p,
6500 declarator_p);
6501 /* If it worked, we're done. */
6504 /* Otherwise, it's an ordinary identifier. */
6506 }
6510 check_dependency_p,
6511 declarator_p);
6514 {
6515 tree type_decl;
6516 tree qualifying_scope;
6517 tree object_scope;
6518 tree scope;
6522 /* Consume the `~' token. */
6524 /* Parse the class-name. The standard, as written, seems to
6525 say that:
6527 template <typename T> struct S { ~S (); };
6528 template <typename T> S<T>::~S() {}
6530 is invalid, since `~' must be followed by a class-name, but
6531 `S<T>' is dependent, and so not known to be a class.
6532 That's not right; we need to look in uninstantiated
6533 templates. A further complication arises from:
6535 template <typename T> void f(T t) {
6536 t.T::~T();
6537 }
6539 Here, it is not possible to look up `T' in the scope of `T'
6540 itself. We must look in both the current scope, and the
6541 scope of the containing complete expression.
6543 Yet another issue is:
6545 struct S {
6546 int S;
6547 ~S();
6548 };
6550 S::~S() {}
6552 The standard does not seem to say that the `S' in `~S'
6553 should refer to the type `S' and not the data member
6554 `S::S'. */
6556 /* DR 244 says that we look up the name after the "~" in the
6557 same scope as we looked up the qualifying name. That idea
6558 isn't fully worked out; it's more complicated than that. */
6563 /* Check for invalid scopes. */
6565 {
6569 }
6571 {
6575 scope);
6580 }
6582 {
6588 }
6594 /* Create a location with caret == start at the tilde,
6595 finishing at the end of the peeked token, e.g:
6596 ~token
6597 ^~~~~~. */
6598 location_t loc
6601 /* If the name is of the form "X::~X" it's OK even if X is a
6602 typedef. */
6611 {
6614 }
6616 /* ~auto means the destructor of whatever the object is. */
6618 {
6621 "%<~auto%> only available with "
6625 }
6627 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
6628 declarator-id of a constructor or destructor. */
6631 {
6635 }
6637 /* If there was an explicit qualification (S::~T), first look
6638 in the scope given by the qualification (i.e., S).
6640 Note: in the calls to cp_parser_class_name below we pass
6641 typename_type so that lookup finds the injected-class-name
6642 rather than the constructor. */
6646 {
6651 typename_type,
6654 declarator_p);
6657 }
6658 /* In "N::S::~S", look in "N" as well. */
6660 {
6665 type_decl
6669 typename_type,
6672 declarator_p);
6675 }
6676 /* In "p->S::~T", look in the scope given by "*p" as well. */
6678 {
6683 type_decl
6687 typename_type,
6690 declarator_p);
6693 }
6694 /* Look in the surrounding context. */
6696 {
6702 type_decl
6706 typename_type,
6709 declarator_p);
6712 {
6713 /* We couldn't find a type with this name. If we're parsing
6714 tentatively, fail and try something else. */
6716 {
6719 }
6720 /* Otherwise, accept it and check for a match at instantiation
6721 time. */
6726 }
6727 }
6728 /* If an error occurred, assume that the name of the
6729 destructor is the same as the name of the qualifying
6730 class. That allows us to keep parsing after running
6731 into ill-formed destructor names. */
6737 /* Check that destructor name and scope match. */
6739 {
6746 }
6748 /* [class.dtor]
6750 A typedef-name that names a class shall not be used as the
6751 identifier in the declarator for a destructor declaration. */
6758 type_decl);
6761 }
6765 {
6766 cp_expr id;
6768 /* This could be a template-id, so we try that first. */
6770 /* Try a template-id. */
6773 declarator_p);
6774 /* If that worked, we're done. */
6777 /* We still don't know whether we're looking at an
6778 operator-function-id or a conversion-function-id. */
6780 /* Try an operator-function-id. */
6782 /* If that didn't work, try a conversion-function-id. */
6787 }
6788 /* Fall through. */
6795 }
6796 }
6798 /* Check [temp.names]/5: A name prefixed by the keyword template shall
6799 be a template-id or the name shall refer to a class template or an
6800 alias template. */
6802 static void
6804 {
6814 /* Alias templates are also OK. */
6821 name);
6822 }
6824 /* Parse an (optional) nested-name-specifier.
6826 nested-name-specifier: [C++98]
6827 class-or-namespace-name :: nested-name-specifier [opt]
6828 class-or-namespace-name :: template nested-name-specifier [opt]
6830 nested-name-specifier: [C++0x]
6831 type-name ::
6832 namespace-name ::
6833 nested-name-specifier identifier ::
6834 nested-name-specifier template [opt] simple-template-id ::
6836 PARSER->SCOPE should be set appropriately before this function is
6837 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6838 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6839 in name lookups.
6841 Sets PARSER->SCOPE to the class (TYPE) or namespace
6842 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6843 it unchanged if there is no nested-name-specifier. Returns the new
6844 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6846 If CHECK_DEPENDENCY_P is FALSE, names are looked up in dependent scopes.
6848 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6849 part of a declaration and/or decl-specifier. */
6851 static tree
6858 {
6863 /* Remember where the nested-name-specifier starts. */
6866 {
6869 }
6872 {
6873 tree new_scope;
6874 tree old_scope;
6875 tree saved_qualifying_scope;
6877 /* Spot cases that cannot be the beginning of a
6878 nested-name-specifier. */
6881 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6882 the already parsed nested-name-specifier. */
6884 {
6885 /* Grab the nested-name-specifier and continue the loop. */
6887 /* If we originally encountered this nested-name-specifier
6888 with CHECK_DEPENDENCY_P set to true, we will not have
6889 resolved TYPENAME_TYPEs, so we must do so here. */
6891 && !check_dependency_p
6893 {
6898 }
6901 }
6903 /* Spot cases that cannot be the beginning of a
6904 nested-name-specifier. On the second and subsequent times
6905 through the loop, we look for the `template' keyword. */
6907 ;
6908 /* A template-id can start a nested-name-specifier. */
6910 ;
6911 /* DR 743: decltype can be used in a nested-name-specifier. */
6913 ;
6914 else
6915 {
6916 /* If the next token is not an identifier, then it is
6917 definitely not a type-name or namespace-name. */
6920 /* If the following token is neither a `<' (to begin a
6921 template-id), nor a `::', then we are not looking at a
6922 nested-name-specifier. */
6928 /* name:name is a valid sequence in an Objective C message. */
6930 {
6934 "found %<:%> in nested-name-specifier, "
6937 }
6940 && !cp_parser_nth_token_starts_template_argument_list_p
6943 }
6945 /* The nested-name-specifier is optional, so we parse
6946 tentatively. */
6949 /* Look for the optional `template' keyword, if this isn't the
6950 first time through the loop. */
6952 {
6954 /* DR1710: "In a qualified-id used as the name in
6955 a typename-specifier, elaborated-type-specifier, using-declaration,
6956 or class-or-decltype, an optional keyword template appearing at
6957 the top level is ignored." */
6959 && typename_keyword_p
6962 }
6964 /* Save the old scope since the name lookup we are about to do
6965 might destroy it. */
6968 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6969 look up names in "X<T>::I" in order to determine that "Y" is
6970 a template. So, if we have a typename at this point, we make
6971 an effort to look through it. */
6973 && !check_dependency_p
6974 && !typename_keyword_p
6979 /* Parse the qualifying entity. */
6980 new_scope
6982 typename_keyword_p,
6983 template_keyword_p,
6984 check_dependency_p,
6985 type_p,
6986 is_declaration);
6987 /* Look for the `::' token. */
6990 /* If we found what we wanted, we keep going; otherwise, we're
6991 done. */
6993 {
6996 /* Restore the OLD_SCOPE since it was valid before the
6997 failed attempt at finding the last
6998 class-or-namespace-name. */
7002 /* If the next token is a decltype, and the one after that is a
7003 `::', then the decltype has failed to resolve to a class or
7004 enumeration type. Give this error even when parsing
7005 tentatively since it can't possibly be valid--and we're going
7006 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
7007 won't get another chance.*/
7011 {
7017 dtype);
7020 /* As below. */
7023 }
7027 {
7028 /* If we have a non-type template-id followed by ::, it can't
7029 possibly be valid. */
7034 {
7037 {
7044 else
7047 }
7048 else
7049 {
7055 else
7056 {
7057 /* Variable template. */
7061 }
7062 }
7069 /* As below. */
7073 }
7074 }
7078 /* If the next token is an identifier, and the one after
7079 that is a `::', then any valid interpretation would have
7080 found a class-or-namespace-name. */
7086 {
7089 {
7091 {
7092 tree decl;
7093 tree ambiguous_decls;
7096 none_type,
7105 decl);
7107 {
7108 // cp_parser_lookup_name has the same diagnostic,
7109 // thus make sure to emit it at most once.
7112 {
7117 }
7119 }
7120 else
7121 {
7123 cp_parser_name_lookup_error
7126 else
7127 cp_parser_name_lookup_error
7130 }
7131 }
7134 /* Treat this as a successful nested-name-specifier
7135 due to:
7137 [basic.lookup.qual]
7139 If the name found is not a class-name (clause
7140 _class_) or namespace-name (_namespace.def_), the
7141 program is ill-formed. */
7143 }
7145 }
7147 }
7148 /* We've found one valid nested-name-specifier. */
7150 /* Name lookup always gives us a DECL. */
7153 /* Uses of "template" must be followed by actual templates. */
7156 /* If it is a class scope, try to complete it; we are about to
7157 be looking up names inside the class. */
7159 /* Since checking types for dependency can be expensive,
7160 avoid doing it if the type is already complete. */
7162 /* Do not try to complete dependent types. */
7164 {
7166 /* If it is a typedef to current class, use the current
7167 class instead, as the typedef won't have any names inside
7168 it yet. */
7172 }
7173 /* Make sure we look in the right scope the next time through
7174 the loop. */
7176 }
7178 /* If parsing tentatively, replace the sequence of tokens that makes
7179 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
7180 token. That way, should we re-parse the token stream, we will
7181 not have to repeat the effort required to do the parse, nor will
7182 we issue duplicate error messages. */
7184 {
7188 /* Reset the contents of the START token. */
7190 /* Retrieve any deferred checks. Do not pop this access checks yet
7191 so the memory will not be reclaimed during token replacing below. */
7200 /* Purge all subsequent tokens. */
7202 }
7208 }
7210 /* Parse a nested-name-specifier. See
7211 cp_parser_nested_name_specifier_opt for details. This function
7212 behaves identically, except that it will an issue an error if no
7213 nested-name-specifier is present. */
7215 static tree
7221 {
7222 tree scope;
7224 /* Look for the nested-name-specifier. */
7226 typename_keyword_p,
7227 check_dependency_p,
7228 type_p,
7229 is_declaration);
7230 /* If it was not present, issue an error message. */
7232 {
7235 }
7238 }
7240 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
7241 this is either a class-name or a namespace-name (which corresponds
7242 to the class-or-namespace-name production in the grammar). For
7243 C++0x, it can also be a type-name that refers to an enumeration
7244 type or a simple-template-id.
7246 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
7247 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
7248 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
7249 TYPE_P is TRUE iff the next name should be taken as a class-name,
7250 even the same name is declared to be another entity in the same
7251 scope.
7253 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
7254 specified by the class-or-namespace-name. If neither is found the
7255 ERROR_MARK_NODE is returned. */
7257 static tree
7264 {
7265 tree saved_scope;
7266 tree saved_qualifying_scope;
7267 tree saved_object_scope;
7268 tree scope;
7272 /* DR 743: decltype can appear in a nested-name-specifier. */
7274 {
7278 {
7281 }
7285 }
7287 /* Before we try to parse the class-name, we must save away the
7288 current PARSER->SCOPE since cp_parser_class_name will destroy
7289 it. */
7293 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
7294 there is no need to look for a namespace-name. */
7295 only_class_p = template_keyword_p
7300 typename_keyword_p,
7301 template_keyword_p,
7303 check_dependency_p,
7305 is_declaration,
7308 /* If that didn't work, try for a namespace-name. */
7310 {
7311 /* Restore the saved scope. */
7315 /* If we are not looking at an identifier followed by the scope
7316 resolution operator, then this is not part of a
7317 nested-name-specifier. (Note that this function is only used
7318 to parse the components of a nested-name-specifier.) */
7323 }
7326 }
7328 /* Return true if we are looking at a compound-literal, false otherwise. */
7330 static bool
7332 {
7335 /* Skip tokens until the next token is a closing parenthesis.
7336 If we find the closing `)', and the next token is a `{', then
7337 we are looking at a compound-literal. */
7338 bool compound_literal_p
7343 /* Roll back the tokens we skipped. */
7347 }
7349 /* Return true if EXPR is the integer constant zero or a complex constant
7350 of zero, without any folding, but ignoring location wrappers. */
7352 bool
7354 {
7357 }
7359 /* Parse a postfix-expression.
7361 postfix-expression:
7362 primary-expression
7363 postfix-expression [ expression ]
7364 postfix-expression ( expression-list [opt] )
7365 simple-type-specifier ( expression-list [opt] )
7366 typename :: [opt] nested-name-specifier identifier
7367 ( expression-list [opt] )
7368 typename :: [opt] nested-name-specifier template [opt] template-id
7369 ( expression-list [opt] )
7370 postfix-expression . template [opt] id-expression
7371 postfix-expression -> template [opt] id-expression
7372 postfix-expression . pseudo-destructor-name
7373 postfix-expression -> pseudo-destructor-name
7374 postfix-expression ++
7375 postfix-expression --
7376 dynamic_cast < type-id > ( expression )
7377 static_cast < type-id > ( expression )
7378 reinterpret_cast < type-id > ( expression )
7379 const_cast < type-id > ( expression )
7380 typeid ( expression )
7381 typeid ( type-id )
7383 GNU Extension:
7385 postfix-expression:
7386 ( type-id ) { initializer-list , [opt] }
7388 This extension is a GNU version of the C99 compound-literal
7389 construct. (The C99 grammar uses `type-name' instead of `type-id',
7390 but they are essentially the same concept.)
7392 If ADDRESS_P is true, the postfix expression is the operand of the
7393 `&' operator. CAST_P is true if this expression is the target of a
7394 cast.
7396 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
7397 class member access expressions [expr.ref].
7399 Returns a representation of the expression. */
7401 static cp_expr
7405 {
7407 location_t loc;
7413 /* Peek at the next token. */
7418 /* Some of the productions are determined by keywords. */
7421 {
7426 {
7427 tree type;
7428 cp_expr expression;
7432 /* All of these can be handled in the same way from the point
7433 of view of parsing. Begin by consuming the token
7434 identifying the cast. */
7437 /* New types cannot be defined in the cast. */
7439 parser->type_definition_forbidden_message
7442 /* Look for the opening `<'. */
7444 /* Parse the type to which we are casting. */
7448 NULL);
7450 /* Look for the closing `>'. */
7452 /* Restore the old message. */
7455 bool saved_greater_than_is_operator_p
7459 /* And the expression which is being cast. */
7460 matching_parens parens;
7464 RT_CLOSE_PAREN);
7468 parser->greater_than_is_operator_p
7471 /* Only type conversions to integral or enumeration types
7472 can be used in constant-expressions. */
7475 {
7478 }
7480 /* Construct a location e.g. :
7481 reinterpret_cast <int *> (expr)
7482 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
7483 ranging from the start of the "*_cast" token to the final closing
7484 paren, with the caret at the start. */
7488 {
7490 postfix_expression
7492 tf_warning_or_error);
7495 postfix_expression
7497 tf_warning_or_error);
7500 postfix_expression
7502 tf_warning_or_error);
7505 postfix_expression
7507 tf_warning_or_error);
7511 }
7512 }
7516 {
7517 tree type;
7521 /* Consume the `typeid' token. */
7523 /* Look for the `(' token. */
7524 matching_parens parens;
7526 /* Types cannot be defined in a `typeid' expression. */
7528 parser->type_definition_forbidden_message
7530 /* We can't be sure yet whether we're looking at a type-id or an
7531 expression. */
7533 /* Try a type-id first. */
7538 /* Look for the `)' token. Otherwise, we can't be sure that
7539 we're not looking at an expression: consider `typeid (int
7540 (3))', for example. */
7542 /* If all went well, simply lookup the type-id. */
7545 /* Otherwise, fall back to the expression variant. */
7546 else
7547 {
7548 tree expression;
7550 /* Look for an expression. */
7552 /* Compute its typeid. */
7554 /* Look for the `)' token. */
7556 }
7557 /* Restore the saved message. */
7559 /* `typeid' may not appear in an integral constant expression. */
7563 /* Construct a location e.g. :
7564 typeid (expr)
7565 ^~~~~~~~~~~~~
7566 ranging from the start of the "typeid" token to the final closing
7567 paren, with the caret at the start. */
7569 {
7570 location_t typeid_loc
7574 }
7575 }
7579 {
7580 tree type;
7581 /* The syntax permitted here is the same permitted for an
7582 elaborated-type-specifier. */
7589 }
7597 {
7605 {
7608 }
7614 {
7617 postfix_expression
7619 else
7620 {
7624 }
7630 tf_warning_or_error);
7631 else
7632 {
7636 }
7644 else
7645 {
7649 }
7654 postfix_expression
7658 postfix_expression
7661 else
7662 {
7666 }
7671 {
7675 }
7676 else
7677 {
7678 postfix_expression
7680 }
7685 }
7687 }
7690 {
7691 tree expression;
7692 tree type;
7693 /* Consume the `__builtin_convertvector' token. */
7695 /* Look for the opening `('. */
7696 matching_parens parens;
7698 /* Now, parse the assignment-expression. */
7700 /* Look for the `,'. */
7702 location_t type_location
7704 /* Parse the type-id. */
7705 {
7708 }
7709 /* Look for the closing `)'. */
7711 postfix_expression
7713 tf_warning_or_error);
7715 }
7718 {
7719 tree expression;
7720 tree type;
7721 /* Consume the `__builtin_bit_cast' token. */
7723 /* Look for the opening `('. */
7724 matching_parens parens;
7726 location_t type_location
7728 /* Parse the type-id. */
7729 {
7732 }
7733 /* Look for the `,'. */
7735 /* Now, parse the assignment-expression. */
7737 /* Look for the closing `)'. */
7739 postfix_expression
7741 tf_warning_or_error);
7743 }
7746 {
7747 tree type;
7749 /* If the next thing is a simple-type-specifier, we may be
7750 looking at a functional cast. We could also be looking at
7751 an id-expression. So, we try the functional cast, and if
7752 that doesn't work we fall back to the primary-expression. */
7754 /* Look for the simple-type-specifier. */
7758 CP_PARSER_FLAGS_NONE);
7760 /* Parse the cast itself. */
7762 postfix_expression
7764 /* If that worked, we're done. */
7768 /* If the functional-cast didn't work out, try a
7769 compound-literal. */
7772 {
7777 matching_parens parens;
7780 /* Avoid calling cp_parser_type_id pointlessly, see comment
7781 in cp_parser_cast_expression about c++/29234. */
7784 else
7785 {
7786 /* Parse the type. */
7792 }
7794 /* If things aren't going well, there's no need to
7795 keep going. */
7797 /* Parse the brace-enclosed initializer list. */
7799 /* If that worked, we're definitely looking at a
7800 compound-literal expression. */
7802 {
7803 /* Warn the user that a compound literal is not
7804 allowed in standard C++. */
7807 /* For simplicity, we disallow compound literals in
7808 constant-expressions. We could
7809 allow compound literals of integer type, whose
7810 initializer was a constant, in constant
7811 expressions. Permitting that usage, as a further
7812 extension, would not change the meaning of any
7813 currently accepted programs. (Of course, as
7814 compound literals are not part of ISO C++, the
7815 standard has nothing to say.) */
7817 NIC_NCC))
7818 {
7821 }
7822 /* Form the representation of the compound-literal. */
7823 postfix_expression
7828 }
7829 }
7831 /* It must be a primary-expression. */
7832 postfix_expression
7835 decltype_p,
7837 }
7839 }
7841 /* Note that we don't need to worry about calling build_cplus_new on a
7842 class-valued CALL_EXPR in decltype when it isn't the end of the
7843 postfix-expression; unary_complex_lvalue will take care of that for
7844 all these cases. */
7846 /* Keep looping until the postfix-expression is complete. */
7848 {
7852 /* It is not a Koenig lookup function call. */
7853 postfix_expression
7856 /* Peek at the next token. */
7860 {
7863 {
7865 "two consecutive %<[%> shall "
7868 }
7869 postfix_expression
7871 postfix_expression,
7873 decltype_p);
7882 /* postfix-expression ( expression-list [opt] ) */
7883 {
7895 tree stripped_expression
7897 is_builtin_constant_p
7900 {
7901 /* The whole point of __builtin_constant_p is to allow
7902 non-constant expressions to appear as arguments. */
7903 saved_integral_constant_expression_p
7905 saved_non_integral_constant_expression_p
7908 }
7909 args = (cp_parser_parenthesized_expression_list
7916 {
7917 parser->integral_constant_expression_p
7919 parser->non_integral_constant_expression_p
7921 }
7924 {
7927 }
7929 /* Function calls are not permitted in
7930 constant-expressions. */
7933 NIC_FUNC_CALL))
7934 {
7938 }
7943 {
7945 /* In C++20, we may need to perform ADL for a template
7946 name. */
7949 {
7951 {
7954 postfix_expression
7956 complain);
7957 }
7958 else
7959 postfix_expression
7961 }
7962 /* We do not perform argument-dependent lookup if
7963 normal lookup finds a non-function, in accordance
7964 with the expected resolution of DR 218. */
7967 {
7968 /* Do not do argument dependent lookup if regular
7969 lookup finds a member function or a block-scope
7970 function declaration. [basic.lookup.argdep]/3 */
7974 {
7980 {
7983 }
7984 }
7987 {
7990 postfix_expression
7992 complain);
7993 }
7994 }
7995 }
7997 /* Temporarily set input_location to the combined location
7998 with call expression range, as e.g. build_out_target_exprs
7999 called from convert_default_arg relies on input_location,
8000 so updating it only when the call is fully built results
8001 in inconsistencies between location handling in templates
8002 and outside of templates. */
8005 close_paren_loc);
8009 {
8019 {
8021 postfix_expression
8023 }
8025 {
8026 postfix_expression
8027 = (build_new_method_call
8033 complain));
8034 }
8035 else
8036 postfix_expression
8040 complain);
8041 }
8045 postfix_expression = (build_offset_ref_call_from_tree
8047 complain));
8049 /* A call to a static class member, or a namespace-scope
8050 function. */
8051 postfix_expression
8054 koenig_p,
8055 complain);
8056 else
8057 /* All other function calls. */
8058 {
8063 {
8067 }
8068 postfix_expression
8071 koenig_p,
8072 complain);
8073 }
8077 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
8081 }
8086 /* postfix-expression . template [opt] id-expression
8087 postfix-expression . pseudo-destructor-name
8088 postfix-expression -> template [opt] id-expression
8089 postfix-expression -> pseudo-destructor-name */
8091 /* Consume the `.' or `->' operator. */
8094 postfix_expression
8096 postfix_expression,
8103 /* postfix-expression ++ */
8104 /* Consume the `++' token. */
8106 /* Generate a representation for the complete expression. */
8107 postfix_expression
8109 POSTINCREMENT_EXPR);
8110 /* Increments may not appear in constant-expressions. */
8118 /* postfix-expression -- */
8119 /* Consume the `--' token. */
8121 /* Generate a representation for the complete expression. */
8122 postfix_expression
8124 POSTDECREMENT_EXPR);
8125 /* Decrements may not appear in constant-expressions. */
8136 return is_member_access
8137 ? postfix_expression
8139 else
8141 }
8142 }
8143 }
8145 /* Helper function for cp_parser_parenthesized_expression_list and
8146 cp_parser_postfix_open_square_expression. Parse a single element
8147 of parenthesized expression list. */
8149 static cp_expr
8153 {
8157 /* Parse the next assignment-expression. */
8159 {
8160 /* A braced-init-list. */
8166 }
8168 {
8174 }
8175 else
8178 /* If we have an ellipsis, then this is an expression expansion. */
8181 {
8182 /* Consume the `...'. */
8185 /* Build the argument pack. */
8187 }
8189 }
8191 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8192 by cp_parser_builtin_offsetof. We're looking for
8194 postfix-expression [ expression ]
8195 postfix-expression [ braced-init-list ] (C++11)
8196 postfix-expression [ expression-list[opt] ] (C++23)
8198 FOR_OFFSETOF is set if we're being called in that context, which
8199 changes how we deal with integer constant expressions. */
8201 static tree
8203 tree postfix_expression,
8206 {
8212 /* Consume the `[' token. */
8218 /* Parse the index expression. */
8219 /* ??? For offsetof, there is a question of what to allow here. If
8220 offsetof is not being used in an integral constant expression context,
8221 then we *could* get the right answer by computing the value at runtime.
8222 If we are in an integral constant expression context, then we might
8223 could accept any constant expression; hard to say without analysis.
8224 Rather than open the barn door too wide right away, allow only integer
8225 constant expressions here. */
8228 else
8229 {
8234 {
8236 {
8237 cp_expr expr
8239 /*cast_p=*/
8241 /*allow_exp_p=*/
8243 /*non_cst_p=*/
8244 NULL);
8251 else
8254 /* If the next token isn't a `,', then we are done. */
8259 {
8262 }
8264 /* Otherwise, consume the `,' and keep going. */
8266 }
8269 }
8271 {
8275 }
8276 else
8280 }
8284 /* Look for the closing `]'. */
8287 /* Build the ARRAY_REF. */
8290 tf_warning_or_error
8293 /* When not doing offsetof, array references are not permitted in
8294 constant-expressions. */
8300 }
8302 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
8303 dereference of incomplete type, returns true if error_mark_node should
8304 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
8305 and *DEPENDENT_P. */
8307 bool
8310 {
8311 /* In a template, be permissive by treating an object expression
8312 of incomplete type as dependent (after a pedwarn). */
8313 diagnostic_t kind = (processing_template_decl
8317 {
8329 /* Don't emit any diagnostic for OVERLOADs. */
8333 /* Avoid clobbering e.g. DECLs. */
8337 }
8349 {
8352 }
8354 }
8356 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8357 by cp_parser_builtin_offsetof. We're looking for
8359 postfix-expression . template [opt] id-expression
8360 postfix-expression . pseudo-destructor-name
8361 postfix-expression -> template [opt] id-expression
8362 postfix-expression -> pseudo-destructor-name
8364 FOR_OFFSETOF is set if we're being called in that context. That sorta
8365 limits what of the above we'll actually accept, but nevermind.
8366 TOKEN_TYPE is the "." or "->" token, which will already have been
8367 removed from the stream. */
8369 static tree
8372 cp_expr postfix_expression,
8374 location_t location)
8375 {
8376 tree name;
8382 /* If this is a `->' operator, dereference the pointer. */
8385 tf_warning_or_error);
8386 /* Check to see whether or not the expression is type-dependent and
8387 not the current instantiation. */
8389 /* The identifier following the `->' or `.' is not qualified. */
8395 /* Enter the scope corresponding to the type of the object
8396 given by the POSTFIX_EXPRESSION. */
8398 {
8400 /* According to the standard, no expression should ever have
8401 reference type. Unfortunately, we do not currently match
8402 the standard in this respect in that our internal representation
8403 of an expression may have reference type even when the standard
8404 says it does not. Therefore, we have to manually obtain the
8405 underlying type here. */
8407 /* The type of the POSTFIX_EXPRESSION must be complete. */
8408 /* Unlike the object expression in other contexts, *this is not
8409 required to be of complete type for purposes of class member
8410 access (5.2.5) outside the member function body. */
8414 {
8420 }
8423 {
8424 /* Let the name lookup machinery know that we are processing a
8425 class member access expression. */
8427 /* If something went wrong, we want to be able to discern that case,
8428 as opposed to the case where there was no SCOPE due to the type
8429 of expression being dependent. */
8432 /* If the SCOPE was erroneous, make the various semantic analysis
8433 functions exit quickly -- and without issuing additional error
8434 messages. */
8437 }
8438 }
8441 {
8443 /* If we don't have a (type-dependent) object of class type, use
8444 typeof to figure out the type of the object. */
8448 }
8450 /* Assume this expression is not a pseudo-destructor access. */
8453 /* If the SCOPE is a scalar type, then, if this is a valid program,
8454 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
8455 is type dependent, it can be pseudo-destructor-name or something else.
8456 Try to parse it as pseudo-destructor-name first. */
8458 {
8459 tree s;
8460 tree type;
8463 /* Parse the pseudo-destructor-name. */
8472 {
8474 postfix_expression
8477 }
8478 }
8481 {
8482 /* If the SCOPE is not a scalar type, we are looking at an
8483 ordinary class member access expression, rather than a
8484 pseudo-destructor-name. */
8487 /* Parse the id-expression. */
8488 name = (cp_parser_id_expression
8495 /* In general, build a SCOPE_REF if the member name is qualified.
8496 However, if the name was not dependent and has already been
8497 resolved; there is no need to build the SCOPE_REF. For example;
8499 struct X { void f(); };
8500 template <typename T> void f(T* t) { t->X::f(); }
8502 Even though "t" is dependent, "X::f" is not and has been resolved
8503 to a BASELINK; there is no need to include scope information. */
8505 /* But we do need to remember that there was an explicit scope for
8506 virtual function calls. */
8510 /* If the name is a template-id that names a type, we will get a
8511 TYPE_DECL here. That is invalid code. */
8513 {
8516 }
8517 else
8518 {
8520 {
8522 {
8526 }
8527 else
8530 name,
8531 template_p);
8535 }
8537 adjust_result_of_qualified_name_lookup
8539 postfix_expression
8541 template_p,
8542 tf_warning_or_error);
8543 /* Build a location e.g.:
8544 ptr->access_expr
8545 ~~~^~~~~~~~~~~~~
8546 where the caret is at the deref token, ranging from
8547 the start of postfix_expression to the end of the access expr. */
8548 location_t combined_loc
8551 }
8552 }
8554 /* We no longer need to look up names in the scope of the object on
8555 the left-hand side of the `.' or `->' operator. */
8558 /* Outside of offsetof, these operators may not appear in
8559 constant-expressions. */
8561 && (cp_parser_non_integral_constant_expression
8566 }
8568 /* Parse a parenthesized expression-list.
8570 expression-list:
8571 assignment-expression
8572 expression-list, assignment-expression
8574 attribute-list:
8575 expression-list
8576 identifier
8577 identifier, expression-list
8579 CAST_P is true if this expression is the target of a cast.
8581 ALLOW_EXPANSION_P is true if this expression allows expansion of an
8582 argument pack.
8584 WRAP_LOCATIONS_P is true if expressions within this list for which
8585 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
8586 their source locations.
8588 Returns a vector of trees. Each element is a representation of an
8589 assignment-expression. NULL is returned if the ( and or ) are
8590 missing. An empty, but allocated, vector is returned on no
8591 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
8592 if we are parsing an attribute list for an attribute that wants a
8593 plain identifier argument, normal_attr for an attribute that wants
8594 an expression, or non_attr if we aren't parsing an attribute list. If
8595 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
8596 not all of the expressions in the list were constant.
8597 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
8598 will be written to with the location of the closing parenthesis. If
8599 an error occurs, it may or may not be written to. */
8609 {
8613 /* Assume all the expressions will be constant. */
8617 matching_parens parens;
8623 /* Within a parenthesized expression, a `>' token is always
8624 the greater-than operator. */
8625 saved_greater_than_is_operator_p
8631 /* Consume expressions until there are no more. */
8634 {
8635 /* At the beginning of attribute lists, check to see if the
8636 next token is an identifier. */
8642 else
8643 expr
8645 allow_expansion_p,
8646 non_constant_p);
8651 /* Add it to the list. We add error_mark_node
8652 expressions to the list, so that we can still tell if
8653 the correct form for a parenthesized expression-list
8654 is found. That gives better errors. */
8660 /* After the first item, attribute lists look the same as
8661 expression lists. */
8664 get_comma:;
8665 /* If the next token isn't a `,', then we are done. */
8669 /* Otherwise, consume the `,' and keep going. */
8671 }
8677 {
8680 skip_comma:;
8681 /* We try and resync to an unnested comma, as that will give the
8682 user better diagnostics. */
8690 {
8691 parser->greater_than_is_operator_p
8694 }
8695 }
8697 parser->greater_than_is_operator_p
8701 }
8703 /* Parse a pseudo-destructor-name.
8705 pseudo-destructor-name:
8706 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
8707 :: [opt] nested-name-specifier template template-id :: ~ type-name
8708 :: [opt] nested-name-specifier [opt] ~ type-name
8710 If either of the first two productions is used, sets *SCOPE to the
8711 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
8712 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
8713 or ERROR_MARK_NODE if the parse fails. */
8715 static void
8717 tree object,
8720 {
8723 /* Handle ~auto. */
8727 {
8730 "%<~auto%> only available with "
8737 }
8739 /* Assume that things will not work out. */
8742 /* Look for the optional `::' operator. */
8744 /* Look for the optional nested-name-specifier. */
8745 nested_name_specifier_p
8752 /* Now, if we saw a nested-name-specifier, we might be doing the
8753 second production. */
8756 {
8757 /* Consume the `template' keyword. */
8759 /* Parse the template-id. */
8763 class_type,
8765 /* Look for the `::' token. */
8767 }
8768 /* If the next token is not a `~', then there might be some
8769 additional qualification. */
8771 {
8772 /* At this point, we're looking for "type-name :: ~". The type-name
8773 must not be a class-name, since this is a pseudo-destructor. So,
8774 it must be either an enum-name, or a typedef-name -- both of which
8775 are just identifiers. So, we peek ahead to check that the "::"
8776 and "~" tokens are present; if they are not, then we can avoid
8777 calling type_name. */
8781 {
8784 }
8786 /* Look for the type-name. */
8791 /* Look for the `::' token. */
8793 }
8794 else
8797 /* Look for the `~'. */
8800 /* Once we see the ~, this has to be a pseudo-destructor. */
8804 /* Look for the type-name again. We are not responsible for
8805 checking that it matches the first type-name. */
8807 }
8809 /* Parse a unary-expression.
8811 unary-expression:
8812 postfix-expression
8813 ++ cast-expression
8814 -- cast-expression
8815 await-expression
8816 unary-operator cast-expression
8817 sizeof unary-expression
8818 sizeof ( type-id )
8819 alignof ( type-id ) [C++0x]
8820 new-expression
8821 delete-expression
8823 GNU Extensions:
8825 unary-expression:
8826 __extension__ cast-expression
8827 __alignof__ unary-expression
8828 __alignof__ ( type-id )
8829 alignof unary-expression [C++0x]
8830 __real__ cast-expression
8831 __imag__ cast-expression
8832 && identifier
8833 sizeof ( type-id ) { initializer-list , [opt] }
8834 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8835 __alignof__ ( type-id ) { initializer-list , [opt] }
8837 ADDRESS_P is true iff the unary-expression is appearing as the
8838 operand of the `&' operator. CAST_P is true if this expression is
8839 the target of a cast.
8841 Returns a representation of the expression. */
8843 static cp_expr
8846 {
8850 /* Peek at the next token. */
8852 /* Some keywords give away the kind of expression. */
8854 {
8858 {
8861 {
8869 /* Consume the token. */
8871 /* Parse the operand. */
8874 /* Construct a location e.g. :
8875 alignof (expr)
8876 ^~~~~~~~~~~~~~
8877 with start == caret at the start of the "alignof"/"sizeof"
8878 token, with the endpoint at the final closing paren. */
8879 location_t compound_loc
8885 else
8886 {
8887 /* ISO C++ defines alignof only with types, not with
8888 expressions. So pedwarn if alignof is used with a non-
8889 type expression. However, __alignof__ is ok. */
8892 "ISO C++ does not allow %<alignof%> "
8897 }
8898 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8899 SIZEOF_EXPR with the original operand. */
8901 {
8903 {
8905 {
8908 error_mark_node));
8910 }
8911 else
8916 }
8917 }
8922 }
8934 {
8935 /* The saved value of the PEDANTIC flag. */
8937 tree expr;
8939 /* Save away the PEDANTIC flag. */
8941 /* Parse the cast-expression. */
8943 /* Restore the PEDANTIC flag. */
8947 }
8951 {
8952 tree expression;
8954 /* Consume the `__real__' or `__imag__' token. */
8956 /* Parse the cast-expression. */
8958 /* Create the complete representation. */
8963 tf_warning_or_error);
8964 }
8972 {
8973 tree expr;
8982 matching_parens parens;
8986 parser->type_definition_forbidden_message
8989 saved_integral_constant_expression_p
8991 saved_non_integral_constant_expression_p
8995 saved_greater_than_is_operator_p
9007 parser->greater_than_is_operator_p
9010 parser->integral_constant_expression_p
9012 parser->non_integral_constant_expression_p
9019 /* Construct a location of the form:
9020 noexcept (expr)
9021 ^~~~~~~~~~~~~~~
9022 with start == caret, finishing at the close-paren. */
9023 location_t noexcept_loc
9027 noexcept_loc);
9028 }
9031 {
9032 tree expr;
9035 /* Consume the `co_await' token. */
9037 /* Parse its cast-expression. */
9042 /* Handle [expr.await]. */
9044 }
9048 }
9049 }
9051 /* Look for the `:: new' and `:: delete', which also signal the
9052 beginning of a new-expression, or delete-expression,
9053 respectively. If the next token is `::', then it might be one of
9054 these. */
9056 {
9059 /* See if the token after the `::' is one of the keywords in
9060 which we're interested. */
9062 /* If it's `new', we have a new-expression. */
9065 /* Similarly, for `delete'. */
9068 }
9070 /* Look for a unary operator. */
9072 /* The `++' and `--' operators can be handled similarly, even though
9073 they are not technically unary-operators in the grammar. */
9075 {
9080 /* Handle the GNU address-of-label extension. */
9083 {
9084 tree identifier;
9085 tree expression;
9088 /* Consume the '&&' token. */
9090 /* Look for the identifier. */
9092 /* Construct a location of the form:
9093 &&label
9094 ^~~~~~~
9095 with caret==start at the "&&", finish at the end of the label. */
9096 location_t combined_loc
9098 /* Create an expression representing the address. */
9101 NIC_ADDR_LABEL))
9104 }
9105 }
9107 {
9108 cp_expr cast_expression;
9114 /* Consume the operator token. */
9118 /* Parse the cast-expression. */
9119 cast_expression
9124 pidk);
9126 /* Make a location:
9127 OP_TOKEN CAST_EXPRESSION
9128 ^~~~~~~~~~~~~~~~~~~~~~~~~
9129 with start==caret at the operator token, and
9130 extending to the end of the cast_expression. */
9133 /* Now, build an appropriate representation. */
9135 {
9140 complain);
9141 /* TODO: build_x_indirect_ref does not always honor the
9142 location, so ensure it is set. */
9148 /* Fall through. */
9151 cast_expression,
9153 /* TODO: build_x_unary_op does not always honor the location,
9154 so ensure it is set. */
9162 /* Fall through. */
9164 /* Immediately fold negation of a constant, unless the constant is 0
9165 (since -0 == 0) or it would overflow. */
9167 {
9168 tree stripped_expr
9173 {
9176 stripped_expr);
9178 {
9181 }
9182 }
9183 }
9184 /* Fall through. */
9193 }
9197 non_constant_p))
9201 }
9205 decltype_p,
9206 pidk);
9207 }
9209 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
9210 unary-operator, the corresponding tree code is returned. */
9212 static enum tree_code
9214 {
9216 {
9237 }
9238 }
9240 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
9241 Returns a representation of the expression. */
9243 static tree
9245 {
9248 /* Consume the __builtin_has_attribute token. */
9251 matching_parens parens;
9255 /* Types cannot be defined in a `sizeof' expression. Save away the
9256 old message. */
9260 parser->type_definition_forbidden_message
9262 parser->type_definition_forbidden_message_arg
9265 /* The restrictions on constant-expressions do not apply inside
9266 sizeof expressions. */
9267 bool saved_integral_constant_expression_p
9269 bool saved_non_integral_constant_expression_p
9273 /* Do not actually evaluate the expression. */
9279 /* We can't be sure yet whether we're looking at a type-id or an
9280 expression. */
9285 /* Look for the type-id. */
9291 /* If the type-id production did not work out, then we must be
9292 looking at an expression. */
9298 /* Go back to evaluating expressions. */
9302 /* And restore the old one. */
9305 parser->integral_constant_expression_p
9307 parser->non_integral_constant_expression_p
9310 /* Consume the comma if it's there. */
9312 {
9316 }
9318 /* Parse the attribute specification. */
9322 {
9328 else
9329 {
9330 /* Fold constant expressions used in attributes first. */
9333 /* Finally, see if OPER has been declared with ATTR. */
9335 }
9338 }
9339 else
9340 {
9343 }
9345 /* Construct a location e.g. :
9346 __builtin_has_attribute (oper, attr)
9347 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
9348 with start == caret at the start of the built-in token,
9349 and with the endpoint at the final closing paren. */
9350 location_t compound_loc
9357 }
9359 /* Parse a new-expression.
9361 new-expression:
9362 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
9363 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
9365 Returns a representation of the expression. */
9367 static tree
9369 {
9372 tree type;
9375 tree ret;
9379 /* Look for the optional `::' operator. */
9380 global_scope_p
9384 /* Look for the `new' operator. */
9386 /* There's no easy way to tell a new-placement from the
9387 `( type-id )' construct. */
9389 /* Look for a new-placement. */
9391 /* If that didn't work out, there's no new-placement. */
9393 {
9397 }
9399 /* If the next token is a `(', then we have a parenthesized
9400 type-id. */
9402 {
9406 /* Consume the `('. */
9407 matching_parens parens;
9410 /* Parse the type-id. */
9411 parser->type_definition_forbidden_message
9413 {
9416 }
9419 /* Look for the closing `)'. */
9422 /* There should not be a direct-new-declarator in this production,
9423 but GCC used to allowed this, so we check and emit a sensible error
9424 message for this case. */
9426 {
9432 }
9433 }
9434 /* Otherwise, there must be a new-type-id. */
9435 else
9438 /* If the next token is a `(' or '{', then we have a new-initializer. */
9443 else
9446 /* A new-expression may not appear in an integral constant
9447 expression. */
9450 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
9451 of a new-type-id or type-id of a new-expression, the new-expression shall
9452 contain a new-initializer of the form ( assignment-expression )".
9453 Additionally, consistently with the spirit of DR 1467, we want to accept
9454 'new auto { 2 }' too. */
9460 {
9462 "initialization of new-expression for type %<auto%> "
9465 }
9466 else
9467 {
9468 /* Construct a location e.g.:
9469 ptr = new int[100]
9470 ^~~~~~~~~~~~
9471 with caret == start at the start of the "new" token, and the end
9472 at the end of the final token we consumed. */
9475 /* Create a representation of the new-expression. */
9478 }
9486 }
9488 /* Parse a new-placement.
9490 new-placement:
9491 ( expression-list )
9493 Returns the same representation as for an expression-list. */
9497 {
9500 /* Parse the expression-list. */
9501 expression_list = (cp_parser_parenthesized_expression_list
9510 }
9512 /* Parse a new-type-id.
9514 new-type-id:
9515 type-specifier-seq new-declarator [opt]
9517 Returns the TYPE allocated. If the new-type-id indicates an array
9518 type, *NELTS is set to the number of elements in the last array
9519 bound; the TYPE will not include the last array bound. */
9521 static tree
9523 {
9524 cp_decl_specifier_seq type_specifier_seq;
9530 /* The type-specifier sequence must not contain type definitions.
9531 (It cannot contain declarations of new types either, but if they
9532 are not definitions we will catch that because they are not
9533 complete.) */
9535 parser->type_definition_forbidden_message
9537 /* Parse the type-specifier-seq. */
9542 /* Restore the old message. */
9548 /* Parse the new-declarator. */
9551 /* Determine the number of elements in the last array dimension, if
9552 any. */
9554 /* Skip down to the last array dimension. */
9559 {
9562 }
9567 {
9570 }
9573 {
9582 else
9584 }
9587 }
9589 /* Parse an (optional) new-declarator.
9591 new-declarator:
9592 ptr-operator new-declarator [opt]
9593 direct-new-declarator
9595 Returns the declarator. */
9599 {
9602 cp_cv_quals cv_quals;
9604 /* We don't know if there's a ptr-operator next, or not. */
9606 /* Look for a ptr-operator. */
9608 /* If that worked, look for more new-declarators. */
9610 {
9613 /* Parse another optional declarator. */
9616 declarator = cp_parser_make_indirect_declarator
9620 }
9622 /* If the next token is a `[', there is a direct-new-declarator. */
9627 }
9629 /* Parse a direct-new-declarator.
9631 direct-new-declarator:
9632 [ expression ]
9633 direct-new-declarator [constant-expression]
9635 */
9639 {
9644 {
9645 tree expression;
9648 /* Look for the opening `['. */
9654 else
9656 /* The standard requires that the expression have integral
9657 type. DR 74 adds enumeration types. We believe that the
9658 real intent is that these expressions be handled like the
9659 expression in a `switch' condition, which also allows
9660 classes with a single conversion to integral or
9661 enumeration type. */
9663 {
9664 expression
9666 expression,
9669 {
9671 "expression in new-declarator must have integral "
9674 }
9675 }
9677 /* Look for the closing `]'. */
9680 /* Add this bound to the declarator. */
9683 /* If the next token is not a `[', then there are no more
9684 bounds. */
9688 }
9691 }
9693 /* Parse a new-initializer.
9695 new-initializer:
9696 ( expression-list [opt] )
9697 braced-init-list
9699 Returns a representation of the expression-list. */
9703 {
9707 {
9713 }
9714 else
9715 expression_list = (cp_parser_parenthesized_expression_list
9721 }
9723 /* Parse a delete-expression.
9725 delete-expression:
9726 :: [opt] delete cast-expression
9727 :: [opt] delete [ ] cast-expression
9729 Returns a representation of the expression. */
9731 static tree
9733 {
9736 tree expression;
9739 /* Look for the optional `::' operator. */
9740 global_scope_p
9744 /* Look for the `delete' keyword. */
9746 /* See if the array syntax is in use. */
9748 {
9749 /* Consume the `[' token. */
9751 /* Look for the `]' token. */
9753 /* Remember that this is the `[]' construct. */
9755 }
9756 else
9759 /* Parse the cast-expression. */
9762 /* A delete-expression may not appear in an integral constant
9763 expression. */
9767 /* Construct a location e.g.:
9768 delete [ ] ptr
9769 ^~~~~~~~~~~~~~
9770 with caret == start at the start of the "delete" token, and
9771 the end at the end of the final token we consumed. */
9778 }
9780 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
9781 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
9782 0 otherwise. */
9784 static int
9786 {
9789 {
9831 /* In ((type ()) () the last () isn't a valid cast-expression,
9832 so the whole must be parsed as postfix-expression. */
9837 /* '[' may start a primary-expression in obj-c++ and in C++11,
9838 as a lambda-expression, eg, '(void)[]{}'. */
9845 /* '++' and '--' may or may not start a cast-expression:
9847 struct T { void operator++(int); };
9848 void f() { (T())++; }
9850 vs
9852 int a;
9853 (int)++a; */
9858 }
9859 }
9861 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
9862 in the order: const_cast, static_cast, reinterpret_cast.
9864 Don't suggest dynamic_cast.
9866 Return the first legal cast kind found, or NULL otherwise. */
9870 {
9871 tree trial;
9873 /* Reuse the parser logic by attempting to build the various kinds of
9874 cast, with "complain" disabled.
9875 Identify the first such cast that is valid. */
9877 /* Don't attempt to run such logic within template processing. */
9881 /* First try const_cast. */
9886 /* If that fails, try static_cast. */
9891 /* Finally, try reinterpret_cast. */
9893 tf_none);
9897 /* No such cast possible. */
9899 }
9901 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
9902 suggesting how to convert a C-style cast of the form:
9904 (DST_TYPE)ORIG_EXPR
9906 to a C++-style cast.
9908 The primary range of RICHLOC is asssumed to be that of the original
9909 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
9910 of the parens in the C-style cast. */
9912 static void
9915 tree dst_type)
9916 {
9917 /* This function is non-trivial, so bail out now if the warning isn't
9918 going to be emitted. */
9922 /* Try to find a legal C++ cast, trying them in order:
9923 const_cast, static_cast, reinterpret_cast. */
9928 /* Replace the open paren with "CAST_SUGGESTION<". */
9929 pretty_printer pp;
9934 /* Replace the close paren with "> (". */
9937 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
9939 }
9942 /* Parse a cast-expression.
9944 cast-expression:
9945 unary-expression
9946 ( type-id ) cast-expression
9948 ADDRESS_P is true iff the unary-expression is appearing as the
9949 operand of the `&' operator. CAST_P is true if this expression is
9950 the target of a cast.
9952 Returns a representation of the expression. */
9954 static cp_expr
9957 {
9958 /* If it's a `(', then we might be looking at a cast. */
9960 {
9966 /* There's no way to know yet whether or not this is a cast.
9967 For example, `(int (3))' is a unary-expression, while `(int)
9968 3' is a cast. So, we resort to parsing tentatively. */
9970 /* Types may not be defined in a cast. */
9972 parser->type_definition_forbidden_message
9974 /* Consume the `('. */
9975 matching_parens parens;
9980 /* A very tricky bit is that `(struct S) { 3 }' is a
9981 compound-literal (which we permit in C++ as an extension).
9982 But, that construct is not a cast-expression -- it is a
9983 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9984 is legal; if the compound-literal were a cast-expression,
9985 you'd need an extra set of parentheses.) But, if we parse
9986 the type-id, and it happens to be a class-specifier, then we
9987 will commit to the parse at that point, because we cannot
9988 undo the action that is done when creating a new class. So,
9989 then we cannot back up and do a postfix-expression.
9991 Another tricky case is the following (c++/29234):
9993 struct S { void operator () (); };
9995 void foo ()
9996 {
9997 ( S()() );
9998 }
10000 As a type-id we parse the parenthesized S()() as a function
10001 returning a function, groktypename complains and we cannot
10002 back up in this case either.
10004 Therefore, we scan ahead to the closing `)', and check to see
10005 if the tokens after the `)' can start a cast-expression. Otherwise
10006 we are dealing with an unary-expression, a postfix-expression
10007 or something else.
10009 Yet another tricky case, in C++11, is the following (c++/54891):
10011 (void)[]{};
10013 The issue is that usually, besides the case of lambda-expressions,
10014 the parenthesized type-id cannot be followed by '[', and, eg, we
10015 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
10016 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
10017 we don't commit, we try a cast-expression, then an unary-expression.
10019 Save tokens so that we can put them back. */
10022 /* We may be looking at a cast-expression. */
10025 cast_expression
10028 /* Roll back the tokens we skipped. */
10030 /* If we aren't looking at a cast-expression, simulate an error so
10031 that the call to cp_parser_error_occurred below returns true. */
10034 else
10035 {
10038 /* Look for the type-id. */
10040 /* Look for the closing `)'. */
10045 }
10047 /* Restore the saved message. */
10050 /* At this point this can only be either a cast or a
10051 parenthesized ctor such as `(T ())' that looks like a cast to
10052 function returning T. */
10054 {
10055 /* Only commit if the cast-expression doesn't start with
10056 '++', '--', or '[' in C++11. */
10064 pidk);
10067 {
10068 /* Warn about old-style casts, if so requested. */
10073 {
10079 }
10081 /* Only type conversions to integral or enumeration types
10082 can be used in constant-expressions. */
10085 NIC_CAST))
10088 /* Perform the cast. */
10089 /* Make a location:
10090 (TYPE) EXPR
10091 ^~~~~~~~~~~
10092 with start==caret at the open paren, extending to the
10093 end of "expr". */
10095 open_paren_loc,
10099 }
10100 }
10101 else
10103 }
10105 /* If we get here, then it's not a cast, so it must be a
10106 unary-expression. */
10109 }
10111 /* Parse a binary expression of the general form:
10113 pm-expression:
10114 cast-expression
10115 pm-expression .* cast-expression
10116 pm-expression ->* cast-expression
10118 multiplicative-expression:
10119 pm-expression
10120 multiplicative-expression * pm-expression
10121 multiplicative-expression / pm-expression
10122 multiplicative-expression % pm-expression
10124 additive-expression:
10125 multiplicative-expression
10126 additive-expression + multiplicative-expression
10127 additive-expression - multiplicative-expression
10129 shift-expression:
10130 additive-expression
10131 shift-expression << additive-expression
10132 shift-expression >> additive-expression
10134 relational-expression:
10135 shift-expression
10136 relational-expression < shift-expression
10137 relational-expression > shift-expression
10138 relational-expression <= shift-expression
10139 relational-expression >= shift-expression
10141 GNU Extension:
10143 relational-expression:
10144 relational-expression <? shift-expression
10145 relational-expression >? shift-expression
10147 equality-expression:
10148 relational-expression
10149 equality-expression == relational-expression
10150 equality-expression != relational-expression
10152 and-expression:
10153 equality-expression
10154 and-expression & equality-expression
10156 exclusive-or-expression:
10157 and-expression
10158 exclusive-or-expression ^ and-expression
10160 inclusive-or-expression:
10161 exclusive-or-expression
10162 inclusive-or-expression | exclusive-or-expression
10164 logical-and-expression:
10165 inclusive-or-expression
10166 logical-and-expression && inclusive-or-expression
10168 logical-or-expression:
10169 logical-and-expression
10170 logical-or-expression || logical-and-expression
10172 All these are implemented with a single function like:
10174 binary-expression:
10175 simple-cast-expression
10176 binary-expression <token> binary-expression
10178 CAST_P is true if this expression is the target of a cast.
10180 The binops_by_token map is used to get the tree codes for each <token> type.
10181 binary-expressions are associated according to a precedence table. */
10183 #define TOKEN_PRECEDENCE(token) \
10184 (((token->type == CPP_GREATER \
10185 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
10186 && !parser->greater_than_is_operator_p) \
10187 ? PREC_NOT_OPERATOR \
10188 : binops_by_token[token->type].prec)
10190 static cp_expr
10196 {
10197 cp_parser_expression_stack stack;
10200 cp_parser_expression_stack_entry current;
10201 cp_expr rhs;
10205 tree overload;
10207 /* Parse the first expression. */
10218 {
10219 /* Get an operator token. */
10225 {
10227 "%<>>%> operator is treated"
10231 }
10236 /* This is a fold-expression; handle it later. */
10239 /* Popping an entry off the stack means we completed a subexpression:
10240 - either we found a token which is not an operator (`>' where it is not
10241 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
10242 will happen repeatedly;
10243 - or, we found an operator which has lower priority. This is the case
10244 where the recursive descent *ascends*, as in `3 * 4 + 5' after
10245 parsing `3 * 4'. */
10247 {
10250 else
10252 }
10254 get_rhs:
10259 /* We used the operator token. */
10262 /* For "false && x" or "true || x", x will never be executed;
10263 disable warnings while evaluating it. */
10268 {
10271 }
10273 /* Extract another operand. It may be the RHS of this expression
10274 or the LHS of a new, higher priority expression. */
10279 /* Get another operator token. Look up its precedence to avoid
10280 building a useless (immediately popped) stack entry for common
10281 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
10288 {
10289 /* ... and prepare to parse the RHS of the new, higher priority
10290 expression. Since precedence levels on the stack are
10291 monotonically increasing, we do not have to care about
10292 stack overflows. */
10301 pop:
10303 /* If the stack is not empty, we have parsed into LHS the right side
10304 (`4' in the example above) of an expression we had suspended.
10305 We can use the information on the stack to recover the LHS (`3')
10306 from the stack together with the tree code (`MULT_EXPR'), and
10307 the precedence of the higher level subexpression
10308 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
10309 which will be used to actually build the additive expression. */
10314 }
10316 /* Undo the disabling of warnings done above. */
10318 {
10321 }
10326 /* Avoid warning for !!x == y. */
10331 /* Avoid warning for !b == y where b is boolean. */
10335 /* Avoid warning for !!b == y where b is boolean. */
10347 /* Don't warn for named "xor" (as opposed to '^'). */
10351 check_for_xor_used_as_pow
10364 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
10365 ERROR_MARK for everything that is not a binary expression.
10366 This makes warn_about_parentheses miss some warnings that
10367 involve unary operators. For unary expressions we should
10368 pass the correct tree_code unless the unary expression was
10369 surrounded by parentheses.
10370 */
10374 {
10377 else
10378 {
10381 current.lhs
10384 == tcc_comparison
10388 }
10389 }
10390 else
10391 {
10397 /* TODO: build_x_binary_op doesn't always honor the location. */
10399 }
10402 /* If the binary operator required the use of an overloaded operator,
10403 then this expression cannot be an integral constant-expression.
10404 An overloaded operator can be used even if both operands are
10405 otherwise permissible in an integral constant-expression if at
10406 least one of the operands is of enumeration type. */
10410 NIC_OVERLOADED))
10412 }
10415 }
10417 static cp_expr
10422 {
10425 }
10427 /* Parse the `? expression : assignment-expression' part of a
10428 conditional-expression. The LOGICAL_OR_EXPR is the
10429 logical-or-expression that started the conditional-expression.
10430 Returns a representation of the entire conditional-expression.
10432 This routine is used by cp_parser_assignment_expression
10433 and cp_parser_conditional_expression.
10435 ? expression : assignment-expression
10437 GNU Extensions:
10439 ? : assignment-expression */
10441 static tree
10443 {
10445 cp_expr assignment_expr;
10449 /* Consume the `?' token. */
10454 {
10457 /* Implicit true clause. */
10459 c_inhibit_evaluation_warnings +=
10462 }
10463 else
10464 {
10467 /* Parse the expression. */
10468 c_inhibit_evaluation_warnings +=
10471 c_inhibit_evaluation_warnings +=
10475 }
10477 /* The next token should be a `:'. */
10479 /* Parse the assignment-expression. */
10481 c_inhibit_evaluation_warnings -=
10484 /* Make a location:
10485 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
10486 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
10487 with the caret at the "?", ranging from the start of
10488 the logical_or_expr to the end of the assignment_expr. */
10493 /* Build the conditional-expression. */
10495 expr,
10496 assignment_expr,
10497 tf_warning_or_error);
10498 }
10500 /* Parse a conditional-expression.
10502 conditional-expression:
10503 logical-or-expression
10504 logical-or-expression ? expression : assignment-expression
10506 GNU Extensions:
10508 logical-or-expression ? : assignment-expression */
10510 static cp_expr
10512 {
10515 /* If the next token is a `?' then we're actually looking at
10516 a conditional-expression; otherwise we're done. */
10520 }
10522 /* Parse an assignment-expression.
10524 assignment-expression:
10525 conditional-expression
10526 logical-or-expression assignment-operator assignment_expression
10527 throw-expression
10528 yield-expression
10530 CAST_P is true if this expression is the target of a cast.
10531 DECLTYPE_P is true if this expression is the operand of decltype.
10533 Returns a representation for the expression. */
10535 static cp_expr
10538 {
10539 cp_expr expr;
10541 /* If the next token is the `throw' keyword, then we're looking at
10542 a throw-expression. */
10545 /* If the next token is the `co_yield' keyword, then we're looking at
10546 a yield-expression. */
10549 /* Otherwise, it must be that we are looking at a
10550 logical-or-expression. */
10551 else
10552 {
10553 /* Parse the binary expressions (logical-or-expression). */
10555 decltype_p,
10557 /* If the next token is a `?' then we're actually looking at a
10558 conditional-expression. */
10561 else
10562 {
10565 /* If it's an assignment-operator, we're using the second
10566 production. */
10567 enum tree_code assignment_operator
10570 {
10571 /* Parse the right-hand side of the assignment. */
10577 /* An assignment may not appear in a
10578 constant-expression. */
10580 NIC_ASSIGNMENT))
10582 /* Build the assignment expression. Its default
10583 location:
10584 LHS = RHS
10585 ~~~~^~~~~
10586 is the location of the '=' token as the
10587 caret, ranging from the start of the lhs to the
10588 end of the rhs. */
10593 assignment_operator,
10596 /* TODO: build_x_modify_expr doesn't honor the location,
10597 so we must set it here. */
10599 }
10600 }
10601 }
10604 }
10606 /* Parse an (optional) assignment-operator.
10608 assignment-operator: one of
10609 = *= /= %= += -= >>= <<= &= ^= |=
10611 GNU Extension:
10613 assignment-operator: one of
10614 <?= >?=
10616 If the next token is an assignment operator, the corresponding tree
10617 code is returned, and the token is consumed. For example, for
10618 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
10619 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
10620 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
10621 operator, ERROR_MARK is returned. */
10623 static enum tree_code
10625 {
10629 /* Peek at the next token. */
10633 {
10679 /* Nothing else is an assignment operator. */
10681 }
10683 /* An operator followed by ... is a fold-expression, handled elsewhere. */
10688 /* If it was an assignment operator, consume it. */
10693 }
10695 /* Parse an expression.
10697 expression:
10698 assignment-expression
10699 expression , assignment-expression
10701 CAST_P is true if this expression is the target of a cast.
10702 DECLTYPE_P is true if this expression is the immediate operand of decltype,
10703 except possibly parenthesized or on the RHS of a comma (N3276).
10704 WARN_COMMA_P is true if a comma should be diagnosed.
10706 Returns a representation of the expression. */
10708 static cp_expr
10711 {
10716 {
10717 cp_expr assignment_expression;
10719 /* Parse the next assignment-expression. */
10720 assignment_expression
10723 /* We don't create a temporary for a call that is the immediate operand
10724 of decltype or on the RHS of a comma. But when we see a comma, we
10725 need to create a temporary for a call on the LHS. */
10730 assignment_expression
10734 /* If this is the first assignment-expression, we can just
10735 save it away. */
10738 else
10739 {
10740 /* Create a location with caret at the comma, ranging
10741 from the start of the LHS to the end of the RHS. */
10749 }
10750 /* If the next token is not a comma, or we're in a fold-expression, then
10751 we are done with the expression. */
10755 /* Consume the `,'. */
10758 {
10759 /* [depr.comma.subscript]: A comma expression appearing as
10760 the expr-or-braced-init-list of a subscripting expression
10761 is deprecated. A parenthesized comma expression is not
10762 deprecated. */
10764 "top-level comma expression in array subscript "
10767 }
10769 /* A comma operator cannot appear in a constant-expression. */
10772 }
10775 }
10777 /* Parse a constant-expression.
10779 constant-expression:
10780 conditional-expression
10782 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
10783 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
10784 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
10785 is false, NON_CONSTANT_P should be NULL. If ALLOW_NON_CONSTANT_P is
10786 greater than 1, this isn't really a constant-expression, only a
10787 potentially constant-evaluated expression. If STRICT_P is true,
10788 only parse a conditional-expression, otherwise parse an
10789 assignment-expression. See below for rationale. */
10791 static cp_expr
10796 {
10797 /* It might seem that we could simply parse the
10798 conditional-expression, and then check to see if it were
10799 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
10800 one that the compiler can figure out is constant, possibly after
10801 doing some simplifications or optimizations. The standard has a
10802 precise definition of constant-expression, and we must honor
10803 that, even though it is somewhat more restrictive.
10805 For example:
10807 int i[(2, 3)];
10809 is not a legal declaration, because `(2, 3)' is not a
10810 constant-expression. The `,' operator is forbidden in a
10811 constant-expression. However, GCC's constant-folding machinery
10812 will fold this operation to an INTEGER_CST for `3'. */
10814 /* Save the old settings. */
10815 bool saved_integral_constant_expression_p
10817 bool saved_allow_non_integral_constant_expression_p
10819 bool saved_non_integral_constant_expression_p
10821 /* We are now parsing a constant-expression. */
10823 parser->allow_non_integral_constant_expression_p
10827 /* A manifestly constant-evaluated expression is evaluated even in an
10828 unevaluated operand. */
10831 /* Although the grammar says "conditional-expression", when not STRICT_P,
10832 we parse an "assignment-expression", which also permits
10833 "throw-expression" and the use of assignment operators. In the case
10834 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
10835 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
10836 actually essential that we look for an assignment-expression.
10837 For example, cp_parser_initializer_clauses uses this function to
10838 determine whether a particular assignment-expression is in fact
10839 constant. */
10840 cp_expr expression;
10843 else
10845 /* Restore the old settings. */
10846 parser->integral_constant_expression_p
10848 parser->allow_non_integral_constant_expression_p
10852 {
10853 /* Require an rvalue constant expression here; that's what our
10854 callers expect. Reference constant expressions are handled
10855 separately in e.g. cp_parser_template_argument. */
10864 }
10867 parser->non_integral_constant_expression_p
10871 }
10873 /* Parse __builtin_offsetof.
10875 offsetof-expression:
10876 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
10878 offsetof-member-designator:
10879 id-expression
10880 | offsetof-member-designator "." id-expression
10881 | offsetof-member-designator "[" expression "]"
10882 | offsetof-member-designator "->" id-expression */
10884 static cp_expr
10886 {
10888 tree type;
10889 cp_expr expr;
10890 cp_id_kind dummy;
10892 location_t finish_loc;
10894 /* We're about to accept non-integral-constant things, but will
10895 definitely yield an integral constant expression. Save and
10896 restore these values around our local parsing. */
10902 /* Consume the "__builtin_offsetof" token. */
10904 /* Consume the opening `('. */
10905 matching_parens parens;
10907 /* Parse the type-id. */
10909 {
10911 parser->type_definition_forbidden_message
10915 }
10916 /* Look for the `,'. */
10920 /* Build the (type *)null that begins the traditional offsetof macro. */
10921 tree object_ptr
10925 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
10929 {
10932 {
10934 /* offsetof-member-designator "[" expression "]" */
10940 /* offsetof-member-designator "->" identifier */
10943 /* FALLTHRU */
10946 /* offsetof-member-designator "." identifier */
10954 /* Consume the ")" token. */
10960 /* Error. We know the following require will fail, but
10961 that gives the proper error message. */
10966 }
10967 }
10969 success:
10970 /* Make a location of the form:
10971 __builtin_offsetof (struct s, f)
10972 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
10973 with caret at the type-id, ranging from the start of the
10974 "_builtin_offsetof" token to the close paren. */
10976 /* The result will be an INTEGER_CST, so we need to explicitly
10977 preserve the location. */
10980 failure:
10986 }
10988 /* Parse a builtin trait expression or type. */
10990 static cp_expr
10992 {
10993 cp_trait_kind kind;
11000 {
11001 #define DEFTRAIT(TCC, CODE, NAME, ARITY) \
11002 case RID_##CODE: \
11003 kind = CPTK_##CODE; \
11004 binary = (ARITY == 2); \
11005 variadic = (ARITY == -1); \
11006 type = (TCC == tcc_type); \
11007 break;
11009 #undef DEFTRAIT
11012 }
11014 /* Get location of initial token. */
11017 /* Consume the token. */
11020 matching_parens parens;
11023 else
11027 {
11036 }
11038 /* __type_pack_element takes an expression as its first argument and uses
11039 template-id syntax instead of function call syntax (for consistency
11040 with Clang). We special case these properties of __type_pack_element
11041 here and elsewhere. */
11043 else
11044 {
11047 }
11053 {
11057 {
11059 {
11061 "trailing argument to %<__type_pack_element%> "
11064 }
11065 }
11067 }
11069 {
11072 {
11075 }
11079 }
11081 {
11084 {
11088 {
11091 }
11095 }
11099 }
11103 /* cp_parser_enclosed_template_argument_list above already took care
11105 else
11108 /* Construct a location of the form:
11109 __is_trivially_copyable(_Tp)
11110 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
11111 with start == caret, finishing at the close-paren. */
11114 /* Complete the trait expression, which may mean either processing
11115 the trait expr now or saving it for template instantiation. */
11117 {
11125 else
11127 }
11128 }
11130 /* Parse a lambda expression.
11132 lambda-expression:
11133 lambda-introducer lambda-declarator [opt] compound-statement
11134 lambda-introducer < template-parameter-list > requires-clause [opt]
11135 lambda-declarator [opt] compound-statement
11137 Returns a representation of the expression. */
11139 static cp_expr
11141 {
11143 tree type;
11151 {
11152 /* C++20 allows lambdas in unevaluated context, but one in the type of a
11153 non-type parameter is nonsensical.
11155 Distinguish a lambda in the parameter type from a lambda in the
11156 default argument by looking at local_variables_forbidden_p, which is
11157 only set in default arguments. */
11159 {
11164 }
11165 }
11167 {
11169 {
11171 "lambda-expression in unevaluated context"
11174 }
11176 }
11178 {
11180 {
11184 }
11186 }
11188 /* We may be in the middle of deferred access check. Disable
11189 it now. */
11203 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
11206 /* Now that we've started the type, add the capture fields for any
11207 explicit captures. */
11210 {
11211 /* Inside the class, surrounding template-parameter-lists do not apply. */
11212 unsigned int saved_num_template_parameter_lists
11216 bool fully_implicit_function_template_p
11220 bool auto_is_implicit_function_template_parm_p
11231 /* The body of a lambda in a discarded statement is not discarded. */
11235 /* Similarly the body of a lambda in immediate function context is not
11236 in immediate function context. */
11240 /* By virtue of defining a local class, a lambda expression has access to
11241 the private variables of enclosing classes. */
11254 {
11257 }
11259 /* The capture list was built up in reverse order; fix that now. */
11274 parser->fully_implicit_function_template_p
11278 parser->auto_is_implicit_function_template_parm_p
11280 }
11282 /* This field is only used during parsing of the lambda. */
11285 /* This lambda shouldn't have any proxies left at this point. */
11287 /* And now that we're done, push proxies for an enclosing lambda. */
11290 /* Update the lambda expression to a range. */
11297 else
11305 }
11307 /* Parse the beginning of a lambda expression.
11309 lambda-introducer:
11310 [ lambda-capture [opt] ]
11312 LAMBDA_EXPR is the current representation of the lambda expression. */
11314 static void
11316 {
11317 /* Need commas after the first capture. */
11320 /* Eat the leading `['. */
11323 /* Record default capture mode. "[&" "[=" "[&," "[=," */
11333 {
11339 }
11344 {
11346 tree capture_id;
11347 tree capture_init_expr;
11351 enum capture_kind_type
11352 {
11353 BY_COPY,
11354 BY_REFERENCE
11355 };
11359 {
11362 }
11366 else
11369 /* Possibly capture `this'. */
11371 {
11376 "explicit by-copy capture of %<this%> "
11377 "with by-copy capture default only available with "
11383 this_identifier);
11384 else
11389 }
11391 /* Possibly capture `*this'. */
11394 {
11398 "%<*this%> capture only available with "
11405 this_identifier);
11406 else
11411 }
11413 /* But reject `&this'. */
11416 {
11422 }
11424 /* Remember whether we want to capture as a reference or not. */
11426 {
11429 }
11434 {
11438 "pack init-capture only available with "
11442 }
11444 /* Early C++20 drafts had ...& instead of &...; be forgiving. */
11447 {
11452 }
11454 /* Get the identifier. */
11459 /* Would be nice to have a cp_parser_skip_to_closing_x for general
11460 delimiters, but I modified this to stop on unnested ']' as well. It
11461 was already changed to stop on unnested '}', so the
11462 "closing_parenthesis" name is no more misleading with my change. */
11463 {
11469 }
11471 /* Find the initializer for this capture. */
11475 {
11476 /* An explicit initializer exists. */
11479 "lambda capture initializers "
11487 {
11490 }
11493 }
11494 else
11495 {
11498 /* Turn the identifier into an id-expression. */
11499 capture_init_expr
11504 {
11507 }
11510 {
11513 capture_init_expr);
11518 }
11521 {
11524 capture_init_expr))
11528 }
11530 capture_init_expr
11531 = finish_id_expression
11533 capture_init_expr,
11547 {
11552 {
11553 /* If what follows is an initializer, the second '...' is
11554 invalid. But for cases like [...xs...], the first one
11555 is invalid. */
11562 }
11563 }
11564 }
11568 {
11573 capture_id);
11577 "capture of %qD redundant with by-reference capture "
11579 }
11581 /* Check for duplicates.
11582 Optimize for the zero or one explicit captures cases and only create
11583 the hash_set after adding second capture. */
11591 else
11592 {
11595 }
11599 else
11602 explicit_init_p);
11604 /* If there is any qualification still in effect, clear it
11605 now; we will be starting fresh with the next capture. */
11609 }
11612 }
11614 /* Parse the (optional) middle of a lambda expression.
11616 lambda-declarator:
11617 ( parameter-declaration-clause ) lambda-specifiers requires-clause [opt]
11618 lambda-specifiers (C++23)
11620 lambda-specifiers:
11621 decl-specifier-seq [opt] noexcept-specifier [opt]
11622 attribute-specifier-seq [opt] trailing-return-type [opt]
11624 LAMBDA_EXPR is the current representation of the lambda expression. */
11626 static bool
11628 {
11629 /* 5.1.1.4 of the standard says:
11630 If a lambda-expression does not include a lambda-declarator, it is as if
11631 the lambda-declarator were ().
11632 This means an empty parameter list, no attributes, and no exception
11633 specification. */
11644 cp_decl_specifier_seq lambda_specs;
11646 /* A lambda op() is const unless explicitly 'mutable'. */
11649 /* The template-parameter-list is optional, but must begin with
11650 an opening angle if present. */
11652 {
11655 "lambda templates are only available with "
11659 "lambda templates are only available with "
11667 /* We may have a constrained generic lambda; parse the requires-clause
11668 immediately after the template-parameter-list and combine with any
11669 shorthand constraints present. */
11672 {
11677 }
11679 /* We just processed one more parameter list. */
11681 }
11683 /* Committee discussion supports allowing attributes here. */
11686 /* The parameter-declaration-clause is optional (unless
11687 template-parameter-list was given), but must begin with an
11688 opening parenthesis if present. */
11690 {
11691 matching_parens parens;
11696 /* Parse parameters. */
11697 param_list
11698 = cp_parser_parameter_declaration_clause
11701 /* Default arguments shall not be specified in the
11702 parameter-declaration-clause of a lambda-declarator. */
11707 OPT_Wc__14_extensions,
11712 }
11716 /* In the decl-specifier-seq of the lambda-declarator, each
11717 decl-specifier shall either be mutable or constexpr. */
11721 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
11725 {
11727 "parameter declaration before lambda declaration "
11728 "specifiers only optional with %<-std=c++2b%> or "
11731 }
11734 {
11737 }
11739 {
11744 else
11745 {
11748 }
11749 }
11753 {
11755 "parameter declaration before lambda transaction "
11756 "qualifier only optional with %<-std=c++2b%> or "
11759 }
11761 /* Parse optional exception specification. */
11762 exception_spec
11766 {
11768 "parameter declaration before lambda exception "
11769 "specification only optional with %<-std=c++2b%> or "
11772 }
11774 /* GCC 8 accepted attributes here, and this is the place for standard C++11
11775 attributes that appertain to the function type. */
11778 else
11781 /* Parse optional trailing return type. */
11783 {
11786 "parameter declaration before lambda trailing "
11787 "return type only optional with %<-std=c++2b%> or "
11791 }
11793 /* Also allow GNU attributes at the very end of the declaration, the usual
11794 place for GNU attributes. */
11799 {
11800 /* Parse optional trailing requires clause. */
11803 /* The function parameters must be in scope all the way until after the
11804 trailing-return-type in case of decltype. */
11806 }
11808 /* Create the function call operator.
11810 Messing with declarators like this is no uglier than building up the
11811 FUNCTION_DECL by hand, and this is less likely to get out of sync with
11812 other code. */
11813 {
11814 cp_decl_specifier_seq return_type_specs;
11816 tree fco;
11823 {
11827 else
11829 "lambda only available with %<-std=c++17%> or "
11831 }
11836 {
11840 }
11848 VIRT_SPEC_UNSPECIFIED,
11849 REF_QUAL_NONE,
11850 tx_qual,
11851 exception_spec,
11852 return_type,
11853 trailing_requires_clause,
11854 std_attrs,
11855 UNKNOWN_LOCATION);
11858 declarator,
11861 {
11865 /* Give the object parameter a different name. */
11868 }
11870 {
11874 }
11884 }
11885 }
11887 /* Parse the body of a lambda expression, which is simply
11889 compound-statement
11891 but which requires special handling.
11892 LAMBDA_EXPR is the current representation of the lambda expression. */
11894 static void
11896 {
11898 unsigned char local_variables_forbidden_p
11902 /* The body of a lambda-expression is not a subexpression of the enclosing
11903 expression. */
11904 cp_evaluated ev;
11908 else
11909 /* Still increment function_depth so that we don't GC in the
11910 middle of an expression. */
11918 /* Clear this in case we're in the middle of a default argument. */
11922 {
11927 /* Originally C++11 required us to peek for 'return expr'; and
11928 process it specially here to deduce the return type. N3638
11929 removed the need for that. */
11933 }
11940 else
11942 }
11944 /* Statements [gram.stmt.stmt] */
11946 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
11948 static void
11950 {
11954 /* A concept is never expanded normally. */
11960 }
11962 struct cp_omp_attribute_data
11963 {
11966 c_omp_directive_kind kind;
11967 };
11969 /* Handle omp::directive and omp::sequence attributes in ATTRS
11970 (if any) at the start of a statement or in attribute-declaration. */
11972 static tree
11974 {
11985 {
11986 cnt++;
11988 {
11994 {
11996 "mixing OpenMP directives with attribute and pragma "
12000 }
12003 {
12011 else
12014 }
12020 {
12022 "unknown OpenMP directive name in %<omp::directive%>"
12025 }
12028 {
12029 /* ordered is C_OMP_DIR_CONSTRUCT only if it doesn't contain
12030 depend/doacross clause. */
12043 }
12045 {
12046 /* error with at(execution) clause is C_OMP_DIR_STANDALONE. */
12050 paren_depth++;
12052 paren_depth--;
12063 {
12066 }
12067 }
12072 }
12073 cp_omp_attribute_data v = {};
12076 }
12077 else
12090 {
12095 }
12096 else
12097 {
12099 {
12102 }
12103 }
12106 {
12108 "OpenMP construct among %<omp::directive%> attributes"
12109 " requires all %<omp::directive%> attributes on the"
12112 }
12114 {
12116 "multiple OpenMP standalone directives among"
12117 " %<omp::directive%> attributes must be all within the"
12120 }
12126 {
12128 "standalone OpenMP directives in %<omp::directive%> attribute"
12131 }
12133 {
12137 {
12139 "mixing OpenMP directives with attribute and pragma "
12142 }
12143 }
12147 tokens++;
12152 {
12159 cp_token tok = {};
12167 tok = {};
12172 }
12173 cp_token tok = {};
12185 /* Move the current source position to that of the first token in the
12186 new lexer. */
12189 }
12191 /* True if and only if the name is one of the contract types. */
12193 static bool
12195 {
12199 }
12201 /* Handle omp::directive and omp::sequence attributes in *PATTRS
12202 (if any) at the start or after declaration-id of a declaration. */
12204 static void
12208 {
12219 {
12221 {
12228 {
12236 else
12239 }
12249 {
12251 {
12254 }
12256 {
12258 "mixing OpenMP directives with attribute and "
12261 }
12262 }
12263 }
12264 }
12267 {
12272 else
12275 }
12280 {
12289 }
12291 }
12293 /* Parse a statement.
12295 statement:
12296 labeled-statement
12297 expression-statement
12298 compound-statement
12299 selection-statement
12300 iteration-statement
12301 jump-statement
12302 declaration-statement
12303 try-block
12305 C++11:
12307 statement:
12308 labeled-statement
12309 attribute-specifier-seq (opt) expression-statement
12310 attribute-specifier-seq (opt) compound-statement
12311 attribute-specifier-seq (opt) selection-statement
12312 attribute-specifier-seq (opt) iteration-statement
12313 attribute-specifier-seq (opt) jump-statement
12314 declaration-statement
12315 attribute-specifier-seq (opt) try-block
12317 init-statement:
12318 expression-statement
12319 simple-declaration
12320 alias-declaration
12322 TM Extension:
12324 statement:
12325 atomic-statement
12327 IN_COMPOUND is true when the statement is nested inside a
12328 cp_parser_compound_statement.
12330 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12331 is a (possibly labeled) if statement which is not enclosed in braces
12332 and has an else clause. This is used to implement -Wparentheses.
12334 CHAIN is a vector of if-else-if conditions.
12336 Note that this version of parsing restricts assertions to be attached to
12337 empty statements. */
12339 static void
12343 {
12349 /* A copy of IN_COMPOUND which is set to false after seeing a label.
12350 This matters for certain pragmas. */
12353 restart:
12356 /* There is no statement yet. */
12363 /* In obj-c++, seeing '[[' might be the either the beginning of
12364 c++11 attributes, or a nested objc-message-expression. So
12365 let's parse the c++11 attributes tentatively. */
12371 {
12374 }
12377 /* Peek at the next token. */
12380 /* If we have contracts, check that they're valid in this context. */
12382 {
12390 /* Check that assertions are null statements. */
12394 }
12400 {
12404 {
12431 }
12437 {
12439 std_attrs);
12441 }
12442 }
12445 /* Remember the location of the first token in the statement. */
12449 /* If this is a keyword, then that will often determine what kind of
12450 statement we have. */
12452 {
12456 {
12459 /* Looks like a labeled-statement with a case label.
12460 Parse the label, and then use tail recursion to parse
12461 the statement. */
12490 /* Objective-C++ exception-handling constructs. */
12506 /* This must be a namespace alias definition. */
12508 {
12509 /* Attributes should be parsed as part of the
12510 declaration, so let's un-parse them. */
12513 }
12531 /* It might be a keyword like `int' that can start a
12532 declaration-statement. */
12534 }
12535 }
12537 {
12538 /* If the next token is a `:', then we are looking at a
12539 labeled-statement. */
12542 {
12543 /* Looks like a labeled-statement with an ordinary label.
12544 Parse the label, and then use tail recursion to parse
12545 the statement. */
12549 /* If there's no statement, it's not a labeled-statement, just
12550 a label. That's allowed in C++23, but only if we're at the
12551 end of a compound-statement. */
12554 {
12558 "label at end of compound statement only available "
12561 }
12565 }
12566 }
12567 /* Anything that starts with a `{' must be a compound-statement. */
12569 {
12572 }
12573 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
12574 a statement all its own. */
12576 {
12577 do_pragma:;
12580 /* Only certain OpenMP pragmas are attached to statements, and thus
12581 are considered statements themselves. All others are not. In
12582 the context of a compound, accept the pragma as a "statement" and
12583 return so that we can check for a close brace. Otherwise we
12584 require a real statement and must go back and read one. */
12586 {
12590 }
12598 {
12600 {
12607 }
12610 }
12618 }
12620 {
12623 }
12625 /* Everything else must be a declaration-statement or an
12626 expression-statement. Try for the declaration-statement
12627 first, unless we are looking at a `;', in which case we know that
12628 we have an expression-statement. */
12630 {
12632 {
12634 /* Attributes should be parsed as part of the declaration,
12635 so let's un-parse them. */
12640 /* Try to parse the declaration-statement. */
12643 /* If that worked, we're done. */
12646 /* It didn't work, restore the post-attribute position. */
12648 {
12651 {
12656 i++;
12658 {
12664 /* Don't handle OpenMP attribs on keywords that
12665 always start a declaration statement but don't
12666 accept attribute before it and therefore
12667 the tentative cp_parser_declaration_statement
12668 fails to parse because of that. */
12673 }
12676 {
12678 std_attrs
12679 = cp_parser_handle_statement_omp_attributes
12685 }
12686 }
12687 }
12688 }
12689 /* All preceding labels have been parsed at this point. */
12695 /* Look for an expression-statement instead. */
12699 attrs_loc);
12701 /* Handle [[fallthrough]];. */
12703 {
12704 /* The next token after the fallthrough attribute is ';'. */
12706 {
12707 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12709 IFN_FALLTHROUGH,
12712 }
12713 else
12717 }
12719 /* Handle [[assert: ...]]; */
12721 {
12722 /* Add the assertion as a statement in the current block. */
12726 }
12727 }
12729 /* Set the line number for the statement. */
12733 /* Allow "[[fallthrough]];" or "[[assume(cond)]];", but warn otherwise. */
12736 OPT_Wattributes,
12738 }
12740 /* Append ATTR to attribute list ATTRS. */
12742 tree
12744 {
12750 }
12752 /* Parse the label for a labeled-statement, i.e.
12754 label:
12755 attribute-specifier-seq[opt] identifier :
12756 attribute-specifier-seq[opt] case constant-expression :
12757 attribute-specifier-seq[opt] default :
12759 labeled-statement:
12760 label statement
12762 GNU Extension:
12763 case constant-expression ... constant-expression : statement
12765 When a label is parsed without errors, the label is added to the
12766 parse tree by the finish_* functions, so this function doesn't
12767 have to return the label. */
12769 static void
12771 {
12776 /* The next token should be an identifier. */
12780 {
12783 }
12785 /* Remember whether this case or a user-defined label is allowed to fall
12786 through to. */
12791 {
12793 {
12797 /* Consume the `case' token. */
12799 /* Parse the constant-expression. */
12806 {
12807 /* Consume the `...' token. */
12813 /* We don't need to emit warnings here, as the common code
12814 will do this for us. */
12815 }
12816 else
12820 {
12823 {
12826 }
12827 }
12828 else
12831 expr);
12832 }
12836 /* Consume the `default' token. */
12840 {
12843 {
12846 }
12847 }
12848 else
12853 /* Anything else must be an ordinary label. */
12858 }
12860 /* Require the `:' token. */
12863 /* An ordinary label may optionally be followed by attributes.
12864 However, this is only permitted if the attributes are then
12865 followed by a semicolon. This is because, for backward
12866 compatibility, when parsing
12867 lab: __attribute__ ((unused)) int i;
12868 we want the attribute to attach to "i", not "lab". */
12871 {
12872 tree attrs;
12876 /* And fallthrough always binds to the expression-statement. */
12881 ;
12882 else
12884 }
12890 }
12892 /* Parse an expression-statement.
12894 expression-statement:
12895 expression [opt] ;
12897 Returns the new EXPR_STMT -- or NULL_TREE if the expression
12898 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
12899 indicates whether this expression-statement is part of an
12900 expression statement. */
12902 static tree
12904 {
12909 /* There might be attribute fallthrough. */
12912 /* If the next token is a ';', then there is no expression
12913 statement. */
12915 {
12919 {
12922 }
12923 }
12927 /* Handle [[fallthrough]];. */
12929 {
12930 /* The next token after the fallthrough attribute is ';'. */
12932 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12935 else
12939 }
12941 /* Allow "[[fallthrough]];", but warn otherwise. */
12946 /* Give a helpful message for "A<T>::type t;" and the like. */
12949 {
12956 {
12957 /* A::A a; */
12962 }
12963 }
12965 /* Consume the final `;'. */
12970 /* This is the final expression statement of a statement
12971 expression. */
12977 }
12979 /* Parse a compound-statement.
12981 compound-statement:
12982 { statement-seq [opt] label-seq [opt] }
12984 label-seq:
12985 label
12986 label-seq label
12988 GNU extension:
12990 compound-statement:
12991 { label-declaration-seq [opt] statement-seq [opt] }
12993 label-declaration-seq:
12994 label-declaration
12995 label-declaration-seq label-declaration
12997 Returns a tree representing the statement. */
12999 static tree
13002 {
13003 tree compound_stmt;
13004 matching_braces braces;
13006 /* Consume the `{'. */
13013 /* Begin the compound-statement. */
13015 /* If the next keyword is `__label__' we have a label declaration. */
13018 /* Parse an (optional) statement-seq. */
13021 /* Consume the `}'. */
13024 /* Finish the compound-statement. */
13028 }
13030 /* Diagnose errors related to imperfectly nested loops in an OMP
13031 loop construct. This function is called when such code is seen.
13032 Only issue one such diagnostic no matter how much invalid
13033 intervening code there is in the loop.
13034 FIXME: maybe the location associated with the diagnostic should
13035 be the current parser token instead of the location of the outer loop
13036 nest. */
13038 static void
13040 {
13049 /* Only diagnose errors related to perfect nesting once. */
13051 {
13053 {
13055 "inner loops must be perfectly nested in "
13058 }
13060 {
13062 "inner loops must be perfectly nested with "
13065 }
13067 {
13069 "inner loops must be perfectly nested with "
13072 }
13073 /* TODO: Also reject loops with TILE directive. */
13076 }
13077 }
13079 /* Parse an (optional) statement-seq.
13081 statement-seq:
13082 statement
13083 statement-seq [opt] statement */
13085 static void
13087 {
13090 bool in_omp_loop_block
13093 /* Scan statements until there aren't any more. */
13095 {
13098 /* If we are looking at a `}', then we have run out of
13099 statements; the same is true if we have reached the end
13100 of file, or have stumbled upon a stray '@end'. */
13107 /* If we are in a compound statement and find 'else' then
13108 something went wrong. */
13110 {
13113 else
13114 {
13117 }
13118 }
13120 /* Handle special cases for OMP FOR canonical loop syntax. */
13122 {
13126 {
13127 /* Found the nested loop. */
13131 }
13133 {
13134 /* Prior to implementing the OpenMP 5.1 syntax for canonical
13135 loop form, GCC used to accept an empty statements as not
13136 being intervening code. Continue to do that, as an
13137 extension. */
13138 /* FIXME: Maybe issue a warning or something here? */
13140 }
13142 /* The nested compound statement may contain the next loop, or
13143 it might just be intervening code. */
13144 {
13148 }
13149 else
13150 {
13151 /* This must be intervening code. */
13153 /* Defer calling check_omp_intervening_code on pragmas until
13154 cp_parser_statement, because we can't know until we parse
13155 it whether or not the pragma is a statement. */
13160 }
13162 }
13164 /* Parse the statement. */
13166 }
13167 }
13169 /* Return true if this is the C++20 version of range-based-for with
13170 init-statement. */
13172 static bool
13174 {
13177 /* Save tokens so that we can put them back. */
13180 /* There has to be an unnested ; followed by an unnested :. */
13183 CPP_SEMICOLON,
13187 /* We found the semicolon, eat it now. */
13190 /* Now look for ':' that is not nested in () or {}. */
13193 CPP_COLON,
13196 out:
13197 /* Roll back the tokens we skipped. */
13201 }
13203 /* Return true if we're looking at (init; cond), false otherwise. */
13205 static bool
13207 {
13208 /* Save tokens so that we can put them back. */
13211 /* Look for ';' that is not nested in () or {}. */
13214 CPP_SEMICOLON,
13217 /* Roll back the tokens we skipped. */
13221 }
13223 /* Parse a selection-statement.
13225 selection-statement:
13226 if ( init-statement [opt] condition ) statement
13227 if ( init-statement [opt] condition ) statement else statement
13228 switch ( init-statement [opt] condition ) statement
13230 Returns the new IF_STMT or SWITCH_STMT.
13232 If IF_P is not NULL, *IF_P is set to indicate whether the statement
13233 is a (possibly labeled) if statement which is not enclosed in
13234 braces and has an else clause. This is used to implement
13235 -Wparentheses.
13237 CHAIN is a vector of if-else-if conditions. This is used to implement
13238 -Wduplicated-cond. */
13240 static tree
13243 {
13246 token_indent_info guard_tinfo;
13251 /* Peek at the next token. */
13255 /* See what kind of keyword it is. */
13258 {
13261 {
13262 tree statement;
13263 tree condition;
13268 RID_CONSTEXPR))
13269 {
13274 "%<if constexpr%> only available with "
13276 }
13279 {
13281 RID_CONSTEVAL))
13285 RID_CONSTEVAL))
13286 {
13289 }
13290 }
13292 {
13296 "%<if consteval%> only available with "
13307 {
13310 }
13316 {
13317 location_t before_loc
13323 }
13327 /* If the next token is `else', parse the else-clause. */
13329 RID_ELSE))
13330 {
13334 /* Consume the `else' keyword. */
13340 {
13344 }
13348 guard_tinfo);
13351 {
13352 location_t before_loc
13357 }
13360 }
13364 {
13368 }
13372 }
13374 /* Look for the `('. */
13375 matching_parens parens;
13377 {
13380 }
13382 /* Begin the selection-statement. */
13384 {
13387 }
13388 else
13391 /* Parse the optional init-statement. */
13393 {
13394 tree decl;
13397 OPT_Wc__17_extensions,
13398 "init-statement in selection statements only available "
13401 /* A non-empty init-statement can have arbitrary side
13402 effects. */
13405 }
13407 /* Parse the condition. */
13409 /* Look for the `)'. */
13415 {
13419 /* Add the condition. */
13426 /* Parse the then-clause. */
13430 /* Outside a template, the non-selected branch of a constexpr
13431 if is a 'discarded statement', i.e. unevaluated. */
13436 {
13439 }
13442 guard_tinfo);
13449 {
13453 }
13455 /* If the next token is `else', parse the else-clause. */
13457 RID_ELSE))
13458 {
13462 {
13465 }
13467 guard_tinfo
13469 /* Consume the `else' keyword. */
13472 {
13474 RID_IF)
13476 {
13477 /* We've got "if (COND) else if (COND2)". Start
13478 the condition chain and add COND as the first
13479 element. */
13483 {
13484 /* Wrap it in a NOP_EXPR so that we can set the
13485 location of the condition. */
13487 condition);
13490 }
13491 }
13493 RID_IF))
13494 /* This is if-else without subsequent if. Zap the
13495 condition chain; we would have already warned at
13496 this point. */
13498 }
13500 /* Parse the else-clause. */
13506 /* If we are currently parsing a then-clause, then
13507 IF_P will not be NULL. We set it to true to
13508 indicate that this if statement has an else clause.
13509 This may trigger the Wparentheses warning below
13510 when we get back up to the parent if statement. */
13515 {
13519 }
13520 }
13521 else
13522 {
13523 /* This if statement does not have an else clause. If
13524 NESTED_IF is true, then the then-clause has an if
13525 statement which does have an else clause. We warn
13526 about the potential ambiguity. */
13529 "suggest explicit braces to avoid ambiguous"
13532 /* We don't need the condition chain anymore. */
13534 }
13536 /* Now we're all done with the if-statement. */
13538 }
13539 else
13540 {
13544 /* Add the condition. */
13547 /* Parse the body of the switch-statement. */
13553 guard_tinfo);
13557 /* Now we're all done with the switch-statement. */
13559 }
13562 }
13568 }
13569 }
13571 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
13572 If we have seen at least one decl-specifier, and the next token is not
13573 a parenthesis (after "int (" we might be looking at a functional cast)
13574 neither we are dealing with a concept-check expression then we must be
13575 looking at a declaration. */
13577 static void
13580 {
13589 }
13591 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
13592 The declarator shall not specify a function or an array. Returns
13593 TRUE if the declarator is valid, FALSE otherwise. */
13595 static bool
13598 location_t loc)
13599 {
13603 {
13608 else
13616 }
13617 else
13619 }
13621 /* Parse a condition.
13623 condition:
13624 expression
13625 type-specifier-seq declarator = initializer-clause
13626 type-specifier-seq declarator braced-init-list
13628 GNU Extension:
13630 condition:
13631 type-specifier-seq declarator asm-specification [opt]
13632 attributes [opt] = assignment-expression
13634 Returns the expression that should be tested. */
13636 static tree
13638 {
13639 cp_decl_specifier_seq type_specifiers;
13643 /* Try the declaration first. */
13645 /* New types are not allowed in the type-specifier-seq for a
13646 condition. */
13648 parser->type_definition_forbidden_message
13650 /* Parse the type-specifier-seq. */
13652 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
13655 /* Restore the saved message. */
13658 /* Gather the attributes that were provided with the
13659 decl-specifiers. */
13664 /* If all is well, we might be looking at a declaration. */
13666 {
13667 tree decl;
13668 tree asm_specification;
13669 tree attributes;
13674 /* Parse the declarator. */
13676 CP_PARSER_FLAGS_NONE,
13682 /* Parse the attributes. */
13684 /* Parse the asm-specification. */
13686 /* If the next token is not an `=' or '{', then we might still be
13687 looking at an expression. For example:
13689 if (A(a).x)
13691 looks like a decl-specifier-seq and a declarator -- but then
13692 there is no `=', so this is an expression. */
13697 /* If we did see an `=' or '{', then we are looking at a declaration
13698 for sure. */
13700 {
13701 tree pushed_scope;
13708 /* Create the declaration. */
13715 /* Parse the initializer. */
13717 {
13721 }
13723 {
13724 /* Consume the `='. */
13728 }
13729 else
13730 {
13733 }
13737 /* Process the initializer. */
13740 asm_specification,
13741 flags);
13747 }
13748 }
13749 /* If we didn't even get past the declarator successfully, we are
13750 definitely not looking at a declaration. */
13751 else
13754 /* Otherwise, we are looking at an expression. */
13756 }
13758 /* Parses a for-statement or range-for-statement until the closing ')',
13759 not included. */
13761 static tree
13764 {
13768 /* Begin the for-statement. */
13771 /* Maybe parse the optional init-statement in a range-based for loop. */
13773 /* Checked for diagnostic purposes only. */
13775 {
13776 tree dummy;
13779 {
13781 OPT_Wc__20_extensions,
13782 "range-based %<for%> loops with initializer only "
13785 }
13786 }
13788 /* Parse the initialization. */
13794 else
13796 }
13798 static tree
13801 {
13802 /* Normal for loop */
13805 tree stmt;
13808 /* The init-statement has already been parsed in
13809 cp_parser_init_statement, so no work is needed here. */
13812 /* If there's a condition, process it. */
13816 {
13820 }
13822 {
13826 }
13828 /* Look for the `;'. */
13831 /* If there's an expression, process it. */
13837 }
13839 /* Tries to parse a range-based for-statement:
13841 range-based-for:
13842 decl-specifier-seq declarator : expression
13844 The decl-specifier-seq declarator and the `:' are already parsed by
13845 cp_parser_init_statement. If processing_template_decl it returns a
13846 newly created RANGE_FOR_STMT; if not, it is converted to a
13847 regular FOR_STMT. */
13849 static tree
13853 {
13859 /* Get the range declaration momentarily out of the way so that
13860 the range expression doesn't clash with it. */
13862 {
13864 {
13866 /* For decomposition declaration get all of the corresponding
13867 declarations out of the way. */
13871 {
13879 {
13885 }
13886 }
13887 }
13889 {
13894 }
13895 }
13899 else
13902 /* Put the range declaration(s) back into scope. */
13904 {
13908 }
13910 /* finish_omp_for has its own code for the following, so just
13911 return the range_expr instead. */
13915 /* If in template, STMT is converted to a normal for-statement
13916 at instantiation. If not, it is done just ahead. */
13918 {
13930 /* do_auto_deduction doesn't mess with template init-lists. */
13933 }
13934 else
13935 {
13939 }
13941 }
13943 /* Subroutine of cp_convert_range_for: given the initializer expression,
13944 builds up the range temporary. */
13946 static tree
13948 {
13949 /* Find out the type deduced by the declaration
13950 `auto &&__range = range_expr'. */
13955 /* Create the __range variable. */
13962 }
13964 /* Used by cp_parser_range_for in template context: we aren't going to
13965 do a full conversion yet, but we still need to resolve auto in the
13966 type of the for-range-declaration if present. This is basically
13967 a shortcut version of cp_convert_range_for. */
13969 static void
13971 {
13974 {
13977 iter_type = (cp_parser_perform_range_for_lookup
13980 {
13982 iter_type);
13985 tf_warning_or_error);
13988 tf_warning_or_error,
13989 adc_variable_type);
13992 }
13993 }
13994 }
13996 /* Warns when the loop variable should be changed to a reference type to
13997 avoid unnecessary copying. I.e., from
13999 for (const auto x : range)
14001 where range returns a reference, to
14003 for (const auto &x : range)
14005 if this version doesn't make a copy.
14007 This function also warns when the loop variable is initialized with
14008 a value of a different type resulting in a copy:
14010 int arr[10];
14011 for (const double &x : arr)
14013 DECL is the RANGE_DECL; EXPR is the *__for_begin expression.
14014 This function is never called when processing_template_decl is on. */
14016 static void
14018 {
14030 {
14033 {
14034 auto_diagnostic_group d;
14036 "loop variable %qD of type %qT binds to a temporary "
14039 {
14041 TYPE_QUAL_CONST);
14046 }
14047 }
14049 }
14053 /* Since small trivially copyable types are cheap to copy, we suppress the
14054 warning for them. 64B is a common size of a cache line. */
14060 /* If we can initialize a reference directly, suggest that to avoid the
14061 copy. */
14064 {
14065 auto_diagnostic_group d;
14069 {
14073 }
14074 }
14075 }
14077 /* Converts a range-based for-statement into a normal
14078 for-statement, as per the definition.
14080 for (RANGE_DECL : RANGE_EXPR)
14081 BLOCK
14083 should be equivalent to:
14085 {
14086 auto &&__range = RANGE_EXPR;
14087 for (auto __begin = BEGIN_EXPR, __end = END_EXPR;
14088 __begin != __end;
14089 ++__begin)
14090 {
14091 RANGE_DECL = *__begin;
14092 BLOCK
14093 }
14094 }
14096 If RANGE_EXPR is an array:
14097 BEGIN_EXPR = __range
14098 END_EXPR = __range + ARRAY_SIZE(__range)
14099 Else if RANGE_EXPR has a member 'begin' or 'end':
14100 BEGIN_EXPR = __range.begin()
14101 END_EXPR = __range.end()
14102 Else:
14103 BEGIN_EXPR = begin(__range)
14104 END_EXPR = end(__range);
14106 If __range has a member 'begin' but not 'end', or vice versa, we must
14107 still use the second alternative (it will surely fail, however).
14108 When calling begin()/end() in the third alternative we must use
14109 argument dependent lookup, but always considering 'std' as an associated
14110 namespace. */
14112 tree
14116 {
14124 /* If an error happened previously do nothing or else a lot of
14125 unhelpful errors would be issued. */
14127 else
14128 {
14129 tree range_temp;
14133 /* Can't bind a reference to an array of runtime bound. */
14135 else
14136 {
14141 LOOKUP_ONLYCONVERTING);
14143 }
14146 }
14148 /* The new for initialization statement. */
14150 iter_type);
14156 LOOKUP_ONLYCONVERTING);
14166 LOOKUP_ONLYCONVERTING);
14170 /* The new for condition. */
14177 /* The new increment expression. */
14180 tf_warning_or_error);
14183 /* The declaration is initialized with *__begin inside the loop body. */
14195 }
14197 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
14198 We need to solve both at the same time because the method used
14199 depends on the existence of members begin or end.
14200 Returns the type deduced for the iterator expression. */
14202 static tree
14204 {
14206 {
14209 }
14212 {
14217 }
14219 {
14220 /* If RANGE is an array, we will use pointer arithmetic. */
14223 range,
14227 }
14228 else
14229 {
14230 /* If it is not an array, we must do a bit of magic. */
14240 tf_warning_or_error);
14243 tf_warning_or_error);
14246 {
14247 /* Use the member functions. */
14250 }
14251 else
14252 {
14253 /* Use global functions with ADL. */
14254 releasing_vec vec;
14259 tf_warning_or_error);
14261 tf_warning_or_error);
14263 tf_warning_or_error);
14265 tf_warning_or_error);
14266 }
14268 /* Last common checks. */
14270 {
14271 /* If one of the expressions is an error do no more checks. */
14274 }
14277 /* Can happen, when, eg, in a template context, Koenig lookup
14278 can't resolve begin/end (c++/58503). */
14280 else
14281 {
14283 /* The unqualified type of the __begin and __end temporaries should
14284 be the same, as required by the multiple auto declaration. */
14286 {
14293 /* P0184R0 allows __begin and __end to have different types,
14294 but make sure they are comparable so we can give a better
14296 else
14300 }
14302 }
14303 }
14304 }
14306 /* Helper function for cp_parser_perform_range_for_lookup.
14307 Builds a tree for RANGE.IDENTIFIER(). */
14309 static tree
14311 {
14319 releasing_vec vec;
14323 tf_warning_or_error);
14325 }
14327 /* Parse an iteration-statement.
14329 iteration-statement:
14330 while ( condition ) statement
14331 do statement while ( expression ) ;
14332 for ( init-statement condition [opt] ; expression [opt] )
14333 statement
14335 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
14337 static tree
14340 {
14343 tree statement;
14345 token_indent_info guard_tinfo;
14347 /* Peek at the next token. */
14354 /* Remember whether or not we are already within an iteration
14355 statement. */
14358 /* Special case for OMP loop intervening code. Parsing of permitted
14359 collapsed loop nests is handled elsewhere. */
14361 {
14365 }
14367 /* See what kind of keyword it is. */
14370 {
14372 {
14373 tree condition;
14375 /* Begin the while-statement. */
14377 /* Look for the `('. */
14378 matching_parens parens;
14380 /* Parse the condition. */
14383 /* Look for the `)'. */
14385 /* Parse the dependent statement. */
14391 /* We're done with the while-statement. */
14393 }
14397 {
14398 tree expression;
14400 /* Begin the do-statement. */
14402 /* Parse the body of the do-statement. */
14409 /* Look for the `while' keyword. */
14411 /* Look for the `('. */
14412 matching_parens parens;
14414 /* Parse the expression. */
14416 /* We're done with the do-statement. */
14418 /* Look for the `)'. */
14420 /* Look for the `;'. */
14422 }
14426 {
14427 /* Look for the `('. */
14428 matching_parens parens;
14433 /* Look for the `)'. */
14436 /* Parse the body of the for-statement. */
14443 /* We're done with the for-statement. */
14445 }
14452 }
14455 }
14457 /* Parse an init-statement or the declarator of a range-based-for.
14458 Returns true if a range-based-for declaration is seen.
14460 init-statement:
14461 expression-statement
14462 simple-declaration
14463 alias-declaration */
14465 static bool
14467 {
14468 /* If the next token is a `;', then we have an empty
14469 expression-statement. Grammatically, this is also a
14470 simple-declaration, but an invalid one, because it does not
14471 declare anything. Therefore, if we did not handle this case
14472 specially, we would issue an error message about an invalid
14473 declaration. */
14475 {
14479 /* A colon is used in range-based for. */
14482 /* We're going to speculatively look for a declaration, falling back
14483 to an expression, if necessary. */
14487 {
14493 OPT_Wc__23_extensions,
14494 "alias-declaration in init-statement only "
14496 }
14497 else
14498 /* Parse the declaration. */
14501 decl);
14504 {
14505 /* It is a range-for, consume the ':'. */
14510 OPT_Wc__11_extensions,
14511 "range-based %<for%> loops only available with "
14513 }
14515 /* The ';' is not consumed yet because we told
14516 cp_parser_simple_declaration not to. */
14521 /* If the tentative parse failed, then we shall need to look for an
14522 expression-statement. */
14523 }
14524 /* If we are here, it is an expression-statement. */
14527 }
14529 /* Parse a jump-statement.
14531 jump-statement:
14532 break ;
14533 continue ;
14534 return expression [opt] ;
14535 return braced-init-list ;
14536 coroutine-return-statement;
14537 goto identifier ;
14539 GNU extension:
14541 jump-statement:
14542 goto * expression ;
14544 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
14546 static tree
14548 {
14554 /* Peek at the next token. */
14559 /* See what kind of keyword it is. */
14562 {
14566 {
14583 }
14589 {
14593 /* Fall through. */
14603 }
14609 {
14610 tree expr;
14613 {
14617 }
14620 else
14621 /* If the next token is a `;', then there is no
14622 expression. */
14624 /* Build the return-statement, check co-return first, since type
14625 deduction is not valid there. */
14630 else
14632 /* Look for the final `;'. */
14634 }
14641 {
14645 }
14647 /* Create the goto-statement. */
14649 {
14650 /* Issue a warning about this use of a GNU extension. */
14652 /* Consume the '*' token. */
14654 /* Parse the dependent expression. */
14656 }
14657 else
14659 /* Look for the final `;'. */
14666 }
14669 }
14671 /* Parse a declaration-statement.
14673 declaration-statement:
14674 block-declaration */
14676 static void
14678 {
14681 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14684 /* Parse the block-declaration. */
14687 /* Free any declarators allocated. */
14689 }
14691 /* Some dependent statements (like `if (cond) statement'), are
14692 implicitly in their own scope. In other words, if the statement is
14693 a single statement (as opposed to a compound-statement), it is
14694 none-the-less treated as if it were enclosed in braces. Any
14695 declarations appearing in the dependent statement are out of scope
14696 after control passes that point. This function parses a statement,
14697 but ensures that is in its own scope, even if it is not a
14698 compound-statement.
14700 If IF_P is not NULL, *IF_P is set to indicate whether the statement
14701 is a (possibly labeled) if statement which is not enclosed in
14702 braces and has an else clause. This is used to implement
14703 -Wparentheses.
14705 CHAIN is a vector of if-else-if conditions. This is used to implement
14706 -Wduplicated-cond.
14708 Returns the new statement. */
14710 static tree
14714 {
14715 tree statement;
14718 token_indent_info body_tinfo
14724 /* Mark if () ; with a special NOP_EXPR. */
14726 {
14737 }
14738 /* if a compound is opened, we simply parse the statement directly. */
14741 /* If the token is not a `{', then we must take special action. */
14742 else
14743 {
14744 /* Create a compound-statement. */
14746 /* Parse the dependent-statement. */
14749 /* Finish the dummy compound-statement. */
14751 }
14753 token_indent_info next_tinfo
14762 /* Return the statement. */
14764 }
14766 /* For some dependent statements (like `while (cond) statement'), we
14767 have already created a scope. Therefore, even if the dependent
14768 statement is a compound-statement, we do not want to create another
14769 scope. */
14771 static void
14774 {
14775 /* If the token is a `{', then we must take special action. */
14777 {
14778 token_indent_info body_tinfo
14784 token_indent_info next_tinfo
14793 }
14794 else
14795 {
14796 /* Avoid calling cp_parser_compound_statement, so that we
14797 don't create a new scope. Do everything else by hand. */
14798 matching_braces braces;
14800 /* If the next keyword is `__label__' we have a label declaration. */
14803 /* Parse an (optional) statement-seq. */
14806 }
14807 }
14809 /* Modules */
14811 /* Parse a module-name,
14812 identifier
14813 module-name . identifier
14814 header-name
14816 Returns a pointer to module object, NULL. */
14820 {
14823 {
14827 }
14832 {
14835 }
14838 {
14840 {
14843 }
14854 }
14857 }
14859 /* Named module-declaration
14860 __module ; PRAGMA_EOL
14861 __module private ; PRAGMA_EOL (unimplemented)
14862 [__export] __module module-name attr-spec-seq-opt ; PRAGMA_EOL
14863 */
14865 static module_parse
14868 {
14869 /* We're a pseudo pragma. */
14874 {
14878 }
14881 {
14882 /* Start global module fragment. */
14887 }
14892 {
14900 {
14903 }
14904 else
14906 "private module fragment only permitted in purview"
14908 }
14910 {
14911 /* Neither the first declaration, nor in a GMF. */
14914 skip_eol:
14916 }
14917 else
14918 {
14928 }
14931 }
14933 /* Import-declaration
14934 [__export] __import module-name attr-spec-seq-opt ; PRAGMA_EOL */
14936 static void
14939 {
14940 /* We're a pseudo pragma. */
14945 {
14948 note_lexer:
14950 " disambiguation, to prevent this being considered a"
14952 skip_eol:
14954 }
14956 {
14959 }
14960 else
14961 {
14974 {
14975 /* Module-purview imports must not be from source inclusion
14976 [cpp.import]/7 */
14985 }
14988 }
14989 }
14991 /* export-declaration.
14993 export declaration
14994 export { declaration-seq-opt } */
14996 static void
14998 {
15017 {
15024 }
15025 else
15026 {
15027 /* Explicitly check if the next tokens might be a
15028 module-directive line, so we can give a clearer error message
15029 about why the directive will be rejected. */
15036 }
15039 }
15041 /* Declarations [gram.dcl.dcl] */
15043 /* Parse an optional declaration-sequence. TOP_LEVEL is true, if this
15044 is the top-level declaration sequence. That affects whether we
15045 deal with module-preamble.
15047 declaration-seq:
15048 declaration
15049 declaration-seq declaration */
15051 static void
15053 {
15055 {
15061 else
15063 }
15064 }
15066 /* Parse a declaration.
15068 declaration:
15069 block-declaration
15070 function-definition
15071 template-declaration
15072 explicit-instantiation
15073 explicit-specialization
15074 linkage-specification
15075 namespace-definition
15077 C++17:
15078 deduction-guide
15080 modules:
15081 (all these are only allowed at the outermost level, check
15082 that semantically, for better diagnostics)
15083 module-declaration
15084 module-export-declaration
15085 module-import-declaration
15086 export-declaration
15088 GNU extension:
15090 declaration:
15091 __extension__ declaration */
15093 static void
15095 {
15098 /* Check for the `__extension__' keyword. */
15100 {
15101 /* Parse the qualified declaration. */
15103 /* Restore the PEDANTIC flag. */
15107 }
15109 /* Try to figure out what kind of declaration is present. */
15115 {
15117 /* A declaration consisting of a single semicolon is invalid
15118 * before C++11. Allow it unless we're being pedantic. */
15122 }
15126 CPP_SEMICOLON))
15127 {
15132 {
15135 std_attrs);
15137 {
15140 {
15142 CPP_PRAGMA));
15144 }
15146 }
15147 }
15155 }
15157 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
15162 /* Conditionally, allow attributes to precede a linkage specification. */
15164 {
15172 {
15174 /* We might have already been here. */
15176 {
15184 }
15187 }
15188 else
15189 {
15192 }
15193 }
15194 /* If we already had some attributes, and we've added more, then prepend.
15195 Otherwise attributes just contains any that we just read. */
15197 {
15201 }
15203 /* If the next token is `extern' and the following token is a string
15204 literal, then we have a linkage specification. */
15208 /* If the next token is `template', then we have either a template
15209 declaration, an explicit instantiation, or an explicit
15210 specialization. */
15212 {
15213 /* `template <>' indicates a template specialization. */
15217 /* `template <' indicates a template declaration. */
15220 /* Anything else must be an explicit instantiation. */
15221 else
15223 }
15224 /* If the next token is `export', it's new-style modules or
15225 old-style template. */
15227 {
15230 else
15232 }
15234 {
15239 // In module purview this will be ill-formed.
15245 else
15247 }
15248 /* If the next token is `extern', 'static' or 'inline' and the one
15249 after that is `template', we have a GNU extended explicit
15250 instantiation directive. */
15257 /* If the next token is `namespace', check for a named or unnamed
15258 namespace definition. */
15267 /* An unnamed namespace definition. */
15271 /* An inline (associated) namespace definition. */
15275 /* Objective-C++ declaration/definition. */
15282 /* At this point we may have a template declared by a concept
15283 introduction. */
15288 else
15289 /* Try to parse a block-declaration, or a function-definition. */
15292 /* Free any declarators allocated. */
15294 }
15296 /* Parse a namespace-scope declaration. */
15298 static void
15300 {
15304 /* A top-level declaration can consist solely of a #pragma. A
15305 nested declaration cannot, so this is done here and not in
15306 cp_parser_declaration. (A #pragma at block scope is
15307 handled in cp_parser_statement.) */
15309 else
15310 /* Parse the declaration itself. */
15312 }
15314 /* Parse a block-declaration.
15316 block-declaration:
15317 simple-declaration
15318 asm-definition
15319 namespace-alias-definition
15320 using-declaration
15321 using-directive
15323 GNU Extension:
15325 block-declaration:
15326 __extension__ block-declaration
15328 C++0x Extension:
15330 block-declaration:
15331 static_assert-declaration
15333 If STATEMENT_P is TRUE, then this block-declaration is occurring as
15334 part of a declaration-statement. */
15336 static void
15339 {
15342 /* Check for the `__extension__' keyword. */
15344 {
15345 /* Parse the qualified declaration. */
15347 /* Restore the PEDANTIC flag. */
15351 }
15353 /* Peek at the next token to figure out which kind of declaration is
15354 present. */
15358 /* If the next keyword is `asm', we have an asm-definition. */
15360 {
15364 }
15365 /* If the next keyword is `namespace', we have a
15366 namespace-alias-definition. */
15369 /* If the next keyword is `using', we have a
15370 using-declaration, a using-directive, or an alias-declaration. */
15372 {
15377 /* If the token after `using' is `namespace', then we have a
15378 using-directive. */
15384 /* If the second token after 'using' is '=', then we have an
15385 alias-declaration. */
15391 /* Otherwise, it's a using-declaration. */
15392 else
15395 }
15396 /* If the next keyword is `__label__' we have a misplaced label
15397 declaration. */
15399 {
15403 /* If the next token is now a `;', consume it. */
15406 }
15407 /* If the next token is `static_assert' we have a static assertion. */
15410 /* If the next tokens after attributes is `using namespace', then we have
15411 a using-directive. */
15414 RID_USING)
15416 RID_NAMESPACE))
15417 {
15421 }
15422 /* Anything else must be a simple-declaration. */
15423 else
15426 }
15428 /* Parse a simple-declaration.
15430 simple-declaration:
15431 decl-specifier-seq [opt] init-declarator-list [opt] ;
15432 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15433 brace-or-equal-initializer ;
15435 init-declarator-list:
15436 init-declarator
15437 init-declarator-list , init-declarator
15439 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
15440 function-definition as a simple-declaration.
15442 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15443 parsed declaration if it is an uninitialized single declarator not followed
15444 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15445 if present, will not be consumed. */
15447 static void
15451 {
15452 cp_decl_specifier_seq decl_specifiers;
15461 /* Defer access checks until we know what is being declared; the
15462 checks for names appearing in the decl-specifier-seq should be
15463 done as if we were in the scope of the thing being declared. */
15466 /* Parse the decl-specifier-seq. We have to keep track of whether
15467 or not the decl-specifier-seq declares a named class or
15468 enumeration type, since that is the only case in which the
15469 init-declarator-list is allowed to be empty.
15471 [dcl.dcl]
15473 In a simple-declaration, the optional init-declarator-list can be
15474 omitted only when declaring a class or enumeration, that is when
15475 the decl-specifier-seq contains either a class-specifier, an
15476 elaborated-type-specifier, or an enum-specifier. */
15478 CP_PARSER_FLAGS_OPTIONAL,
15481 /* We no longer need to defer access checks. */
15484 cp_omp_declare_simd_data odsd;
15490 /* In a block scope, a valid declaration must always have a
15491 decl-specifier-seq. By not trying to parse declarators, we can
15492 resolve the declaration/expression ambiguity more quickly. */
15495 {
15498 }
15500 /* If the next two tokens are both identifiers, the code is
15501 erroneous. The usual cause of this situation is code like:
15503 T t;
15505 where "T" should name a type -- but does not. */
15508 {
15509 /* If parsing tentatively, we should commit; we really are
15510 looking at a declaration. */
15512 /* Give up. */
15514 }
15518 /* Look for C++17 decomposition declaration. */
15526 {
15527 tree decl
15529 maybe_range_for_decl,
15532 /* The next token should be either a `,' or a `;'. */
15534 /* If it's a `;', we are done. */
15538 {
15542 }
15543 /* Anything else is an error. */
15544 else
15545 {
15546 /* If we have already issued an error message we don't need
15547 to issue another one. */
15552 /* Skip tokens until we reach the end of the statement. */
15554 /* If the next token is now a `;', consume it. */
15558 }
15559 }
15560 else
15563 tree last_type;
15565 /* NULL_TREE if both variable and function declaration are allowed,
15566 error_mark_node if function declaration are not allowed and
15567 a FUNCTION_DECL that should be diagnosed if it is followed by
15568 variable declarations. */
15569 tree auto_function_declaration;
15572 auto_specifier_p
15576 /* Keep going until we hit the `;' at the end of the simple
15577 declaration. */
15580 CPP_SEMICOLON))
15581 {
15584 tree decl;
15588 {
15589 /* If we are processing next declarator, comma is expected */
15594 {
15598 }
15599 }
15600 else
15603 /* Parse the init-declarator. */
15605 CP_PARSER_FLAGS_NONE,
15608 function_definition_allowed_p,
15610 declares_class_or_enum,
15612 maybe_range_for_decl,
15615 /* If an error occurred while parsing tentatively, exit quickly.
15616 (That usually happens when in the body of a function; each
15617 statement is treated as a declaration-statement until proven
15618 otherwise.) */
15623 {
15624 /* If the init-declarator-list contains more than one
15625 init-declarator, they shall all form declarations of
15626 variables. */
15628 auto_function_declaration
15632 {
15634 "non-variable %qD in declaration with more than one "
15639 }
15640 }
15644 {
15648 {
15649 /* If the list of declarators contains more than one declarator,
15650 the type of each declared variable is determined as described
15651 above. If the type deduced for the template parameter U is not
15652 the same in each deduction, the program is ill-formed. */
15657 }
15658 else
15660 }
15662 /* Handle function definitions specially. */
15664 {
15665 /* If the next token is a `,', then we are probably
15666 processing something like:
15668 void f() {}, *p;
15670 which is erroneous. */
15672 {
15675 "mixing"
15677 }
15678 /* Otherwise, we're done with the list of declarators. */
15679 else
15680 {
15684 }
15685 }
15688 /* The next token should be either a `,' or a `;'. */
15690 /* If it's a `,', there are more declarators to come. */
15693 /* If it's a `;', we are done. */
15697 {
15702 }
15703 /* Anything else is an error. */
15704 else
15705 {
15706 /* If we have already issued an error message we don't need
15707 to issue another one. */
15712 /* Skip tokens until we reach the end of the statement. */
15714 /* If the next token is now a `;', consume it. */
15718 }
15719 /* After the first time around, a function-definition is not
15720 allowed -- even if it was OK at first. For example:
15722 int i, f() {}
15724 is not valid. */
15726 }
15728 /* Issue an error message if no declarators are present, and the
15729 decl-specifier-seq does not itself declare a class or
15730 enumeration: [dcl.dcl]/3. */
15732 {
15734 {
15738 /* Ensure an error is issued anyway when finish_decltype_type,
15739 called via cp_parser_decl_specifier_seq, returns a class or
15740 an enumeration (c++/51786). */
15743 }
15744 /* Perform any deferred access checks. */
15746 }
15748 /* Consume the `;'. */
15749 finish:
15753 {
15759 }
15761 done:
15764 }
15766 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
15767 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15768 initializer ; */
15770 static tree
15775 {
15780 /* Parse the identifier-list. */
15784 {
15792 }
15796 {
15802 else
15803 {
15806 }
15807 }
15811 "structured bindings only available with "
15814 tree pushed_scope;
15821 NULL_TREE);
15828 cp_expr e;
15829 cp_decl_specifier_seq decl_specs;
15834 {
15838 else
15839 {
15842 }
15843 tree elt_pushed_scope;
15849 {
15850 /* Ensure we've diagnosed redeclaration if we aren't creating
15851 a new VAR_DECL. */
15854 }
15855 else
15859 }
15862 {
15865 }
15869 {
15877 || (is_direct_init
15880 {
15884 }
15887 {
15893 }
15894 }
15896 {
15899 /* Ensure DECL_VALUE_EXPR is created for all the decls but
15900 the underlying DECL. */
15902 }
15908 {
15911 }
15914 }
15916 /* Names of storage classes. */
15919 cp_storage_class_name[] = {
15921 };
15923 /* Parse a decl-specifier-seq.
15925 decl-specifier-seq:
15926 decl-specifier-seq [opt] decl-specifier
15927 decl-specifier attribute-specifier-seq [opt] (C++11)
15929 decl-specifier:
15930 storage-class-specifier
15931 type-specifier
15932 function-specifier
15933 friend
15934 typedef
15936 GNU Extension:
15938 decl-specifier:
15939 attributes
15941 Concepts Extension:
15943 decl-specifier:
15944 concept
15946 Set *DECL_SPECS to a representation of the decl-specifier-seq.
15948 The parser flags FLAGS is used to control type-specifier parsing.
15950 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
15951 flags:
15953 1: one of the decl-specifiers is an elaborated-type-specifier
15954 (i.e., a type declaration)
15955 2: one of the decl-specifiers is an enum-specifier or a
15956 class-specifier (i.e., a type definition)
15958 */
15960 static void
15962 cp_parser_flags flags,
15965 {
15969 cp_decl_spec ds;
15971 /* Clear DECL_SPECS. */
15974 /* Assume no class or enumeration type is declared. */
15977 /* Keep reading specifiers until there are no more to read. */
15979 {
15984 /* Peek at the next token. */
15987 /* Save the first token of the decl spec list for error
15988 reporting. */
15991 /* Handle attributes. */
15994 {
15995 /* Parse the attributes. */
15998 /* In a sequence of declaration specifiers, c++11 attributes
15999 appertain to the type that precede them. In that case
16000 [dcl.spec]/1 says:
16002 The attribute-specifier-seq affects the type only for
16003 the declaration it appears in, not other declarations
16004 involving the same type.
16006 But for now let's force the user to position the
16007 attribute either at the beginning of the declaration or
16008 after the declarator-id, which would clearly mean that it
16009 applies to the declarator. */
16011 {
16013 /* The c++11 attribute is at the beginning of the
16014 declaration. It appertains to the entity being
16016 else
16017 {
16019 {
16022 }
16024 {
16025 /* This is an attribute following a
16026 class-specifier. */
16031 }
16032 else
16033 {
16034 decl_specs->std_attributes
16038 }
16040 }
16041 }
16043 decl_specs->attributes
16048 }
16049 /* Assume we will find a decl-specifier keyword. */
16051 /* If the next token is an appropriate keyword, we can simply
16052 add it to the list. */
16054 {
16055 /* decl-specifier:
16056 friend
16057 constexpr
16058 constinit */
16061 {
16066 }
16067 else
16068 {
16070 /* Consume the token. */
16072 }
16097 /* Warn for concept as a decl-specifier. We'll rewrite these as
16098 concept declarations later. */
16100 {
16105 else
16108 }
16110 /* In C++20 a concept definition is just 'concept name = expr;'
16111 Support that syntax as a TS extension by pretending we've seen
16112 the 'bool' specifier. */
16116 {
16120 }
16123 /* function-specifier:
16124 inline
16125 virtual
16126 explicit */
16133 /* decl-specifier:
16134 typedef */
16137 /* Consume the token. */
16143 /* A constructor declarator cannot appear in a typedef. */
16145 /* The "typedef" keyword can only occur in a declaration; we
16146 may as well commit at this point. */
16150 {
16160 }
16163 /* storage-class-specifier:
16164 auto
16165 register
16166 static
16167 extern
16168 mutable
16170 GNU Extension:
16171 thread */
16174 {
16175 /* Consume the token. */
16178 /* Complain about `auto' as a storage specifier, if
16179 we're complaining about C++0x compatibility. */
16183 "%<auto%> changes meaning in C++11; "
16186 /* Set the storage class anyway. */
16188 token);
16189 }
16190 else
16191 /* C++0x auto type-specifier. */
16199 /* Consume the token. */
16202 token);
16205 /* Consume the token. */
16211 /* We did not yet find a decl-specifier yet. */
16214 }
16226 {
16232 "%qD only valid in lambda with %<-std=c++23%> or "
16234 }
16239 /* Constructors are a special case. The `S' in `S()' is not a
16240 decl-specifier; it is the beginning of the declarator. */
16241 constructor_p
16242 = (!found_decl_spec
16243 && constructor_possible_p
16244 && (cp_parser_constructor_declarator_p
16246 ds_friend))));
16248 /* If we don't have a DECL_SPEC yet, then we must be looking at
16249 a type-specifier. */
16251 {
16254 tree type_spec;
16259 type_spec
16261 decl_specs,
16267 /* If this type-specifier referenced a user-defined type
16268 (a typedef, class-name, etc.), then we can't allow any
16269 more such type-specifiers henceforth.
16271 [dcl.spec]
16273 The longest sequence of decl-specifiers that could
16274 possibly be a type name is taken as the
16275 decl-specifier-seq of a declaration. The sequence shall
16276 be self-consistent as described below.
16278 [dcl.type]
16280 As a general rule, at most one type-specifier is allowed
16281 in the complete decl-specifier-seq of a declaration. The
16282 only exceptions are the following:
16284 -- const or volatile can be combined with any other
16285 type-specifier.
16287 -- signed or unsigned can be combined with char, long,
16288 short, or int.
16290 -- ..
16292 Example:
16294 typedef char* Pc;
16295 void g (const int Pc);
16297 Here, Pc is *not* part of the decl-specifier seq; it's
16298 the declarator. Therefore, once we see a type-specifier
16299 (other than a cv-qualifier), we forbid any additional
16300 user-defined types. We *do* still allow things like `int
16301 int' to be considered a decl-specifier-seq, and issue the
16302 error message later. */
16305 /* A constructor declarator cannot follow a type-specifier. */
16307 {
16315 }
16316 }
16318 /* If we still do not have a DECL_SPEC, then there are no more
16319 decl-specifiers. */
16324 {
16328 "standard attributes must precede the decl-specifiers to "
16329 "apply to the declaration, or follow them to apply to "
16331 }
16334 /* After we see one decl-specifier, further decl-specifiers are
16335 always optional. */
16337 }
16339 /* Don't allow a friend specifier with a class definition. */
16344 }
16346 /* Parse an (optional) storage-class-specifier.
16348 storage-class-specifier:
16349 auto
16350 register
16351 static
16352 extern
16353 mutable
16355 GNU Extension:
16357 storage-class-specifier:
16358 thread
16360 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
16362 static tree
16364 {
16366 {
16370 /* Fall through for C++98. */
16378 /* Consume the token. */
16383 }
16384 }
16386 /* Parse an (optional) function-specifier.
16388 function-specifier:
16389 inline
16390 virtual
16391 explicit
16393 C++20 Extension:
16394 explicit(constant-expression)
16396 Returns an IDENTIFIER_NODE corresponding to the keyword used.
16397 Updates DECL_SPECS, if it is non-NULL. */
16399 static tree
16402 {
16405 {
16411 /* 14.5.2.3 [temp.mem]
16413 A member function template shall not be virtual. */
16417 else
16422 {
16424 /* If we see '(', it's C++20 explicit(bool). */
16425 tree expr;
16427 {
16428 matching_parens parens;
16431 /* New types are not allowed in an explicit-specifier. */
16434 parser->type_definition_forbidden_message
16439 "%<explicit(bool)%> only available with %<-std=c++20%> "
16442 /* Parse the constant-expression. */
16445 /* Restore the saved message. */
16448 }
16449 else
16450 /* The explicit-specifier explicit without a constant-expression is
16451 equivalent to the explicit-specifier explicit(true). */
16454 /* [dcl.fct.spec]
16455 "the constant-expression, if supplied, shall be a contextually
16456 converted constant expression of type bool." */
16458 /* We could evaluate it -- mark the decl as appropriate. */
16464 /* The expression was value-dependent. Remember it so that we can
16465 substitute it later. */
16468 }
16472 }
16474 /* Consume the token. */
16476 }
16478 /* Parse a linkage-specification.
16480 linkage-specification:
16481 extern string-literal { declaration-seq [opt] }
16482 extern string-literal declaration */
16484 static void
16486 {
16487 /* Look for the `extern' keyword. */
16488 cp_token *extern_token
16491 /* Look for the string-literal. */
16496 /* Transform the literal into an identifier. If the literal is a
16497 wide-character string, or contains embedded NULs, then we can't
16498 handle it as the user wants. */
16502 {
16504 /* Assume C++ linkage. */
16506 }
16507 else
16510 /* We're now using the new linkage. */
16515 /* Preserve the location of the innermost linkage specification,
16516 tracking the locations of nested specifications via a local. */
16517 location_t saved_location
16519 /* Construct a location ranging from the start of the "extern" to
16520 the end of the string-literal, with the caret at the start, e.g.:
16521 extern "C" {
16522 ^~~~~~~~~~
16523 */
16524 parser->innermost_linkage_specification_location
16529 /* If the next token is a `{', then we're using the first
16530 production. */
16532 {
16536 /* Consume the `{' token. */
16537 matching_braces braces;
16539 /* Parse the declarations. */
16541 /* Look for the closing `}'. */
16543 }
16544 /* Otherwise, there's just one declaration. */
16545 else
16546 {
16549 saved_in_unbraced_linkage_specification_p
16553 parser->in_unbraced_linkage_specification_p
16555 }
16557 /* We're done with the linkage-specification. */
16561 /* Restore location of parent linkage specification, if any. */
16563 }
16565 /* Parse a static_assert-declaration.
16567 static_assert-declaration:
16568 static_assert ( constant-expression , string-literal ) ;
16569 static_assert ( constant-expression ) ; (C++17)
16571 If MEMBER_P, this static_assert is a class member. */
16573 static void
16575 {
16576 cp_expr condition;
16577 location_t token_loc;
16578 tree message;
16580 /* Peek at the `static_assert' token so we can keep track of exactly
16581 where the static assertion started. */
16584 /* Look for the `static_assert' keyword. */
16586 RT_STATIC_ASSERT))
16589 /* We know we are in a static assertion; commit to any tentative
16590 parse. */
16594 /* Parse the `(' starting the static assertion condition. */
16595 matching_parens parens;
16598 /* Parse the constant-expression. Allow a non-constant expression
16599 here in order to give better diagnostics in finish_static_assert. */
16600 condition =
16606 {
16609 "%<static_assert%> without a message "
16611 /* Eat the ')' */
16616 }
16617 else
16618 {
16619 /* Parse the separating `,'. */
16622 /* Parse the string-literal message. */
16626 /* A `)' completes the static assertion. */
16632 }
16634 /* A semicolon terminates the declaration. */
16637 /* Get the location for the static assertion. Use that of the
16638 condition if available, otherwise, use that of the "static_assert"
16639 token. */
16644 /* Complete the static assertion, which may mean either processing
16645 the static assert now or saving it for template instantiation. */
16648 }
16650 /* Parse the expression in decltype ( expression ). */
16652 static tree
16655 {
16657 tree expr;
16659 /* First, try parsing an id-expression. */
16670 {
16673 cp_id_kind idk;
16677 /* Lookup the name we got back from the id-expression. */
16687 {
16688 /* Complete lookup of the id-expression. */
16689 expr = (finish_id_expression
16702 {
16703 /* We found an id-expression, but it was something that we
16704 should not have found. This is an error, not something
16705 we can recover from, so report the error we found and
16706 we'll recover as gracefully as possible. */
16711 }
16712 }
16717 /* We have an id-expression. */
16719 }
16722 {
16723 /* Abort the id-expression parse. */
16726 /* Parsing tentatively, again. */
16729 /* Parse a class member access. */
16737 /* We have an id-expression. */
16739 }
16742 /* We have parsed the complete id-expression or member access. */
16744 else
16745 {
16746 /* Abort our attempt to parse an id-expression or member access
16747 expression. */
16750 /* Parse a full expression. */
16753 }
16756 }
16758 /* Parse a `decltype' type. Returns the type.
16760 decltype-specifier:
16761 decltype ( expression )
16762 C++14:
16763 decltype ( auto ) */
16765 static tree
16767 {
16772 {
16773 /* Already parsed. */
16776 }
16778 /* Look for the `decltype' token. */
16782 /* Parse the opening `('. */
16783 matching_parens parens;
16787 /* Since we're going to preserve any side-effects from this parse, set up a
16788 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16789 in the expression. */
16792 /* If in_declarator_p, a reparse as an expression might succeed (60361).
16793 Otherwise, commit now for better diagnostics. */
16804 {
16805 /* decltype (auto) */
16808 {
16810 "%<decltype(auto)%> type specifier only available with "
16813 }
16814 }
16815 else
16816 {
16817 /* decltype (expression) */
16819 /* Types cannot be defined in a `decltype' expression. Save away the
16820 old message and set the new one. */
16822 parser->type_definition_forbidden_message
16825 /* The restrictions on constant-expressions do not apply inside
16826 decltype expressions. */
16827 bool saved_integral_constant_expression_p
16829 bool saved_non_integral_constant_expression_p
16833 /* Within a parenthesized expression, a `>' token is always
16834 the greater-than operator. */
16835 bool saved_greater_than_is_operator_p
16839 /* Don't synthesize an implicit template type parameter here. This
16840 could happen with C++23 code like
16842 void f(decltype(new auto{0}));
16844 where we want to deduce the auto right away so that the parameter
16845 is of type 'int *'. */
16849 /* Do not actually evaluate the expression. */
16852 /* Do not warn about problems with the expression. */
16858 /* Go back to evaluating expressions. */
16862 /* The `>' token might be the end of a template-id or
16863 template-parameter-list now. */
16864 parser->greater_than_is_operator_p
16867 /* Restore the old message and the integral constant expression
16868 flags. */
16870 parser->integral_constant_expression_p
16872 parser->non_integral_constant_expression_p
16874 }
16876 /* Parse to the closing `)'. */
16878 {
16882 }
16884 /* If we got a parse error while tentative, bail out now. */
16886 {
16889 }
16892 /* Build auto. */
16894 else
16896 tf_warning_or_error);
16898 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
16899 it again. */
16916 }
16918 /* Special member functions [gram.special] */
16920 /* Parse a conversion-function-id.
16922 conversion-function-id:
16923 operator conversion-type-id
16925 Returns an IDENTIFIER_NODE representing the operator. */
16927 static tree
16929 {
16930 tree type;
16931 tree saved_scope;
16932 tree saved_qualifying_scope;
16933 tree saved_object_scope;
16936 /* Look for the `operator' token. */
16939 /* When we parse the conversion-type-id, the current scope will be
16940 reset. However, we need that information in able to look up the
16941 conversion function later, so we save it here. */
16945 /* We must enter the scope of the class so that the names of
16946 entities declared within the class are available in the
16947 conversion-type-id. For example, consider:
16949 struct S {
16950 typedef int I;
16951 operator I();
16952 };
16954 S::operator I() { ... }
16956 In order to see that `I' is a type-name in the definition, we
16957 must be in the scope of `S'. */
16960 /* Parse the conversion-type-id. */
16962 /* Leave the scope of the class, if any. */
16965 /* Restore the saved scope. */
16969 /* If the TYPE is invalid, indicate failure. */
16973 }
16975 /* Parse a conversion-type-id:
16977 conversion-type-id:
16978 type-specifier-seq conversion-declarator [opt]
16980 Returns the TYPE specified. */
16982 static tree
16984 {
16985 tree attributes;
16986 cp_decl_specifier_seq type_specifiers;
16988 tree type_specified;
16991 /* Parse the attributes. */
16995 parser->type_definition_forbidden_message
16998 /* Parse the type-specifiers. DR 2413 clarifies that `typename' is
16999 optional in conversion-type-id. */
17007 /* If that didn't work, stop. */
17010 /* Parse the conversion-declarator. */
17018 /* Don't give this error when parsing tentatively. This happens to
17019 work because we always parse this definitively once. */
17022 {
17024 {
17027 }
17031 }
17034 }
17036 /* Parse an (optional) conversion-declarator.
17038 conversion-declarator:
17039 ptr-operator conversion-declarator [opt]
17041 */
17045 {
17048 cp_cv_quals cv_quals;
17050 /* We don't know if there's a ptr-operator next, or not. */
17052 /* Try the ptr-operator. */
17055 /* If it worked, look for more conversion-declarators. */
17057 {
17060 /* Parse another optional declarator. */
17063 declarator = cp_parser_make_indirect_declarator
17067 }
17070 }
17072 /* Parse an (optional) ctor-initializer.
17074 ctor-initializer:
17075 : mem-initializer-list */
17077 static void
17079 {
17080 /* If the next token is not a `:', then there is no
17081 ctor-initializer. */
17083 {
17084 /* Do default initialization of any bases and members. */
17088 }
17090 /* Consume the `:' token. */
17092 /* And the mem-initializer-list. */
17094 }
17096 /* Parse a mem-initializer-list.
17098 mem-initializer-list:
17099 mem-initializer ... [opt]
17100 mem-initializer ... [opt] , mem-initializer-list */
17102 static void
17104 {
17109 /* Let the semantic analysis code know that we are starting the
17110 mem-initializer-list. */
17115 /* Loop through the list. */
17117 {
17118 tree mem_initializer;
17121 /* Parse the mem-initializer. */
17123 /* If the next token is a `...', we're expanding member initializers. */
17129 {
17130 /* Consume the `...'. */
17134 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
17135 can be expanded but members cannot. */
17138 {
17143 }
17145 /* Construct the pack expansion type. */
17148 }
17151 {
17155 }
17156 /* Look for a target constructor. */
17160 {
17163 {
17167 }
17169 }
17170 /* Add it to the list, unless it was erroneous. */
17172 {
17175 }
17176 /* If the next token is not a `,', we're done. */
17179 /* Consume the `,' token. */
17181 }
17183 /* Perform semantic analysis. */
17186 }
17188 /* Parse a mem-initializer.
17190 mem-initializer:
17191 mem-initializer-id ( expression-list [opt] )
17192 mem-initializer-id braced-init-list
17194 GNU extension:
17196 mem-initializer:
17197 ( expression-list [opt] )
17199 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
17200 class) or FIELD_DECL (for a non-static data member) to initialize;
17201 the TREE_VALUE is the expression-list. An empty initialization
17202 list is represented by void_list_node. */
17204 static tree
17206 {
17207 tree mem_initializer_id;
17208 tree expression_list;
17209 tree member;
17212 /* Find out what is being initialized. */
17214 {
17218 }
17219 else
17220 {
17224 }
17230 {
17236 }
17237 else
17238 {
17250 }
17263 /* We can't attach the source location of this initializer directly to
17264 the list node, so we instead attach it to a dummy EMPTY_CLASS_EXPR
17265 within the TREE_TYPE of the list node. */
17266 location_t loc
17273 }
17275 /* Parse a mem-initializer-id.
17277 mem-initializer-id:
17278 :: [opt] nested-name-specifier [opt] class-name
17279 decltype-specifier (C++11)
17280 identifier
17282 Returns a TYPE indicating the class to be initialized for the first
17283 production (and the second in C++11). Returns an IDENTIFIER_NODE
17284 indicating the data member to be initialized for the last production. */
17286 static tree
17288 {
17292 tree id;
17296 /* `typename' is not allowed in this context ([temp.res]). */
17298 {
17300 "keyword %<typename%> not allowed in this context (a qualified "
17303 }
17304 /* Look for the optional `::' operator. */
17305 global_scope_p
17309 /* Look for the optional nested-name-specifier. The simplest way to
17310 implement:
17312 [temp.res]
17314 The keyword `typename' is not permitted in a base-specifier or
17315 mem-initializer; in these contexts a qualified name that
17316 depends on a template-parameter is implicitly assumed to be a
17317 type name.
17319 is to assume that we have seen the `typename' keyword at this
17320 point. */
17321 nested_name_specifier_p
17330 /* If there is a `::' operator or a nested-name-specifier, then we
17331 are definitely looking for a class-name. */
17336 typename_type,
17340 /* Otherwise, we could also be looking for an ordinary identifier. */
17343 /* Try a decltype-specifier. */
17345 else
17346 /* Otherwise, try a class-name. */
17350 none_type,
17354 /* If we found one, we're done. */
17357 /* Otherwise, look for an ordinary identifier. */
17359 }
17361 /* Overloading [gram.over] */
17363 /* Parse an operator-function-id.
17365 operator-function-id:
17366 operator operator
17368 Returns an IDENTIFIER_NODE for the operator which is a
17369 human-readable spelling of the identifier, e.g., `operator +'. */
17371 static cp_expr
17373 {
17375 /* Look for the `operator' keyword. */
17378 /* And then the name of the operator itself. */
17380 }
17382 /* Return an identifier node for a user-defined literal operator.
17383 The suffix identifier is chained to the operator name identifier. */
17385 tree
17387 {
17388 tree identifier;
17396 }
17398 /* Parse an operator.
17400 operator:
17401 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
17402 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
17403 || ++ -- , ->* -> () []
17405 GNU Extensions:
17407 operator:
17408 <? >? <?= >?=
17410 Returns an IDENTIFIER_NODE for the operator which is a
17411 human-readable spelling of the identifier, e.g., `operator +'. */
17413 static cp_expr
17415 {
17420 /* Peek at the next token. */
17425 /* Figure out which operator we have. */
17430 {
17432 {
17433 /* The keyword should be either `new', `delete' or `co_await'. */
17440 else
17443 /* Consume the `new', `delete' or co_await token. */
17446 /* Peek at the next token. */
17448 /* If it's a `[' token then this is the array variant of the
17449 operator. */
17452 {
17453 /* Consume the `[' token. */
17455 /* Look for the `]' token. */
17460 }
17463 }
17626 /* Consume the `?'. */
17628 /* Look for the matching `:'. */
17634 {
17635 /* Consume the `('. */
17636 matching_parens parens;
17638 /* Look for the matching `)'. */
17645 }
17648 /* Consume the `['. */
17650 /* Look for the matching `]'. */
17661 /* FALLTHRU */
17670 {
17671 tree string_tree;
17677 /* Consume the string. */
17683 {
17687 }
17688 else
17689 {
17691 /* Look for the suffix identifier. */
17694 {
17697 }
17699 {
17703 }
17704 else
17705 {
17708 }
17709 }
17714 {
17717 }
17720 {
17723 }
17725 {
17728 }
17729 /* Generate a location of the form:
17730 "" _suffix_identifier
17731 ^~~~~~~~~~~~~~~~~~~~~
17732 with caret == start at the start token, finish at the end of the
17733 suffix identifier. */
17734 location_t combined_loc
17737 }
17740 /* Anything else is an error. */
17742 }
17744 /* If we have selected an identifier, we need to consume the
17745 operator token. */
17747 {
17751 }
17752 /* Otherwise, no valid operator name was present. */
17753 else
17754 {
17757 }
17761 }
17763 /* Parse a template-declaration.
17765 template-declaration:
17766 export [opt] template < template-parameter-list > declaration
17768 If MEMBER_P is TRUE, this template-declaration occurs within a
17769 class-specifier.
17771 The grammar rule given by the standard isn't correct. What
17772 is really meant is:
17774 template-declaration:
17775 export [opt] template-parameter-list-seq
17776 decl-specifier-seq [opt] init-declarator [opt] ;
17777 export [opt] template-parameter-list-seq
17778 function-definition
17780 template-parameter-list-seq:
17781 template-parameter-list-seq [opt]
17782 template < template-parameter-list >
17784 Concept Extensions:
17786 template-parameter-list-seq:
17787 template < template-parameter-list > requires-clause [opt]
17789 requires-clause:
17790 requires logical-or-expression */
17792 static void
17794 {
17795 /* Check for `export'. */
17797 {
17798 /* Consume the `export' token. */
17800 /* Warn that this use of export is deprecated. */
17805 else
17807 }
17810 }
17812 /* Parse a template-parameter-list.
17814 template-parameter-list:
17815 template-parameter
17816 template-parameter-list , template-parameter
17818 Returns a TREE_LIST. Each node represents a template parameter.
17819 The nodes are connected via their TREE_CHAINs. */
17821 static tree
17823 {
17826 /* Don't create wrapper nodes within a template-parameter-list,
17827 since we don't want to have different types based on the
17828 spelling location of constants and decls within them. */
17829 auto_suppress_location_wrappers sentinel;
17833 /* The loop below parses the template parms. We first need to know
17834 the total number of template parms to be able to compute proper
17835 canonical types of each dependent type. So after the loop, when
17836 we know the total number of template parms,
17837 end_template_parm_list computes the proper canonical types and
17838 fixes up the dependent types accordingly. */
17840 {
17841 tree parameter;
17844 location_t parm_loc;
17846 /* Parse the template-parameter. */
17851 /* Add it to the list. */
17854 parm_loc,
17855 parameter,
17856 is_non_type,
17857 is_parameter_pack);
17858 else
17859 {
17862 }
17864 /* If the next token is not a `,', we're done. */
17867 /* Otherwise, consume the `,' token. */
17869 }
17872 }
17874 /* Parse a introduction-list.
17876 introduction-list:
17877 introduced-parameter
17878 introduction-list , introduced-parameter
17880 introduced-parameter:
17881 ...[opt] identifier
17883 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
17884 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
17885 WILDCARD_DECL will also have DECL_NAME set and token location in
17886 DECL_SOURCE_LOCATION. */
17888 static tree
17890 {
17894 {
17903 /* Build placeholder. */
17911 /* If the next token is not a `,', we're done. */
17914 /* Otherwise, consume the `,' token. */
17916 }
17918 /* Convert the vec into a TREE_VEC. */
17921 tree parm;
17927 }
17929 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
17930 is an abstract declarator. */
17934 {
17939 }
17941 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
17942 is an abstract declarator. */
17946 {
17950 else
17952 }
17954 /* Returns true if TYPE would declare a constrained constrained-parameter. */
17958 {
17963 }
17965 /* Returns true if PARM declares a constrained-parameter. */
17969 {
17971 }
17973 /* Check that the type parameter is only a declarator-id, and that its
17974 type is not cv-qualified. */
17976 bool
17979 {
17984 {
17987 }
17989 /* Don't allow cv-qualified type parameters. */
17992 {
17995 }
17998 }
18000 /* Finish parsing/processing a template type parameter and checking
18001 various restrictions. */
18005 tree id,
18007 {
18010 else
18012 }
18014 static tree
18016 {
18017 /* FIXME: This should probably be copied, and we may need to adjust
18018 the template parameter depths. */
18028 }
18030 /* Finish parsing/processing a template template parameter by borrowing
18031 the template parameter list from the prototype parameter. */
18033 static tree
18035 tree proto,
18036 tree id,
18038 {
18042 }
18044 /* Create a new non-type template parameter from the given PARM
18045 declarator. */
18047 static tree
18050 {
18056 }
18058 /* Build a constrained template parameter based on the PARMDECL
18059 declarator. The type of PARMDECL is the constrained type, which
18060 refers to the prototype template parameter that ultimately
18061 specifies the type of the declared parameter. */
18063 static tree
18067 {
18073 /* Build the parameter. Return an error if the declarator was invalid. */
18074 tree parm;
18079 parmdecl);
18080 else
18085 /* Finish the parameter decl and create a node attaching the
18086 default argument and constraint. */
18091 }
18093 /* Returns true if the parsed type actually represents the declaration
18094 of a type template-parameter. */
18096 static bool
18098 {
18101 }
18103 /* Returns true if the parsed type actually represents the declaration of
18104 a template template-parameter. */
18106 static bool
18108 {
18111 }
18113 /* Parse a default argument for a type template-parameter.
18114 Note that diagnostics are handled in cp_parser_template_parameter. */
18116 static tree
18118 {
18121 /* Consume the `=' token. */
18126 /* Tell cp_parser_lambda_expression this is a default argument. */
18130 /* Parse the default-argument. */
18133 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18134 NULL);
18138 {
18142 }
18145 }
18147 /* Parse a default argument for a template template-parameter. */
18149 static tree
18151 {
18156 /* Consume the `='. */
18158 /* Parse the id-expression. */
18160 /* save token before parsing the id-expression, for error
18161 reporting */
18163 tree default_argument
18171 /* If the id-expression was a template-id that refers to
18172 a template-class, we already have the declaration here,
18173 so no further lookup is needed. */
18174 ;
18175 else
18176 /* Look up the name. */
18177 default_argument
18179 none_type,
18185 /* See if the default argument is valid. */
18189 }
18191 /* Parse a template-parameter.
18193 template-parameter:
18194 type-parameter
18195 parameter-declaration
18197 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
18198 the parameter. The TREE_PURPOSE is the default value, if any.
18199 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
18200 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
18201 set to true iff this parameter is a parameter pack. */
18203 static tree
18206 {
18209 tree parm;
18211 /* Assume it is a type parameter or a template parameter. */
18213 /* Assume it not a parameter pack. */
18215 /* Peek at the next token. */
18217 /* If it is `template', we have a type-parameter. */
18220 /* If it is `class' or `typename' we do not know yet whether it is a
18221 type parameter or a non-type parameter. Consider:
18223 template <typename T, typename T::X X> ...
18225 or:
18227 template <class C, class D*> ...
18229 Here, the first parameter is a type parameter, and the second is
18230 a non-type parameter. We can tell by looking at the token after
18231 the identifier -- if it is a `,', `=', or `>' then we have a type
18232 parameter. */
18234 {
18235 /* Peek at the token after `class' or `typename'. */
18237 /* If it's an ellipsis, we have a template type parameter
18238 pack. */
18241 /* If it's an identifier, skip it. */
18244 /* Now, see if the token looks like the end of a template
18245 parameter. */
18250 }
18252 /* Otherwise, it is a non-type parameter or a constrained parameter.
18254 [temp.param]
18256 When parsing a default template-argument for a non-type
18257 template-parameter, the first non-nested `>' is taken as the end
18258 of the template parameter-list rather than a greater-than
18259 operator. */
18260 parameter_declarator
18262 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18269 /* If the parameter declaration is marked as a parameter pack, set
18270 *IS_PARAMETER_PACK to notify the caller. */
18275 {
18276 /* Can happen in some cases of erroneous input (c++/34892). */
18278 /* Consume the `...' for better error recovery. */
18280 }
18282 /* The parameter may have been constrained type parameter. */
18285 parameter_declarator,
18286 is_non_type);
18288 // Now we're sure that the parameter is a non-type parameter.
18299 }
18301 /* Parse a type-parameter.
18303 type-parameter:
18304 class identifier [opt]
18305 class identifier [opt] = type-id
18306 typename identifier [opt]
18307 typename identifier [opt] = type-id
18308 template < template-parameter-list > class identifier [opt]
18309 template < template-parameter-list > class identifier [opt]
18310 = id-expression
18312 GNU Extension (variadic templates):
18314 type-parameter:
18315 class ... identifier [opt]
18316 typename ... identifier [opt]
18318 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
18319 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
18320 the declaration of the parameter.
18322 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
18324 static tree
18326 {
18328 tree parameter;
18330 /* Look for a keyword to tell us what kind of parameter this is. */
18336 {
18339 {
18340 tree identifier;
18341 tree default_argument;
18343 /* If the next token is an ellipsis, we have a template
18344 argument pack. */
18346 {
18347 /* Consume the `...' token. */
18352 }
18354 /* If the next token is an identifier, then it names the
18355 parameter. */
18358 else
18361 /* Create the parameter. */
18364 /* If the next token is an `=', we have a default argument. */
18366 {
18367 default_argument
18370 /* Template parameter packs cannot have default
18371 arguments. */
18373 {
18376 "template parameter pack %qD cannot have a "
18378 else
18380 "template parameter packs cannot have "
18383 }
18386 }
18387 else
18390 /* Create the combined representation of the parameter and the
18391 default argument. */
18393 }
18397 {
18398 tree identifier;
18399 tree default_argument;
18401 /* Look for the `<'. */
18403 /* Parse the template-parameter-list. */
18405 /* Look for the `>'. */
18408 /* If template requirements are present, parse them. */
18410 {
18415 }
18417 /* Look for the `class' or 'typename' keywords. */
18419 /* If the next token is an ellipsis, we have a template
18420 argument pack. */
18422 {
18423 /* Consume the `...' token. */
18428 }
18429 /* If the next token is an `=', then there is a
18430 default-argument. If the next token is a `>', we are at
18431 the end of the parameter-list. If the next token is a `,',
18432 then we are at the end of this parameter. */
18436 {
18438 /* Treat invalid names as if the parameter were nameless. */
18441 }
18442 else
18445 /* Create the template parameter. */
18447 identifier);
18449 /* If the next token is an `=', then there is a
18450 default-argument. */
18452 {
18453 default_argument
18456 /* Template parameter packs cannot have default
18457 arguments. */
18459 {
18462 "template parameter pack %qD cannot "
18464 identifier);
18465 else
18469 }
18470 }
18471 else
18474 /* Create the combined representation of the parameter and the
18475 default argument. */
18477 }
18483 }
18486 }
18488 /* Parse a template-id.
18490 template-id:
18491 template-name < template-argument-list [opt] >
18493 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
18494 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
18495 returned. Otherwise, if the template-name names a function, or set
18496 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
18497 names a class, returns a TYPE_DECL for the specialization.
18499 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
18500 uninstantiated templates. */
18502 static tree
18508 {
18509 tree templ;
18510 tree arguments;
18511 tree template_id;
18516 /* If the next token corresponds to a template-id, there is no need
18517 to reparse it. */
18521 {
18524 }
18526 /* Avoid performing name lookup if there is no possibility of
18527 finding a template-id. */
18530 && !cp_parser_nth_token_starts_template_argument_list_p
18532 {
18535 }
18537 /* Remember where the template-id starts. */
18543 /* Parse the template-name. */
18546 check_dependency_p,
18547 is_declaration,
18548 tag_type,
18551 /* Push any access checks inside the firewall we're about to create. */
18557 /* Since we're going to preserve any side-effects from this parse, set up a
18558 firewall to protect our callers from cp_parser_commit_to_tentative_parse
18559 in the template arguments. */
18563 /* If we find the sequence `[:' after a template-name, it's probably
18564 a digraph-typo for `< ::'. Substitute the tokens and check if we can
18565 parse correctly the argument list. */
18572 {
18574 /* Change `:' into `::'. */
18576 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
18577 CPP_LESS. */
18580 /* Parse the arguments. */
18583 {
18584 /* If we couldn't parse an argument list, then we revert our changes
18585 and return simply an error. Maybe this is not a template-id
18586 after all. */
18591 }
18592 /* Otherwise, emit an error about the invalid digraph, but continue
18593 parsing because we got our argument list. */
18596 {
18599 "%<<:%> is an alternate spelling for %<[%>."
18602 {
18604 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
18607 }
18608 }
18609 }
18610 else
18611 {
18612 /* Look for the `<' that starts the template-argument-list. */
18614 {
18617 }
18618 /* Parse the arguments. */
18623 && !template_keyword_p
18626 {
18627 /* This didn't go well. */
18629 {
18630 /* C++20 says that "function-name < a;" is now ill-formed. */
18632 {
18635 "operand of %<<%> is ill-formed in C++20; wrap the "
18637 }
18638 else
18639 /* We expect "f<targs>" to be followed by "(args)". */
18643 /* Purge all subsequent tokens. */
18645 }
18646 else
18650 }
18651 }
18653 /* Set the location to be of the form:
18654 template-name < template-argument-list [opt] >
18655 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
18656 with caret == start at the start of the template-name,
18657 ranging until the closing '>'. */
18658 location_t combined_loc
18661 /* Check for concepts autos where they don't belong. We could
18662 identify types in some cases of identifier TEMPL, looking ahead
18663 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
18664 types. We reject them in functions, but if what we have is an
18665 identifier, even with none_type we can't conclude it's NOT a
18666 type, we have to wait for template substitution. */
18669 /* Build a representation of the specialization. */
18672 TEMPLATE_ID_EXPR,
18676 {
18677 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
18678 template (rather than some instantiation thereof) only if
18679 is not nested within some other construct. For example, in
18680 "template <typename T> void f(T) { A<T>::", A<T> is just an
18681 instantiation of A. */
18682 bool entering_scope
18685 template_id
18687 }
18689 {
18690 /* The caller will decide whether this is a concept check or type
18691 constraint. */
18694 }
18696 {
18700 }
18703 {
18704 /* Some type template in dependent scope. */
18707 TEMPLATE_ID_EXPR,
18710 }
18711 else
18712 {
18713 /* If it's not a class-template or a template-template, it should be
18714 a function-template. */
18720 }
18722 /* If parsing tentatively, replace the sequence of tokens that makes
18723 up the template-id with a CPP_TEMPLATE_ID token. That way,
18724 should we re-parse the token stream, we will not have to repeat
18725 the effort required to do the parse, nor will we issue duplicate
18726 error messages about problems during instantiation of the
18727 template. */
18729 /* Don't do this if we had a parse error in a declarator; re-parsing
18730 might succeed if a name changes meaning (60361). */
18734 {
18735 /* Reset the contents of the START_OF_ID token. */
18739 /* Retrieve any deferred checks. Do not pop this access checks yet
18740 so the memory will not be reclaimed during token replacing below. */
18747 /* Purge all subsequent tokens. */
18750 /* ??? Can we actually assume that, if template_id ==
18751 error_mark_node, we will have issued a diagnostic to the
18752 user, as opposed to simply marking the tentative parse as
18753 failed? */
18756 }
18760 }
18762 /* Like cp_parser_template_id, called in non-type context. */
18764 static tree
18769 {
18774 /* We didn't check the arguments in cp_parser_template_id; do that now. */
18777 }
18779 /* Parse a template-name.
18781 template-name:
18782 identifier
18784 The standard should actually say:
18786 template-name:
18787 identifier
18788 operator-function-id
18790 A defect report has been filed about this issue.
18792 A conversion-function-id cannot be a template name because they cannot
18793 be part of a template-id. In fact, looking at this code:
18795 a.operator K<int>()
18797 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
18798 It is impossible to call a templated conversion-function-id with an
18799 explicit argument list, since the only allowed template parameter is
18800 the type to which it is converting.
18802 If TEMPLATE_KEYWORD_P is true, then we have just seen the
18803 `template' keyword, in a construction like:
18805 T::template f<3>()
18807 In that case `f' is taken to be a template-name, even though there
18808 is no way of knowing for sure.
18810 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
18811 name refers to a set of overloaded functions, at least one of which
18812 is a template, or an IDENTIFIER_NODE with the name of the template,
18813 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
18814 names are looked up inside uninstantiated templates. */
18816 static tree
18823 {
18824 tree identifier;
18825 tree decl;
18828 /* If the next token is `operator', then we have either an
18829 operator-function-id or a conversion-function-id. */
18831 {
18832 /* We don't know whether we're looking at an
18833 operator-function-id or a conversion-function-id. */
18835 /* Try an operator-function-id. */
18837 /* If that didn't work, try a conversion-function-id. */
18839 {
18842 }
18843 }
18844 /* Look for the identifier. */
18845 else
18848 /* If we didn't find an identifier, we don't have a template-id. */
18852 /* If the name immediately followed the `template' keyword, then it
18853 is a template-name. However, if the next token is not `<', then
18854 we do not treat it as a template-name, since it is not being used
18855 as part of a template-id. This enables us to handle constructs
18856 like:
18858 template <typename T> struct S { S(); };
18859 template <typename T> S<T>::S();
18861 correctly. We would treat `S' as a template -- if it were `S<T>'
18862 -- but we do not if there is no `<'. */
18866 {
18867 /* In a declaration, in a dependent context, we pretend that the
18868 "template" keyword was present in order to improve error
18869 recovery. For example, given:
18871 template <typename T> void f(T::X<int>);
18873 we want to treat "X<int>" as a template-id. */
18875 && !template_keyword_p
18877 && check_dependency_p
18879 /* Do not do this for dtors (or ctors), since they never
18880 need the template keyword before their name. */
18882 {
18885 /* Explain what went wrong. */
18887 identifier);
18890 /* If parsing tentatively, find the location of the "<" token. */
18893 /* Parse the template arguments so that we can issue error
18894 messages about them. */
18897 /* Skip tokens until we find a good place from which to
18898 continue parsing. */
18903 /* If parsing tentatively, permanently remove the
18904 template argument list. That will prevent duplicate
18905 error messages from being issued about the missing
18906 "template" keyword. */
18913 }
18915 /* If the "template" keyword is present, then there is generally
18916 no point in doing name-lookup, so we just return IDENTIFIER.
18917 But, if the qualifying scope is non-dependent then we can
18918 (and must) do name-lookup normally. */
18920 {
18926 {
18927 /* We're optimizing away the call to cp_parser_lookup_name, but
18928 we still need to do this. */
18932 }
18933 }
18934 }
18936 /* cp_parser_lookup_name clears OBJECT_TYPE. */
18940 /* Look up the name. */
18942 tag_type,
18945 check_dependency_p,
18951 /* 13.3 [temp.names] A < is interpreted as the delimiter of a
18952 template-argument-list if it follows a name that is not a
18953 conversion-function-id and
18954 - that follows the keyword template or a ~ after a nested-name-specifier or
18955 in a class member access expression, or
18956 - for which name lookup finds the injected-class-name of a class template
18957 or finds any declaration of a template, or
18958 - that is an unqualified name for which name lookup either finds one or
18959 more functions or finds nothing, or
18960 - that is a terminal name in a using-declarator (9.9), in a declarator-id
18961 (9.3.4), or in a type-only context other than a nested-name-specifier
18962 (13.8). */
18964 /* Handle injected-class-name. */
18967 /* If DECL is a template, then the name was a template-name. */
18969 {
18972 {
18974 tree attr;
18977 else
18980 {
18983 }
18986 {
18989 }
18990 }
18991 }
18992 else
18993 {
18994 /* Look through an overload set for any templates. */
19002 /* "an unqualified name for which name lookup either finds one or more
19003 functions or finds nothing". */
19006 && !scope
19009 {
19010 /* The "more functions" case. Just use the OVERLOAD as normally.
19011 We don't use is_overloaded_fn here to avoid considering
19012 BASELINKs. */
19014 /* Name lookup found one function. */
19016 /* Name lookup found nothing. */
19019 }
19021 /* "that follows the keyword template"..."in a type-only context" */
19029 {
19030 /* The name does not name a template. */
19033 }
19036 /* cp_parser_template_id can only handle some TYPE_DECLs. */
19039 /* Repeat the lookup at instantiation time. */
19041 }
19044 }
19046 /* Parse a template-argument-list.
19048 template-argument-list:
19049 template-argument ... [opt]
19050 template-argument-list , template-argument ... [opt]
19052 Returns a TREE_VEC containing the arguments. */
19054 static tree
19056 {
19061 /* Don't create location wrapper nodes within a template-argument-list. */
19062 auto_suppress_location_wrappers sentinel;
19066 /* Even if the template-id appears in an integral
19067 constant-expression, the contents of the argument list do
19068 not. */
19074 /* Parse the arguments. */
19076 do
19077 {
19079 /* Consume the comma. */
19082 /* Parse the template-argument. */
19085 /* If the next token is an ellipsis, we're expanding a template
19086 argument pack. */
19088 {
19090 {
19094 }
19095 /* Consume the `...' token. */
19098 /* Make the argument into a TYPE_PACK_EXPANSION or
19099 EXPR_PACK_EXPANSION. */
19101 }
19104 }
19119 }
19121 /* Parse a template-argument.
19123 template-argument:
19124 assignment-expression
19125 type-id
19126 id-expression
19128 The representation is that of an assignment-expression, type-id, or
19129 id-expression -- except that the qualified id-expression is
19130 evaluated, so that the value returned is either a DECL or an
19131 OVERLOAD.
19133 Although the standard says "assignment-expression", it forbids
19134 throw-expressions or assignments in the template argument.
19135 Therefore, we use "conditional-expression" instead. */
19137 static tree
19139 {
19140 tree argument;
19146 cp_id_kind idk;
19148 /* There's really no way to know what we're looking at, so we just
19149 try each alternative in order.
19151 [temp.arg]
19153 In a template-argument, an ambiguity between a type-id and an
19154 expression is resolved to a type-id, regardless of the form of
19155 the corresponding template-parameter.
19157 Therefore, we try a type-id first. */
19160 /* If there was no error parsing the type-id but the next token is a
19161 '>>', our behavior depends on which dialect of C++ we're
19162 parsing. In C++98, we probably found a typo for '> >'. But there
19163 are type-id which are also valid expressions. For instance:
19165 struct X { int operator >> (int); };
19166 template <int V> struct Foo {};
19167 Foo<X () >> 5> r;
19169 Here 'X()' is a valid type-id of a function type, but the user just
19170 wanted to write the expression "X() >> 5". Thus, we remember that we
19171 found a valid type-id, but we still try to parse the argument as an
19172 expression to see what happens.
19174 In C++0x, the '>>' will be considered two separate '>'
19175 tokens. */
19179 /* Similarly for >= which
19180 cp_parser_next_token_ends_template_argument_p treats for
19181 diagnostics purposes as mistyped > =, but can be valid
19182 after a type-id. */
19184 {
19187 }
19188 else
19189 {
19190 /* If the next token isn't a `,' or a `>', then this argument wasn't
19191 really finished. This means that the argument is not a valid
19192 type-id. */
19195 /* If that worked, we're done. */
19198 }
19199 /* We're still not sure what the argument will be. */
19201 /* Try a template. */
19209 /* If the next token isn't a `,' or a `>', then this argument wasn't
19210 really finished. */
19214 {
19215 /* Figure out what is being referred to. If the id-expression
19216 was for a class template specialization, then we will have a
19217 TYPE_DECL at this point. There is no need to do name lookup
19218 at this point in that case. */
19221 none_type,
19230 }
19232 {
19238 }
19239 /* It must be a non-type argument. In C++17 any constant-expression is
19240 allowed. */
19244 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
19246 -- an integral constant-expression of integral or enumeration
19247 type; or
19249 -- the name of a non-type template-parameter; or
19251 -- the name of an object or function with external linkage...
19253 -- the address of an object or function with external linkage...
19255 -- a pointer to member... */
19256 /* Look for a non-type template parameter. */
19258 {
19270 }
19272 /* If the next token is "&", the argument must be the address of an
19273 object or function with external linkage. */
19276 {
19279 }
19280 /* See if we might have an id-expression. */
19287 {
19290 address_p,
19297 else
19298 {
19299 tree probe;
19302 {
19303 /* Strip the dereference temporarily. */
19306 }
19308 /* If we're in a template, we represent a qualified-id referring
19309 to a static data member as a SCOPE_REF even if the scope isn't
19310 dependent so that we can check access control later. */
19315 {
19316 /* A variable without external linkage might still be a
19317 valid constant-expression, so no error is issued here
19318 if the external-linkage check fails. */
19321 }
19323 /* All overloaded functions are allowed; if the external
19324 linkage test does not pass, an error will be issued
19325 later. */
19326 ;
19330 /* A pointer-to-member. */
19331 ;
19333 ;
19334 else
19338 {
19342 else
19345 }
19346 }
19347 }
19348 /* If the argument started with "&", there are no other valid
19349 alternatives at this point. */
19351 {
19354 }
19356 general_expr:
19357 /* If the argument wasn't successfully parsed as a type-id followed
19358 by '>>', the argument can only be a constant expression now.
19359 Otherwise, we try parsing the constant-expression tentatively,
19360 because the argument could really be a type-id. */
19366 else
19367 {
19368 /* In C++20, we can encounter a braced-init-list. */
19373 /* With C++17 generalized non-type template arguments we need to handle
19374 lvalue constant expressions, too. */
19377 }
19385 /* We did our best to parse the argument as a non type-id, but that
19386 was the only alternative that matched (albeit with a '>' after
19387 it). We can assume it's just a typo from the user, and a
19388 diagnostic will then be issued. */
19390 }
19392 /* Parse an explicit-instantiation.
19394 explicit-instantiation:
19395 template declaration
19397 Although the standard says `declaration', what it really means is:
19399 explicit-instantiation:
19400 template decl-specifier-seq [opt] declarator [opt] ;
19402 Things like `template int S<int>::i = 5, int S<double>::j;' are not
19403 supposed to be allowed. A defect report has been filed about this
19404 issue.
19406 GNU Extension:
19408 explicit-instantiation:
19409 storage-class-specifier template
19410 decl-specifier-seq [opt] declarator [opt] ;
19411 function-specifier template
19412 decl-specifier-seq [opt] declarator [opt] ; */
19414 static void
19416 {
19418 cp_decl_specifier_seq decl_specifiers;
19423 /* Look for an (optional) storage-class-specifier or
19424 function-specifier. */
19426 {
19427 extension_specifier
19430 extension_specifier
19433 }
19435 /* Look for the `template' keyword. */
19437 /* Let the front end know that we are processing an explicit
19438 instantiation. */
19440 /* [temp.explicit] says that we are supposed to ignore access
19441 control while processing explicit instantiation directives. */
19443 /* Parse a decl-specifier-seq. */
19445 CP_PARSER_FLAGS_OPTIONAL,
19449 cp_omp_declare_simd_data odsd;
19455 /* If there was exactly one decl-specifier, and it declared a class,
19456 and there's no declarator, then we have an explicit type
19457 instantiation. */
19459 {
19462 /* Turn access control back on for names used during
19463 template instantiation. */
19468 }
19469 else
19470 {
19472 tree decl;
19474 /* Parse the declarator. */
19475 declarator
19477 CP_PARSER_FLAGS_NONE,
19488 {
19491 "explicit instantiation shall not use"
19495 "explicit instantiation shall not use"
19499 "explicit instantiation shall not use"
19504 /* Turn access control back on for names used during
19505 template instantiation. */
19507 /* Do the explicit instantiation. */
19509 }
19510 else
19511 {
19513 /* Skip the body of the explicit instantiation. */
19515 }
19516 }
19517 /* We're done with the instantiation. */
19523 }
19525 /* Parse an explicit-specialization.
19527 explicit-specialization:
19528 template < > declaration
19530 Although the standard says `declaration', what it really means is:
19532 explicit-specialization:
19533 template <> decl-specifier [opt] init-declarator [opt] ;
19534 template <> function-definition
19535 template <> explicit-specialization
19536 template <> template-declaration */
19538 static void
19540 {
19543 /* Look for the `template' keyword. */
19545 /* Look for the `<'. */
19547 /* Look for the `>'. */
19549 /* We have processed another parameter list. */
19552 /* [temp]
19554 A template ... explicit specialization ... shall not have C
19555 linkage. */
19558 {
19562 /* Give it C++ linkage to avoid confusing other parts of the
19563 front end. */
19565 }
19567 /* Let the front end know that we are beginning a specialization. */
19569 {
19570 /* If the next keyword is `template', we need to figure out
19571 whether or not we're looking a template-declaration. */
19573 {
19578 else
19580 }
19581 else
19582 /* Parse the dependent declaration. */
19588 }
19590 /* We're done with the specialization. */
19593 /* For the erroneous case of a template with C linkage, we pushed an
19594 implicit C++ linkage scope; exit that scope now. */
19598 /* We're done with this parameter list. */
19600 }
19602 /* Preserve the attributes across a garbage collect (by making it a GC
19603 root), which can occur when parsing a member function. */
19607 /* Parse a type-specifier.
19609 type-specifier:
19610 simple-type-specifier
19611 class-specifier
19612 enum-specifier
19613 elaborated-type-specifier
19614 cv-qualifier
19616 GNU Extension:
19618 type-specifier:
19619 __complex__
19621 Returns a representation of the type-specifier. For a
19622 class-specifier, enum-specifier, or elaborated-type-specifier, a
19623 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
19625 The parser flags FLAGS is used to control type-specifier parsing.
19627 If IS_DECLARATION is TRUE, then this type-specifier is appearing
19628 in a decl-specifier-seq.
19630 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
19631 class-specifier, enum-specifier, or elaborated-type-specifier, then
19632 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
19633 if a type is declared; 2 if it is defined. Otherwise, it is set to
19634 zero.
19636 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
19637 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
19638 is set to FALSE. */
19640 static tree
19642 cp_parser_flags flags,
19647 {
19653 /* Assume this type-specifier does not declare a new type. */
19656 /* And that it does not specify a cv-qualifier. */
19659 /* Peek at the next token. */
19662 /* If we're looking at a keyword, we can use that to guide the
19663 production we choose. */
19666 {
19671 /* Look for the enum-specifier. */
19673 /* If that worked, we're done. */
19675 {
19680 type_spec,
19681 token,
19684 }
19685 else
19688 /* Any of these indicate either a class-specifier, or an
19689 elaborated-type-specifier. */
19696 /* Parse tentatively so that we can back up if we don't find a
19697 class-specifier. */
19701 /* Look for the class-specifier. */
19706 /* If that worked, we're done. */
19708 {
19713 type_spec,
19714 token,
19717 }
19719 /* Fall through. */
19720 elaborated_type_specifier:
19721 /* We're declaring (not defining) a class or enum. */
19725 /* Fall through. */
19727 /* Look for an elaborated-type-specifier. */
19728 type_spec
19729 = (cp_parser_elaborated_type_specifier
19732 is_declaration));
19735 type_spec,
19736 token,
19759 /* The `__complex__' keyword is a GNU extension. */
19765 }
19767 /* Handle simple keywords. */
19769 {
19771 {
19774 }
19776 }
19778 /* If we do not already have a type-specifier, assume we are looking
19779 at a simple-type-specifier. */
19781 decl_specs,
19782 flags);
19784 /* If we didn't find a type-specifier, and a type-specifier was not
19785 optional in this context, issue an error message. */
19787 {
19790 }
19793 }
19795 /* Parse a simple-type-specifier.
19797 simple-type-specifier:
19798 :: [opt] nested-name-specifier [opt] type-name
19799 :: [opt] nested-name-specifier template template-id
19800 char
19801 wchar_t
19802 bool
19803 short
19804 int
19805 long
19806 signed
19807 unsigned
19808 float
19809 double
19810 void
19812 C++11 Extension:
19814 simple-type-specifier:
19815 auto
19816 decltype ( expression )
19817 char16_t
19818 char32_t
19819 __underlying_type ( type-id )
19821 C++17 extension:
19823 nested-name-specifier(opt) template-name
19825 GNU Extension:
19827 simple-type-specifier:
19828 __int128
19829 __typeof__ unary-expression
19830 __typeof__ ( type-id )
19831 __typeof__ ( type-id ) { initializer-list , [opt] }
19833 Concepts Extension:
19835 simple-type-specifier:
19836 constrained-type-specifier
19838 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
19839 appropriately updated. */
19841 static tree
19844 cp_parser_flags flags)
19845 {
19850 /* Peek at the next token. */
19853 /* If we're looking at a keyword, things are easy. */
19855 {
19893 {
19896 /* Check if the alternate "__intN__" form has been used instead of
19897 "__intN". */
19901 }
19923 CASE_RID_FLOATN_NX:
19938 {
19939 /* The 'auto' might be the placeholder return type for a function decl
19940 with trailing return type. */
19949 {
19951 {
19958 }
19961 {
19964 }
19967 }
19971 {
19974 }
19977 {
19980 }
19981 else
19985 {
19988 "use of %<auto%> in lambda parameter declaration "
19989 "only available with "
19991 }
19994 "use of %<auto%> in template argument "
19998 "use of %<auto%> in parameter declaration "
20002 "use of %<auto%> in parameter declaration "
20003 "only available with "
20005 }
20006 else
20011 /* Since DR 743, decltype can either be a simple-type-specifier by
20012 itself or begin a nested-name-specifier. Parsing it will replace
20013 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
20014 handling below decide what to do. */
20020 /* Consume the `typeof' token. */
20022 /* Parse the operand to `typeof'. */
20024 /* If it is not already a TYPE, take its type. */
20030 token,
20035 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
20036 case RID_##CODE:
20038 #undef DEFTRAIT_TYPE
20042 token,
20049 }
20051 /* If token is an already-parsed decltype not followed by ::,
20052 it's a simple-type-specifier. */
20055 {
20058 {
20060 token,
20062 /* Remember that we are handling a decltype in order to
20063 implement the resolution of DR 1510 when the argument
20064 isn't instantiation dependent. */
20066 }
20069 }
20071 /* If the type-specifier was for a built-in type, we're done. */
20073 {
20074 /* Record the type. */
20081 type,
20082 token,
20087 /* Consume the token. */
20093 /* There is no valid C++ program where a non-template type is
20094 followed by a "<". That usually indicates that the user thought
20095 that the type was a template. */
20100 }
20102 /* The type-specifier must be a user-defined type. */
20104 {
20110 /* Don't gobble tokens or issue error messages if this is an
20111 optional type-specifier. */
20115 /* Remember current tentative parsing state -- if we know we need
20116 a type, we can give better diagnostics here. */
20121 /* Look for the optional `::' operator. */
20122 global_p
20126 /* Look for the nested-name specifier. */
20127 qualified_p
20134 /* If we have seen a nested-name-specifier, and the next token
20135 is `template', then we are using the template-id production. */
20138 {
20139 /* Look for the template-id. */
20143 none_type,
20145 /* If the template-id did not name a type, we are out of
20146 luck. */
20148 {
20149 /* ...unless we pretend we have seen 'typename'. */
20153 else
20154 {
20157 }
20158 }
20159 }
20160 /* DR 1812: A < following a qualified-id in a typename-specifier
20161 could safely be assumed to begin a template argument list, so
20162 the template keyword should be optional. */
20164 && qualified_p
20165 && typename_p
20167 {
20173 none_type,
20175 /* This is handled below, so back off. */
20186 }
20188 /* Otherwise, look for a type-name. */
20190 {
20199 }
20202 {
20203 /* Try for a type-constraint with template arguments. We check
20204 decl_specs here to avoid trying this for a functional cast. */
20211 none_type,
20214 {
20219 /* Perhaps it's a concept-check expression. */
20221 }
20222 else
20227 }
20230 {
20231 /* Try class template argument deduction or type-constraint without
20232 template arguments. */
20236 {
20237 location_t loc
20240 none_type,
20252 else
20253 {
20258 }
20259 }
20260 else
20262 }
20264 /* If it didn't work out, we don't have a TYPE. */
20269 /* Keep track of all name-lookups performed in class scopes. */
20271 && !global_p
20272 && !qualified_p
20279 token,
20281 }
20283 /* If we didn't get a type-name, issue an error message. */
20285 {
20288 }
20291 {
20292 /* See if TYPE is an Objective-C type, and if so, parse and
20293 accept any protocol references following it. Do this before
20294 the cp_parser_check_for_invalid_template_id() call, because
20295 Objective-C types can be followed by '<...>' which would
20296 enclose protocol names rather than template arguments, and so
20297 everything is fine. */
20300 {
20304 /* Clobber the "unqualified" type previously entered into
20305 DECL_SPECS with the new, improved protocol-qualified version. */
20310 }
20312 /* There is no valid C++ program where a non-template type is
20313 followed by a "<". That usually indicates that the user
20314 thought that the type was a template. */
20316 none_type,
20318 }
20321 }
20323 /* Parse the remainder of a placholder-type-specifier.
20325 placeholder-type-specifier:
20326 type-constraint_opt auto
20327 type-constraint_opt decltype(auto)
20329 The raw form of the constraint is parsed in cp_parser_simple_type_specifier
20330 and passed as TMPL. This function converts TMPL to an actual type-constraint,
20331 parses the placeholder type, and performs some contextual syntactic analysis.
20333 LOC provides the location of the template name.
20335 TENTATIVE is true if the type-specifier parsing is tentative; in that case,
20336 don't give an error if TMPL isn't a valid type-constraint, as the template-id
20337 might actually be a concept-check,
20339 Note that the Concepts TS allows the auto or decltype(auto) to be
20340 omitted in a constrained-type-specifier. */
20342 static tree
20345 {
20351 /* Get the arguments as written for subsequent analysis. */
20354 {
20357 }
20358 else
20359 /* A concept-name with no arguments can't be an expression. */
20364 /* Get the concept and prototype parameter for the constraint. */
20371 /* As per the standard, require auto or decltype(auto), except in some
20372 cases (template parameter lists, -fconcepts-ts enabled). */
20375 {
20379 {
20381 matching_parens parens;
20385 }
20386 }
20388 /* A type constraint constrains a contextually determined type or type
20389 parameter pack. However, the Concepts TS does allow concepts
20390 to introduce non-type and template template parameters. */
20392 {
20395 {
20397 {
20400 }
20402 }
20403 }
20405 /* In a template parameter list, a type-parameter can be introduced
20406 by type-constraints alone. */
20408 {
20409 /* In a default argument we may not be creating new parameters. */
20411 {
20412 /* If this assert turns out to be false, do error() instead. */
20415 }
20417 }
20419 /* Diagnose issues placeholder issues. */
20423 {
20425 /* Perhaps it's a concept-check expression (c++/91073). */
20432 /* Fall through. This is an error of omission. */
20433 }
20435 {
20436 /* A trailing return type only allows type-constraints. */
20439 }
20441 /* In a parameter-declaration-clause, a placeholder-type-specifier
20442 results in an invented template parameter. */
20444 {
20446 {
20452 }
20455 }
20457 /* Determine if the type should be deduced using template argument
20458 deduction or decltype deduction. Note that the latter is always
20459 used for type-constraints in trailing return types. */
20464 /* Otherwise, this is the type of a variable or return type. */
20467 else
20469 }
20471 /* Parse a type-name.
20473 type-name:
20474 class-name
20475 enum-name
20476 typedef-name
20477 simple-template-id [in c++0x]
20479 enum-name:
20480 identifier
20482 typedef-name:
20483 identifier
20485 Concepts:
20487 type-name:
20488 concept-name
20489 partial-concept-id
20491 concept-name:
20492 identifier
20494 Returns a TYPE_DECL for the type. */
20496 static tree
20498 {
20499 tree type_decl;
20501 /* We can't know yet whether it is a class-name or not. */
20503 /* Try a class-name. */
20505 typename_keyword_p,
20507 none_type,
20511 /* If it's not a class-name, keep looking. */
20513 {
20515 /* It must be a typedef-name or an enum-name. */
20519 /* It is either a simple-template-id representing an
20520 instantiation of an alias template... */
20524 none_type,
20526 /* Note that this must be an instantiation of an alias template
20527 because [temp.names]/6 says:
20529 A template-id that names an alias template specialization
20530 is a type-name.
20532 Whereas [temp.names]/7 says:
20534 A simple-template-id that names a class template
20535 specialization is a class-name.
20537 With concepts, this could also be a partial-concept-id that
20538 declares a non-type template parameter. */
20543 else
20547 /* ... Or a typedef-name or an enum-name. */
20549 }
20552 }
20554 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
20555 or a concept-name.
20557 enum-name:
20558 identifier
20560 typedef-name:
20561 identifier
20563 concept-name:
20564 identifier
20566 Returns a TYPE_DECL for the type. */
20568 static tree
20570 {
20571 tree type_decl;
20572 tree identifier;
20579 /* Look up the type-name. */
20586 {
20587 /* See if this is an Objective-C type. */
20592 }
20594 /* Issue an error if we did not find a type-name. */
20596 /* In Objective-C, we have the complication that class names are
20597 normally type names and start declarations (eg, the
20598 "NSObject" in "NSObject *object;"), but can be used in an
20599 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
20600 is an expression. So, a classname followed by a dot is not a
20601 valid type-name. */
20604 {
20609 }
20610 /* Remember that the name was used in the definition of the
20611 current class so that we can check later to see if the
20612 meaning would have been different after the class was
20613 entirely defined. */
20619 }
20621 /* Parse an elaborated-type-specifier. Note that the grammar given
20622 here incorporates the resolution to DR68.
20624 elaborated-type-specifier:
20625 class-key :: [opt] nested-name-specifier [opt] identifier
20626 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
20627 enum-key :: [opt] nested-name-specifier [opt] identifier
20628 typename :: [opt] nested-name-specifier identifier
20629 typename :: [opt] nested-name-specifier template [opt]
20630 template-id
20632 GNU extension:
20634 elaborated-type-specifier:
20635 class-key attributes :: [opt] nested-name-specifier [opt] identifier
20636 class-key attributes :: [opt] nested-name-specifier [opt]
20637 template [opt] template-id
20638 enum attributes :: [opt] nested-name-specifier [opt] identifier
20640 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
20641 declared `friend'. If IS_DECLARATION is TRUE, then this
20642 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
20643 something is being declared.
20645 Returns the TYPE specified. */
20647 static tree
20651 {
20653 tree identifier;
20656 tree globalscope;
20659 /* For class and enum types the location of the class-key or enum-key. */
20661 /* For a scoped enum, the 'class' or 'struct' keyword id. */
20664 /* See if we're looking at the `enum' keyword. */
20666 {
20667 /* Consume the `enum' token. */
20669 /* Remember that it's an enumeration type. */
20671 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
20672 enums) is used here. */
20676 {
20684 /* Consume the `struct' or `class' and parse it anyway. */
20686 /* Create a combined location for the whole scoped-enum-key. */
20688 }
20689 else
20692 /* Parse the attributes. */
20694 }
20695 /* Or, it might be `typename'. */
20697 RID_TYPENAME))
20698 {
20699 /* Consume the `typename' token. */
20701 /* Remember that it's a `typename' type. */
20703 }
20704 /* Otherwise it must be a class-key. */
20705 else
20706 {
20711 /* Parse the attributes. */
20713 }
20715 /* Look for the `::' operator. */
20718 /* Look for the nested-name-specifier. */
20719 tree nested_name_specifier;
20721 {
20722 nested_name_specifier
20727 is_declaration);
20730 }
20731 else
20732 /* Even though `typename' is not present, the proposed resolution
20733 to Core Issue 180 says that in `class A<T>::B', `B' should be
20734 considered a type-name, even if `A<T>' is dependent. */
20735 nested_name_specifier
20740 is_declaration);
20741 /* For everything but enumeration types, consider a template-id.
20742 For an enumeration type, consider only a plain identifier. */
20744 {
20746 tree decl;
20748 /* Allow the `template' keyword. */
20750 /* If we didn't see `template', we don't know if there's a
20751 template-id or not. */
20754 /* The `template' keyword must follow a nested-name-specifier. */
20756 {
20760 }
20762 /* Parse the template-id. */
20766 tag_type,
20767 is_declaration);
20768 /* If we didn't find a template-id, look for an ordinary
20769 identifier. */
20771 ;
20772 /* We can get here when cp_parser_template_id, called by
20773 cp_parser_class_name with tag_type == none_type, succeeds
20774 and caches a BASELINK. Then, when called again here,
20775 instead of failing and returning an error_mark_node
20776 returns it (see template/typename17.C in C++11).
20777 ??? Could we diagnose this earlier? */
20779 {
20782 }
20783 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
20784 in effect, then we must assume that, upon instantiation, the
20785 template will correspond to a class. */
20789 typename_type,
20791 /* If the `typename' keyword is in effect and DECL is not a type
20792 decl, then type is non existent. */
20794 ;
20796 {
20800 /* If the next token is a semicolon, this must be a specialization,
20801 instantiation, or friend declaration. Check the scope while we
20802 still know whether or not we had a nested-name-specifier. */
20807 }
20810 }
20813 {
20818 {
20821 }
20823 /* For a `typename', we needn't call xref_tag. */
20829 /* Template parameter lists apply only if we are not within a
20830 function parameter list. */
20831 bool template_parm_lists_apply
20840 /* Look up a qualified name in the usual way. */
20842 {
20843 tree decl;
20844 tree ambiguous_decls;
20847 tag_type,
20854 /* If the lookup was ambiguous, an error will already have been
20855 issued. */
20859 /* If we are parsing friend declaration, DECL may be a
20860 TEMPLATE_DECL tree node here. However, we need to check
20861 whether this TEMPLATE_DECL results in valid code. Consider
20862 the following example:
20864 namespace N {
20865 template <class T> class C {};
20866 }
20867 class X {
20868 template <class T> friend class N::C; // #1, valid code
20869 };
20870 template <class T> class Y {
20871 friend class N::C; // #2, invalid code
20872 };
20874 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
20875 name lookup of `N::C'. We see that friend declaration must
20876 be template for the code to be valid. Note that
20877 processing_template_decl does not work here since it is
20878 always 1 for the above two cases. */
20880 decl = (cp_parser_maybe_treat_template_as_class
20885 {
20887 identifier,
20890 }
20893 {
20897 allow_template);
20901 }
20903 /* Forward declarations of nested types, such as
20905 class C1::C2;
20906 class C1::C2::C3;
20908 are invalid unless all components preceding the final '::'
20909 are complete. If all enclosing types are complete, these
20910 declarations become merely pointless.
20912 Invalid forward declarations of nested types are errors
20913 caught elsewhere in parsing. Those that are pointless arrive
20914 here. */
20922 }
20923 else
20924 {
20925 /* An elaborated-type-specifier sometimes introduces a new type and
20926 sometimes names an existing type. Normally, the rule is that it
20927 introduces a new type only if there is not an existing type of
20928 the same name already in scope. For example, given:
20930 struct S {};
20931 void f() { struct S s; }
20933 the `struct S' in the body of `f' is the same `struct S' as in
20934 the global scope; the existing definition is used. However, if
20935 there were no global declaration, this would introduce a new
20936 local class named `S'.
20938 An exception to this rule applies to the following code:
20940 namespace N { struct S; }
20942 Here, the elaborated-type-specifier names a new type
20943 unconditionally; even if there is already an `S' in the
20944 containing scope this declaration names a new type.
20945 This exception only applies if the elaborated-type-specifier
20946 forms the complete declaration:
20948 [class.name]
20950 A declaration consisting solely of `class-key identifier ;' is
20951 either a redeclaration of the name in the current scope or a
20952 forward declaration of the identifier as a class name. It
20953 introduces the name into the current scope.
20955 We are in this situation precisely when the next token is a `;'.
20957 An exception to the exception is that a `friend' declaration does
20958 *not* name a new type; i.e., given:
20960 struct S { friend struct T; };
20962 `T' is not a new type in the scope of `S'.
20964 Also, `new struct S' or `sizeof (struct S)' never results in the
20965 definition of a new type; a new type can only be declared in a
20966 declaration context. */
20968 TAG_how how;
20971 /* Friends have special name lookup rules. */
20975 CPP_SEMICOLON))
20976 /* This is a `class-key identifier ;' */
20978 else
20982 (template_parm_lists_apply
20985 /* An unqualified name was used to reference this type, so
20986 there were no qualifying templates. */
20996 }
20997 }
21002 /* Allow attributes on forward declarations of classes. */
21004 {
21015 {
21019 }
21022 else
21024 "attributes ignored on elaborated-type-specifier that is "
21026 }
21030 else
21031 {
21032 /* Diagnose class/struct/union mismatches. IS_DECLARATION is false
21033 for alias definition. */
21037 decl_class);
21039 /* Indicate whether this class was declared as a `class' or as a
21040 `struct'. */
21043 }
21045 /* A "<" cannot follow an elaborated type specifier. If that
21046 happens, the user was probably trying to form a template-id. */
21051 }
21053 /* Parse an enum-specifier.
21055 enum-specifier:
21056 enum-head { enumerator-list [opt] }
21057 enum-head { enumerator-list , } [C++0x]
21059 enum-head:
21060 enum-key identifier [opt] enum-base [opt]
21061 enum-key nested-name-specifier identifier enum-base [opt]
21063 enum-key:
21064 enum
21065 enum class [C++0x]
21066 enum struct [C++0x]
21068 enum-base: [C++0x]
21069 : type-specifier-seq
21071 opaque-enum-specifier:
21072 enum-key identifier enum-base [opt] ;
21074 GNU Extensions:
21075 enum-key attributes[opt] identifier [opt] enum-base [opt]
21076 { enumerator-list [opt] }attributes[opt]
21077 enum-key attributes[opt] identifier [opt] enum-base [opt]
21078 { enumerator-list, }attributes[opt] [C++0x]
21080 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
21081 if the token stream isn't an enum-specifier after all. */
21083 static tree
21085 {
21086 tree identifier;
21088 tree prev_scope;
21090 tree attributes;
21101 /* Parse tentatively so that we can back up if we don't find a
21102 enum-specifier. */
21105 /* Caller guarantees that the current token is 'enum', an identifier
21106 possibly follows, and the token after that is an opening brace.
21107 If we don't have an identifier, fabricate an anonymous name for
21108 the enumeration being defined. */
21111 /* Parse the "class" or "struct", which indicates a scoped
21112 enumeration type in C++0x. */
21115 {
21119 /* Consume the `struct' or `class' token. */
21123 }
21127 /* Clear the qualification. */
21132 /* Figure out in what scope the declaration is being placed. */
21138 nested_name_specifier
21146 {
21147 tree name;
21151 enum_type,
21156 input_location);
21158 {
21161 {
21162 /* Are template enums allowed in ISO? */
21166 /* ignore a typename reference, for it will be solved by name
21167 in start_enum. */
21169 }
21170 }
21173 else
21174 {
21179 }
21180 }
21181 else
21182 {
21185 else
21186 {
21192 }
21193 }
21196 /* Check for the `:' that denotes a specified underlying type in C++0x.
21197 Note that a ':' could also indicate a bitfield width, however. */
21200 {
21201 cp_decl_specifier_seq type_specifiers;
21203 /* Consume the `:'. */
21207 auto tdf
21211 /* Parse the type-specifier-seq. */
21217 /* At this point this is surely not elaborated type specifier. */
21226 /* If that didn't work, stop. */
21228 {
21234 }
21235 }
21237 /* Look for the `{' but don't consume it yet. */
21239 {
21241 {
21247 }
21248 /* An opaque-enum-specifier must have a ';' here. */
21251 {
21254 OPT_Welaborated_enum_base,
21255 "declaration of enumeration with "
21256 "fixed underlying type and no enumerator list is "
21258 else
21260 }
21261 }
21267 {
21269 {
21273 }
21276 }
21278 /* Issue an error message if type-definitions are forbidden here. */
21281 else
21282 /* Create the new type. We do this before consuming the opening
21283 brace so the enum will be recorded as being on the line of its
21284 tag (or the 'enum' keyword, if there is no tag). */
21288 /* If the next token is not '{' it is an opaque-enum-specifier or an
21289 elaborated-type-specifier. */
21291 {
21296 {
21297 /* The following catches invalid code such as:
21298 enum class S<int>::E { A, B, C }; */
21306 {
21310 nested_name_specifier);
21312 }
21315 {
21317 "%qT for enum declaration does not name a class "
21320 }
21321 /* If that scope does not contain the scope in which the
21322 class was originally declared, the program is invalid. */
21324 nested_name_specifier))
21325 {
21328 "declaration of %qD in namespace %qD which does not "
21331 else
21333 "declaration of %qD in %qD which does not "
21337 }
21338 /* If that scope is the scope where the declaration is being placed
21339 the program is invalid. */
21343 {
21347 }
21348 }
21353 /* Consume the opening brace. */
21354 matching_braces braces;
21361 {
21365 }
21366 else
21367 {
21373 }
21377 /* If the next token is not '}', then there are some enumerators. */
21379 {
21381 /* Don't warn for enum {} a; here. */
21385 }
21386 else
21387 {
21388 /* We've seen a '{' so we know we're in an enum-specifier.
21389 Commit to any tentative parse to get syntax errors. */
21392 }
21394 /* Consume the final '}'. */
21399 }
21400 else
21401 {
21402 /* If a ';' follows, then it is an opaque-enum-specifier
21403 and additional restrictions apply. */
21405 {
21412 }
21413 }
21415 /* Look for trailing attributes to apply to this enumeration, and
21416 apply them if appropriate. */
21418 {
21421 trailing_attr,
21423 }
21425 /* Finish up the enumeration. */
21427 {
21432 }
21435 {
21437 {
21440 }
21443 }
21445 }
21447 /* Parse an enumerator-list. The enumerators all have the indicated
21448 TYPE.
21450 enumerator-list:
21451 enumerator-definition
21452 enumerator-list , enumerator-definition */
21454 static void
21456 {
21458 {
21459 /* Parse an enumerator-definition. */
21462 /* If the next token is not a ',', we've reached the end of
21463 the list. */
21466 /* Otherwise, consume the `,' and keep going. */
21468 /* If the next token is a `}', there is a trailing comma. */
21470 {
21475 }
21476 }
21477 }
21479 /* Parse an enumerator-definition. The enumerator has the indicated
21480 TYPE.
21482 enumerator-definition:
21483 enumerator
21484 enumerator = constant-expression
21486 enumerator:
21487 identifier
21489 GNU Extensions:
21491 enumerator-definition:
21492 enumerator attributes [opt]
21493 enumerator attributes [opt] = constant-expression */
21495 static void
21497 {
21498 tree identifier;
21499 tree value;
21500 location_t loc;
21502 /* Save the input location because we are interested in the location
21503 of the identifier and not the location of the explicit value. */
21506 /* Look for the identifier. */
21511 /* Parse any specified attributes. */
21514 /* If the next token is an '=', then there is an explicit value. */
21516 {
21517 /* Consume the `=' token. */
21519 /* Parse the value. */
21521 }
21522 else
21525 /* If we are processing a template, make sure the initializer of the
21526 enumerator doesn't contain any bare template parameter pack. */
21528 {
21529 /* In a lambda it should work, but doesn't currently. */
21531 {
21534 }
21535 }
21539 /* Create the enumerator. */
21541 }
21543 /* Parse a namespace-name.
21545 namespace-name:
21546 original-namespace-name
21547 namespace-alias
21549 Returns the NAMESPACE_DECL for the namespace. */
21551 static tree
21553 {
21554 tree identifier;
21555 tree namespace_decl;
21559 /* Get the name of the namespace. */
21564 /* Look up the identifier in the currently active scope. Look only
21565 for namespaces, due to:
21567 [basic.lookup.udir]
21569 When looking up a namespace-name in a using-directive or alias
21570 definition, only namespace names are considered.
21572 And:
21574 [basic.lookup.qual]
21576 During the lookup of a name preceding the :: scope resolution
21577 operator, object, function, and enumerator names are ignored.
21579 (Note that cp_parser_qualifying_entity only calls this
21580 function if the token after the name is the scope resolution
21581 operator.) */
21583 none_type,
21589 /* If it's not a namespace, issue an error. */
21592 {
21594 {
21595 auto_diagnostic_group d;
21596 name_hint hint;
21600 identifier,
21603 {
21609 }
21610 else
21612 identifier);
21613 }
21614 else
21617 }
21620 }
21622 /* Parse a namespace-definition.
21624 namespace-definition:
21625 named-namespace-definition
21626 unnamed-namespace-definition
21628 named-namespace-definition:
21629 original-namespace-definition
21630 extension-namespace-definition
21632 original-namespace-definition:
21633 namespace identifier { namespace-body }
21635 extension-namespace-definition:
21636 namespace original-namespace-name { namespace-body }
21638 unnamed-namespace-definition:
21639 namespace { namespace-body } */
21641 static void
21643 {
21644 tree identifier;
21654 {
21657 }
21659 /* Look for the `namespace' keyword. */
21660 cp_token* token
21663 /* Parse any specified attributes before the identifier. */
21667 {
21671 RID_INLINE);
21673 {
21677 "definitions only available with %<-std=c++20%> or "
21680 }
21683 {
21688 "standard attributes on namespaces must precede "
21691 /* Parse any attributes specified after the identifier. */
21693 }
21696 {
21697 /* Don't forget that the innermost namespace might have been
21698 marked as inline. Use |= because we cannot overwrite
21699 IS_INLINE in case the outermost namespace is inline, but
21700 there are no nested inlines. */
21703 }
21707 "nested namespace definitions only available with "
21710 /* Nested namespace names can create new namespaces (unlike
21711 other qualified-ids). */
21716 else
21719 }
21731 /* Start the namespace. */
21738 /* Look for the `{' to validate starting the namespace. */
21739 matching_braces braces;
21741 {
21742 /* Parse the body of the namespace. */
21745 /* Look for the final `}'. */
21747 }
21752 /* Pop the nested namespace definitions. */
21755 }
21757 /* Parse a namespace-body.
21759 namespace-body:
21760 declaration-seq [opt] */
21762 static void
21764 {
21766 }
21768 /* Parse a namespace-alias-definition.
21770 namespace-alias-definition:
21771 namespace identifier = qualified-namespace-specifier ; */
21773 static void
21775 {
21776 tree identifier;
21777 tree namespace_specifier;
21781 /* Look for the `namespace' keyword. */
21783 /* Look for the identifier. */
21787 /* Look for the `=' token. */
21790 {
21792 /* Skip the definition. */
21797 }
21799 /* Look for the qualified-namespace-specifier. */
21800 namespace_specifier
21803 /* Look for the `;' token. */
21806 /* Register the alias in the symbol table. */
21808 }
21810 /* Parse a qualified-namespace-specifier.
21812 qualified-namespace-specifier:
21813 :: [opt] nested-name-specifier [opt] namespace-name
21815 Returns a NAMESPACE_DECL corresponding to the specified
21816 namespace. */
21818 static tree
21820 {
21821 /* Look for the optional `::'. */
21825 /* Look for the optional nested-name-specifier. */
21833 }
21835 /* Subroutine of cp_parser_using_declaration. */
21837 static tree
21839 {
21842 {
21843 /* Create the USING_DECL. */
21852 /* Add it to the list of members in this class. */
21854 }
21855 else
21858 }
21860 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
21861 access declaration.
21863 using-declaration:
21864 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
21865 using :: unqualified-id ;
21867 access-declaration:
21868 qualified-id ;
21870 */
21872 static bool
21875 {
21879 tree identifier;
21880 tree qscope;
21885 {
21888 }
21889 else
21890 {
21891 /* Look for the `using' keyword. */
21894 again:
21895 /* Peek at the next token. */
21897 /* See if it's `typename'. */
21899 {
21900 /* Remember that we've seen it. */
21902 /* Consume the `typename' token. */
21904 }
21905 }
21907 /* Look for the optional global scope qualification. */
21908 global_scope_p
21913 /* If we saw `typename', or didn't see `::', then there must be a
21914 nested-name-specifier present. */
21916 {
21922 {
21925 }
21926 }
21927 /* Otherwise, we could be in either of the two productions. In that
21928 case, treat the nested-name-specifier as optional. */
21929 else
21943 /* If the qualifying scope of an access-declaration isn't a class
21944 or enumeration type then it can't be valid. */
21948 /* Something has already gone wrong; there's no need to parse
21949 further. Since an error has occurred, the return value of
21950 cp_parser_parse_definitely will be false, as required. */
21954 /* Parse the unqualified-id. */
21962 {
21967 }
21969 {
21973 "pack expansion in using-declaration only available "
21976 /* A parameter pack can appear in the qualifying scope, and/or in the
21977 terminal name (if naming a conversion function). Logically they're
21978 part of a single pack expansion of the overall USING_DECL, but we
21979 express them as separate pack expansions within the USING_DECL since
21980 we can't create a pack expansion over a USING_DECL. */
21983 {
21986 }
21990 {
21994 }
21996 {
21997 /* Issue an error in terms using a SCOPE_REF that includes both
21998 components. */
21999 tree name
22004 }
22005 }
22007 /* The function we call to handle a using-declaration is different
22008 depending on what scope we are in. */
22010 ;
22013 /* [namespace.udecl]
22015 A using declaration shall not name a template-id. */
22018 else
22019 {
22023 {
22026 }
22027 }
22031 {
22035 "comma-separated list in using-declaration only available "
22038 }
22040 /* Look for the final `;'. */
22045 "access declarations are deprecated "
22046 "in favour of using-declarations; "
22050 }
22052 /* C++20 using enum declaration.
22054 using-enum-declaration :
22055 using elaborated-enum-specifier ; */
22057 static void
22059 {
22062 /* Using cp_parser_elaborated_type_specifier rejects typedef-names, which
22063 breaks one of the motivating examples in using-enum-5.C.
22064 cp_parser_simple_type_specifier seems to be closer to what we actually
22065 want, though that hasn't been properly specified yet. */
22067 /* Consume 'enum'. */
22073 tree type = (cp_parser_simple_type_specifier
22080 {
22083 }
22087 /* The elaborated-enum-specifier shall not name a dependent type and the type
22088 shall have a reachable enum-specifier. */
22102 {
22104 auto_diagnostic_group g;
22108 ;
22111 else
22113 }
22115 /* A using-enum-declaration introduces the enumerator names of the named
22116 enumeration as if by a using-declaration for each enumerator. */
22120 }
22122 /* Parse an alias-declaration.
22124 alias-declaration:
22125 using identifier attribute-specifier-seq [opt] = type-id */
22127 static tree
22129 {
22133 cp_decl_specifier_seq decl_specs;
22137 /* Look for the `using' keyword. */
22138 cp_token *using_token
22160 /* Now we are going to parse the type-id of the declaration. */
22162 /*
22163 [dcl.type]/3 says:
22165 "A type-specifier-seq shall not define a class or enumeration
22166 unless it appears in the type-id of an alias-declaration (7.1.3) that
22167 is not the declaration of a template-declaration."
22169 In other words, if we currently are in an alias template, the
22170 type-id should not define a type.
22172 So let's set parser->type_definition_forbidden_message in that
22173 case; cp_parser_check_type_definition (called by
22174 cp_parser_class_specifier) will then emit an error if a type is
22175 defined in the type-id. */
22177 {
22181 }
22186 /* Restore the error message if need be. */
22192 {
22195 }
22197 /* A typedef-name can also be introduced by an alias-declaration. The
22198 identifier following the using keyword becomes a typedef-name. It has
22199 the same semantics as if it were introduced by the typedef
22200 specifier. In particular, it does not define a new type and it shall
22201 not appear in the type-id. */
22206 {
22209 ds_attribute,
22210 attrs_token);
22211 }
22213 ds_typedef,
22214 using_token);
22216 ds_alias,
22217 using_token);
22224 id_location,
22234 else
22245 /* If decl is a template, return its TEMPLATE_DECL so that it gets
22246 added into the symbol table; otherwise, return the TYPE_DECL. */
22250 {
22254 }
22257 }
22259 /* Parse a using-directive.
22261 using-directive:
22262 attribute-specifier-seq [opt] using namespace :: [opt]
22263 nested-name-specifier [opt] namespace-name ; */
22265 static void
22267 {
22268 tree namespace_decl;
22271 {
22272 /* Error during attribute parsing that resulted in skipping
22273 to next semicolon. */
22276 }
22278 /* Look for the `using' keyword. */
22280 /* And the `namespace' keyword. */
22282 /* Look for the optional `::' operator. */
22284 /* And the optional nested-name-specifier. */
22290 /* Get the namespace being used. */
22293 /* And any specified GNU attributes. */
22297 /* Update the symbol table. */
22300 /* Look for the final `;'. */
22302 }
22304 /* Parse an asm-definition.
22306 asm-qualifier:
22307 volatile
22308 inline
22309 goto
22311 asm-qualifier-list:
22312 asm-qualifier
22313 asm-qualifier-list asm-qualifier
22315 asm-definition:
22316 asm ( string-literal ) ;
22318 GNU Extension:
22320 asm-definition:
22321 asm asm-qualifier-list [opt] ( string-literal ) ;
22322 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt] ) ;
22323 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22324 : asm-operand-list [opt] ) ;
22325 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22326 : asm-operand-list [opt]
22327 : asm-clobber-list [opt] ) ;
22328 asm asm-qualifier-list [opt] ( string-literal : : asm-operand-list [opt]
22329 : asm-clobber-list [opt]
22330 : asm-goto-list ) ;
22332 The form with asm-goto-list is valid if and only if the asm-qualifier-list
22333 contains goto, and is the only allowed form in that case. No duplicates are
22334 allowed in an asm-qualifier-list. */
22336 static void
22338 {
22343 tree asm_stmt;
22350 /* Look for the `asm' keyword. */
22353 /* In C++20, unevaluated inline assembly is permitted in constexpr
22354 functions. */
22359 "function only available with %<-std=c++20%> or "
22362 /* Handle the asm-qualifier-list. */
22370 {
22374 {
22377 {
22381 }
22382 else
22383 {
22388 }
22394 {
22398 }
22399 else
22408 {
22412 }
22413 else
22428 }
22430 }
22437 {
22440 }
22442 /* Look for the opening `('. */
22445 /* Look for the string. */
22449 {
22453 }
22455 /* If we're allowing GNU extensions, check for the extended assembly
22456 syntax. Unfortunately, the `:' tokens need not be separated by
22457 a space in C, and so, for compatibility, we tolerate that here
22458 too. Doing that means that we have to treat the `::' operator as
22459 two `:' tokens. */
22464 {
22469 /* The extended syntax was used. */
22472 /* Look for outputs. */
22474 {
22475 /* Consume the `:'. */
22477 /* Parse the output-operands. */
22479 CPP_COLON)
22481 CPP_SCOPE)
22483 CPP_CLOSE_PAREN))
22484 {
22488 }
22489 }
22490 /* If the next token is `::', there are no outputs, and the
22491 next token is the beginning of the inputs. */
22493 /* The inputs are coming next. */
22496 /* Look for inputs. */
22499 {
22500 /* Consume the `:' or `::'. */
22502 /* Parse the output-operands. */
22504 CPP_COLON)
22506 CPP_SCOPE)
22508 CPP_CLOSE_PAREN))
22509 {
22513 }
22514 }
22516 /* The clobbers are coming next. */
22519 /* Look for clobbers. */
22522 {
22524 /* Consume the `:' or `::'. */
22526 /* Parse the clobbers. */
22528 CPP_COLON)
22530 CPP_CLOSE_PAREN))
22532 }
22534 /* The labels are coming next. */
22537 /* Look for labels. */
22540 {
22542 /* Consume the `:' or `::'. */
22544 /* Parse the labels. */
22546 }
22550 }
22554 /* Look for the closing `)'. */
22562 {
22563 /* Create the ASM_EXPR. */
22565 {
22568 /* If the extended syntax was not used, mark the ASM_EXPR. */
22570 {
22576 }
22577 }
22578 else
22580 }
22581 }
22583 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
22584 type that comes from the decl-specifier-seq. */
22586 static tree
22588 {
22591 {
22604 }
22607 }
22609 /* Warn about the most vexing parse syntactic ambiguity, i.e., warn when
22610 a construct looks like a variable definition but is actually a function
22611 declaration. DECL_SPECIFIERS is the decl-specifier-seq and DECLARATOR
22612 is the declarator for this function declaration. */
22614 static void
22617 {
22618 /* Only warn if we are declaring a function at block scope. */
22622 /* And only if there is no storage class specified. */
22634 /* Don't warn when the whole declarator (not just the declarator-id!)
22635 was parenthesized. That is, don't warn for int(n()) but do warn
22636 for int(f)(). */
22640 tree type;
22642 {
22647 /* If the return type is void there is no ambiguity. */
22650 }
22652 /* Code like long f(); will have null ->type. If we have any
22653 type-specifiers, pretend we've seen int. */
22655 else
22658 auto_diagnostic_group d;
22663 /* The T t() case. */
22665 {
22667 "empty parentheses were disambiguated as a function "
22669 {
22670 /* () means value-initialization (C++03 and up); {} (C++11 and up)
22671 means value-initialization or aggregate-initialization, nothing
22672 means default-initialization. We can only suggest removing the
22673 parentheses/adding {} if T has a default constructor. */
22675 {
22681 {
22685 else
22688 }
22689 }
22690 }
22692 }
22694 /* If we had (...) or the parameter-list wasn't parenthesized,
22695 we're done. */
22699 /* The T t(X()) case. */
22701 {
22703 "parentheses were disambiguated as a function "
22705 {
22707 /* {}-initialization means that we can use an initializer-list
22708 constructor if no default constructor is available, so don't
22709 suggest using {} for classes that have an initializer_list
22710 constructor. */
22712 {
22717 }
22718 else
22719 {
22723 }
22724 }
22725 }
22726 /* The T t(X(), X()) case. */
22728 "parentheses were disambiguated as a function "
22730 {
22733 {
22738 }
22739 }
22740 }
22742 /* If DECLARATOR with DECL_SPECS is a function declarator that has
22743 the form of a deduction guide, tag it as such. CTOR_DTOR_OR_CONV_P
22744 has the same meaning as in cp_parser_declarator. */
22746 static void
22751 {
22757 {
22765 {
22769 }
22770 }
22771 }
22773 /* Declarators [gram.dcl.decl] */
22775 /* Parse an init-declarator.
22777 init-declarator:
22778 declarator initializer [opt]
22780 GNU Extension:
22782 init-declarator:
22783 declarator asm-specification [opt] attributes [opt] initializer [opt]
22785 function-definition:
22786 decl-specifier-seq [opt] declarator ctor-initializer [opt]
22787 function-body
22788 decl-specifier-seq [opt] declarator function-try-block
22790 GNU Extension:
22792 function-definition:
22793 __extension__ function-definition
22795 TM Extension:
22797 function-definition:
22798 decl-specifier-seq [opt] declarator function-transaction-block
22800 The parser flags FLAGS is used to control type-specifier parsing.
22802 The DECL_SPECIFIERS apply to this declarator. Returns a
22803 representation of the entity declared. If MEMBER_P is TRUE, then
22804 this declarator appears in a class scope. The new DECL created by
22805 this declarator is returned.
22807 The CHECKS are access checks that should be performed once we know
22808 what entity is being declared (and, therefore, what classes have
22809 befriended it).
22811 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
22812 for a function-definition here as well. If the declarator is a
22813 declarator for a function-definition, *FUNCTION_DEFINITION_P will
22814 be TRUE upon return. By that point, the function-definition will
22815 have been completely parsed.
22817 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
22818 is FALSE.
22820 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
22821 parsed declaration if it is an uninitialized single declarator not followed
22822 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
22823 if present, will not be consumed. If returned, this declarator will be
22824 created with SD_INITIALIZED but will not call cp_finish_decl.
22826 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
22827 and there is an initializer, the pointed location_t is set to the
22828 location of the '=' or `(', or '{' in C++11 token introducing the
22829 initializer. */
22831 static tree
22833 cp_parser_flags flags,
22843 {
22847 tree prefix_attributes;
22849 tree asm_specification;
22850 tree initializer;
22852 tree scope;
22854 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
22855 initialized with "= ..", CPP_OPEN_PAREN if initialized with
22856 "(...)". */
22871 /* Assume that this is not the declarator for a function
22872 definition. */
22876 /* Default arguments are only permitted for function parameters. */
22880 /* Defer access checks while parsing the declarator; we cannot know
22881 what names are accessible until we know what is being
22882 declared. */
22887 /* Parse the declarator. */
22888 declarator
22893 /* Gather up the deferred checks. */
22898 /* If the DECLARATOR was erroneous, there's no need to go
22899 further. */
22903 /* Check that the number of template-parameter-lists is OK. */
22913 /* Figure out what scope the entity declared by the DECLARATOR is
22914 located in. `grokdeclarator' sometimes changes the scope, so
22915 we compute it now. */
22918 /* Perform any lookups in the declared type which were thought to be
22919 dependent, but are not in the scope of the declarator. */
22920 decl_specifiers->type
22923 /* If we're allowing GNU extensions, look for an
22924 asm-specification. */
22926 {
22927 /* Look for an asm-specification. */
22930 }
22931 else
22934 /* Gather the attributes that were provided with the
22935 decl-specifiers. */
22938 /* Look for attributes. */
22942 /* Peek at the next token. */
22948 {
22949 /* Handle C++17 deduction guides. Note that class-scope
22950 non-template deduction guides are instead handled in
22951 cp_parser_member_declaration. */
22953 decl_specifiers,
22954 declarator,
22960 /* Check to see if the token indicates the start of a
22961 function-definition. */
22963 {
22965 {
22966 /* If a function-definition should not appear here, issue an
22967 error message. */
22971 }
22973 location_t func_brace_location
22976 /* Neither attributes nor an asm-specification are allowed
22977 on a function-definition. */
22980 "an %<asm%> specification is not allowed "
22984 "attributes are not allowed "
22986 /* This is a function-definition. */
22989 /* Parse the function definition. */
22992 decl_specifiers,
22993 declarator,
22994 prefix_attributes);
22995 else
22996 decl =
22997 (cp_parser_function_definition_from_specifiers_and_declarator
23001 {
23002 /* This is where the prologue starts... */
23005 }
23008 }
23009 }
23011 {
23012 /* A non-template declaration involving a function parameter list
23013 containing an implicit template parameter will be made into a
23014 template. If the resulting declaration is not going to be an
23015 actual function then finish the template scope here to prevent it.
23016 An error message will be issued once we have a decl to talk about.
23018 FIXME probably we should do type deduction rather than create an
23019 implicit template, but the standard currently doesn't allow it. */
23022 }
23024 /* [dcl.dcl]
23026 Only in function declarations for constructors, destructors, type
23027 conversions, and deduction guides can the decl-specifier-seq be omitted.
23029 We explicitly postpone this check past the point where we handle
23030 function-definitions because we tolerate function-definitions
23031 that are missing their return types in some modes. */
23033 {
23037 }
23039 /* An `=' or an '{' in C++11, indicate an initializer. An '(' may indicate
23040 an initializer as well. */
23044 {
23045 /* Don't get fooled into thinking that F(i)(1)(2) is an initializer.
23046 It isn't; it's an expression. (Here '(i)' would have already been
23047 parsed as a declarator.) */
23050 {
23057 /* If this is an initializer, only a ',' or ';' can follow: either
23058 we have another init-declarator, or we're at the end of an
23059 init-declarator-list which can only be followed by a ';'. */
23064 /* Not an init-declarator. */
23066 }
23078 {
23084 }
23085 }
23086 else
23087 {
23088 /* If the init-declarator isn't initialized and isn't followed by a
23089 `,' or `;', it's not a valid init-declarator. */
23092 {
23095 else
23096 {
23100 }
23101 }
23104 }
23106 /* Because start_decl has side-effects, we should only call it if we
23107 know we're going ahead. By this point, we know that we cannot
23108 possibly be looking at any other construct. */
23111 /* Enter the newly declared entry in the symbol table. If we're
23112 processing a declaration in a class-specifier, we wait until
23113 after processing the initializer. */
23115 {
23123 /* Adjust location of decl if declarator->id_loc is more appropriate:
23124 set, and decl wasn't merged with another decl, in which case its
23125 location would be different from input_location, and more accurate. */
23130 }
23132 /* Enter the SCOPE. That way unqualified names appearing in the
23133 initializer will be looked up in SCOPE. */
23136 /* Perform deferred access control checks, now that we know in which
23137 SCOPE the declared entity resides. */
23139 {
23142 /* If the entity being declared is a function, pretend that we
23143 are in its scope. If it is a `friend', it may have access to
23144 things that would not otherwise be accessible. */
23146 {
23149 }
23151 /* Perform access checks for template parameters. */
23154 /* Perform the access control checks for the declarator and the
23155 decl-specifiers. */
23158 /* Restore the saved value. */
23161 }
23163 /* Parse the initializer. */
23168 {
23170 {
23173 else
23174 {
23175 /* If the declaration was erroneous, we don't really
23176 know what the user intended, so just silently
23177 consume the initializer. */
23184 }
23185 }
23186 else
23187 {
23188 /* We want to record the extra mangling scope for in-class
23189 initializers of class members and initializers of static
23190 data member templates and namespace-scope initializers.
23191 The former involves deferring parsing of the initializer
23192 until end of class as with default arguments. So right
23193 here we only handle the latter two. */
23197 && !member_p
23210 }
23211 }
23213 /* The old parser allows attributes to appear after a parenthesized
23214 initializer. Mark Mitchell proposed removing this functionality
23215 on the GCC mailing lists on 2002-08-13. This parser accepts the
23216 attributes -- but ignores them. Made a permerror in GCC 8. */
23222 {
23225 {
23229 }
23230 }
23232 /* And now complain about a non-function implicit template. */
23237 /* For an in-class declaration, use `grokfield' to create the
23238 declaration. */
23240 {
23242 {
23245 }
23254 }
23256 /* Finish processing the declaration. But, skip member
23257 declarations. */
23259 {
23262 asm_specification,
23263 /* If the initializer is in parentheses, then this is
23264 a direct-initialization, which means that an
23265 `explicit' constructor is OK. Otherwise, an
23266 `explicit' constructor cannot be used. */
23269 }
23272 /* Core issue #226 (C++0x only): A default template-argument
23273 shall not be specified in a friend class template
23274 declaration. */
23283 {
23286 else
23288 }
23295 }
23297 /* Parse a declarator.
23299 declarator:
23300 direct-declarator
23301 ptr-operator declarator
23303 abstract-declarator:
23304 ptr-operator abstract-declarator [opt]
23305 direct-abstract-declarator
23307 GNU Extensions:
23309 declarator:
23310 attributes [opt] direct-declarator
23311 attributes [opt] ptr-operator declarator
23313 abstract-declarator:
23314 attributes [opt] ptr-operator abstract-declarator [opt]
23315 attributes [opt] direct-abstract-declarator
23317 The parser flags FLAGS is used to control type-specifier parsing.
23319 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
23320 detect constructors, destructors, deduction guides, or conversion operators.
23321 It is set to -1 if the declarator is a name, and +1 if it is a
23322 function. Otherwise it is set to zero. Usually you just want to
23323 test for >0, but internally the negative value is used.
23325 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
23326 a decl-specifier-seq unless it declares a constructor, destructor,
23327 or conversion. It might seem that we could check this condition in
23328 semantic analysis, rather than parsing, but that makes it difficult
23329 to handle something like `f()'. We want to notice that there are
23330 no decl-specifiers, and therefore realize that this is an
23331 expression, not a declaration.)
23333 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
23334 the declarator is a direct-declarator of the form "(...)".
23336 MEMBER_P is true iff this declarator is a member-declarator.
23338 FRIEND_P is true iff this declarator is a friend.
23340 STATIC_P is true iff the keyword static was seen. */
23344 cp_parser_declarator_kind dcl_kind,
23345 cp_parser_flags flags,
23349 {
23352 cp_cv_quals cv_quals;
23353 tree class_type;
23356 /* Assume this is not a constructor, destructor, or type-conversion
23357 operator. */
23364 /* Check for the ptr-operator production. */
23366 /* Parse the ptr-operator. */
23372 /* If that worked, then we have a ptr-operator. */
23374 {
23375 /* If a ptr-operator was found, then this declarator was not
23376 parenthesized. */
23379 /* The dependent declarator is optional if we are parsing an
23380 abstract-declarator. */
23384 /* Parse the dependent declarator. */
23390 /* If we are parsing an abstract-declarator, we must handle the
23391 case where the dependent declarator is absent. */
23396 declarator = cp_parser_make_indirect_declarator
23398 }
23399 /* Everything else is a direct-declarator. */
23400 else
23401 {
23404 CPP_OPEN_PAREN);
23408 }
23413 }
23415 /* Parse a direct-declarator or direct-abstract-declarator.
23417 direct-declarator:
23418 declarator-id
23419 direct-declarator ( parameter-declaration-clause )
23420 cv-qualifier-seq [opt]
23421 ref-qualifier [opt]
23422 exception-specification [opt]
23423 direct-declarator [ constant-expression [opt] ]
23424 ( declarator )
23426 direct-abstract-declarator:
23427 direct-abstract-declarator [opt]
23428 ( parameter-declaration-clause )
23429 cv-qualifier-seq [opt]
23430 ref-qualifier [opt]
23431 exception-specification [opt]
23432 direct-abstract-declarator [opt] [ constant-expression [opt] ]
23433 ( abstract-declarator )
23435 Returns a representation of the declarator. DCL_KIND is
23436 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
23437 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
23438 we are parsing a direct-declarator. It is
23439 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
23440 of ambiguity we prefer an abstract declarator, as per
23441 [dcl.ambig.res].
23442 The parser flags FLAGS is used to control type-specifier parsing.
23443 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
23444 as for cp_parser_declarator. */
23448 cp_parser_declarator_kind dcl_kind,
23449 cp_parser_flags flags,
23452 {
23463 {
23464 /* Peek at the next token. */
23467 {
23468 /* This is either a parameter-declaration-clause, or a
23469 parenthesized declarator. When we know we are parsing a
23470 named declarator, it must be a parenthesized declarator
23471 if FIRST is true. For instance, `(int)' is a
23472 parameter-declaration-clause, with an omitted
23473 direct-abstract-declarator. But `((*))', is a
23474 parenthesized abstract declarator. Finally, when T is a
23475 template parameter `(T)' is a
23476 parameter-declaration-clause, and not a parenthesized
23477 named declarator.
23479 We first try and parse a parameter-declaration-clause,
23480 and then try a nested declarator (if FIRST is true).
23482 It is not an error for it not to be a
23483 parameter-declaration-clause, even when FIRST is
23484 false. Consider,
23486 int i (int);
23487 int i (3);
23489 The first is the declaration of a function while the
23490 second is the definition of a variable, including its
23491 initializer.
23493 Having seen only the parenthesis, we cannot know which of
23494 these two alternatives should be selected. Even more
23495 complex are examples like:
23497 int i (int (a));
23498 int i (int (3));
23500 The former is a function-declaration; the latter is a
23501 variable initialization.
23503 Thus again, we try a parameter-declaration-clause, and if
23504 that fails, we back out and return. */
23507 {
23508 tree params;
23513 /* In a member-declarator, the only valid interpretation
23514 of a parenthesis is the start of a
23515 parameter-declaration-clause. (It is invalid to
23516 initialize a static data member with a parenthesized
23517 initializer; only the "=" form of initialization is
23518 permitted.) */
23522 /* Consume the `('. */
23524 matching_parens parens;
23527 {
23528 /* If this is going to be an abstract declarator, we're
23529 in a declarator and we can't have default args. */
23532 }
23536 /* Parse the parameter-declaration-clause. */
23537 params
23539 const location_t parens_end
23542 /* Consume the `)'. */
23545 /* If all went well, parse the cv-qualifier-seq,
23546 ref-qualifier and the exception-specification. */
23548 {
23549 cp_cv_quals cv_quals;
23550 cp_virt_specifiers virt_specifiers;
23551 cp_ref_qualifier ref_qual;
23552 tree exception_specification;
23553 tree late_return;
23554 tree attrs;
23557 unsigned char local_variables_forbidden_p
23559 /* 'this' is not allowed in static member functions. */
23569 /* Parse the cv-qualifier-seq. */
23571 /* Parse the ref-qualifier. */
23573 /* Parse the tx-qualifier. */
23579 /* DR 1207: 'this' is in scope after the cv-quals. */
23582 /* If it turned out that this is e.g. a pointer to a
23583 function, we don't want to delay noexcept parsing. */
23587 /* Parse the exception-specification. */
23588 exception_specification
23590 flags);
23594 cp_omp_declare_simd_data odsd;
23596 && declarator
23599 {
23603 }
23605 /* In here, we handle cases where attribute is used after
23606 the function declaration. For example:
23607 void func (int x) __attribute__((vector(..))); */
23610 late_return
23612 requires_clause);
23616 /* Parse the virt-specifier-seq. */
23620 parens_start,
23621 parens_end);
23622 /* Create the function-declarator. */
23624 params,
23625 cv_quals,
23626 virt_specifiers,
23627 ref_qual,
23628 tx_qual,
23629 exception_specification,
23630 late_return,
23631 requires_clause,
23632 attrs,
23633 parens_loc);
23635 /* Any subsequent parameter lists are to do with
23636 return type, so are not those of the declared
23637 function. */
23643 /* Restore the state of local_variables_forbidden_p. */
23644 parser->local_variables_forbidden_p
23646 }
23648 /* Remove the function parms from scope. */
23652 /* Repeat the main loop. */
23654 }
23656 /* If this is the first, we can try a parenthesized
23657 declarator. */
23659 {
23666 /* Consume the `('. */
23667 matching_parens parens;
23669 /* Parse the nested declarator. */
23672 declarator
23674 ctor_dtor_or_conv_p,
23680 /* Expect a `)'. */
23688 }
23689 /* Otherwise, we must be done. */
23690 else
23692 }
23696 {
23697 /* Parse an array-declarator. */
23707 /* Consume the `['. */
23709 /* Peek at the next token. */
23711 /* If the next token is `]', then there is no
23712 constant-expression. */
23714 {
23716 bounds
23728 {
23729 /* Normally, the array bound must be an integral constant
23730 expression. However, as an extension, we allow VLAs
23731 in function scopes as long as they aren't part of a
23732 parameter declaration. */
23736 }
23739 {
23740 /* Remember this wasn't a constant-expression. */
23743 }
23744 }
23745 else
23747 /* Look for the closing `]'. */
23749 {
23752 }
23757 }
23759 {
23760 {
23761 tree qualifying_scope;
23762 tree unqualified_name;
23763 tree attrs;
23764 special_function_kind sfk;
23769 /* Parse a declarator-id */
23772 {
23775 /* If we see an ellipsis, we should be looking at a
23776 parameter pack. */
23778 {
23779 /* Consume the `...' */
23783 }
23784 }
23787 unqualified_name
23791 {
23795 {
23796 /* Check whether an error occurred. */
23799 /* We already consumed the ellipsis to mark a
23800 parameter pack, but we have no way to report it,
23801 so abort the tentative parse. We will be exiting
23802 immediately anyway. */
23804 }
23805 else
23811 && (qualifying_scope
23813 {
23816 }
23817 }
23822 {
23827 }
23833 {
23834 /* In the declaration of a member of a template class
23835 outside of the class itself, the SCOPE will sometimes
23836 be a TYPENAME_TYPE. For example, given:
23838 template <typename T>
23839 int S<T>::R::i = 3;
23841 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
23842 this context, we must resolve S<T>::R to an ordinary
23843 type, rather than a typename type.
23845 The reason we normally avoid resolving TYPENAME_TYPEs
23846 is that a specialization of `S' might render
23847 `S<T>::R' not a type. However, if `S' is
23848 specialized, then this `i' will not be used, so there
23849 is no harm in resolving the types here. */
23850 tree type;
23852 /* Resolve the TYPENAME_TYPE. */
23855 /* If that failed, the declarator is invalid. */
23857 {
23860 "cannot define member of dependent typedef "
23862 else
23867 }
23869 }
23874 {
23875 tree class_type;
23880 else
23884 {
23888 {
23889 /* We do not attempt to print the declarator
23890 here because we do not have enough
23891 information about its original syntactic
23892 form. */
23896 }
23899 {
23903 "use %<%T::%D%> instead of %<%T::%D%> to "
23905 class_type,
23910 }
23912 }
23915 {
23922 for an unnamed type, even if the type
23923 got a name for linkage purposes. */
23925 /* Handle correctly (c++/19200):
23927 struct S {
23928 struct T{};
23929 friend void S(T);
23930 };
23932 and also:
23934 namespace N {
23935 void S();
23936 }
23938 struct S {
23939 friend void N::S();
23940 }; */
23943 class_type))
23952 }
23953 }
23955 unqualified_name,
23963 /* We're looking for this case in [temp.res]:
23964 A qualified-id is assumed to name a type if [...]
23965 - it is a decl-specifier of the decl-specifier-seq of a
23966 parameter-declaration in a declarator of a function or
23967 function template declaration, ... */
23973 {
23974 /* ...whose declarator-id is qualified. If it isn't, never
23975 assume the parameters to refer to types. */
23978 else
23979 {
23980 /* Now we have something like
23981 template <typename T> int C::x(S::p);
23982 which can be a function template declaration or a
23983 variable template definition. If name lookup for
23984 the declarator-id C::x finds one or more function
23985 templates, assume S::p to name a type. Otherwise,
23986 don't. */
23987 tree decl
23989 none_type,
23997 /* Allow
23998 template<typename T>
23999 A<T>::A(T::type) { } */
24002 qualifying_scope)))
24004 }
24005 }
24006 }
24008 handle_declarator:;
24011 {
24012 /* Any names that appear after the declarator-id for a
24013 member are looked up in the containing scope. */
24015 {
24016 /* But declarations with qualified-ids can't appear in a
24017 function. */
24021 }
24023 }
24027 /* Default args are only allowed on function
24028 declarations. */
24030 else
24034 }
24035 /* We're done. */
24036 else
24038 }
24040 /* For an abstract declarator, we might wind up with nothing at this
24041 point. That's an error; the declarator is not optional. */
24045 {
24046 /* Record overly parenthesized declarator so we can give a
24047 diagnostic about confusing decl/expr disambiguation. */
24049 {
24050 /* If the open and close parens are on different lines, this
24051 is probably a formatting thing, so ignore. */
24056 }
24061 }
24063 /* If we entered a scope, we must exit it now. */
24071 }
24073 /* Parse a ptr-operator.
24075 ptr-operator:
24076 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24077 * cv-qualifier-seq [opt]
24078 &
24079 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
24080 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
24082 GNU Extension:
24084 ptr-operator:
24085 & cv-qualifier-seq [opt]
24087 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
24088 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
24089 an rvalue reference. In the case of a pointer-to-member, *TYPE is
24090 filled in with the TYPE containing the member. *CV_QUALS is
24091 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
24092 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
24093 Note that the tree codes returned by this function have nothing
24094 to do with the types of trees that will be eventually be created
24095 to represent the pointer or reference type being parsed. They are
24096 just constants with suggestive names. */
24097 static enum tree_code
24102 {
24107 /* Assume that it's not a pointer-to-member. */
24109 /* And that there are no cv-qualifiers. */
24112 /* Peek at the next token. */
24115 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
24125 {
24126 /* Consume the `*', `&' or `&&'. */
24129 /* A `*' can be followed by a cv-qualifier-seq, and so can a
24130 `&', if we are allowing GNU extensions. (The only qualifier
24131 that can legally appear after `&' is `restrict', but that is
24132 enforced during semantic analysis. */
24140 }
24141 else
24142 {
24143 /* Try the pointer-to-member case. */
24145 /* Look for the optional `::' operator. */
24148 /* Look for the nested-name specifier. */
24155 /* If we found it, and the next token is a `*', then we are
24156 indeed looking at a pointer-to-member operator. */
24159 {
24160 /* Indicate that the `*' operator was used. */
24168 else
24169 {
24170 /* The type of which the member is a member is given by the
24171 current SCOPE. */
24173 /* The next name will not be qualified. */
24177 /* Look for optional c++11 attributes. */
24181 /* Look for the optional cv-qualifier-seq. */
24183 }
24184 }
24185 /* If that didn't work we don't have a ptr-operator. */
24188 }
24191 }
24193 /* Parse an (optional) cv-qualifier-seq.
24195 cv-qualifier-seq:
24196 cv-qualifier cv-qualifier-seq [opt]
24198 cv-qualifier:
24199 const
24200 volatile
24202 GNU Extension:
24204 cv-qualifier:
24205 __restrict__
24207 Returns a bitmask representing the cv-qualifiers. */
24209 static cp_cv_quals
24211 {
24215 {
24217 cp_cv_quals cv_qualifier;
24219 /* Peek at the next token. */
24221 /* See if it's a cv-qualifier. */
24223 {
24239 }
24245 {
24250 }
24251 else
24252 {
24255 }
24256 }
24259 }
24261 /* Parse an (optional) ref-qualifier
24263 ref-qualifier:
24264 &
24265 &&
24267 Returns cp_ref_qualifier representing ref-qualifier. */
24269 static cp_ref_qualifier
24271 {
24274 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
24279 {
24284 {
24296 }
24301 {
24304 }
24305 else
24306 {
24309 }
24310 }
24313 }
24315 /* Parse an optional tx-qualifier.
24317 tx-qualifier:
24318 transaction_safe
24319 transaction_safe_dynamic */
24321 static tree
24323 {
24326 {
24331 {
24335 {
24338 {
24341 }
24342 else
24344 }
24345 }
24346 }
24348 }
24350 /* Parse an (optional) virt-specifier-seq.
24352 virt-specifier-seq:
24353 virt-specifier virt-specifier-seq [opt]
24355 virt-specifier:
24356 override
24357 final
24359 Returns a bitmask representing the virt-specifiers. */
24361 static cp_virt_specifiers
24363 {
24367 {
24369 cp_virt_specifiers virt_specifier;
24371 /* Peek at the next token. */
24373 /* See if it's a virt-specifier-qualifier. */
24377 {
24380 }
24382 {
24385 }
24387 {
24389 }
24390 else
24394 {
24399 }
24400 else
24401 {
24404 }
24405 }
24407 }
24409 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
24410 is in scope even though it isn't real. */
24412 void
24414 {
24415 tree this_parm;
24418 {
24419 /* We don't clear this between NSDMIs. Is it already what we want? */
24426 }
24429 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
24431 current_class_ref
24434 }
24436 /* Return true iff our current scope is a non-static data member
24437 initializer. */
24439 bool
24441 {
24442 /* We recognize NSDMI context by the context-less 'this' pointer set up
24443 by the function above. */
24449 }
24451 /* True if we're parsing a function declarator. */
24453 bool
24455 {
24456 /* this_entity is NULL for a function parameter scope while parsing the
24457 declarator; it is set when parsing the body of the function. */
24460 }
24462 /* Parse a late-specified return type, if any. This is not a separate
24463 non-terminal, but part of a function declarator, which looks like
24465 -> trailing-type-specifier-seq abstract-declarator(opt)
24467 Returns the type indicated by the type-id.
24469 In addition to this, parse any queued up #pragma omp declare simd
24470 clauses, and #pragma acc routine clauses.
24472 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
24473 function. */
24475 static tree
24478 {
24482 && declarator
24486 && declarator
24489 /* Peek at the next token. */
24491 /* A late-specified return type is indicated by an initial '->'. */
24500 {
24501 /* Consume the ->. */
24505 }
24507 /* Function declarations may be followed by a trailing
24508 requires-clause. */
24512 declarator->attributes
24516 declarator->attributes
24521 }
24523 /* Parse a declarator-id.
24525 declarator-id:
24526 id-expression
24527 :: [opt] nested-name-specifier [opt] type-name
24529 In the `id-expression' case, the value returned is as for
24530 cp_parser_id_expression if the id-expression was an unqualified-id.
24531 If the id-expression was a qualified-id, then a SCOPE_REF is
24532 returned. The first operand is the scope (either a NAMESPACE_DECL
24533 or TREE_TYPE), but the second is still just a representation of an
24534 unqualified-id. */
24536 static tree
24538 {
24539 tree id;
24540 /* The expression must be an id-expression. Assume that qualified
24541 names are the names of types so that:
24543 template <class T>
24544 int S<T>::R::i = 3;
24546 will work; we must treat `S<T>::R' as the name of a type.
24547 Similarly, assume that qualified names are templates, where
24548 required, so that:
24550 template <class T>
24551 int S<T>::R<T>::i = 3;
24553 will work, too. */
24559 optional_p);
24563 }
24565 /* Parse a type-id.
24567 type-id:
24568 type-specifier-seq abstract-declarator [opt]
24570 The parser flags FLAGS is used to control type-specifier parsing.
24572 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
24574 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24575 i.e. we've just seen "->".
24577 Returns the TYPE specified. */
24579 static tree
24583 {
24584 cp_decl_specifier_seq type_specifier_seq;
24587 /* Parse the type-specifier-seq. */
24590 is_trailing_return,
24598 /* A bare template name as a template argument is a template template
24599 argument, not a placeholder, so fail parsing it as a type argument. */
24600 {
24604 }
24608 /* There might or might not be an abstract declarator. */
24610 /* Look for the declarator. */
24611 abstract_declarator
24618 /* Check to see if there really was a declarator. */
24623 /* The concepts TS allows 'auto' as a type-id. */
24626 /* DR 625 prohibits use of auto as a template-argument. We allow 'auto'
24627 outside the template-argument-list context here only for the sake of
24628 diagnostic: grokdeclarator then can emit a better error message for
24629 e.g. using T = auto. */
24635 && !auto_typeid_ok
24636 /* None of the valid uses of 'auto' in C++14 involve the type-id
24637 nonterminal, but it is valid in a trailing-return-type. */
24640 {
24641 /* A type-id with type 'auto' is only ok if the abstract declarator
24642 is a function declarator with a late-specified return type.
24644 A type-id with 'auto' is also valid in a trailing-return-type
24645 in a compound-requirement. */
24652 else
24653 {
24655 {
24658 {
24659 auto_diagnostic_group g;
24663 tmpl);
24665 tmpl);
24666 }
24669 auto_node);
24670 else
24672 }
24674 }
24675 }
24678 is_template_arg);
24679 }
24681 /* Wrapper for cp_parser_type_id_1. */
24683 static tree
24686 {
24688 }
24690 /* Wrapper for cp_parser_type_id_1. */
24692 static tree
24694 {
24695 tree r;
24697 parser->type_definition_forbidden_message
24702 }
24704 /* Wrapper for cp_parser_type_id_1. */
24706 static tree
24708 {
24711 }
24713 /* Parse a type-specifier-seq.
24715 type-specifier-seq:
24716 type-specifier type-specifier-seq [opt]
24718 GNU extension:
24720 type-specifier-seq:
24721 attributes type-specifier-seq [opt]
24723 The parser flags FLAGS is used to control type-specifier parsing.
24725 If IS_DECLARATION is true, we are at the start of a "condition" or
24726 exception-declaration, so we might be followed by a declarator-id.
24728 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24729 i.e. we've just seen "->".
24731 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
24733 static void
24735 cp_parser_flags flags,
24739 {
24743 /* Clear the TYPE_SPECIFIER_SEQ. */
24747 /* In the context of a trailing return type, enum E { } is an
24748 elaborated-type-specifier followed by a function-body, not an
24749 enum-specifier. */
24753 /* Parse the type-specifiers and attributes. */
24755 {
24756 tree type_specifier;
24759 /* Check for attributes first. */
24761 {
24762 /* GNU attributes at the end of a declaration apply to the
24763 declaration as a whole, not to the trailing return type. So look
24764 ahead to see if these attributes are at the end. */
24767 {
24773 }
24774 type_specifier_seq->attributes
24778 }
24780 /* record the token of the beginning of the type specifier seq,
24781 for error reporting purposes*/
24785 /* Look for the type-specifier. */
24787 flags,
24788 type_specifier_seq,
24790 NULL,
24793 {
24794 /* If the first type-specifier could not be found, this is not a
24795 type-specifier-seq at all. */
24797 {
24798 /* Set in_declarator_p to avoid skipping to the semicolon. */
24810 }
24811 /* If subsequent type-specifiers could not be found, the
24812 type-specifier-seq is complete. */
24814 }
24817 /* The standard says that a condition can be:
24819 type-specifier-seq declarator = assignment-expression
24821 However, given:
24823 struct S {};
24824 if (int S = ...)
24826 we should treat the "S" as a declarator, not as a
24827 type-specifier. The standard doesn't say that explicitly for
24828 type-specifier-seq, but it does say that for
24829 decl-specifier-seq in an ordinary declaration. Perhaps it
24830 would be clearer just to allow a decl-specifier-seq here, and
24831 then add a semantic restriction that if any decl-specifiers
24832 that are not type-specifiers appear, the program is invalid. */
24835 }
24836 }
24838 /* Return whether the function currently being declared has an associated
24839 template parameter list. */
24841 static bool
24843 {
24856 }
24858 /* Parse a parameter-declaration-clause.
24860 parameter-declaration-clause:
24861 parameter-declaration-list [opt] ... [opt]
24862 parameter-declaration-list , ...
24864 The parser flags FLAGS is used to control type-specifier parsing.
24866 Returns a representation for the parameter declarations. A return
24867 value of NULL indicates a parameter-declaration-clause consisting
24868 only of an ellipsis. */
24870 static tree
24872 cp_parser_flags flags)
24873 {
24874 tree parameters;
24882 && !processing_template_parmlist
24883 && !processing_explicit_instantiation
24884 /* default_arg_ok_p tracks whether this is a parameter-clause for an
24885 actual function or a random abstract declarator. */
24891 /* Peek at the next token. */
24893 /* Check for trivial parameter-declaration-clauses. */
24895 {
24896 /* Consume the `...' token. */
24899 }
24901 /* There are no parameters. */
24903 /* Check for `(void)', too, which is a special case. */
24907 {
24908 /* Consume the `void' token. */
24910 /* There are no parameters. */
24912 }
24914 /* A vector of parameters that haven't been pushed yet. */
24917 /* Parse the parameter-declaration-list. */
24920 /* If a parse error occurred while parsing the
24921 parameter-declaration-list, then the entire
24922 parameter-declaration-clause is erroneous. */
24926 /* Peek at the next token. */
24928 /* If it's a `,', the clause should terminate with an ellipsis. */
24930 {
24931 /* Consume the `,'. */
24933 /* Expect an ellipsis. */
24934 ellipsis_p
24936 }
24937 /* It might also be `...' if the optional trailing `,' was
24938 omitted. */
24940 {
24941 /* Consume the `...' token. */
24943 /* And remember that we saw it. */
24945 }
24946 else
24949 /* A valid parameter-declaration-clause can only be followed by a ')'.
24950 So it's time to push all the parameters we have seen now that we
24951 know we have a valid declaration. Note that here we may not have
24952 committed yet, nor should we. Pushing here will detect the error
24953 of redefining a parameter. */
24958 /* Finish the parameter list. */
24963 }
24965 /* Parse a parameter-declaration-list.
24967 parameter-declaration-list:
24968 parameter-declaration
24969 parameter-declaration-list , parameter-declaration
24971 The parser flags FLAGS is used to control type-specifier parsing.
24972 PENDING_DECLS is a vector of parameters that haven't been pushed yet.
24974 Returns a representation of the parameter-declaration-list, as for
24975 cp_parser_parameter_declaration_clause. However, the
24976 `void_list_node' is never appended to the list. */
24978 static tree
24980 cp_parser_flags flags,
24982 {
24988 /* The special considerations that apply to a function within an
24989 unbraced linkage specifications do not apply to the parameters
24990 to the function. */
24991 saved_in_unbraced_linkage_specification_p
24995 /* Look for more parameters. */
24997 {
25002 /* Parse the parameter. */
25003 parameter
25008 /* We don't know yet if the enclosing context is unavailable or deprecated,
25009 so wait and deal with it in grokparms if appropriate. */
25013 {
25016 PARM,
25021 }
25025 /* If a parse error occurred parsing the parameter declaration,
25026 then the entire parameter-declaration-list is erroneous. */
25028 {
25031 }
25038 {
25039 /* We cannot always pushdecl while parsing tentatively because
25040 it may have side effects and we can't be sure yet if we're
25041 parsing a declaration, e.g.:
25043 S foo(int(x), int(x), int{x});
25045 where it's not clear if we're dealing with a constructor call
25046 or a function declaration until we've seen the last argument
25047 which breaks it up.
25048 It's safe to pushdecl so long as it doesn't result in a clash
25049 with an already-pushed parameter. But we don't delay pushing
25050 different parameters to handle
25052 S foo(int(i), decltype(i) j = 42);
25054 which is valid. */
25057 /* See if PARAMETERS already contains a parameter with the same
25058 DECL_NAME as DECL. */
25064 }())
25066 else
25068 }
25071 {
25075 }
25077 /* Add the new parameter to the list. */
25081 /* If the parameters were parenthesized, it's the case of
25082 T foo(X(x)) which looks like a variable definition but
25083 is a function declaration. */
25087 /* Peek at the next token. */
25090 /* These are for Objective-C++ */
25093 /* The parameter-declaration-list is complete. */
25096 {
25099 /* Peek at the next token. */
25101 /* If it's an ellipsis, then the list is complete. */
25104 /* Otherwise, there must be more parameters. Consume the
25105 `,'. */
25107 /* When parsing something like:
25109 int i(float f, double d)
25111 we can tell after seeing the declaration for "f" that we
25112 are not looking at an initialization of a variable "i",
25113 but rather at the declaration of a function "i".
25115 Due to the fact that the parsing of template arguments
25116 (as specified to a template-id) requires backtracking we
25117 cannot use this technique when inside a template argument
25118 list. */
25122 /* However, a parameter-declaration of the form
25123 "float(f)" (which is a valid declaration of a
25124 parameter "f") can also be interpreted as an
25125 expression (the conversion of "f" to "float"). */
25128 }
25129 else
25130 {
25138 }
25139 }
25141 parser->in_unbraced_linkage_specification_p
25144 /* Reset implicit_template_scope if we are about to leave the function
25145 parameter list that introduced it. Note that for out-of-line member
25146 definitions, there will be one or more class scopes before we get to
25147 the template parameter scope. */
25151 {
25155 {
25158 }
25159 }
25162 }
25164 /* Parse a parameter declaration.
25166 parameter-declaration:
25167 decl-specifier-seq ... [opt] declarator
25168 decl-specifier-seq declarator = assignment-expression
25169 decl-specifier-seq ... [opt] abstract-declarator [opt]
25170 decl-specifier-seq abstract-declarator [opt] = assignment-expression
25172 The parser flags FLAGS is used to control type-specifier parsing.
25174 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
25175 declares a template parameter. (In that case, a non-nested `>'
25176 token encountered during the parsing of the assignment-expression
25177 is not interpreted as a greater-than operator.)
25179 Returns a representation of the parameter, or NULL if an error
25180 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
25181 true iff the declarator is of the form "(p)". */
25185 cp_parser_flags flags,
25188 {
25190 cp_decl_specifier_seq decl_specifiers;
25192 tree default_argument;
25197 /* In a template parameter, `>' is not an operator.
25199 [temp.param]
25201 When parsing a default template-argument for a non-type
25202 template-parameter, the first non-nested `>' is taken as the end
25203 of the template parameter-list rather than a greater-than
25204 operator. */
25206 /* Type definitions may not appear in parameter types. */
25208 parser->type_definition_forbidden_message
25215 /* Parse the declaration-specifiers. */
25218 flags,
25222 /* [dcl.spec.auto.general]: "A placeholder-type-specifier of the form
25223 type-constraint opt auto can be used as a decl-specifier of the
25224 decl-specifier-seq of a parameter-declaration of a function declaration
25225 or lambda-expression..." but we must not synthesize an implicit template
25226 type parameter in its declarator. That is, in "void f(auto[auto{10}]);"
25227 we want to synthesize only the first auto. */
25231 /* Complain about missing 'typename' or other invalid type names. */
25236 /* If an error occurred, there's no reason to attempt to parse the
25237 rest of the declaration. */
25239 {
25242 }
25244 /* Peek at the next token. */
25247 /* If the next token is a `)', `,', `=', `>', or `...', then there
25248 is no declarator. However, when variadic templates are enabled,
25249 there may be a declarator following `...'. */
25254 {
25258 }
25259 /* Otherwise, there should be a declarator. */
25260 else
25261 {
25265 /* After seeing a decl-specifier-seq, if the next token is not a
25266 "(" or "{", there is no possibility that the code is a valid
25267 expression. Therefore, if parsing tentatively, we commit at
25268 this point. */
25270 /* In an expression context, having seen:
25272 (int((char ...
25274 we cannot be sure whether we are looking at a
25275 function-type (taking a "char" as a parameter) or a cast
25276 of some object of type "char" to "int". */
25280 {
25282 {
25285 /* This is a CTAD expression, not a parameter declaration. */
25287 }
25288 else
25290 }
25291 /* Parse the declarator. */
25294 CP_PARSER_DECLARATOR_EITHER,
25295 CP_PARSER_FLAGS_NONE,
25297 parenthesized_p,
25302 /* After the declarator, allow more attributes. */
25303 decl_specifiers.attributes
25307 /* If the declarator is a template parameter pack, remember that and
25308 clear the flag in the declarator itself so we don't get errors
25309 from grokdeclarator. */
25311 {
25314 }
25315 }
25317 /* If the next token is an ellipsis, and we have not seen a declarator
25318 name, and if either the type of the declarator contains parameter
25319 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
25320 for, eg, abbreviated integral type names), then we actually have a
25321 parameter pack expansion expression. Otherwise, leave the ellipsis
25322 for a C-style variadic function. */
25325 /* If a function parameter pack was specified and an implicit template
25326 parameter was introduced during cp_parser_parameter_declaration,
25327 change any implicit parameters introduced into packs. */
25332 {
25340 }
25343 {
25354 {
25355 /* Consume the `...'. */
25359 /* Build a pack expansion type */
25364 else
25366 }
25367 }
25369 /* The restriction on defining new types applies only to the type
25370 of the parameter, not to the default argument. */
25373 /* If the next token is `=', then process a default argument. */
25375 {
25380 /* If we are defining a class, then the tokens that make up the
25381 default argument must be saved and processed later. */
25387 /* A constrained-type-specifier may declare a type
25388 template-parameter. */
25390 default_argument
25393 /* A constrained-type-specifier may declare a
25394 template-template-parameter. */
25396 default_argument
25399 /* Outside of a class definition, we can just parse the
25400 assignment-expression. */
25401 else
25402 default_argument
25406 {
25408 "default arguments are only "
25410 }
25412 || template_parameter_pack_p
25415 {
25416 /* Find the name of the parameter pack. */
25423 template_parm_p
25429 else
25431 template_parm_p
25438 }
25439 }
25440 else
25446 /* Generate a location for the parameter, ranging from the start of the
25447 initial token to the end of the final token (using input_location for
25448 the latter, set up by cp_lexer_set_source_position_from_token when
25449 consuming tokens).
25451 If we have a identifier, then use it for the caret location, e.g.
25453 extern int callee (int one, int (*two)(int, int), float three);
25454 ~~~~~~^~~~~~~~~~~~~~
25456 otherwise, reuse the start location for the caret location e.g.:
25458 extern int callee (int one, int (*)(int, int), float three);
25459 ^~~~~~~~~~~~~~~~~
25461 */
25467 input_location);
25470 declarator,
25471 default_argument,
25472 param_loc,
25473 template_parameter_pack_p);
25474 }
25476 /* Parse a default argument and return it.
25478 TEMPLATE_PARM_P is true if this is a default argument for a
25479 non-type template parameter. */
25480 static tree
25482 {
25487 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
25488 set correctly. */
25495 /* Local variable names (and the `this' keyword) may not
25496 appear in a default argument. */
25499 /* Parse the assignment-expression. */
25504 /* The "this" pointer is not valid in a default argument. */
25506 {
25511 }
25513 /* Restore the "this" pointer. */
25515 {
25518 }
25527 }
25529 /* Parse a function-body.
25531 function-body:
25532 compound_statement */
25534 static void
25536 {
25540 }
25542 /* Parse a ctor-initializer-opt followed by a function-body. Return
25543 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
25544 is true we are parsing a function-try-block. */
25546 static void
25549 {
25551 const bool check_body_p
25559 {
25562 "function-try-block body of %<constexpr%> constructor only "
25564 else
25566 "function-try-block body of %<constexpr%> function only "
25568 }
25570 /* Begin the function body. */
25572 /* Parse the optional ctor-initializer. */
25575 /* If we're parsing a constexpr constructor definition, we need
25576 to check that the constructor body is indeed empty. However,
25577 before we get to cp_parser_function_body lot of junk has been
25578 generated, so we can't just check that we have an empty block.
25579 Rather we take a snapshot of the outermost block, and check whether
25580 cp_parser_function_body changed its state. */
25582 {
25586 }
25587 /* Parse the function-body. */
25591 /* Finish the function body. */
25593 }
25595 /* Parse an initializer.
25597 initializer:
25598 = initializer-clause
25599 ( expression-list )
25601 Returns an expression representing the initializer. If no
25602 initializer is present, NULL_TREE is returned.
25604 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
25605 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
25606 set to TRUE if there is no initializer present. If there is an
25607 initializer, and it is not a constant-expression, *NON_CONSTANT_P
25608 is set to true; otherwise it is set to false. */
25610 static tree
25613 {
25615 tree init;
25617 /* Peek at the next token. */
25620 /* Let our caller know whether or not this initializer was
25621 parenthesized. */
25624 /* Assume that the initializer is constant. */
25629 {
25630 /* Consume the `='. */
25632 /* Parse the initializer-clause. */
25634 }
25636 {
25641 non_constant_p);
25646 }
25648 {
25653 }
25654 else
25655 {
25656 /* Anything else is an error. */
25659 }
25665 }
25667 /* Parse an initializer-clause.
25669 initializer-clause:
25670 assignment-expression
25671 braced-init-list
25673 Returns an expression representing the initializer.
25675 If the `assignment-expression' production is used the value
25676 returned is simply a representation for the expression.
25678 Otherwise, calls cp_parser_braced_list. */
25680 static cp_expr
25682 {
25683 cp_expr initializer;
25685 /* Assume the expression is constant. */
25689 /* If it is not a `{', then we are looking at an
25690 assignment-expression. */
25692 {
25693 initializer
25696 non_constant_p);
25697 }
25698 else
25702 }
25704 /* Parse a brace-enclosed initializer list.
25706 braced-init-list:
25707 { initializer-list , [opt] }
25708 { designated-initializer-list , [opt] }
25709 { }
25711 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
25712 the elements of the initializer-list (or NULL, if the last
25713 production is used). The TREE_TYPE for the CONSTRUCTOR will be
25714 NULL_TREE. There is no way to detect whether or not the optional
25715 trailing `,' was provided. NON_CONSTANT_P is as for
25716 cp_parser_initializer. */
25718 static cp_expr
25720 {
25721 tree initializer;
25724 /* Consume the `{' token. */
25725 matching_braces braces;
25727 /* Create a CONSTRUCTOR to represent the braced-initializer. */
25729 /* If it's not a `}', then there is a non-trivial initializer. */
25731 {
25733 /* Parse the initializer list. */
25737 /* A trailing `,' token is allowed. */
25740 }
25743 /* Now, there should be a trailing `}'. */
25750 /* Build a location of the form:
25751 { ... }
25752 ^~~~~~~
25753 with caret==start at the open brace, finish at the close brace. */
25757 }
25759 /* Consume tokens up to, but not including, the next non-nested closing `]'.
25760 Returns true iff we found a closing `]'. */
25762 static bool
25764 {
25768 {
25772 {
25776 /* FALLTHRU */
25779 /* If we've run out of tokens, then there is no closing `]'. */
25793 }
25795 /* Consume the current token, skipping it. */
25797 }
25798 }
25800 /* Consume tokens up to, and including, the next non-nested closing `]'.
25801 Returns true iff we found a closing `]'. */
25803 static bool
25805 {
25810 }
25812 /* Return true if we are looking at an array-designator, false otherwise. */
25814 static bool
25816 {
25817 /* Consume the `['. */
25822 /* Skip tokens until the next token is a closing square bracket.
25823 If we find the closing `]', and the next token is a `=', then
25824 we are looking at an array designator. */
25825 bool array_designator_p
25829 /* Roll back the tokens we skipped. */
25833 }
25835 /* Parse an initializer-list.
25837 initializer-list:
25838 initializer-clause ... [opt]
25839 initializer-list , initializer-clause ... [opt]
25841 C++20 Extension:
25843 designated-initializer-list:
25844 designated-initializer-clause
25845 designated-initializer-list , designated-initializer-clause
25847 designated-initializer-clause:
25848 designator brace-or-equal-initializer
25850 designator:
25851 . identifier
25853 GNU Extension:
25855 initializer-list:
25856 designation initializer-clause ...[opt]
25857 initializer-list , designation initializer-clause ...[opt]
25859 designation:
25860 . identifier =
25861 identifier :
25862 [ constant-expression ] =
25864 Returns a vec of constructor_elt. The VALUE of each elt is an expression
25865 for the initializer. If the INDEX of the elt is non-NULL, it is the
25866 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
25867 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
25868 are any designators. */
25873 {
25878 /* Assume all of the expressions are constant. */
25885 /* Parse the rest of the list. */
25887 {
25889 tree designator;
25890 tree initializer;
25895 /* Handle the C++20 syntax, '. id ='. */
25903 {
25906 "C++ designated initializers only available with "
25908 /* Consume the `.'. */
25910 /* Consume the identifier. */
25913 /* Consume the `='. */
25915 else
25917 }
25918 /* Also, if the next token is an identifier and the following one is a
25919 colon, we are looking at the GNU designated-initializer
25920 syntax. */
25925 {
25926 /* Warn the user that they are using an extension. */
25929 /* Consume the identifier. */
25931 /* Consume the `:'. */
25933 }
25934 /* Also handle C99 array designators, '[ const ] ='. */
25938 {
25939 /* In C++11, [ could start a lambda-introducer. */
25945 {
25948 }
25949 else
25950 {
25955 }
25960 && (!require_potential_rvalue_constant_expression
25964 /* Warn the user that they are using an extension. */
25967 }
25968 else
25972 {
25975 }
25979 {
25983 }
25987 /* Parse the initializer. */
25990 /* If any clause is non-constant, so is the entire initializer. */
25995 /* This uses |= rather than = because C_I_D_I could have been set in
25996 cp_parser_functional_cast so we must be careful not to clear the
25997 flag. */
26000 /* If we have an ellipsis, this is an initializer pack
26001 expansion. */
26003 {
26006 /* Consume the `...'. */
26013 /* Turn the initializer into an initializer expansion. */
26015 }
26017 /* Add it to the vector. */
26020 /* If the next token is not a comma, we have reached the end of
26021 the list. */
26025 /* Peek at the next token. */
26027 /* If the next token is a `}', then we're still done. An
26028 initializer-clause can have a trailing `,' after the
26029 initializer-list and before the closing `}'. */
26033 /* Suppress location wrappers in a long initializer to save memory
26034 (14179). The cutoff is chosen arbitrarily. */
26038 /* Look one level down because it's easy. Looking deeper would require
26039 passing down a nelts pointer, and I don't think multi-level massive
26040 initializers are common enough to justify this. */
26046 /* Consume the `,' token. */
26048 }
26050 /* The same identifier shall not appear in multiple designators
26051 of a designated-initializer-list. */
26053 {
26058 {
26060 {
26062 "%<.%s%> designator used multiple times in "
26066 }
26067 else
26069 }
26073 }
26079 }
26081 /* Classes [gram.class] */
26083 /* Parse a class-name.
26085 class-name:
26086 identifier
26087 template-id
26089 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
26090 to indicate that names looked up in dependent types should be
26091 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
26092 keyword has been used to indicate that the name that appears next
26093 is a template. TAG_TYPE indicates the explicit tag given before
26094 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
26095 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
26096 is the class being defined in a class-head. If ENUM_OK is TRUE,
26097 enum-names are also accepted.
26099 Returns the TYPE_DECL representing the class. */
26101 static tree
26110 {
26111 tree decl;
26114 /* All class-names start with an identifier. */
26117 {
26120 }
26122 /* PARSER->SCOPE can be cleared when parsing the template-arguments
26123 to a template-id, so we save it here. Consider object scope too,
26124 so that make_typename_type below can use it (cp_parser_template_name
26125 considers object scope also). This may happen with code like
26127 p->template A<T>::a()
26129 where we first want to look up A<T>::a in the class of the object
26130 expression, as per [basic.lookup.classref]. */
26132 /* This only checks parser->scope to avoid duplicate errors; if
26133 ->object_type is erroneous, go on to give a parse error. */
26137 /* Any name names a type if we're following the `typename' keyword
26138 in a qualified name where the enclosing scope is type-dependent. */
26143 /* Handle the common case (an identifier, but not a template-id)
26144 efficiently. */
26147 {
26151 /* Look for the identifier. */
26155 /* If the next token isn't an identifier, we are certainly not
26156 looking at a class-name. */
26159 /* If we know this is a type-name, there's no need to look it
26160 up. */
26163 else
26164 {
26165 tree ambiguous_decls;
26166 /* If we already know that this lookup is ambiguous, then
26167 we've already issued an error message; there's no reason
26168 to check again. */
26170 {
26173 }
26174 /* If the next token is a `::', then the name must be a type
26175 name.
26177 [basic.lookup.qual]
26179 During the lookup for a name preceding the :: scope
26180 resolution operator, object, function, and enumerator
26181 names are ignored. */
26184 /* Look up the name. */
26186 tag_type,
26189 check_dependency_p,
26193 {
26197 }
26198 }
26199 }
26200 else
26201 {
26202 /* Try a template-id. */
26204 check_dependency_p,
26205 tag_type,
26206 is_declaration);
26209 }
26213 /* If this is a typename, create a TYPENAME_TYPE. */
26215 {
26220 }
26224 /* Check to see that it is really the name of a class. */
26228 /* Situations like this:
26230 template <typename T> struct A {
26231 typename T::template X<int>::I i;
26232 };
26234 are problematic. Is `T::template X<int>' a class-name? The
26235 standard does not seem to be definitive, but there is no other
26236 valid interpretation of the following `::'. Therefore, those
26237 names are considered class-names. */
26238 {
26242 }
26247 /* In Objective-C 2.0, a classname followed by '.' starts a
26248 dot-syntax expression, and it's not a type-name. */
26260 }
26262 /* Make sure that any member-function parameters are in scope.
26263 For instance, a function's noexcept-specifier can use the function's
26264 parameters:
26266 struct S {
26267 void fn (int p) noexcept(noexcept(p));
26268 };
26270 so we need to make sure name lookup can find them. This is used
26271 when we delay parsing of the noexcept-specifier. */
26273 static void
26275 {
26282 {
26286 }
26287 }
26289 /* Undo the effects of inject_parm_decls. */
26291 static void
26293 {
26296 }
26298 /* Parse a class-specifier.
26300 class-specifier:
26301 class-head { member-specification [opt] }
26303 Returns the TREE_TYPE representing the class. */
26305 tree
26307 {
26310 tree type;
26324 /* Parse the class-head. */
26327 /* If the class-head was a semantic disaster, skip the entire body
26328 of the class. */
26330 {
26334 }
26336 /* Look for the `{'. */
26337 matching_braces braces;
26339 {
26342 }
26347 /* Issue an error message if type-definitions are forbidden here. */
26349 /* Remember that we are defining one more class. */
26351 /* Inside the class, surrounding template-parameter-lists do not
26352 apply. */
26353 saved_num_template_parameter_lists
26356 /* We are not in a function body. */
26359 /* Or in a loop. */
26362 /* Or in a switch. */
26365 /* We are not immediately inside an extern "lang" block. */
26366 saved_in_unbraced_linkage_specification_p
26369 /* 'this' from an enclosing non-static member function is unavailable. */
26375 /* Start the class. */
26377 {
26379 /* SCOPE must be a scope nested inside current scope. */
26383 else
26385 }
26389 /* If the type is erroneous, skip the entire body of the class. */
26391 else
26392 /* Parse the member-specification. */
26395 /* Look for the trailing `}'. */
26397 /* Look for trailing attributes to apply to this class. */
26405 /* We've finished a type definition. Check for the common syntax
26406 error of forgetting a semicolon after the definition. We need to
26407 be careful, as we can't just check for not-a-semicolon and be done
26408 with it; the user might have typed:
26410 class X { } c = ...;
26411 class X { } *p = ...;
26413 and so forth. Instead, enumerate all the possible tokens that
26414 might follow this production; if we don't see one of them, then
26415 complain and silently insert the semicolon. */
26416 {
26421 /* Don't try to parse c++11 attributes here. As per the
26422 grammar, that should be a task for
26423 cp_parser_decl_specifier_seq. */
26427 {
26439 /* While it's legal for type qualifiers and storage class
26440 specifiers to follow type definitions in the grammar, only
26441 compiler testsuites contain code like that. Assume that if
26442 we see such code, then what we're really seeing is a case
26443 like:
26445 class X { }
26446 const <type> var = ...;
26448 or
26450 class Y { }
26451 static <type> func (...) ...
26453 i.e. the qualifier or specifier applies to the next
26454 declaration. To do so, however, we need to look ahead one
26455 more token to see if *that* token is a type specifier.
26457 This code could be improved to handle:
26459 class Z { }
26460 static const <type> var = ...; */
26463 {
26466 /* Handling user-defined types here would be nice, but very
26467 tricky. */
26468 want_semicolon
26471 }
26475 }
26477 /* If we don't have a type, then something is very wrong and we
26478 shouldn't try to do anything clever. Likewise for not seeing the
26479 closing brace. */
26481 {
26482 /* Locate the closing brace. */
26483 cp_token_position prev
26488 /* We want to suggest insertion of a ';' immediately *after* the
26489 closing brace, so, if we can, offset the location by 1 column. */
26496 /* If we successfully offset the location, suggest the fix-it. */
26509 else
26512 /* Unget one token and smash it to look as though we encountered
26513 a semicolon in the input stream. */
26518 }
26519 }
26521 /* If this class is not itself within the scope of another class,
26522 then we need to parse the bodies of all of the queued function
26523 definitions. Note that the queued functions defined in a class
26524 are not always processed immediately following the
26525 class-specifier for that class. Consider:
26527 struct A {
26528 struct B { void f() { sizeof (A); } };
26529 };
26531 If `f' were processed before the processing of `A' were
26532 completed, there would be no way to compute the size of `A'.
26533 Note that the nesting we are interested in here is lexical --
26534 not the semantic nesting given by TYPE_CONTEXT. In particular,
26535 for:
26537 struct A { struct B; };
26538 struct A::B { void f() { } };
26540 there is no need to delay the parsing of `A::B::f'. */
26542 {
26543 tree decl;
26550 {
26551 /* Skip default arguments, NSDMIs, etc, in order to improve
26552 error recovery (c++/71169, c++/71832). */
26556 }
26558 /* In a first pass, parse default arguments to the functions.
26559 Then, in a second pass, parse the bodies of the functions.
26560 This two-phased approach handles cases like:
26562 struct S {
26563 void f() { g(); }
26564 void g(int i = 3);
26565 };
26567 */
26569 {
26571 /* If there are default arguments that have not yet been processed,
26572 take care of them now. */
26574 {
26579 }
26580 /* Make sure that any template parameters are in scope. */
26582 /* Parse the default argument expressions. */
26584 /* Remove any template parameters from the symbol table. */
26586 }
26589 /* If there are noexcept-specifiers that have not yet been processed,
26590 take care of them now. Do this before processing NSDMIs as they
26591 may depend on noexcept-specifiers already having been processed. */
26593 {
26596 {
26601 }
26606 /* Make sure that any template parameters are in scope. */
26609 /* Make sure that any member-function parameters are in scope.
26610 This function doesn't expect ccp to be set. */
26614 /* 'this' is not allowed in static member functions. */
26615 unsigned char local_variables_forbidden_p
26620 /* Now we can parse the noexcept-specifier. */
26626 /* Update the fn's type directly -- it might have escaped
26627 beyond this decl :( */
26629 /* Update any instantiations we've already created. We must
26630 keep the new noexcept-specifier wrapped in a DEFERRED_NOEXCEPT
26631 so that maybe_instantiate_noexcept can tsubst the NOEXCEPT_EXPR
26632 in the pattern. */
26637 /* Restore the state of local_variables_forbidden_p. */
26640 /* The finish_struct call above performed various override checking,
26641 but it skipped unparsed noexcept-specifier operands. Now that we
26642 have resolved them, check again. */
26645 /* Remove any member-function parameters from the symbol table. */
26648 /* Remove any template parameters from the symbol table. */
26650 }
26653 /* Now parse any NSDMIs. */
26655 {
26658 {
26663 }
26666 }
26669 /* Now contract attributes. */
26671 {
26674 {
26679 }
26683 /* Make sure that any template parameters are in scope. */
26686 /* Make sure that any member-function parameters are in scope.
26687 This function doesn't expect ccp to be set. */
26691 /* 'this' is not allowed in static member functions. */
26692 unsigned char local_variables_forbidden_p
26697 /* Now we can parse contract conditions. */
26699 {
26702 }
26704 /* Restore the state of local_variables_forbidden_p. */
26707 /* Remove any member-function parameters from the symbol table. */
26710 /* Remove any template parameters from the symbol table. */
26713 /* Perform any deferred contract matching. */
26715 }
26723 /* Now parse the body of the functions. */
26725 {
26726 /* OpenMP UDRs need to be parsed before all other functions. */
26733 }
26734 else
26738 }
26740 /* Put back any saved access checks. */
26743 /* Restore saved state. */
26747 parser->num_template_parameter_lists
26749 parser->in_unbraced_linkage_specification_p
26755 }
26757 /* Parse a class-head.
26759 class-head:
26760 class-key identifier [opt] base-clause [opt]
26761 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
26762 class-key nested-name-specifier [opt] template-id
26763 base-clause [opt]
26765 class-virt-specifier:
26766 final
26768 GNU Extensions:
26769 class-key attributes identifier [opt] base-clause [opt]
26770 class-key attributes nested-name-specifier identifier base-clause [opt]
26771 class-key attributes nested-name-specifier [opt] template-id
26772 base-clause [opt]
26774 Upon return BASES is initialized to the list of base classes (or
26775 NULL, if there are none) in the same form returned by
26776 cp_parser_base_clause.
26778 Returns the TYPE of the indicated class. Sets
26779 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
26780 involving a nested-name-specifier was used, and FALSE otherwise.
26782 Returns error_mark_node if this is not a class-head.
26784 Returns NULL_TREE if the class-head is syntactically valid, but
26785 semantically invalid in a way that means we should skip the entire
26786 body of the class. */
26788 static tree
26791 {
26792 tree nested_name_specifier;
26796 tree attributes;
26797 tree bases;
26807 /* Assume no nested-name-specifier will be present. */
26809 /* Assume no template parameter lists will be used in defining the
26810 type. */
26814 /* Look for the class-key. */
26821 /* Parse the attributes. */
26826 /* If the next token is `::', that is invalid -- but sometimes
26827 people do try to write:
26829 struct ::S {};
26831 Handle this gracefully by accepting the extra qualifier, and then
26832 issuing an error about it later if this really is a
26833 class-head. If it turns out just to be an elaborated type
26834 specifier, remain silent. */
26838 /* It is OK to define an inaccessible class; for example:
26840 class A { class B; };
26841 class A::B {};
26843 So we want to ignore access when parsing the class name.
26844 However, we might be tentatively parsing what is really an
26845 elaborated-type-specifier naming a template-id, e.g.
26847 struct C<&D::m> c;
26849 In this case the tentative parse as a class-head will fail, but not
26850 before cp_parser_template_id splices in a CPP_TEMPLATE_ID token.
26851 Since dk_no_check is sticky, we must instead use dk_deferred so that
26852 any such CPP_TEMPLATE_ID token created during this tentative parse
26853 will correctly capture the access checks imposed by the template-id . */
26856 /* Determine the name of the class. Begin by looking for an
26857 optional nested-name-specifier. */
26859 nested_name_specifier
26865 /* If there was a nested-name-specifier, then there *must* be an
26866 identifier. */
26871 {
26873 /* Although the grammar says `identifier', it really means
26874 `class-name' or `template-name'. You are only allowed to
26875 define a class that has already been declared with this
26876 syntax.
26878 The proposed resolution for Core Issue 180 says that wherever
26879 you see `class T::X' you should treat `X' as a type-name.
26881 We do not know if we will see a class-name, or a
26882 template-name. We look for a class-name first, in case the
26883 class-name is a template-id; if we looked for the
26884 template-name first we would stop after the template-name. */
26891 class_type,
26895 /* If that didn't work, ignore the nested-name-specifier. */
26897 {
26903 }
26904 /* If we could not find a corresponding TYPE, treat this
26905 declaration like an unqualified declaration. */
26908 /* Otherwise, count the number of templates used in TYPE and its
26909 containing scopes. */
26910 else
26912 }
26913 /* Otherwise, the identifier is optional. */
26914 else
26915 {
26916 /* We don't know whether what comes next is a template-id,
26917 an identifier, or nothing at all. */
26919 /* Check for a template-id. */
26924 class_key,
26926 /* If that didn't work, it could still be an identifier. */
26928 {
26930 {
26933 }
26934 else
26936 }
26937 else
26938 {
26941 }
26942 }
26947 {
26949 class_key,
26951 }
26954 /* If it's not a `:' or a `{' then we can't really be looking at a
26955 class-head, since a class-head only appears as part of a
26956 class-specifier. We have to detect this situation before calling
26957 xref_tag, since that has irreversible side-effects. */
26959 {
26963 }
26965 /* At this point, we're going ahead with the class-specifier, even
26966 if some other problem occurs. */
26969 {
26974 }
26975 /* Issue the error about the overly-qualified name now. */
26977 {
26982 }
26984 {
26989 }
26991 {
26992 tree scope;
26995 /* [temp.names]: in a qualified-id formed by a class-head-name, the
26996 keyword template shall not appear at the top level. */
27000 /* Reject typedef-names in class heads. */
27002 {
27005 type);
27008 }
27010 /* Figure out in what scope the declaration is being placed. */
27012 /* If that scope does not contain the scope in which the
27013 class was originally declared, the program is invalid. */
27015 {
27018 "declaration of %qD in namespace %qD which does not "
27021 else
27027 }
27028 /* [dcl.meaning]
27030 A declarator-id shall not be qualified except for the
27031 definition of a ... nested class outside of its class
27032 ... [or] the definition or explicit instantiation of a
27033 class member of a namespace outside of its namespace. */
27037 }
27038 /* An explicit-specialization must be preceded by "template <>". If
27039 it is not, try to recover gracefully. */
27042 && !processing_template_parmlist
27044 {
27045 /* Build a location of this form:
27046 struct typename <ARGS>
27047 ^~~~~~~~~~~~~~~~~~~~~~
27048 with caret==start at the start token, and
27049 finishing at the end of the type. */
27050 location_t reported_loc
27052 class_head_start_location,
27058 "an explicit specialization must be preceded by"
27061 /* Take the same action that would have been taken by
27062 cp_parser_explicit_specialization. */
27065 }
27066 /* There must be no "return" statements between this point and the
27067 end of this function; set "type "to the correct return value and
27068 use "goto done;" to return. */
27069 /* Make sure that the right number of template parameters were
27070 present. */
27072 template_id_p,
27075 {
27076 /* If something went wrong, there is no point in even trying to
27077 process the class-definition. */
27080 }
27082 /* Look up the type. */
27084 {
27088 {
27092 }
27093 else
27094 {
27098 /* Check the scope while we still know whether or not we had a
27099 nested-name-specifier. */
27102 }
27105 }
27107 {
27110 /* Given:
27112 template <typename T> struct S { struct T };
27113 template <typename T> struct S<T>::T { };
27115 we will get a TYPENAME_TYPE when processing the definition of
27116 `S::T'. We need to resolve it to the actual type before we
27117 try to define it. */
27119 {
27122 {
27125 }
27126 }
27130 {
27133 }
27135 /* Enter the scope indicated by the nested-name-specifier. */
27137 /* Get the canonical version of this type. */
27139 /* Call push_template_decl if it seems like we should be defining a
27140 template either from the template headers or the type we're
27141 defining, so that we diagnose both extra and missing headers. */
27145 {
27148 {
27151 }
27152 }
27156 }
27158 {
27159 /* If the class was unnamed, create a dummy name. */
27167 }
27169 /* Diagnose class/struct/union mismatches. */
27173 /* Indicate whether this class was declared as a `class' or as a
27174 `struct'. */
27178 /* If this type was already complete, and we see another definition,
27179 that's an error. Likewise if the type is already being defined:
27180 this can happen, eg, when it's defined from within an expression
27181 (c++/84605). */
27184 {
27186 type);
27188 type);
27191 }
27196 {
27199 {
27200 /* In a lambda this should work, but doesn't currently. */
27203 }
27205 /* Apply attributes now, before any use of the class as a template
27206 argument in its base list. */
27209 }
27211 /* Associate constraints with the type. */
27215 /* We will have entered the scope containing the class; the names of
27216 base classes should be looked up in that context. For example:
27218 struct A { struct B {}; struct C; };
27219 struct A::C : B {};
27221 is valid. */
27223 /* Get the list of base-classes, if there is one. Defer access checking
27224 until the entire list has been seen, as per [class.access.general]. */
27227 {
27233 }
27234 else
27237 /* If we're really defining a class, process the base classes.
27238 If they're invalid, fail. */
27242 /* Now that all bases have been seen and attached to the class, check
27243 accessibility of the types named in the base-clause. This must be
27244 done relative to the class scope, so that we accept e.g.
27246 struct A { protected: struct B {}; };
27247 struct C : A::B, A {}; // OK: A::B is accessible via base A
27249 as per [class.access.general]. */
27256 done:
27257 /* Leave the scope given by the nested-name-specifier. We will
27258 enter the class scope itself while processing the members. */
27263 {
27266 }
27272 out:
27275 }
27277 /* Parse a class-key.
27279 class-key:
27280 class
27281 struct
27282 union
27284 Returns the kind of class-key specified, or none_type to indicate
27285 error. */
27287 static enum tag_types
27289 {
27293 /* Look for the class-key. */
27298 /* Check to see if the TOKEN is a class-key. */
27303 }
27305 /* Parse a type-parameter-key.
27307 type-parameter-key:
27308 class
27309 typename
27310 */
27312 static void
27314 {
27315 /* Look for the type-parameter-key. */
27319 {
27323 /* typename is not allowed in a template template parameter
27324 by the standard until C++17. */
27326 "ISO C++ forbids typename key in template template parameter;"
27328 }
27329 else
27333 }
27335 /* Parse an (optional) member-specification.
27337 member-specification:
27338 member-declaration member-specification [opt]
27339 access-specifier : member-specification [opt] */
27341 static void
27343 {
27345 {
27349 /* Peek at the next token. */
27351 /* If it's a `}', or EOF then we've seen all the members. */
27357 /* See if this token is a keyword. */
27360 {
27364 /* Consume the access-specifier. */
27366 /* Remember which access-specifier is active. */
27368 /* Look for the `:'. */
27373 /* Accept #pragmas at class scope. */
27375 {
27378 }
27380 /* Otherwise, the next construction must be a
27381 member-declaration. */
27383 }
27384 }
27385 }
27387 /* Parse a member-declaration.
27389 member-declaration:
27390 decl-specifier-seq [opt] member-declarator-list [opt] ;
27391 function-definition ; [opt]
27392 :: [opt] nested-name-specifier template [opt] unqualified-id ;
27393 using-declaration
27394 template-declaration
27395 alias-declaration
27397 member-declarator-list:
27398 member-declarator
27399 member-declarator-list , member-declarator
27401 member-declarator:
27402 declarator pure-specifier [opt]
27403 declarator constant-initializer [opt]
27404 identifier [opt] : constant-expression
27406 GNU Extensions:
27408 member-declaration:
27409 __extension__ member-declaration
27411 member-declarator:
27412 declarator attributes [opt] pure-specifier [opt]
27413 declarator attributes [opt] constant-initializer [opt]
27414 identifier [opt] attributes [opt] : constant-expression
27416 C++0x Extensions:
27418 member-declaration:
27419 static_assert-declaration */
27421 static void
27423 {
27424 cp_decl_specifier_seq decl_specifiers;
27425 tree prefix_attributes;
27426 tree decl;
27435 /* Check for the `__extension__' keyword. */
27437 {
27438 /* Recurse. */
27440 /* Restore the old value of the PEDANTIC flag. */
27444 }
27446 /* Check for a template-declaration. */
27448 {
27449 /* An explicit specialization here is an error condition, and we
27450 expect the specialization handler to detect and report this. */
27454 else
27458 }
27459 /* Check for a template introduction. */
27463 /* Check for a using-declaration. */
27465 {
27467 /* Parse the using-declaration. */
27471 else
27472 {
27473 tree decl;
27477 /* Note that if we actually see the '=' token after the
27478 identifier, cp_parser_alias_declaration commits the
27479 tentative parse. In that case, we really expect an
27480 alias-declaration. Otherwise, we expect a using
27481 declaration. */
27482 alias_decl_expected =
27488 else
27491 }
27493 }
27495 /* Check for @defs. */
27497 {
27502 {
27507 }
27509 }
27511 /* If the next token is `static_assert' we have a static assertion. */
27513 {
27516 }
27520 cp_omp_declare_simd_data odsd;
27524 /* Parse the decl-specifier-seq. */
27527 (CP_PARSER_FLAGS_OPTIONAL
27537 /* Check for an invalid type-name. */
27541 /* If there is no declarator, then the decl-specifier-seq should
27542 specify a type. */
27544 {
27545 /* If there was no decl-specifier-seq, and the next token is a
27546 `;', then we have something like:
27548 struct S { ; };
27550 [class.mem]
27552 Each member-declaration shall declare at least one member
27553 name of the class. */
27555 {
27558 {
27562 }
27563 }
27564 else
27565 {
27566 /* See if this declaration is a friend. */
27568 /* If there were decl-specifiers, check to see if there was
27569 a class-declaration. */
27572 /* Nested classes have already been added to the class, but
27573 a `friend' needs to be explicitly registered. */
27575 {
27576 /* If the `friend' keyword was present, the friend must
27577 be introduced with a class-key. */
27580 "in C++03 a class-key must be used "
27582 /* In this case:
27584 template <typename T> struct A {
27585 friend struct A<T>::B;
27586 };
27588 A<T>::B will be represented by a TYPENAME_TYPE, and
27589 therefore not recognized by check_tag_decl. */
27591 {
27595 }
27596 /* Warn if an attribute cannot appear here, as per
27597 [dcl.attr.grammar]/5. But not when declares_class_or_enum:
27598 we ignore attributes in elaborated-type-specifiers. */
27601 {
27606 "that appertains to a friend declaration that "
27608 }
27611 "friend declaration does not name a class or "
27613 else
27616 }
27617 /* If there is no TYPE, an error message will already have
27618 been issued. */
27620 ;
27621 /* An anonymous aggregate has to be handled specially; such
27622 a declaration really declares a data member (with a
27623 particular type), as opposed to a nested class. */
27625 {
27626 /* C++11 9.5/6. */
27629 "a storage class on an anonymous aggregate "
27632 /* Remove constructors and such from TYPE, now that we
27633 know it is an anonymous aggregate. */
27635 /* And make the corresponding data member. */
27638 /* Add it to the class. */
27640 }
27641 else
27642 cp_parser_check_access_in_redeclaration
27645 }
27646 }
27647 else
27648 {
27651 /* Clear attributes from the decl_specifiers but keep them
27652 around as prefix attributes that apply them to the entity
27653 being declared. */
27661 /* See if these declarations will be friends. */
27664 /* Keep going until we hit the `;' at the end of the
27665 declaration. */
27667 {
27669 tree first_attribute;
27670 tree initializer;
27673 /* Peek at the next token. */
27676 /* The following code wants to know early if it is a bit-field
27677 or some other declaration. Attributes can appear before
27678 the `:' token. Skip over them without consuming any tokens
27679 to peek if they are followed by `:'. */
27684 {
27685 size_t n
27688 }
27690 /* Check for a bitfield declaration. */
27696 {
27697 tree identifier;
27698 tree width;
27700 location_t id_location
27705 else
27708 /* Look for attributes that apply to the bitfield. */
27711 /* Consume the `:' token. */
27714 /* Get the width of the bitfield. */
27718 /* In C++20 and as extension for C++11 and above we allow
27719 default member initializers for bit-fields. */
27724 CPP_OPEN_BRACE)))
27725 {
27726 location_t loc
27731 "default member initializers for bit-fields "
27732 "only available with %<-std=c++20%> or "
27737 {
27741 }
27742 }
27743 else
27744 {
27745 /* Look for attributes that apply to the bitfield after
27746 the `:' token and width. This is where GCC used to
27747 parse attributes in the past, pedwarn if there is
27748 a std attribute. */
27751 "ISO C++ allows bit-field attributes only "
27755 }
27759 /* Remember which attributes are prefix attributes and
27760 which are not. */
27762 /* Combine the attributes. */
27765 /* Create the bitfield declaration. */
27768 identifier,
27769 sfk_none,
27770 id_location)
27774 attributes);
27775 }
27776 else
27777 {
27779 tree asm_specification;
27783 /* We can't delay parsing for friends,
27784 alias-declarations, and typedefs, even though the
27785 standard seems to require it. */
27790 /* Parse the declarator. */
27791 declarator
27793 flags,
27799 /* If something went wrong parsing the declarator, make sure
27800 that we at least consume some tokens. */
27802 {
27803 /* Skip to the end of the statement. */
27805 /* If the next token is not a semicolon, that is
27806 probably because we just skipped over the body of
27807 a function. So, we consume a semicolon if
27808 present, but do not issue an error message if it
27809 is not present. */
27811 CPP_SEMICOLON))
27814 }
27816 /* Handle class-scope non-template C++17 deduction guides. */
27819 declarator,
27823 cp_parser_check_for_definition_in_return_type
27827 /* Look for an asm-specification. */
27829 /* Look for attributes that apply to the declaration. */
27831 /* Remember which attributes are prefix attributes and
27832 which are not. */
27834 /* Combine the attributes. */
27837 /* If it's an `=', then we have a constant-initializer or a
27838 pure-specifier. It is not correct to parse the
27839 initializer before registering the member declaration
27840 since the member declaration should be in scope while
27841 its initializer is processed. However, the rest of the
27842 front end does not yet provide an interface that allows
27843 us to handle this correctly. */
27845 {
27846 /* In [class.mem]:
27848 A pure-specifier shall be used only in the declaration of
27849 a virtual function.
27851 A member-declarator can contain a constant-initializer
27852 only if it declares a static member of integral or
27853 enumeration type.
27855 Therefore, if the DECLARATOR is for a function, we look
27856 for a pure-specifier; otherwise, we look for a
27857 constant-initializer. When we call `grokfield', it will
27858 perform more stringent semantics checks. */
27871 {
27872 /* Don't require a constant rvalue in C++11, since we
27873 might want a reference constant. We'll enforce
27874 constancy later. */
27876 /* Parse the initializer. */
27878 }
27879 else
27880 /* Parse the initializer. */
27882 }
27885 {
27886 declarator->init_loc
27890 else
27892 }
27893 /* Detect invalid bit-field cases such as
27895 int *p : 4;
27896 int &&r : 3;
27898 and similar. */
27900 /* If there were no type specifiers, it was a
27901 constructor. */
27903 {
27904 /* This is called for a decent diagnostic only. */
27913 /* Avoid "extra ;" pedwarns. */
27915 CPP_SEMICOLON))
27918 }
27919 /* Otherwise, there is no initializer. */
27920 else
27923 /* See if we are probably looking at a function
27924 definition. We are certainly not looking at a
27925 member-declarator. Calling `grokfield' has
27926 side-effects, so we must not do it unless we are sure
27927 that we are looking at a member-declarator. */
27930 {
27931 /* The grammar does not allow a pure-specifier to be
27932 used when a member function is defined. (It is
27933 possible that this fact is an oversight in the
27934 standard, since a pure function may be defined
27935 outside of the class-specifier. */
27941 declarator,
27942 attributes);
27946 /* If the member was not a friend, declare it here. */
27949 /* Peek at the next token. */
27951 /* If the next token is a semicolon, consume it. */
27953 {
27954 location_t semicolon_loc
27959 "extra %<;%> after in-class "
27961 }
27963 }
27964 else
27968 /* Create the declaration. */
27974 {
27977 else
27979 }
27980 }
27985 /* Reset PREFIX_ATTRIBUTES. */
27987 {
27992 }
27994 /* If there is any qualification still in effect, clear it
27995 now; we will be starting fresh with the next declarator. */
27999 /* If it's a `,', then there are more declarators. */
28001 {
28004 {
28010 }
28011 }
28012 /* If the next token isn't a `;', then we have a parse error. */
28014 CPP_SEMICOLON))
28015 {
28016 /* The next token might be a ways away from where the
28017 actual semicolon is missing. Find the previous token
28018 and use that for our error position. */
28025 /* Assume that the user meant to provide a semicolon. If
28026 we were to cp_parser_skip_to_end_of_statement, we might
28027 skip to a semicolon inside a member function definition
28028 and issue nonsensical error messages. */
28030 }
28033 {
28034 /* Add DECL to the list of members. */
28036 /* Explicitly include, eg, NSDMIs, for better error
28037 recovery (c++/58650). */
28045 /* Add DECL to the queue of NSDMI to be parsed later. */
28047 }
28051 }
28052 }
28055 out:
28058 }
28060 /* Parse a pure-specifier.
28062 pure-specifier:
28063 = 0
28065 Returns INTEGER_ZERO_NODE if a pure specifier is found.
28066 Otherwise, ERROR_MARK_NODE is returned. */
28068 static tree
28070 {
28073 /* Look for the `=' token. */
28076 /* Look for the `0' token. */
28085 /* Accept = default or = delete in c++0x mode. */
28088 {
28091 }
28093 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
28095 {
28100 }
28102 {
28105 }
28108 }
28110 /* Parse a constant-initializer.
28112 constant-initializer:
28113 = constant-expression
28115 Returns a representation of the constant-expression. */
28117 static tree
28119 {
28120 /* Look for the `=' token. */
28124 /* It is invalid to write:
28126 struct S { static const int i = { 7 }; };
28128 */
28130 {
28133 /* Consume the opening brace. */
28134 matching_braces braces;
28136 /* Skip the initializer. */
28138 /* Look for the trailing `}'. */
28142 }
28145 }
28147 /* Derived classes [gram.class.derived] */
28149 /* Parse a base-clause.
28151 base-clause:
28152 : base-specifier-list
28154 base-specifier-list:
28155 base-specifier ... [opt]
28156 base-specifier-list , base-specifier ... [opt]
28158 Returns a TREE_LIST representing the base-classes, in the order in
28159 which they were declared. The representation of each node is as
28160 described by cp_parser_base_specifier.
28162 In the case that no bases are specified, this function will return
28163 NULL_TREE, not ERROR_MARK_NODE. */
28165 static tree
28167 {
28170 /* Look for the `:' that begins the list. */
28173 /* Scan the base-specifier-list. */
28175 {
28177 tree base;
28180 /* Look for the base-specifier. */
28182 /* Look for the (optional) ellipsis. */
28184 {
28185 /* Consume the `...'. */
28189 }
28191 /* Add BASE to the front of the list. */
28193 {
28195 /* Make this a pack expansion type. */
28199 {
28202 }
28203 }
28204 /* Peek at the next token. */
28206 /* If it's not a comma, then the list is complete. */
28209 /* Consume the `,'. */
28211 }
28213 /* PARSER->SCOPE may still be non-NULL at this point, if the last
28214 base class had a qualified name. However, the next name that
28215 appears is certainly not qualified. */
28221 }
28223 /* Parse a base-specifier.
28225 base-specifier:
28226 :: [opt] nested-name-specifier [opt] class-name
28227 virtual access-specifier [opt] :: [opt] nested-name-specifier
28228 [opt] class-name
28229 access-specifier virtual [opt] :: [opt] nested-name-specifier
28230 [opt] class-name
28232 Returns a TREE_LIST. The TREE_PURPOSE will be one of
28233 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
28234 indicate the specifiers provided. The TREE_VALUE will be a TYPE
28235 (or the ERROR_MARK_NODE) indicating the type that was specified. */
28237 static tree
28239 {
28247 tree type;
28249 /* Process the optional `virtual' and `access-specifier'. */
28251 {
28252 /* Peek at the next token. */
28254 /* Process `virtual'. */
28256 {
28258 /* If `virtual' appears more than once, issue an error. */
28260 {
28264 }
28268 /* Consume the `virtual' token. */
28276 /* If more than one access specifier appears, issue an
28277 error. */
28280 {
28284 }
28288 /* Consume the access-specifier. */
28296 }
28297 }
28298 /* It is not uncommon to see programs mechanically, erroneously, use
28299 the 'typename' keyword to denote (dependent) qualified types
28300 as base classes. */
28302 {
28307 else
28309 "keyword %<typename%> not allowed in this context "
28312 }
28314 /* Look for the optional `::' operator. */
28316 /* Look for the nested-name-specifier. The simplest way to
28317 implement:
28319 [temp.res]
28321 The keyword `typename' is not permitted in a base-specifier or
28322 mem-initializer; in these contexts a qualified name that
28323 depends on a template-parameter is implicitly assumed to be a
28324 type name.
28326 is to pretend that we have seen the `typename' keyword at this
28327 point. */
28333 /* If the base class is given by a qualified name, assume that names
28334 we see are type names or templates, as appropriate. */
28340 /* DR 950 allows decltype as a base-specifier. */
28342 else
28343 {
28344 /* Otherwise, look for the class-name. */
28346 class_scope_p,
28347 template_p,
28348 typename_type,
28353 }
28359 }
28361 /* Exception handling [gram.exception] */
28363 /* Save the tokens that make up the noexcept-specifier for a member-function.
28364 Returns a DEFERRED_PARSE. */
28366 static tree
28368 {
28370 /* We want everything up to, including, the final ')'. */
28374 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
28375 to carry the information we will need. */
28377 /* Save away the noexcept-specifier; we will process it when the
28378 class is complete. */
28383 }
28385 /* Used for late processing of noexcept-specifiers of member-functions.
28386 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
28387 we saved for later; parse it now. DECL is the declaration of the
28388 member function. */
28390 static tree
28392 {
28393 /* Make sure we've gotten something that hasn't been parsed yet. */
28398 /* Push the saved tokens for the noexcept-specifier onto the parser's
28399 lexer stack. */
28403 /* Parse the cached noexcept-specifier. */
28404 tree parsed_arg
28406 CP_PARSER_FLAGS_NONE,
28411 /* Revert to the main lexer. */
28414 /* Restore the queue. */
28417 /* And we're done. */
28419 }
28421 /* Perform late checking of overriding function with respect to their
28422 noexcept-specifiers. FNDECL is the member function that potentially
28423 overrides some virtual function with the same signature. */
28425 static void
28427 {
28429 tree base_binfo;
28435 {
28444 }
28445 }
28447 /* Parse an (optional) noexcept-specification.
28449 noexcept-specification:
28450 noexcept ( constant-expression ) [opt]
28452 If no noexcept-specification is present, returns NULL_TREE.
28453 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
28454 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
28455 there are no parentheses. CONSUMED_EXPR will be set accordingly.
28456 Otherwise, returns a noexcept specification unless RETURN_COND is true,
28457 in which case a boolean condition is returned instead. The parser flags
28458 FLAGS is used to control parsing. QUALS are qualifiers indicating whether
28459 the (member) function is `const'. */
28461 static tree
28463 cp_parser_flags flags,
28467 {
28471 /* Peek at the next token. */
28474 /* Is it a noexcept-specification? */
28476 {
28477 tree expr;
28479 /* [class.mem]/6 says that a noexcept-specifer (within the
28480 member-specification of the class) is a complete-class context of
28481 a class. So, if the noexcept-specifier has the optional expression,
28482 just save the tokens, and reparse this after we're done with the
28483 class. */
28487 /* No need to delay parsing for a number literal or true/false. */
28499 {
28500 matching_parens parens;
28504 {
28505 /* Types may not be defined in an exception-specification. */
28507 parser->type_definition_forbidden_message
28511 expr
28517 {
28520 }
28522 /* Restore the saved message. */
28524 }
28525 else
28526 {
28529 }
28532 }
28533 else
28534 {
28538 }
28540 /* We cannot build a noexcept-spec right away because this will check
28541 that expr is a constexpr. */
28544 else
28546 }
28547 else
28549 }
28551 /* Parse an (optional) exception-specification.
28553 exception-specification:
28554 throw ( type-id-list [opt] )
28556 Returns a TREE_LIST representing the exception-specification. The
28557 TREE_VALUE of each node is a type. The parser flags FLAGS is used to
28558 control parsing. QUALS are qualifiers indicating whether the (member)
28559 function is `const'. */
28561 static tree
28563 cp_parser_flags flags)
28564 {
28566 tree type_id_list;
28569 /* Peek at the next token. */
28572 /* Is it a noexcept-specification? */
28573 type_id_list
28581 /* If it's not `throw', then there's no exception-specification. */
28587 /* Consume the `throw'. */
28590 /* Look for the `('. */
28591 matching_parens parens;
28594 /* Peek at the next token. */
28596 /* If it's not a `)', then there is a type-id-list. */
28598 {
28599 /* Types may not be defined in an exception-specification. */
28601 parser->type_definition_forbidden_message
28603 /* Parse the type-id-list. */
28605 /* Restore the saved message. */
28609 {
28613 }
28616 "dynamic exception specifications are deprecated in "
28618 }
28619 /* In C++17, throw() is equivalent to noexcept (true). throw()
28620 is deprecated in C++11 and above as well, but is still widely used,
28621 so don't warn about it yet. */
28624 else
28627 /* Look for the `)'. */
28631 }
28633 /* Parse an (optional) type-id-list.
28635 type-id-list:
28636 type-id ... [opt]
28637 type-id-list , type-id ... [opt]
28639 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
28640 in the order that the types were presented. */
28642 static tree
28644 {
28648 {
28650 tree type;
28654 /* Get the next type-id. */
28656 /* Check for invalid 'auto'. */
28658 {
28662 }
28663 /* Parse the optional ellipsis. */
28665 {
28666 /* Consume the `...'. */
28669 /* Turn the type into a pack expansion expression. */
28671 }
28672 /* Add it to the list. */
28674 /* Peek at the next token. */
28676 /* If it is not a `,', we are done. */
28679 /* Consume the `,'. */
28681 }
28684 }
28686 /* Parse a try-block.
28688 try-block:
28689 try compound-statement handler-seq */
28691 static tree
28693 {
28694 tree try_block;
28701 "%<try%> in %<constexpr%> function only "
28711 }
28713 /* Parse a function-try-block.
28715 function-try-block:
28716 try ctor-initializer [opt] function-body handler-seq */
28718 static void
28720 {
28721 tree compound_stmt;
28722 tree try_block;
28724 /* Look for the `try' keyword. */
28727 /* Let the rest of the front end know where we are. */
28729 /* Parse the function-body. */
28730 cp_parser_ctor_initializer_opt_and_function_body
28732 /* We're done with the `try' part. */
28734 /* Parse the handlers. */
28736 /* We're done with the handlers. */
28738 }
28740 /* Parse a handler-seq.
28742 handler-seq:
28743 handler handler-seq [opt] */
28745 static void
28747 {
28749 {
28752 /* Parse the handler. */
28754 /* Peek at the next token. */
28756 /* If it's not `catch' then there are no more handlers. */
28759 }
28760 }
28762 /* Parse a handler.
28764 handler:
28765 catch ( exception-declaration ) compound-statement */
28767 static void
28769 {
28770 tree handler;
28771 tree declaration;
28775 matching_parens parens;
28782 }
28784 /* Parse an exception-declaration.
28786 exception-declaration:
28787 type-specifier-seq declarator
28788 type-specifier-seq abstract-declarator
28789 type-specifier-seq
28790 ...
28792 Returns a VAR_DECL for the declaration, or NULL_TREE if the
28793 ellipsis variant is used. */
28795 static tree
28797 {
28798 cp_decl_specifier_seq type_specifiers;
28802 /* If it's an ellipsis, it's easy to handle. */
28804 {
28805 /* Consume the `...' token. */
28808 }
28810 /* Types may not be defined in exception-declarations. */
28812 parser->type_definition_forbidden_message
28815 /* Parse the type-specifier-seq. */
28820 /* If it's a `)', then there is no declarator. */
28823 else
28825 CP_PARSER_FLAGS_NONE,
28832 /* Restore the saved message. */
28839 }
28841 /* Parse a throw-expression.
28843 throw-expression:
28844 throw assignment-expression [opt]
28846 Returns a THROW_EXPR representing the throw-expression. */
28848 static tree
28850 {
28851 tree expression;
28857 /* Figure out whether or not there is an assignment-expression
28858 following the "throw" keyword. */
28866 else
28869 /* Construct a location e.g.:
28870 throw x
28871 ^~~~~~~
28872 with caret == start at the start of the "throw" token, and
28873 the end at the end of the final token we consumed. */
28879 }
28881 /* Parse a yield-expression.
28883 yield-expression:
28884 co_yield assignment-expression
28885 co_yield braced-init-list
28887 Returns a CO_YIELD_EXPR representing the yield-expression. */
28889 static tree
28891 {
28892 tree expr;
28900 {
28902 /* ??? : probably a moot point? */
28905 }
28906 else
28913 }
28915 /* GNU Extensions */
28917 /* Parse an (optional) asm-specification.
28919 asm-specification:
28920 asm ( string-literal )
28922 If the asm-specification is present, returns a STRING_CST
28923 corresponding to the string-literal. Otherwise, returns
28924 NULL_TREE. */
28926 static tree
28928 {
28929 /* Peek at the next token. */
28931 /* If the next token isn't the `asm' keyword, then there's no
28932 asm-specification. */
28936 /* Consume the `asm' token. */
28938 /* Look for the `('. */
28939 matching_parens parens;
28942 /* Look for the string-literal. */
28947 /* Look for the `)'. */
28951 }
28953 /* Parse an asm-operand-list.
28955 asm-operand-list:
28956 asm-operand
28957 asm-operand-list , asm-operand
28959 asm-operand:
28960 string-literal ( expression )
28961 [ string-literal ] string-literal ( expression )
28963 Returns a TREE_LIST representing the operands. The TREE_VALUE of
28964 each node is the expression. The TREE_PURPOSE is itself a
28965 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
28966 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
28967 is a STRING_CST for the string literal before the parenthesis. Returns
28968 ERROR_MARK_NODE if any of the operands are invalid. */
28970 static tree
28972 {
28977 {
28978 tree name;
28981 {
28982 /* Consume the `[' token. */
28984 /* Read the operand name. */
28989 /* Look for the closing `]'. */
28991 }
28992 else
28994 /* Look for the string-literal. */
28999 /* Look for the `('. */
29000 matching_parens parens;
29002 /* Parse the expression. */
29004 /* Look for the `)'. */
29012 /* Add this operand to the list. */
29014 expression,
29015 asm_operands);
29016 /* If the next token is not a `,', there are no more
29017 operands. */
29020 /* Consume the `,'. */
29022 }
29025 }
29027 /* Parse an asm-clobber-list.
29029 asm-clobber-list:
29030 string-literal
29031 asm-clobber-list , string-literal
29033 Returns a TREE_LIST, indicating the clobbers in the order that they
29034 appeared. The TREE_VALUE of each node is a STRING_CST. */
29036 static tree
29038 {
29042 {
29043 /* Look for the string literal. */
29047 /* Add it to the list. */
29049 /* If the next token is not a `,', then the list is
29050 complete. */
29053 /* Consume the `,' token. */
29055 }
29058 }
29060 /* Parse an asm-label-list.
29062 asm-label-list:
29063 identifier
29064 asm-label-list , identifier
29066 Returns a TREE_LIST, indicating the labels in the order that they
29067 appeared. The TREE_VALUE of each node is a label. */
29069 static tree
29071 {
29075 {
29078 /* Look for the identifier. */
29081 {
29084 {
29090 }
29091 }
29092 /* If the next token is not a `,', then the list is
29093 complete. */
29096 /* Consume the `,' token. */
29098 }
29101 }
29103 /* Return TRUE iff the next tokens in the stream are possibly the
29104 beginning of a GNU extension attribute. */
29106 static bool
29108 {
29110 }
29112 /* Return TRUE iff the next tokens in the stream are possibly the
29113 beginning of a standard C++-11 attribute specifier. */
29115 static bool
29117 {
29119 }
29121 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29122 beginning of a standard C++-11 attribute specifier. */
29124 static bool
29126 {
29134 }
29136 /* Return TRUE iff the next Nth tokens in the stream are possibly the
29137 beginning of a GNU extension attribute. */
29139 static bool
29141 {
29145 }
29147 /* Return true iff the next tokens can be the beginning of either a
29148 GNU attribute list, or a standard C++11 attribute sequence. */
29150 static bool
29152 {
29155 }
29157 /* Return true iff the next Nth tokens can be the beginning of either
29158 a GNU attribute list, or a standard C++11 attribute sequence. */
29160 static bool
29162 {
29165 }
29167 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
29168 of GNU attributes, or return NULL. */
29170 static tree
29172 {
29175 {
29180 else
29182 }
29184 }
29186 /* Parse an (optional) series of attributes.
29188 attributes:
29189 attributes attribute
29191 attribute:
29192 __attribute__ (( attribute-list [opt] ))
29194 The return value is as for cp_parser_gnu_attribute_list. */
29196 static tree
29198 {
29205 {
29207 tree attribute_list;
29210 /* Peek at the next token. */
29212 /* If it's not `__attribute__', then we're done. */
29216 /* Consume the `__attribute__' keyword. */
29218 /* Look for the two `(' tokens. */
29219 matching_parens outer_parens;
29222 matching_parens inner_parens;
29226 /* Peek at the next token. */
29229 /* Parse the attribute-list. */
29231 else
29232 /* If the next token is a `)', then there is no attribute
29233 list. */
29236 /* Look for the two `)' tokens. */
29244 /* Add these new attributes to the list. */
29246 }
29249 }
29251 /* Parse a GNU attribute-list.
29253 attribute-list:
29254 attribute
29255 attribute-list , attribute
29257 attribute:
29258 identifier
29259 identifier ( identifier )
29260 identifier ( identifier , expression-list )
29261 identifier ( expression-list )
29263 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
29264 to an attribute. The TREE_PURPOSE of each node is the identifier
29265 indicating which attribute is in use. The TREE_VALUE represents
29266 the arguments, if any. */
29268 static tree
29270 {
29274 /* Don't create wrapper nodes within attributes: the
29275 handlers don't know how to handle them. */
29276 auto_suppress_location_wrappers sentinel;
29280 {
29282 tree identifier;
29283 tree attribute;
29285 /* Look for the identifier. We also allow keywords here; for
29286 example `__attribute__ ((const))' is legal. */
29290 {
29293 /* Consume the token, but save it since we need it for the
29294 SIMD enabled function parsing. */
29297 /* Save away the identifier that indicates which attribute
29298 this is. */
29300 /* For keywords, use the canonical spelling, not the
29301 parsed identifier. */
29308 /* Peek at the next token. */
29310 /* If it's an `(', then parse the attribute arguments. */
29312 {
29318 vec = cp_parser_parenthesized_expression_list
29324 else
29325 {
29328 }
29329 /* Save the arguments away. */
29331 }
29334 {
29335 /* Add this attribute to the list. */
29338 }
29341 }
29342 /* Unless EXACTLY_ONE is set look for more attributes.
29343 If the next token isn't a `,', we're done. */
29347 /* Consume the comma and keep going. */
29349 }
29352 /* We built up the list in reverse order. */
29354 }
29356 /* Parse arguments of omp::directive attribute.
29358 ( directive-name ,[opt] clause-list[opt] )
29360 For directive just remember the first/last tokens for subsequent
29361 parsing. */
29363 static void
29365 {
29368 {
29374 }
29377 {
29383 }
29392 }
29394 /* Parse arguments of omp::sequence attribute.
29396 ( omp::[opt] directive-attr [ , omp::[opt] directive-attr ]... ) */
29398 static void
29400 {
29401 matching_parens parens;
29403 do
29404 {
29409 {
29413 }
29418 else
29423 {
29432 }
29436 UNKNOWN_LOCATION);
29439 else
29444 }
29449 }
29451 /* Parse a standard C++11 attribute.
29453 The returned representation is a TREE_LIST which TREE_PURPOSE is
29454 the scoped name of the attribute, and the TREE_VALUE is its
29455 arguments list.
29457 Note that the scoped name of the attribute is itself a TREE_LIST
29458 which TREE_PURPOSE is the namespace of the attribute, and
29459 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
29460 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
29461 and which TREE_PURPOSE is directly the attribute name.
29463 Clients of the attribute code should use get_attribute_namespace
29464 and get_attribute_name to get the actual namespace and name of
29465 attributes, regardless of their being GNU or C++11 attributes.
29467 attribute:
29468 attribute-token attribute-argument-clause [opt]
29470 attribute-token:
29471 identifier
29472 attribute-scoped-token
29474 attribute-scoped-token:
29475 attribute-namespace :: identifier
29477 attribute-namespace:
29478 identifier
29480 attribute-argument-clause:
29481 ( balanced-token-seq )
29483 balanced-token-seq:
29484 balanced-token [opt]
29485 balanced-token-seq balanced-token
29487 balanced-token:
29488 ( balanced-token-seq )
29489 [ balanced-token-seq ]
29490 { balanced-token-seq }. */
29492 static tree
29494 {
29501 /* First, parse name of the attribute, a.k.a attribute-token. */
29518 {
29519 /* We are seeing a scoped attribute token. */
29534 else
29535 {
29539 }
29545 NULL_TREE);
29547 }
29549 {
29553 NULL_TREE);
29554 }
29555 else
29556 {
29559 NULL_TREE);
29561 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
29562 but no longer: we have to be able to tell [[noreturn]] and
29563 __attribute__((noreturn)) apart. */
29564 /* C++14 deprecated attribute is equivalent to GNU's. */
29567 /* C++17 fallthrough attribute is equivalent to GNU's. */
29570 /* C++23 assume attribute is equivalent to GNU's. */
29573 /* Transactional Memory TS optimize_for_synchronized attribute is
29574 equivalent to GNU transaction_callable. */
29578 /* Transactional Memory attributes are GNU attributes. */
29581 }
29583 /* Now parse the optional argument clause of the attribute. */
29586 {
29591 {
29593 attr_id);
29595 }
29597 }
29599 {
29603 /* Maybe we don't expect to see any arguments for this attribute. */
29607 {
29609 attr_id);
29615 }
29619 /* The assume attribute needs special handling of the argument. */
29623 /* A GNU attribute that takes an identifier in parameter. */
29626 /* If this is a fake attribute created to handle -Wno-attributes,
29627 we must skip parsing the arguments. */
29629 {
29631 {
29633 {
29636 }
29638 {
29644 }
29645 }
29647 /* For unknown attributes, just skip balanced tokens instead of
29648 trying to parse the arguments. Set TREE_VALUE (attribute) to
29649 error_mark_node to distinguish skipped arguments from attributes
29650 with no arguments. */
29655 }
29657 vec = cp_parser_parenthesized_expression_list
29663 else
29664 {
29666 /* e.g. [[attr()]]. */
29669 attr_id);
29672 }
29676 else
29678 }
29681 }
29683 /* Warn if the attribute ATTRIBUTE appears more than once in the
29684 attribute-list ATTRIBUTES. This used to be enforced for certain
29685 attributes, but the restriction was removed in P2156.
29686 LOC is the location of ATTRIBUTE. Returns true if ATTRIBUTE was not
29687 found in ATTRIBUTES. */
29689 static bool
29691 {
29700 {
29705 }
29707 }
29709 /* Parse a list of standard C++-11 attributes.
29711 attribute-list:
29712 attribute [opt]
29713 attribute-list , attribute[opt]
29714 attribute ...
29715 attribute-list , attribute ...
29716 */
29718 static tree
29720 {
29725 {
29731 {
29733 {
29736 }
29737 }
29740 {
29746 {
29750 }
29752 {
29757 }
29759 }
29763 }
29766 }
29768 /* Optionally parse a C++20 contract role. A NULL return means that no
29769 contract role was specified.
29771 contract-role:
29772 % default
29773 % identifier
29775 If the identifier does not name a known contract role, it will
29776 be assumed to be default. Returns the identifier for the role
29777 token. */
29779 static tree
29781 {
29791 else
29792 {
29795 }
29798 /* FIXME: Warn about invalid/unknown roles? */
29800 }
29802 /* Parse an optional contract mode.
29804 contract-mode:
29805 contract-semantic
29806 [contract-level] [contract-role]
29808 contract-semantic:
29809 check_never_continue
29810 check_maybe_continue
29811 check_always_continue
29813 contract-level:
29814 default
29815 audit
29816 axiom
29818 contract-role:
29819 default
29820 identifier
29822 This grammar is taken from P1332R0. During parsing, this sets options
29823 on the MODE object to determine the configuration of the contract.
29825 Returns a tree containing the identifiers used in the configuration.
29826 This is either an IDENTIFIER with the literal semantic or a TREE_LIST
29827 whose TREE_VALUE is the contract-level and whose TREE_PURPOSE is the
29828 contract-role, if any. NULL_TREE is returned if no information is
29829 given (i.e., all defaults selected). */
29831 static tree
29834 {
29835 /* The mode is empty; the level and role are default. */
29839 /* There is only a role; the level is default. */
29841 {
29844 }
29846 /* Otherwise, match semantic or level. */
29850 tree config_id;
29852 {
29855 /* Either a named level, a concrete semantic, or an identifier
29856 for a postcondition. */
29861 /* The identifier is the return value for a postcondition. */
29865 }
29867 {
29870 }
29871 else
29872 {
29873 /* We got some other token other than a ':'. */
29876 }
29878 /* Consume the literal semantic or level token. */
29882 {
29884 "expected contract level: "
29887 }
29889 /* We matched an explicit semantic. */
29891 {
29893 {
29897 }
29899 }
29901 /* We matched a level, there may be a role; otherwise this is default. */
29903 {
29906 }
29909 }
29911 static tree
29913 {
29917 }
29919 static bool
29921 {
29923 }
29925 /* Parse a standard C++20 contract attribute specifier.
29927 contract-attribute-specifier:
29928 [ [ assert contract-level [opt] : conditional-expression ] ]
29929 [ [ pre contract-level [opt] : conditional-expression ] ]
29930 [ [ post contract-level [opt] identifier [opt] : conditional-expression ] ]
29932 For free functions, we cannot determine the type of the postcondition
29933 identifier because the we haven't called grokdeclarator yet. In those
29934 cases we parse the postcondition as if the identifier was declared as
29935 'auto <identifier>'. We then instantiate the postcondition once the
29936 return type is known.
29938 For member functions, contracts are in the complete-class context, so the
29939 parse is deferred. We also have the return type avaialable (unless it's
29940 deduced), so we don't need to parse the postcondition in terms of a
29941 placeholder. */
29943 static tree
29945 {
29953 /* Parse the optional mode. */
29956 /* Check for postcondition identifiers. */
29957 cp_expr identifier;
29965 /* Defer the parsing of pre/post contracts inside class definitions. */
29966 tree contract;
29968 current_class_type &&
29970 {
29971 /* Skip until we reach an unenclose ']'. If we ran into an unnested ']'
29972 that doesn't close the attribute, return an error and let the attribute
29973 handling code emit an error for missing ']]'. */
29977 CPP_CLOSE_SQUARE,
29984 /* Build a deferred-parse node. */
29989 /* And its corresponding contract. */
29991 }
29992 else
29993 {
29994 /* Enable location wrappers when parsing contracts. */
29997 /* Build a fake variable for the result identifier. */
30000 {
30004 }
30006 /* Parse the condition, ensuring that parameters or the return variable
30007 aren't flagged for use outside the body of a function. */
30012 /* Try to recover from errors by scanning up to the end of the
30013 attribute. Sometimes we get partially parsed expressions, so
30014 we need to search the condition for errors. */
30018 /* Build the contract. */
30021 /* Leave our temporary scope for the postcondition result. */
30023 {
30026 }
30027 }
30030 {
30033 }
30036 }
30038 /* Parse a contract condition for a deferred contract. */
30041 tree fn,
30042 tree attribute)
30043 {
30046 /* Make sure we've gotten something that hasn't been parsed yet or that
30047 we're not parsing an invalid contract. */
30056 /* Build a fake variable for the result identifier. */
30059 {
30060 /* TODO: Can we guarantee that the identifier has a location? */
30064 {
30067 }
30072 }
30074 /* 'this' is not allowed in preconditions of constructors or in postconditions
30075 of destructors. Note that the previous value of this variable is
30076 established by the calling function, so we need to save it here. */
30081 {
30084 }
30088 /* Push the saved tokens onto the parser's lexer stack. */
30092 /* Parse the condition, ensuring that parameters or the return variable
30093 aren't flagged for use outside the body of a function. */
30098 /* Revert to the main lexer. */
30101 /* Restore the queue. */
30107 /* Commit to changes. */
30110 /* Leave our temporary scope for the postcondition result. */
30112 {
30115 }
30116 }
30118 /* Parse a standard C++-11 attribute specifier.
30120 attribute-specifier:
30121 [ [ attribute-using-prefix [opt] attribute-list ] ]
30122 contract-attribute-specifier
30123 alignment-specifier
30125 attribute-using-prefix:
30126 using attribute-namespace :
30128 alignment-specifier:
30129 alignas ( type-id ... [opt] )
30130 alignas ( alignment-expression ... [opt] ).
30132 Extensions for contracts:
30134 contract-attribute-specifier:
30135 [ [ assert : contract-mode [opt] : conditional-expression ] ]
30136 [ [ pre : contract-mode [opt] : conditional-expression ] ]
30137 [ [ post : contract-mode [opt] identifier [opt] :
30138 conditional-expression ] ] */
30140 static tree
30142 {
30148 {
30157 {
30160 }
30162 /* Handle contract-attribute-specs specially. */
30164 {
30169 }
30172 {
30183 {
30186 "attribute using prefix only available "
30192 }
30193 else
30195 }
30199 finish_attrs:
30203 else
30204 /* Warn about parsing c++11 attribute in non-c++11 mode, only
30205 when we are sure that we have actually parsed them. */
30207 }
30208 else
30209 {
30210 tree alignas_expr;
30212 /* Look for an alignment-specifier. */
30223 matching_parens parens;
30231 {
30238 }
30243 /* Handle alignas (pack...). */
30245 {
30248 }
30250 /* Something went wrong, so don't build the attribute. */
30254 /* Missing ')' means the code cannot possibly be valid; go ahead
30255 and commit to make sure we issue a hard error. */
30263 /* Build the C++-11 representation of an 'aligned'
30264 attribute. */
30265 attributes
30268 }
30271 }
30273 /* Parse a standard C++-11 attribute-specifier-seq.
30275 attribute-specifier-seq:
30276 attribute-specifier-seq [opt] attribute-specifier */
30278 static tree
30280 {
30284 /* Don't create wrapper nodes within attributes: the
30285 handlers don't know how to handle them. */
30286 auto_suppress_location_wrappers sentinel;
30289 {
30298 else
30301 }
30304 }
30306 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
30307 return index of the first token after balanced-token, or N on failure. */
30309 static size_t
30311 {
30314 do
30316 {
30320 /* FALLTHRU */
30322 /* Ran out of tokens. */
30344 }
30347 }
30349 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
30350 return index of the first token after the GNU attribute tokens, or N on
30351 failure. */
30353 static size_t
30355 {
30357 {
30369 }
30371 }
30373 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
30374 next token), return index of the first token after the standard C++11
30375 attribute tokens, or N on failure. */
30377 static size_t
30379 {
30381 {
30384 {
30391 }
30394 {
30399 }
30400 else
30402 }
30404 }
30406 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
30407 as the next token), return index of the first token after the attribute
30408 tokens, or N on failure. */
30410 static size_t
30412 {
30416 }
30418 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
30419 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
30420 current value of the PEDANTIC flag, regardless of whether or not
30421 the `__extension__' keyword is present. The caller is responsible
30422 for restoring the value of the PEDANTIC flag. */
30424 static bool
30426 {
30427 /* Save the old value of the PEDANTIC flag. */
30431 {
30432 /* Consume the `__extension__' token. */
30434 /* We're not being pedantic while the `__extension__' keyword is
30435 in effect. */
30439 }
30442 }
30444 /* Parse a label declaration.
30446 label-declaration:
30447 __label__ label-declarator-seq ;
30449 label-declarator-seq:
30450 identifier , label-declarator-seq
30451 identifier */
30453 static void
30455 {
30456 /* Look for the `__label__' keyword. */
30460 {
30461 tree identifier;
30463 /* Look for an identifier. */
30465 /* If we failed, stop. */
30468 /* Declare it as a label. */
30470 /* If the next token is a `;', stop. */
30473 /* Look for the `,' separating the label declarations. */
30475 }
30477 /* Look for the final `;'. */
30479 }
30481 // -------------------------------------------------------------------------- //
30482 // Concept definitions
30484 static tree
30486 {
30487 /* A concept definition is an unevaluated context. */
30488 cp_unevaluated u;
30495 {
30499 }
30504 {
30508 }
30510 processing_constraint_expression_sentinel parsing_constraint;
30515 /* Consume the trailing ';'. Diagnose the problem if it isn't there,
30516 but continue as if it were. */
30520 }
30522 // -------------------------------------------------------------------------- //
30523 // Requires Clause
30525 /* Diagnose an expression that should appear in ()'s within a requires-clause
30526 and suggest where to place those parentheses. */
30528 static void
30530 {
30532 }
30534 static void
30536 {
30541 }
30543 /* Characterizes the likely kind of expression intended by a mis-written
30544 primary constraint. */
30545 enum primary_constraint_error
30546 {
30547 pce_ok,
30548 pce_maybe_operator,
30549 pce_maybe_postfix
30550 };
30552 /* Returns true if the token(s) following a primary-expression in a
30553 constraint-logical-* expression would require parentheses. */
30555 static primary_constraint_error
30557 {
30560 {
30565 {
30566 /* An equal sign may be part of the definition of a function,
30567 and not an assignment operator, when parsing the expression
30568 for a trailing requires-clause. For example:
30570 template<typename T>
30571 struct S {
30572 S() requires C<T> = default;
30573 };
30575 Don't try to reparse this a binary operator. */
30581 }
30583 /* Arithmetic operators. */
30589 /* Bitwise operators. */
30595 /* Relational operators. */
30603 /* Pointer-to-member. */
30606 /* Assignment operators. */
30617 /* Conditional operator */
30619 /* Unenclosed binary or conditional operator. */
30623 {
30624 /* A primary constraint that precedes the parameter-list of a
30625 lambda expression is followed by an open paren.
30627 []<typename T> requires C (T a, T b) { ... }
30629 Don't try to re-parse this as a postfix expression. */
30634 }
30636 {
30637 /* A primary-constraint-expression followed by a '[[' is not a
30638 postfix expression. */
30643 }
30647 /* Unenclosed postfix operator. */
30651 /* A primary constraint that precedes the lambda-declarator of a
30652 lambda expression is followed by trailing return type.
30654 []<typename T> requires C -> void {}
30656 Don't try to re-parse this as a postfix expression in
30657 C++23 and later. In C++20 ( needs to come in between but we
30658 allow it to be omitted with pedwarn. */
30661 /* Unenclosed postfix operator. */
30663 }
30664 }
30666 /* Returns true if the next token begins a unary expression, preceded by
30667 an operator or keyword. */
30669 static bool
30671 {
30674 {
30685 {
30687 {
30703 }
30704 }
30708 }
30711 }
30713 /* Parse a primary expression within a constraint. */
30715 static cp_expr
30717 {
30718 /* If this looks like a unary expression, parse it as such, but diagnose
30719 it as ill-formed; it requires parens. */
30721 {
30725 }
30728 cp_id_kind idk;
30739 {
30740 /* The primary-expression could be part of an unenclosed non-logical
30741 compound expression. */
30743 }
30745 {
30748 }
30750 /* Retry the parse at a lower precedence. If that succeeds, diagnose the
30751 error, but return the expression as if it were valid. */
30756 else
30759 {
30762 }
30764 /* Otherwise, something has gone very wrong, and we can't generate a more
30765 meaningful diagnostic or recover. */
30768 }
30770 /* Parse a constraint-logical-and-expression.
30772 constraint-logical-and-expression:
30773 primary-expression
30774 constraint-logical-and-expression '&&' primary-expression */
30776 static cp_expr
30778 {
30781 {
30785 }
30787 }
30789 /* Parse a constraint-logical-or-expression.
30791 constraint-logical-or-expression:
30792 constraint-logical-and-expression
30793 constraint-logical-or-expression '||' constraint-logical-and-expression */
30795 static cp_expr
30797 {
30800 {
30804 }
30806 }
30808 /* Parse the expression after a requires-clause. This has a different grammar
30809 than that in the concepts TS. */
30811 static tree
30813 {
30814 processing_constraint_expression_sentinel parsing_constraint;
30821 }
30823 /* Parse a expression after a requires clause.
30825 constraint-expression:
30826 logical-or-expression
30828 The required logical-or-expression must be a constant expression. Note
30829 that we don't check that the expression is constepxr here. We defer until
30830 we analyze constraints and then, we only check atomic constraints. */
30832 static tree
30834 {
30835 processing_constraint_expression_sentinel parsing_constraint;
30844 }
30846 /* Optionally parse a requires clause:
30848 requires-clause:
30849 `requires` constraint-logical-or-expression.
30850 [ConceptsTS]
30851 `requires constraint-expression.
30853 LAMBDA_P is true when the requires-clause is parsed before the
30854 parameter-list of a lambda-declarator. */
30856 static tree
30858 {
30859 /* A requires clause is an unevaluated context. */
30860 cp_unevaluated u;
30864 {
30867 {
30869 "%<requires%> only available with "
30871 /* Parse and discard the requires-clause. */
30874 }
30876 }
30880 {
30881 /* An opening brace following the start of a requires-clause is
30882 ill-formed; the user likely forgot the second `requires' that
30883 would start a requires-expression. */
30888 /* Don't consume the `requires', so that it's reused as the start of a
30889 requires-expression. */
30890 }
30891 else
30896 else
30898 }
30900 /*---------------------------------------------------------------------------
30901 Requires expressions
30902 ---------------------------------------------------------------------------*/
30904 /* Parse a requires expression
30906 requirement-expression:
30907 'requires' requirement-parameter-list [opt] requirement-body */
30909 static tree
30911 {
30915 /* Avoid committing to outer tentative parse. */
30918 /* This is definitely a requires-expression. */
30922 {
30923 /* Local parameters are delared as variables within the scope
30924 of the expression. They are not visible past the end of
30925 the expression. Expressions within the requires-expression
30926 are unevaluated. */
30927 struct scope_sentinel
30928 {
30930 {
30934 }
30937 {
30940 }
30943 /* Parse the optional parameter list. */
30945 {
30949 }
30950 else
30953 /* Parse the requirement body. */
30959 }
30961 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
30962 the parm chain. */
30967 {
30968 /* Perform semantic processing now to diagnose any invalid types and
30969 expressions. */
30974 }
30976 }
30978 /* Parse a parameterized requirement.
30980 requirement-parameter-list:
30981 '(' parameter-declaration-clause ')' */
30983 static tree
30985 {
30986 matching_parens parens;
30990 tree parms = (cp_parser_parameter_declaration_clause
30996 /* Modify the declared parameters by removing their context
30997 so they don't refer to the enclosing scope and explicitly
30998 indicating that they are constraint variables. */
31000 {
31005 {
31008 }
31009 }
31012 }
31014 /* Parse the body of a requirement.
31016 requirement-body:
31017 '{' requirement-list '}' */
31018 static tree
31020 {
31021 matching_braces braces;
31031 }
31033 /* Parse a sequence of requirements.
31035 requirement-seq:
31036 requirement
31037 requirement-seq requirement */
31039 static tree
31041 {
31043 do
31044 {
31048 }
31052 /* If there are no valid requirements, this is not a valid expression. */
31056 /* Reverse the order of requirements so they are analyzed in order. */
31058 }
31060 /* Parse a syntactic requirement or type requirement.
31062 requirement:
31063 simple-requirement
31064 compound-requirement
31065 type-requirement
31066 nested-requirement */
31068 static tree
31070 {
31074 {
31075 /* It's probably a type-requirement. */
31080 /* No, maybe it's something like typename T::type(); */
31085 /* Non-tentative for the error. */
31087 }
31090 else
31092 }
31094 /* Parse a simple requirement.
31096 simple-requirement:
31097 expression ';' */
31099 static tree
31101 {
31112 /* Sometimes we don't get locations, so use the cached token location
31113 as a reasonable approximation. */
31118 {
31121 {
31124 }
31126 {
31130 "if a concept-id is a valid expression; add "
31132 }
31134 }
31137 }
31139 /* Parse a type requirement
31141 type-requirement
31142 nested-name-specifier [opt] required-type-name ';'
31144 required-type-name:
31145 type-name
31146 'template' [opt] simple-template-id */
31148 static tree
31150 {
31154 // Save the scope before parsing name specifiers.
31165 tree type;
31167 {
31176 }
31177 else
31197 }
31199 /* Parse a compound requirement
31201 compound-requirement:
31202 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
31204 static tree
31206 {
31207 /* Parse an expression enclosed in '{ }'s. */
31208 matching_braces braces;
31219 {
31223 }
31225 /* If the expression was invalid, skip the remainder of the requirement. */
31227 {
31231 }
31233 /* Parse the optional noexcept. */
31236 {
31239 }
31241 /* Parse the optional trailing return type. */
31244 {
31250 /* C++20 allows either a type-id or a type-constraint. Parsing
31251 a type-id will subsume the parsing for a type-constraint but
31252 allow for more syntactic forms (e.g., const C<T>*). */
31261 /* Check that we haven't written something like 'const C<T>*'. */
31263 {
31265 {
31270 }
31271 }
31273 /* P1452R2 removed the trailing-return-type option. */
31276 }
31288 }
31290 /* Parse a nested requirement. This is the same as a requires clause.
31292 nested-requirement:
31293 requires-clause */
31295 static tree
31297 {
31309 }
31311 /* Support Functions */
31313 /* Return the appropriate prefer_type argument for lookup_name based on
31314 tag_type. */
31318 {
31320 {
31324 }
31325 }
31327 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
31328 NAME should have one of the representations used for an
31329 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
31330 is returned. If PARSER->SCOPE is a dependent type, then a
31331 SCOPE_REF is returned.
31333 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
31334 returned; the name was already resolved when the TEMPLATE_ID_EXPR
31335 was formed. Abstractly, such entities should not be passed to this
31336 function, because they do not need to be looked up, but it is
31337 simpler to check for this special case here, rather than at the
31338 call-sites.
31340 In cases not explicitly covered above, this function returns a
31341 DECL, OVERLOAD, or baselink representing the result of the lookup.
31342 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
31343 is returned.
31345 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
31346 (e.g., "struct") that was used. In that case bindings that do not
31347 refer to types are ignored.
31349 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
31350 ignored. If IS_TEMPLATE IS 2, the 'template' keyword was specified.
31352 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
31353 are ignored.
31355 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
31356 types.
31358 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
31359 TREE_LIST of candidates if name-lookup results in an ambiguity, and
31360 NULL_TREE otherwise. */
31362 static cp_expr
31369 location_t name_location)
31370 {
31371 tree decl;
31374 /* Assume that the lookup will be unambiguous. */
31378 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
31379 no longer valid. Note that if we are parsing tentatively, and
31380 the parse fails, OBJECT_TYPE will be automatically restored. */
31386 /* A template-id has already been resolved; there is no lookup to
31387 do. */
31391 {
31395 }
31397 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
31398 it should already have been checked to make sure that the name
31399 used matches the type being destroyed. */
31401 {
31402 tree type;
31404 /* Figure out to which type this destructor applies. */
31409 else
31411 /* If that's not a class type, there is no destructor. */
31415 /* In a non-static member function, check implicit this->. */
31418 tf_warning_or_error);
31427 }
31429 /* By this point, the NAME should be an ordinary identifier. If
31430 the id-expression was a qualified name, the qualifying scope is
31431 stored in PARSER->SCOPE at this point. */
31434 /* Perform the lookup. */
31436 {
31442 /* If the SCOPE is dependent, the lookup must be deferred until
31443 the template is instantiated -- unless we are explicitly
31444 looking up names in uninstantiated templates. Even then, we
31445 cannot look up the name if the scope is not a class type; it
31446 might, for example, be a template type parameter. */
31451 /* Defer lookup. */
31453 else
31454 {
31457 /* If PARSER->SCOPE is a dependent type, then it must be a
31458 class type, and we must not be checking dependencies;
31459 otherwise, we would have processed this lookup above. So
31460 that PARSER->SCOPE is not considered a dependent base by
31461 lookup_member, we must enter the scope here. */
31465 /* If the PARSER->SCOPE is a template specialization, it
31466 may be instantiated during name lookup. In that case,
31467 errors may be issued. Even if we rollback the current
31468 tentative parse, those errors are valid. */
31473 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
31474 lookup result and the nested-name-specifier nominates a class C:
31475 * if the name specified after the nested-name-specifier, when
31476 looked up in C, is the injected-class-name of C (Clause 9), or
31477 * if the name specified after the nested-name-specifier is the
31478 same as the identifier or the simple-template-id's template-
31479 name in the last component of the nested-name-specifier,
31480 the name is instead considered to name the constructor of
31481 class C. [ Note: for example, the constructor is not an
31482 acceptable lookup result in an elaborated-type-specifier so
31483 the constructor would not be used in place of the
31484 injected-class-name. --end note ] Such a constructor name
31485 shall be used only in the declarator-id of a declaration that
31486 names a constructor or in a using-declaration. */
31496 }
31498 /* If the scope is a dependent type and either we deferred lookup or
31499 we did lookup but didn't find the name, rememeber the name. */
31502 {
31504 {
31505 tree type;
31507 /* The resolution to Core Issue 180 says that `struct
31508 A::B' should be considered a type-name, even if `A'
31509 is dependent. */
31514 }
31518 CPP_CLOSE_PAREN)))
31522 else
31525 is_template);
31526 }
31529 }
31531 {
31534 /* Look up the name in the scope of the OBJECT_TYPE, unless the
31535 OBJECT_TYPE is not a class. */
31537 /* If the OBJECT_TYPE is a template specialization, it may
31538 be instantiated during name lookup. In that case, errors
31539 may be issued. Even if we rollback the current tentative
31540 parse, those errors are valid. */
31542 name,
31545 tf_warning_or_error);
31546 else
31549 /* If we didn't find a member and have dependent bases, the member lookup
31550 is now dependent. */
31557 /* Look it up in the enclosing context. DR 141: When looking for a
31558 template-name after -> or ., only consider class templates. */
31560 /* DR 141: When looking in the
31561 current enclosing context for a
31562 template-name after -> or ., only
31563 consider class templates. */
31567 /* If we did unqualified lookup of a dependent member-qualified name and
31568 found something, do we want to use it? P1787 clarified that we need
31569 to look in the object scope first even if it's dependent, but for now
31570 let's still use it in some cases.
31571 FIXME remember unqualified lookup result to use if member lookup fails
31572 at instantiation time. */
31574 {
31576 /* Only use the unqualified class template lookup if we're actually
31577 looking at a template arg list. */
31580 }
31582 /* If we know we're looking for a type (e.g. A in p->A::x),
31583 mock up a typename. */
31585 {
31587 typename_type);
31589 }
31593 }
31594 else
31595 {
31600 }
31602 /* If the lookup failed, let our caller know. */
31606 /* If we have resolved the name of a member declaration, check to
31607 see if the declaration is accessible. When the name resolves to
31608 set of overloaded functions, accessibility is checked when
31609 overload resolution is done. If we have a TREE_LIST, then the lookup
31610 is either ambiguous or it found multiple injected-class-names, the
31611 accessibility of which is trivially satisfied.
31613 During an explicit instantiation, access is not checked at all,
31614 as per [temp.explicit]. */
31617 tf_warning_or_error);
31619 /* Pull out the template from an injected-class-name (or multiple). */
31623 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
31625 {
31628 /* The error message we have to print is too complicated for
31629 cp_parser_error, so we incorporate its actions directly. */
31631 {
31633 name);
31635 }
31637 }
31648 }
31650 /* Like cp_parser_lookup_name, but for use in the typical case where
31651 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
31652 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
31654 static tree
31656 {
31658 none_type,
31663 location);
31664 }
31666 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
31667 the current context, return the TYPE_DECL. If TAG_NAME_P is
31668 true, the DECL indicates the class being defined in a class-head,
31669 or declared in an elaborated-type-specifier.
31671 Otherwise, return DECL. */
31673 static tree
31675 {
31676 /* If the TEMPLATE_DECL is being declared as part of a class-head,
31677 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
31679 struct A {
31680 template <typename T> struct B;
31681 };
31683 template <typename T> struct A::B {};
31685 Similarly, in an elaborated-type-specifier:
31687 namespace N { struct X{}; }
31689 struct A {
31690 template <typename T> friend struct N::X;
31691 };
31693 However, if the DECL refers to a class type, and we are in
31694 the scope of the class, then the name lookup automatically
31695 finds the TYPE_DECL created by build_self_reference rather
31696 than a TEMPLATE_DECL. For example, in:
31698 template <class T> struct S {
31699 S s;
31700 };
31702 there is no need to handle such case. */
31708 }
31710 /* If too many, or too few, template-parameter lists apply to the
31711 declarator, issue an error message. Returns TRUE if all went well,
31712 and FALSE otherwise. */
31714 static bool
31717 location_t declarator_location)
31718 {
31720 {
31722 {
31731 {
31732 /* If the DECLARATOR has the form `X<y>' then it uses one
31733 additional level of template parameters. */
31736 }
31738 return cp_parser_check_template_parameters
31740 declarator);
31741 }
31757 }
31759 }
31761 /* NUM_TEMPLATES were used in the current declaration. If that is
31762 invalid, return FALSE and issue an error messages. Otherwise,
31763 return TRUE. If DECLARATOR is non-NULL, then we are checking a
31764 declarator and we can print more accurate diagnostics. */
31766 static bool
31770 location_t location,
31772 {
31773 /* If there are the same number of template classes and parameter
31774 lists, that's OK. */
31777 /* If there are more, but only one more, and the name ends in an identifier,
31778 then we are declaring a primary template. That's OK too. */
31786 /* If there are more template classes than parameter lists, we have
31787 something like:
31789 template <class T> void S<T>::R<T>::f (); */
31791 {
31801 else
31804 }
31805 /* Otherwise, there are too many template parameter lists. We have
31806 something like:
31808 template <class T> template <class U> void S::f(); */
31811 }
31813 /* Parse an optional `::' token indicating that the following name is
31814 from the global namespace. If so, PARSER->SCOPE is set to the
31815 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
31816 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
31817 Returns the new value of PARSER->SCOPE, if the `::' token is
31818 present, and NULL_TREE otherwise. */
31820 static tree
31822 {
31825 /* Peek at the next token. */
31827 /* If we're looking at a `::' token then we're starting from the
31828 global namespace, not our current location. */
31830 {
31831 /* Consume the `::' token. */
31833 /* Set the SCOPE so that we know where to start the lookup. */
31839 }
31841 {
31845 }
31848 }
31850 /* Returns TRUE if the upcoming token sequence is the start of a
31851 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
31852 declarator is preceded by the `friend' specifier. The parser flags FLAGS
31853 is used to control type-specifier parsing. */
31855 static bool
31858 {
31861 tree nested_name_specifier;
31864 /* The common case is that this is not a constructor declarator, so
31865 try to avoid doing lots of work if at all possible. It's not
31866 valid declare a constructor at function scope. */
31869 /* And only certain tokens can begin a constructor declarator. */
31874 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
31875 declarator-id of a constructor or destructor. */
31879 /* Parse tentatively; we are going to roll back all of the tokens
31880 consumed here. */
31882 /* Assume that we are looking at a constructor declarator. */
31885 /* Look for the optional `::' operator. */
31888 /* Look for the nested-name-specifier. */
31889 nested_name_specifier
31896 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
31899 {
31904 }
31910 /* Outside of a class-specifier, there must be a
31911 nested-name-specifier. Except in C++17 mode, where we
31912 might be declaring a guiding declaration. */
31919 /* If we have a class scope, this is easy; DR 147 says that S::S always
31920 names the constructor, and no other qualified name could. */
31923 {
31933 }
31934 /* If we still think that this might be a constructor-declarator,
31935 look for a class-name. */
31937 {
31938 /* If we have:
31940 template <typename T> struct S {
31941 S();
31942 };
31944 we must recognize that the nested `S' names a class. */
31948 tree type_decl;
31952 none_type,
31959 {
31965 none_type,
31970 else
31972 }
31974 /* If there was no class-name, then this is not a constructor.
31975 Otherwise, if we are in a class-specifier and we aren't
31976 handling a friend declaration, check that its type matches
31977 current_class_type (c++/38313). Note: error_mark_node
31978 is left alone for error recovery purposes. */
31980 && (outside_class_specifier_p
31986 /* If we're still considering a constructor, we have to see a `(',
31987 to begin the parameter-declaration-clause, followed by either a
31988 `)', an `...', or a decl-specifier. We need to check for a
31989 type-specifier to avoid being fooled into thinking that:
31991 S (f) (int);
31993 is a constructor. (It is actually a function named `f' that
31994 takes one parameter (of type `int') and returns a value of type
31995 `S'. */
32003 /* A parameter declaration begins with a decl-specifier,
32004 which is either the "attribute" keyword, a storage class
32005 specifier, or (usually) a type-specifier. */
32007 /* GNU attributes can actually appear both at the start of
32008 a parameter and parenthesized declarator.
32009 S (__attribute__((unused)) int);
32010 is a constructor, but
32011 S (__attribute__((unused)) foo) (int);
32012 is a function declaration. [[attribute]] can appear in the
32013 first form too, but not in the second form. */
32015 {
32016 tree type;
32022 {
32026 }
32028 /* Names appearing in the type-specifier should be looked up
32029 in the scope of the class. */
32033 {
32036 {
32040 {
32043 }
32044 }
32046 }
32048 /* Inside the constructor parameter list, surrounding
32049 template-parameter-lists do not apply. */
32050 saved_num_template_parameter_lists
32054 /* Look for the type-specifier. It's not optional, but its typename
32055 might be. Unless this is a friend declaration; we don't want to
32056 treat
32058 friend S (T::fn)(int);
32060 as a constructor, but with P0634, we might assume a type when
32061 looking for the type-specifier. It is actually a function named
32062 `T::fn' that takes one parameter (of type `int') and returns a
32063 value of type `S'. Constructors can be friends, but they must
32064 use a qualified name.
32066 Parse with an empty set of declaration specifiers since we're
32067 trying to match a decl-specifier-seq of the first parameter.
32068 This must be non-null so that cp_parser_simple_type_specifier
32069 will recognize a constrained placeholder type such as:
32070 'C<int> auto' where C is a type concept. */
32071 cp_decl_specifier_seq ctor_specs;
32081 parser->num_template_parameter_lists
32084 /* Leave the scope of the class. */
32089 }
32090 }
32092 /* We did not really want to consume any tokens. */
32096 }
32098 /* Parse the definition of the function given by the DECL_SPECIFIERS,
32099 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
32100 they must be performed once we are in the scope of the function.
32102 Returns the function defined. */
32104 static tree
32105 cp_parser_function_definition_from_specifiers_and_declarator
32108 tree attributes,
32110 {
32111 tree fn;
32114 /* Begin the function-definition. */
32117 /* The things we're about to see are not directly qualified by any
32118 template headers we've seen thus far. */
32121 /* If there were names looked up in the decl-specifier-seq that we
32122 did not check, check them now. We must wait until we are in the
32123 scope of the function to perform the checks, since the function
32124 might be a friend. */
32128 {
32133 }
32136 {
32137 /* Skip the entire function. */
32140 }
32142 {
32143 /* Seen already, skip it. An error message has already been output. */
32147 /* If this is a function from a class, pop the nested class. */
32150 }
32151 else
32152 {
32157 }
32160 }
32162 /* Parse the part of a function-definition that follows the
32163 declarator. INLINE_P is TRUE iff this function is an inline
32164 function defined within a class-specifier.
32166 Returns the function defined. */
32168 static tree
32171 {
32172 tree fn;
32177 bool fully_implicit_function_template_p
32180 tree implicit_template_parms
32183 cp_binding_level* implicit_template_scope
32189 /* If the next token is `return', then the code may be trying to
32190 make use of the "named return value" extension that G++ used to
32191 support. */
32194 {
32195 /* Consume the `return' keyword. */
32197 /* Look for the identifier that indicates what value is to be
32198 returned. */
32200 /* Issue an error message. */
32203 /* Skip tokens until we reach the start of the function body. */
32205 {
32212 }
32213 }
32214 /* The `extern' in `extern "C" void f () { ... }' does not apply to
32215 anything declared inside `f'. */
32216 saved_in_unbraced_linkage_specification_p
32219 /* Inside the function, surrounding template-parameter-lists do not
32220 apply. */
32221 saved_num_template_parameter_lists
32225 /* If the next token is `try', `__transaction_atomic', or
32226 `__transaction_relaxed`, then we are looking at either function-try-block
32227 or function-transaction-block. Note that all of these include the
32228 function-body. */
32232 RID_TRANSACTION_RELAXED))
32236 else
32237 cp_parser_ctor_initializer_opt_and_function_body
32240 /* Finish the function. */
32244 && !inline_p
32250 /* Generate code for it, if necessary. */
32253 /* Restore the saved values. */
32254 parser->in_unbraced_linkage_specification_p
32256 parser->num_template_parameter_lists
32260 parser->fully_implicit_function_template_p
32262 parser->implicit_template_parms
32264 parser->implicit_template_scope
32271 }
32273 /* Parse a template-declaration body (following argument list). */
32275 static void
32277 tree parameter_list,
32279 {
32283 /* We just processed one more parameter list. */
32286 /* Get the deferred access checks from the parameter list. These
32287 will be checked once we know what is being declared, as for a
32288 member template the checks must be performed in the scope of the
32289 class containing the member. */
32292 /* Tentatively parse for a new template parameter list, which can either be
32293 the template keyword or a template introduction. */
32302 /* -fconcept-ts 'concept bool' syntax is handled below, in
32303 cp_parser_single_declaration. */
32305 else
32306 {
32309 checks,
32310 member_p,
32314 /* If this is a member template declaration, let the front
32315 end know. */
32317 {
32322 }
32327 }
32328 /* We are done with the current parameter list. */
32333 /* Finish up. */
32336 /* Check the template arguments for a literal operator template. */
32340 {
32344 else
32345 {
32348 {
32355 /* OK, C++20 string literal operator template. We don't need
32356 to warn in lower dialects here because we will have already
32361 }
32363 {
32372 else
32373 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
32375 "ISO C++ did not adopt string literal operator templa"
32377 }
32378 else
32380 }
32382 {
32385 "template %qD has invalid parameter list; expected "
32386 "non-type template parameter pack %<<char...>%> or "
32388 decl);
32389 else
32391 "template %qD has invalid parameter list; expected "
32393 decl);
32394 }
32395 }
32397 /* Register member declarations. */
32400 /* If DECL is a function template, we must return to parse it later.
32401 (Even though there is no definition, there might be default
32402 arguments that need handling.) */
32406 }
32408 /* Parse a template introduction header for a template-declaration. Returns
32409 false if tentative parse fails. */
32411 static bool
32413 {
32423 /* In classes don't parse valid unnamed bitfields as invalid
32424 template introductions. */
32428 /* Look for the optional `::' operator. */
32431 /* Look for the nested-name-specifier. */
32441 /* Look up the concept for which we will be matching
32442 template parameters. */
32454 /* Look for opening brace for introduction. */
32455 matching_braces braces;
32464 /* Build vector of placeholder parameters and grab
32465 matching identifiers. */
32468 /* Look for closing brace for introduction. */
32472 /* The introduction-list shall not be empty. */
32475 {
32476 /* In cp_parser_introduction_list we have already issued an error. */
32478 }
32481 {
32485 }
32487 /* Build and associate the constraint. */
32492 introduction_list,
32493 introduction_loc);
32495 {
32502 member_p);
32504 }
32510 }
32512 /* Parse a normal template-declaration following the template keyword. */
32514 static void
32516 {
32517 tree parameter_list;
32521 /* Look for the `<' token. */
32525 {
32526 /* 14.5.2.2 [temp.mem]
32528 A local class shall not have member templates. */
32533 }
32534 /* [temp]
32536 A template ... shall not have C linkage. */
32538 {
32541 /* Give it C++ linkage to avoid confusing other parts of the
32542 front end. */
32545 }
32546 else
32549 /* We cannot perform access checks on the template parameter
32550 declarations until we know what is being declared, just as we
32551 cannot check the decl-specifier list. */
32554 /* If the next token is `>', then we have an invalid
32555 specialization. Rather than complain about an invalid template
32556 parameter, issue an error message here. */
32558 {
32562 }
32563 else
32564 {
32565 /* Parse the template parameters. */
32567 }
32569 /* Look for the `>'. */
32572 /* Manage template requirements */
32574 {
32579 }
32582 member_p);
32584 /* For the erroneous case of a template with C linkage, we pushed an
32585 implicit C++ linkage scope; exit that scope now. */
32588 }
32590 /* Parse a template-declaration, assuming that the `export' (and
32591 `extern') keywords, if present, has already been scanned. MEMBER_P
32592 is as for cp_parser_template_declaration. */
32594 static bool
32596 {
32598 {
32602 }
32607 }
32609 /* Perform the deferred access checks from a template-parameter-list.
32610 CHECKS is a TREE_LIST of access checks, as returned by
32611 get_deferred_access_checks. */
32613 static void
32614 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
32615 {
32619 }
32621 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
32622 `function-definition' sequence that follows a template header.
32623 If MEMBER_P is true, this declaration appears in a class scope.
32625 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
32626 *FRIEND_P is set to TRUE iff the declaration is a friend. */
32628 static tree
32634 {
32637 cp_decl_specifier_seq decl_specifiers;
32641 /* This function is only used when processing a template
32642 declaration. */
32646 /* Defer access checks until we know what is being declared. */
32649 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
32650 alternative. */
32653 (CP_PARSER_FLAGS_OPTIONAL
32658 cp_omp_declare_simd_data odsd;
32667 /* There are no template typedefs. */
32669 {
32673 }
32675 /* Gather up the access checks that occurred the
32676 decl-specifier-seq. */
32679 /* Check for the declaration of a template class. */
32681 {
32684 {
32687 /* In this case:
32689 struct C {
32690 friend template <typename T> struct A<T>::B;
32691 };
32693 A<T>::B will be represented by a TYPENAME_TYPE, and
32694 therefore not recognized by shadow_tag. */
32696 && !decl
32703 else
32706 /* If this is a declaration, but not a definition, associate
32707 any constraints with the type declaration. Constraints
32708 are associated with definitions in cp_parser_class_specifier. */
32712 /* Perform access checks for template parameters. */
32715 /* Give a helpful diagnostic for
32716 template <class T> struct A { } a;
32717 if we aren't already recovering from an error. */
32720 {
32722 "a class template declaration must not declare "
32726 }
32727 }
32728 }
32730 /* Complain about missing 'typename' or other invalid type names. */
32733 {
32734 /* cp_parser_parse_and_diagnose_invalid_type_name calls
32735 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
32736 the rest of this declaration. */
32739 }
32741 /* If it's not a template class, try for a template function. If
32742 the next token is a `;', then this declaration does not declare
32743 anything. But, if there were errors in the decl-specifiers, then
32744 the error might well have come from an attempted class-specifier.
32745 In that case, there's no need to warn about a missing declarator. */
32749 {
32751 /* We don't delay parsing for friends, though CWG 2510 may change
32752 that. */
32756 flags,
32758 checks,
32760 member_p,
32761 declares_class_or_enum,
32765 /* 7.1.1-1 [dcl.stc]
32767 A storage-class-specifier shall not be specified in an explicit
32768 specialization... */
32770 && explicit_specialization_p
32772 {
32776 }
32780 }
32782 /* Look for a trailing `;' after the declaration. */
32788 out:
32791 /* Clear any current qualification; whatever comes next is the start
32792 of something new. */
32800 }
32802 /* Parse a cast-expression that is not the operand of a unary "&". */
32804 static cp_expr
32806 {
32809 }
32811 /* Parse a functional cast to TYPE. Returns an expression
32812 representing the cast. */
32814 static cp_expr
32816 {
32818 tree expression_list;
32819 cp_expr cast;
32827 {
32837 /* Create a location of the form:
32838 type_name{i, f}
32839 ^~~~~~~~~~~~~~~
32840 with caret == start at the start of the type name,
32841 finishing at the closing brace. */
32846 }
32855 else
32856 {
32859 }
32861 /* Create a location of the form:
32862 float(i)
32863 ^~~~~~~~
32864 with caret == start at the start of the type name,
32865 finishing at the closing paren. */
32869 tf_warning_or_error);
32871 /* [expr.const]/1: In an integral constant expression "only type
32872 conversions to integral or enumeration type can be used". */
32878 NIC_CONSTRUCTOR))
32882 }
32884 /* Save the tokens that make up the body of a member function defined
32885 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
32886 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
32887 specifiers applied to the declaration. Returns the FUNCTION_DECL
32888 for the member function. */
32890 static tree
32894 tree attributes)
32895 {
32898 tree fn;
32901 /* Create the FUNCTION_DECL. */
32905 /* If something went badly wrong, bail out now. */
32907 {
32908 /* If there's a function-body, skip it. */
32913 }
32915 /* Remember it, if there are default args to post process. */
32918 /* Save away the tokens that make up the body of the
32919 function. */
32925 RID_TRANSACTION_ATOMIC))
32926 {
32928 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
32935 {
32941 }
32942 else
32945 {
32949 }
32950 }
32952 /* Handle function try blocks. */
32954 {
32957 }
32958 /* We can have braced-init-list mem-initializers before the fn body. */
32960 {
32963 {
32964 /* cache_group will stop after an un-nested { } pair, too. */
32968 /* variadic mem-inits have ... after the ')'. */
32971 }
32972 }
32974 /* Handle function try blocks. */
32980 /* Save away the inline definition; we will process it when the
32981 class is complete. */
32985 /* We need to know that this was defined in the class, so that
32986 friend templates are handled correctly. */
32989 /* Add FN to the queue of functions to be parsed later. */
32993 }
32995 /* Save the tokens that make up the in-class initializer for a non-static
32996 data member. Returns a DEFERRED_PARSE. */
32998 static tree
33000 {
33002 }
33004 /* Parse a template-argument-list, as well as the trailing ">" (but
33005 not the opening "<"). See cp_parser_template_argument_list for the
33006 return value. */
33008 static tree
33010 {
33011 tree arguments;
33012 tree saved_scope;
33013 tree saved_qualifying_scope;
33014 tree saved_object_scope;
33017 /* [temp.names]
33019 When parsing a template-id, the first non-nested `>' is taken as
33020 the end of the template-argument-list rather than a greater-than
33021 operator. */
33022 saved_greater_than_is_operator_p
33025 /* Parsing the argument list may modify SCOPE, so we save it
33026 here. */
33030 /* We need to evaluate the template arguments, even though this
33031 template-id may be nested within a "sizeof". */
33032 cp_evaluated ev;
33033 /* Parse the template-argument-list itself. */
33038 {
33041 }
33042 else
33044 /* Look for the `>' that ends the template-argument-list. If we find
33045 a '>>' instead, it's probably just a typo. */
33047 {
33049 {
33050 /* In C++0x, a `>>' in a template argument list or cast
33051 expression is considered to be two separate `>'
33052 tokens. So, change the current token to a `>', but don't
33053 consume it: it will be consumed later when the outer
33054 template argument list (or cast expression) is parsed.
33055 Note that this replacement of `>' for `>>' is necessary
33056 even if we are parsing tentatively: in the tentative
33057 case, after calling
33058 cp_parser_enclosed_template_argument_list we will always
33059 throw away all of the template arguments and the first
33060 closing `>', either because the template argument list
33061 was erroneous or because we are replacing those tokens
33062 with a CPP_TEMPLATE_ID token. The second `>' (which will
33063 not have been thrown away) is needed either to close an
33064 outer template argument list or to complete a new-style
33065 cast. */
33068 }
33070 {
33071 /* If we're in a nested template argument list, the '>>' has
33072 to be a typo for '> >'. We emit the error message, but we
33073 continue parsing and we push a '>' as next token, so that
33074 the argument list will be parsed correctly. Note that the
33075 global source location is still on the token before the
33076 '>>', so we need to say explicitly where we want it. */
33084 }
33085 else
33086 {
33087 /* If this is not a nested template argument list, the '>>'
33088 is a typo for '>'. Emit an error message and continue.
33089 Same deal about the token location, but here we can get it
33090 right by consuming the '>>' before issuing the diagnostic. */
33093 "spurious %<>>%>, use %<>%> to terminate "
33095 }
33096 }
33097 /* Similarly for >>= and >=. */
33100 {
33106 {
33109 }
33111 {
33114 else
33117 }
33118 else
33119 {
33122 }
33128 }
33129 else
33131 /* The `>' token might be a greater-than operator again now. */
33132 parser->greater_than_is_operator_p
33134 /* Restore the SAVED_SCOPE. */
33140 }
33142 /* MEMBER_FUNCTION is a member function, or a friend. If default
33143 arguments, or the body of the function have not yet been parsed,
33144 parse them now. */
33146 static void
33148 {
33151 /* If this member is a template, get the underlying
33152 FUNCTION_DECL. */
33156 /* There should not be any class definitions in progress at this
33157 point; the bodies of members are only parsed outside of all class
33158 definitions. */
33160 /* While we're parsing the member functions we might encounter more
33161 classes. We want to handle them right away, but we don't want
33162 them getting mixed up with functions that are currently in the
33163 queue. */
33166 /* Make sure that any template parameters are in scope. */
33169 /* If the body of the function has not yet been parsed, parse it
33170 now. Except if the tokens have been purged (PR c++/39751). */
33173 {
33174 tree function_scope;
33177 /* The function is no longer pending; we are processing it. */
33182 /* If this is a local class, enter the scope of the containing
33183 function. */
33188 /* Push the body of the function onto the lexer stack. */
33191 /* Let the front end know that we going to be defining this
33192 function. */
33196 /* #pragma omp declare reduction needs special parsing. */
33198 {
33203 }
33204 else
33205 /* Now, parse the body of the function. */
33209 /* Leave the scope of the containing function. */
33213 }
33215 /* Remove any template parameters from the symbol table. */
33218 /* Restore the queue. */
33220 }
33222 /* If DECL contains any default args, remember it on the unparsed
33223 functions queue. */
33225 static void
33227 {
33228 tree probe;
33231 probe;
33234 {
33238 }
33240 /* Remember if there is a noexcept-specifier to post process. */
33245 /* Contracts are deferred. */
33248 {
33251 }
33252 }
33254 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
33255 which is either a FIELD_DECL or PARM_DECL. Parse it and return
33256 the result. For a PARM_DECL, PARMTYPE is the corresponding type
33257 from the parameter-type-list. */
33259 static tree
33262 {
33264 tree parsed_arg;
33269 /* Push the saved tokens for the default argument onto the parser's
33270 lexer stack. */
33276 /* Parse the default argument. */
33287 {
33288 /* In a non-template class, check conversions now. In a template,
33289 we'll wait and instantiate these as needed. */
33292 tf_warning_or_error);
33295 else
33297 }
33299 /* If the token stream has not been completely used up, then
33300 there was extra junk after the end of the default
33301 argument. */
33303 {
33306 else
33308 }
33310 /* Revert to the main lexer. */
33314 }
33316 /* FIELD is a non-static data member with an initializer which we saved for
33317 later; parse it now. */
33319 static void
33321 {
33322 tree def;
33329 NULL_TREE);
33335 }
33337 /* FN is a FUNCTION_DECL which may contains a parameter with an
33338 unparsed DEFERRED_PARSE. Parse the default args now. This function
33339 assumes that the current scope is the scope in which the default
33340 argument should be processed. */
33342 static void
33344 {
33347 /* While we're parsing the default args, we might (due to the
33348 statement expression extension) encounter more classes. We want
33349 to handle them right away, but we don't want them getting mixed
33350 up with default args that are currently in the queue. */
33353 /* Local variable names (and the `this' keyword) may not appear
33354 in a default argument. */
33362 /* Gather the PARM_DECLs into a vec so we can keep track of them when
33363 pushdecl clears DECL_CHAIN. */
33364 releasing_vec parms;
33374 {
33376 tree parsed_arg;
33385 /* This can happen for a friend declaration for a function
33386 already declared with default arguments. */
33389 parsed_arg
33391 default_arg,
33395 /* Update any instantiations we've already created. */
33398 }
33402 /* Restore DECL_CHAINs after clobbering by pushdecl. */
33405 {
33408 }
33412 /* Make sure no default arg is missing. */
33415 /* Restore the state of local_variables_forbidden_p. */
33418 /* Restore the queue. */
33420 }
33422 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
33424 sizeof ... ( identifier )
33426 where the 'sizeof' token has already been consumed. */
33428 static tree
33430 {
33431 /* Consume the `...'. */
33435 matching_parens parens;
33439 else
33447 /* The name is not qualified. */
33467 }
33469 /* Parse the operand of `sizeof' (or a similar operator). Returns
33470 either a TYPE or an expression, depending on the form of the
33471 input. The KEYWORD indicates which kind of expression we have
33472 encountered. */
33474 static tree
33476 {
33483 /* If it's a `...', then we are computing the length of a parameter
33484 pack. */
33489 /* Types cannot be defined in a `sizeof' expression. Save away the
33490 old message. */
33493 parser->type_definition_forbidden_message
33495 parser->type_definition_forbidden_message_arg
33498 /* The restrictions on constant-expressions do not apply inside
33499 sizeof expressions. */
33500 saved_integral_constant_expression_p
33502 saved_non_integral_constant_expression_p
33509 /* Do not actually evaluate the expression. */
33512 /* If it's a `(', then we might be looking at the type-id
33513 construction. */
33515 {
33520 /* We can't be sure yet whether we're looking at a type-id or an
33521 expression. */
33524 matching_parens parens;
33527 /* Note: as a GNU Extension, compound literals are considered
33528 postfix-expressions as they are in C99, so they are valid
33529 arguments to sizeof. See comment in cp_parser_cast_expression
33530 for details. */
33533 else
33534 {
33537 /* Look for the type-id. */
33539 /* Look for the closing `)'. */
33542 }
33544 /* If all went well, then we're done. */
33547 else
33548 {
33549 /* Commit to the tentative_firewall so we get syntax errors. */
33553 }
33554 }
33555 else
33558 /* Go back to evaluating expressions. */
33562 /* And restore the old one. */
33565 parser->integral_constant_expression_p
33567 parser->non_integral_constant_expression_p
33571 }
33573 /* If the current declaration has no declarator, return true. */
33575 static bool
33577 {
33578 /* If the next token is a `;' or a `,' then there is no
33579 declarator. */
33582 }
33584 /* Update the DECL_SPECS to reflect the storage class indicated by
33585 KEYWORD. */
33587 static void
33592 {
33593 cp_storage_class storage_class;
33596 {
33614 }
33617 {
33621 }
33623 {
33630 else
33637 }
33642 {
33645 }
33650 /* A storage class specifier cannot be applied alongside a typedef
33651 specifier. If there is a typedef specifier present then set
33652 conflicting_specifiers_p which will trigger an error later
33653 on in grokdeclarator. */
33656 {
33663 }
33664 }
33666 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
33667 is true, the type is a class or enum definition. */
33669 static void
33671 tree type_spec,
33674 {
33677 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
33678 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
33679 this is what happened. In system headers, we ignore these
33680 declarations so that G++ can work with system headers that are not
33681 C++-safe. */
33683 && !type_definition_p
33696 {
33699 ds_redefined_builtin_type_spec,
33700 token);
33702 {
33706 }
33707 }
33710 else
33711 {
33716 }
33717 }
33719 /* True iff TOKEN is the GNU keyword __thread. */
33721 static bool
33723 {
33726 }
33728 /* Set the location for a declarator specifier and check if it is
33729 duplicated.
33731 DECL_SPECS is the sequence of declarator specifiers onto which to
33732 set the location.
33734 DS is the single declarator specifier to set which location is to
33735 be set onto the existing sequence of declarators.
33737 LOCATION is the location for the declarator specifier to
33738 consider. */
33740 static void
33743 {
33752 {
33756 }
33757 else
33758 {
33760 {
33764 else
33765 {
33768 OPT_Wlong_long,
33770 }
33771 }
33773 {
33777 {
33781 }
33782 else
33783 {
33786 }
33787 }
33788 else
33789 {
33807 "consteval"
33808 };
33812 }
33813 }
33814 }
33816 /* Return true iff the declarator specifier DS is present in the
33817 sequence of declarator specifiers DECL_SPECS. */
33819 bool
33821 cp_decl_spec ds)
33822 {
33829 }
33831 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
33832 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
33834 static bool
33836 {
33838 }
33840 /* Issue an error message indicating that TOKEN_DESC was expected.
33841 If KEYWORD is true, it indicated this function is called by
33842 cp_parser_require_keword and the required token can only be
33843 a indicated keyword.
33845 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33846 within any error as the location of an "opening" token matching
33847 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33848 RT_CLOSE_PAREN). */
33850 static void
33852 required_token token_desc,
33854 location_t matching_location)
33855 {
33861 {
33936 }
33939 {
33941 {
34019 }
34020 }
34024 }
34027 /* If the next token is of the indicated TYPE, consume it. Otherwise,
34028 issue an error message indicating that TOKEN_DESC was expected.
34030 Returns the token consumed, if the token had the appropriate type.
34031 Otherwise, returns NULL.
34033 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
34034 within any error as the location of an "opening" token matching
34035 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
34036 RT_CLOSE_PAREN). */
34041 required_token token_desc,
34042 location_t matching_location)
34043 {
34046 else
34047 {
34048 /* Output the MESSAGE -- unless we're parsing tentatively. */
34051 matching_location);
34053 }
34054 }
34056 /* Skip an entire parameter list from start to finish. The next token must
34057 be the initial "<" of the parameter list. Returns true on success and
34058 false otherwise. */
34060 static bool
34062 {
34063 /* Consume the "<" because cp_parser_skip_to_end_of_template_parameter_list
34064 requires it. */
34067 }
34069 /* Ensure we are at the end of a template parameter list. If we are, return.
34070 If we are not, something has gone wrong, in which case issue an error and
34071 skip to end of the parameter list. */
34073 static void
34075 {
34076 /* Are we ready, yet? If not, issue error message. */
34081 }
34083 /* You should only call this function from inside a template parameter list
34084 (i.e. the current token should at least be the initial "<" of the
34085 parameter list). If you are skipping the entire list, it may be better to
34086 use cp_parser_skip_entire_template_parameter_list.
34088 Tokens are skipped until the final ">" is found, or if we see
34089 '{', '}', ';', or if we find an unbalanced ')' or ']'.
34091 Returns true if we successfully reached the end, and false if
34092 something unexpected happened (e.g. end of file). */
34094 static bool
34096 {
34097 /* Current level of '< ... >'. */
34099 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
34102 /* Skip tokens until the desired token is found. */
34104 {
34105 /* Peek at the next token. */
34107 {
34115 /* C++0x views the `>>' operator as two `>' tokens, but
34116 C++98 does not. */
34119 {
34120 /* We've hit a `>>' where the first `>' closes the
34121 template argument list, and the second `>' is
34122 spurious. Just consume the `>>' and stop; we've
34123 already produced at least one error. */
34126 }
34127 /* Fall through for C++0x, so we handle the second `>' in
34128 the `>>'. */
34133 {
34134 /* We've reached the token we want, consume it and stop. */
34137 }
34156 /* The '>' was probably forgotten, don't look further. */
34161 }
34163 /* Consume this token. */
34165 }
34166 }
34168 /* If the next token is the indicated keyword, consume it. Otherwise,
34169 issue an error message indicating that TOKEN_DESC was expected.
34171 Returns the token consumed, if the token had the appropriate type.
34172 Otherwise, returns NULL. */
34177 required_token token_desc)
34178 {
34182 {
34184 UNKNOWN_LOCATION);
34186 }
34189 }
34191 /* Returns TRUE iff TOKEN is a token that can begin the body of a
34192 function-definition. */
34194 static bool
34196 {
34199 /* A ctor-initializer begins with a `:'. */
34201 /* A function-try-block begins with `try'. */
34203 /* A function-transaction-block begins with `__transaction_atomic'
34204 or `__transaction_relaxed'. */
34207 /* The named return value extension begins with `return'. */
34209 }
34211 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
34212 definition. */
34214 static bool
34216 {
34223 }
34225 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
34226 C++0x) ending a template-argument. */
34228 static bool
34230 {
34238 /* For better diagnostics, treat >>= like that too, that
34239 shouldn't appear non-nested in template arguments. */
34241 }
34243 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
34244 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
34246 static bool
34249 {
34255 /* Check for the sequence `<::' in the original code. It would be lexed as
34256 `[:', where `[' is a digraph, and there is no whitespace before
34257 `:'. */
34259 {
34264 }
34266 }
34268 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
34269 or none_type otherwise. */
34271 static enum tag_types
34273 {
34275 {
34285 }
34286 }
34288 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
34289 or none_type otherwise or if the token is null. */
34291 static enum tag_types
34293 {
34298 {
34306 }
34307 }
34309 /* Diagnose redundant enum-keys. */
34311 static void
34314 {
34320 /* Look up the NAME to see if it unambiguously refers to the TYPE. */
34325 /* The enum-key is redundant for uses of the TYPE that are not
34326 declarations and for which name lookup returns just the type
34327 itself. */
34335 {
34336 /* Avoid issuing the diagnostic for apparently redundant (unscoped)
34337 enum tag in shared C/C++ code in files (such as headers) included
34338 in the main source file. */
34341 LRK_MACRO_DEFINITION_LOCATION,
34345 }
34353 }
34355 /* Describes the set of declarations of a struct, class, or class template
34356 or its specializations. Used for -Wmismatched-tags. */
34358 class class_decl_loc_t
34359 {
34364 {
34366 }
34368 /* Constructs an object for a single declaration of a class with
34369 CLASS_KEY at the current location in the current function (or
34370 at another scope). KEY_REDUNDANT is true if the class-key may
34371 be omitted in the current context without an ambiguity with
34372 another symbol with the same name.
34373 DEF_P is true for a class declaration that is a definition.
34374 CURLOC is the associated location. */
34378 {
34381 key_redundant);
34383 }
34385 /* Copy, assign, and destroy the object. Necessary because LOCVEC
34386 isn't safely copyable and assignable and doesn't release storage
34387 on its own. */
34391 { }
34394 {
34402 }
34405 {
34407 }
34409 /* Issues -Wmismatched-tags for a single class. */
34412 /* Issues -Wmismatched-tags for all classes. */
34415 /* Adds TYPE_DECL to the collection of class decls and diagnoses
34416 redundant tags (if -Wredundant-tags is enabled). */
34419 /* Either adds this decl to the collection of class decls
34420 or diagnoses it, whichever is appropriate. */
34426 {
34428 }
34431 {
34433 }
34436 {
34438 }
34441 {
34443 }
34445 /* True if a definition for the class has been seen. */
34447 {
34449 }
34451 /* The location of a single mention of a class type with the given
34452 class-key. */
34453 struct class_key_loc_t
34454 {
34457 { }
34459 /* The function the type is mentioned in. */
34460 tree func;
34461 /* The exact location. */
34462 location_t loc;
34463 /* The class-key used in the mention of the type. */
34464 tag_types class_key;
34465 /* True when the class-key could be omitted at this location
34466 without an ambiguity with another symbol of the same name. */
34468 };
34469 /* Avoid using auto_vec here since it's not safe to copy due to pr90904. */
34471 /* LOCVEC index of the definition or UINT_MAX if none exists. */
34473 /* The class-key the class was last declared with or none_type when
34474 it has been declared with a mismatched key. */
34475 tag_types def_class_key;
34477 /* A mapping between a TYPE_DECL for a class and the class_decl_loc_t
34478 description above. */
34481 };
34485 /* Issue an error message if the CLASS_KEY does not match the TYPE.
34486 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34487 is set for a declaration of class TYPE and clear for a reference to
34488 it that is not a declaration of it. */
34490 static void
34494 {
34500 {
34504 type))
34508 }
34513 /* Only consider the true class-keys below and ignore typename_type,
34514 etc. that are not C++ class-keys. */
34521 }
34523 /* Returns the template or specialization of one to which the RECORD_TYPE
34524 TYPE corresponds. */
34526 static tree
34528 {
34531 /* Determine the template or its partial specialization to which TYPE
34532 corresponds. */
34541 }
34544 /* Adds the class TYPE to the collection of class decls and diagnoses
34545 redundant tags (if -Wredundant-tags is enabled).
34546 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34547 is set for a (likely, based on syntactic context) declaration of class
34548 TYPE and clear for a reference to it that is not a declaration of it. */
34550 void
34553 {
34556 /* Look up the NAME to see if it unambiguously refers to the TYPE
34557 and set KEY_REDUNDANT if so. */
34562 /* The class-key is redundant for uses of the CLASS_TYPE that are
34563 neither definitions of it nor declarations, and for which name
34564 lookup returns just the type itself. */
34575 {
34576 /* Avoid issuing the diagnostic for apparently redundant struct
34577 and union class-keys in shared C/C++ code in files (such as
34578 headers) included in the main source file. */
34581 LRK_MACRO_DEFINITION_LOCATION,
34585 }
34587 /* Set if a declaration of TYPE has previously been seen or if it must
34588 exist in a precompiled header. */
34592 {
34595 {
34596 /* TYPE_DECL is the first declaration or definition of the type
34597 (outside precompiled headers -- see below). Just create
34598 a new entry for it and return unless it's a declaration
34599 involving a template that may need to be diagnosed by
34600 -Wredundant-tags. */
34604 }
34605 else
34606 {
34607 /* TYPE was previously defined in some unknown precompiled header.
34608 Simply add a record of its definition at an unknown location and
34609 proceed below to add a reference to it at the current location.
34610 (Declarations in precompiled headers that are not definitions
34611 are ignored.) */
34612 tag_types def_key
34617 }
34618 }
34620 /* A prior declaration of TYPE_DECL has been seen. */
34623 {
34630 type);
34631 }
34634 /* Do nothing if this is the first declaration of the type. */
34638 /* Do nothing if the class-key in this declaration matches
34639 the definition. */
34643 def_p);
34644 }
34646 /* Either adds this DECL corresponding to the TYPE_DECL to the collection
34647 of class decls or diagnoses it, whichever is appropriate. */
34649 void
34651 tag_types class_key,
34654 {
34655 /* Reset the CLASS_KEY associated with this type on mismatch.
34656 This is an optimization that lets the diagnostic code skip
34657 over classes that use the same class-key in all declarations. */
34661 /* Set IDXDEF to the index of the vector corresponding to
34662 the definition. */
34666 /* Append a record of this declaration to the vector. */
34668 redundant);
34674 /* As a space optimization diagnose declarations of a class
34675 whose definition has been seen and purge the LOCVEC of
34676 all entries except the definition. */
34679 {
34685 }
34686 else
34687 /* Pop the entry pushed above for this declaration. */
34689 }
34691 /* Issues -Wmismatched-tags for a single class. */
34693 void
34695 {
34699 /* Number of uses of the class. */
34702 /* The class (or template) declaration guiding the decisions about
34703 the diagnostic. For ordinary classes it's the same as THIS. For
34704 uses of instantiations of templates other than their declarations
34705 it points to the record for the declaration of the corresponding
34706 primary template or partial specialization. */
34711 {
34712 /* For implicit instantiations of a primary template look up
34713 the primary or partial specialization and use it as
34714 the expected class-key rather than using the class-key of
34715 the first reference to the instantiation. The primary must
34716 be (and inevitably is) at index zero. */
34719 /* It's possible that we didn't find SPEC. Consider:
34721 template<typename T> struct A {
34722 template<typename U> struct W { };
34723 };
34724 struct A<int>::W<int> w; // #1
34726 where while parsing A and #1 we've stashed
34727 A<T>
34728 A<T>::W<U>
34729 A<int>::W<int>
34730 into CLASS2LOC. If TYPE is A<int>::W<int>, specialization_of
34731 will yield A<int>::W<U> which may be in CLASS2LOC if we had
34732 an A<int> class specialization, but otherwise won't be in it.
34733 So try to look up A<T>::W<U>. */
34735 {
34738 }
34739 /* Now we really should have found something. */
34741 }
34742 /* Skip declarations that consistently use the same class-key. */
34746 /* Set if a definition for the class has been seen. */
34749 /* The index of the declaration whose class-key this declaration
34750 is expected to match. It's either the class-key of the class
34751 definition if one exists or the first declaration otherwise. */
34754 /* The class-key the class is expected to be declared with: it's
34755 either the key used in its definition or the first declaration
34756 if no definition has been provided.
34757 For implicit instantiations of a primary template it's
34758 the class-key used to declare the primary with. The primary
34759 must be at index zero. */
34763 /* Advance IDX to the first declaration that either is not
34764 a definition or that doesn't match the first declaration
34765 if no definition is provided. */
34770 /* Save the current function before changing it below. */
34772 /* Set the function declaration to print in diagnostic context. */
34780 auto_diagnostic_group d;
34781 /* Issue a warning for the first mismatched declaration.
34782 Avoid using "%#qT" since the class-key for the same type will
34783 be the same regardless of which one was used in the declaraion. */
34787 {
34788 /* Suggest how to avoid the warning for each instance since
34789 the guidance may be different depending on context. */
34791 (key_redundant_p
34794 xpectkstr);
34796 /* Also point to the first declaration or definition that guided
34797 the decision to issue the warning above. */
34799 (def_p
34803 }
34805 /* Issue warnings for the remaining inconsistent declarations. */
34807 {
34809 /* Skip over the declarations that match either the definition
34810 if one was provided or the first declaration. */
34816 /* Set the function declaration to print in diagnostic context. */
34821 /* Suggest how to avoid the warning for each instance since
34822 the guidance may be different depending on context. */
34824 (key_redundant_p
34827 xpectkstr);
34828 }
34830 /* Restore the current function in case it was replaced above. */
34832 }
34834 /* Issues -Wmismatched-tags for all classes. Called at the end
34835 of processing a translation unit, after declarations of all class
34836 types and their uses have been recorded. */
34838 void
34840 {
34841 /* CLASS2LOC should be empty if both -Wmismatched-tags and
34842 -Wredundant-tags are disabled. */
34844 || warn_redundant_tags
34847 /* Save the current function before changing on return. It should
34848 be null at this point. */
34852 {
34853 /* Iterate over the collected class/struct/template declarations. */
34856 {
34860 }
34861 }
34864 }
34866 /* Issue an error message if DECL is redeclared with different
34867 access than its original declaration [class.access.spec/3].
34868 This applies to nested classes, nested class templates and
34869 enumerations [class.mem/1]. */
34871 static void
34873 {
34884 }
34886 /* Look for the `template' keyword, as a syntactic disambiguator.
34887 Return TRUE iff it is present, in which case it will be
34888 consumed. */
34890 static bool
34892 {
34894 {
34895 /* In C++98 the `template' keyword can only be used within templates;
34896 outside templates the parser can always figure out what is a
34897 template and what is not. In C++11, per the resolution of DR 468,
34898 `template' is allowed in cases where it is not strictly necessary. */
34901 {
34904 "in C++98 %<template%> (as a disambiguator) is only "
34906 /* If this part of the token stream is rescanned, the same
34907 error message would be generated. So, we purge the token
34908 from the stream. */
34911 }
34912 else
34913 {
34914 /* Consume the `template' keyword. */
34917 }
34918 }
34920 }
34922 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
34923 set PARSER->SCOPE, and perform other related actions. */
34925 static void
34927 {
34930 /* Get the stored value. */
34932 /* Set the scope from the stored value. */
34937 }
34939 /* Consume tokens up through a non-nested END token. Returns TRUE if we
34940 encounter the end of a block before what we were looking for. */
34942 static bool
34946 {
34948 {
34951 /* Abort a parenthesized expression if we encounter a semicolon. */
34955 /* If we've reached the end of the file, stop. */
34961 /* We've hit the end of an enclosing block, so there's been some
34962 kind of syntax error. */
34965 /* Consume the token. */
34967 /* See if it starts a new group. */
34969 {
34971 /* In theory this should probably check end == '}', but
34972 cp_parser_save_member_function_body needs it to exit
34973 after either '}' or ')' when called with ')'. */
34976 }
34978 {
34982 }
34987 }
34988 }
34990 /* Like above, for caching a default argument or NSDMI. Both of these are
34991 terminated by a non-nested comma, but it can be unclear whether or not a
34992 comma is nested in a template argument list unless we do more parsing.
34993 In order to handle this ambiguity, when we encounter a ',' after a '<'
34994 we try to parse what follows as a parameter-declaration-list (in the
34995 case of a default argument) or a member-declarator (in the case of an
34996 NSDMI). If that succeeds, then we stop caching. */
34998 static tree
35000 {
35005 tree default_argument;
35007 /* Add tokens until we have processed the entire default
35008 argument. We add the range [first_token, token). */
35011 {
35012 /* For list-initialization, this is straightforward. */
35015 }
35017 {
35020 /* Peek at the next token. */
35022 /* What we do depends on what token we have. */
35024 {
35025 /* In valid code, a default argument must be
35026 immediately followed by a `,' `)', or `...'. */
35029 {
35030 /* If we've seen a '<', we might be in a
35031 template-argument-list. Until Core issue 325 is
35032 resolved, we don't know how this situation ought
35033 to be handled, so try to DTRT. We check whether
35034 what comes after the comma is a valid parameter
35035 declaration list. If it is, then the comma ends
35036 the default argument; otherwise the default
35037 argument continues. */
35041 /* Set ITALP so cp_parser_parameter_declaration_list
35042 doesn't decide to commit to this parse. */
35049 {
35050 /* Parse declarators until we reach a non-comma or
35051 somthing that cannot be an initializer.
35052 Just checking whether we're looking at a single
35053 declarator is insufficient. Consider:
35054 int var = tuple<T,U>::x;
35055 The template parameter 'U' looks exactly like a
35056 declarator. */
35057 do
35058 {
35062 CP_PARSER_FLAGS_NONE,
35071 }
35073 /* If we met an '=' or ';' then the original comma
35074 was the end of the NSDMI. Otherwise assume
35075 we're still in the NSDMI. */
35078 }
35079 else
35080 {
35083 tree t = cp_parser_parameter_declaration_list
35089 }
35096 }
35097 /* FALLTHRU */
35100 /* If we run into a non-nested `;', `}', or `]',
35101 then the code is invalid -- but the default
35102 argument is certainly over. */
35107 /* Handle correctly int n = sizeof ... ( p ); */
35110 /* Update DEPTH, if necessary. */
35125 /* This might be the comparison operator, or it might
35126 start a template argument list. */
35133 /* Fall through for C++0x, which treats the `>>'
35134 operator like two `>' tokens in certain
35135 cases. */
35140 {
35141 /* This might be an operator, or it might close a
35142 template argument list. But if a previous '<'
35143 started a template argument list, this will have
35144 closed it, so we can't be in one anymore. */
35148 }
35151 /* If we run out of tokens, issue an error message. */
35159 /* In these cases, we should look for template-ids.
35160 For example, if the default argument is
35161 `X<int, double>()', we need to do name lookup to
35162 figure out whether or not `X' is a template; if
35163 so, the `,' does not end the default argument.
35165 That is not yet done. */
35170 }
35172 /* If we've reached the end, stop. */
35176 /* Add the token to the token block. */
35178 }
35180 /* Create a DEFERRED_PARSE to represent the unparsed default
35181 argument. */
35188 }
35190 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
35192 location_t
35194 {
35199 }
35201 /* Begin parsing tentatively. We always save tokens while parsing
35202 tentatively so that if the tentative parsing fails we can restore the
35203 tokens. */
35205 static void
35207 {
35208 /* Enter a new parsing context. */
35210 /* Begin saving tokens. */
35212 /* In order to avoid repetitive access control error messages,
35213 access checks are queued up until we are no longer parsing
35214 tentatively. */
35216 }
35218 /* Commit to the currently active tentative parse. */
35220 static void
35222 {
35226 /* Mark all of the levels as committed. */
35229 {
35236 }
35237 }
35239 /* Commit to the topmost currently active tentative parse.
35241 Note that this function shouldn't be called when there are
35242 irreversible side-effects while in a tentative state. For
35243 example, we shouldn't create a permanent entry in the symbol
35244 table, or issue an error message that might not apply if the
35245 tentative parse is aborted. */
35247 static void
35249 {
35254 {
35262 }
35263 }
35265 /* Abort the currently active tentative parse. All consumed tokens
35266 will be rolled back, and no diagnostics will be issued. */
35268 static void
35270 {
35274 /* Now, pretend that we want to see if the construct was
35275 successfully parsed. */
35277 }
35279 /* Stop parsing tentatively. If a parse error has occurred, restore the
35280 token stream. Otherwise, commit to the tokens we have consumed.
35281 Returns true if no error occurred; false otherwise. */
35283 static bool
35285 {
35289 /* Remember whether or not an error occurred, since we are about to
35290 destroy that information. */
35292 /* Remove the topmost context from the stack. */
35295 /* If no parse errors occurred, commit to the tentative parse. */
35297 {
35298 /* Commit to the tokens read tentatively, unless that was
35299 already done. */
35304 }
35305 /* Otherwise, if errors occurred, roll back our state so that things
35306 are just as they were before we began the tentative parse. */
35307 else
35308 {
35311 }
35312 /* Add the context to the front of the free list. */
35317 }
35319 /* Returns true if we are parsing tentatively and are not committed to
35320 this tentative parse. */
35322 static bool
35324 {
35327 }
35329 /* Returns nonzero iff an error has occurred during the most recent
35330 tentative parse. */
35332 static bool
35334 {
35337 }
35339 /* Returns nonzero if GNU extensions are allowed. */
35341 static bool
35343 {
35345 }
35346 \f
35347 /* Objective-C++ Productions */
35350 /* Parse an Objective-C expression, which feeds into a primary-expression
35351 above.
35353 objc-expression:
35354 objc-message-expression
35355 objc-string-literal
35356 objc-encode-expression
35357 objc-protocol-expression
35358 objc-selector-expression
35360 Returns a tree representation of the expression. */
35362 static cp_expr
35364 {
35365 /* Try to figure out what kind of declaration is present. */
35369 {
35379 {
35391 }
35392 /* FALLTHRU */
35398 }
35401 }
35403 /* Parse an Objective-C message expression.
35405 objc-message-expression:
35406 [ objc-message-receiver objc-message-args ]
35408 Returns a representation of an Objective-C message. */
35410 static tree
35412 {
35425 /* Construct a location e.g.
35426 [self func1:5]
35427 ^~~~~~~~~~~~~~
35428 ranging from the '[' to the ']', with the caret at the start. */
35434 }
35436 /* Parse an objc-message-receiver.
35438 objc-message-receiver:
35439 expression
35440 simple-type-specifier
35442 Returns a representation of the type or expression. */
35444 static tree
35446 {
35447 tree rcv;
35449 /* An Objective-C message receiver may be either (1) a type
35450 or (2) an expression. */
35454 /* If that worked out, fine. */
35461 CP_PARSER_FLAGS_NONE);
35468 }
35470 /* Parse the arguments and selectors comprising an Objective-C message.
35472 objc-message-args:
35473 objc-selector
35474 objc-selector-args
35475 objc-selector-args , objc-comma-args
35477 objc-selector-args:
35478 objc-selector [opt] : assignment-expression
35479 objc-selector-args objc-selector [opt] : assignment-expression
35481 objc-comma-args:
35482 assignment-expression
35483 objc-comma-args , assignment-expression
35485 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
35486 selector arguments and TREE_VALUE containing a list of comma
35487 arguments. */
35489 static tree
35491 {
35497 {
35503 /* Detect if we have a unary selector. */
35512 sel_args
35517 }
35519 /* Handle non-selector arguments, if any. */
35521 {
35522 tree arg;
35527 addl_args
35532 }
35535 {
35538 }
35541 }
35543 /* Parse an Objective-C encode expression.
35545 objc-encode-expression:
35546 @encode objc-typename
35548 Returns an encoded representation of the type argument. */
35550 static cp_expr
35552 {
35553 tree type;
35558 matching_parens parens;
35565 {
35569 }
35571 /* This happens if we find @encode(T) (where T is a template
35572 typename or something dependent on a template typename) when
35573 parsing a template. In that case, we can't compile it
35574 immediately, but we rather create an AT_ENCODE_EXPR which will
35575 need to be instantiated when the template is used.
35576 */
35578 {
35582 }
35585 /* Build a location of the form:
35586 @encode(int)
35587 ^~~~~~~~~~~~
35588 with caret==start at the @ token, finishing at the close paren. */
35592 }
35594 /* Parse an Objective-C @defs expression. */
35596 static tree
35598 {
35599 tree name;
35602 matching_parens parens;
35608 }
35610 /* Parse an Objective-C protocol expression.
35612 objc-protocol-expression:
35613 @protocol ( identifier )
35615 Returns a representation of the protocol expression. */
35617 static tree
35619 {
35620 tree proto;
35624 matching_parens parens;
35629 /* Build a location of the form:
35630 @protocol(prot)
35631 ^~~~~~~~~~~~~~~
35632 with caret==start at the @ token, finishing at the close paren. */
35637 }
35639 /* Parse an Objective-C selector expression.
35641 objc-selector-expression:
35642 @selector ( objc-method-signature )
35644 objc-method-signature:
35645 objc-selector
35646 objc-selector-seq
35648 objc-selector-seq:
35649 objc-selector :
35650 objc-selector-seq objc-selector :
35652 Returns a representation of the method selector. */
35654 static tree
35656 {
35663 matching_parens parens;
35669 {
35678 {
35679 /* Detect if we have a unary selector. */
35681 {
35684 }
35685 else
35686 {
35688 }
35689 }
35694 {
35695 sel_seq
35698 sel_seq
35701 }
35702 else
35703 sel_seq
35708 }
35710 finish_selector:
35714 /* Build a location of the form:
35715 @selector(func)
35716 ^~~~~~~~~~~~~~~
35717 with caret==start at the @ token, finishing at the close paren. */
35720 /* TODO: objc_build_selector_expr doesn't always honor the location. */
35723 }
35725 /* Parse a list of identifiers.
35727 objc-identifier-list:
35728 identifier
35729 objc-identifier-list , identifier
35731 Returns a TREE_LIST of identifier nodes. */
35733 static tree
35735 {
35736 tree identifier;
35737 tree list;
35748 {
35755 identifier));
35757 }
35760 }
35762 /* Parse an Objective-C alias declaration.
35764 objc-alias-declaration:
35765 @compatibility_alias identifier identifier ;
35767 This function registers the alias mapping with the Objective-C front end.
35768 It returns nothing. */
35770 static void
35772 {
35780 }
35782 /* Parse an Objective-C class forward-declaration.
35784 objc-class-declaration:
35785 @class objc-identifier-list ;
35787 The function registers the forward declarations with the Objective-C
35788 front end. It returns nothing. */
35790 static void
35792 {
35795 {
35796 tree id;
35806 else
35808 }
35810 }
35812 /* Parse a list of Objective-C protocol references.
35814 objc-protocol-refs-opt:
35815 objc-protocol-refs [opt]
35817 objc-protocol-refs:
35818 < objc-identifier-list >
35820 Returns a TREE_LIST of identifiers, if any. */
35822 static tree
35824 {
35828 {
35832 }
35835 }
35837 /* Parse a Objective-C visibility specification. */
35839 static void
35841 {
35845 {
35860 }
35862 /* Eat '@private'/'@protected'/'@public'. */
35864 }
35866 /* Parse an Objective-C method type. Return 'true' if it is a class
35867 (+) method, and 'false' if it is an instance (-) method. */
35871 {
35874 else
35876 }
35878 /* Parse an Objective-C protocol qualifier. */
35880 static tree
35882 {
35895 {
35900 }
35903 }
35905 /* Parse an Objective-C typename. */
35907 static tree
35909 {
35913 {
35916 matching_parens parens;
35920 /* An ObjC type name may consist of just protocol qualifiers, in which
35921 case the type shall default to 'id'. */
35923 {
35926 /* If the type could not be parsed, an error has already
35927 been produced. For error recovery, behave as if it had
35928 not been specified, which will use the default type
35929 'id'. */
35931 {
35933 /* We need to skip to the closing parenthesis as
35934 cp_parser_type_id() does not seem to do it for
35935 us. */
35940 }
35941 }
35945 }
35948 }
35950 /* Check to see if TYPE refers to an Objective-C selector name. */
35952 static bool
35954 {
35960 }
35962 /* Parse an Objective-C selector. */
35964 static tree
35966 {
35970 {
35973 }
35975 /* C++ operator names are allowed to appear in ObjC selectors. */
35977 {
35990 }
35991 }
35993 /* Parse an Objective-C params list. */
35995 static tree
35997 {
36003 {
36013 /* Detect if we have a unary selector. */
36016 {
36019 }
36023 {
36024 /* Something went quite wrong. There should be a colon
36025 here, but there is not. Stop parsing parameters. */
36027 }
36029 /* New ObjC allows attributes on parameters too. */
36034 params
36037 type_name,
36038 identifier,
36039 parm_attr));
36042 }
36045 {
36048 }
36050 /* We allow tail attributes for the method. */
36052 {
36060 }
36063 {
36066 }
36068 }
36070 /* Parse the non-keyword Objective-C params. */
36072 static tree
36075 {
36081 {
36083 tree parm;
36089 {
36094 }
36096 /* TODO: parse attributes for tail parameters. */
36106 }
36108 /* We allow tail attributes for the method. */
36110 {
36112 {
36117 }
36118 else
36119 /* We have an error, but parse the attributes, so that we can
36120 carry on. */
36126 }
36129 }
36131 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
36133 static void
36135 {
36138 /* If the next token is `extern' and the following token is a string
36139 literal, then we have a linkage specification. */
36141 && cp_parser_is_pure_string_literal
36144 /* Handle #pragma, if any. */
36147 /* Allow stray semicolons. */
36150 /* Mark methods as optional or required, when building protocols. */
36152 {
36155 }
36157 {
36160 }
36163 /* Other stray characters must generate errors. */
36165 {
36169 }
36170 /* Finally, try to parse a block-declaration, or a function-definition. */
36171 else
36173 }
36175 /* Parse a method signature. */
36177 static tree
36179 {
36195 }
36197 static bool
36199 {
36200 tree tattr;
36205 /* If the attributes are followed by a method introducer, this is not allowed.
36206 Dump the attributes and flag the situation. */
36211 /* Otherwise, the attributes introduce some interstitial code, possibly so
36212 rewind to allow that check. */
36215 }
36217 /* Parse an Objective-C method prototype list. */
36219 static void
36221 {
36225 {
36227 {
36232 else
36236 {
36240 }
36243 }
36249 OPT_Wattributes,
36251 else
36252 /* Allow for interspersed non-ObjC++ code. */
36256 }
36260 else
36264 }
36266 /* Parse an Objective-C method definition list. */
36268 static void
36270 {
36272 {
36276 {
36279 }
36281 {
36284 }
36286 {
36290 tree attribute;
36294 else
36295 {
36299 /* For historical reasons, we accept an optional semicolon. */
36305 tree meth
36309 }
36310 }
36311 /* The following case will be removed once @synthesize is
36312 completely implemented. */
36323 else
36324 /* Allow for interspersed non-ObjC++ code. */
36326 }
36329 }
36331 /* Parse Objective-C ivars. */
36333 static void
36335 {
36346 {
36347 cp_decl_specifier_seq declspecs;
36349 tree prefix_attributes;
36357 CP_PARSER_FLAGS_OPTIONAL,
36361 /* auto, register, static, extern, mutable. */
36363 {
36366 }
36368 /* thread_local. */
36370 {
36373 }
36375 /* typedef. */
36377 {
36380 }
36385 /* Keep going until we hit the `;' at the end of the
36386 declaration. */
36388 {
36393 /* Check for a (possibly unnamed) bitfield declaration. */
36401 {
36402 /* Get the name of the bitfield. */
36407 eat_colon:
36409 /* Get the width of the bitfield. */
36410 width
36412 }
36413 else
36414 {
36415 /* Parse the declarator. */
36416 declarator
36418 CP_PARSER_FLAGS_NONE,
36424 }
36426 /* Look for attributes that apply to the ivar. */
36428 /* Remember which attributes are prefix attributes and
36429 which are not. */
36431 /* Combine the attributes. */
36435 /* Create the bitfield declaration. */
36438 else
36443 /* Add the instance variable. */
36447 /* Reset PREFIX_ATTRIBUTES. */
36449 {
36454 }
36459 {
36462 }
36464 }
36468 }
36473 /* Do not consume the RID_AT_END, so it will be read again as terminating
36474 the @interface of @implementation. */
36478 /* For historical reasons, we accept an optional semicolon. */
36481 }
36483 /* Parse an Objective-C protocol declaration. */
36485 static void
36487 {
36493 {
36498 }
36500 /* See if we have a forward declaration or a definition. */
36503 /* Try a forward declaration first. */
36505 {
36507 {
36508 tree id;
36518 else
36520 }
36522 }
36524 /* Ok, we got a full-fledged definition (or at least should). */
36525 else
36526 {
36531 }
36532 }
36534 /* Parse an Objective-C superclass or category. */
36536 static void
36541 {
36547 {
36550 }
36552 {
36553 matching_parens parens;
36556 /* If there is no category name, and this is an @interface, we
36557 have a class extension. */
36559 {
36562 }
36563 else
36567 }
36568 }
36570 /* Parse an Objective-C class interface. */
36572 static void
36574 {
36582 {
36583 /* It's hard to recover because even if valid @interface stuff
36584 is to follow, we can't compile it (or validate it) if we
36585 don't even know which class it refers to. Let's assume this
36586 was a stray '@interface' token in the stream and skip it.
36587 */
36589 }
36594 /* We have either a class or a category on our hands. */
36597 else
36598 {
36600 /* Handle instance variable declarations, if any. */
36603 }
36606 }
36608 /* Parse an Objective-C class implementation. */
36610 static void
36612 {
36619 {
36620 /* It's hard to recover because even if valid @implementation
36621 stuff is to follow, we can't compile it (or validate it) if
36622 we don't even know which class it refers to. Let's assume
36623 this was a stray '@implementation' token in the stream and
36624 skip it.
36625 */
36627 }
36631 /* We have either a class or a category on our hands. */
36634 else
36635 {
36637 /* Handle instance variable declarations, if any. */
36640 }
36643 }
36645 /* Consume the @end token and finish off the implementation. */
36647 static void
36649 {
36652 }
36654 /* Parse an Objective-C declaration. */
36656 static void
36658 {
36659 /* Try to figure out what kind of declaration is present. */
36664 {
36680 }
36683 {
36706 }
36707 }
36709 /* Parse an Objective-C try-catch-finally statement.
36711 objc-try-catch-finally-stmt:
36712 @try compound-statement objc-catch-clause-seq [opt]
36713 objc-finally-clause [opt]
36715 objc-catch-clause-seq:
36716 objc-catch-clause objc-catch-clause-seq [opt]
36718 objc-catch-clause:
36719 @catch ( objc-exception-declaration ) compound-statement
36721 objc-finally-clause:
36722 @finally compound-statement
36724 objc-exception-declaration:
36725 parameter-declaration
36726 '...'
36728 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
36730 Returns NULL_TREE.
36732 PS: This function is identical to c_parser_objc_try_catch_finally_statement
36733 for C. Keep them in sync. */
36735 static tree
36737 {
36738 location_t location;
36739 tree stmt;
36744 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
36745 node, lest it get absorbed into the surrounding block. */
36751 {
36755 matching_parens parens;
36761 {
36762 /* We have "@catch (...)" (where the '...' are literally
36763 what is in the code). Skip the '...'.
36764 parameter_declaration is set to NULL_TREE, and
36765 objc_being_catch_clauses() knows that that means
36766 '...'. */
36769 }
36770 else
36771 {
36772 /* We have "@catch (NSException *exception)" or something
36773 like that. Parse the parameter declaration. */
36778 else
36783 }
36786 else
36787 {
36788 /* If there was no open parenthesis, we are recovering from
36789 an error, and we are trying to figure out what mistake
36790 the user has made. */
36792 /* If there is an immediate closing parenthesis, the user
36793 probably forgot the opening one (ie, they typed "@catch
36794 NSException *e)". Parse the closing parenthesis and keep
36795 going. */
36799 /* If these is no immediate closing parenthesis, the user
36800 probably doesn't know that parenthesis are required at
36801 all (ie, they typed "@catch NSException *e"). So, just
36802 forget about the closing parenthesis and keep going. */
36803 }
36807 }
36809 {
36812 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
36813 node, lest it get absorbed into the surrounding block. */
36817 }
36820 }
36822 /* Parse an Objective-C synchronized statement.
36824 objc-synchronized-stmt:
36825 @synchronized ( expression ) compound-statement
36827 Returns NULL_TREE. */
36829 static tree
36831 {
36832 location_t location;
36839 matching_parens parens;
36844 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
36845 node, lest it get absorbed into the surrounding block. */
36850 }
36852 /* Parse an Objective-C throw statement.
36854 objc-throw-stmt:
36855 @throw assignment-expression [opt] ;
36857 Returns a constructed '@throw' statement. */
36859 static tree
36861 {
36873 }
36875 /* Parse an Objective-C statement. */
36877 static tree
36879 {
36880 /* Try to figure out what kind of declaration is present. */
36884 {
36895 }
36898 }
36900 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
36901 look ahead to see if an objc keyword follows the attributes. This
36902 is to detect the use of prefix attributes on ObjC @interface and
36903 @protocol. */
36905 static bool
36907 {
36912 {
36916 else
36919 }
36922 }
36924 /* This routine is a minimal replacement for
36925 c_parser_struct_declaration () used when parsing the list of
36926 types/names or ObjC++ properties. For example, when parsing the
36927 code
36929 @property (readonly) int a, b, c;
36931 this function is responsible for parsing "int a, int b, int c" and
36932 returning the declarations as CHAIN of DECLs.
36934 TODO: Share this code with cp_parser_objc_class_ivars. It's very
36935 similar parsing. */
36936 static tree
36938 {
36940 cp_decl_specifier_seq declspecs;
36942 tree prefix_attributes;
36945 CP_PARSER_FLAGS_NONE,
36952 /* auto, register, static, extern, mutable. */
36954 {
36957 }
36959 /* thread_local. */
36961 {
36964 }
36966 /* typedef. */
36968 {
36971 }
36976 /* Keep going until we hit the `;' at the end of the declaration. */
36978 {
36983 /* Parse the declarator. */
36985 CP_PARSER_FLAGS_NONE,
36988 /* Look for attributes that apply to the ivar. */
36990 /* Remember which attributes are prefix attributes and
36991 which are not. */
36993 /* Combine the attributes. */
37003 /* Reset PREFIX_ATTRIBUTES. */
37005 {
37010 }
37017 {
37020 }
37021 else
37023 }
37025 }
37027 /* Parse an Objective-C @property declaration. The syntax is:
37029 objc-property-declaration:
37030 '@property' objc-property-attributes[opt] struct-declaration ;
37032 objc-property-attributes:
37033 '(' objc-property-attribute-list ')'
37035 objc-property-attribute-list:
37036 objc-property-attribute
37037 objc-property-attribute-list, objc-property-attribute
37039 objc-property-attribute
37040 'getter' = identifier
37041 'setter' = identifier
37042 'readonly'
37043 'readwrite'
37044 'assign'
37045 'retain'
37046 'copy'
37047 'nonatomic'
37049 For example:
37050 @property NSString *name;
37051 @property (readonly) id object;
37052 @property (retain, nonatomic, getter=getTheName) id name;
37053 @property int a, b, c;
37055 PS: This function is identical to
37056 c_parser_objc_at_property_declaration for C. Keep them in sync. */
37057 static void
37059 {
37060 /* Parse the optional attribute list.
37062 A list of parsed, but not verified, attributes. */
37068 /* Parse the optional attribute list... */
37070 {
37071 /* Eat the '('. */
37072 matching_parens parens;
37077 /* Allow empty @property attribute lists, but with a warning. */
37079 location_t attr_comb;
37081 {
37085 }
37086 else
37088 {
37095 {
37102 }
37113 /* Account for accepting the 'class' keyword in this context. */
37115 else
37119 enum objc_property_attribute_kind prop_kind
37121 property_attribute_info *prop
37125 tree meth_name;
37127 {
37132 attr_name);
37133 else
37141 {
37144 attr_name);
37147 }
37155 {
37158 attr_name);
37161 }
37163 /* Get the end of the method name, and consume the name. */
37166 /* Because method names may contain C++ keywords, we have a
37167 routine to fetch them (this also consumes the token). */
37171 {
37173 {
37175 attr_end);
37179 }
37180 else
37181 {
37185 }
37187 attr_end);
37188 }
37189 else
37191 attr_end);
37193 /* Updated location including all that was successfully
37194 parsed. */
37197 }
37199 /* If we see a comma here, then keep going - even if we already
37200 saw a syntax error. For simple mistakes e.g. (asign, getter=x)
37201 this makes a more useful output and avoid spurious warnings
37202 about missing attributes that are, in fact, specified after the
37203 one with the syntax error. */
37206 else
37208 }
37214 }
37216 /* 'properties' is the list of properties that we read. Usually a
37217 single one, but maybe more (eg, in "@property int a, b, c;" there
37218 are three).
37219 TODO: Update this parsing so that it accepts (erroneous) bitfields so
37220 that we can issue a meaningful and consistent (between C/C++) error
37221 message from objc_add_property_declaration (). */
37228 else
37229 {
37230 /* Comma-separated properties are chained together in reverse order;
37231 add them one by one. */
37235 prop_attr_list);
37236 }
37239 }
37241 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
37243 objc-synthesize-declaration:
37244 @synthesize objc-synthesize-identifier-list ;
37246 objc-synthesize-identifier-list:
37247 objc-synthesize-identifier
37248 objc-synthesize-identifier-list, objc-synthesize-identifier
37250 objc-synthesize-identifier
37251 identifier
37252 identifier = identifier
37254 For example:
37255 @synthesize MyProperty;
37256 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
37258 PS: This function is identical to c_parser_objc_at_synthesize_declaration
37259 for C. Keep them in sync.
37260 */
37261 static void
37263 {
37265 location_t loc;
37270 {
37274 {
37277 }
37279 {
37283 {
37286 }
37287 }
37288 else
37293 else
37295 }
37298 }
37300 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
37302 objc-dynamic-declaration:
37303 @dynamic identifier-list ;
37305 For example:
37306 @dynamic MyProperty;
37307 @dynamic MyProperty, AnotherProperty;
37309 PS: This function is identical to c_parser_objc_at_dynamic_declaration
37310 for C. Keep them in sync.
37311 */
37312 static void
37314 {
37316 location_t loc;
37321 {
37322 tree property;
37325 {
37328 }
37332 else
37334 }
37337 }
37339 \f
37340 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
37342 /* Returns name of the next clause.
37343 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
37344 the token is not consumed. Otherwise appropriate pragma_omp_clause is
37345 returned and the token is consumed. */
37347 static pragma_omp_clause
37349 {
37365 {
37370 {
37589 }
37590 }
37596 }
37598 /* Validate that a clause of the given type does not already exist. */
37600 static void
37603 {
37606 }
37608 /* OpenMP 2.5:
37609 variable-list:
37610 identifier
37611 variable-list , identifier
37613 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
37614 colon). An opening parenthesis will have been consumed by the caller.
37616 If KIND is nonzero, create the appropriate node and install the decl
37617 in OMP_CLAUSE_DECL and add the node to the head of the list.
37619 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
37620 return the list created.
37622 COLON can be NULL if only closing parenthesis should end the list,
37623 or pointer to bool which will receive false if the list is terminated
37624 by closing parenthesis or true if the list is terminated by colon.
37626 The optional ALLOW_DEREF argument is true if list items can use the deref
37627 (->) operator. */
37629 struct omp_dim
37630 {
37632 location_t loc;
37636 };
37638 static tree
37642 {
37648 {
37651 }
37653 {
37661 {
37667 }
37671 {
37672 cp_id_kind idk;
37675 }
37680 CPP_CLOSE_PAREN)))
37681 {
37684 }
37685 else
37686 {
37693 {
37698 }
37702 else
37705 {
37711 }
37712 }
37716 ;
37718 {
37720 {
37722 /* The OpenACC cache directive explicitly only allows "array
37723 elements or subarrays". */
37725 {
37729 }
37730 /* FALLTHROUGH. */
37734 start_component_ref:
37736 || (allow_deref
37738 {
37739 cpp_ttype ttype
37742 location_t loc
37747 decl = (cp_parser_postfix_dot_deref_expression
37750 }
37751 /* FALLTHROUGH. */
37761 {
37769 {
37772 /* Later handling is not prepared to see through these. */
37774 }
37776 parser->colon_corrects_to_scope_p
37779 {
37782 }
37783 else
37784 {
37785 /* Look for `:'. */
37787 {
37792 }
37795 else
37798 CPP_CLOSE_SQUARE))
37799 {
37801 /* Later handling is not prepared to see through these. */
37803 }
37804 }
37805 /* Look for the closing `]'. */
37807 RT_CLOSE_SQUARE))
37808 {
37813 }
37816 }
37821 && !array_section_p
37823 || (allow_deref
37825 CPP_DEREF))))
37826 {
37828 {
37832 }
37834 }
37835 else
37842 }
37845 {
37849 {
37850 depend_lvalue:
37854 }
37855 else
37857 }
37863 }
37864 else
37867 get_comma:
37871 }
37877 {
37881 }
37884 {
37887 /* Try to resync to an unnested comma. Copied from
37888 cp_parser_parenthesized_expression_list. */
37889 skip_comma:
37898 }
37901 }
37903 /* Similarly, but expect leading and trailing parenthesis. This is a very
37904 common case for omp clauses. */
37906 static tree
37909 {
37912 allow_deref);
37914 }
37916 /* OpenACC 2.0:
37917 copy ( variable-list )
37918 copyin ( variable-list )
37919 copyout ( variable-list )
37920 create ( variable-list )
37921 delete ( variable-list )
37922 present ( variable-list )
37924 OpenACC 2.6:
37925 no_create ( variable-list )
37926 attach ( variable-list )
37927 detach ( variable-list ) */
37929 static tree
37931 tree list)
37932 {
37935 {
37977 }
37985 }
37987 /* OpenACC 2.0:
37988 deviceptr ( variable-list ) */
37990 static tree
37992 {
37996 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
37997 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
37998 variable-list must only allow for pointer variables. */
38001 {
38008 }
38011 }
38013 /* OpenACC 2.5:
38014 auto
38015 finalize
38016 independent
38017 nohost
38018 seq */
38020 static tree
38022 tree list)
38023 {
38030 }
38032 /* OpenACC:
38033 num_gangs ( expression )
38034 num_workers ( expression )
38035 vector_length ( expression ) */
38037 static tree
38040 {
38043 matching_parens parens;
38051 {
38056 }
38064 }
38066 /* OpenACC:
38068 gang [( gang-arg-list )]
38069 worker [( [num:] int-expr )]
38070 vector [( [length:] int-expr )]
38072 where gang-arg is one of:
38074 [num:] int-expr
38075 static: size-expr
38077 and size-expr may be:
38079 *
38080 int-expr
38081 */
38083 static tree
38085 omp_clause_code kind,
38087 {
38096 {
38097 matching_parens parens;
38100 do
38101 {
38105 /* Gang static argument. */
38108 {
38116 {
38119 }
38121 /* Check for the '*' argument. */
38125 CPP_CLOSE_PAREN)))
38126 {
38131 {
38134 }
38136 }
38137 }
38138 /* Worker num: argument and vector length: arguments. */
38142 {
38145 }
38147 /* Now collect the actual argument. */
38149 {
38152 }
38164 {
38167 }
38169 }
38174 }
38188 cleanup_error:
38191 }
38193 /* OpenACC 2.0:
38194 tile ( size-expr-list ) */
38196 static tree
38198 {
38202 /* Collapse and tile are mutually exclusive. (The spec doesn't say
38203 so, but the spec authors never considered such a case and have
38204 differing opinions on what it might mean, including 'not
38205 allowed'.) */
38208 clause_loc);
38213 do
38214 {
38221 {
38224 }
38225 else
38229 }
38232 /* Consume the trailing ')'. */
38240 }
38242 /* OpenACC 2.0
38243 Parse wait clause or directive parameters. */
38245 static tree
38247 {
38257 {
38259 {
38262 }
38264 }
38271 {
38275 {
38278 else
38279 {
38286 }
38287 }
38288 }
38291 }
38293 /* OpenACC:
38294 wait [( int-expr-list )] */
38296 static tree
38298 {
38303 else
38304 {
38310 }
38313 }
38315 /* OpenMP 3.0:
38316 collapse ( constant-expression ) */
38318 static tree
38320 {
38322 location_t loc;
38323 HOST_WIDE_INT n;
38326 matching_parens parens;
38344 {
38347 }
38356 }
38358 /* OpenMP 2.5:
38359 default ( none | shared )
38361 OpenMP 5.1:
38362 default ( private | firstprivate )
38364 OpenACC:
38365 default ( none | present ) */
38367 static tree
38370 {
38372 tree c;
38374 matching_parens parens;
38378 {
38381 }
38383 {
38388 {
38415 }
38418 }
38419 else
38420 {
38421 invalid_kind:
38424 else
38427 }
38444 }
38446 /* OpenMP 3.1:
38447 final ( expression ) */
38449 static tree
38451 {
38454 matching_parens parens;
38473 }
38475 /* OpenMP 2.5:
38476 if ( expression )
38478 OpenMP 4.5:
38479 if ( directive-name-modifier : expression )
38481 directive-name-modifier:
38482 parallel | task | taskloop | target data | target | target update
38483 | target enter data | target exit data
38485 OpenMP 5.0:
38486 directive-name-modifier:
38487 ... | simd | cancel */
38489 static tree
38492 {
38496 matching_parens parens;
38501 {
38517 {
38520 {
38533 else
38534 {
38535 location_t loc
38540 }
38543 {
38545 {
38550 }
38552 {
38553 location_t loc
38557 }
38558 }
38559 }
38560 }
38562 {
38564 {
38567 }
38568 else
38569 {
38571 {
38572 location_t loc
38575 }
38577 }
38578 }
38579 }
38591 {
38594 {
38597 {
38609 }
38611 p);
38613 }
38615 {
38618 else
38621 }
38624 {
38628 }
38629 }
38637 }
38639 /* OpenMP 3.1:
38640 mergeable */
38642 static tree
38645 {
38646 tree c;
38649 location);
38654 }
38656 /* OpenMP 2.5:
38657 nowait */
38659 static tree
38662 {
38663 tree c;
38670 }
38672 /* OpenMP 2.5:
38673 num_threads ( expression ) */
38675 static tree
38677 location_t location)
38678 {
38681 matching_parens parens;
38701 }
38703 /* OpenMP 4.5:
38704 num_tasks ( expression )
38706 OpenMP 5.1:
38707 num_tasks ( strict : expression ) */
38709 static tree
38711 location_t location)
38712 {
38715 matching_parens parens;
38722 {
38725 {
38729 }
38730 }
38749 }
38751 /* OpenMP 4.5:
38752 grainsize ( expression )
38754 OpenMP 5.1:
38755 grainsize ( strict : expression ) */
38757 static tree
38759 location_t location)
38760 {
38763 matching_parens parens;
38770 {
38773 {
38777 }
38778 }
38797 }
38799 /* OpenMP 4.5:
38800 priority ( expression ) */
38802 static tree
38804 location_t location)
38805 {
38808 matching_parens parens;
38828 }
38830 /* OpenMP 4.5:
38831 hint ( expression ) */
38833 static tree
38835 {
38838 matching_parens parens;
38845 {
38853 }
38866 }
38868 /* OpenMP 5.1:
38869 filter ( integer-expression ) */
38871 static tree
38873 {
38876 matching_parens parens;
38894 }
38896 /* OpenMP 4.5:
38897 defaultmap ( tofrom : scalar )
38899 OpenMP 5.0:
38900 defaultmap ( implicit-behavior [ : variable-category ] ) */
38902 static tree
38904 location_t location)
38905 {
38909 enum omp_clause_defaultmap_kind category
38912 matching_parens parens;
38919 {
38920 invalid_behavior:
38922 "%<tofrom%>, %<firstprivate%>, %<none%> "
38925 }
38926 else
38927 {
38930 }
38933 {
38937 else
38944 else
38953 else
38960 else
38967 else
38976 else
38982 }
38986 {
38991 {
38992 invalid_category:
38996 }
39001 {
39007 else
39014 else
39021 else
39027 }
39030 }
39043 {
39053 {
39071 }
39074 p);
39075 else
39079 }
39086 out_err:
39091 }
39093 /* OpenMP 5.0:
39094 order ( concurrent )
39096 OpenMP 5.1:
39097 order ( order-modifier : concurrent )
39099 order-modifier:
39100 reproducible
39101 unconstrained */
39103 static tree
39105 {
39111 matching_parens parens;
39117 {
39124 else
39125 {
39129 }
39132 }
39134 {
39137 }
39138 else
39139 {
39142 }
39144 {
39147 }
39159 out_err:
39164 }
39166 /* OpenMP 5.0:
39167 bind ( teams | parallel | thread ) */
39169 static tree
39171 location_t location)
39172 {
39173 tree c;
39177 matching_parens parens;
39182 {
39183 invalid:
39187 }
39188 else
39189 {
39192 }
39203 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
39209 out_err:
39214 }
39216 /* OpenMP 2.5:
39217 ordered
39219 OpenMP 4.5:
39220 ordered ( constant-expression ) */
39222 static tree
39225 {
39227 HOST_WIDE_INT n;
39233 {
39234 matching_parens parens;
39251 {
39253 "ordered argument needs positive constant integer "
39256 }
39257 }
39263 }
39265 /* OpenMP 2.5:
39266 reduction ( reduction-operator : variable-list )
39268 reduction-operator:
39269 One of: + * - & ^ | && ||
39271 OpenMP 3.1:
39273 reduction-operator:
39274 One of: + * - & ^ | && || min max
39276 OpenMP 4.0:
39278 reduction-operator:
39279 One of: + * - & ^ | && ||
39280 id-expression
39282 OpenMP 5.0:
39283 reduction ( reduction-modifier, reduction-operator : variable-list )
39284 in_reduction ( reduction-operator : variable-list )
39285 task_reduction ( reduction-operator : variable-list ) */
39287 static tree
39290 {
39300 {
39303 {
39306 }
39309 {
39317 {
39320 }
39321 }
39322 }
39325 {
39335 }
39339 else
39340 {
39351 {
39381 }
39382 else
39383 {
39385 resync_fail:
39390 }
39391 }
39397 NULL);
39399 {
39406 }
39409 }
39411 /* OpenMP 2.5:
39412 schedule ( schedule-kind )
39413 schedule ( schedule-kind , expression )
39415 schedule-kind:
39416 static | dynamic | guided | runtime | auto
39418 OpenMP 4.5:
39419 schedule ( schedule-modifier : schedule-kind )
39420 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
39422 schedule-modifier:
39423 simd
39424 monotonic
39425 nonmonotonic */
39427 static tree
39429 {
39433 matching_parens parens;
39441 {
39450 else
39456 {
39459 }
39460 else
39461 {
39464 }
39465 }
39470 {
39475 {
39496 }
39497 }
39502 else
39508 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
39510 {
39514 }
39517 {
39532 else
39537 }
39549 invalid_kind:
39551 resync_fail:
39556 }
39558 /* OpenMP 3.0:
39559 untied */
39561 static tree
39564 {
39565 tree c;
39572 }
39574 /* OpenMP 4.0:
39575 inbranch
39576 notinbranch */
39578 static tree
39581 {
39586 }
39588 /* OpenMP 4.0:
39589 parallel
39590 for
39591 sections
39592 taskgroup */
39594 static tree
39598 {
39602 }
39604 /* OpenMP 4.5:
39605 nogroup */
39607 static tree
39610 {
39615 }
39617 /* OpenMP 4.5:
39618 simd
39619 threads */
39621 static tree
39625 {
39630 }
39632 /* OpenMP 4.0:
39633 num_teams ( expression )
39635 OpenMP 5.1:
39636 num_teams ( expression : expression ) */
39638 static tree
39640 location_t location)
39641 {
39644 matching_parens parens;
39655 {
39659 }
39676 }
39678 /* OpenMP 4.0:
39679 thread_limit ( expression ) */
39681 static tree
39683 location_t location)
39684 {
39687 matching_parens parens;
39707 }
39709 /* OpenMP 4.0:
39710 aligned ( variable-list )
39711 aligned ( variable-list : constant-expression ) */
39713 static tree
39715 {
39719 matching_parens parens;
39727 {
39737 }
39743 }
39745 /* OpenMP 5.0:
39746 allocate ( variable-list )
39747 allocate ( expression : variable-list )
39749 OpenMP 5.1:
39750 allocate ( allocator-modifier : variable-list )
39751 allocate ( allocator-modifier , allocator-modifier : variable-list )
39753 allocator-modifier:
39754 allocator ( expression )
39755 align ( expression ) */
39757 static tree
39759 {
39763 matching_parens parens;
39773 {
39779 matching_parens parens2;
39783 {
39787 }
39788 else
39789 {
39793 }
39797 {
39800 }
39804 }
39805 else
39808 {
39814 }
39817 {
39824 }
39825 else
39826 {
39830 }
39837 {
39840 }
39843 }
39845 /* OpenMP 2.5:
39846 lastprivate ( variable-list )
39848 OpenMP 5.0:
39849 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
39851 static tree
39853 {
39861 {
39866 {
39870 }
39871 }
39880 }
39882 /* OpenMP 4.0:
39883 linear ( variable-list )
39884 linear ( variable-list : expression )
39886 OpenMP 4.5:
39887 linear ( modifier ( variable-list ) )
39888 linear ( modifier ( variable-list ) : expression )
39890 modifier:
39891 val
39892 ref
39893 uval
39895 OpenMP 5.2:
39896 linear ( variable-list : modifiers-list )
39898 modifiers:
39899 val
39900 ref
39901 uval
39902 step ( expression ) */
39904 static tree
39907 {
39913 matching_parens parens;
39918 {
39929 {
39932 }
39933 else
39935 }
39940 else
39941 {
39950 }
39953 {
39957 {
39967 {
39971 }
39975 CPP_CLOSE_PAREN)))
39977 }
39981 {
39983 {
39994 {
40000 }
40002 {
40003 location_t step_loc
40006 matching_parens parens2;
40008 {
40014 CPP_CLOSE_PAREN))
40015 {
40016 cp_token *token
40024 tok_loc);
40026 {
40029 }
40032 }
40038 }
40039 else
40041 }
40042 else
40045 {
40048 }
40050 }
40053 }
40057 {
40068 {
40071 }
40074 }
40085 }
40088 {
40092 }
40095 }
40097 /* OpenMP 4.0:
40098 safelen ( constant-expression ) */
40100 static tree
40102 location_t location)
40103 {
40106 matching_parens parens;
40125 }
40127 /* OpenMP 4.0:
40128 simdlen ( constant-expression ) */
40130 static tree
40132 location_t location)
40133 {
40136 matching_parens parens;
40155 }
40157 /* OpenMP 4.5:
40158 vec:
40159 identifier [+/- integer]
40160 vec , identifier [+/- integer]
40161 */
40163 static tree
40166 {
40170 {
40173 }
40176 {
40182 {
40185 {
40193 }
40194 }
40195 }
40198 {
40205 else
40206 {
40207 t = cp_parser_lookup_name_simple
40212 id_loc);
40213 }
40219 {
40222 }
40226 {
40229 }
40233 {
40236 }
40239 add_to_vector:
40241 {
40245 }
40252 }
40255 {
40262 }
40264 }
40266 /* OpenMP 5.0:
40267 detach ( event-handle ) */
40269 static tree
40271 {
40272 matching_parens parens;
40288 else
40289 {
40292 else
40297 }
40310 }
40312 /* OpenMP 5.0:
40313 iterators ( iterators-definition )
40315 iterators-definition:
40316 iterator-specifier
40317 iterator-specifier , iterators-definition
40319 iterator-specifier:
40320 identifier = range-specification
40321 iterator-type identifier = range-specification
40323 range-specification:
40324 begin : end
40325 begin : end : step */
40327 static tree
40329 {
40333 matching_parens parens;
40337 bool saved_colon_corrects_to_scope_p
40339 bool saved_colon_doesnt_start_class_def_p
40342 do
40343 {
40344 tree iter_type;
40348 else
40349 {
40352 parser->type_definition_forbidden_message
40358 }
40362 {
40365 }
40385 {
40388 }
40403 {
40406 }
40408 }
40412 parser->colon_doesnt_start_class_def_p
40422 }
40424 /* OpenMP 5.0:
40425 affinity ( [aff-modifier :] variable-list )
40426 aff-modifier:
40427 iterator ( iterators-definition ) */
40429 static tree
40431 {
40434 matching_parens parens;
40439 {
40444 CPP_OPEN_PAREN)));
40446 {
40449 }
40451 {
40455 {
40463 }
40464 }
40465 }
40469 {
40472 {
40477 }
40478 }
40480 }
40482 /* OpenMP 4.0:
40483 depend ( depend-kind : variable-list )
40485 depend-kind:
40486 in | out | inout
40488 OpenMP 4.5:
40489 depend ( source )
40491 depend ( sink : vec )
40493 OpenMP 5.0:
40494 depend ( depend-modifier , depend-kind: variable-list )
40496 depend-kind:
40497 in | out | inout | mutexinoutset | depobj
40499 depend-modifier:
40500 iterator ( iterators-definition ) */
40502 static tree
40504 {
40509 matching_parens parens;
40513 do
40514 {
40522 {
40527 }
40544 else
40547 }
40555 {
40560 }
40563 {
40574 }
40580 {
40586 }
40587 else
40588 {
40593 {
40597 else
40599 }
40602 {
40607 }
40608 }
40611 invalid_kind:
40613 resync_fail:
40620 }
40622 /* OpenMP 5.2:
40623 doacross ( source : )
40624 doacross ( source : omp_cur_iteration )
40626 doacross ( sink : vec )
40627 doacross ( sink : omp_cur_iteration - logical_iteration ) */
40629 static tree
40631 {
40632 tree nlist;
40635 matching_parens parens;
40640 {
40641 invalid_kind:
40643 resync_fail:
40648 }
40657 else
40666 {
40668 {
40673 }
40678 }
40679 else
40687 }
40689 /* OpenMP 4.0:
40690 from ( variable-list )
40691 to ( variable-list )
40693 OpenMP 5.1:
40694 from ( [present :] variable-list )
40695 to ( [present :] variable-list ) */
40697 static tree
40699 tree list)
40700 {
40710 {
40714 }
40722 }
40724 /* OpenMP 4.0:
40725 map ( map-kind : variable-list )
40726 map ( variable-list )
40728 map-kind:
40729 alloc | to | from | tofrom
40731 OpenMP 4.5:
40732 map-kind:
40733 alloc | to | from | tofrom | release | delete
40735 map ( always [,] map-kind: variable-list )
40737 OpenMP 5.0:
40738 map ( [map-type-modifier[,] ...] map-kind: variable-list )
40740 map-type-modifier:
40741 always | close */
40743 static tree
40745 {
40756 {
40758 {
40761 }
40764 pos++;
40765 pos++;
40766 }
40772 {
40775 {
40778 }
40782 {
40784 {
40791 }
40793 }
40795 {
40797 {
40804 }
40806 }
40808 {
40810 {
40817 }
40819 }
40820 else
40821 {
40829 }
40832 }
40836 {
40860 else
40861 {
40867 }
40870 }
40873 {
40877 }
40886 }
40888 /* OpenMP 4.0:
40889 device ( expression )
40891 OpenMP 5.0:
40892 device ( [device-modifier :] integer-expression )
40894 device-modifier:
40895 ancestor | device_num */
40897 static tree
40899 location_t location)
40900 {
40904 matching_parens parens;
40910 {
40914 {
40917 /* A requires directive with the reverse_offload clause must be
40918 specified. */
40920 {
40922 "preceded by %<requires%> directive "
40926 }
40927 }
40929 ;
40930 else
40931 {
40935 }
40938 }
40957 }
40959 /* OpenMP 4.0:
40960 dist_schedule ( static )
40961 dist_schedule ( static , expression ) */
40963 static tree
40965 location_t location)
40966 {
40969 matching_parens parens;
40980 {
40991 }
40995 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
40996 "dist_schedule", location); */
41002 invalid_kind:
41004 resync_fail:
41009 }
41011 /* OpenMP 4.0:
41012 proc_bind ( proc-bind-kind )
41014 proc-bind-kind:
41015 primary | master | close | spread
41016 where OpenMP 5.1 added 'primary' and deprecated the alias 'master'. */
41018 static tree
41020 location_t location)
41021 {
41022 tree c;
41029 {
41041 else
41043 }
41044 else
41053 location);
41058 invalid_kind:
41060 resync_fail:
41065 }
41067 /* OpenMP 5.0:
41068 device_type ( host | nohost | any ) */
41070 static tree
41072 location_t location)
41073 {
41074 tree c;
41081 {
41091 else
41093 }
41094 else
41103 location);
41108 invalid_kind:
41110 resync_fail:
41115 }
41117 /* OpenACC:
41118 async [( int-expr )] */
41120 static tree
41122 {
41129 {
41130 matching_parens parens;
41139 }
41149 }
41151 /* Parse all OpenACC clauses. The set clauses allowed by the directive
41152 is a bitmask in MASK. Return the list of clauses found. */
41154 static tree
41158 {
41162 /* Don't create location wrapper nodes within OpenACC clauses. */
41163 auto_suppress_location_wrappers sentinel;
41166 {
41167 location_t here;
41168 pragma_omp_clause c_kind;
41169 omp_clause_code code;
41180 {
41187 clauses);
41240 clauses);
41245 clauses);
41263 clauses);
41268 clauses);
41281 clauses);
41288 clauses);
41294 clauses);
41302 clauses);
41306 clauses
41313 clauses);
41322 clauses);
41328 OMP_CLAUSE_VECTOR,
41335 clauses);
41344 OMP_CLAUSE_WORKER,
41350 }
41355 {
41356 /* Remove the invalid clause(s) from the list to avoid
41357 confusing the rest of the compiler. */
41360 }
41361 }
41363 saw_error:
41370 }
41372 /* Parse all OpenMP clauses. The set clauses allowed by the directive
41373 is a bitmask in MASK. Return the list of clauses found.
41374 FINISH_P set if finish_omp_clauses should be called.
41375 NESTED non-zero if clauses should be terminated by closing paren instead
41376 of end of pragma. If it is 2, additionally commas are required in between
41377 the clauses. */
41379 static tree
41383 {
41388 /* Don't create location wrapper nodes within OpenMP clauses. */
41389 auto_suppress_location_wrappers sentinel;
41392 {
41393 pragma_omp_clause c_kind;
41401 {
41406 "clauses in %<simd%> trait should be separated "
41408 }
41414 {
41431 clauses);
41450 clauses);
41470 clauses);
41475 clauses);
41480 clauses);
41485 clauses);
41494 clauses
41540 clauses);
41544 clauses
41556 clauses);
41560 clauses
41562 OMP_CLAUSE_TASK_REDUCTION,
41578 clauses);
41583 OMP_CLAUSE_NOTINBRANCH,
41592 {
41593 clause_not_first:
41597 }
41626 {
41628 clauses);
41632 }
41633 else
41635 clauses);
41640 clauses);
41645 clauses);
41667 {
41672 }
41733 clauses
41739 clauses
41746 clauses);
41752 }
41757 {
41758 /* Remove the invalid clause(s) from the list to avoid
41759 confusing the rest of the compiler. */
41762 }
41763 }
41764 saw_error:
41768 {
41771 else
41773 }
41775 }
41777 /* OpenMP 2.5:
41778 structured-block:
41779 statement
41781 In practice, we're also interested in adding the statement to an
41782 outer node. So it is convenient if we work around the fact that
41783 cp_parser_statement calls add_stmt. */
41785 static unsigned
41787 {
41790 /* Only move the values to IN_OMP_BLOCK if they weren't false.
41791 This preserves the "not within loop or switch" style error messages
41792 for nonsense cases like
41793 void foo() {
41794 #pragma omp single
41795 break;
41796 }
41797 */
41802 }
41804 static void
41806 {
41808 }
41810 static tree
41812 {
41821 }
41823 /* OpenMP 5.x:
41824 # pragma omp allocate (list) clauses
41826 OpenMP 5.0 clause:
41827 allocator (omp_allocator_handle_t expression)
41829 OpenMP 5.1 additional clause:
41830 align (constant-expression)] */
41832 static void
41834 {
41840 do
41841 {
41848 matching_parens parens;
41854 {
41857 }
41862 {
41865 }
41867 {
41870 /* FIXME: Remove when adding check to semantics.cc; cf FIXME below. */
41874 {
41876 "positive constant power of two integer "
41879 }
41881 {
41884 {
41889 {
41891 "positive constant power of two integer "
41894 }
41895 }
41896 }
41897 }
41899 {
41902 }
41903 else
41904 {
41907 }
41914 {
41917 }
41919 /* FIXME: When implementing properly, delete the align/allocate expr error
41920 check above and add one in semantics.cc (to properly handle templates).
41921 Base this on the allocator/align modifiers check for the 'allocate' clause
41922 in semantics.cc's finish_omp_clauses. */
41924 }
41926 /* OpenMP 2.5:
41927 # pragma omp atomic new-line
41928 expression-stmt
41930 expression-stmt:
41931 x binop= expr | x++ | ++x | x-- | --x
41932 binop:
41933 +, *, -, /, &, ^, |, <<, >>
41935 where x is an lvalue expression with scalar type.
41937 OpenMP 3.1:
41938 # pragma omp atomic new-line
41939 update-stmt
41941 # pragma omp atomic read new-line
41942 read-stmt
41944 # pragma omp atomic write new-line
41945 write-stmt
41947 # pragma omp atomic update new-line
41948 update-stmt
41950 # pragma omp atomic capture new-line
41951 capture-stmt
41953 # pragma omp atomic capture new-line
41954 capture-block
41956 read-stmt:
41957 v = x
41958 write-stmt:
41959 x = expr
41960 update-stmt:
41961 expression-stmt | x = x binop expr
41962 capture-stmt:
41963 v = expression-stmt
41964 capture-block:
41965 { v = x; update-stmt; } | { update-stmt; v = x; }
41967 OpenMP 4.0:
41968 update-stmt:
41969 expression-stmt | x = x binop expr | x = expr binop x
41970 capture-stmt:
41971 v = update-stmt
41972 capture-block:
41973 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
41975 OpenMP 5.1:
41976 # pragma omp atomic compare new-line
41977 conditional-update-atomic
41979 # pragma omp atomic compare capture new-line
41980 conditional-update-capture-atomic
41982 conditional-update-atomic:
41983 cond-expr-stmt | cond-update-stmt
41984 cond-expr-stmt:
41985 x = expr ordop x ? expr : x;
41986 x = x ordop expr ? expr : x;
41987 x = x == e ? d : x;
41988 cond-update-stmt:
41989 if (expr ordop x) { x = expr; }
41990 if (x ordop expr) { x = expr; }
41991 if (x == e) { x = d; }
41992 ordop:
41993 <, >
41994 conditional-update-capture-atomic:
41995 v = cond-expr-stmt
41996 { v = x; cond-expr-stmt }
41997 { cond-expr-stmt v = x; }
41998 { v = x; cond-update-stmt }
41999 { cond-update-stmt v = x; }
42000 if (x == e) { x = d; } else { v = x; }
42001 { r = x == e; if (r) { x = d; } }
42002 { r = x == e; if (r) { x = d; } else { v = x; } }
42004 where x, r and v are lvalue expressions with scalar type,
42005 expr, e and d are expressions with scalar type and e might be
42006 the same as v. */
42008 static void
42010 {
42026 {
42032 {
42037 enum omp_memory_order new_memory_order
42053 {
42057 }
42065 {
42066 matching_parens parens;
42073 {
42083 }
42086 {
42090 else
42092 }
42093 else
42103 }
42115 {
42119 }
42120 else
42121 {
42124 "%<capture%>, %<compare%>, %<weak%>, %<fail%>, "
42125 "%<seq_cst%>, %<acq_rel%>, %<release%>, "
42127 }
42129 {
42131 {
42132 /* OpenACC permits 'update capture'. */
42139 else
42141 }
42143 {
42146 else
42148 }
42150 {
42153 else
42155 }
42157 {
42160 else
42162 }
42164 {
42167 else
42169 }
42172 }
42173 }
42175 }
42181 {
42185 else
42187 }
42189 {
42193 }
42195 {
42198 }
42200 {
42203 }
42207 {
42208 omp_requires_mask
42213 {
42223 {
42233 }
42237 }
42238 }
42239 else
42241 {
42244 {
42248 }
42254 {
42258 }
42264 }
42266 memory_order
42271 {
42281 else
42286 {
42287 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
42288 opcode. */
42293 }
42297 {
42300 }
42304 else
42305 {
42313 {
42317 }
42318 }
42321 }
42323 restart:
42325 {
42328 matching_parens parens;
42332 tree cmp_expr;
42335 else
42343 {
42349 }
42351 ;
42353 {
42357 }
42360 {
42362 "expected %<==%>, %<<%> or %<>%> comparison in %<if%> "
42365 }
42376 {
42379 }
42384 else
42397 {
42399 {
42402 }
42404 {
42409 }
42410 else
42412 }
42417 {
42422 }
42423 else
42424 {
42425 bad_if:
42429 }
42432 {
42436 {
42440 }
42468 /* Signal to c_finish_omp_atomic that in
42469 if (x == e) { x = d; } else { v = x; }
42470 case the store to v should be conditional. */
42472 }
42474 {
42477 }
42483 }
42487 {
42494 /* FALLTHROUGH */
42506 /* FALLTHROUGH */
42523 /* Undo effects of boolean_increment for post {in,de}crement. */
42525 /* FALLTHRU */
42529 {
42530 /* Undo effects of boolean_increment. */
42532 {
42533 /* This is pre or post increment. */
42538 && !structured_block
42544 }
42545 }
42546 /* FALLTHRU */
42549 {
42552 }
42554 {
42589 {
42593 }
42598 {
42604 {
42609 }
42611 {
42625 {
42627 {
42632 }
42633 else
42635 }
42640 || !structured_block
42641 || v
42647 {
42649 {
42655 }
42656 }
42664 {
42668 cond_expr:
42670 bool saved_colon_corrects_to_scope_p
42674 parser->colon_corrects_to_scope_p
42679 {
42681 {
42683 {
42687 }
42689 {
42690 opcode
42694 }
42695 }
42696 else
42697 {
42700 {
42701 opcode
42706 }
42707 }
42708 }
42710 "invalid form of "
42713 }
42717 }
42722 {
42729 }
42733 }
42737 {
42740 {
42748 }
42750 {
42755 }
42799 }
42802 {
42804 "invalid form of "
42807 }
42818 {
42820 {
42822 "invalid form of "
42825 }
42827 }
42833 }
42840 }
42841 stmt_done:
42843 {
42856 }
42858 {
42862 }
42863 done:
42865 {
42868 }
42876 invalid_compare:
42878 /* FALLTHRU */
42879 saw_error:
42884 {
42888 {
42892 }
42893 }
42894 }
42897 /* OpenMP 2.5:
42898 # pragma omp barrier new-line */
42900 static void
42902 {
42905 }
42907 /* OpenMP 2.5:
42908 # pragma omp critical [(name)] new-line
42909 structured-block
42911 OpenMP 4.5:
42912 # pragma omp critical [(name) [hint(expression)]] new-line
42913 structured-block */
42915 #define OMP_CRITICAL_CLAUSE_MASK \
42916 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
42918 static tree
42920 {
42924 {
42925 matching_parens parens;
42941 }
42948 }
42950 /* OpenMP 5.0:
42951 # pragma omp depobj ( depobj ) depobj-clause new-line
42953 depobj-clause:
42954 depend (dependence-type : locator)
42955 destroy
42956 update (dependence-type)
42958 dependence-type:
42959 in
42960 out
42961 inout
42962 mutexinout */
42964 static void
42966 {
42968 matching_parens parens;
42970 {
42973 }
42988 {
42994 {
42995 /* Don't create location wrapper nodes within the depend clause. */
42996 auto_suppress_location_wrappers sentinel;
43002 }
43006 {
43007 matching_parens c_parens;
43009 {
43010 location_t c2_loc
43013 {
43028 }
43030 {
43034 }
43040 }
43041 else
43043 }
43044 }
43046 {
43049 }
43053 }
43056 /* OpenMP 2.5:
43057 # pragma omp flush flush-vars[opt] new-line
43059 flush-vars:
43060 ( variable-list )
43062 OpenMP 5.0:
43063 # pragma omp flush memory-order-clause new-line */
43065 static void
43067 {
43073 {
43084 else
43086 "expected %<seq_cst%>, %<acq_rel%>, %<release%> or "
43089 }
43091 {
43094 "%<flush%> list specified together with memory order "
43097 }
43101 }
43103 /* Helper function, to parse omp for increment expression. */
43105 static tree
43107 {
43112 {
43115 }
43118 {
43130 }
43132 /* If decl is an iterator, preserve LHS and RHS of the relational
43133 expr until finish_omp_for. */
43144 }
43146 /* Helper function, to parse omp for increment expression. */
43148 static tree
43150 {
43154 cp_id_kind idk;
43158 {
43167 }
43176 {
43181 }
43188 {
43192 }
43205 do
43206 {
43213 {
43215 {
43218 else
43221 }
43222 else
43227 }
43228 }
43232 {
43238 }
43239 else
43243 }
43245 /* Parse the initialization statement of an OpenMP for loop. Range-for
43246 is handled separately in cp_convert_omp_range_for.
43248 On entry SL is the current statement list. Parsing of some forms
43249 of initialization pops this list and stores its contents in either INIT
43250 or THIS_PRE_BODY, and sets SL to null. Initialization for class
43251 iterators is added directly to SL and it is not popped until later.
43253 On return, DECL is set if the initialization is by binding the
43254 iteration variable. If the initialization is by assignment, REAL_DECL
43255 is set to point to a variable in an outer scope. ORIG_INIT is set
43256 if the iteration variable is of class type; this is a copy saved for
43257 error checking in finish_omp_for.
43259 Return true if the resulting construct should have an
43260 OMP_CLAUSE_PRIVATE added to it. */
43262 static tree
43270 {
43276 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
43278 init-expr:
43279 var = lb
43280 integer-type var = lb
43281 random-access-iterator-type var = lb
43282 pointer-type var = lb
43283 */
43284 cp_decl_specifier_seq type_specifiers;
43286 /* First, try to parse as an initialized declaration. See
43287 cp_parser_condition, from whence the bulk of this is copied. */
43295 {
43296 /* If parsing a type specifier seq succeeded, then this
43297 MUST be a initialized declaration. */
43302 CP_PARSER_DECLARATOR_NAMED,
43303 CP_PARSER_FLAGS_NONE,
43315 else
43316 {
43326 {
43328 CPP_OPEN_PAREN))
43331 else
43332 /* Trigger an error. */
43337 }
43341 {
43349 {
43352 auto_node);
43357 }
43360 asm_specification,
43361 LOOKUP_ONLYCONVERTING);
43364 /* In the case of a class iterator, do not pop sl here.
43365 Both class initialization and finalization must happen in
43366 the enclosing init block scope. For now set the init
43367 expression to null; it'll be filled in properly in
43368 finish_omp_for before stuffing it in the OMP_FOR. */
43372 {
43376 {
43378 /* Move lambda DECL_EXPRs to the enclosing block. */
43380 {
43384 {
43388 }
43390 }
43392 {
43397 }
43398 }
43399 }
43400 }
43401 else
43402 /* This is an initialized declaration of non-class,
43403 non-parameterized type iteration variable. */
43404 {
43405 /* Consume '='. */
43409 non_class:
43412 else
43415 asm_specification,
43416 LOOKUP_ONLYCONVERTING);
43419 }
43423 }
43424 }
43425 else
43426 {
43427 cp_id_kind idk;
43428 /* If parsing a type specifier sequence failed, then
43429 this MUST be a simple expression. */
43435 && decl
43438 {
43449 {
43454 }
43459 }
43461 && decl
43464 {
43465 tree rhs;
43474 tf_warning_or_error));
43477 }
43478 else
43479 {
43484 {
43488 }
43489 }
43492 }
43494 }
43496 /* Helper for cp_parser_omp_loop_nest, handle one range-for loop
43497 including introducing new temporaries for the range start and end,
43498 doing auto deduction, and processing decomposition variables.
43500 This function is also called from pt.cc during template instantiation.
43501 In that case SL is NULL_TREE, otherwise it is the current statement
43502 list. */
43503 void
43507 {
43513 {
43517 /* do_auto_deduction doesn't mess with template init-lists. */
43519 {
43523 {
43528 {
43533 }
43534 }
43536 }
43541 {
43544 }
43546 }
43551 /* If an error happened previously do nothing or else a lot of
43552 unhelpful errors would be issued. */
43554 else
43555 {
43556 tree range_temp;
43560 /* Can't bind a reference to an array of runtime bound. */
43562 else
43563 {
43569 LOOKUP_ONLYCONVERTING);
43572 }
43575 }
43586 LOOKUP_ONLYCONVERTING);
43588 /* The new for initialization statement. */
43596 else
43597 {
43600 }
43603 LOOKUP_ONLYCONVERTING);
43605 /* The new for condition. */
43608 else
43614 /* The new increment expression. */
43617 else
43620 tf_warning_or_error);
43624 /* Defer popping sl here. */
43628 {
43633 {
43639 }
43640 }
43644 {
43648 {
43652 {
43658 }
43659 }
43660 }
43662 /* The output ORIG_DECL is not a decl. Instead, it is a tree structure
43663 that holds decls for variables implementing the iterator, represented
43664 as a TREE_LIST whose TREE_CHAIN is a vector. The first two elements
43665 of the vector are decls of scratch variables for the range start and
43666 end that will eventually be bound in the implicit scope surrounding
43667 the whole loop nest. The remaining elements are decls of derived
43668 decomposition variables that are bound inside the loop body. This
43669 structure is further mangled by finish_omp_for into the form required
43670 for the OMP_FOR_ORIG_DECLS field of the OMP_FOR tree node. */\
43679 {
43681 {
43682 /* If cp_finish_decomp was called with processing_template_decl
43683 temporarily set to 1, then decomp names will have deduced
43684 name but the DECL_VALUE_EXPR will be dependent. Hide those
43685 from folding of other loop initializers e.g. for warning
43686 purposes until cp_finish_omp_range_for. */
43691 }
43694 }
43696 }
43698 /* Helper for cp_parser_omp_for_loop, finalize part of range for
43699 inside of the collapsed body. */
43701 void
43703 {
43710 {
43715 {
43716 /* Undo temporary clearing of DECL_HAS_VALUE_EXPR_P done
43717 by cp_convert_omp_range_for above. */
43721 {
43725 }
43726 }
43727 }
43729 /* The declaration is initialized with *__begin inside the loop body. */
43737 }
43739 /* Return true if next tokens contain a standard attribute that contains
43740 omp::directive (DIRECTIVE). */
43742 static bool
43745 {
43753 {
43760 }
43765 location_t last_loc
43774 {
43776 {
43780 cnt++;
43784 {
43788 }
43789 }
43790 }
43792 {
43795 }
43797 {
43799 "%<[[omp::directive(%s)]]%> must be the only specified "
43803 }
43808 }
43810 /* Parse an OpenMP structured block sequence. KIND is the corresponding
43811 separating directive. */
43813 static tree
43816 {
43822 {
43835 kind == PRAGMA_OMP_SCAN
43840 }
43844 }
43847 /* OpenMP 5.0:
43849 scan-loop-body:
43850 { structured-block scan-directive structured-block } */
43852 static void
43854 {
43858 matching_braces braces;
43865 else
43866 {
43870 }
43876 {
43886 {
43893 }
43895 {
43898 }
43899 else
43904 }
43905 else
43911 else
43912 {
43917 }
43919 clauses);
43923 }
43926 /* This function parses a single level of a loop nest, invoking itself
43927 recursively if necessary.
43929 loop-nest :: for (...) loop-body
43930 loop-body :: loop-nest
43931 | { [intervening-code] loop-body [intervening-code] }
43932 | final-loop-body
43933 intervening-code :: structured-block-sequence
43934 final-loop-body :: structured-block
43936 For a collapsed loop nest, only a single OMP_FOR is built, pulling out
43937 all the iterator information from the inner loops into vectors in the
43938 parser->omp_for_parse_state structure.
43940 In the "range for" case, it is transformed into a regular "for" iterator
43941 by introducing some temporary variables for the begin/end,
43942 as well as bindings of the actual iteration variables which are
43943 injected into the body of the loop.
43945 Initialization code for iterator variables may end up either in the
43946 init vector (simple assignments), in omp_for_parse_state->pre_body
43947 (decl_exprs for iterators bound in the for statement), or in the
43948 scope surrounding this level of loop initialization.
43950 The scopes of class iterator variables and their finalizers need to
43951 be adjusted after parsing so that all of the initialization happens
43952 in a scope surrounding all of the intervening and body code. For
43953 this reason we separately store the initialization and body blocks
43954 for each level of loops in the omp_for_parse_state structure and
43955 reassemble/reorder them in cp_parser_omp_for. See additional
43956 comments there about the use of placeholders, etc. */
43958 static tree
43960 {
43965 tree init_scope;
43970 location_t loc;
43978 /* We have already matched the FOR token but not consumed it yet. */
43982 /* Forbid break/continue in the loop initializer, condition, and
43983 increment expressions. */
43987 /* We are not in intervening code now. */
43990 /* Don't create location wrapper nodes within an OpenMP "for"
43991 statement. */
43992 auto_suppress_location_wrappers sentinel;
43994 matching_parens parens;
44001 integer_zero_node);
44004 /* The init_block acts as a container for this level of loop goo. */
44008 /* Wrap a scope around this entire level of loop to hold bindings
44009 of loop iteration variables. We can't insert them directly
44010 in the containing scope because that would cause their visibility to
44011 be incorrect with respect to intervening code after this loop.
44012 We will combine the nested init_scopes in postprocessing after the
44013 entire loop is parsed. */
44016 /* Now we need another level of statement list container to capture the
44017 initialization (and possible finalization) bits. In some cases this
44018 container may be popped off during initializer parsing to store code in
44019 INIT or THIS_PRE_BODY, depending on the form of initialization. If
44020 we have a class iterator we will pop it at the end of parsing this
44021 level, so the cleanups are handled correctly. */
44025 {
44026 /* Save tokens so that we can put them back. */
44029 /* Look for ':' that is not nested in () or {}. */
44030 is_range_for
44033 CPP_COLON,
44034 /*consume_paren=*/
44037 /* Roll back the tokens we skipped. */
44041 {
44042 bool saved_colon_corrects_to_scope_p
44045 /* A colon is used in range-based for. */
44048 /* Parse the declaration. */
44050 /*function_definition_allowed_p=*/
44052 parser->colon_corrects_to_scope_p
44066 "%<ordered%> clause with parameter on "
44070 }
44071 }
44073 add_private_clause
44079 /* If the iteration variable was introduced via a declaration in the
44080 for statement, DECL points at it. Otherwise DECL is null and
44081 REAL_DECL is a variable previously declared in an outer scope.
44082 Make REAL_DECL point at the iteration variable no matter where it
44083 was introduced. */
44087 /* Some clauses treat iterator variables specially. */
44092 {
44098 {
44102 }
44105 {
44106 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
44110 {
44114 }
44115 else
44116 {
44119 }
44121 }
44122 else
44123 {
44128 }
44129 }
44132 {
44133 tree c;
44135 {
44144 decl);
44149 decl);
44150 }
44152 {
44159 else
44164 {
44167 /* For linear, signal that we need to fill up
44168 the so far unknown linear step. */
44171 }
44172 }
44173 }
44182 {
44183 /* If decl is an iterator, preserve the operator on decl
44184 until finish_omp_for. */
44186 && ((processing_template_decl
44191 else
44194 }
44196 parse_close_paren:
44202 /* We've parsed all the for (...) stuff now. Store the bits. */
44208 {
44211 }
44213 {
44215 omp_for_parse_state->orig_declv
44218 }
44225 /* Start a nested block for the loop body. */
44227 integer_zero_node);
44235 {
44239 }
44242 {
44243 /* This is the open brace in the loop-body grammar production. Rather
44244 than trying to special-case braces, just parse it as a compound
44245 statement and handle the nested loop-body case there. Note that
44246 when we see a further open brace inside the compound statement
44247 loop-body, we don't know whether it is the start of intervening
44248 code that is a compound statement, or a level of braces
44249 surrounding a nested loop-body. Use the WANT_NESTED_LOOP state
44250 bit to ensure we have only one nested loop at each level. */
44257 {
44258 /* We have already parsed the whole loop body and not found a
44259 nested loop. */
44263 }
44265 }
44266 else
44267 {
44268 /* This is the final-loop-body case in the grammar: we have something
44269 that is not a FOR and not an open brace. */
44271 {
44272 /* If we were expecting a nested loop, give an error and mark
44273 that parsing has failed, and try to recover by parsing the
44274 body as regular code without further collapsing. */
44278 }
44281 /* Generate the parts of range for that belong in the loop body,
44282 to be executed on every iteration. This includes setting the
44283 user-declared decomposition variables from the compiler-generated
44284 temporaries that are the real iteration variables for OMP_FOR.
44285 FIXME: Not sure if this is correct with respect to visibility
44286 of the variables from intervening code. However, putting this
44287 code in each level of loop instead of all around the innermost
44288 body also makes the decomposition variables visible to the
44289 inner for init/bound/step exressions, which is not supposed to
44290 happen and causes test failures. */
44293 {
44298 }
44300 /* Now parse the final-loop-body for the innermost loop. */
44304 else
44307 }
44312 /* Pop and remember the body block. Add the body placeholder
44313 to the surrounding statement list instead. This is just a unique
44314 token that will be replaced when we reassemble the generated
44315 code for the entire omp for statement. */
44320 /* Pop and remember the init block. */
44327 /* Return the init placeholder rather than the remembered init block.
44328 Again, this is just a unique cookie that will be used to reassemble
44329 code pieces when the entire omp for statement has been parsed. */
44331 }
44333 /* Worker for find_structured_blocks. *TP points to a STATEMENT_LIST
44334 and ITER is the element that is or contains a nested loop. This
44335 function moves the statements before and after ITER into
44336 OMP_STRUCTURED_BLOCKs and modifies *TP. */
44337 static void
44339 {
44343 {
44348 TSI_SAME_STMT);
44349 i++;
44351 }
44352 else
44353 {
44357 }
44362 TSI_SAME_STMT);
44363 }
44365 /* Helper to find and mark structured blocks in intervening code for a
44366 single loop level with markers for later error checking. *TP is the
44367 piece of code to be marked and INNER is the inner loop placeholder.
44368 Returns true if INNER was found (recursively) in *TP. */
44369 static bool
44371 {
44377 {
44379 {
44381 /* The normal case is that there is no intervening code and we
44382 do not have to insert any OMP_STRUCTURED_BLOCK markers. */
44384 {
44388 }
44389 }
44391 }
44396 else
44398 }
44400 /* Helpers used for relinking tree structures: In tree rooted at
44401 CONTEXT, replace ORIG with REPLACEMENT. If FLATTEN is true, try to combine
44402 nested BIND_EXPRs. Gives an assertion if it fails to find ORIG. */
44405 tree orig;
44406 tree repl;
44408 };
44410 static tree
44413 {
44416 {
44419 }
44420 /* Remove redundant BIND_EXPRs with no bindings even when not specifically
44421 trying to flatten. */
44426 {
44429 }
44433 {
44435 {
44436 /* Merge binding lists for two directly nested BIND_EXPRs,
44437 keeping the outer one. */
44442 }
44444 /* There might be a statement list containing cleanup_points
44445 etc between the two levels of BIND_EXPR. We can still merge
44446 them, again keeping the outer BIND_EXPR. */
44449 {
44452 {
44457 }
44458 }
44459 }
44461 }
44463 static void
44465 {
44478 }
44480 /* Walker to patch up the BLOCK_NODE hierarchy after the above surgery.
44481 *DP is is the parent block. */
44483 static tree
44485 {
44489 {
44492 {
44496 }
44501 }
44504 }
44506 /* Parse the restricted form of the for statement allowed by OpenMP. */
44508 static tree
44511 {
44512 tree ret;
44520 tree result;
44527 {
44530 }
44533 {
44536 }
44543 {
44549 }
44555 {
44558 }
44560 /* Initialize parse state for recursive descent. */
44585 /* Bomb out early if there was an error (not enough loops, etc). */
44587 {
44590 }
44592 /* Relink the init and body blocks that were built during parsing. At
44593 this point we have a structure nested like
44594 init 0
44595 body 0
44596 init 1
44597 body 1
44598 init 2
44599 body 2
44600 and we want to turn it into
44601 init 0
44602 init 1
44603 init 2
44604 omp_for
44605 body 0
44606 body 1
44607 body 2
44608 We also need to flatten the init blocks, as some code for later
44609 processing of combined directives gets confused otherwise. */
44616 /* First insert markers for structured blocks for intervening code in
44617 the loop bodies. */
44619 {
44623 }
44625 /* Do the substitution from the inside out. */
44627 {
44634 }
44636 /* Generate the OMP_FOR. Note finish_omp_for adds the OMP_FOR
44637 (and possibly other stuff) to the current statement list but
44638 returns a pointer to the OMP_FOR itself, or null in case of error. */
44646 /* Check for errors involving lb/ub/incr expressions referencing
44647 variables declared in intervening code. */
44653 {
44654 /* Splice the omp_for into the nest of init blocks. */
44659 /* Some later processing for combined directives assumes
44660 that the BIND_EXPR containing range for variables appears
44661 at top level in the OMP_FOR body. Fix that up if it's
44662 not the case, e.g. because there is intervening code. */
44666 /* Clean up the block subblock/superblock links. Per comment in
44667 begin_compound_stmt, "we don't build BLOCK nodes when processing
44668 templates", so skip this step in that case. */
44670 {
44674 }
44676 /* Finally record the result. */
44678 }
44682 }
44684 /* Helper function for OpenMP parsing, split clauses and call
44685 finish_omp_clauses on each of the set of clauses afterwards. */
44687 static void
44690 {
44696 i == C_OMP_CLAUSE_SPLIT_TARGET
44698 }
44700 /* OpenMP 5.0:
44701 #pragma omp loop loop-clause[optseq] new-line
44702 for-loop */
44704 #define OMP_LOOP_CLAUSE_MASK \
44705 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
44710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44712 static tree
44716 {
44727 {
44730 }
44742 }
44744 /* OpenMP 4.0:
44745 #pragma omp simd simd-clause[optseq] new-line
44746 for-loop */
44748 #define OMP_SIMD_CLAUSE_MASK \
44749 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
44750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
44751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
44753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
44759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44761 static tree
44765 {
44776 {
44779 }
44791 }
44793 /* OpenMP 2.5:
44794 #pragma omp for for-clause[optseq] new-line
44795 for-loop
44797 OpenMP 4.0:
44798 #pragma omp for simd for-simd-clause[optseq] new-line
44799 for-loop */
44801 #define OMP_FOR_CLAUSE_MASK \
44802 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
44808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
44809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
44810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44814 static tree
44818 {
44825 /* parallel for{, simd} disallows nowait clause, but for
44826 target {teams distribute ,}parallel for{, simd} it should be accepted. */
44829 /* Composite distribute parallel for{, simd} disallows ordered clause. */
44834 {
44839 {
44863 }
44864 }
44866 {
44869 }
44871 /* Composite distribute parallel for disallows linear clause. */
44878 {
44881 }
44893 }
44898 /* OpenMP 2.5:
44899 # pragma omp master new-line
44900 structured-block */
44902 static tree
44906 {
44914 {
44919 {
44939 }
44940 }
44942 {
44945 }
44948 {
44952 }
44953 else
44958 }
44960 /* OpenMP 5.1:
44961 # pragma omp masked masked-clauses new-line
44962 structured-block */
44964 #define OMP_MASKED_CLAUSE_MASK \
44965 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FILTER)
44967 static tree
44971 {
44980 {
44985 {
45006 }
45007 }
45009 {
45012 }
45017 {
45020 }
45024 clauses);
45025 }
45027 /* OpenMP 2.5:
45028 # pragma omp ordered new-line
45029 structured-block
45031 OpenMP 4.5:
45032 # pragma omp ordered ordered-clauses new-line
45033 structured-block */
45035 #define OMP_ORDERED_CLAUSE_MASK \
45036 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
45037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
45039 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
45040 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DOACROSS))
45043 static bool
45046 {
45054 {
45059 {
45061 {
45064 }
45066 {
45068 "%qs clause may only be used in compound "
45072 }
45073 tree clauses
45075 OMP_ORDERED_DEPEND_CLAUSE_MASK,
45079 }
45080 }
45082 tree clauses
45093 }
45095 /* OpenMP 2.5:
45097 section-scope:
45098 { section-sequence }
45100 section-sequence:
45101 section-directive[opt] structured-block
45102 section-sequence section-directive structured-block */
45104 static tree
45106 {
45111 matching_braces braces;
45118 != PRAGMA_OMP_SECTION
45120 {
45122 PRAGMA_OMP_SECTION);
45125 }
45128 {
45138 {
45142 }
45144 {
45147 }
45150 PRAGMA_OMP_SECTION);
45153 }
45164 }
45166 /* OpenMP 2.5:
45167 # pragma omp sections sections-clause[optseq] newline
45168 sections-scope */
45170 #define OMP_SECTIONS_CLAUSE_MASK \
45171 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45178 static tree
45181 {
45193 {
45196 }
45203 }
45205 /* OpenMP 2.5:
45206 # pragma omp parallel parallel-clause[optseq] new-line
45207 structured-block
45208 # pragma omp parallel for parallel-for-clause[optseq] new-line
45209 structured-block
45210 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
45211 structured-block
45213 OpenMP 4.0:
45214 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
45215 structured-block */
45217 #define OMP_PARALLEL_CLAUSE_MASK \
45218 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
45222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
45224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
45226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
45229 static tree
45233 {
45240 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
45246 {
45254 if_p);
45258 if_p);
45261 block);
45266 }
45267 /* When combined with distribute, parallel has to be followed by for.
45268 #pragma omp target parallel is allowed though. */
45272 {
45276 }
45278 {
45282 {
45296 block);
45299 /* masked does have just filter clause, but during gimplification
45300 isn't represented by a gimplification omp context, so for
45301 #pragma omp parallel masked don't set OMP_PARALLEL_COMBINED,
45302 so that
45303 #pragma omp parallel masked
45304 #pragma omp taskloop simd lastprivate (x)
45305 isn't confused with
45306 #pragma omp parallel masked taskloop simd lastprivate (x) */
45310 }
45312 {
45326 block);
45329 /* master doesn't have any clauses and during gimplification
45330 isn't represented by a gimplification omp context, so for
45331 #pragma omp parallel master don't set OMP_PARALLEL_COMBINED,
45332 so that
45333 #pragma omp parallel master
45334 #pragma omp taskloop simd lastprivate (x)
45335 isn't confused with
45336 #pragma omp parallel master taskloop simd lastprivate (x) */
45340 }
45342 {
45357 block);
45362 }
45364 {
45367 }
45369 {
45379 block);
45382 }
45383 }
45385 {
45388 }
45393 {
45396 }
45405 }
45407 /* OpenMP 2.5:
45408 # pragma omp single single-clause[optseq] new-line
45409 structured-block */
45411 #define OMP_SINGLE_CLAUSE_MASK \
45412 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
45415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45418 static tree
45420 {
45431 }
45433 /* OpenMP 5.1:
45434 # pragma omp scope scope-clause[optseq] new-line
45435 structured-block */
45437 #define OMP_SCOPE_CLAUSE_MASK \
45438 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45444 static tree
45446 {
45457 }
45459 /* OpenMP 3.0:
45460 # pragma omp task task-clause[optseq] new-line
45461 structured-block */
45463 #define OMP_TASK_CLAUSE_MASK \
45464 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
45466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
45467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
45471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
45472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
45474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
45476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DETACH) \
45477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_AFFINITY))
45479 static tree
45481 {
45493 }
45495 /* OpenMP 3.0:
45496 # pragma omp taskwait new-line
45498 OpenMP 5.0:
45499 # pragma omp taskwait taskwait-clause[opt] new-line */
45501 #define OMP_TASKWAIT_CLAUSE_MASK \
45502 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45505 static void
45507 {
45508 tree clauses
45513 {
45520 }
45521 else
45523 }
45525 /* OpenMP 3.1:
45526 # pragma omp taskyield new-line */
45528 static void
45530 {
45533 }
45535 /* OpenMP 4.0:
45536 # pragma omp taskgroup new-line
45537 structured-block
45539 OpenMP 5.0:
45540 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
45542 #define OMP_TASKGROUP_CLAUSE_MASK \
45543 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
45546 static tree
45548 {
45549 tree clauses
45554 if_p),
45555 clauses);
45556 }
45559 /* OpenMP 2.5:
45560 # pragma omp threadprivate (variable-list) */
45562 static void
45564 {
45565 tree vars;
45571 }
45573 /* OpenMP 4.0:
45574 # pragma omp cancel cancel-clause[optseq] new-line */
45576 #define OMP_CANCEL_CLAUSE_MASK \
45577 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
45578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
45579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
45580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
45581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
45583 static void
45585 {
45589 }
45591 /* OpenMP 4.0:
45592 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
45594 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
45595 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
45596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
45597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
45598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
45600 static bool
45603 {
45604 tree clauses;
45608 {
45613 {
45616 }
45617 }
45619 {
45623 }
45626 {
45631 else
45635 }
45638 OMP_CANCELLATION_POINT_CLAUSE_MASK,
45640 pragma_tok);
45643 }
45645 /* OpenMP 4.0:
45646 #pragma omp distribute distribute-clause[optseq] new-line
45647 for-loop */
45649 #define OMP_DISTRIBUTE_CLAUSE_MASK \
45650 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
45654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
45656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
45658 static tree
45662 {
45671 {
45679 else
45682 {
45688 {
45692 else
45695 }
45701 else
45715 }
45716 }
45718 {
45721 }
45726 {
45729 }
45741 }
45743 /* OpenMP 4.0:
45744 # pragma omp teams teams-clause[optseq] new-line
45745 structured-block */
45747 #define OMP_TEAMS_CLAUSE_MASK \
45748 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
45753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
45754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
45757 static tree
45761 {
45770 {
45774 {
45800 }
45802 {
45828 }
45829 }
45831 {
45834 }
45839 {
45842 }
45852 }
45854 /* OpenMP 4.0:
45855 # pragma omp target data target-data-clause[optseq] new-line
45856 structured-block */
45858 #define OMP_TARGET_DATA_CLAUSE_MASK \
45859 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
45863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
45865 static tree
45867 {
45869 omp_requires_mask
45872 tree clauses
45878 {
45881 {
45906 "%<#pragma omp target data%> with map-type other "
45907 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
45911 }
45916 }
45919 {
45922 "%<#pragma omp target data%> must contain at least "
45923 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
45926 }
45937 }
45939 /* OpenMP 4.5:
45940 # pragma omp target enter data target-enter-data-clause[optseq] new-line
45941 structured-block */
45943 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
45944 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45948 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45950 static bool
45953 {
45956 {
45961 {
45964 }
45965 }
45967 {
45971 }
45974 {
45980 }
45983 omp_requires_mask
45986 tree clauses
45992 {
45995 {
46028 "%<#pragma omp target enter data%> with map-type other "
46032 }
46034 }
46037 {
46040 "%<#pragma omp target enter data%> must contain at least "
46043 }
46051 }
46053 /* OpenMP 4.5:
46054 # pragma omp target exit data target-enter-data-clause[optseq] new-line
46055 structured-block */
46057 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
46058 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46064 static bool
46067 {
46070 {
46075 {
46078 }
46079 }
46081 {
46085 }
46088 {
46094 }
46097 omp_requires_mask
46100 tree clauses
46106 {
46109 {
46142 "%<#pragma omp target exit data%> with map-type other "
46143 "than %<from%>, %<tofrom%>, %<release%> or %<delete%> "
46147 }
46149 }
46152 {
46155 "%<#pragma omp target exit data%> must contain at least "
46158 }
46166 }
46168 /* OpenMP 4.0:
46169 # pragma omp target update target-update-clause[optseq] new-line */
46171 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
46172 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
46173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
46174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
46179 static bool
46182 {
46184 {
46190 }
46192 tree clauses
46197 {
46199 "%<#pragma omp target update%> must contain at least one "
46202 }
46205 omp_requires_mask
46214 }
46216 /* OpenMP 4.0:
46217 # pragma omp target target-clause[optseq] new-line
46218 structured-block */
46220 #define OMP_TARGET_CLAUSE_MASK \
46221 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
46222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
46223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
46224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
46225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
46226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
46227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
46228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
46229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
46230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
46231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
46232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR)\
46233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HAS_DEVICE_ADDR))
46235 static bool
46238 {
46240 omp_requires_mask
46244 {
46256 {
46264 {
46265 tree stmt;
46267 {
46270 OMP_TARGET_CLAUSE_MASK,
46275 OMP_TARGET_CLAUSE_MASK,
46280 OMP_TARGET_CLAUSE_MASK,
46285 }
46287 }
46292 {
46296 if_p);
46301 if_p);
46306 if_p);
46310 }
46316 /* For combined target teams, ensure the num_teams and
46317 thread_limit clause expressions are evaluated on the host,
46318 before entering the target construct. */
46327 {
46330 tf_none);
46337 OMP_CLAUSE_FIRSTPRIVATE);
46342 }
46347 }
46349 {
46352 }
46354 {
46358 }
46360 {
46363 }
46365 {
46368 }
46370 {
46373 }
46374 }
46376 {
46379 }
46386 {
46392 }
46401 }
46403 /* OpenACC 2.0:
46404 # pragma acc cache (variable-list) new-line
46405 */
46407 static tree
46409 {
46410 /* Don't create location wrapper nodes within 'OMP_CLAUSE__CACHE_'
46411 clauses. */
46412 auto_suppress_location_wrappers sentinel;
46428 }
46430 /* OpenACC 2.0:
46431 # pragma acc data oacc-data-clause[optseq] new-line
46432 structured-block */
46434 #define OACC_DATA_CLAUSE_MASK \
46435 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
46442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
46447 static tree
46449 {
46462 }
46464 /* OpenACC 2.0:
46465 # pragma acc host_data <clauses> new-line
46466 structured-block */
46468 #define OACC_HOST_DATA_CLAUSE_MASK \
46469 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) \
46470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) )
46473 static tree
46475 {
46483 {
46487 }
46495 }
46497 /* OpenACC 2.0:
46498 # pragma acc declare oacc-data-clause[optseq] new-line
46499 */
46501 #define OACC_DECLARE_CLAUSE_MASK \
46502 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
46508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
46509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
46511 static tree
46513 {
46523 {
46527 }
46530 {
46534 {
46538 }
46541 {
46553 {
46555 "%qD must be a global variable in "
46557 decl);
46560 }
46565 {
46569 }
46571 {
46573 "invalid use of %<extern%> variable %qD "
46577 }
46579 {
46581 "invalid use of %<global%> variable %qD "
46585 }
46587 }
46590 /* This seems to ignore the existence of cleanup scopes?
46591 What is the meaning for local extern decls? The local
46592 extern is in this scope, but it is referring to a decl that
46593 is namespace scope. */
46596 {
46599 }
46601 {
46603 "%qD must be a variable declared in the same scope as "
46607 }
46612 {
46617 }
46620 {
46621 tree id;
46624 /* We need to mark the aliased decl, as that is the entity
46625 that is being referred to. This won't work for
46626 dependent variables, but it didn't work for them before
46627 DECL_LOCAL_DECL_P was a thing either. But then
46628 dependent local extern variable decls are as rare as
46629 hen's teeth. */
46636 else
46642 {
46645 {
46648 {
46652 }
46653 }
46654 }
46655 }
46656 }
46669 }
46671 /* OpenACC 2.0:
46672 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
46674 or
46676 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
46678 LOC is the location of the #pragma token.
46679 */
46681 #define OACC_ENTER_DATA_CLAUSE_MASK \
46682 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46689 #define OACC_EXIT_DATA_CLAUSE_MASK \
46690 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
46694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
46695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
46696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46698 static tree
46701 {
46710 {
46715 }
46722 else
46727 {
46731 }
46739 }
46741 /* OpenACC 2.0:
46742 # pragma acc loop oacc-loop-clause[optseq] new-line
46743 structured-block */
46745 #define OACC_LOOP_CLAUSE_MASK \
46746 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
46747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
46750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
46751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
46752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
46753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
46754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
46755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
46757 static tree
46760 {
46769 {
46775 }
46782 /* Later processing of combined acc loop constructs gets confused
46783 by an extra level of empty nested BIND_EXPRs, so flatten them. */
46792 }
46794 /* OpenACC 2.0:
46795 # pragma acc kernels oacc-kernels-clause[optseq] new-line
46796 structured-block
46798 or
46800 # pragma acc parallel oacc-parallel-clause[optseq] new-line
46801 structured-block
46803 OpenACC 2.6:
46805 # pragma acc serial oacc-serial-clause[optseq] new-line
46806 */
46808 #define OACC_KERNELS_CLAUSE_MASK \
46809 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46825 #define OACC_PARALLEL_CLAUSE_MASK \
46826 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46845 #define OACC_SERIAL_CLAUSE_MASK \
46846 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46862 static tree
46865 {
46866 omp_clause_mask mask;
46869 {
46887 }
46890 {
46894 {
46897 tree clauses;
46902 }
46903 }
46912 }
46914 /* OpenACC 2.0:
46915 # pragma acc update oacc-update-clause[optseq] new-line
46916 */
46918 #define OACC_UPDATE_CLAUSE_MASK \
46919 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
46921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
46922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
46924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
46926 static tree
46928 {
46935 {
46937 "%<#pragma acc update%> must contain at least one "
46940 }
46948 }
46950 /* OpenACC 2.0:
46951 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
46953 LOC is the location of the #pragma token.
46954 */
46956 #define OACC_WAIT_CLAUSE_MASK \
46957 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
46959 static tree
46961 {
46975 }
46977 /* OpenMP 4.0:
46978 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
46980 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
46981 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
46982 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
46983 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
46984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
46985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
46986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
46988 static void
46992 {
46994 cp_omp_declare_simd_data data;
46996 {
47004 /* It is safe to take the address of a local variable; it will only be
47005 used while this scope is live. */
47007 }
47009 {
47011 "%<#pragma omp declare %s%> followed by "
47016 }
47018 /* Store away all pragma tokens. */
47027 {
47031 {
47044 }
47049 "%<#pragma omp declare %s%> not immediately followed by "
47054 }
47055 }
47067 /* OpenMP 5.0:
47069 trait-selector:
47070 trait-selector-name[([trait-score:]trait-property[,trait-property[,...]])]
47072 trait-score:
47073 score(score-expression) */
47075 static tree
47077 {
47079 do
47080 {
47081 tree selector;
47085 else
47086 {
47089 }
47100 {
47127 }
47129 {
47131 {
47133 {
47136 }
47137 else
47138 {
47144 }
47145 }
47150 }
47160 {
47162 {
47166 }
47168 matching_parens parens;
47176 {
47183 {
47187 matching_parens parens2;
47195 {
47207 else
47210 }
47211 }
47212 else
47216 }
47219 {
47220 tree t;
47222 do
47223 {
47226 {
47234 "constant integer expression or string "
47236 else
47238 }
47239 else
47244 else
47246 }
47252 {
47256 }
47257 else
47258 {
47261 }
47264 do
47265 {
47269 {
47272 }
47277 else
47278 {
47282 }
47288 else
47290 }
47296 {
47303 else
47305 }
47306 else
47311 {
47313 "selector may not be specified in "
47316 }
47317 properties
47319 OMP_DECLARE_SIMD_CLAUSE_MASK,
47324 }
47330 }
47334 {
47337 }
47343 else
47345 }
47349 }
47351 /* OpenMP 5.0:
47353 trait-set-selector[,trait-set-selector[,...]]
47355 trait-set-selector:
47356 trait-set-selector-name = { trait-selector[, trait-selector[, ...]] }
47358 trait-set-selector-name:
47359 constructor
47360 device
47361 implementation
47362 user */
47364 static tree
47367 {
47369 do
47370 {
47373 setp
47376 {
47395 }
47397 {
47401 }
47409 matching_braces braces;
47413 tree selectors
47416 {
47419 }
47427 else
47429 }
47435 }
47437 /* Assumption clauses:
47438 OpenMP 5.1
47439 absent (directive-name-list)
47440 contains (directive-name-list)
47441 holds (expression)
47442 no_openmp
47443 no_openmp_routines
47444 no_parallelism */
47446 static void
47449 {
47464 {
47477 {
47482 }
47484 {
47489 }
47491 {
47496 }
47498 {
47500 matching_parens parens;
47502 {
47514 }
47515 }
47517 {
47519 matching_parens parens;
47521 {
47522 do
47523 {
47526 location_t dloc
47529 {
47530 tree id;
47535 CPP_KEYWORD))
47536 {
47537 enum rid rid
47541 }
47542 else
47545 }
47548 else
47549 {
47562 else
47563 {
47568 "mentioned in both %<absent%> and "
47576 ? &absent_head
47579 "mentioned multiple times in %qs "
47586 }
47589 }
47592 else
47594 }
47601 }
47602 }
47604 {
47611 }
47612 else
47613 {
47617 }
47618 }
47620 }
47622 /* OpenMP 5.1
47623 # pragma omp assume clauses[optseq] new-line */
47625 static void
47627 {
47630 }
47632 /* OpenMP 5.1
47633 # pragma omp assumes clauses[optseq] new-line */
47635 static bool
47637 {
47640 }
47642 /* Finalize #pragma omp declare variant after a fndecl has been parsed, and put
47643 that into "omp declare variant base" attribute. */
47645 static tree
47647 tree attrs)
47648 {
47649 matching_parens parens;
47651 {
47652 fail:
47655 }
47660 cp_expr varid
47668 tree variant;
47675 else
47676 {
47677 tree ambiguous_decls;
47685 }
47689 {
47691 variant
47699 }
47714 {
47717 }
47729 {
47731 match_loc);
47740 }
47745 }
47748 /* Finalize #pragma omp declare simd clauses after direct declarator has
47749 been parsed, and put that into "omp declare simd" attribute. */
47751 static tree
47753 {
47759 {
47764 }
47769 {
47780 {
47783 pragma_tok);
47791 }
47792 else
47793 {
47795 attrs
47797 }
47799 }
47803 {
47809 {
47811 {
47818 {
47826 else
47829 }
47835 {
47837 "unknown OpenMP directive name in "
47840 }
47844 {
47846 "OpenMP directive other than %<declare simd%> "
47847 "or %<declare variant%> appertains to a "
47850 }
47853 {
47855 "mixing OpenMP directives with attribute and "
47858 }
47863 {
47866 }
47868 cp_token tok = {};
47876 tok = {};
47881 tok = {};
47893 /* Move the current source position to that of the first token
47894 in the new lexer. */
47904 {
47912 pragma_tok);
47916 cl);
47921 }
47922 else
47923 {
47925 attrs
47927 attrs);
47928 }
47931 }
47933 }
47934 else
47936 }
47942 }
47944 /* Helper for cp_parser_omp_declare_target, handle one to or link clause
47945 on #pragma omp declare target. Return false if errors were reported. */
47947 static bool
47949 {
47952 tree id;
47954 {
47957 }
47958 else
47961 {
47964 "%qD specified both in declare target %<link%> and %qs"
47966 else
47968 "%qD specified both in declare target %<link%> and "
47971 }
47973 {
47980 {
47983 {
47987 }
47988 }
47989 }
47993 {
47997 {
48000 }
48001 }
48003 {
48007 {
48010 }
48011 }
48013 }
48015 /* OpenMP 4.0:
48016 # pragma omp declare target new-line
48017 declarations and definitions
48018 # pragma omp end declare target new-line
48020 OpenMP 4.5:
48021 # pragma omp declare target ( extended-list ) new-line
48023 # pragma omp declare target declare-target-clauses[seq] new-line */
48025 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
48026 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
48027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ENTER) \
48028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
48029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE))
48031 static void
48033 {
48040 clauses
48044 {
48046 clauses);
48049 }
48050 else
48051 {
48052 cp_omp_declare_target_attr a
48057 }
48062 {
48075 device_type);
48076 }
48080 }
48082 /* OpenMP 5.1
48083 # pragma omp begin assumes clauses[optseq] new-line
48085 # pragma omp begin declare target clauses[optseq] new-line */
48087 #define OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK \
48088 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE)
48090 static void
48092 {
48096 {
48099 }
48101 {
48105 {
48108 }
48110 {
48112 tree clauses
48114 OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK,
48116 pragma_tok);
48121 cp_omp_declare_target_attr a
48124 }
48125 else
48126 {
48129 }
48130 }
48132 {
48137 }
48138 else
48139 {
48142 }
48143 }
48145 /* OpenMP 4.0:
48146 # pragma omp end declare target new-line
48148 OpenMP 5.1:
48149 # pragma omp end assumes new-line */
48151 static void
48153 {
48157 {
48160 }
48162 {
48166 {
48169 }
48172 else
48173 {
48177 }
48181 "%<#pragma omp end declare target%> without corresponding "
48182 "%<#pragma omp declare target%> or "
48184 else
48185 {
48186 cp_omp_declare_target_attr
48189 {
48192 "%qs in attribute syntax terminated "
48197 else
48199 "%qs in pragma syntax terminated "
48204 }
48205 }
48206 }
48208 {
48215 else
48216 {
48217 cp_omp_begin_assumes_data
48220 {
48223 "%qs in attribute syntax terminated "
48226 else
48228 "%qs in pragma syntax terminated "
48231 }
48232 }
48233 }
48234 else
48235 {
48239 }
48240 }
48242 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
48243 expression and optional initializer clause of
48244 #pragma omp declare reduction. We store the expression(s) as
48245 either 3, 6 or 7 special statements inside of the artificial function's
48246 body. The first two statements are DECL_EXPRs for the artificial
48247 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
48248 expression that uses those variables.
48249 If there was any INITIALIZER clause, this is followed by further statements,
48250 the fourth and fifth statements are DECL_EXPRs for the artificial
48251 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
48252 constructor variant (first token after open paren is not omp_priv),
48253 then the sixth statement is a statement with the function call expression
48254 that uses the OMP_PRIV and optionally OMP_ORIG variable.
48255 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
48256 to initialize the OMP_PRIV artificial variable and there is seventh
48257 statement, a DECL_EXPR of the OMP_PRIV statement again. */
48259 static bool
48261 {
48273 tree combiner;
48294 {
48297 }
48300 {
48302 matching_parens parens;
48308 {
48311 }
48327 {
48331 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
48335 == CPP_CLOSE_PAREN
48338 {
48342 }
48348 }
48349 else
48350 {
48352 /* Don't create location wrapper nodes here. */
48353 auto_suppress_location_wrappers sentinel;
48368 {
48373 }
48375 tree arg;
48388 }
48401 }
48405 UNKNOWN_LOCATION);
48408 }
48410 /* OpenMP 4.0
48411 #pragma omp declare reduction (reduction-id : typename-list : expression) \
48412 initializer-clause[opt] new-line
48414 initializer-clause:
48415 initializer (omp_priv initializer)
48416 initializer (function-name (argument-list)) */
48418 static void
48421 {
48431 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
48438 {
48470 }
48482 /* Types may not be defined in declare reduction type list. */
48485 parser->type_definition_forbidden_message
48491 saved_colon_doesnt_start_class_def_p
48496 {
48500 ;
48518 else
48523 else
48525 }
48527 /* Restore the saved message. */
48530 parser->colon_doesnt_start_class_def_p
48535 {
48536 fail:
48539 }
48545 {
48546 tree fntype
48549 NULL_TREE);
48566 {
48570 }
48576 {
48579 }
48581 {
48583 {
48589 }
48596 }
48597 else
48598 {
48601 /* We should never meet a matched duplicate decl. */
48603 }
48608 else
48611 {
48614 }
48622 else
48623 {
48627 }
48632 {
48640 }
48648 }
48652 done:
48653 /* Free any declarators allocated. */
48655 }
48657 /* OpenMP 4.0
48658 #pragma omp declare simd declare-simd-clauses[optseq] new-line
48659 #pragma omp declare reduction (reduction-id : typename-list : expression) \
48660 initializer-clause[opt] new-line
48661 #pragma omp declare target new-line
48663 OpenMP 5.0
48664 #pragma omp declare variant (identifier) match (context-selector) */
48666 static bool
48669 {
48671 {
48676 {
48681 }
48683 {
48688 }
48691 {
48694 context);
48696 }
48698 {
48701 }
48703 {
48707 }
48708 }
48713 }
48715 /* OpenMP 5.0
48716 #pragma omp requires clauses[optseq] new-line */
48718 static bool
48720 {
48725 {
48731 {
48746 {
48749 matching_parens parens;
48751 {
48753 {
48758 this_req
48761 this_req
48764 this_req
48766 }
48768 {
48770 "expected %<seq_cst%>, %<relaxed%> or "
48773 {
48780 CPP_CLOSE_PAREN))
48783 }
48784 }
48785 else
48792 /*consume_paren=*/
48796 {
48799 }
48800 }
48802 }
48803 else
48804 {
48806 "%<unified_shared_memory%>, "
48807 "%<dynamic_allocators%>, "
48808 "%<reverse_offload%> "
48812 }
48816 {
48818 {
48825 }
48827 {
48831 }
48834 {
48837 this_req
48839 (omp_requires_mask
48841 }
48845 "lexically after first %<atomic%> construct "
48848 omp_requires_mask
48851 }
48852 }
48854 }
48860 }
48863 /* OpenMP 5.1:
48864 #pragma omp nothing new-line */
48866 static void
48868 {
48870 }
48873 /* OpenMP 5.1
48874 #pragma omp error clauses[optseq] new-line */
48876 static bool
48879 {
48887 {
48900 };
48908 {
48911 }
48913 {
48918 }
48922 matching_parens parens;
48924 {
48926 {
48930 else
48932 tf_warning_or_error,
48933 LOOKUP_NORMAL);
48934 }
48935 else
48936 {
48938 {
48946 }
48948 {
48953 {
48960 CPP_CLOSE_PAREN))
48963 }
48964 }
48965 else
48967 }
48973 /*consume_paren=*/
48977 {
48979 {
48982 }
48983 else
48985 }
48987 {
48989 {
48992 }
48993 else
48995 }
48996 }
48997 else
48999 }
49009 {
49011 {
49015 }
49016 tree fndecl
49025 }
49032 {
49036 }
49040 else
49044 }
49046 /* OpenMP 4.5:
49047 #pragma omp taskloop taskloop-clause[optseq] new-line
49048 for-loop
49050 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
49051 for-loop */
49053 #define OMP_TASKLOOP_CLAUSE_MASK \
49054 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
49055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
49056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
49057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
49058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
49059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
49060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
49061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
49062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
49063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
49064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
49065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
49066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
49067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
49068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
49069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
49070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
49072 static tree
49076 {
49083 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
49084 clause. */
49089 {
49094 {
49118 }
49119 }
49121 {
49124 }
49129 {
49132 }
49139 if_p);
49145 }
49148 /* OpenACC 2.0:
49149 # pragma acc routine oacc-routine-clause[optseq] new-line
49150 function-definition
49152 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
49153 */
49155 #define OACC_ROUTINE_CLAUSE_MASK \
49156 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
49157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
49158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
49159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
49160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NOHOST) )
49162 /* Parse the OpenACC routine pragma. This has an optional '( name )'
49163 component, which must resolve to a declared namespace-scope
49164 function. The clauses are either processed directly (for a named
49165 function), or defered until the immediatley following declaration
49166 is parsed. */
49168 static void
49171 {
49173 /* The checking for "another pragma following this one" in the "no optional
49174 '( name )'" case makes sure that we dont re-enter. */
49177 cp_oacc_routine_data data;
49183 /* It is safe to take the address of a local variable; it will only be
49184 used while this scope is live. */
49187 /* Look for optional '( name )'. */
49189 {
49190 matching_parens parens;
49193 /* We parse the name as an id-expression. If it resolves to
49194 anything other than a non-overloaded function at namespace
49195 scope, it's an error. */
49211 {
49215 }
49217 data.clauses
49221 /* The clauses are in reverse order; fix that to make later diagnostic
49222 emission easier. */
49228 {
49233 }
49235 /* Perhaps we should use the same rule as declarations in different
49236 namespaces? */
49238 {
49243 }
49246 {
49250 }
49254 }
49256 {
49257 /* Store away all pragma tokens. */
49265 /* Emit a helpful diagnostic if there's another pragma following this
49266 one. */
49268 {
49271 /* ..., and then just keep going. */
49273 }
49275 /* We only have to consider the pragma_external case here. */
49280 else
49283 }
49284 }
49286 /* Finalize #pragma acc routine clauses after direct declarator has
49287 been parsed. */
49289 static tree
49291 {
49296 {
49298 "%<#pragma acc routine%> not immediately followed by "
49301 }
49317 /* The clauses are in reverse order; fix that to make later diagnostic
49318 emission easier. */
49321 /* Later, cp_finalize_oacc_routine will process the clauses. */
49325 }
49327 /* Apply any saved OpenACC routine clauses to a just-parsed
49328 declaration. */
49330 static void
49332 {
49334 {
49335 /* Keep going if we're in error reporting mode. */
49341 {
49343 {
49345 "%<#pragma acc routine%> not immediately followed by"
49349 }
49353 }
49355 int compatible
49360 {
49363 }
49365 {
49366 }
49367 else
49368 {
49370 {
49379 }
49381 /* Set the routine's level of parallelism. */
49385 /* Add an "omp declare target" attribute. */
49390 }
49391 }
49392 }
49394 /* Main entry point to OpenMP statement pragmas. */
49396 static void
49398 {
49399 tree stmt;
49404 {
49432 if_p);
49452 if_p);
49457 if_p);
49462 if_p);
49467 if_p);
49472 if_p);
49477 if_p);
49489 if_p);
49503 if_p);
49508 if_p);
49515 }
49518 }
49519 \f
49520 /* Transactional Memory parsing routines. */
49522 /* Parse a transaction attribute.
49524 txn-attribute:
49525 attribute
49526 [ [ identifier ] ]
49528 We use this instead of cp_parser_attributes_opt for transactions to avoid
49529 the pedwarn in C++98 mode. */
49531 static tree
49533 {
49548 {
49552 /* For keywords, use the canonical spelling,
49553 not the parsed identifier. */
49557 }
49558 else
49562 error1:
49565 }
49567 /* Parse a __transaction_atomic or __transaction_relaxed statement.
49569 transaction-statement:
49570 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
49571 compound-statement
49572 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
49573 */
49575 static tree
49577 {
49588 else
49589 {
49593 }
49595 /* Parse a noexcept specification. */
49599 {
49600 /* cancel-and-throw is unimplemented. */
49603 }
49604 else
49606 CP_PARSER_FLAGS_NONE,
49611 /* Keep track if we're in the lexical scope of an outer transaction. */
49623 }
49625 /* Parse a __transaction_atomic or __transaction_relaxed expression.
49627 transaction-expression:
49628 __transaction_atomic txn-noexcept-spec[opt] ( expression )
49629 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
49630 */
49632 static tree
49634 {
49647 keyword == RID_TRANSACTION_RELAXED
49661 /* Set this early. This might mean that we allow transaction_cancel in
49662 an expression that we find out later actually has to be a constexpr.
49663 However, we expect that cxx_constant_value will be able to deal with
49664 this; also, if the noexcept has no constexpr, then what we parse next
49665 really is a transaction's body. */
49668 /* Parse a noexcept specification. */
49670 CP_PARSER_FLAGS_NONE,
49677 {
49678 matching_parens parens;
49685 }
49686 else
49687 {
49688 /* The only expression that is available got parsed for the noexcept
49689 already. noexcept is true then. */
49692 }
49701 }
49703 /* Parse a function-transaction-block.
49705 function-transaction-block:
49706 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
49707 function-body
49708 __transaction_atomic txn-attribute[opt] function-try-block
49709 __transaction_relaxed ctor-initializer[opt] function-body
49710 __transaction_relaxed function-try-block
49711 */
49713 static void
49715 {
49730 else
49731 {
49735 }
49743 else
49744 cp_parser_ctor_initializer_opt_and_function_body
49750 }
49752 /* Parse a __transaction_cancel statement.
49754 cancel-statement:
49755 __transaction_cancel txn-attribute[opt] ;
49756 __transaction_cancel txn-attribute[opt] throw-expression ;
49758 ??? Cancel and throw is not yet implemented. */
49760 static tree
49762 {
49768 RT_TRANSACTION_CANCEL);
49775 /* ??? Parse cancel-and-throw here. */
49780 {
49784 }
49786 {
49790 }
49792 {
49795 {
49801 }
49802 }
49804 {
49808 }
49814 }
49815 \f
49817 /* Special handling for the first token or line in the file. The first
49818 thing in the file might be #pragma GCC pch_preprocess, which loads a
49819 PCH file, which is a GC collection point. So we need to handle this
49820 first pragma without benefit of an existing lexer structure.
49822 Always returns one token to the caller in *FIRST_TOKEN. This is
49823 either the true first token of the file, or the first token after
49824 the initial pragma. */
49826 static void
49828 {
49836 {
49840 }
49842 /* Skip to the end of the pragma. */
49844 {
49847 do
49850 }
49852 /* Now actually load the PCH file. */
49856 /* Read one more token to return to our caller. We have to do this
49857 after reading the PCH file in, since its pointers have to be
49858 live. */
49860 }
49862 /* Parse a pragma GCC ivdep. */
49864 static bool
49866 {
49869 }
49871 /* Parse a pragma GCC unroll. */
49873 static unsigned short
49875 {
49885 {
49887 " assignment-expression that evaluates to a non-negative"
49890 }
49891 else
49892 {
49896 }
49899 }
49901 /* Parse a pragma GCC novector. */
49903 static bool
49905 {
49908 }
49910 /* Normal parsing of a pragma token. Here we can (and must) use the
49911 regular lexer. */
49913 static bool
49915 {
49918 tree stmt;
49930 {
49936 }
49940 {
49948 {
49959 }
49964 {
49975 }
49980 {
49991 }
49996 {
50008 }
50013 {
50025 }
50030 {
50042 }
50061 {
50067 }
50075 {
50081 }
50089 {
50094 }
50100 {
50106 }
50114 {
50120 }
50162 {
50164 "%<#pragma omp requires%> may only be used at file or "
50168 }
50173 {
50175 "%<#pragma omp assumes%> may only be used at file or "
50179 }
50215 "%<#pragma omp scan%> may only be used in "
50221 "%<#pragma omp section%> may only be used in "
50228 {
50235 {
50247 }
50250 {
50253 pragma_str);
50255 }
50259 do
50260 {
50262 {
50264 {
50269 }
50271 {
50276 }
50278 {
50283 }
50287 }
50290 }
50297 {
50300 }
50303 }
50310 bad_stmt:
50313 }
50317 }
50319 /* Helper for pragma_lex in preprocess-only mode; in this mode, we have not
50320 populated the lexer with any tokens (the tokens rather being read by
50321 c-ppoutput.c's machinery), so we need to read enough tokens now to handle
50322 a pragma. */
50323 static void
50325 {
50330 /* Read the rest of the tokens comprising the pragma line. */
50332 do
50333 {
50340 }
50342 /* The interface the pragma parsers have to the lexer. */
50344 enum cpp_ttype
50346 {
50362 else
50363 {
50367 }
50370 }
50372 void
50374 {
50375 /* We have already read all the tokens, so we just need to discard
50376 them here. */
50380 }
50382 \f
50383 /* External interface. */
50385 /* Parse one entire translation unit. */
50387 void
50389 {
50397 /* cp_lexer_new_main is called before doing any GC allocation
50398 because tokenization might load a PCH file. */
50407 }
50409 /* Create an identifier for a generic parameter type (a synthesized
50410 template parameter implied by `auto' or a concept identifier). */
50413 static tree
50415 {
50419 }
50421 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
50422 (creating a new template parameter list if necessary). Returns the newly
50423 created template type parm. */
50425 static tree
50427 {
50428 /* A requires-clause is not a function and cannot have placeholders. */
50430 {
50433 }
50437 /* We are either continuing a function template that already contains implicit
50438 template parameters, creating a new fully-implicit function template, or
50439 extending an existing explicit function template with implicit template
50440 parameters. */
50448 {
50452 }
50453 else
50454 {
50455 /* Roll back to the existing template parameter scope (in the case of
50456 extending an explicit function template) or introduce a new template
50457 parameter scope ahead of the function parameter scope (or class scope
50458 in the case of out-of-line member definitions). The function scope is
50459 added back after template parameter synthesis below. */
50464 {
50467 }
50469 {
50470 /* If not defining a class, then any class scope is a scope level in
50471 an out-of-line member definition. In this case simply wind back
50472 beyond the first such scope to inject the template parameter list.
50473 Otherwise wind back to the class being defined. The latter can
50474 occur in class member friend declarations such as:
50476 class A {
50477 void foo (auto);
50478 };
50479 class B {
50480 friend void A::foo (auto);
50481 };
50483 The template parameter list synthesized for the friend declaration
50484 must be injected in the scope of 'B'. This can also occur in
50485 erroneous cases such as:
50487 struct A {
50488 struct B {
50489 void foo (auto);
50490 };
50491 void B::foo (auto) {}
50492 };
50494 Here the attempted definition of 'B::foo' within 'A' is ill-formed
50495 but, nevertheless, the template parameter list synthesized for the
50496 declarator should be injected into the scope of 'A' as if the
50497 ill-formed template was specified explicitly. */
50500 {
50503 }
50504 }
50510 {
50511 /* Introduce a new template parameter list for implicit template
50512 parameters. */
50516 parser->implicit_template_scope
50523 }
50524 else
50525 {
50526 /* Synthesize implicit template parameters at the end of the explicit
50527 template parameter list. */
50534 parser->implicit_template_parms
50536 }
50537 }
50539 /* Synthesize a new template parameter and track the current template
50540 parameter chain with implicit_template_parms. */
50546 /* Synthesize the type template parameter. */
50554 /* Attach the constraint to the parm before processing. */
50557 tree new_parm
50559 input_location,
50560 node,
50563 // Process_template_parm returns the list of parms, and
50564 // parser->implicit_template_parms holds the final node of the parm
50565 // list. We really want to manipulate the newly appended element.
50572 // Record the last implicit parm node
50575 /* Mark the synthetic declaration "virtual". This is used when
50576 comparing template-heads to determine if whether an abbreviated
50577 function template is equivalent to an explicit template.
50579 Note that DECL_ARTIFICIAL is used elsewhere for template
50580 parameters. */
50586 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
50589 /* If creating a fully implicit function template, start the new implicit
50590 template parameter list with this synthesized type, otherwise grow the
50591 current template parameter list. */
50594 {
50600 }
50601 else
50602 {
50607 }
50609 /* If the new parameter was constrained, we need to add that to the
50610 constraints in the template parameter list. */
50612 {
50616 }
50621 }
50623 /* Finish the declaration of a fully implicit function template. Such a
50624 template has no explicit template parameter list so has not been through the
50625 normal template head and tail processing. synthesize_implicit_template_parm
50626 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
50627 provided if the declaration is a class member such that its template
50628 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
50629 form is returned. Otherwise NULL_TREE is returned. */
50631 static tree
50633 {
50638 {
50642 }
50654 }
50656 /* Like finish_fully_implicit_template, but to be used in error
50657 recovery, rearranging scopes so that we restore the state we had
50658 before synthesize_implicit_template_parm inserted the implement
50659 template parms scope. */
50661 static void
50663 {
50668 {
50677 }
50678 else
50684 }
50686 /* Helper function for diagnostics that have complained about things
50687 being used with 'extern "C"' linkage.
50689 Attempt to issue a note showing where the 'extern "C"' linkage began. */
50691 void
50693 {
50697 }