| blob | d89553e7da81d64a6390c385e009b4ff07b5da58 |
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 /* Manifest constants. */
265 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
266 #define CP_SAVED_TOKEN_STACK 5
268 /* Variables. */
270 /* The stream to which debugging output should be written. */
273 /* Nonzero if we are parsing an unevaluated operand: an operand to
274 sizeof, typeof, or alignof. */
277 /* Dump up to NUM tokens in BUFFER to FILE starting with token
278 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
279 first token in BUFFER. If NUM is 0, dump all the tokens. If
280 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
281 highlighted by surrounding it in [[ ]]. */
283 static void
287 {
304 {
307 }
312 {
319 nprinted++;
329 {
339 }
340 }
343 {
346 }
349 }
352 /* Dump all tokens in BUFFER to stderr. */
354 void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
364 }
366 DEBUG_FUNCTION void
368 {
371 else
373 }
376 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
377 description for T. */
379 static void
381 {
383 {
386 }
387 }
390 /* Dump parser context C to FILE. */
392 static void
394 {
399 }
402 /* Print the stack of parsing contexts to FILE starting with FIRST. */
404 static void
406 {
412 {
415 }
416 }
419 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
421 static void
423 {
426 }
429 /* Print an unparsed function entry UF to FILE. */
431 static void
433 {
436 tree fn;
441 i++)
442 {
448 }
453 {
456 }
462 {
465 }
467 }
470 /* Print the stack of unparsed member functions S to FILE. */
472 static void
475 {
481 {
484 }
485 }
488 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
489 the given PARSER. If FILE is NULL, the output is printed on stderr. */
491 static void
493 {
505 next_token);
506 }
509 /* Dump debugging information for the given PARSER. If FILE is NULL,
510 the output is printed on stderr. */
512 void
514 {
517 expanded_location eloc;
582 parser->type_definition_forbidden_message_arg
598 }
600 DEBUG_FUNCTION void
602 {
604 }
606 DEBUG_FUNCTION void
608 {
611 else
613 }
615 /* Allocate memory for a new lexer object and return it. */
619 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
634 /* Return TRUE if token is the start of a module declaration that will be
635 terminated by a CPP_PRAGMA_EOL token. */
638 {
642 }
644 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
645 PRAGMA_NONE. */
647 static enum pragma_kind
649 {
652 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
654 }
656 /* Handle early pragmas such as #pragma GCC diagnostic, which needs to be done
657 during preprocessing for the case of preprocessing-related diagnostics. This
658 is called immediately after pushing the CPP_PRAGMA_EOL token onto
659 lexer->buffer. */
661 static void
663 {
667 /* Back up to the start of the pragma so pragma_lex () can parse it when
668 c-pragma lib asks it to. */
672 {
677 }
683 /* Dispatch it. */
684 const unsigned int id
689 /* Reset to normal state. */
691 }
693 /* The parser. */
697 /* Create a new main C++ lexer, the lexer that gets tokens from the
698 preprocessor, and also create the main parser. */
702 {
703 cp_token token;
705 /* It's possible that parsing the first pragma will load a PCH file,
706 which is a GC collection point. So we have to do that before
707 allocating any memory. */
713 /* Put the first token in the buffer. */
720 /* Create the parser now, so we can use it to handle early pragmas. */
724 /* Get the remaining tokens from the preprocessor. */
726 {
728 /* Process the previous token. */
732 /* Check for early pragmas that need to be handled now. */
738 }
746 {
747 /* Set the EOF token's location to be the just after the previous
748 token's range. That way 'at-eof' diagnostics point at something
749 meaninful. */
753 }
758 /* Subsequent preprocessor diagnostics should use compiler
759 diagnostic functions to get the compiler source location. */
766 }
768 /* Create a new lexer whose token stream is primed with the tokens in
769 CACHE. When these tokens are exhausted, no new tokens will be read. */
773 {
778 /* We do not own the buffer. */
781 /* Insert an EOF token. */
792 /* Initially we are not debugging. */
798 }
800 /* Frees all resources associated with LEXER. */
802 static void
804 {
807 else
808 {
809 /* Restore the token we overwrite with EOF. */
812 }
815 }
817 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
818 be used. The point of this flag is to help the compiler to fold away calls
819 to cp_lexer_debugging_p within this source file at compile time, when the
820 lexer is not being debugged. */
822 #define LEXER_DEBUGGING_ENABLED_P false
824 /* Returns nonzero if debugging information should be output. */
828 {
833 }
838 {
840 }
844 {
846 }
850 {
852 }
856 {
858 }
862 {
865 /* Skip past purged tokens. */
867 {
869 tp--;
870 }
873 }
875 /* Same as above, but return NULL when the lexer doesn't own the token
876 buffer or if the next_token is at the start of the token
877 vector or if all previous tokens are purged. */
881 {
884 {
887 /* Skip past purged tokens. */
889 {
892 tp--;
893 }
895 }
898 }
900 /* Overload for make_location, taking the lexer to mean the location of the
901 previous token. */
905 {
908 }
910 /* Overload for make_location taking tokens instead of locations. */
914 {
916 }
918 /* nonzero if we are presently saving tokens. */
922 {
924 }
926 /* Store the next token from the preprocessor in *TOKEN. Return true
927 if we reach EOF. If LEXER is NULL, assume we are handling an
928 initial #pragma pch_preprocess, and thus want the lexer to return
929 processed strings.
931 Diagnostics issued from this function must have their controlling option (if
932 any) in c.opt annotated as a libcpp option via the CppReason property. */
934 static void
936 {
939 /* Get a new token from the preprocessor. */
940 token->type
942 flags);
947 /* Usually never see a zero, but just in case ... */
950 /* On some systems, some header files are surrounded by an
951 implicit extern "C" block. Set a flag in the token if it
952 comes from such a header. */
957 /* Check to see if this token is a keyword. */
959 {
961 {
962 /* Mark this token as a keyword. */
964 /* Record which keyword. */
966 }
967 else
968 {
972 /* These are outside the CXX11 range. */
976 {
977 /* Warn about the C++11 keyword (but still treat it as
978 an identifier). */
983 /* Clear out the C_RID_CODE so we don't warn about this
984 particular identifier-turned-keyword again. */
986 }
990 {
991 /* Warn about the C++20 keyword (but still treat it as
992 an identifier). */
997 /* Clear out the C_RID_CODE so we don't warn about this
998 particular identifier-turned-keyword again. */
1000 }
1003 }
1004 }
1006 {
1007 /* This only happens in Objective-C++; it must be a keyword. */
1010 {
1011 /* Replace 'class' with '@class', 'private' with '@private',
1012 etc. This prevents confusion with the C++ keyword
1013 'class', and makes the tokens consistent with other
1014 Objective-C 'AT' keywords. For example '@class' is
1015 reported as RID_AT_CLASS which is consistent with
1016 '@synchronized', which is reported as
1017 RID_AT_SYNCHRONIZED.
1018 */
1028 }
1029 }
1030 }
1032 /* Update the globals input_location and the input file stack from TOKEN. */
1035 {
1037 }
1039 /* Update the globals input_location and the input file stack from LEXER. */
1042 {
1045 }
1047 /* Return a pointer to the next token in the token stream, but do not
1048 consume it. */
1052 {
1054 {
1058 }
1060 }
1062 /* Return true if the next token has the indicated TYPE. */
1066 {
1068 }
1070 /* Return true if the next token does not have the indicated TYPE. */
1074 {
1076 }
1078 /* Return true if the next token is the indicated KEYWORD. */
1082 {
1084 }
1088 {
1090 }
1094 {
1096 }
1098 /* Return true if KEYWORD can start a decl-specifier. */
1100 bool
1102 {
1104 {
1105 /* auto specifier: storage-class-specifier in C++,
1106 simple-type-specifier in C++0x. */
1108 /* Storage classes. */
1114 /* Elaborated type specifiers. */
1120 /* Simple type specifiers. */
1134 CASE_RID_FLOATN_NX:
1136 /* CV qualifiers. */
1139 /* Function specifiers. */
1142 /* friend/typdef/inline specifiers. */
1146 /* GNU extensions. */
1148 /* C++11 extensions. */
1151 /* C++20 extensions. */
1156 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
1157 case RID_##CODE:
1159 #undef DEFTRAIT_TYPE
1168 }
1169 }
1171 /* Return true if the next token is a keyword for a decl-specifier. */
1173 static bool
1175 {
1180 }
1182 /* Returns TRUE iff the token T begins a decltype type. */
1184 static bool
1186 {
1189 }
1191 /* Returns TRUE iff the next token begins a decltype type. */
1193 static bool
1195 {
1198 }
1200 /* Called when processing a token with tree_check_value; perform or defer the
1201 associated checks and return the value. */
1203 static tree
1205 {
1206 /* Perform any access checks that were deferred. */
1211 {
1217 }
1218 /* Return the stored value. */
1220 }
1222 /* Return a pointer to the Nth token in the token stream. If N is 1,
1223 then this is precisely equivalent to cp_lexer_peek_token (except
1224 that it is not inline). One would like to disallow that case, but
1225 there is one case (cp_parser_nth_token_starts_template_id) where
1226 the caller passes a variable for N and it might be 1. */
1230 {
1233 /* N is 1-based, not zero-based. */
1243 {
1247 }
1250 {
1253 }
1256 }
1258 /* Return the next token, and advance the lexer's next_token pointer
1259 to point to the next non-purged token. */
1263 {
1266 do
1267 {
1270 }
1275 /* Provide debugging output. */
1277 {
1281 }
1284 }
1286 /* Permanently remove the next token from the token stream, and
1287 advance the next_token pointer to refer to the next non-purged
1288 token. */
1290 static void
1292 {
1301 do
1302 tok++;
1305 }
1307 /* Permanently remove all tokens after TOK, up to, but not
1308 including, the token that will be returned next by
1309 cp_lexer_peek_token. */
1311 static void
1313 {
1319 {
1324 }
1325 }
1327 /* Begin saving tokens. All tokens consumed after this point will be
1328 preserved. */
1330 static void
1332 {
1333 /* Provide debugging output. */
1338 }
1340 /* Commit to the portion of the token stream most recently saved. */
1342 static void
1344 {
1345 /* Provide debugging output. */
1350 }
1352 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1353 to the token stream. Stop saving tokens. */
1355 static void
1357 {
1358 /* Provide debugging output. */
1363 }
1365 /* Determines what saved_token_sentinel does when going out of scope. */
1368 STS_COMMIT,
1369 STS_ROLLBACK,
1370 STS_DONOTHING
1371 };
1373 /* RAII wrapper around the above functions, with sanity checking (the token
1374 stream should be the same at the point of instantiation as it is at the
1375 point of destruction).
1377 Creating a variable saves tokens. MODE determines what happens when the
1378 object is destroyed. STS_COMMIT commits tokens (default),
1379 STS_ROLLBACK rolls-back and STS_DONOTHING does nothing. Calling
1380 rollback() will immediately roll-back tokens and set MODE to
1381 STS_DONOTHING. */
1383 struct saved_token_sentinel
1384 {
1387 saved_token_sentinel_mode mode;
1391 {
1394 }
1396 {
1398 cp_lexer_set_source_position_from_token
1401 }
1403 {
1410 }
1411 };
1413 /* Print a representation of the TOKEN on the STREAM. */
1415 static void
1417 {
1418 /* We don't use cpp_type2name here because the parser defines
1419 a few tokens of its own. */
1421 /* cpplib-defined token types */
1422 #define OP(e, s) #e,
1423 #define TK(e, s) #e,
1424 TTYPE_TABLE
1425 #undef OP
1426 #undef TK
1427 /* C++ parser token types - see "Manifest constants", above. */
1431 };
1433 /* For some tokens, print the associated data. */
1435 {
1437 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1438 For example, `struct' is mapped to an INTEGER_CST. */
1441 /* fall through */
1459 /* If we have a name for the token, print it out. Otherwise, we
1460 simply give the numeric code. */
1463 else
1466 }
1467 }
1469 DEBUG_FUNCTION void
1471 {
1474 }
1476 DEBUG_FUNCTION void
1478 {
1481 else
1483 }
1486 /* Start emitting debugging information. */
1488 static void
1490 {
1497 }
1499 /* Stop emitting debugging information. */
1501 static void
1503 {
1510 }
1512 /* Create a new cp_token_cache, representing a range of tokens. */
1516 {
1521 }
1523 /* Diagnose if #pragma omp declare simd isn't followed immediately
1524 by function declaration or definition. */
1528 {
1530 {
1535 }
1536 }
1538 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1539 and put that into "omp declare simd" attribute. */
1543 {
1545 {
1547 {
1550 }
1552 {
1555 }
1556 }
1557 }
1559 /* Similarly, but for use in declaration parsing functions
1560 which call cp_parser_handle_directive_omp_attributes. */
1564 {
1571 "%<declare %s%> directive not immediately followed by "
1575 }
1577 /* Diagnose if #pragma acc routine isn't followed immediately by function
1578 declaration or definition. */
1582 {
1584 {
1586 "%<#pragma acc routine%> not immediately followed by "
1589 }
1590 }
1591 \f
1592 /* Decl-specifiers. */
1594 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1596 static void
1598 {
1600 }
1602 /* Declarators. */
1604 /* Nothing other than the parser should be creating declarators;
1605 declarators are a semi-syntactic representation of C++ entities.
1606 Other parts of the front end that need to create entities (like
1607 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1621 /* An erroneous declarator. */
1624 /* The obstack on which declarators and related data structures are
1625 allocated. */
1628 /* Alloc BYTES from the declarator memory pool. */
1632 {
1634 }
1636 /* Allocate a declarator of the indicated KIND. Clear fields that are
1637 common to all declarators. */
1641 {
1655 }
1657 /* Make a declarator for a generalized identifier. If
1658 QUALIFYING_SCOPE is non-NULL, the identifier is
1659 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1660 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1661 is, if any. */
1666 {
1669 /* It is valid to write:
1671 class C { void f(); };
1672 typedef C D;
1673 void D::f();
1675 The standard is not clear about whether `typedef const C D' is
1676 legal; as of 2002-09-15 the committee is considering that
1677 question. EDG 3.0 allows that syntax. Therefore, we do as
1678 well. */
1693 }
1695 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1696 of modifiers such as const or volatile to apply to the pointer
1697 type, represented as identifiers. ATTRIBUTES represent the attributes that
1698 appertain to the pointer or reference. */
1700 cp_declarator *
1702 tree attributes)
1703 {
1711 {
1715 }
1716 else
1722 }
1724 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1725 represent the attributes that appertain to the pointer or
1726 reference. */
1728 cp_declarator *
1731 {
1739 {
1743 }
1744 else
1750 }
1752 /* Like make_pointer_declarator -- but for a pointer to a non-static
1753 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1754 appertain to the pointer or reference. */
1756 cp_declarator *
1759 tree attributes)
1760 {
1769 {
1772 }
1773 else
1779 }
1781 /* Make a declarator for the function given by TARGET, with the
1782 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1783 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1784 indicates what exceptions can be thrown. STD_ATTRS contains
1785 attributes that appertain to the function type. */
1787 cp_declarator *
1789 tree parms,
1790 cp_cv_quals cv_qualifiers,
1791 cp_virt_specifiers virt_specifiers,
1792 cp_ref_qualifier ref_qualifier,
1793 tree tx_qualifier,
1794 tree exception_specification,
1795 tree late_return_type,
1796 tree requires_clause,
1797 tree std_attrs,
1798 location_t parens_loc)
1799 {
1814 {
1818 }
1819 else
1825 }
1827 /* Make a declarator for an array of BOUNDS elements, each of which is
1828 defined by ELEMENT. */
1830 cp_declarator *
1832 {
1839 {
1843 }
1844 else
1848 }
1850 /* Determine whether the declarator we've seen so far can be a
1851 parameter pack, when followed by an ellipsis. */
1852 static bool
1854 {
1856 /* We already saw an ellipsis. */
1859 /* Search for a declarator name, or any other declarator that goes
1860 after the point where the ellipsis could appear in a parameter
1861 pack. If we find any of these, then this declarator cannot be
1862 made into a parameter pack. */
1865 {
1867 {
1880 }
1881 }
1884 }
1888 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1889 DECLARATOR and DEFAULT_ARGUMENT. */
1891 cp_parameter_declarator *
1894 tree default_argument,
1895 location_t loc,
1897 {
1905 else
1913 }
1915 /* Returns true iff DECLARATOR is a declaration for a function. */
1917 static bool
1919 {
1921 {
1930 }
1932 }
1934 /* The parser. */
1936 /* Overview
1937 --------
1939 A cp_parser parses the token stream as specified by the C++
1940 grammar. Its job is purely parsing, not semantic analysis. For
1941 example, the parser breaks the token stream into declarators,
1942 expressions, statements, and other similar syntactic constructs.
1943 It does not check that the types of the expressions on either side
1944 of an assignment-statement are compatible, or that a function is
1945 not declared with a parameter of type `void'.
1947 The parser invokes routines elsewhere in the compiler to perform
1948 semantic analysis and to build up the abstract syntax tree for the
1949 code processed.
1951 The parser (and the template instantiation code, which is, in a
1952 way, a close relative of parsing) are the only parts of the
1953 compiler that should be calling push_scope and pop_scope, or
1954 related functions. The parser (and template instantiation code)
1955 keeps track of what scope is presently active; everything else
1956 should simply honor that. (The code that generates static
1957 initializers may also need to set the scope, in order to check
1958 access control correctly when emitting the initializers.)
1960 Methodology
1961 -----------
1963 The parser is of the standard recursive-descent variety. Upcoming
1964 tokens in the token stream are examined in order to determine which
1965 production to use when parsing a non-terminal. Some C++ constructs
1966 require arbitrary look ahead to disambiguate. For example, it is
1967 impossible, in the general case, to tell whether a statement is an
1968 expression or declaration without scanning the entire statement.
1969 Therefore, the parser is capable of "parsing tentatively." When the
1970 parser is not sure what construct comes next, it enters this mode.
1971 Then, while we attempt to parse the construct, the parser queues up
1972 error messages, rather than issuing them immediately, and saves the
1973 tokens it consumes. If the construct is parsed successfully, the
1974 parser "commits", i.e., it issues any queued error messages and
1975 the tokens that were being preserved are permanently discarded.
1976 If, however, the construct is not parsed successfully, the parser
1977 rolls back its state completely so that it can resume parsing using
1978 a different alternative.
1980 Future Improvements
1981 -------------------
1983 The performance of the parser could probably be improved substantially.
1984 We could often eliminate the need to parse tentatively by looking ahead
1985 a little bit. In some places, this approach might not entirely eliminate
1986 the need to parse tentatively, but it might still speed up the average
1987 case. */
1989 /* Flags that are passed to some parsing functions. These values can
1990 be bitwise-ored together. */
1992 enum
1993 {
1994 /* No flags. */
1996 /* The construct is optional. If it is not present, then no error
1997 should be issued. */
1999 /* When parsing a type-specifier, treat user-defined type-names
2000 as non-type identifiers. */
2002 /* When parsing a type-specifier, do not try to parse a class-specifier
2003 or enum-specifier. */
2005 /* When parsing a decl-specifier-seq, only allow type-specifier or
2006 constexpr. */
2008 /* When parsing a decl-specifier-seq, only allow mutable, constexpr or
2009 for C++20 consteval or for C++23 static. */
2011 /* When parsing a decl-specifier-seq, allow missing typename. */
2013 /* When parsing of the noexcept-specifier should be delayed. */
2015 /* When parsing a consteval declarator. */
2017 };
2019 /* This type is used for parameters and variables which hold
2020 combinations of the above flags. */
2023 /* The different kinds of declarators we want to parse. */
2025 enum cp_parser_declarator_kind
2026 {
2027 /* We want an abstract declarator. */
2028 CP_PARSER_DECLARATOR_ABSTRACT,
2029 /* We want a named declarator. */
2030 CP_PARSER_DECLARATOR_NAMED,
2031 /* We don't mind, but the name must be an unqualified-id. */
2032 CP_PARSER_DECLARATOR_EITHER
2033 };
2035 /* The precedence values used to parse binary expressions. The minimum value
2036 of PREC must be 1, because zero is reserved to quickly discriminate
2037 binary operators from other tokens. */
2039 enum cp_parser_prec
2040 {
2041 PREC_NOT_OPERATOR,
2042 PREC_LOGICAL_OR_EXPRESSION,
2043 PREC_LOGICAL_AND_EXPRESSION,
2044 PREC_INCLUSIVE_OR_EXPRESSION,
2045 PREC_EXCLUSIVE_OR_EXPRESSION,
2046 PREC_AND_EXPRESSION,
2047 PREC_EQUALITY_EXPRESSION,
2048 PREC_RELATIONAL_EXPRESSION,
2049 PREC_SPACESHIP_EXPRESSION,
2050 PREC_SHIFT_EXPRESSION,
2051 PREC_ADDITIVE_EXPRESSION,
2052 PREC_MULTIPLICATIVE_EXPRESSION,
2053 PREC_PM_EXPRESSION,
2054 NUM_PREC_VALUES = PREC_PM_EXPRESSION
2055 };
2057 /* A mapping from a token type to a corresponding tree node type, with a
2058 precedence value. */
2060 struct cp_parser_binary_operations_map_node
2061 {
2062 /* The token type. */
2064 /* The corresponding tree code. */
2066 /* The precedence of this operator. */
2068 };
2070 struct cp_parser_expression_stack_entry
2071 {
2072 /* Left hand side of the binary operation we are currently
2073 parsing. */
2074 cp_expr lhs;
2075 /* Original tree code for left hand side, if it was a binary
2076 expression itself (used for -Wparentheses). */
2078 /* Tree code for the binary operation we are parsing. */
2080 /* Precedence of the binary operation we are parsing. */
2082 /* Location of the binary operation we are parsing. */
2083 location_t loc;
2084 /* Flags from the operator token. */
2086 };
2088 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
2089 entries because precedence levels on the stack are monotonically
2090 increasing. */
2094 /* Prototypes. */
2096 /* Constructors and destructors. */
2101 /* Class variables. */
2105 /* The operator-precedence table used by cp_parser_binary_expression.
2106 Transformed into an associative array (binops_by_token) by
2107 cp_parser_new. */
2142 };
2144 /* The same as binops, but initialized by cp_parser_new so that
2145 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
2146 for speed. */
2149 /* Constructors and destructors. */
2151 /* Construct a new context. The context below this one on the stack
2152 is given by NEXT. */
2156 {
2159 /* Allocate the storage. */
2161 {
2162 /* Pull the first entry from the free list. */
2166 }
2167 else
2170 /* No errors have occurred yet in this context. */
2172 /* If this is not the bottommost context, copy information that we
2173 need from the previous context. */
2175 {
2176 /* If, in the NEXT context, we are parsing an `x->' or `x.'
2177 expression, then we are parsing one in this context, too. */
2179 /* Thread the stack. */
2181 }
2184 }
2186 /* Managing the unparsed function queues. */
2188 #define unparsed_funs_with_default_args \
2189 parser->unparsed_queues->last ().funs_with_default_args
2190 #define unparsed_funs_with_definitions \
2191 parser->unparsed_queues->last ().funs_with_definitions
2192 #define unparsed_nsdmis \
2193 parser->unparsed_queues->last ().nsdmis
2194 #define unparsed_noexcepts \
2195 parser->unparsed_queues->last ().noexcepts
2196 #define unparsed_contracts \
2197 parser->unparsed_queues->last ().contracts
2199 static void
2201 {
2202 cp_unparsed_functions_entry e
2205 }
2207 static void
2209 {
2212 }
2214 /* Prototypes. */
2216 /* Routines to parse various constructs.
2218 Those that return `tree' will return the error_mark_node (rather
2219 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2220 Sometimes, they will return an ordinary node if error-recovery was
2221 attempted, even though a parse error occurred. So, to check
2222 whether or not a parse error occurred, you should always use
2223 cp_parser_error_occurred. If the construct is optional (indicated
2224 either by an `_opt' in the name of the function that does the
2225 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2226 the construct is not present. */
2228 /* Lexical conventions [gram.lex] */
2230 static tree finish_userdef_string_literal
2233 /* Basic concepts [gram.basic] */
2237 /* Expressions [gram.expr] */
2239 static cp_expr cp_parser_primary_expression
2241 static cp_expr cp_parser_id_expression
2243 static cp_expr cp_parser_unqualified_id
2245 static tree cp_parser_nested_name_specifier_opt
2247 static tree cp_parser_nested_name_specifier
2249 static tree cp_parser_qualifying_entity
2251 static cp_expr cp_parser_postfix_expression
2253 static tree cp_parser_postfix_open_square_expression
2255 static tree cp_parser_postfix_dot_deref_expression
2260 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2262 static void cp_parser_pseudo_destructor_name
2264 static cp_expr cp_parser_unary_expression
2266 static enum tree_code cp_parser_unary_operator
2268 static tree cp_parser_has_attribute_expression
2270 static tree cp_parser_new_expression
2274 static tree cp_parser_new_type_id
2282 static tree cp_parser_delete_expression
2284 static cp_expr cp_parser_cast_expression
2286 static cp_expr cp_parser_binary_expression
2288 static tree cp_parser_question_colon_clause
2291 static cp_expr cp_parser_assignment_expression
2293 static enum tree_code cp_parser_assignment_operator_opt
2295 static cp_expr cp_parser_expression
2297 static cp_expr cp_parser_constant_expression
2299 static cp_expr cp_parser_builtin_offsetof
2301 static cp_expr cp_parser_lambda_expression
2303 static void cp_parser_lambda_introducer
2305 static bool cp_parser_lambda_declarator_opt
2307 static void cp_parser_lambda_body
2310 /* Statements [gram.stmt.stmt] */
2312 static void cp_parser_statement
2314 static void cp_parser_label_for_labeled_statement
2316 static tree cp_parser_expression_statement
2318 static tree cp_parser_compound_statement
2320 static void cp_parser_statement_seq_opt
2322 static tree cp_parser_selection_statement
2324 static tree cp_parser_condition
2326 static tree cp_parser_iteration_statement
2328 static bool cp_parser_init_statement
2330 static tree cp_parser_for
2332 static tree cp_parser_c_for
2334 static tree cp_parser_range_for
2336 static void do_range_for_auto_deduction
2338 static tree cp_parser_perform_range_for_lookup
2340 static tree cp_parser_range_for_member_function
2342 static tree cp_parser_jump_statement
2344 static void cp_parser_declaration_statement
2347 static tree cp_parser_implicitly_scoped_statement
2349 static void cp_parser_already_scoped_statement
2352 /* State of module-declaration parsing. */
2353 enum module_parse
2354 {
2357 _MP_UNUSED,
2367 };
2369 static module_parse cp_parser_module_declaration
2371 static void cp_parser_import_declaration
2374 /* Declarations [gram.dcl.dcl] */
2376 static void cp_parser_declaration_seq_opt
2378 static void cp_parser_declaration
2380 static void cp_parser_toplevel_declaration
2382 static void cp_parser_block_declaration
2384 static void cp_parser_simple_declaration
2386 static void cp_parser_decl_specifier_seq
2388 static tree cp_parser_storage_class_specifier_opt
2390 static tree cp_parser_function_specifier_opt
2392 static tree cp_parser_type_specifier
2395 static tree cp_parser_simple_type_specifier
2397 static tree cp_parser_placeholder_type_specifier
2399 static tree cp_parser_type_name
2401 static tree cp_parser_nonclass_name
2403 static tree cp_parser_elaborated_type_specifier
2405 static tree cp_parser_enum_specifier
2407 static void cp_parser_enumerator_list
2409 static void cp_parser_enumerator_definition
2411 static tree cp_parser_namespace_name
2413 static void cp_parser_namespace_definition
2415 static void cp_parser_namespace_body
2417 static tree cp_parser_qualified_namespace_specifier
2419 static void cp_parser_namespace_alias_definition
2421 static bool cp_parser_using_declaration
2423 static void cp_parser_using_directive
2425 static void cp_parser_using_enum
2427 static tree cp_parser_alias_declaration
2429 static void cp_parser_asm_definition
2431 static void cp_parser_linkage_specification
2433 static void cp_parser_static_assert
2435 static tree cp_parser_decltype
2437 static tree cp_parser_decomposition_declaration
2440 /* Declarators [gram.dcl.decl] */
2442 static tree cp_parser_init_declarator
2452 static enum tree_code cp_parser_ptr_operator
2454 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2456 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2458 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2460 static tree cp_parser_tx_qualifier_opt
2462 static tree cp_parser_late_return_type_opt
2464 static tree cp_parser_declarator_id
2466 static tree cp_parser_type_id
2468 static tree cp_parser_template_type_arg
2471 static tree cp_parser_type_id_1
2473 static void cp_parser_type_specifier_seq
2475 static tree cp_parser_parameter_declaration_clause
2477 static tree cp_parser_parameter_declaration_list
2481 static tree cp_parser_default_argument
2483 static void cp_parser_function_body
2485 static tree cp_parser_initializer
2487 static cp_expr cp_parser_initializer_clause
2489 static cp_expr cp_parser_braced_list
2494 static void cp_parser_ctor_initializer_opt_and_function_body
2497 static tree cp_parser_late_parsing_omp_declare_simd
2500 static tree cp_parser_late_parsing_oacc_routine
2503 static tree synthesize_implicit_template_parm
2505 static tree finish_fully_implicit_template
2507 static void abort_fully_implicit_template
2510 /* Classes [gram.class] */
2512 static tree cp_parser_class_name
2514 static tree cp_parser_class_specifier
2516 static tree cp_parser_class_head
2518 static enum tag_types cp_parser_class_key
2520 static void cp_parser_type_parameter_key
2522 static void cp_parser_member_specification_opt
2524 static void cp_parser_member_declaration
2526 static tree cp_parser_pure_specifier
2528 static tree cp_parser_constant_initializer
2531 /* Derived classes [gram.class.derived] */
2533 static tree cp_parser_base_clause
2535 static tree cp_parser_base_specifier
2538 /* Special member functions [gram.special] */
2540 static tree cp_parser_conversion_function_id
2542 static tree cp_parser_conversion_type_id
2546 static void cp_parser_ctor_initializer_opt
2548 static void cp_parser_mem_initializer_list
2550 static tree cp_parser_mem_initializer
2552 static tree cp_parser_mem_initializer_id
2555 /* Overloading [gram.over] */
2557 static cp_expr cp_parser_operator_function_id
2559 static cp_expr cp_parser_operator
2562 /* Templates [gram.temp] */
2564 static void cp_parser_template_declaration
2566 static tree cp_parser_template_parameter_list
2568 static tree cp_parser_template_parameter
2570 static tree cp_parser_type_parameter
2572 static tree cp_parser_template_id
2574 static tree cp_parser_template_id_expr
2576 static tree cp_parser_template_name
2578 static tree cp_parser_template_argument_list
2580 static tree cp_parser_template_argument
2582 static void cp_parser_explicit_instantiation
2584 static void cp_parser_explicit_specialization
2587 /* Exception handling [gram.except] */
2589 static tree cp_parser_try_block
2591 static void cp_parser_function_try_block
2593 static void cp_parser_handler_seq
2595 static void cp_parser_handler
2597 static tree cp_parser_exception_declaration
2599 static tree cp_parser_throw_expression
2601 static tree cp_parser_exception_specification_opt
2603 static tree cp_parser_type_id_list
2605 static tree cp_parser_noexcept_specification_opt
2608 /* GNU Extensions */
2610 static tree cp_parser_asm_specification_opt
2612 static tree cp_parser_asm_operand_list
2614 static tree cp_parser_asm_clobber_list
2616 static tree cp_parser_asm_label_list
2618 static bool cp_next_tokens_can_be_attribute_p
2620 static bool cp_next_tokens_can_be_gnu_attribute_p
2622 static bool cp_next_tokens_can_be_std_attribute_p
2624 static bool cp_nth_tokens_can_be_std_attribute_p
2626 static bool cp_nth_tokens_can_be_gnu_attribute_p
2628 static bool cp_nth_tokens_can_be_attribute_p
2630 static tree cp_parser_attributes_opt
2632 static tree cp_parser_gnu_attributes_opt
2634 static tree cp_parser_gnu_attribute_list
2636 static tree cp_parser_std_attribute
2638 static tree cp_parser_std_attribute_spec
2640 static tree cp_parser_std_attribute_spec_seq
2642 static size_t cp_parser_skip_std_attribute_spec_seq
2644 static size_t cp_parser_skip_attributes_opt
2646 static bool cp_parser_extension_opt
2648 static void cp_parser_label_declaration
2651 /* Concept Extensions */
2653 static tree cp_parser_concept_definition
2655 static tree cp_parser_constraint_expression
2657 static tree cp_parser_requires_clause_opt
2659 static tree cp_parser_requires_expression
2661 static tree cp_parser_requirement_parameter_list
2663 static tree cp_parser_requirement_body
2665 static tree cp_parser_requirement_seq
2667 static tree cp_parser_requirement
2669 static tree cp_parser_simple_requirement
2671 static tree cp_parser_compound_requirement
2673 static tree cp_parser_type_requirement
2675 static tree cp_parser_nested_requirement
2678 /* Transactional Memory Extensions */
2680 static tree cp_parser_transaction
2682 static tree cp_parser_transaction_expression
2684 static void cp_parser_function_transaction
2686 static tree cp_parser_transaction_cancel
2689 /* Coroutine extensions. */
2691 static tree cp_parser_yield_expression
2694 /* Contracts */
2696 static void cp_parser_late_contract_condition
2700 pragma_external,
2701 pragma_member,
2702 pragma_objc_icode,
2703 pragma_stmt,
2704 pragma_compound
2705 };
2706 static bool cp_parser_pragma
2709 /* Objective-C++ Productions */
2711 static tree cp_parser_objc_message_receiver
2713 static tree cp_parser_objc_message_args
2715 static tree cp_parser_objc_message_expression
2717 static cp_expr cp_parser_objc_encode_expression
2719 static tree cp_parser_objc_defs_expression
2721 static tree cp_parser_objc_protocol_expression
2723 static tree cp_parser_objc_selector_expression
2725 static cp_expr cp_parser_objc_expression
2727 static bool cp_parser_objc_selector_p
2729 static tree cp_parser_objc_selector
2731 static tree cp_parser_objc_protocol_refs_opt
2733 static void cp_parser_objc_declaration
2735 static tree cp_parser_objc_statement
2737 static bool cp_parser_objc_valid_prefix_attributes
2739 static void cp_parser_objc_at_property_declaration
2741 static void cp_parser_objc_at_synthesize_declaration
2743 static void cp_parser_objc_at_dynamic_declaration
2745 static tree cp_parser_objc_struct_declaration
2748 /* Utility Routines */
2750 static cp_expr cp_parser_lookup_name
2752 static tree cp_parser_lookup_name_simple
2754 static tree cp_parser_maybe_treat_template_as_class
2756 static bool cp_parser_check_declarator_template_parameters
2758 static bool cp_parser_check_template_parameters
2760 static cp_expr cp_parser_simple_cast_expression
2762 static tree cp_parser_global_scope_opt
2764 static bool cp_parser_constructor_declarator_p
2766 static tree cp_parser_function_definition_from_specifiers_and_declarator
2768 static tree cp_parser_function_definition_after_declarator
2770 static bool cp_parser_template_declaration_after_export
2772 static void cp_parser_perform_template_parameter_access_checks
2774 static tree cp_parser_single_declaration
2776 static cp_expr cp_parser_functional_cast
2778 static tree cp_parser_save_member_function_body
2780 static tree cp_parser_save_nsdmi
2782 static tree cp_parser_enclosed_template_argument_list
2784 static void cp_parser_save_default_args
2786 static void cp_parser_late_parsing_for_member
2788 static tree cp_parser_late_parse_one_default_arg
2790 static void cp_parser_late_parsing_nsdmi
2792 static void cp_parser_late_parsing_default_args
2794 static tree cp_parser_sizeof_operand
2796 static cp_expr cp_parser_trait
2798 static bool cp_parser_declares_only_class_p
2800 static void cp_parser_set_storage_class
2802 static void cp_parser_set_decl_spec_type
2804 static void set_and_check_decl_spec_loc
2807 static bool cp_parser_friend_p
2809 static void cp_parser_required_error
2815 static bool cp_parser_token_starts_function_definition_p
2817 static bool cp_parser_next_token_starts_class_definition_p
2819 static bool cp_parser_next_token_ends_template_argument_p
2821 static bool cp_parser_nth_token_starts_template_argument_list_p
2823 static enum tag_types cp_parser_token_is_class_key
2825 static enum tag_types cp_parser_token_is_type_parameter_key
2828 static void cp_parser_check_class_key
2830 static void cp_parser_check_access_in_redeclaration
2832 static bool cp_parser_optional_template_keyword
2834 static void cp_parser_pre_parsed_nested_name_specifier
2836 static bool cp_parser_cache_group
2838 static tree cp_parser_cache_defarg
2840 static void cp_parser_parse_tentatively
2842 static void cp_parser_commit_to_tentative_parse
2844 static void cp_parser_commit_to_topmost_tentative_parse
2846 static void cp_parser_abort_tentative_parse
2848 static bool cp_parser_parse_definitely
2852 static bool cp_parser_uncommitted_to_tentative_parse_p
2854 static void cp_parser_error
2856 static void cp_parser_name_lookup_error
2858 static bool cp_parser_simulate_error
2860 static bool cp_parser_check_type_definition
2862 static void cp_parser_check_for_definition_in_return_type
2864 static void cp_parser_check_for_invalid_template_id
2866 static bool cp_parser_non_integral_constant_expression
2868 static void cp_parser_diagnose_invalid_type_name
2870 static bool cp_parser_parse_and_diagnose_invalid_type_name
2872 static int cp_parser_skip_to_closing_parenthesis
2874 static void cp_parser_skip_to_end_of_statement
2876 static void cp_parser_consume_semicolon_at_end_of_statement
2878 static void cp_parser_skip_to_end_of_block_or_statement
2880 static bool cp_parser_skip_to_closing_brace
2882 static bool cp_parser_skip_entire_template_parameter_list
2884 static void cp_parser_require_end_of_template_parameter_list
2886 static bool cp_parser_skip_to_end_of_template_parameter_list
2888 static void cp_parser_skip_to_pragma_eol
2890 static bool cp_parser_error_occurred
2892 static bool cp_parser_allow_gnu_extensions_p
2894 static bool cp_parser_is_pure_string_literal
2896 static bool cp_parser_is_string_literal
2898 static bool cp_parser_is_keyword
2900 static tree cp_parser_make_typename_type
2904 static bool cp_parser_compound_literal_p
2906 static bool cp_parser_array_designator_p
2908 static bool cp_parser_init_statement_p
2910 static bool cp_parser_skip_up_to_closing_square_bracket
2912 static bool cp_parser_skip_to_closing_square_bracket
2916 // -------------------------------------------------------------------------- //
2917 // Unevaluated Operand Guard
2918 //
2919 // Implementation of an RAII helper for unevaluated operand parsing.
2921 {
2924 }
2927 {
2930 }
2932 // -------------------------------------------------------------------------- //
2933 // Tentative Parsing
2935 /* Returns nonzero if we are parsing tentatively. */
2939 {
2941 }
2943 /* Returns nonzero if TOKEN is a string literal. */
2945 static bool
2947 {
2953 }
2955 /* Returns nonzero if TOKEN is a string literal
2956 of a user-defined string literal. */
2958 static bool
2960 {
2967 }
2969 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2971 static bool
2973 {
2975 }
2977 /* Helper function for cp_parser_error.
2978 Having peeked a token of kind TOK1_KIND that might signify
2979 a conflict marker, peek successor tokens to determine
2980 if we actually do have a conflict marker.
2981 Specifically, we consider a run of 7 '<', '=' or '>' characters
2982 at the start of a line as a conflict marker.
2983 These come through the lexer as three pairs and a single,
2984 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2985 If it returns true, *OUT_LOC is written to with the location/range
2986 of the marker. */
2988 static bool
2991 {
3002 /* It must be at the start of the line. */
3007 /* We have a conflict marker. Construct a location of the form:
3008 <<<<<<<
3009 ^~~~~~~
3010 with start == caret, finishing at the end of the marker. */
3015 }
3017 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
3018 RT_CLOSE_PAREN. */
3022 {
3024 {
3032 }
3033 }
3035 /* Attempt to convert TOKEN_DESC from a required_token to an
3036 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
3038 static enum cpp_ttype
3040 {
3042 {
3063 /* Use CPP_EOF as a "no completions possible" code. */
3065 }
3066 }
3069 /* Subroutine of cp_parser_error and cp_parser_required_error.
3071 Issue a diagnostic of the form
3072 FILE:LINE: MESSAGE before TOKEN
3073 where TOKEN is the next token in the input stream. MESSAGE
3074 (specified by the caller) is usually of the form "expected
3075 OTHER-TOKEN".
3077 This bypasses the check for tentative passing, and potentially
3078 adds material needed by cp_parser_required_error.
3080 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
3081 suggesting insertion of the missing token.
3083 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
3084 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
3085 location. */
3087 static void
3089 required_token missing_token_desc,
3090 location_t matching_location)
3091 {
3093 /* This diagnostic makes more sense if it is tagged to the line
3094 of the token we just peeked at. */
3098 {
3103 }
3105 /* If this is actually a conflict marker, report it as such. */
3109 {
3110 location_t loc;
3112 {
3115 /* Consume tokens until the end of the source line. */
3117 {
3131 }
3133 }
3134 }
3136 auto_diagnostic_group d;
3143 {
3144 /* Potentially supply a fix-it hint, suggesting to add the
3145 missing token immediately after the *previous* token.
3146 This may move the primary location within richloc. */
3150 prev_token_loc);
3152 /* If matching_location != UNKNOWN_LOCATION, highlight it.
3153 Attempt to consolidate diagnostics by printing it as a
3154 secondary range within the main diagnostic. */
3156 added_matching_location
3158 }
3160 /* If we were parsing a string-literal and there is an unknown name
3161 token right after, then check to see if that could also have been
3162 a literal string by checking the name against a list of known
3163 standard string literal constants defined in header files. If
3164 there is one, then add that as an hint to the error message. */
3165 name_hint h;
3169 {
3176 token_name,
3177 header_hint));
3178 }
3180 /* Actually emit the error. */
3182 /* Because c_parser_error does not understand
3183 CPP_KEYWORD, keywords are treated like
3184 identifiers. */
3189 {
3190 /* If we weren't able to consolidate matching_location, then
3191 print it as a secondary diagnostic. */
3196 }
3197 }
3199 /* If not parsing tentatively, issue a diagnostic of the form
3200 FILE:LINE: MESSAGE before TOKEN
3201 where TOKEN is the next token in the input stream. MESSAGE
3202 (specified by the caller) is usually of the form "expected
3203 OTHER-TOKEN". */
3205 static void
3207 {
3210 }
3212 /* Issue an error about name-lookup failing. NAME is the
3213 IDENTIFIER_NODE DECL is the result of
3214 the lookup (as returned from cp_parser_lookup_name). DESIRED is
3215 the thing that we hoped to find. */
3217 static void
3219 tree name,
3220 tree decl,
3221 name_lookup_error desired,
3222 location_t location)
3223 {
3224 /* If name lookup completely failed, tell the user that NAME was not
3225 declared. */
3227 {
3240 else
3242 }
3244 {
3246 {
3263 }
3264 }
3266 {
3268 {
3278 name);
3282 }
3283 }
3284 else
3285 {
3287 {
3300 }
3301 }
3302 }
3304 /* If we are parsing tentatively, remember that an error has occurred
3305 during this tentative parse. Returns true if the error was
3306 simulated; false if a message should be issued by the caller. */
3308 static bool
3310 {
3312 {
3315 }
3317 }
3319 /* This function is called when a type is defined. If type
3320 definitions are forbidden at this point, an error message is
3321 issued. */
3323 static bool
3325 {
3326 /* If types are forbidden here, issue a message. */
3328 {
3329 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3330 or %qs in the message need to be interpreted. */
3334 }
3336 }
3338 /* This function is called when the DECLARATOR is processed. The TYPE
3339 was a type defined in the decl-specifiers. If it is invalid to
3340 define a type in the decl-specifiers for DECLARATOR, an error is
3341 issued. TYPE_LOCATION is the location of TYPE and is used
3342 for error reporting. */
3344 static void
3347 {
3348 /* [dcl.fct] forbids type definitions in return types.
3349 Unfortunately, it's not easy to know whether or not we are
3350 processing a return type until after the fact. */
3358 {
3363 type);
3364 }
3365 }
3367 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3368 "<" in any valid C++ program. If the next token is indeed "<",
3369 issue a message warning the user about what appears to be an
3370 invalid attempt to form a template-id. LOCATION is the location
3371 of the type-specifier (TYPE) */
3373 static void
3375 tree type,
3377 location_t location)
3378 {
3382 {
3388 {
3391 else
3393 }
3394 else
3396 /* Remember the location of the invalid "<". */
3399 /* Consume the "<". */
3401 /* Parse the template arguments. */
3403 /* Permanently remove the invalid template arguments so that
3404 this error message is not issued again. */
3407 }
3408 }
3410 /* If parsing an integral constant-expression, issue an error message
3411 about the fact that THING appeared and return true. Otherwise,
3412 return false. In either case, set
3413 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3415 static bool
3417 non_integral_constant thing)
3418 {
3421 {
3423 {
3426 {
3429 "ISO C++ forbids using a floating-point literal "
3434 "enumeration type cannot appear in a "
3525 }
3529 }
3530 }
3532 }
3534 /* Emit a diagnostic for an invalid type name. This function commits
3535 to the current active tentative parse, if any. (Otherwise, the
3536 problematic construct might be encountered again later, resulting
3537 in duplicate error messages.) LOCATION is the location of ID. */
3539 static void
3541 location_t location)
3542 {
3545 /* Try to lookup the identifier. */
3552 /* If the lookup was ambiguous, an error will already have
3553 been issued. */
3555 /* If the lookup found a template-name, it means that the user forgot
3556 to specify an argument list. Emit a useful error message. */
3558 {
3559 auto_diagnostic_group d;
3562 decl);
3567 }
3571 /* Something like 'unsigned A a;' */
3574 {
3575 /* Issue an error message. */
3576 auto_diagnostic_group d;
3577 name_hint hint;
3581 {
3587 }
3588 else
3590 /* If we're in a template class, it's possible that the user was
3591 referring to a type from a base class. For example:
3593 template <typename T> struct A { typedef T X; };
3594 template <typename T> struct B : public A<T> { X x; };
3596 The user should have said "typename A<T>::X". */
3605 {
3608 id);
3611 id);
3612 else
3615 }
3632 {
3635 {
3639 {
3640 /* Go from a particular instantiation of the
3641 template (which will have an empty TYPE_FIELDs),
3642 to the main version. */
3648 {
3653 }
3654 }
3655 }
3656 found:;
3657 }
3658 }
3659 /* Here we diagnose qualified-ids where the scope is actually correct,
3660 but the identifier does not resolve to a valid type name. */
3662 {
3664 {
3665 auto_diagnostic_group d;
3666 name_hint hint;
3675 {
3678 "%qE in namespace %qE does not name a template"
3681 else
3685 }
3687 {
3690 "%qE in namespace %qE does not name a template"
3693 else
3695 "%qE in namespace %qE does not name a template"
3698 }
3699 else
3700 {
3703 "%qE in namespace %qE does not name a type"
3706 else
3710 }
3713 }
3716 {
3717 /* A<T>::A<T>() */
3718 auto_diagnostic_group d;
3724 }
3727 {
3732 "need %<typename%> before %<%T::%D::%E%> because "
3736 id,
3739 else
3743 }
3745 {
3746 auto_diagnostic_group d;
3758 else
3764 }
3765 else
3767 }
3768 }
3770 /* Check for a common situation where a type-name should be present,
3771 but is not, and issue a sensible error message. Returns true if an
3772 invalid type-name was detected.
3774 The situation handled by this function are variable declarations of the
3775 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3776 Usually, `ID' should name a type, but if we got here it means that it
3777 does not. We try to emit the best possible error message depending on
3778 how exactly the id-expression looks like. */
3780 static bool
3782 {
3783 tree id;
3786 /* Avoid duplicate error about ambiguous lookup. */
3788 {
3792 }
3801 /* If the next token is a (, this is a function with no explicit return
3802 type, i.e. constructor, destructor or conversion op. */
3805 {
3808 }
3812 /* Emit a diagnostic for the invalid type. */
3814 out:
3815 /* If we aren't in the middle of a declarator (i.e. in a
3816 parameter-declaration-clause), skip to the end of the declaration;
3817 there's no point in trying to process it. */
3821 }
3823 /* Consume tokens up to, and including, the next non-nested closing `)'.
3824 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3825 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3826 found an unnested token of that type. */
3828 static int
3831 cpp_ttype or_ttype,
3833 {
3844 {
3847 /* Have we found what we're looking for before the closing paren? */
3853 {
3857 /* FALLTHRU */
3859 /* If we've run out of tokens, then there is no closing `)'. */
3862 /* This is good for lambda expression capture-lists. */
3872 /* This matches the processing in skip_to_end_of_statement. */
3892 {
3896 }
3906 condop_depth--;
3912 /* FALLTHROUGH */
3915 /* We fell into a pragma. Skip it, and continue. */
3921 }
3923 /* Consume the token. */
3925 }
3926 }
3928 /* Consume tokens up to, and including, the next non-nested closing `)'.
3929 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3930 are doing error recovery. Returns -1 if OR_COMMA is true and we
3931 found an unnested token of that type. */
3933 static int
3938 {
3942 }
3944 /* Consume tokens until we reach the end of the current statement.
3945 Normally, that will be just before consuming a `;'. However, if a
3946 non-nested `}' comes first, then we stop before consuming that. */
3948 static void
3950 {
3953 /* Unwind generic function template scope if necessary. */
3958 {
3962 {
3966 /* FALLTHRU */
3968 /* If we've run out of tokens, stop. */
3972 /* If the next token is a `;', we have reached the end of the
3973 statement. */
3979 /* If this is a non-nested '}', stop before consuming it.
3980 That way, when confronted with something like:
3982 { 3 + }
3984 we stop before consuming the closing '}', even though we
3985 have not yet reached a `;'. */
3989 /* If it is the closing '}' for a block that we have
3990 scanned, stop -- but only after consuming the token.
3991 That way given:
3993 void f g () { ... }
3994 typedef int I;
3996 we will stop after the body of the erroneously declared
3997 function, but before consuming the following `typedef'
3998 declaration. */
4000 {
4003 }
4013 /* FALLTHROUGH */
4016 /* We fell into a pragma. Skip it, and continue or return. */
4024 }
4026 /* Consume the token. */
4028 }
4029 }
4031 /* This function is called at the end of a statement or declaration.
4032 If the next token is a semicolon, it is consumed; otherwise, error
4033 recovery is attempted. */
4035 static void
4037 {
4038 /* Look for the trailing `;'. */
4040 {
4041 /* If there is additional (erroneous) input, skip to the end of
4042 the statement. */
4044 /* If the next token is now a `;', consume it. */
4047 }
4048 }
4050 /* Skip tokens until we have consumed an entire block, or until we
4051 have consumed a non-nested `;'. */
4053 static void
4055 {
4058 /* Unwind generic function template scope if necessary. */
4063 {
4067 {
4071 /* FALLTHRU */
4073 /* If we've run out of tokens, stop. */
4077 /* Stop if this is an unnested ';'. */
4083 /* Stop if this is an unnested '}', or closes the outermost
4084 nesting level. */
4085 nesting_depth--;
4093 /* Nest. */
4094 nesting_depth++;
4100 /* FALLTHROUGH */
4103 /* Skip it, and continue or return. */
4111 }
4113 /* Consume the token. */
4115 }
4116 }
4118 /* Skip tokens until a non-nested closing curly brace is the next
4119 token, or there are no more tokens. Return true in the first case,
4120 false otherwise. */
4122 static bool
4124 {
4128 {
4132 {
4136 /* FALLTHRU */
4138 /* If we've run out of tokens, stop. */
4142 /* If the next token is a non-nested `}', then we have reached
4143 the end of the current block. */
4149 /* If it the next token is a `{', then we are entering a new
4150 block. Consume the entire block. */
4156 }
4158 /* Consume the token. */
4160 }
4161 }
4163 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
4164 parameter is the PRAGMA token, allowing us to purge the entire pragma
4165 sequence. PRAGMA_TOK can be NULL, if we're speculatively scanning
4166 forwards (not error recovery). */
4168 static void
4170 {
4173 do
4174 {
4175 /* The preprocessor makes sure that a PRAGMA_EOL token appears
4176 before an EOF token, even when the EOF is on the pragma line.
4177 We should never get here without being inside a deferred
4178 pragma. */
4181 }
4185 {
4189 {
4191 /* Put the current source position back where it was before this
4192 lexer was pushed. */
4194 }
4195 }
4196 }
4198 /* Require pragma end of line, resyncing with it as necessary. The
4199 arguments are as for cp_parser_skip_to_pragma_eol. */
4201 static void
4203 {
4209 {
4211 /* Put the current source position back where it was before this
4212 lexer was pushed. */
4214 }
4215 }
4217 /* This is a simple wrapper around make_typename_type. When the id is
4218 an unresolved identifier node, we can provide a superior diagnostic
4219 using cp_parser_diagnose_invalid_type_name. */
4221 static tree
4223 location_t id_location)
4224 {
4225 tree result;
4227 {
4233 }
4235 }
4237 /* This is a wrapper around the
4238 make_{pointer,ptrmem,reference}_declarator functions that decides
4239 which one to call based on the CODE and CLASS_TYPE arguments. The
4240 CODE argument should be one of the values returned by
4241 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
4242 appertain to the pointer or reference. */
4246 cp_cv_quals cv_qualifiers,
4248 tree attributes)
4249 {
4256 else
4266 }
4268 /* Create a new C++ parser. */
4272 {
4273 /* Initialize the binops_by_token so that we can get the tree
4274 directly from the token. */
4282 /* For now, we always accept GNU extensions. */
4285 /* The `>' token is a greater-than operator, not the end of a
4286 template-id. */
4291 /* We are not parsing a constant-expression. */
4296 /* Local variable names are not forbidden. */
4299 /* We are not processing an `extern "C"' declaration. */
4302 /* We are not processing a declarator. */
4305 /* We are not processing a template-argument-list. */
4308 /* We are not in an iteration statement. */
4311 /* We are not in a switch statement. */
4314 /* We are not parsing a type-id inside an expression. */
4317 /* String literals should be translated to the execution character set. */
4320 /* We are not parsing a function body. */
4323 /* We can correct until told otherwise. */
4326 /* The unparsed function queue is empty. */
4329 /* There are no classes being defined. */
4332 /* No template parameters apply. */
4335 /* Special parsing data structures. */
4339 /* Not declaring an implicit function template. */
4345 /* Allow constrained-type-specifiers. */
4348 /* We haven't yet seen an 'extern "C"'. */
4352 }
4354 /* Create a cp_lexer structure which will emit the tokens in CACHE
4355 and push it onto the parser's lexer stack. This is used for delayed
4356 parsing of in-class method bodies and default arguments, and should
4357 not be confused with tentative parsing. */
4358 static void
4360 {
4365 /* Move the current source position to that of the first token in the
4366 new lexer. */
4368 }
4370 /* Pop the top lexer off the parser stack. This is never used for the
4371 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4372 static void
4374 {
4379 /* Put the current source position back where it was before this
4380 lexer was pushed. */
4382 }
4384 /* Lexical conventions [gram.lex] */
4386 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4387 identifier. */
4389 static cp_expr
4391 {
4394 /* Look for the identifier. */
4396 /* Return the value. */
4399 else
4401 }
4403 /* Worker for cp_parser_string_literal and cp_parser_userdef_string_literal.
4404 Do not call this directly; use either of the above.
4406 Parse a sequence of adjacent string constants. Return a
4407 TREE_STRING representing the combined, nul-terminated string
4408 constant. If TRANSLATE is true, translate the string to the
4409 execution character set. If WIDE_OK is true, a wide string is
4410 valid here. If UDL_OK is true, a string literal with user-defined
4411 suffix can be used in this context.
4413 C++98 [lex.string] says that if a narrow string literal token is
4414 adjacent to a wide string literal token, the behavior is undefined.
4415 However, C99 6.4.5p4 says that this results in a wide string literal.
4416 We follow C99 here, for consistency with the C front end.
4418 This code is largely lifted from lex_string() in c-lex.cc.
4420 FUTURE: ObjC++ will need to handle @-strings here. */
4422 static cp_expr
4426 {
4427 tree value;
4435 tree string_tree;
4441 {
4444 }
4449 {
4451 {
4455 }
4459 }
4460 else
4461 {
4464 }
4467 /* Try to avoid the overhead of creating and destroying an obstack
4468 for the common case of just one string. */
4471 {
4479 {
4483 }
4484 else
4488 }
4489 else
4490 {
4496 do
4497 {
4499 count++;
4504 {
4507 {
4510 }
4513 {
4518 }
4520 }
4521 else
4525 {
4529 {
4533 "concatenation of string literals with "
4535 }
4536 }
4545 {
4547 {
4551 }
4555 }
4556 else
4557 {
4561 }
4562 }
4565 /* A string literal built by concatenation has its caret=start at
4566 the start of the initial string, and its finish at the finish of
4567 the final string literal. */
4571 }
4574 {
4577 }
4581 {
4585 {
4589 }
4592 {
4600 else
4612 }
4617 {
4622 else
4624 }
4625 }
4626 else
4627 /* cpp_interpret_string has issued an error. */
4631 {
4634 }
4637 }
4639 /* Parse a sequence of adjacent string constants. Return a TREE_STRING
4640 representing the combined, nul-terminated string constant. If
4641 TRANSLATE is true, translate the string to the execution character set.
4642 If WIDE_OK is true, a wide string is valid here.
4644 This function issues an error if a user defined string literal is
4645 encountered; use cp_parser_userdef_string_literal if UDLs are allowed. */
4649 {
4653 }
4655 /* Parse a string literal or user defined string literal.
4657 user-defined-string-literal :
4658 string-literal ud-suffix
4660 If LOOKUP_UDLIT, perform a lookup for a suitable template function. */
4664 {
4667 lookup_udlit);
4668 }
4670 /* Look up a literal operator with the name and the exact arguments. */
4672 static tree
4674 {
4680 {
4684 {
4691 {
4701 }
4705 /* May be this should be sufficient_parms_p instead,
4706 depending on how exactly should user-defined literals
4707 work in presence of default arguments on the literal
4708 operator parameters. */
4711 }
4712 }
4715 }
4717 /* Parse a user-defined char constant. Returns a call to a user-defined
4718 literal operator taking the character as an argument. */
4720 static cp_expr
4722 {
4730 /* Build up a call to the user-defined operator */
4731 /* Lookup the name we got back from the id-expression. */
4732 releasing_vec args;
4736 {
4740 }
4743 }
4745 /* A subroutine of cp_parser_userdef_numeric_literal to
4746 create a char... template parameter pack from a string node. */
4748 static tree
4750 {
4751 tree charvec;
4758 /* Fill in CHARVEC with all of the parameters. */
4761 {
4770 }
4772 /* Build the argument packs. */
4778 }
4780 /* A subroutine of cp_parser_userdef_numeric_literal to
4781 create a char... template parameter pack from a string node. */
4783 static tree
4785 {
4786 tree charvec;
4797 /* First template parm is character type. */
4800 /* Fill in CHARVEC with all of the parameters. */
4807 /* Build the argument packs. */
4813 }
4815 /* Parse a user-defined numeric constant. returns a call to a user-defined
4816 literal operator. */
4818 static cp_expr
4820 {
4830 /* Look for a literal operator taking the exact type of numeric argument
4831 as the literal value. */
4832 releasing_vec args;
4836 {
4838 tf_warning_or_error);
4841 {
4844 long_long_unsigned_type_node);
4845 }
4846 else
4847 {
4851 long_double_type_node);
4855 }
4858 }
4860 /* If the numeric argument didn't work, look for a raw literal
4861 operator taking a const char* argument consisting of the number
4862 in string format. */
4867 {
4869 tf_warning_or_error);
4871 }
4873 /* If the raw literal didn't work, look for a non-type template
4874 function with parameter pack char.... Call the function with
4875 template parameter characters representing the number. */
4879 {
4882 {
4884 num_string);
4886 }
4889 tf_warning_or_error);
4891 }
4893 /* In C++14 the standard library defines complex number suffixes that
4894 conflict with GNU extensions. Prefer them if <complex> is #included. */
4904 {
4908 {
4909 /* No <complex>, so pedwarn and use GNU semantics. */
4912 }
4913 }
4915 bool complained
4922 {
4924 "(from %<<complex>%>) to enable the C++14 user-defined literal "
4929 }
4936 else
4937 {
4938 /* Use the built-in semantics. */
4939 tree type;
4941 {
4944 else
4946 }
4954 }
4957 /* Avoid repeated diagnostics. */
4960 }
4962 /* Parse a user-defined string constant. Returns a call to a user-defined
4963 literal operator taking a character pointer and the length of the string
4964 as arguments. */
4966 static tree
4968 {
4974 tree decl;
4976 /* Build up a call to the user-defined operator. */
4977 /* Lookup the name we got back from the id-expression. */
4978 releasing_vec args;
4985 tf_warning_or_error);
4987 /* Look for a suitable template function, either (C++20) with a single
4988 parameter of class type, or (N3599) with typename parameter CharT and
4989 parameter pack CharT... */
4993 {
4994 /* Use resolve_nondeduced_context to try to choose one form of template
4995 or the other. */
5002 else
5003 {
5008 }
5012 tf_warning_or_error);
5013 }
5018 }
5021 /* Basic concepts [gram.basic] */
5023 /* Parse a translation-unit.
5025 translation-unit:
5026 declaration-seq [opt] */
5028 static void
5030 {
5033 /* Create the declarator obstack. */
5035 /* Create the error declarator. */
5037 /* Create the empty parameter list. */
5039 UNKNOWN_LOCATION);
5040 /* Remember where the base of the declarator obstack lies. */
5052 /* Parse until EOF. */
5054 {
5057 /* If we're entering or exiting a region that's implicitly
5058 extern "C", modify the lang context appropriately. This is
5059 so horrible. Please die. */
5062 {
5066 else
5068 }
5074 {
5075 /* Top-level module declarations are ok, and change the
5076 portion of file we're in. Top-level import declarations
5077 are significant for the import portions. */
5082 {
5085 }
5087 {
5088 mp_state
5091 }
5093 {
5098 }
5099 else
5103 {
5106 {
5109 "global module fragment contents must be"
5111 }
5112 }
5113 }
5115 /* This relies on the ordering of module_parse values. */
5117 /* We're no longer in the import portion of a named module. */
5123 {
5126 /* If the next token is now a `;', consume it. */
5129 }
5130 else
5132 }
5134 /* Get rid of the token array; we don't need it any more. */
5138 /* The EOF should have reset this. */
5141 /* Make sure the declarator obstack was fully cleaned up. */
5144 }
5146 /* Return the appropriate tsubst flags for parsing, possibly in N3276
5147 decltype context. */
5151 {
5156 }
5158 /* We're about to parse a collection of statements. If we're currently
5159 parsing tentatively, set up a firewall so that any nested
5160 cp_parser_commit_to_tentative_parse won't affect the current context. */
5162 static cp_token_position
5164 {
5171 }
5173 /* We've finished parsing the collection of statements. Wrap up the
5174 firewall and replace the relevant tokens with the parsed form. */
5176 static void
5178 tree expr)
5179 {
5183 /* Finish the firewall level. */
5185 /* And remember the result of the parse for when we try again. */
5191 }
5193 /* Like the above functions, but let the user modify the tokens. Used by
5194 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
5195 later parses, so it makes sense to localize the effects of
5196 cp_parser_commit_to_tentative_parse. */
5198 struct tentative_firewall
5199 {
5204 {
5205 /* If we're currently parsing tentatively, start a committed level as a
5206 firewall and then an inner tentative parse. */
5208 {
5212 }
5213 }
5216 {
5218 {
5219 /* Finish the inner tentative parse and the firewall, propagating any
5220 uncommitted error state to the outer tentative parse. */
5226 }
5227 }
5228 };
5230 /* Some tokens naturally come in pairs e.g.'(' and ')'.
5231 This class is for tracking such a matching pair of symbols.
5232 In particular, it tracks the location of the first token,
5233 so that if the second token is missing, we can highlight the
5234 location of the first token when notifying the user about the
5235 problem. */
5238 class token_pair
5239 {
5241 /* token_pair's ctor. */
5244 /* If the next token is the opening symbol for this pair, consume it and
5245 return true.
5246 Otherwise, issue an error and return false.
5247 In either case, record the location of the opening token. */
5250 {
5254 }
5256 /* Consume the next token from PARSER, recording its location as
5257 that of the opening token within the pair. */
5260 {
5265 }
5267 /* If the next token is the closing symbol for this pair, consume it
5268 and return it.
5269 Otherwise, issue an error, highlighting the location of the
5270 corresponding opening token, and return NULL. */
5273 {
5276 m_open_loc);
5277 }
5282 location_t m_open_loc;
5283 };
5285 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
5287 struct matching_paren_traits
5288 {
5293 };
5295 /* "matching_parens" is a token_pair<T> class for tracking matching
5296 pairs of parentheses. */
5300 /* Traits for token_pair<T> for tracking matching pairs of braces. */
5302 struct matching_brace_traits
5303 {
5308 };
5310 /* "matching_braces" is a token_pair<T> class for tracking matching
5311 pairs of braces. */
5316 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
5317 enclosing parentheses. */
5319 static cp_expr
5321 {
5324 /* Consume the '('. */
5326 matching_parens parens;
5328 /* Start the statement-expression. */
5330 /* Parse the compound-statement. */
5332 /* Finish up. */
5334 /* Consume the ')'. */
5342 }
5344 /* Expressions [gram.expr] */
5346 /* Parse a fold-operator.
5348 fold-operator:
5349 - * / % ^ & | = < > << >>
5350 = -= *= /= %= ^= &= |= <<= >>=
5351 == != <= >= && || , .* ->*
5353 This returns the tree code corresponding to the matched operator
5354 as an int. When the current token matches a compound assignment
5355 operator, the resulting tree code is the negative value of the
5356 non-assignment operator. */
5358 static int
5360 {
5362 {
5402 }
5403 }
5405 /* Returns true if CODE indicates a binary expression, which is not allowed in
5406 the LHS of a fold-expression. More codes will need to be added to use this
5407 function in other contexts. */
5409 static bool
5411 {
5413 {
5446 }
5447 }
5449 /* If the next token is a suitable fold operator, consume it and return as
5450 the function above. */
5452 static int
5454 {
5460 }
5462 /* Parse a fold-expression.
5464 fold-expression:
5465 ( ... folding-operator cast-expression)
5466 ( cast-expression folding-operator ... )
5467 ( cast-expression folding operator ... folding-operator cast-expression)
5469 Note that the '(' and ')' are matched in primary expression. */
5471 static cp_expr
5473 {
5474 cp_id_kind pidk;
5476 // Left fold.
5478 {
5484 {
5487 }
5494 }
5499 {
5502 }
5505 {
5508 }
5511 /* The operands of a fold-expression are cast-expressions, so binary or
5512 conditional expressions are not allowed. We check this here to avoid
5513 tentative parsing. */
5525 // Right fold.
5530 {
5533 }
5536 // Binary left or right fold.
5541 }
5543 /* Parse a primary-expression.
5545 primary-expression:
5546 literal
5547 this
5548 ( expression )
5549 id-expression
5550 lambda-expression (C++11)
5552 GNU Extensions:
5554 primary-expression:
5555 ( compound-statement )
5556 __builtin_va_arg ( assignment-expression , type-id )
5557 __builtin_offsetof ( type-id , offsetof-expression )
5559 C++ Extensions:
5560 __has_nothrow_assign ( type-id )
5561 __has_nothrow_constructor ( type-id )
5562 __has_nothrow_copy ( type-id )
5563 __has_trivial_assign ( type-id )
5564 __has_trivial_constructor ( type-id )
5565 __has_trivial_copy ( type-id )
5566 __has_trivial_destructor ( type-id )
5567 __has_virtual_destructor ( type-id )
5568 __is_abstract ( type-id )
5569 __is_base_of ( type-id , type-id )
5570 __is_class ( type-id )
5571 __is_empty ( type-id )
5572 __is_enum ( type-id )
5573 __is_final ( type-id )
5574 __is_literal_type ( type-id )
5575 __is_pod ( type-id )
5576 __is_polymorphic ( type-id )
5577 __is_std_layout ( type-id )
5578 __is_trivial ( type-id )
5579 __is_union ( type-id )
5581 Objective-C++ Extension:
5583 primary-expression:
5584 objc-expression
5586 literal:
5587 __null
5589 ADDRESS_P is true iff this expression was immediately preceded by
5590 "&" and therefore might denote a pointer-to-member. CAST_P is true
5591 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5592 true iff this expression is a template argument.
5594 Returns a representation of the expression. Upon return, *IDK
5595 indicates what kind of id-expression (if any) was present. */
5597 static cp_expr
5604 {
5607 /* Assume the primary expression is not an id-expression. */
5610 /* Peek at the next token. */
5613 {
5614 /* literal:
5615 integer-literal
5616 character-literal
5617 floating-literal
5618 string-literal
5619 boolean-literal
5620 pointer-literal
5621 user-defined-literal */
5633 {
5637 }
5638 /* Floating-point literals are only allowed in an integral
5639 constant expression if they are cast to an integral or
5640 enumeration type. */
5646 {
5647 /* CAST_P will be set even in invalid code like "int(2.7 +
5648 ...)". Therefore, we have to check that the next token
5649 is sure to end the cast. */
5651 {
5656 enumerator-definition. */
5658 /* The curly brace at the end of an enum-specifier. */
5660 /* The end of a statement. */
5662 /* The end of the cast-expression. */
5664 /* The end of an array bound. */
5666 /* The closing ">" in a template-argument-list. */
5669 /* C++0x only: A ">>" treated like two ">" tokens,
5670 in a template-argument-list. */
5675 }
5677 /* If we are within a cast, then the constraint that the
5678 cast is to an integral or enumeration type will be
5679 checked at that point. If we are not within a cast, then
5680 this code is invalid. */
5683 }
5704 /* ??? Should wide strings be allowed when parser->translate_strings_p
5705 is false (i.e. in attributes)? If not, we can kill the third
5706 argument to cp_parser_string_literal. */
5711 else
5718 /* If we see `( { ' then we are looking at the beginning of
5719 a GNU statement-expression. */
5722 {
5723 /* Statement-expressions are not allowed by the standard. */
5727 /* And they're not allowed outside of a function-body; you
5728 cannot, for example, write:
5730 int i = ({ int j = 3; j + 1; });
5732 at class or namespace scope. */
5735 {
5737 "statement-expressions are not allowed outside "
5743 }
5744 else
5746 }
5747 /* Otherwise it's a normal parenthesized expression. */
5748 {
5749 cp_expr expr;
5754 /* Consume the `('. */
5755 matching_parens parens;
5757 /* Within a parenthesized expression, a `>' token is always
5758 the greater-than operator. */
5759 saved_greater_than_is_operator_p
5764 /* Left fold expression. */
5766 else
5767 /* Parse the parenthesized expression. */
5772 {
5777 "fold-expressions only available with %<-std=c++17%> "
5779 }
5780 else
5781 /* Let the front end know that this expression was
5782 enclosed in parentheses. This matters in case, for
5783 example, the expression is of the form `A::B', since
5784 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5785 not. */
5788 /* DR 705: Wrapping an unqualified name in parentheses
5789 suppresses arg-dependent lookup. We want to pass back
5790 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5791 (c++/37862), but none of the others. */
5795 /* The `>' token might be the end of a template-id or
5796 template-parameter-list now. */
5797 parser->greater_than_is_operator_p
5800 /* Consume the `)'. */
5812 }
5815 {
5817 {
5818 /* We might have an Objective-C++ message. */
5821 /* If that works out, we're done ... */
5824 /* ... else, fall though to see if it's a lambda. */
5825 }
5827 /* Don't warn about a failed tentative parse. */
5832 }
5836 /* We have an Objective-C++ string literal. */
5843 {
5844 /* These two are the boolean literals. */
5852 /* The `__null' literal. */
5857 /* The `nullptr' literal. */
5862 /* Recognize the `this' keyword. */
5866 {
5870 }
5871 /* Pointers cannot appear in constant-expressions. */
5876 /* The `operator' keyword can be the beginning of an
5877 id-expression. */
5884 {
5885 non_integral_constant name;
5887 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5888 __func__ are the names of variables -- but they are
5889 treated specially. Therefore, they are handled here,
5890 rather than relying on the generic id-expression logic
5891 below. Grammatically, these names are id-expressions.
5893 Consume the token. */
5897 {
5909 }
5914 /* Look up the name. */
5916 }
5919 {
5920 tree expression;
5921 tree type;
5922 location_t type_location;
5923 location_t start_loc
5925 /* The `__builtin_va_arg' construct is used to handle
5926 `va_arg'. Consume the `__builtin_va_arg' token. */
5928 /* Look for the opening `('. */
5929 matching_parens parens;
5931 /* Now, parse the assignment-expression. */
5933 /* Look for the `,'. */
5936 /* Parse the type-id. */
5937 {
5940 }
5941 /* Look for the closing `)'. */
5942 location_t finish_loc
5945 /* Using `va_arg' in a constant-expression is not
5946 allowed. */
5948 NIC_VA_ARG))
5950 /* Construct a location of the form:
5951 __builtin_va_arg (v, int)
5952 ~~~~~~~~~~~~~~~~~~~~~^~~~
5953 with the caret at the type, ranging from the start of the
5954 "__builtin_va_arg" token to the close paren. */
5955 location_t combined_loc
5958 }
5963 #define DEFTRAIT_EXPR(CODE, NAME, ARITY) \
5964 case RID_##CODE:
5966 #undef DEFTRAIT_EXPR
5969 // C++ concepts
5973 /* Objective-C++ expressions. */
5983 "%<omp_all_memory%> may only be used in OpenMP "
5991 {
5996 }
5997 /* FALLTHRU */
6001 }
6003 /* An id-expression can start with either an identifier, a
6004 `::' as the beginning of a qualified-id, or the "operator"
6005 keyword. */
6010 {
6011 id_expression:
6012 cp_expr id_expression;
6013 cp_expr decl;
6019 /* Parse the id-expression. */
6020 id_expression
6037 /* If we have a template-id, then no further lookup is
6038 required. If the template-id was for a template-class, we
6039 will sometimes have a TYPE_DECL at this point. */
6043 /* Look up the name. */
6044 else
6045 {
6046 tree ambiguous_decls;
6048 /* If we already know that this lookup is ambiguous, then
6049 we've already issued an error message; there's no reason
6050 to check again. */
6053 {
6056 }
6059 none_type,
6060 template_p,
6065 /* If the lookup was ambiguous, an error will already have
6066 been issued. */
6070 /* In Objective-C++, we may have an Objective-C 2.0
6071 dot-syntax for classes here. */
6076 {
6077 tree component;
6084 component);
6085 /* Build a location of the form:
6086 expr.component
6087 ~~~~~^~~~~~~~~
6088 with caret at the start of the component name (at
6089 input_location), ranging from the start of the id_expression
6090 to the end of the component name. */
6091 location_t combined_loc
6096 }
6098 /* In Objective-C++, an instance variable (ivar) may be preferred
6099 to whatever cp_parser_lookup_name() found.
6100 Call objc_lookup_ivar. To avoid exposing cp_expr to the
6101 rest of c-family, we have to do a little extra work to preserve
6102 any location information in cp_expr "decl". Given that
6103 objc_lookup_ivar is implemented in "c-family" and "objc", we
6104 have a trip through the pure "tree" type, rather than cp_expr.
6105 Naively copying it back to "decl" would implicitly give the
6106 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
6107 store an EXPR_LOCATION. Hence we only update "decl" (and
6108 hence its location_t) if we get back a different tree node. */
6110 id_expression);
6114 /* If name lookup gives us a SCOPE_REF, then the
6115 qualifying scope was dependent. */
6117 {
6118 /* At this point, we do not know if DECL is a valid
6119 integral constant expression. We assume that it is
6120 in fact such an expression, so that code like:
6122 template <int N> struct A {
6123 int a[B<N>::i];
6124 };
6126 is accepted. At template-instantiation time, we
6127 will check that B<N>::i is actually a constant. */
6129 }
6130 /* Check to see if DECL is a local variable in a context
6131 where that is forbidden. */
6134 /* DR 2082 permits local variables in unevaluated contexts
6135 within a default argument. */
6137 {
6145 }
6146 }
6148 decl = (finish_id_expression
6150 idk,
6155 template_arg_p,
6160 /* Build a location for an id-expression of the form:
6161 ::ns::id
6162 ~~~~~~^~
6163 or:
6164 id
6165 ^~
6166 i.e. from the start of the first token to the end of the final
6167 token, with the caret at the start of the unqualified-id. */
6171 location_t combined_loc
6176 }
6178 /* Anything else is an error. */
6182 }
6183 }
6191 {
6194 }
6196 /* Complain about missing template keyword when naming a dependent
6197 member template. */
6199 static void
6201 {
6208 "expected %qs keyword before dependent "
6211 }
6213 /* Parse an id-expression.
6215 id-expression:
6216 unqualified-id
6217 qualified-id
6219 qualified-id:
6220 :: [opt] nested-name-specifier template [opt] unqualified-id
6221 :: identifier
6222 :: operator-function-id
6223 :: template-id
6225 Return a representation of the unqualified portion of the
6226 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
6227 a `::' or nested-name-specifier.
6229 Often, if the id-expression was a qualified-id, the caller will
6230 want to make a SCOPE_REF to represent the qualified-id. This
6231 function does not do this in order to avoid wastefully creating
6232 SCOPE_REFs when they are not required.
6234 If TEMPLATE_KEYWORD_P is true, then we have just seen the
6235 `template' keyword.
6237 If CHECK_DEPENDENCY_P is false, then names are looked up inside
6238 uninstantiated templates.
6240 If *TEMPLATE_P is non-NULL, it is set to true iff the
6241 `template' keyword is used to explicitly indicate that the entity
6242 named is a template.
6244 If DECLARATOR_P is true, the id-expression is appearing as part of
6245 a declarator, rather than as part of an expression. */
6247 static cp_expr
6254 {
6258 /* Assume the `template' keyword was not used. */
6262 /* Look for the optional `::' operator. */
6263 global_scope_p
6264 = (!template_keyword_p
6269 /* Look for the optional nested-name-specifier. */
6270 nested_name_specifier_p
6273 check_dependency_p,
6275 declarator_p,
6276 template_keyword_p)
6282 /* Peek at the next token. */
6285 /* If there is a nested-name-specifier, then we are looking at
6286 the first qualified-id production. */
6288 {
6289 tree saved_object_scope;
6290 tree saved_qualifying_scope;
6292 /* See if the next token is the `template' keyword. */
6296 /* Name lookup we do during the processing of the
6297 unqualified-id might obliterate SCOPE. */
6300 /* Process the final unqualified-id. */
6302 check_dependency_p,
6303 declarator_p,
6305 /* Restore the SAVED_SCOPE for our caller. */
6309 }
6310 /* Otherwise, if we are in global scope, then we are looking at one
6311 of the other qualified-id productions. */
6313 {
6314 /* If it's an identifier, and the next token is not a "<", then
6315 we can avoid the template-id case. This is an optimization
6316 for this common case. */
6318 && !cp_parser_nth_token_starts_template_argument_list_p
6323 /* Try a template-id. */
6327 declarator_p);
6328 /* If that worked, we're done. */
6332 /* Peek at the next token. (Changes in the token buffer may
6333 have invalidated the pointer obtained above.) */
6337 {
6344 {
6347 }
6348 /* Fall through. */
6353 }
6354 }
6355 else
6356 {
6361 declarator_p,
6362 optional_p);
6363 }
6366 && warn_missing_template_keyword
6367 && !template_keyword_p
6368 /* Don't warn if we're looking inside templates. */
6369 && check_dependency_p
6370 /* In a template argument list a > could be closing
6371 the enclosing targs. */
6374 /* Don't confuse an ill-formed constructor declarator for a missing
6375 template keyword in a return type. */
6379 OPT_Wmissing_template_keyword))
6380 {
6383 /* An operator after the > suggests that the > ends a
6384 template-id; a name or literal suggests that the > is an
6385 operator. */
6389 }
6392 }
6394 /* Parse an unqualified-id.
6396 unqualified-id:
6397 identifier
6398 operator-function-id
6399 conversion-function-id
6400 ~ class-name
6401 template-id
6403 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
6404 keyword, in a construct like `A::template ...'.
6406 Returns a representation of unqualified-id. For the `identifier'
6407 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
6408 production a BIT_NOT_EXPR is returned; the operand of the
6409 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
6410 other productions, see the documentation accompanying the
6411 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
6412 names are looked up in uninstantiated templates. If DECLARATOR_P
6413 is true, the unqualified-id is appearing as part of a declarator,
6414 rather than as part of an expression. */
6416 static cp_expr
6422 {
6425 /* Peek at the next token. */
6429 {
6431 {
6432 tree id;
6434 /* We don't know yet whether or not this will be a
6435 template-id. */
6437 /* Try a template-id. */
6439 check_dependency_p,
6440 declarator_p);
6441 /* If it worked, we're done. */
6444 /* Otherwise, it's an ordinary identifier. */
6446 }
6450 check_dependency_p,
6451 declarator_p);
6454 {
6455 tree type_decl;
6456 tree qualifying_scope;
6457 tree object_scope;
6458 tree scope;
6462 /* Consume the `~' token. */
6464 /* Parse the class-name. The standard, as written, seems to
6465 say that:
6467 template <typename T> struct S { ~S (); };
6468 template <typename T> S<T>::~S() {}
6470 is invalid, since `~' must be followed by a class-name, but
6471 `S<T>' is dependent, and so not known to be a class.
6472 That's not right; we need to look in uninstantiated
6473 templates. A further complication arises from:
6475 template <typename T> void f(T t) {
6476 t.T::~T();
6477 }
6479 Here, it is not possible to look up `T' in the scope of `T'
6480 itself. We must look in both the current scope, and the
6481 scope of the containing complete expression.
6483 Yet another issue is:
6485 struct S {
6486 int S;
6487 ~S();
6488 };
6490 S::~S() {}
6492 The standard does not seem to say that the `S' in `~S'
6493 should refer to the type `S' and not the data member
6494 `S::S'. */
6496 /* DR 244 says that we look up the name after the "~" in the
6497 same scope as we looked up the qualifying name. That idea
6498 isn't fully worked out; it's more complicated than that. */
6503 /* Check for invalid scopes. */
6505 {
6509 }
6511 {
6515 scope);
6520 }
6522 {
6528 }
6534 /* Create a location with caret == start at the tilde,
6535 finishing at the end of the peeked token, e.g:
6536 ~token
6537 ^~~~~~. */
6538 location_t loc
6541 /* If the name is of the form "X::~X" it's OK even if X is a
6542 typedef. */
6551 {
6554 }
6556 /* ~auto means the destructor of whatever the object is. */
6558 {
6561 "%<~auto%> only available with "
6565 }
6567 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
6568 declarator-id of a constructor or destructor. */
6571 {
6575 }
6577 /* If there was an explicit qualification (S::~T), first look
6578 in the scope given by the qualification (i.e., S).
6580 Note: in the calls to cp_parser_class_name below we pass
6581 typename_type so that lookup finds the injected-class-name
6582 rather than the constructor. */
6586 {
6591 typename_type,
6594 declarator_p);
6597 }
6598 /* In "N::S::~S", look in "N" as well. */
6600 {
6605 type_decl
6609 typename_type,
6612 declarator_p);
6615 }
6616 /* In "p->S::~T", look in the scope given by "*p" as well. */
6618 {
6623 type_decl
6627 typename_type,
6630 declarator_p);
6633 }
6634 /* Look in the surrounding context. */
6636 {
6642 type_decl
6646 typename_type,
6649 declarator_p);
6652 {
6653 /* We couldn't find a type with this name. If we're parsing
6654 tentatively, fail and try something else. */
6656 {
6659 }
6660 /* Otherwise, accept it and check for a match at instantiation
6661 time. */
6666 }
6667 }
6668 /* If an error occurred, assume that the name of the
6669 destructor is the same as the name of the qualifying
6670 class. That allows us to keep parsing after running
6671 into ill-formed destructor names. */
6677 /* Check that destructor name and scope match. */
6679 {
6686 }
6688 /* [class.dtor]
6690 A typedef-name that names a class shall not be used as the
6691 identifier in the declarator for a destructor declaration. */
6698 type_decl);
6701 }
6705 {
6706 cp_expr id;
6708 /* This could be a template-id, so we try that first. */
6710 /* Try a template-id. */
6713 declarator_p);
6714 /* If that worked, we're done. */
6717 /* We still don't know whether we're looking at an
6718 operator-function-id or a conversion-function-id. */
6720 /* Try an operator-function-id. */
6722 /* If that didn't work, try a conversion-function-id. */
6727 }
6728 /* Fall through. */
6735 }
6736 }
6738 /* Check [temp.names]/5: A name prefixed by the keyword template shall
6739 be a template-id or the name shall refer to a class template or an
6740 alias template. */
6742 static void
6744 {
6754 /* Alias templates are also OK. */
6761 name);
6762 }
6764 /* Parse an (optional) nested-name-specifier.
6766 nested-name-specifier: [C++98]
6767 class-or-namespace-name :: nested-name-specifier [opt]
6768 class-or-namespace-name :: template nested-name-specifier [opt]
6770 nested-name-specifier: [C++0x]
6771 type-name ::
6772 namespace-name ::
6773 nested-name-specifier identifier ::
6774 nested-name-specifier template [opt] simple-template-id ::
6776 PARSER->SCOPE should be set appropriately before this function is
6777 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6778 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6779 in name lookups.
6781 Sets PARSER->SCOPE to the class (TYPE) or namespace
6782 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6783 it unchanged if there is no nested-name-specifier. Returns the new
6784 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6786 If CHECK_DEPENDENCY_P is FALSE, names are looked up in dependent scopes.
6788 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6789 part of a declaration and/or decl-specifier. */
6791 static tree
6798 {
6803 /* Remember where the nested-name-specifier starts. */
6806 {
6809 }
6812 {
6813 tree new_scope;
6814 tree old_scope;
6815 tree saved_qualifying_scope;
6817 /* Spot cases that cannot be the beginning of a
6818 nested-name-specifier. */
6821 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6822 the already parsed nested-name-specifier. */
6824 {
6825 /* Grab the nested-name-specifier and continue the loop. */
6827 /* If we originally encountered this nested-name-specifier
6828 with CHECK_DEPENDENCY_P set to true, we will not have
6829 resolved TYPENAME_TYPEs, so we must do so here. */
6831 && !check_dependency_p
6833 {
6838 }
6841 }
6843 /* Spot cases that cannot be the beginning of a
6844 nested-name-specifier. On the second and subsequent times
6845 through the loop, we look for the `template' keyword. */
6847 ;
6848 /* A template-id can start a nested-name-specifier. */
6850 ;
6851 /* DR 743: decltype can be used in a nested-name-specifier. */
6853 ;
6854 else
6855 {
6856 /* If the next token is not an identifier, then it is
6857 definitely not a type-name or namespace-name. */
6860 /* If the following token is neither a `<' (to begin a
6861 template-id), nor a `::', then we are not looking at a
6862 nested-name-specifier. */
6868 /* name:name is a valid sequence in an Objective C message. */
6870 {
6874 "found %<:%> in nested-name-specifier, "
6877 }
6880 && !cp_parser_nth_token_starts_template_argument_list_p
6883 }
6885 /* The nested-name-specifier is optional, so we parse
6886 tentatively. */
6889 /* Look for the optional `template' keyword, if this isn't the
6890 first time through the loop. */
6892 {
6894 /* DR1710: "In a qualified-id used as the name in
6895 a typename-specifier, elaborated-type-specifier, using-declaration,
6896 or class-or-decltype, an optional keyword template appearing at
6897 the top level is ignored." */
6899 && typename_keyword_p
6902 }
6904 /* Save the old scope since the name lookup we are about to do
6905 might destroy it. */
6908 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6909 look up names in "X<T>::I" in order to determine that "Y" is
6910 a template. So, if we have a typename at this point, we make
6911 an effort to look through it. */
6913 && !check_dependency_p
6914 && !typename_keyword_p
6919 /* Parse the qualifying entity. */
6920 new_scope
6922 typename_keyword_p,
6923 template_keyword_p,
6924 check_dependency_p,
6925 type_p,
6926 is_declaration);
6927 /* Look for the `::' token. */
6930 /* If we found what we wanted, we keep going; otherwise, we're
6931 done. */
6933 {
6936 /* Restore the OLD_SCOPE since it was valid before the
6937 failed attempt at finding the last
6938 class-or-namespace-name. */
6942 /* If the next token is a decltype, and the one after that is a
6943 `::', then the decltype has failed to resolve to a class or
6944 enumeration type. Give this error even when parsing
6945 tentatively since it can't possibly be valid--and we're going
6946 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6947 won't get another chance.*/
6951 {
6957 dtype);
6960 /* As below. */
6963 }
6967 {
6968 /* If we have a non-type template-id followed by ::, it can't
6969 possibly be valid. */
6974 {
6977 {
6984 else
6987 }
6988 else
6989 {
6995 else
6996 {
6997 /* Variable template. */
7001 }
7002 }
7009 /* As below. */
7013 }
7014 }
7018 /* If the next token is an identifier, and the one after
7019 that is a `::', then any valid interpretation would have
7020 found a class-or-namespace-name. */
7026 {
7029 {
7031 {
7032 tree decl;
7033 tree ambiguous_decls;
7036 none_type,
7045 decl);
7047 {
7048 // cp_parser_lookup_name has the same diagnostic,
7049 // thus make sure to emit it at most once.
7052 {
7057 }
7059 }
7060 else
7061 {
7063 cp_parser_name_lookup_error
7066 else
7067 cp_parser_name_lookup_error
7070 }
7071 }
7074 /* Treat this as a successful nested-name-specifier
7075 due to:
7077 [basic.lookup.qual]
7079 If the name found is not a class-name (clause
7080 _class_) or namespace-name (_namespace.def_), the
7081 program is ill-formed. */
7083 }
7085 }
7087 }
7088 /* We've found one valid nested-name-specifier. */
7090 /* Name lookup always gives us a DECL. */
7093 /* Uses of "template" must be followed by actual templates. */
7096 /* If it is a class scope, try to complete it; we are about to
7097 be looking up names inside the class. */
7099 /* Since checking types for dependency can be expensive,
7100 avoid doing it if the type is already complete. */
7102 /* Do not try to complete dependent types. */
7104 {
7106 /* If it is a typedef to current class, use the current
7107 class instead, as the typedef won't have any names inside
7108 it yet. */
7112 }
7113 /* Make sure we look in the right scope the next time through
7114 the loop. */
7116 }
7118 /* If parsing tentatively, replace the sequence of tokens that makes
7119 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
7120 token. That way, should we re-parse the token stream, we will
7121 not have to repeat the effort required to do the parse, nor will
7122 we issue duplicate error messages. */
7124 {
7128 /* Reset the contents of the START token. */
7130 /* Retrieve any deferred checks. Do not pop this access checks yet
7131 so the memory will not be reclaimed during token replacing below. */
7140 /* Purge all subsequent tokens. */
7142 }
7148 }
7150 /* Parse a nested-name-specifier. See
7151 cp_parser_nested_name_specifier_opt for details. This function
7152 behaves identically, except that it will an issue an error if no
7153 nested-name-specifier is present. */
7155 static tree
7161 {
7162 tree scope;
7164 /* Look for the nested-name-specifier. */
7166 typename_keyword_p,
7167 check_dependency_p,
7168 type_p,
7169 is_declaration);
7170 /* If it was not present, issue an error message. */
7172 {
7175 }
7178 }
7180 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
7181 this is either a class-name or a namespace-name (which corresponds
7182 to the class-or-namespace-name production in the grammar). For
7183 C++0x, it can also be a type-name that refers to an enumeration
7184 type or a simple-template-id.
7186 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
7187 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
7188 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
7189 TYPE_P is TRUE iff the next name should be taken as a class-name,
7190 even the same name is declared to be another entity in the same
7191 scope.
7193 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
7194 specified by the class-or-namespace-name. If neither is found the
7195 ERROR_MARK_NODE is returned. */
7197 static tree
7204 {
7205 tree saved_scope;
7206 tree saved_qualifying_scope;
7207 tree saved_object_scope;
7208 tree scope;
7212 /* DR 743: decltype can appear in a nested-name-specifier. */
7214 {
7218 {
7221 }
7225 }
7227 /* Before we try to parse the class-name, we must save away the
7228 current PARSER->SCOPE since cp_parser_class_name will destroy
7229 it. */
7233 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
7234 there is no need to look for a namespace-name. */
7235 only_class_p = template_keyword_p
7240 typename_keyword_p,
7241 template_keyword_p,
7243 check_dependency_p,
7245 is_declaration,
7248 /* If that didn't work, try for a namespace-name. */
7250 {
7251 /* Restore the saved scope. */
7255 /* If we are not looking at an identifier followed by the scope
7256 resolution operator, then this is not part of a
7257 nested-name-specifier. (Note that this function is only used
7258 to parse the components of a nested-name-specifier.) */
7263 }
7266 }
7268 /* Return true if we are looking at a compound-literal, false otherwise. */
7270 static bool
7272 {
7275 /* Skip tokens until the next token is a closing parenthesis.
7276 If we find the closing `)', and the next token is a `{', then
7277 we are looking at a compound-literal. */
7278 bool compound_literal_p
7283 /* Roll back the tokens we skipped. */
7287 }
7289 /* Return true if EXPR is the integer constant zero or a complex constant
7290 of zero, without any folding, but ignoring location wrappers. */
7292 bool
7294 {
7297 }
7299 /* Parse a postfix-expression.
7301 postfix-expression:
7302 primary-expression
7303 postfix-expression [ expression ]
7304 postfix-expression ( expression-list [opt] )
7305 simple-type-specifier ( expression-list [opt] )
7306 typename :: [opt] nested-name-specifier identifier
7307 ( expression-list [opt] )
7308 typename :: [opt] nested-name-specifier template [opt] template-id
7309 ( expression-list [opt] )
7310 postfix-expression . template [opt] id-expression
7311 postfix-expression -> template [opt] id-expression
7312 postfix-expression . pseudo-destructor-name
7313 postfix-expression -> pseudo-destructor-name
7314 postfix-expression ++
7315 postfix-expression --
7316 dynamic_cast < type-id > ( expression )
7317 static_cast < type-id > ( expression )
7318 reinterpret_cast < type-id > ( expression )
7319 const_cast < type-id > ( expression )
7320 typeid ( expression )
7321 typeid ( type-id )
7323 GNU Extension:
7325 postfix-expression:
7326 ( type-id ) { initializer-list , [opt] }
7328 This extension is a GNU version of the C99 compound-literal
7329 construct. (The C99 grammar uses `type-name' instead of `type-id',
7330 but they are essentially the same concept.)
7332 If ADDRESS_P is true, the postfix expression is the operand of the
7333 `&' operator. CAST_P is true if this expression is the target of a
7334 cast.
7336 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
7337 class member access expressions [expr.ref].
7339 Returns a representation of the expression. */
7341 static cp_expr
7345 {
7347 location_t loc;
7353 /* Peek at the next token. */
7358 /* Some of the productions are determined by keywords. */
7361 {
7366 {
7367 tree type;
7368 cp_expr expression;
7372 /* All of these can be handled in the same way from the point
7373 of view of parsing. Begin by consuming the token
7374 identifying the cast. */
7377 /* New types cannot be defined in the cast. */
7379 parser->type_definition_forbidden_message
7382 /* Look for the opening `<'. */
7384 /* Parse the type to which we are casting. */
7388 NULL);
7390 /* Look for the closing `>'. */
7392 /* Restore the old message. */
7395 bool saved_greater_than_is_operator_p
7399 /* And the expression which is being cast. */
7400 matching_parens parens;
7404 RT_CLOSE_PAREN);
7408 parser->greater_than_is_operator_p
7411 /* Only type conversions to integral or enumeration types
7412 can be used in constant-expressions. */
7415 {
7418 }
7420 /* Construct a location e.g. :
7421 reinterpret_cast <int *> (expr)
7422 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
7423 ranging from the start of the "*_cast" token to the final closing
7424 paren, with the caret at the start. */
7428 {
7430 postfix_expression
7432 tf_warning_or_error);
7435 postfix_expression
7437 tf_warning_or_error);
7440 postfix_expression
7442 tf_warning_or_error);
7445 postfix_expression
7447 tf_warning_or_error);
7451 }
7452 }
7456 {
7457 tree type;
7461 /* Consume the `typeid' token. */
7463 /* Look for the `(' token. */
7464 matching_parens parens;
7466 /* Types cannot be defined in a `typeid' expression. */
7468 parser->type_definition_forbidden_message
7470 /* We can't be sure yet whether we're looking at a type-id or an
7471 expression. */
7473 /* Try a type-id first. */
7478 /* Look for the `)' token. Otherwise, we can't be sure that
7479 we're not looking at an expression: consider `typeid (int
7480 (3))', for example. */
7482 /* If all went well, simply lookup the type-id. */
7485 /* Otherwise, fall back to the expression variant. */
7486 else
7487 {
7488 tree expression;
7490 /* Look for an expression. */
7492 /* Compute its typeid. */
7494 /* Look for the `)' token. */
7496 }
7497 /* Restore the saved message. */
7499 /* `typeid' may not appear in an integral constant expression. */
7503 /* Construct a location e.g. :
7504 typeid (expr)
7505 ^~~~~~~~~~~~~
7506 ranging from the start of the "typeid" token to the final closing
7507 paren, with the caret at the start. */
7509 {
7510 location_t typeid_loc
7514 }
7515 }
7519 {
7520 tree type;
7521 /* The syntax permitted here is the same permitted for an
7522 elaborated-type-specifier. */
7529 }
7537 {
7545 {
7548 }
7554 {
7557 postfix_expression
7559 else
7560 {
7564 }
7570 tf_warning_or_error);
7571 else
7572 {
7576 }
7584 else
7585 {
7589 }
7594 postfix_expression
7598 postfix_expression
7601 else
7602 {
7606 }
7611 {
7615 }
7616 else
7617 {
7618 postfix_expression
7620 }
7625 }
7627 }
7630 {
7631 tree expression;
7632 tree type;
7633 /* Consume the `__builtin_convertvector' token. */
7635 /* Look for the opening `('. */
7636 matching_parens parens;
7638 /* Now, parse the assignment-expression. */
7640 /* Look for the `,'. */
7642 location_t type_location
7644 /* Parse the type-id. */
7645 {
7648 }
7649 /* Look for the closing `)'. */
7651 postfix_expression
7653 tf_warning_or_error);
7655 }
7658 {
7659 tree expression;
7660 tree type;
7661 /* Consume the `__builtin_bit_cast' token. */
7663 /* Look for the opening `('. */
7664 matching_parens parens;
7666 location_t type_location
7668 /* Parse the type-id. */
7669 {
7672 }
7673 /* Look for the `,'. */
7675 /* Now, parse the assignment-expression. */
7677 /* Look for the closing `)'. */
7679 postfix_expression
7681 tf_warning_or_error);
7683 }
7686 {
7687 tree type;
7689 /* If the next thing is a simple-type-specifier, we may be
7690 looking at a functional cast. We could also be looking at
7691 an id-expression. So, we try the functional cast, and if
7692 that doesn't work we fall back to the primary-expression. */
7694 /* Look for the simple-type-specifier. */
7698 CP_PARSER_FLAGS_NONE);
7700 /* Parse the cast itself. */
7702 postfix_expression
7704 /* If that worked, we're done. */
7708 /* If the functional-cast didn't work out, try a
7709 compound-literal. */
7712 {
7717 matching_parens parens;
7720 /* Avoid calling cp_parser_type_id pointlessly, see comment
7721 in cp_parser_cast_expression about c++/29234. */
7724 else
7725 {
7726 /* Parse the type. */
7732 }
7734 /* If things aren't going well, there's no need to
7735 keep going. */
7737 {
7739 /* Parse the brace-enclosed initializer list. */
7742 }
7743 /* If that worked, we're definitely looking at a
7744 compound-literal expression. */
7746 {
7747 /* Warn the user that a compound literal is not
7748 allowed in standard C++. */
7751 /* For simplicity, we disallow compound literals in
7752 constant-expressions. We could
7753 allow compound literals of integer type, whose
7754 initializer was a constant, in constant
7755 expressions. Permitting that usage, as a further
7756 extension, would not change the meaning of any
7757 currently accepted programs. (Of course, as
7758 compound literals are not part of ISO C++, the
7759 standard has nothing to say.) */
7761 NIC_NCC))
7762 {
7765 }
7766 /* Form the representation of the compound-literal. */
7767 postfix_expression
7772 }
7773 }
7775 /* It must be a primary-expression. */
7776 postfix_expression
7779 decltype_p,
7781 }
7783 }
7785 /* Note that we don't need to worry about calling build_cplus_new on a
7786 class-valued CALL_EXPR in decltype when it isn't the end of the
7787 postfix-expression; unary_complex_lvalue will take care of that for
7788 all these cases. */
7790 /* Keep looping until the postfix-expression is complete. */
7792 {
7796 /* It is not a Koenig lookup function call. */
7797 postfix_expression
7800 /* Peek at the next token. */
7804 {
7807 {
7809 "two consecutive %<[%> shall "
7812 }
7813 postfix_expression
7815 postfix_expression,
7817 decltype_p);
7826 /* postfix-expression ( expression-list [opt] ) */
7827 {
7839 tree stripped_expression
7841 is_builtin_constant_p
7844 {
7845 /* The whole point of __builtin_constant_p is to allow
7846 non-constant expressions to appear as arguments. */
7847 saved_integral_constant_expression_p
7849 saved_non_integral_constant_expression_p
7852 }
7853 args = (cp_parser_parenthesized_expression_list
7860 {
7861 parser->integral_constant_expression_p
7863 parser->non_integral_constant_expression_p
7865 }
7868 {
7871 }
7873 /* Function calls are not permitted in
7874 constant-expressions. */
7877 NIC_FUNC_CALL))
7878 {
7882 }
7887 {
7889 /* In C++20, we may need to perform ADL for a template
7890 name. */
7893 {
7895 {
7898 postfix_expression
7900 complain);
7901 }
7902 else
7903 postfix_expression
7905 }
7906 /* We do not perform argument-dependent lookup if
7907 normal lookup finds a non-function, in accordance
7908 with the expected resolution of DR 218. */
7911 {
7912 /* Do not do argument dependent lookup if regular
7913 lookup finds a member function or a block-scope
7914 function declaration. [basic.lookup.argdep]/3 */
7918 {
7924 {
7927 }
7928 }
7931 {
7934 postfix_expression
7936 complain);
7937 }
7938 }
7939 }
7941 /* Temporarily set input_location to the combined location
7942 with call expression range, as e.g. build_out_target_exprs
7943 called from convert_default_arg relies on input_location,
7944 so updating it only when the call is fully built results
7945 in inconsistencies between location handling in templates
7946 and outside of templates. */
7949 close_paren_loc);
7953 {
7963 {
7965 postfix_expression
7967 }
7969 {
7970 postfix_expression
7971 = (build_new_method_call
7977 complain));
7978 }
7979 else
7980 postfix_expression
7984 complain);
7985 }
7989 postfix_expression = (build_offset_ref_call_from_tree
7991 complain));
7993 /* A call to a static class member, or a namespace-scope
7994 function. */
7995 postfix_expression
7998 koenig_p,
7999 complain);
8000 else
8001 /* All other function calls. */
8002 postfix_expression
8005 koenig_p,
8006 complain);
8011 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
8015 }
8020 /* postfix-expression . template [opt] id-expression
8021 postfix-expression . pseudo-destructor-name
8022 postfix-expression -> template [opt] id-expression
8023 postfix-expression -> pseudo-destructor-name */
8025 /* Consume the `.' or `->' operator. */
8028 postfix_expression
8030 postfix_expression,
8037 /* postfix-expression ++ */
8038 /* Consume the `++' token. */
8040 /* Generate a representation for the complete expression. */
8041 postfix_expression
8043 POSTINCREMENT_EXPR);
8044 /* Increments may not appear in constant-expressions. */
8052 /* postfix-expression -- */
8053 /* Consume the `--' token. */
8055 /* Generate a representation for the complete expression. */
8056 postfix_expression
8058 POSTDECREMENT_EXPR);
8059 /* Decrements may not appear in constant-expressions. */
8070 return is_member_access
8071 ? postfix_expression
8073 else
8075 }
8076 }
8077 }
8079 /* Helper function for cp_parser_parenthesized_expression_list and
8080 cp_parser_postfix_open_square_expression. Parse a single element
8081 of parenthesized expression list. */
8083 static cp_expr
8087 {
8091 /* Parse the next assignment-expression. */
8093 {
8094 /* A braced-init-list. */
8100 }
8102 {
8108 }
8109 else
8112 /* If we have an ellipsis, then this is an expression expansion. */
8115 {
8116 /* Consume the `...'. */
8119 /* Build the argument pack. */
8121 }
8123 }
8125 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8126 by cp_parser_builtin_offsetof. We're looking for
8128 postfix-expression [ expression ]
8129 postfix-expression [ braced-init-list ] (C++11)
8130 postfix-expression [ expression-list[opt] ] (C++23)
8132 FOR_OFFSETOF is set if we're being called in that context, which
8133 changes how we deal with integer constant expressions. */
8135 static tree
8137 tree postfix_expression,
8140 {
8146 /* Consume the `[' token. */
8152 /* Parse the index expression. */
8153 /* ??? For offsetof, there is a question of what to allow here. If
8154 offsetof is not being used in an integral constant expression context,
8155 then we *could* get the right answer by computing the value at runtime.
8156 If we are in an integral constant expression context, then we might
8157 could accept any constant expression; hard to say without analysis.
8158 Rather than open the barn door too wide right away, allow only integer
8159 constant expressions here. */
8162 else
8163 {
8168 {
8170 {
8171 cp_expr expr
8173 /*cast_p=*/
8175 /*allow_exp_p=*/
8177 /*non_cst_p=*/
8178 NULL);
8185 else
8188 /* If the next token isn't a `,', then we are done. */
8193 {
8196 }
8198 /* Otherwise, consume the `,' and keep going. */
8200 }
8203 }
8205 {
8210 }
8211 else
8215 }
8219 /* Look for the closing `]'. */
8222 /* Build the ARRAY_REF. */
8225 tf_warning_or_error
8228 /* When not doing offsetof, array references are not permitted in
8229 constant-expressions. */
8235 }
8237 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
8238 dereference of incomplete type, returns true if error_mark_node should
8239 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
8240 and *DEPENDENT_P. */
8242 bool
8245 {
8246 /* In a template, be permissive by treating an object expression
8247 of incomplete type as dependent (after a pedwarn). */
8248 diagnostic_t kind = (processing_template_decl
8252 {
8264 /* Don't emit any diagnostic for OVERLOADs. */
8268 /* Avoid clobbering e.g. DECLs. */
8272 }
8284 {
8287 }
8289 }
8291 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8292 by cp_parser_builtin_offsetof. We're looking for
8294 postfix-expression . template [opt] id-expression
8295 postfix-expression . pseudo-destructor-name
8296 postfix-expression -> template [opt] id-expression
8297 postfix-expression -> pseudo-destructor-name
8299 FOR_OFFSETOF is set if we're being called in that context. That sorta
8300 limits what of the above we'll actually accept, but nevermind.
8301 TOKEN_TYPE is the "." or "->" token, which will already have been
8302 removed from the stream. */
8304 static tree
8307 cp_expr postfix_expression,
8309 location_t location)
8310 {
8311 tree name;
8317 /* If this is a `->' operator, dereference the pointer. */
8320 tf_warning_or_error);
8321 /* Check to see whether or not the expression is type-dependent and
8322 not the current instantiation. */
8324 /* The identifier following the `->' or `.' is not qualified. */
8330 /* Enter the scope corresponding to the type of the object
8331 given by the POSTFIX_EXPRESSION. */
8333 {
8335 /* According to the standard, no expression should ever have
8336 reference type. Unfortunately, we do not currently match
8337 the standard in this respect in that our internal representation
8338 of an expression may have reference type even when the standard
8339 says it does not. Therefore, we have to manually obtain the
8340 underlying type here. */
8342 /* The type of the POSTFIX_EXPRESSION must be complete. */
8343 /* Unlike the object expression in other contexts, *this is not
8344 required to be of complete type for purposes of class member
8345 access (5.2.5) outside the member function body. */
8349 {
8355 }
8358 {
8359 /* Let the name lookup machinery know that we are processing a
8360 class member access expression. */
8362 /* If something went wrong, we want to be able to discern that case,
8363 as opposed to the case where there was no SCOPE due to the type
8364 of expression being dependent. */
8367 /* If the SCOPE was erroneous, make the various semantic analysis
8368 functions exit quickly -- and without issuing additional error
8369 messages. */
8372 }
8373 }
8376 {
8378 /* If we don't have a (type-dependent) object of class type, use
8379 typeof to figure out the type of the object. */
8383 }
8385 /* Assume this expression is not a pseudo-destructor access. */
8388 /* If the SCOPE is a scalar type, then, if this is a valid program,
8389 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
8390 is type dependent, it can be pseudo-destructor-name or something else.
8391 Try to parse it as pseudo-destructor-name first. */
8393 {
8394 tree s;
8395 tree type;
8398 /* Parse the pseudo-destructor-name. */
8407 {
8409 postfix_expression
8412 }
8413 }
8416 {
8417 /* If the SCOPE is not a scalar type, we are looking at an
8418 ordinary class member access expression, rather than a
8419 pseudo-destructor-name. */
8422 /* Parse the id-expression. */
8423 name = (cp_parser_id_expression
8430 /* In general, build a SCOPE_REF if the member name is qualified.
8431 However, if the name was not dependent and has already been
8432 resolved; there is no need to build the SCOPE_REF. For example;
8434 struct X { void f(); };
8435 template <typename T> void f(T* t) { t->X::f(); }
8437 Even though "t" is dependent, "X::f" is not and has been resolved
8438 to a BASELINK; there is no need to include scope information. */
8440 /* But we do need to remember that there was an explicit scope for
8441 virtual function calls. */
8445 /* If the name is a template-id that names a type, we will get a
8446 TYPE_DECL here. That is invalid code. */
8448 {
8451 }
8452 else
8453 {
8455 {
8457 {
8461 }
8462 else
8465 name,
8466 template_p);
8470 }
8472 adjust_result_of_qualified_name_lookup
8474 postfix_expression
8476 template_p,
8477 tf_warning_or_error);
8478 /* Build a location e.g.:
8479 ptr->access_expr
8480 ~~~^~~~~~~~~~~~~
8481 where the caret is at the deref token, ranging from
8482 the start of postfix_expression to the end of the access expr. */
8483 location_t combined_loc
8486 }
8487 }
8489 /* We no longer need to look up names in the scope of the object on
8490 the left-hand side of the `.' or `->' operator. */
8493 /* Outside of offsetof, these operators may not appear in
8494 constant-expressions. */
8496 && (cp_parser_non_integral_constant_expression
8501 }
8503 /* Parse a parenthesized expression-list.
8505 expression-list:
8506 assignment-expression
8507 expression-list, assignment-expression
8509 attribute-list:
8510 expression-list
8511 identifier
8512 identifier, expression-list
8514 CAST_P is true if this expression is the target of a cast.
8516 ALLOW_EXPANSION_P is true if this expression allows expansion of an
8517 argument pack.
8519 WRAP_LOCATIONS_P is true if expressions within this list for which
8520 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
8521 their source locations.
8523 Returns a vector of trees. Each element is a representation of an
8524 assignment-expression. NULL is returned if the ( and or ) are
8525 missing. An empty, but allocated, vector is returned on no
8526 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
8527 if we are parsing an attribute list for an attribute that wants a
8528 plain identifier argument, normal_attr for an attribute that wants
8529 an expression, or non_attr if we aren't parsing an attribute list. If
8530 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
8531 not all of the expressions in the list were constant.
8532 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
8533 will be written to with the location of the closing parenthesis. If
8534 an error occurs, it may or may not be written to. */
8544 {
8548 /* Assume all the expressions will be constant. */
8552 matching_parens parens;
8558 /* Within a parenthesized expression, a `>' token is always
8559 the greater-than operator. */
8560 saved_greater_than_is_operator_p
8566 /* Consume expressions until there are no more. */
8569 {
8570 /* At the beginning of attribute lists, check to see if the
8571 next token is an identifier. */
8577 else
8578 expr
8580 allow_expansion_p,
8581 non_constant_p);
8586 /* Add it to the list. We add error_mark_node
8587 expressions to the list, so that we can still tell if
8588 the correct form for a parenthesized expression-list
8589 is found. That gives better errors. */
8595 /* After the first item, attribute lists look the same as
8596 expression lists. */
8599 get_comma:;
8600 /* If the next token isn't a `,', then we are done. */
8604 /* Otherwise, consume the `,' and keep going. */
8606 }
8612 {
8615 skip_comma:;
8616 /* We try and resync to an unnested comma, as that will give the
8617 user better diagnostics. */
8625 {
8626 parser->greater_than_is_operator_p
8629 }
8630 }
8632 parser->greater_than_is_operator_p
8636 }
8638 /* Parse a pseudo-destructor-name.
8640 pseudo-destructor-name:
8641 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
8642 :: [opt] nested-name-specifier template template-id :: ~ type-name
8643 :: [opt] nested-name-specifier [opt] ~ type-name
8645 If either of the first two productions is used, sets *SCOPE to the
8646 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
8647 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
8648 or ERROR_MARK_NODE if the parse fails. */
8650 static void
8652 tree object,
8655 {
8658 /* Handle ~auto. */
8662 {
8665 "%<~auto%> only available with "
8672 }
8674 /* Assume that things will not work out. */
8677 /* Look for the optional `::' operator. */
8679 /* Look for the optional nested-name-specifier. */
8680 nested_name_specifier_p
8687 /* Now, if we saw a nested-name-specifier, we might be doing the
8688 second production. */
8691 {
8692 /* Consume the `template' keyword. */
8694 /* Parse the template-id. */
8698 class_type,
8700 /* Look for the `::' token. */
8702 }
8703 /* If the next token is not a `~', then there might be some
8704 additional qualification. */
8706 {
8707 /* At this point, we're looking for "type-name :: ~". The type-name
8708 must not be a class-name, since this is a pseudo-destructor. So,
8709 it must be either an enum-name, or a typedef-name -- both of which
8710 are just identifiers. So, we peek ahead to check that the "::"
8711 and "~" tokens are present; if they are not, then we can avoid
8712 calling type_name. */
8716 {
8719 }
8721 /* Look for the type-name. */
8726 /* Look for the `::' token. */
8728 }
8729 else
8732 /* Look for the `~'. */
8735 /* Once we see the ~, this has to be a pseudo-destructor. */
8739 /* Look for the type-name again. We are not responsible for
8740 checking that it matches the first type-name. */
8742 }
8744 /* Parse a unary-expression.
8746 unary-expression:
8747 postfix-expression
8748 ++ cast-expression
8749 -- cast-expression
8750 await-expression
8751 unary-operator cast-expression
8752 sizeof unary-expression
8753 sizeof ( type-id )
8754 alignof ( type-id ) [C++0x]
8755 new-expression
8756 delete-expression
8758 GNU Extensions:
8760 unary-expression:
8761 __extension__ cast-expression
8762 __alignof__ unary-expression
8763 __alignof__ ( type-id )
8764 alignof unary-expression [C++0x]
8765 __real__ cast-expression
8766 __imag__ cast-expression
8767 && identifier
8768 sizeof ( type-id ) { initializer-list , [opt] }
8769 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8770 __alignof__ ( type-id ) { initializer-list , [opt] }
8772 ADDRESS_P is true iff the unary-expression is appearing as the
8773 operand of the `&' operator. CAST_P is true if this expression is
8774 the target of a cast.
8776 Returns a representation of the expression. */
8778 static cp_expr
8781 {
8785 /* Peek at the next token. */
8787 /* Some keywords give away the kind of expression. */
8789 {
8793 {
8796 {
8804 /* Consume the token. */
8806 /* Parse the operand. */
8809 /* Construct a location e.g. :
8810 alignof (expr)
8811 ^~~~~~~~~~~~~~
8812 with start == caret at the start of the "alignof"/"sizeof"
8813 token, with the endpoint at the final closing paren. */
8814 location_t compound_loc
8820 else
8821 {
8822 /* ISO C++ defines alignof only with types, not with
8823 expressions. So pedwarn if alignof is used with a non-
8824 type expression. However, __alignof__ is ok. */
8827 "ISO C++ does not allow %<alignof%> "
8832 }
8833 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8834 SIZEOF_EXPR with the original operand. */
8836 {
8838 {
8840 {
8843 error_mark_node));
8845 }
8846 else
8851 }
8852 }
8857 }
8869 {
8870 /* The saved value of the PEDANTIC flag. */
8872 tree expr;
8874 /* Save away the PEDANTIC flag. */
8876 /* Parse the cast-expression. */
8878 /* Restore the PEDANTIC flag. */
8882 }
8886 {
8887 tree expression;
8889 /* Consume the `__real__' or `__imag__' token. */
8891 /* Parse the cast-expression. */
8893 /* Create the complete representation. */
8898 tf_warning_or_error);
8899 }
8907 {
8908 tree expr;
8917 matching_parens parens;
8921 parser->type_definition_forbidden_message
8924 saved_integral_constant_expression_p
8926 saved_non_integral_constant_expression_p
8930 saved_greater_than_is_operator_p
8942 parser->greater_than_is_operator_p
8945 parser->integral_constant_expression_p
8947 parser->non_integral_constant_expression_p
8954 /* Construct a location of the form:
8955 noexcept (expr)
8956 ^~~~~~~~~~~~~~~
8957 with start == caret, finishing at the close-paren. */
8958 location_t noexcept_loc
8962 noexcept_loc);
8963 }
8966 {
8967 tree expr;
8970 /* Consume the `co_await' token. */
8972 /* Parse its cast-expression. */
8977 /* Handle [expr.await]. */
8979 }
8983 }
8984 }
8986 /* Look for the `:: new' and `:: delete', which also signal the
8987 beginning of a new-expression, or delete-expression,
8988 respectively. If the next token is `::', then it might be one of
8989 these. */
8991 {
8994 /* See if the token after the `::' is one of the keywords in
8995 which we're interested. */
8997 /* If it's `new', we have a new-expression. */
9000 /* Similarly, for `delete'. */
9003 }
9005 /* Look for a unary operator. */
9007 /* The `++' and `--' operators can be handled similarly, even though
9008 they are not technically unary-operators in the grammar. */
9010 {
9015 /* Handle the GNU address-of-label extension. */
9018 {
9019 tree identifier;
9020 tree expression;
9023 /* Consume the '&&' token. */
9025 /* Look for the identifier. */
9027 /* Construct a location of the form:
9028 &&label
9029 ^~~~~~~
9030 with caret==start at the "&&", finish at the end of the label. */
9031 location_t combined_loc
9033 /* Create an expression representing the address. */
9036 NIC_ADDR_LABEL))
9039 }
9040 }
9042 {
9043 cp_expr cast_expression;
9049 /* Consume the operator token. */
9053 /* Parse the cast-expression. */
9054 cast_expression
9059 pidk);
9061 /* Make a location:
9062 OP_TOKEN CAST_EXPRESSION
9063 ^~~~~~~~~~~~~~~~~~~~~~~~~
9064 with start==caret at the operator token, and
9065 extending to the end of the cast_expression. */
9068 /* Now, build an appropriate representation. */
9070 {
9075 complain);
9076 /* TODO: build_x_indirect_ref does not always honor the
9077 location, so ensure it is set. */
9083 /* Fall through. */
9086 cast_expression,
9088 /* TODO: build_x_unary_op does not always honor the location,
9089 so ensure it is set. */
9097 /* Fall through. */
9099 /* Immediately fold negation of a constant, unless the constant is 0
9100 (since -0 == 0) or it would overflow. */
9102 {
9103 tree stripped_expr
9108 {
9111 stripped_expr);
9113 {
9116 }
9117 }
9118 }
9119 /* Fall through. */
9128 }
9132 non_constant_p))
9136 }
9140 decltype_p,
9141 pidk);
9142 }
9144 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
9145 unary-operator, the corresponding tree code is returned. */
9147 static enum tree_code
9149 {
9151 {
9172 }
9173 }
9175 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
9176 Returns a representation of the expression. */
9178 static tree
9180 {
9183 /* Consume the __builtin_has_attribute token. */
9186 matching_parens parens;
9190 /* Types cannot be defined in a `sizeof' expression. Save away the
9191 old message. */
9195 parser->type_definition_forbidden_message
9197 parser->type_definition_forbidden_message_arg
9200 /* The restrictions on constant-expressions do not apply inside
9201 sizeof expressions. */
9202 bool saved_integral_constant_expression_p
9204 bool saved_non_integral_constant_expression_p
9208 /* Do not actually evaluate the expression. */
9214 /* We can't be sure yet whether we're looking at a type-id or an
9215 expression. */
9220 /* Look for the type-id. */
9226 /* If the type-id production did not work out, then we must be
9227 looking at an expression. */
9233 /* Go back to evaluating expressions. */
9237 /* And restore the old one. */
9240 parser->integral_constant_expression_p
9242 parser->non_integral_constant_expression_p
9245 /* Consume the comma if it's there. */
9247 {
9251 }
9253 /* Parse the attribute specification. */
9257 {
9263 else
9264 {
9265 /* Fold constant expressions used in attributes first. */
9268 /* Finally, see if OPER has been declared with ATTR. */
9270 }
9273 }
9274 else
9275 {
9278 }
9280 /* Construct a location e.g. :
9281 __builtin_has_attribute (oper, attr)
9282 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
9283 with start == caret at the start of the built-in token,
9284 and with the endpoint at the final closing paren. */
9285 location_t compound_loc
9292 }
9294 /* Parse a new-expression.
9296 new-expression:
9297 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
9298 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
9300 Returns a representation of the expression. */
9302 static tree
9304 {
9307 tree type;
9310 tree ret;
9314 /* Look for the optional `::' operator. */
9315 global_scope_p
9319 /* Look for the `new' operator. */
9321 /* There's no easy way to tell a new-placement from the
9322 `( type-id )' construct. */
9324 /* Look for a new-placement. */
9326 /* If that didn't work out, there's no new-placement. */
9328 {
9332 }
9334 /* If the next token is a `(', then we have a parenthesized
9335 type-id. */
9337 {
9341 /* Consume the `('. */
9342 matching_parens parens;
9345 /* Parse the type-id. */
9346 parser->type_definition_forbidden_message
9348 {
9351 }
9354 /* Look for the closing `)'. */
9357 /* There should not be a direct-new-declarator in this production,
9358 but GCC used to allowed this, so we check and emit a sensible error
9359 message for this case. */
9361 {
9367 }
9368 }
9369 /* Otherwise, there must be a new-type-id. */
9370 else
9373 /* If the next token is a `(' or '{', then we have a new-initializer. */
9378 else
9381 /* A new-expression may not appear in an integral constant
9382 expression. */
9385 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
9386 of a new-type-id or type-id of a new-expression, the new-expression shall
9387 contain a new-initializer of the form ( assignment-expression )".
9388 Additionally, consistently with the spirit of DR 1467, we want to accept
9389 'new auto { 2 }' too. */
9395 {
9397 "initialization of new-expression for type %<auto%> "
9400 }
9401 else
9402 {
9403 /* Construct a location e.g.:
9404 ptr = new int[100]
9405 ^~~~~~~~~~~~
9406 with caret == start at the start of the "new" token, and the end
9407 at the end of the final token we consumed. */
9410 /* Create a representation of the new-expression. */
9413 }
9421 }
9423 /* Parse a new-placement.
9425 new-placement:
9426 ( expression-list )
9428 Returns the same representation as for an expression-list. */
9432 {
9435 /* Parse the expression-list. */
9436 expression_list = (cp_parser_parenthesized_expression_list
9445 }
9447 /* Parse a new-type-id.
9449 new-type-id:
9450 type-specifier-seq new-declarator [opt]
9452 Returns the TYPE allocated. If the new-type-id indicates an array
9453 type, *NELTS is set to the number of elements in the last array
9454 bound; the TYPE will not include the last array bound. */
9456 static tree
9458 {
9459 cp_decl_specifier_seq type_specifier_seq;
9465 /* The type-specifier sequence must not contain type definitions.
9466 (It cannot contain declarations of new types either, but if they
9467 are not definitions we will catch that because they are not
9468 complete.) */
9470 parser->type_definition_forbidden_message
9472 /* Parse the type-specifier-seq. */
9477 /* Restore the old message. */
9483 /* Parse the new-declarator. */
9486 /* Determine the number of elements in the last array dimension, if
9487 any. */
9489 /* Skip down to the last array dimension. */
9494 {
9497 }
9502 {
9505 }
9508 {
9517 else
9519 }
9522 }
9524 /* Parse an (optional) new-declarator.
9526 new-declarator:
9527 ptr-operator new-declarator [opt]
9528 direct-new-declarator
9530 Returns the declarator. */
9534 {
9537 cp_cv_quals cv_quals;
9539 /* We don't know if there's a ptr-operator next, or not. */
9541 /* Look for a ptr-operator. */
9543 /* If that worked, look for more new-declarators. */
9545 {
9548 /* Parse another optional declarator. */
9551 declarator = cp_parser_make_indirect_declarator
9555 }
9557 /* If the next token is a `[', there is a direct-new-declarator. */
9562 }
9564 /* Parse a direct-new-declarator.
9566 direct-new-declarator:
9567 [ expression ]
9568 direct-new-declarator [constant-expression]
9570 */
9574 {
9579 {
9580 tree expression;
9583 /* Look for the opening `['. */
9589 else
9591 /* The standard requires that the expression have integral
9592 type. DR 74 adds enumeration types. We believe that the
9593 real intent is that these expressions be handled like the
9594 expression in a `switch' condition, which also allows
9595 classes with a single conversion to integral or
9596 enumeration type. */
9598 {
9599 expression
9601 expression,
9604 {
9606 "expression in new-declarator must have integral "
9609 }
9610 }
9612 /* Look for the closing `]'. */
9615 /* Add this bound to the declarator. */
9618 /* If the next token is not a `[', then there are no more
9619 bounds. */
9623 }
9626 }
9628 /* Parse a new-initializer.
9630 new-initializer:
9631 ( expression-list [opt] )
9632 braced-init-list
9634 Returns a representation of the expression-list. */
9638 {
9642 {
9643 tree t;
9650 }
9651 else
9652 expression_list = (cp_parser_parenthesized_expression_list
9658 }
9660 /* Parse a delete-expression.
9662 delete-expression:
9663 :: [opt] delete cast-expression
9664 :: [opt] delete [ ] cast-expression
9666 Returns a representation of the expression. */
9668 static tree
9670 {
9673 tree expression;
9676 /* Look for the optional `::' operator. */
9677 global_scope_p
9681 /* Look for the `delete' keyword. */
9683 /* See if the array syntax is in use. */
9685 {
9686 /* Consume the `[' token. */
9688 /* Look for the `]' token. */
9690 /* Remember that this is the `[]' construct. */
9692 }
9693 else
9696 /* Parse the cast-expression. */
9699 /* A delete-expression may not appear in an integral constant
9700 expression. */
9704 /* Construct a location e.g.:
9705 delete [ ] ptr
9706 ^~~~~~~~~~~~~~
9707 with caret == start at the start of the "delete" token, and
9708 the end at the end of the final token we consumed. */
9715 }
9717 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
9718 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
9719 0 otherwise. */
9721 static int
9723 {
9726 {
9768 /* In ((type ()) () the last () isn't a valid cast-expression,
9769 so the whole must be parsed as postfix-expression. */
9774 /* '[' may start a primary-expression in obj-c++ and in C++11,
9775 as a lambda-expression, eg, '(void)[]{}'. */
9782 /* '++' and '--' may or may not start a cast-expression:
9784 struct T { void operator++(int); };
9785 void f() { (T())++; }
9787 vs
9789 int a;
9790 (int)++a; */
9795 }
9796 }
9798 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
9799 in the order: const_cast, static_cast, reinterpret_cast.
9801 Don't suggest dynamic_cast.
9803 Return the first legal cast kind found, or NULL otherwise. */
9807 {
9808 tree trial;
9810 /* Reuse the parser logic by attempting to build the various kinds of
9811 cast, with "complain" disabled.
9812 Identify the first such cast that is valid. */
9814 /* Don't attempt to run such logic within template processing. */
9818 /* First try const_cast. */
9823 /* If that fails, try static_cast. */
9828 /* Finally, try reinterpret_cast. */
9830 tf_none);
9834 /* No such cast possible. */
9836 }
9838 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
9839 suggesting how to convert a C-style cast of the form:
9841 (DST_TYPE)ORIG_EXPR
9843 to a C++-style cast.
9845 The primary range of RICHLOC is asssumed to be that of the original
9846 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
9847 of the parens in the C-style cast. */
9849 static void
9852 tree dst_type)
9853 {
9854 /* This function is non-trivial, so bail out now if the warning isn't
9855 going to be emitted. */
9859 /* Try to find a legal C++ cast, trying them in order:
9860 const_cast, static_cast, reinterpret_cast. */
9865 /* Replace the open paren with "CAST_SUGGESTION<". */
9866 pretty_printer pp;
9871 /* Replace the close paren with "> (". */
9874 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
9876 }
9879 /* Parse a cast-expression.
9881 cast-expression:
9882 unary-expression
9883 ( type-id ) cast-expression
9885 ADDRESS_P is true iff the unary-expression is appearing as the
9886 operand of the `&' operator. CAST_P is true if this expression is
9887 the target of a cast.
9889 Returns a representation of the expression. */
9891 static cp_expr
9894 {
9895 /* If it's a `(', then we might be looking at a cast. */
9897 {
9903 /* There's no way to know yet whether or not this is a cast.
9904 For example, `(int (3))' is a unary-expression, while `(int)
9905 3' is a cast. So, we resort to parsing tentatively. */
9907 /* Types may not be defined in a cast. */
9909 parser->type_definition_forbidden_message
9911 /* Consume the `('. */
9912 matching_parens parens;
9917 /* A very tricky bit is that `(struct S) { 3 }' is a
9918 compound-literal (which we permit in C++ as an extension).
9919 But, that construct is not a cast-expression -- it is a
9920 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9921 is legal; if the compound-literal were a cast-expression,
9922 you'd need an extra set of parentheses.) But, if we parse
9923 the type-id, and it happens to be a class-specifier, then we
9924 will commit to the parse at that point, because we cannot
9925 undo the action that is done when creating a new class. So,
9926 then we cannot back up and do a postfix-expression.
9928 Another tricky case is the following (c++/29234):
9930 struct S { void operator () (); };
9932 void foo ()
9933 {
9934 ( S()() );
9935 }
9937 As a type-id we parse the parenthesized S()() as a function
9938 returning a function, groktypename complains and we cannot
9939 back up in this case either.
9941 Therefore, we scan ahead to the closing `)', and check to see
9942 if the tokens after the `)' can start a cast-expression. Otherwise
9943 we are dealing with an unary-expression, a postfix-expression
9944 or something else.
9946 Yet another tricky case, in C++11, is the following (c++/54891):
9948 (void)[]{};
9950 The issue is that usually, besides the case of lambda-expressions,
9951 the parenthesized type-id cannot be followed by '[', and, eg, we
9952 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9953 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9954 we don't commit, we try a cast-expression, then an unary-expression.
9956 Save tokens so that we can put them back. */
9959 /* We may be looking at a cast-expression. */
9962 cast_expression
9965 /* Roll back the tokens we skipped. */
9967 /* If we aren't looking at a cast-expression, simulate an error so
9968 that the call to cp_parser_error_occurred below returns true. */
9971 else
9972 {
9975 /* Look for the type-id. */
9977 /* Look for the closing `)'. */
9982 }
9984 /* Restore the saved message. */
9987 /* At this point this can only be either a cast or a
9988 parenthesized ctor such as `(T ())' that looks like a cast to
9989 function returning T. */
9991 {
9992 /* Only commit if the cast-expression doesn't start with
9993 '++', '--', or '[' in C++11. */
10001 pidk);
10004 {
10005 /* Warn about old-style casts, if so requested. */
10010 {
10016 }
10018 /* Only type conversions to integral or enumeration types
10019 can be used in constant-expressions. */
10022 NIC_CAST))
10025 /* Perform the cast. */
10026 /* Make a location:
10027 (TYPE) EXPR
10028 ^~~~~~~~~~~
10029 with start==caret at the open paren, extending to the
10030 end of "expr". */
10032 open_paren_loc,
10036 }
10037 }
10038 else
10040 }
10042 /* If we get here, then it's not a cast, so it must be a
10043 unary-expression. */
10046 }
10048 /* Parse a binary expression of the general form:
10050 pm-expression:
10051 cast-expression
10052 pm-expression .* cast-expression
10053 pm-expression ->* cast-expression
10055 multiplicative-expression:
10056 pm-expression
10057 multiplicative-expression * pm-expression
10058 multiplicative-expression / pm-expression
10059 multiplicative-expression % pm-expression
10061 additive-expression:
10062 multiplicative-expression
10063 additive-expression + multiplicative-expression
10064 additive-expression - multiplicative-expression
10066 shift-expression:
10067 additive-expression
10068 shift-expression << additive-expression
10069 shift-expression >> additive-expression
10071 relational-expression:
10072 shift-expression
10073 relational-expression < shift-expression
10074 relational-expression > shift-expression
10075 relational-expression <= shift-expression
10076 relational-expression >= shift-expression
10078 GNU Extension:
10080 relational-expression:
10081 relational-expression <? shift-expression
10082 relational-expression >? shift-expression
10084 equality-expression:
10085 relational-expression
10086 equality-expression == relational-expression
10087 equality-expression != relational-expression
10089 and-expression:
10090 equality-expression
10091 and-expression & equality-expression
10093 exclusive-or-expression:
10094 and-expression
10095 exclusive-or-expression ^ and-expression
10097 inclusive-or-expression:
10098 exclusive-or-expression
10099 inclusive-or-expression | exclusive-or-expression
10101 logical-and-expression:
10102 inclusive-or-expression
10103 logical-and-expression && inclusive-or-expression
10105 logical-or-expression:
10106 logical-and-expression
10107 logical-or-expression || logical-and-expression
10109 All these are implemented with a single function like:
10111 binary-expression:
10112 simple-cast-expression
10113 binary-expression <token> binary-expression
10115 CAST_P is true if this expression is the target of a cast.
10117 The binops_by_token map is used to get the tree codes for each <token> type.
10118 binary-expressions are associated according to a precedence table. */
10120 #define TOKEN_PRECEDENCE(token) \
10121 (((token->type == CPP_GREATER \
10122 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
10123 && !parser->greater_than_is_operator_p) \
10124 ? PREC_NOT_OPERATOR \
10125 : binops_by_token[token->type].prec)
10127 static cp_expr
10133 {
10134 cp_parser_expression_stack stack;
10137 cp_parser_expression_stack_entry current;
10138 cp_expr rhs;
10142 tree overload;
10144 /* Parse the first expression. */
10155 {
10156 /* Get an operator token. */
10162 {
10164 "%<>>%> operator is treated"
10168 }
10173 /* This is a fold-expression; handle it later. */
10176 /* Popping an entry off the stack means we completed a subexpression:
10177 - either we found a token which is not an operator (`>' where it is not
10178 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
10179 will happen repeatedly;
10180 - or, we found an operator which has lower priority. This is the case
10181 where the recursive descent *ascends*, as in `3 * 4 + 5' after
10182 parsing `3 * 4'. */
10184 {
10187 else
10189 }
10191 get_rhs:
10196 /* We used the operator token. */
10199 /* For "false && x" or "true || x", x will never be executed;
10200 disable warnings while evaluating it. */
10205 {
10208 }
10210 /* Extract another operand. It may be the RHS of this expression
10211 or the LHS of a new, higher priority expression. */
10216 /* Get another operator token. Look up its precedence to avoid
10217 building a useless (immediately popped) stack entry for common
10218 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
10225 {
10226 /* ... and prepare to parse the RHS of the new, higher priority
10227 expression. Since precedence levels on the stack are
10228 monotonically increasing, we do not have to care about
10229 stack overflows. */
10238 pop:
10240 /* If the stack is not empty, we have parsed into LHS the right side
10241 (`4' in the example above) of an expression we had suspended.
10242 We can use the information on the stack to recover the LHS (`3')
10243 from the stack together with the tree code (`MULT_EXPR'), and
10244 the precedence of the higher level subexpression
10245 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
10246 which will be used to actually build the additive expression. */
10251 }
10253 /* Undo the disabling of warnings done above. */
10255 {
10258 }
10263 /* Avoid warning for !!x == y. */
10268 /* Avoid warning for !b == y where b is boolean. */
10272 /* Avoid warning for !!b == y where b is boolean. */
10284 /* Don't warn for named "xor" (as opposed to '^'). */
10288 check_for_xor_used_as_pow
10301 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
10302 ERROR_MARK for everything that is not a binary expression.
10303 This makes warn_about_parentheses miss some warnings that
10304 involve unary operators. For unary expressions we should
10305 pass the correct tree_code unless the unary expression was
10306 surrounded by parentheses.
10307 */
10311 {
10314 else
10315 {
10318 current.lhs
10321 == tcc_comparison
10325 }
10326 }
10327 else
10328 {
10334 /* TODO: build_x_binary_op doesn't always honor the location. */
10336 }
10339 /* If the binary operator required the use of an overloaded operator,
10340 then this expression cannot be an integral constant-expression.
10341 An overloaded operator can be used even if both operands are
10342 otherwise permissible in an integral constant-expression if at
10343 least one of the operands is of enumeration type. */
10347 NIC_OVERLOADED))
10349 }
10352 }
10354 static cp_expr
10359 {
10362 }
10364 /* Parse the `? expression : assignment-expression' part of a
10365 conditional-expression. The LOGICAL_OR_EXPR is the
10366 logical-or-expression that started the conditional-expression.
10367 Returns a representation of the entire conditional-expression.
10369 This routine is used by cp_parser_assignment_expression
10370 and cp_parser_conditional_expression.
10372 ? expression : assignment-expression
10374 GNU Extensions:
10376 ? : assignment-expression */
10378 static tree
10380 {
10382 cp_expr assignment_expr;
10386 /* Consume the `?' token. */
10391 {
10394 /* Implicit true clause. */
10396 c_inhibit_evaluation_warnings +=
10399 }
10400 else
10401 {
10404 /* Parse the expression. */
10405 c_inhibit_evaluation_warnings +=
10408 c_inhibit_evaluation_warnings +=
10412 }
10414 /* The next token should be a `:'. */
10416 /* Parse the assignment-expression. */
10418 c_inhibit_evaluation_warnings -=
10421 /* Make a location:
10422 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
10423 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
10424 with the caret at the "?", ranging from the start of
10425 the logical_or_expr to the end of the assignment_expr. */
10430 /* Build the conditional-expression. */
10432 expr,
10433 assignment_expr,
10434 tf_warning_or_error);
10435 }
10437 /* Parse a conditional-expression.
10439 conditional-expression:
10440 logical-or-expression
10441 logical-or-expression ? expression : assignment-expression
10443 GNU Extensions:
10445 logical-or-expression ? : assignment-expression */
10447 static cp_expr
10449 {
10452 /* If the next token is a `?' then we're actually looking at
10453 a conditional-expression; otherwise we're done. */
10457 }
10459 /* Parse an assignment-expression.
10461 assignment-expression:
10462 conditional-expression
10463 logical-or-expression assignment-operator assignment_expression
10464 throw-expression
10465 yield-expression
10467 CAST_P is true if this expression is the target of a cast.
10468 DECLTYPE_P is true if this expression is the operand of decltype.
10470 Returns a representation for the expression. */
10472 static cp_expr
10475 {
10476 cp_expr expr;
10478 /* If the next token is the `throw' keyword, then we're looking at
10479 a throw-expression. */
10482 /* If the next token is the `co_yield' keyword, then we're looking at
10483 a yield-expression. */
10486 /* Otherwise, it must be that we are looking at a
10487 logical-or-expression. */
10488 else
10489 {
10490 /* Parse the binary expressions (logical-or-expression). */
10492 decltype_p,
10494 /* If the next token is a `?' then we're actually looking at a
10495 conditional-expression. */
10498 else
10499 {
10502 /* If it's an assignment-operator, we're using the second
10503 production. */
10504 enum tree_code assignment_operator
10507 {
10510 /* Parse the right-hand side of the assignment. */
10517 /* An assignment may not appear in a
10518 constant-expression. */
10520 NIC_ASSIGNMENT))
10522 /* Build the assignment expression. Its default
10523 location:
10524 LHS = RHS
10525 ~~~~^~~~~
10526 is the location of the '=' token as the
10527 caret, ranging from the start of the lhs to the
10528 end of the rhs. */
10533 assignment_operator,
10536 /* TODO: build_x_modify_expr doesn't honor the location,
10537 so we must set it here. */
10539 }
10540 }
10541 }
10544 }
10546 /* Parse an (optional) assignment-operator.
10548 assignment-operator: one of
10549 = *= /= %= += -= >>= <<= &= ^= |=
10551 GNU Extension:
10553 assignment-operator: one of
10554 <?= >?=
10556 If the next token is an assignment operator, the corresponding tree
10557 code is returned, and the token is consumed. For example, for
10558 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
10559 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
10560 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
10561 operator, ERROR_MARK is returned. */
10563 static enum tree_code
10565 {
10569 /* Peek at the next token. */
10573 {
10619 /* Nothing else is an assignment operator. */
10621 }
10623 /* An operator followed by ... is a fold-expression, handled elsewhere. */
10628 /* If it was an assignment operator, consume it. */
10633 }
10635 /* Parse an expression.
10637 expression:
10638 assignment-expression
10639 expression , assignment-expression
10641 CAST_P is true if this expression is the target of a cast.
10642 DECLTYPE_P is true if this expression is the immediate operand of decltype,
10643 except possibly parenthesized or on the RHS of a comma (N3276).
10644 WARN_COMMA_P is true if a comma should be diagnosed.
10646 Returns a representation of the expression. */
10648 static cp_expr
10651 {
10656 {
10657 cp_expr assignment_expression;
10659 /* Parse the next assignment-expression. */
10660 assignment_expression
10663 /* We don't create a temporary for a call that is the immediate operand
10664 of decltype or on the RHS of a comma. But when we see a comma, we
10665 need to create a temporary for a call on the LHS. */
10670 assignment_expression
10674 /* If this is the first assignment-expression, we can just
10675 save it away. */
10678 else
10679 {
10680 /* Create a location with caret at the comma, ranging
10681 from the start of the LHS to the end of the RHS. */
10689 }
10690 /* If the next token is not a comma, or we're in a fold-expression, then
10691 we are done with the expression. */
10695 /* Consume the `,'. */
10698 {
10699 /* [depr.comma.subscript]: A comma expression appearing as
10700 the expr-or-braced-init-list of a subscripting expression
10701 is deprecated. A parenthesized comma expression is not
10702 deprecated. */
10704 "top-level comma expression in array subscript "
10707 }
10709 /* A comma operator cannot appear in a constant-expression. */
10712 }
10715 }
10717 /* Parse a constant-expression.
10719 constant-expression:
10720 conditional-expression
10722 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
10723 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
10724 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
10725 is false, NON_CONSTANT_P should be NULL. If ALLOW_NON_CONSTANT_P is
10726 greater than 1, this isn't really a constant-expression, only a
10727 potentially constant-evaluated expression. If STRICT_P is true,
10728 only parse a conditional-expression, otherwise parse an
10729 assignment-expression. See below for rationale. */
10731 static cp_expr
10736 {
10740 cp_expr expression;
10742 /* It might seem that we could simply parse the
10743 conditional-expression, and then check to see if it were
10744 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
10745 one that the compiler can figure out is constant, possibly after
10746 doing some simplifications or optimizations. The standard has a
10747 precise definition of constant-expression, and we must honor
10748 that, even though it is somewhat more restrictive.
10750 For example:
10752 int i[(2, 3)];
10754 is not a legal declaration, because `(2, 3)' is not a
10755 constant-expression. The `,' operator is forbidden in a
10756 constant-expression. However, GCC's constant-folding machinery
10757 will fold this operation to an INTEGER_CST for `3'. */
10759 /* Save the old settings. */
10761 saved_allow_non_integral_constant_expression_p
10764 /* We are now parsing a constant-expression. */
10766 parser->allow_non_integral_constant_expression_p
10770 /* A manifestly constant-evaluated expression is evaluated even in an
10771 unevaluated operand. */
10774 /* Although the grammar says "conditional-expression", when not STRICT_P,
10775 we parse an "assignment-expression", which also permits
10776 "throw-expression" and the use of assignment operators. In the case
10777 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
10778 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
10779 actually essential that we look for an assignment-expression.
10780 For example, cp_parser_initializer_clauses uses this function to
10781 determine whether a particular assignment-expression is in fact
10782 constant. */
10785 else
10787 /* Restore the old settings. */
10788 parser->integral_constant_expression_p
10790 parser->allow_non_integral_constant_expression_p
10793 {
10794 /* Require an rvalue constant expression here; that's what our
10795 callers expect. Reference constant expressions are handled
10796 separately in e.g. cp_parser_template_argument. */
10805 }
10808 parser->non_integral_constant_expression_p
10812 }
10814 /* Parse __builtin_offsetof.
10816 offsetof-expression:
10817 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
10819 offsetof-member-designator:
10820 id-expression
10821 | offsetof-member-designator "." id-expression
10822 | offsetof-member-designator "[" expression "]"
10823 | offsetof-member-designator "->" id-expression */
10825 static cp_expr
10827 {
10829 tree type;
10830 cp_expr expr;
10831 cp_id_kind dummy;
10833 location_t finish_loc;
10835 /* We're about to accept non-integral-constant things, but will
10836 definitely yield an integral constant expression. Save and
10837 restore these values around our local parsing. */
10843 /* Consume the "__builtin_offsetof" token. */
10845 /* Consume the opening `('. */
10846 matching_parens parens;
10848 /* Parse the type-id. */
10850 {
10852 parser->type_definition_forbidden_message
10856 }
10857 /* Look for the `,'. */
10861 /* Build the (type *)null that begins the traditional offsetof macro. */
10862 tree object_ptr
10866 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
10870 {
10873 {
10875 /* offsetof-member-designator "[" expression "]" */
10881 /* offsetof-member-designator "->" identifier */
10884 /* FALLTHRU */
10887 /* offsetof-member-designator "." identifier */
10895 /* Consume the ")" token. */
10901 /* Error. We know the following require will fail, but
10902 that gives the proper error message. */
10907 }
10908 }
10910 success:
10911 /* Make a location of the form:
10912 __builtin_offsetof (struct s, f)
10913 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
10914 with caret at the type-id, ranging from the start of the
10915 "_builtin_offsetof" token to the close paren. */
10917 /* The result will be an INTEGER_CST, so we need to explicitly
10918 preserve the location. */
10921 failure:
10927 }
10929 /* Parse a builtin trait expression or type. */
10931 static cp_expr
10933 {
10934 cp_trait_kind kind;
10941 {
10942 #define DEFTRAIT(TCC, CODE, NAME, ARITY) \
10943 case RID_##CODE: \
10944 kind = CPTK_##CODE; \
10945 binary = (ARITY == 2); \
10946 variadic = (ARITY == -1); \
10947 type = (TCC == tcc_type); \
10948 break;
10950 #undef DEFTRAIT
10953 }
10955 /* Get location of initial token. */
10958 /* Consume the token. */
10961 matching_parens parens;
10964 else
10968 {
10977 }
10979 /* __type_pack_element takes an expression as its first argument and uses
10980 template-id syntax instead of function call syntax (for consistency
10981 with Clang). We special case these properties of __type_pack_element
10982 here and elsewhere. */
10984 else
10985 {
10988 }
10994 {
10998 {
11000 {
11002 "trailing argument to %<__type_pack_element%> "
11005 }
11006 }
11008 }
11010 {
11013 {
11016 }
11020 }
11022 {
11025 {
11029 {
11032 }
11036 }
11040 }
11044 /* cp_parser_enclosed_template_argument_list above already took care
11046 else
11049 /* Construct a location of the form:
11050 __is_trivially_copyable(_Tp)
11051 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
11052 with start == caret, finishing at the close-paren. */
11055 /* Complete the trait expression, which may mean either processing
11056 the trait expr now or saving it for template instantiation. */
11058 {
11066 else
11068 }
11069 }
11071 /* Parse a lambda expression.
11073 lambda-expression:
11074 lambda-introducer lambda-declarator [opt] compound-statement
11075 lambda-introducer < template-parameter-list > requires-clause [opt]
11076 lambda-declarator [opt] compound-statement
11078 Returns a representation of the expression. */
11080 static cp_expr
11082 {
11084 tree type;
11092 {
11093 /* C++20 allows lambdas in unevaluated context, but one in the type of a
11094 non-type parameter is nonsensical.
11096 Distinguish a lambda in the parameter type from a lambda in the
11097 default argument by looking at local_variables_forbidden_p, which is
11098 only set in default arguments. */
11100 {
11105 }
11106 }
11108 {
11110 {
11112 "lambda-expression in unevaluated context"
11115 }
11117 }
11119 {
11121 {
11125 }
11127 }
11129 /* We may be in the middle of deferred access check. Disable
11130 it now. */
11144 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
11147 /* Now that we've started the type, add the capture fields for any
11148 explicit captures. */
11151 {
11152 /* Inside the class, surrounding template-parameter-lists do not apply. */
11153 unsigned int saved_num_template_parameter_lists
11157 bool fully_implicit_function_template_p
11161 bool auto_is_implicit_function_template_parm_p
11172 /* The body of a lambda in a discarded statement is not discarded. */
11176 /* Similarly the body of a lambda in immediate function context is not
11177 in immediate function context. */
11181 /* By virtue of defining a local class, a lambda expression has access to
11182 the private variables of enclosing classes. */
11195 {
11198 }
11200 /* The capture list was built up in reverse order; fix that now. */
11215 parser->fully_implicit_function_template_p
11219 parser->auto_is_implicit_function_template_parm_p
11221 }
11223 /* This field is only used during parsing of the lambda. */
11226 /* This lambda shouldn't have any proxies left at this point. */
11228 /* And now that we're done, push proxies for an enclosing lambda. */
11231 /* Update the lambda expression to a range. */
11238 else
11246 }
11248 /* Parse the beginning of a lambda expression.
11250 lambda-introducer:
11251 [ lambda-capture [opt] ]
11253 LAMBDA_EXPR is the current representation of the lambda expression. */
11255 static void
11257 {
11258 /* Need commas after the first capture. */
11261 /* Eat the leading `['. */
11264 /* Record default capture mode. "[&" "[=" "[&," "[=," */
11274 {
11280 }
11285 {
11287 tree capture_id;
11288 tree capture_init_expr;
11292 enum capture_kind_type
11293 {
11294 BY_COPY,
11295 BY_REFERENCE
11296 };
11300 {
11303 }
11307 else
11310 /* Possibly capture `this'. */
11312 {
11317 "explicit by-copy capture of %<this%> "
11318 "with by-copy capture default only available with "
11324 this_identifier);
11325 else
11330 }
11332 /* Possibly capture `*this'. */
11335 {
11339 "%<*this%> capture only available with "
11346 this_identifier);
11347 else
11352 }
11354 /* But reject `&this'. */
11357 {
11363 }
11365 /* Remember whether we want to capture as a reference or not. */
11367 {
11370 }
11375 {
11379 "pack init-capture only available with "
11383 }
11385 /* Early C++20 drafts had ...& instead of &...; be forgiving. */
11388 {
11393 }
11395 /* Get the identifier. */
11400 /* Would be nice to have a cp_parser_skip_to_closing_x for general
11401 delimiters, but I modified this to stop on unnested ']' as well. It
11402 was already changed to stop on unnested '}', so the
11403 "closing_parenthesis" name is no more misleading with my change. */
11404 {
11410 }
11412 /* Find the initializer for this capture. */
11416 {
11418 /* An explicit initializer exists. */
11421 "lambda capture initializers "
11427 {
11430 }
11433 }
11434 else
11435 {
11438 /* Turn the identifier into an id-expression. */
11439 capture_init_expr
11444 {
11447 }
11450 {
11453 capture_init_expr);
11458 }
11461 {
11464 capture_init_expr))
11468 }
11470 capture_init_expr
11471 = finish_id_expression
11473 capture_init_expr,
11487 {
11492 {
11493 /* If what follows is an initializer, the second '...' is
11494 invalid. But for cases like [...xs...], the first one
11495 is invalid. */
11502 }
11503 }
11504 }
11508 {
11513 capture_id);
11517 "capture of %qD redundant with by-reference capture "
11519 }
11521 /* Check for duplicates.
11522 Optimize for the zero or one explicit captures cases and only create
11523 the hash_set after adding second capture. */
11531 else
11532 {
11535 }
11539 else
11542 explicit_init_p);
11544 /* If there is any qualification still in effect, clear it
11545 now; we will be starting fresh with the next capture. */
11549 }
11552 }
11554 /* Parse the (optional) middle of a lambda expression.
11556 lambda-declarator:
11557 ( parameter-declaration-clause ) lambda-specifiers requires-clause [opt]
11558 lambda-specifiers (C++23)
11560 lambda-specifiers:
11561 decl-specifier-seq [opt] noexcept-specifier [opt]
11562 attribute-specifier-seq [opt] trailing-return-type [opt]
11564 LAMBDA_EXPR is the current representation of the lambda expression. */
11566 static bool
11568 {
11569 /* 5.1.1.4 of the standard says:
11570 If a lambda-expression does not include a lambda-declarator, it is as if
11571 the lambda-declarator were ().
11572 This means an empty parameter list, no attributes, and no exception
11573 specification. */
11584 cp_decl_specifier_seq lambda_specs;
11586 /* A lambda op() is const unless explicitly 'mutable'. */
11589 /* The template-parameter-list is optional, but must begin with
11590 an opening angle if present. */
11592 {
11595 "lambda templates are only available with "
11599 "lambda templates are only available with "
11607 /* We may have a constrained generic lambda; parse the requires-clause
11608 immediately after the template-parameter-list and combine with any
11609 shorthand constraints present. */
11612 {
11617 }
11619 /* We just processed one more parameter list. */
11621 }
11623 /* Committee discussion supports allowing attributes here. */
11626 /* The parameter-declaration-clause is optional (unless
11627 template-parameter-list was given), but must begin with an
11628 opening parenthesis if present. */
11630 {
11631 matching_parens parens;
11636 /* Parse parameters. */
11637 param_list
11638 = cp_parser_parameter_declaration_clause
11641 /* Default arguments shall not be specified in the
11642 parameter-declaration-clause of a lambda-declarator. */
11647 OPT_Wc__14_extensions,
11652 }
11656 /* In the decl-specifier-seq of the lambda-declarator, each
11657 decl-specifier shall either be mutable or constexpr. */
11661 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
11665 {
11667 "parameter declaration before lambda declaration "
11668 "specifiers only optional with %<-std=c++2b%> or "
11671 }
11674 {
11677 }
11679 {
11684 else
11685 {
11688 }
11689 }
11693 {
11695 "parameter declaration before lambda transaction "
11696 "qualifier only optional with %<-std=c++2b%> or "
11699 }
11701 /* Parse optional exception specification. */
11702 exception_spec
11706 {
11708 "parameter declaration before lambda exception "
11709 "specification only optional with %<-std=c++2b%> or "
11712 }
11714 /* GCC 8 accepted attributes here, and this is the place for standard C++11
11715 attributes that appertain to the function type. */
11718 else
11721 /* Parse optional trailing return type. */
11723 {
11726 "parameter declaration before lambda trailing "
11727 "return type only optional with %<-std=c++2b%> or "
11731 }
11733 /* Also allow GNU attributes at the very end of the declaration, the usual
11734 place for GNU attributes. */
11739 {
11740 /* Parse optional trailing requires clause. */
11743 /* The function parameters must be in scope all the way until after the
11744 trailing-return-type in case of decltype. */
11746 }
11748 /* Create the function call operator.
11750 Messing with declarators like this is no uglier than building up the
11751 FUNCTION_DECL by hand, and this is less likely to get out of sync with
11752 other code. */
11753 {
11754 cp_decl_specifier_seq return_type_specs;
11756 tree fco;
11763 {
11767 else
11769 "lambda only available with %<-std=c++17%> or "
11771 }
11776 {
11780 }
11788 VIRT_SPEC_UNSPECIFIED,
11789 REF_QUAL_NONE,
11790 tx_qual,
11791 exception_spec,
11792 return_type,
11793 trailing_requires_clause,
11794 std_attrs,
11795 UNKNOWN_LOCATION);
11798 declarator,
11801 {
11805 /* Give the object parameter a different name. */
11808 }
11810 {
11814 }
11824 }
11825 }
11827 /* Parse the body of a lambda expression, which is simply
11829 compound-statement
11831 but which requires special handling.
11832 LAMBDA_EXPR is the current representation of the lambda expression. */
11834 static void
11836 {
11838 unsigned char local_variables_forbidden_p
11842 /* The body of a lambda-expression is not a subexpression of the enclosing
11843 expression. */
11844 cp_evaluated ev;
11848 else
11849 /* Still increment function_depth so that we don't GC in the
11850 middle of an expression. */
11858 /* Clear this in case we're in the middle of a default argument. */
11862 {
11867 /* Originally C++11 required us to peek for 'return expr'; and
11868 process it specially here to deduce the return type. N3638
11869 removed the need for that. */
11873 }
11880 else
11882 }
11884 /* Statements [gram.stmt.stmt] */
11886 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
11888 static void
11890 {
11894 /* A concept is never expanded normally. */
11900 }
11902 struct cp_omp_attribute_data
11903 {
11906 c_omp_directive_kind kind;
11907 };
11909 /* Handle omp::directive and omp::sequence attributes in ATTRS
11910 (if any) at the start of a statement or in attribute-declaration. */
11912 static tree
11914 {
11925 {
11926 cnt++;
11928 {
11934 {
11936 "mixing OpenMP directives with attribute and pragma "
11940 }
11943 {
11951 else
11954 }
11960 {
11962 "unknown OpenMP directive name in %<omp::directive%>"
11965 }
11968 {
11969 /* ordered is C_OMP_DIR_CONSTRUCT only if it doesn't contain
11970 depend/doacross clause. */
11983 }
11985 {
11986 /* error with at(execution) clause is C_OMP_DIR_STANDALONE. */
11990 paren_depth++;
11992 paren_depth--;
12003 {
12006 }
12007 }
12012 }
12013 cp_omp_attribute_data v = {};
12016 }
12017 else
12030 {
12035 }
12036 else
12037 {
12039 {
12042 }
12043 }
12046 {
12048 "OpenMP construct among %<omp::directive%> attributes"
12049 " requires all %<omp::directive%> attributes on the"
12052 }
12054 {
12056 "multiple OpenMP standalone directives among"
12057 " %<omp::directive%> attributes must be all within the"
12060 }
12066 {
12068 "standalone OpenMP directives in %<omp::directive%> attribute"
12071 }
12073 {
12077 {
12079 "mixing OpenMP directives with attribute and pragma "
12082 }
12083 }
12087 tokens++;
12092 {
12099 cp_token tok = {};
12107 tok = {};
12112 }
12113 cp_token tok = {};
12125 /* Move the current source position to that of the first token in the
12126 new lexer. */
12129 }
12131 /* True if and only if the name is one of the contract types. */
12133 static bool
12135 {
12139 }
12141 /* Handle omp::directive and omp::sequence attributes in *PATTRS
12142 (if any) at the start or after declaration-id of a declaration. */
12144 static void
12148 {
12159 {
12161 {
12168 {
12176 else
12179 }
12189 {
12191 {
12194 }
12196 {
12198 "mixing OpenMP directives with attribute and "
12201 }
12202 }
12203 }
12204 }
12207 {
12212 else
12215 }
12220 {
12229 }
12231 }
12233 /* Parse a statement.
12235 statement:
12236 labeled-statement
12237 expression-statement
12238 compound-statement
12239 selection-statement
12240 iteration-statement
12241 jump-statement
12242 declaration-statement
12243 try-block
12245 C++11:
12247 statement:
12248 labeled-statement
12249 attribute-specifier-seq (opt) expression-statement
12250 attribute-specifier-seq (opt) compound-statement
12251 attribute-specifier-seq (opt) selection-statement
12252 attribute-specifier-seq (opt) iteration-statement
12253 attribute-specifier-seq (opt) jump-statement
12254 declaration-statement
12255 attribute-specifier-seq (opt) try-block
12257 init-statement:
12258 expression-statement
12259 simple-declaration
12260 alias-declaration
12262 TM Extension:
12264 statement:
12265 atomic-statement
12267 IN_COMPOUND is true when the statement is nested inside a
12268 cp_parser_compound_statement.
12270 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12271 is a (possibly labeled) if statement which is not enclosed in braces
12272 and has an else clause. This is used to implement -Wparentheses.
12274 CHAIN is a vector of if-else-if conditions.
12276 Note that this version of parsing restricts assertions to be attached to
12277 empty statements. */
12279 static void
12283 {
12289 /* A copy of IN_COMPOUND which is set to false after seeing a label.
12290 This matters for certain pragmas. */
12293 restart:
12296 /* There is no statement yet. */
12303 /* In obj-c++, seeing '[[' might be the either the beginning of
12304 c++11 attributes, or a nested objc-message-expression. So
12305 let's parse the c++11 attributes tentatively. */
12311 {
12314 }
12317 /* Peek at the next token. */
12320 /* If we have contracts, check that they're valid in this context. */
12322 {
12330 /* Check that assertions are null statements. */
12334 }
12340 {
12344 {
12371 }
12377 {
12379 std_attrs);
12381 }
12382 }
12385 /* Remember the location of the first token in the statement. */
12389 /* If this is a keyword, then that will often determine what kind of
12390 statement we have. */
12392 {
12396 {
12399 /* Looks like a labeled-statement with a case label.
12400 Parse the label, and then use tail recursion to parse
12401 the statement. */
12429 /* Objective-C++ exception-handling constructs. */
12445 /* This must be a namespace alias definition. */
12447 {
12448 /* Attributes should be parsed as part of the
12449 declaration, so let's un-parse them. */
12452 }
12470 /* It might be a keyword like `int' that can start a
12471 declaration-statement. */
12473 }
12474 }
12476 {
12477 /* If the next token is a `:', then we are looking at a
12478 labeled-statement. */
12481 {
12482 /* Looks like a labeled-statement with an ordinary label.
12483 Parse the label, and then use tail recursion to parse
12484 the statement. */
12488 /* If there's no statement, it's not a labeled-statement, just
12489 a label. That's allowed in C++23, but only if we're at the
12490 end of a compound-statement. */
12493 {
12497 "label at end of compound statement only available "
12500 }
12504 }
12505 }
12506 /* Anything that starts with a `{' must be a compound-statement. */
12508 {
12511 }
12512 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
12513 a statement all its own. */
12515 {
12516 do_pragma:;
12519 /* Only certain OpenMP pragmas are attached to statements, and thus
12520 are considered statements themselves. All others are not. In
12521 the context of a compound, accept the pragma as a "statement" and
12522 return so that we can check for a close brace. Otherwise we
12523 require a real statement and must go back and read one. */
12531 {
12533 {
12540 }
12543 }
12551 }
12553 {
12556 }
12558 /* Everything else must be a declaration-statement or an
12559 expression-statement. Try for the declaration-statement
12560 first, unless we are looking at a `;', in which case we know that
12561 we have an expression-statement. */
12563 {
12565 {
12567 /* Attributes should be parsed as part of the declaration,
12568 so let's un-parse them. */
12573 /* Try to parse the declaration-statement. */
12576 /* If that worked, we're done. */
12579 /* It didn't work, restore the post-attribute position. */
12581 {
12584 {
12589 i++;
12591 {
12597 /* Don't handle OpenMP attribs on keywords that
12598 always start a declaration statement but don't
12599 accept attribute before it and therefore
12600 the tentative cp_parser_declaration_statement
12601 fails to parse because of that. */
12606 }
12609 {
12611 std_attrs
12612 = cp_parser_handle_statement_omp_attributes
12618 }
12619 }
12620 }
12621 }
12622 /* All preceding labels have been parsed at this point. */
12628 /* Look for an expression-statement instead. */
12632 attrs_loc);
12634 /* Handle [[fallthrough]];. */
12636 {
12637 /* The next token after the fallthrough attribute is ';'. */
12639 {
12640 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12642 IFN_FALLTHROUGH,
12645 }
12646 else
12650 }
12652 /* Handle [[assert: ...]]; */
12654 {
12655 /* Add the assertion as a statement in the current block. */
12659 }
12660 }
12662 /* Set the line number for the statement. */
12666 /* Allow "[[fallthrough]];" or "[[assume(cond)]];", but warn otherwise. */
12669 OPT_Wattributes,
12671 }
12673 /* Append ATTR to attribute list ATTRS. */
12675 tree
12677 {
12683 }
12685 /* Parse the label for a labeled-statement, i.e.
12687 label:
12688 attribute-specifier-seq[opt] identifier :
12689 attribute-specifier-seq[opt] case constant-expression :
12690 attribute-specifier-seq[opt] default :
12692 labeled-statement:
12693 label statement
12695 GNU Extension:
12696 case constant-expression ... constant-expression : statement
12698 When a label is parsed without errors, the label is added to the
12699 parse tree by the finish_* functions, so this function doesn't
12700 have to return the label. */
12702 static void
12704 {
12709 /* The next token should be an identifier. */
12713 {
12716 }
12718 /* Remember whether this case or a user-defined label is allowed to fall
12719 through to. */
12724 {
12726 {
12730 /* Consume the `case' token. */
12732 /* Parse the constant-expression. */
12739 {
12740 /* Consume the `...' token. */
12746 /* We don't need to emit warnings here, as the common code
12747 will do this for us. */
12748 }
12749 else
12753 {
12756 {
12759 }
12760 }
12761 else
12764 expr);
12765 }
12769 /* Consume the `default' token. */
12773 {
12776 {
12779 }
12780 }
12781 else
12786 /* Anything else must be an ordinary label. */
12791 }
12793 /* Require the `:' token. */
12796 /* An ordinary label may optionally be followed by attributes.
12797 However, this is only permitted if the attributes are then
12798 followed by a semicolon. This is because, for backward
12799 compatibility, when parsing
12800 lab: __attribute__ ((unused)) int i;
12801 we want the attribute to attach to "i", not "lab". */
12804 {
12805 tree attrs;
12809 /* And fallthrough always binds to the expression-statement. */
12814 ;
12815 else
12817 }
12823 }
12825 /* Parse an expression-statement.
12827 expression-statement:
12828 expression [opt] ;
12830 Returns the new EXPR_STMT -- or NULL_TREE if the expression
12831 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
12832 indicates whether this expression-statement is part of an
12833 expression statement. */
12835 static tree
12837 {
12842 /* There might be attribute fallthrough. */
12845 /* If the next token is a ';', then there is no expression
12846 statement. */
12848 {
12852 {
12855 }
12856 }
12860 /* Handle [[fallthrough]];. */
12862 {
12863 /* The next token after the fallthrough attribute is ';'. */
12865 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12868 else
12872 }
12874 /* Allow "[[fallthrough]];", but warn otherwise. */
12879 /* Give a helpful message for "A<T>::type t;" and the like. */
12882 {
12889 {
12890 /* A::A a; */
12895 }
12896 }
12898 /* Consume the final `;'. */
12903 /* This is the final expression statement of a statement
12904 expression. */
12910 }
12912 /* Parse a compound-statement.
12914 compound-statement:
12915 { statement-seq [opt] label-seq [opt] }
12917 label-seq:
12918 label
12919 label-seq label
12921 GNU extension:
12923 compound-statement:
12924 { label-declaration-seq [opt] statement-seq [opt] }
12926 label-declaration-seq:
12927 label-declaration
12928 label-declaration-seq label-declaration
12930 Returns a tree representing the statement. */
12932 static tree
12935 {
12936 tree compound_stmt;
12937 matching_braces braces;
12939 /* Consume the `{'. */
12946 /* Begin the compound-statement. */
12948 /* If the next keyword is `__label__' we have a label declaration. */
12951 /* Parse an (optional) statement-seq. */
12954 /* Consume the `}'. */
12957 /* Finish the compound-statement. */
12961 }
12963 /* Parse an (optional) statement-seq.
12965 statement-seq:
12966 statement
12967 statement-seq [opt] statement */
12969 static void
12971 {
12972 /* Scan statements until there aren't any more. */
12974 {
12977 /* If we are looking at a `}', then we have run out of
12978 statements; the same is true if we have reached the end
12979 of file, or have stumbled upon a stray '@end'. */
12986 /* If we are in a compound statement and find 'else' then
12987 something went wrong. */
12989 {
12992 else
12993 {
12996 }
12997 }
12999 /* Parse the statement. */
13001 }
13002 }
13004 /* Return true if this is the C++20 version of range-based-for with
13005 init-statement. */
13007 static bool
13009 {
13012 /* Save tokens so that we can put them back. */
13015 /* There has to be an unnested ; followed by an unnested :. */
13018 CPP_SEMICOLON,
13022 /* We found the semicolon, eat it now. */
13025 /* Now look for ':' that is not nested in () or {}. */
13028 CPP_COLON,
13031 out:
13032 /* Roll back the tokens we skipped. */
13036 }
13038 /* Return true if we're looking at (init; cond), false otherwise. */
13040 static bool
13042 {
13043 /* Save tokens so that we can put them back. */
13046 /* Look for ';' that is not nested in () or {}. */
13049 CPP_SEMICOLON,
13052 /* Roll back the tokens we skipped. */
13056 }
13058 /* Parse a selection-statement.
13060 selection-statement:
13061 if ( init-statement [opt] condition ) statement
13062 if ( init-statement [opt] condition ) statement else statement
13063 switch ( init-statement [opt] condition ) statement
13065 Returns the new IF_STMT or SWITCH_STMT.
13067 If IF_P is not NULL, *IF_P is set to indicate whether the statement
13068 is a (possibly labeled) if statement which is not enclosed in
13069 braces and has an else clause. This is used to implement
13070 -Wparentheses.
13072 CHAIN is a vector of if-else-if conditions. This is used to implement
13073 -Wduplicated-cond. */
13075 static tree
13078 {
13081 token_indent_info guard_tinfo;
13086 /* Peek at the next token. */
13090 /* See what kind of keyword it is. */
13093 {
13096 {
13097 tree statement;
13098 tree condition;
13103 RID_CONSTEXPR))
13104 {
13109 "%<if constexpr%> only available with "
13111 }
13114 {
13116 RID_CONSTEVAL))
13120 RID_CONSTEVAL))
13121 {
13124 }
13125 }
13127 {
13131 "%<if consteval%> only available with "
13142 {
13145 }
13151 {
13152 location_t before_loc
13158 }
13162 /* If the next token is `else', parse the else-clause. */
13164 RID_ELSE))
13165 {
13169 /* Consume the `else' keyword. */
13175 {
13179 }
13183 guard_tinfo);
13186 {
13187 location_t before_loc
13192 }
13195 }
13199 {
13203 }
13207 }
13209 /* Look for the `('. */
13210 matching_parens parens;
13212 {
13215 }
13217 /* Begin the selection-statement. */
13219 {
13222 }
13223 else
13226 /* Parse the optional init-statement. */
13228 {
13229 tree decl;
13232 OPT_Wc__17_extensions,
13233 "init-statement in selection statements only available "
13236 /* A non-empty init-statement can have arbitrary side
13237 effects. */
13240 }
13242 /* Parse the condition. */
13244 /* Look for the `)'. */
13250 {
13254 /* Add the condition. */
13261 /* Parse the then-clause. */
13265 /* Outside a template, the non-selected branch of a constexpr
13266 if is a 'discarded statement', i.e. unevaluated. */
13271 {
13274 }
13277 guard_tinfo);
13284 {
13288 }
13290 /* If the next token is `else', parse the else-clause. */
13292 RID_ELSE))
13293 {
13297 {
13300 }
13302 guard_tinfo
13304 /* Consume the `else' keyword. */
13307 {
13309 RID_IF)
13311 {
13312 /* We've got "if (COND) else if (COND2)". Start
13313 the condition chain and add COND as the first
13314 element. */
13318 {
13319 /* Wrap it in a NOP_EXPR so that we can set the
13320 location of the condition. */
13322 condition);
13325 }
13326 }
13328 RID_IF))
13329 /* This is if-else without subsequent if. Zap the
13330 condition chain; we would have already warned at
13331 this point. */
13333 }
13335 /* Parse the else-clause. */
13341 /* If we are currently parsing a then-clause, then
13342 IF_P will not be NULL. We set it to true to
13343 indicate that this if statement has an else clause.
13344 This may trigger the Wparentheses warning below
13345 when we get back up to the parent if statement. */
13350 {
13354 }
13355 }
13356 else
13357 {
13358 /* This if statement does not have an else clause. If
13359 NESTED_IF is true, then the then-clause has an if
13360 statement which does have an else clause. We warn
13361 about the potential ambiguity. */
13364 "suggest explicit braces to avoid ambiguous"
13367 /* We don't need the condition chain anymore. */
13369 }
13371 /* Now we're all done with the if-statement. */
13373 }
13374 else
13375 {
13379 /* Add the condition. */
13382 /* Parse the body of the switch-statement. */
13388 guard_tinfo);
13392 /* Now we're all done with the switch-statement. */
13394 }
13397 }
13403 }
13404 }
13406 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
13407 If we have seen at least one decl-specifier, and the next token is not
13408 a parenthesis (after "int (" we might be looking at a functional cast)
13409 neither we are dealing with a concept-check expression then we must be
13410 looking at a declaration. */
13412 static void
13415 {
13424 }
13426 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
13427 The declarator shall not specify a function or an array. Returns
13428 TRUE if the declarator is valid, FALSE otherwise. */
13430 static bool
13433 location_t loc)
13434 {
13438 {
13443 else
13451 }
13452 else
13454 }
13456 /* Parse a condition.
13458 condition:
13459 expression
13460 type-specifier-seq declarator = initializer-clause
13461 type-specifier-seq declarator braced-init-list
13463 GNU Extension:
13465 condition:
13466 type-specifier-seq declarator asm-specification [opt]
13467 attributes [opt] = assignment-expression
13469 Returns the expression that should be tested. */
13471 static tree
13473 {
13474 cp_decl_specifier_seq type_specifiers;
13478 /* Try the declaration first. */
13480 /* New types are not allowed in the type-specifier-seq for a
13481 condition. */
13483 parser->type_definition_forbidden_message
13485 /* Parse the type-specifier-seq. */
13487 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
13490 /* Restore the saved message. */
13493 /* Gather the attributes that were provided with the
13494 decl-specifiers. */
13499 /* If all is well, we might be looking at a declaration. */
13501 {
13502 tree decl;
13503 tree asm_specification;
13504 tree attributes;
13509 /* Parse the declarator. */
13511 CP_PARSER_FLAGS_NONE,
13517 /* Parse the attributes. */
13519 /* Parse the asm-specification. */
13521 /* If the next token is not an `=' or '{', then we might still be
13522 looking at an expression. For example:
13524 if (A(a).x)
13526 looks like a decl-specifier-seq and a declarator -- but then
13527 there is no `=', so this is an expression. */
13532 /* If we did see an `=' or '{', then we are looking at a declaration
13533 for sure. */
13535 {
13536 tree pushed_scope;
13543 /* Create the declaration. */
13550 /* Parse the initializer. */
13552 {
13556 }
13558 {
13559 /* Consume the `='. */
13563 }
13564 else
13565 {
13568 }
13572 /* Process the initializer. */
13575 asm_specification,
13576 flags);
13582 }
13583 }
13584 /* If we didn't even get past the declarator successfully, we are
13585 definitely not looking at a declaration. */
13586 else
13589 /* Otherwise, we are looking at an expression. */
13591 }
13593 /* Parses a for-statement or range-for-statement until the closing ')',
13594 not included. */
13596 static tree
13598 {
13602 /* Begin the for-statement. */
13605 /* Maybe parse the optional init-statement in a range-based for loop. */
13607 /* Checked for diagnostic purposes only. */
13609 {
13610 tree dummy;
13613 {
13615 OPT_Wc__20_extensions,
13616 "range-based %<for%> loops with initializer only "
13619 }
13620 }
13622 /* Parse the initialization. */
13628 else
13630 }
13632 static tree
13635 {
13636 /* Normal for loop */
13639 tree stmt;
13642 /* The init-statement has already been parsed in
13643 cp_parser_init_statement, so no work is needed here. */
13646 /* If there's a condition, process it. */
13650 {
13654 }
13656 {
13660 }
13662 /* Look for the `;'. */
13665 /* If there's an expression, process it. */
13671 }
13673 /* Tries to parse a range-based for-statement:
13675 range-based-for:
13676 decl-specifier-seq declarator : expression
13678 The decl-specifier-seq declarator and the `:' are already parsed by
13679 cp_parser_init_statement. If processing_template_decl it returns a
13680 newly created RANGE_FOR_STMT; if not, it is converted to a
13681 regular FOR_STMT. */
13683 static tree
13686 {
13693 /* Get the range declaration momentarily out of the way so that
13694 the range expression doesn't clash with it. */
13696 {
13698 {
13700 /* For decomposition declaration get all of the corresponding
13701 declarations out of the way. */
13705 {
13711 {
13717 }
13718 }
13719 }
13721 {
13726 }
13727 }
13730 {
13733 }
13734 else
13737 /* Put the range declaration(s) back into scope. */
13739 {
13743 }
13745 /* finish_omp_for has its own code for the following, so just
13746 return the range_expr instead. */
13750 /* If in template, STMT is converted to a normal for-statement
13751 at instantiation. If not, it is done just ahead. */
13753 {
13763 /* do_auto_deduction doesn't mess with template init-lists. */
13766 decomp_cnt);
13767 }
13768 else
13769 {
13773 unroll);
13774 }
13776 }
13778 /* Subroutine of cp_convert_range_for: given the initializer expression,
13779 builds up the range temporary. */
13781 static tree
13783 {
13784 /* Find out the type deduced by the declaration
13785 `auto &&__range = range_expr'. */
13790 /* Create the __range variable. */
13797 }
13799 /* Used by cp_parser_range_for in template context: we aren't going to
13800 do a full conversion yet, but we still need to resolve auto in the
13801 type of the for-range-declaration if present. This is basically
13802 a shortcut version of cp_convert_range_for. */
13804 static void
13807 {
13810 {
13813 iter_type = (cp_parser_perform_range_for_lookup
13816 {
13818 iter_type);
13821 tf_warning_or_error);
13824 tf_warning_or_error,
13825 adc_variable_type);
13828 }
13829 }
13830 }
13832 /* Warns when the loop variable should be changed to a reference type to
13833 avoid unnecessary copying. I.e., from
13835 for (const auto x : range)
13837 where range returns a reference, to
13839 for (const auto &x : range)
13841 if this version doesn't make a copy.
13843 This function also warns when the loop variable is initialized with
13844 a value of a different type resulting in a copy:
13846 int arr[10];
13847 for (const double &x : arr)
13849 DECL is the RANGE_DECL; EXPR is the *__for_begin expression.
13850 This function is never called when processing_template_decl is on. */
13852 static void
13854 {
13866 {
13869 {
13870 auto_diagnostic_group d;
13872 "loop variable %qD of type %qT binds to a temporary "
13875 {
13877 TYPE_QUAL_CONST);
13882 }
13883 }
13885 }
13889 /* Since small trivially copyable types are cheap to copy, we suppress the
13890 warning for them. 64B is a common size of a cache line. */
13896 /* If we can initialize a reference directly, suggest that to avoid the
13897 copy. */
13900 {
13901 auto_diagnostic_group d;
13905 {
13909 }
13910 }
13911 }
13913 /* Converts a range-based for-statement into a normal
13914 for-statement, as per the definition.
13916 for (RANGE_DECL : RANGE_EXPR)
13917 BLOCK
13919 should be equivalent to:
13921 {
13922 auto &&__range = RANGE_EXPR;
13923 for (auto __begin = BEGIN_EXPR, __end = END_EXPR;
13924 __begin != __end;
13925 ++__begin)
13926 {
13927 RANGE_DECL = *__begin;
13928 BLOCK
13929 }
13930 }
13932 If RANGE_EXPR is an array:
13933 BEGIN_EXPR = __range
13934 END_EXPR = __range + ARRAY_SIZE(__range)
13935 Else if RANGE_EXPR has a member 'begin' or 'end':
13936 BEGIN_EXPR = __range.begin()
13937 END_EXPR = __range.end()
13938 Else:
13939 BEGIN_EXPR = begin(__range)
13940 END_EXPR = end(__range);
13942 If __range has a member 'begin' but not 'end', or vice versa, we must
13943 still use the second alternative (it will surely fail, however).
13944 When calling begin()/end() in the third alternative we must use
13945 argument dependent lookup, but always considering 'std' as an associated
13946 namespace. */
13948 tree
13952 {
13960 /* If an error happened previously do nothing or else a lot of
13961 unhelpful errors would be issued. */
13963 else
13964 {
13965 tree range_temp;
13969 /* Can't bind a reference to an array of runtime bound. */
13971 else
13972 {
13977 LOOKUP_ONLYCONVERTING);
13979 }
13982 }
13984 /* The new for initialization statement. */
13986 iter_type);
13992 LOOKUP_ONLYCONVERTING);
14002 LOOKUP_ONLYCONVERTING);
14006 /* The new for condition. */
14013 /* The new increment expression. */
14016 tf_warning_or_error);
14022 /* The declaration is initialized with *__begin inside the loop body. */
14027 LOOKUP_ONLYCONVERTING);
14034 }
14036 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
14037 We need to solve both at the same time because the method used
14038 depends on the existence of members begin or end.
14039 Returns the type deduced for the iterator expression. */
14041 static tree
14043 {
14045 {
14048 }
14051 {
14056 }
14058 {
14059 /* If RANGE is an array, we will use pointer arithmetic. */
14062 range,
14066 }
14067 else
14068 {
14069 /* If it is not an array, we must do a bit of magic. */
14079 tf_warning_or_error);
14082 tf_warning_or_error);
14085 {
14086 /* Use the member functions. */
14089 }
14090 else
14091 {
14092 /* Use global functions with ADL. */
14093 releasing_vec vec;
14098 tf_warning_or_error);
14100 tf_warning_or_error);
14102 tf_warning_or_error);
14104 tf_warning_or_error);
14105 }
14107 /* Last common checks. */
14109 {
14110 /* If one of the expressions is an error do no more checks. */
14113 }
14116 /* Can happen, when, eg, in a template context, Koenig lookup
14117 can't resolve begin/end (c++/58503). */
14119 else
14120 {
14122 /* The unqualified type of the __begin and __end temporaries should
14123 be the same, as required by the multiple auto declaration. */
14125 {
14132 /* P0184R0 allows __begin and __end to have different types,
14133 but make sure they are comparable so we can give a better
14135 else
14139 }
14141 }
14142 }
14143 }
14145 /* Helper function for cp_parser_perform_range_for_lookup.
14146 Builds a tree for RANGE.IDENTIFIER(). */
14148 static tree
14150 {
14158 releasing_vec vec;
14162 tf_warning_or_error);
14164 }
14166 /* Parse an iteration-statement.
14168 iteration-statement:
14169 while ( condition ) statement
14170 do statement while ( expression ) ;
14171 for ( init-statement condition [opt] ; expression [opt] )
14172 statement
14174 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
14176 static tree
14179 {
14182 tree statement;
14184 token_indent_info guard_tinfo;
14186 /* Peek at the next token. */
14193 /* Remember whether or not we are already within an iteration
14194 statement. */
14197 /* See what kind of keyword it is. */
14200 {
14202 {
14203 tree condition;
14205 /* Begin the while-statement. */
14207 /* Look for the `('. */
14208 matching_parens parens;
14210 /* Parse the condition. */
14213 /* Look for the `)'. */
14215 /* Parse the dependent statement. */
14221 /* We're done with the while-statement. */
14223 }
14227 {
14228 tree expression;
14230 /* Begin the do-statement. */
14232 /* Parse the body of the do-statement. */
14239 /* Look for the `while' keyword. */
14241 /* Look for the `('. */
14242 matching_parens parens;
14244 /* Parse the expression. */
14246 /* We're done with the do-statement. */
14248 /* Look for the `)'. */
14250 /* Look for the `;'. */
14252 }
14256 {
14257 /* Look for the `('. */
14258 matching_parens parens;
14263 /* Look for the `)'. */
14266 /* Parse the body of the for-statement. */
14273 /* We're done with the for-statement. */
14275 }
14282 }
14285 }
14287 /* Parse an init-statement or the declarator of a range-based-for.
14288 Returns true if a range-based-for declaration is seen.
14290 init-statement:
14291 expression-statement
14292 simple-declaration
14293 alias-declaration */
14295 static bool
14297 {
14298 /* If the next token is a `;', then we have an empty
14299 expression-statement. Grammatically, this is also a
14300 simple-declaration, but an invalid one, because it does not
14301 declare anything. Therefore, if we did not handle this case
14302 specially, we would issue an error message about an invalid
14303 declaration. */
14305 {
14309 /* A colon is used in range-based for. */
14312 /* We're going to speculatively look for a declaration, falling back
14313 to an expression, if necessary. */
14317 {
14323 OPT_Wc__23_extensions,
14324 "alias-declaration in init-statement only "
14326 }
14327 else
14328 /* Parse the declaration. */
14331 decl);
14334 {
14335 /* It is a range-for, consume the ':'. */
14340 OPT_Wc__11_extensions,
14341 "range-based %<for%> loops only available with "
14343 }
14345 /* The ';' is not consumed yet because we told
14346 cp_parser_simple_declaration not to. */
14351 /* If the tentative parse failed, then we shall need to look for an
14352 expression-statement. */
14353 }
14354 /* If we are here, it is an expression-statement. */
14357 }
14359 /* Parse a jump-statement.
14361 jump-statement:
14362 break ;
14363 continue ;
14364 return expression [opt] ;
14365 return braced-init-list ;
14366 coroutine-return-statement;
14367 goto identifier ;
14369 GNU extension:
14371 jump-statement:
14372 goto * expression ;
14374 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
14376 static tree
14378 {
14384 /* Peek at the next token. */
14389 /* See what kind of keyword it is. */
14392 {
14396 {
14413 }
14419 {
14423 /* Fall through. */
14433 }
14439 {
14440 tree expr;
14444 {
14448 }
14451 else
14452 /* If the next token is a `;', then there is no
14453 expression. */
14455 /* Build the return-statement, check co-return first, since type
14456 deduction is not valid there. */
14461 else
14463 /* Look for the final `;'. */
14465 }
14472 {
14476 }
14478 /* Create the goto-statement. */
14480 {
14481 /* Issue a warning about this use of a GNU extension. */
14483 /* Consume the '*' token. */
14485 /* Parse the dependent expression. */
14487 }
14488 else
14490 /* Look for the final `;'. */
14497 }
14500 }
14502 /* Parse a declaration-statement.
14504 declaration-statement:
14505 block-declaration */
14507 static void
14509 {
14512 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14515 /* Parse the block-declaration. */
14518 /* Free any declarators allocated. */
14520 }
14522 /* Some dependent statements (like `if (cond) statement'), are
14523 implicitly in their own scope. In other words, if the statement is
14524 a single statement (as opposed to a compound-statement), it is
14525 none-the-less treated as if it were enclosed in braces. Any
14526 declarations appearing in the dependent statement are out of scope
14527 after control passes that point. This function parses a statement,
14528 but ensures that is in its own scope, even if it is not a
14529 compound-statement.
14531 If IF_P is not NULL, *IF_P is set to indicate whether the statement
14532 is a (possibly labeled) if statement which is not enclosed in
14533 braces and has an else clause. This is used to implement
14534 -Wparentheses.
14536 CHAIN is a vector of if-else-if conditions. This is used to implement
14537 -Wduplicated-cond.
14539 Returns the new statement. */
14541 static tree
14545 {
14546 tree statement;
14549 token_indent_info body_tinfo
14555 /* Mark if () ; with a special NOP_EXPR. */
14557 {
14568 }
14569 /* if a compound is opened, we simply parse the statement directly. */
14572 /* If the token is not a `{', then we must take special action. */
14573 else
14574 {
14575 /* Create a compound-statement. */
14577 /* Parse the dependent-statement. */
14580 /* Finish the dummy compound-statement. */
14582 }
14584 token_indent_info next_tinfo
14593 /* Return the statement. */
14595 }
14597 /* For some dependent statements (like `while (cond) statement'), we
14598 have already created a scope. Therefore, even if the dependent
14599 statement is a compound-statement, we do not want to create another
14600 scope. */
14602 static void
14605 {
14606 /* If the token is a `{', then we must take special action. */
14608 {
14609 token_indent_info body_tinfo
14615 token_indent_info next_tinfo
14624 }
14625 else
14626 {
14627 /* Avoid calling cp_parser_compound_statement, so that we
14628 don't create a new scope. Do everything else by hand. */
14629 matching_braces braces;
14631 /* If the next keyword is `__label__' we have a label declaration. */
14634 /* Parse an (optional) statement-seq. */
14637 }
14638 }
14640 /* Modules */
14642 /* Parse a module-name,
14643 identifier
14644 module-name . identifier
14645 header-name
14647 Returns a pointer to module object, NULL. */
14651 {
14654 {
14658 }
14663 {
14666 }
14669 {
14671 {
14674 }
14685 }
14688 }
14690 /* Named module-declaration
14691 __module ; PRAGMA_EOL
14692 __module private ; PRAGMA_EOL (unimplemented)
14693 [__export] __module module-name attr-spec-seq-opt ; PRAGMA_EOL
14694 */
14696 static module_parse
14699 {
14700 /* We're a pseudo pragma. */
14705 {
14709 }
14712 {
14713 /* Start global module fragment. */
14718 }
14723 {
14731 {
14734 }
14735 else
14737 "private module fragment only permitted in purview"
14739 }
14741 {
14742 /* Neither the first declaration, nor in a GMF. */
14745 skip_eol:
14747 }
14748 else
14749 {
14759 }
14762 }
14764 /* Import-declaration
14765 [__export] __import module-name attr-spec-seq-opt ; PRAGMA_EOL */
14767 static void
14770 {
14771 /* We're a pseudo pragma. */
14776 {
14779 note_lexer:
14781 " disambiguation, to prevent this being considered a"
14783 skip_eol:
14785 }
14787 {
14790 }
14791 else
14792 {
14805 {
14806 /* Module-purview imports must not be from source inclusion
14807 [cpp.import]/7 */
14816 }
14819 }
14820 }
14822 /* export-declaration.
14824 export declaration
14825 export { declaration-seq-opt } */
14827 static void
14829 {
14848 {
14855 }
14856 else
14857 {
14858 /* Explicitly check if the next tokens might be a
14859 module-directive line, so we can give a clearer error message
14860 about why the directive will be rejected. */
14867 }
14870 }
14872 /* Declarations [gram.dcl.dcl] */
14874 /* Parse an optional declaration-sequence. TOP_LEVEL is true, if this
14875 is the top-level declaration sequence. That affects whether we
14876 deal with module-preamble.
14878 declaration-seq:
14879 declaration
14880 declaration-seq declaration */
14882 static void
14884 {
14886 {
14892 else
14894 }
14895 }
14897 /* Parse a declaration.
14899 declaration:
14900 block-declaration
14901 function-definition
14902 template-declaration
14903 explicit-instantiation
14904 explicit-specialization
14905 linkage-specification
14906 namespace-definition
14908 C++17:
14909 deduction-guide
14911 modules:
14912 (all these are only allowed at the outermost level, check
14913 that semantically, for better diagnostics)
14914 module-declaration
14915 module-export-declaration
14916 module-import-declaration
14917 export-declaration
14919 GNU extension:
14921 declaration:
14922 __extension__ declaration */
14924 static void
14926 {
14929 /* Check for the `__extension__' keyword. */
14931 {
14932 /* Parse the qualified declaration. */
14934 /* Restore the PEDANTIC flag. */
14938 }
14940 /* Try to figure out what kind of declaration is present. */
14946 {
14948 /* A declaration consisting of a single semicolon is invalid
14949 * before C++11. Allow it unless we're being pedantic. */
14953 }
14957 CPP_SEMICOLON))
14958 {
14963 {
14966 std_attrs);
14968 {
14971 {
14973 CPP_PRAGMA));
14975 }
14977 }
14978 }
14986 }
14988 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14993 /* Conditionally, allow attributes to precede a linkage specification. */
14995 {
15003 {
15005 /* We might have already been here. */
15007 {
15015 }
15018 }
15019 else
15020 {
15023 }
15024 }
15025 /* If we already had some attributes, and we've added more, then prepend.
15026 Otherwise attributes just contains any that we just read. */
15028 {
15032 }
15034 /* If the next token is `extern' and the following token is a string
15035 literal, then we have a linkage specification. */
15039 /* If the next token is `template', then we have either a template
15040 declaration, an explicit instantiation, or an explicit
15041 specialization. */
15043 {
15044 /* `template <>' indicates a template specialization. */
15048 /* `template <' indicates a template declaration. */
15051 /* Anything else must be an explicit instantiation. */
15052 else
15054 }
15055 /* If the next token is `export', it's new-style modules or
15056 old-style template. */
15058 {
15061 else
15063 }
15065 {
15070 // In module purview this will be ill-formed.
15076 else
15078 }
15079 /* If the next token is `extern', 'static' or 'inline' and the one
15080 after that is `template', we have a GNU extended explicit
15081 instantiation directive. */
15088 /* If the next token is `namespace', check for a named or unnamed
15089 namespace definition. */
15098 /* An unnamed namespace definition. */
15102 /* An inline (associated) namespace definition. */
15106 /* Objective-C++ declaration/definition. */
15113 /* At this point we may have a template declared by a concept
15114 introduction. */
15119 else
15120 /* Try to parse a block-declaration, or a function-definition. */
15123 /* Free any declarators allocated. */
15125 }
15127 /* Parse a namespace-scope declaration. */
15129 static void
15131 {
15135 /* A top-level declaration can consist solely of a #pragma. A
15136 nested declaration cannot, so this is done here and not in
15137 cp_parser_declaration. (A #pragma at block scope is
15138 handled in cp_parser_statement.) */
15140 else
15141 /* Parse the declaration itself. */
15143 }
15145 /* Parse a block-declaration.
15147 block-declaration:
15148 simple-declaration
15149 asm-definition
15150 namespace-alias-definition
15151 using-declaration
15152 using-directive
15154 GNU Extension:
15156 block-declaration:
15157 __extension__ block-declaration
15159 C++0x Extension:
15161 block-declaration:
15162 static_assert-declaration
15164 If STATEMENT_P is TRUE, then this block-declaration is occurring as
15165 part of a declaration-statement. */
15167 static void
15170 {
15173 /* Check for the `__extension__' keyword. */
15175 {
15176 /* Parse the qualified declaration. */
15178 /* Restore the PEDANTIC flag. */
15182 }
15184 /* Peek at the next token to figure out which kind of declaration is
15185 present. */
15189 /* If the next keyword is `asm', we have an asm-definition. */
15191 {
15195 }
15196 /* If the next keyword is `namespace', we have a
15197 namespace-alias-definition. */
15200 /* If the next keyword is `using', we have a
15201 using-declaration, a using-directive, or an alias-declaration. */
15203 {
15208 /* If the token after `using' is `namespace', then we have a
15209 using-directive. */
15215 /* If the second token after 'using' is '=', then we have an
15216 alias-declaration. */
15222 /* Otherwise, it's a using-declaration. */
15223 else
15226 }
15227 /* If the next keyword is `__label__' we have a misplaced label
15228 declaration. */
15230 {
15234 /* If the next token is now a `;', consume it. */
15237 }
15238 /* If the next token is `static_assert' we have a static assertion. */
15241 /* If the next tokens after attributes is `using namespace', then we have
15242 a using-directive. */
15245 RID_USING)
15247 RID_NAMESPACE))
15248 {
15252 }
15253 /* Anything else must be a simple-declaration. */
15254 else
15257 }
15259 /* Parse a simple-declaration.
15261 simple-declaration:
15262 decl-specifier-seq [opt] init-declarator-list [opt] ;
15263 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15264 brace-or-equal-initializer ;
15266 init-declarator-list:
15267 init-declarator
15268 init-declarator-list , init-declarator
15270 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
15271 function-definition as a simple-declaration.
15273 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15274 parsed declaration if it is an uninitialized single declarator not followed
15275 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15276 if present, will not be consumed. */
15278 static void
15282 {
15283 cp_decl_specifier_seq decl_specifiers;
15292 /* Defer access checks until we know what is being declared; the
15293 checks for names appearing in the decl-specifier-seq should be
15294 done as if we were in the scope of the thing being declared. */
15297 /* Parse the decl-specifier-seq. We have to keep track of whether
15298 or not the decl-specifier-seq declares a named class or
15299 enumeration type, since that is the only case in which the
15300 init-declarator-list is allowed to be empty.
15302 [dcl.dcl]
15304 In a simple-declaration, the optional init-declarator-list can be
15305 omitted only when declaring a class or enumeration, that is when
15306 the decl-specifier-seq contains either a class-specifier, an
15307 elaborated-type-specifier, or an enum-specifier. */
15309 CP_PARSER_FLAGS_OPTIONAL,
15312 /* We no longer need to defer access checks. */
15315 cp_omp_declare_simd_data odsd;
15321 /* In a block scope, a valid declaration must always have a
15322 decl-specifier-seq. By not trying to parse declarators, we can
15323 resolve the declaration/expression ambiguity more quickly. */
15326 {
15329 }
15331 /* If the next two tokens are both identifiers, the code is
15332 erroneous. The usual cause of this situation is code like:
15334 T t;
15336 where "T" should name a type -- but does not. */
15339 {
15340 /* If parsing tentatively, we should commit; we really are
15341 looking at a declaration. */
15343 /* Give up. */
15345 }
15349 /* Look for C++17 decomposition declaration. */
15357 {
15358 tree decl
15360 maybe_range_for_decl,
15363 /* The next token should be either a `,' or a `;'. */
15365 /* If it's a `;', we are done. */
15369 {
15373 }
15374 /* Anything else is an error. */
15375 else
15376 {
15377 /* If we have already issued an error message we don't need
15378 to issue another one. */
15383 /* Skip tokens until we reach the end of the statement. */
15385 /* If the next token is now a `;', consume it. */
15389 }
15390 }
15391 else
15394 tree last_type;
15396 /* NULL_TREE if both variable and function declaration are allowed,
15397 error_mark_node if function declaration are not allowed and
15398 a FUNCTION_DECL that should be diagnosed if it is followed by
15399 variable declarations. */
15400 tree auto_function_declaration;
15403 auto_specifier_p
15407 /* Keep going until we hit the `;' at the end of the simple
15408 declaration. */
15411 CPP_SEMICOLON))
15412 {
15415 tree decl;
15419 {
15420 /* If we are processing next declarator, comma is expected */
15425 {
15429 }
15430 }
15431 else
15434 /* Parse the init-declarator. */
15436 CP_PARSER_FLAGS_NONE,
15439 function_definition_allowed_p,
15441 declares_class_or_enum,
15443 maybe_range_for_decl,
15446 /* If an error occurred while parsing tentatively, exit quickly.
15447 (That usually happens when in the body of a function; each
15448 statement is treated as a declaration-statement until proven
15449 otherwise.) */
15454 {
15455 /* If the init-declarator-list contains more than one
15456 init-declarator, they shall all form declarations of
15457 variables. */
15459 auto_function_declaration
15463 {
15465 "non-variable %qD in declaration with more than one "
15470 }
15471 }
15475 {
15479 {
15480 /* If the list of declarators contains more than one declarator,
15481 the type of each declared variable is determined as described
15482 above. If the type deduced for the template parameter U is not
15483 the same in each deduction, the program is ill-formed. */
15488 }
15489 else
15491 }
15493 /* Handle function definitions specially. */
15495 {
15496 /* If the next token is a `,', then we are probably
15497 processing something like:
15499 void f() {}, *p;
15501 which is erroneous. */
15503 {
15506 "mixing"
15508 }
15509 /* Otherwise, we're done with the list of declarators. */
15510 else
15511 {
15515 }
15516 }
15519 /* The next token should be either a `,' or a `;'. */
15521 /* If it's a `,', there are more declarators to come. */
15524 /* If it's a `;', we are done. */
15528 {
15533 }
15534 /* Anything else is an error. */
15535 else
15536 {
15537 /* If we have already issued an error message we don't need
15538 to issue another one. */
15543 /* Skip tokens until we reach the end of the statement. */
15545 /* If the next token is now a `;', consume it. */
15549 }
15550 /* After the first time around, a function-definition is not
15551 allowed -- even if it was OK at first. For example:
15553 int i, f() {}
15555 is not valid. */
15557 }
15559 /* Issue an error message if no declarators are present, and the
15560 decl-specifier-seq does not itself declare a class or
15561 enumeration: [dcl.dcl]/3. */
15563 {
15565 {
15569 /* Ensure an error is issued anyway when finish_decltype_type,
15570 called via cp_parser_decl_specifier_seq, returns a class or
15571 an enumeration (c++/51786). */
15574 }
15575 /* Perform any deferred access checks. */
15577 }
15579 /* Consume the `;'. */
15580 finish:
15584 {
15590 }
15592 done:
15595 }
15597 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
15598 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15599 initializer ; */
15601 static tree
15606 {
15611 /* Parse the identifier-list. */
15615 {
15623 }
15627 {
15633 else
15634 {
15637 }
15638 }
15642 "structured bindings only available with "
15645 tree pushed_scope;
15652 NULL_TREE);
15659 cp_expr e;
15660 cp_decl_specifier_seq decl_specs;
15665 {
15669 else
15670 {
15673 }
15674 tree elt_pushed_scope;
15680 {
15681 /* Ensure we've diagnosed redeclaration if we aren't creating
15682 a new VAR_DECL. */
15685 }
15686 else
15690 }
15693 {
15696 }
15700 {
15708 || (is_direct_init
15711 {
15715 }
15718 {
15723 }
15724 }
15726 {
15728 /* Ensure DECL_VALUE_EXPR is created for all the decls but
15729 the underlying DECL. */
15731 }
15737 {
15740 }
15743 }
15745 /* Names of storage classes. */
15748 cp_storage_class_name[] = {
15750 };
15752 /* Parse a decl-specifier-seq.
15754 decl-specifier-seq:
15755 decl-specifier-seq [opt] decl-specifier
15756 decl-specifier attribute-specifier-seq [opt] (C++11)
15758 decl-specifier:
15759 storage-class-specifier
15760 type-specifier
15761 function-specifier
15762 friend
15763 typedef
15765 GNU Extension:
15767 decl-specifier:
15768 attributes
15770 Concepts Extension:
15772 decl-specifier:
15773 concept
15775 Set *DECL_SPECS to a representation of the decl-specifier-seq.
15777 The parser flags FLAGS is used to control type-specifier parsing.
15779 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
15780 flags:
15782 1: one of the decl-specifiers is an elaborated-type-specifier
15783 (i.e., a type declaration)
15784 2: one of the decl-specifiers is an enum-specifier or a
15785 class-specifier (i.e., a type definition)
15787 */
15789 static void
15791 cp_parser_flags flags,
15794 {
15798 cp_decl_spec ds;
15800 /* Clear DECL_SPECS. */
15803 /* Assume no class or enumeration type is declared. */
15806 /* Keep reading specifiers until there are no more to read. */
15808 {
15813 /* Peek at the next token. */
15816 /* Save the first token of the decl spec list for error
15817 reporting. */
15820 /* Handle attributes. */
15823 {
15824 /* Parse the attributes. */
15827 /* In a sequence of declaration specifiers, c++11 attributes
15828 appertain to the type that precede them. In that case
15829 [dcl.spec]/1 says:
15831 The attribute-specifier-seq affects the type only for
15832 the declaration it appears in, not other declarations
15833 involving the same type.
15835 But for now let's force the user to position the
15836 attribute either at the beginning of the declaration or
15837 after the declarator-id, which would clearly mean that it
15838 applies to the declarator. */
15840 {
15842 /* The c++11 attribute is at the beginning of the
15843 declaration. It appertains to the entity being
15845 else
15846 {
15848 {
15851 }
15853 {
15854 /* This is an attribute following a
15855 class-specifier. */
15860 }
15861 else
15862 {
15863 decl_specs->std_attributes
15867 }
15869 }
15870 }
15872 decl_specs->attributes
15877 }
15878 /* Assume we will find a decl-specifier keyword. */
15880 /* If the next token is an appropriate keyword, we can simply
15881 add it to the list. */
15883 {
15884 /* decl-specifier:
15885 friend
15886 constexpr
15887 constinit */
15890 {
15895 }
15896 else
15897 {
15899 /* Consume the token. */
15901 }
15926 /* Warn for concept as a decl-specifier. We'll rewrite these as
15927 concept declarations later. */
15929 {
15934 else
15937 }
15939 /* In C++20 a concept definition is just 'concept name = expr;'
15940 Support that syntax as a TS extension by pretending we've seen
15941 the 'bool' specifier. */
15945 {
15949 }
15952 /* function-specifier:
15953 inline
15954 virtual
15955 explicit */
15962 /* decl-specifier:
15963 typedef */
15966 /* Consume the token. */
15972 /* A constructor declarator cannot appear in a typedef. */
15974 /* The "typedef" keyword can only occur in a declaration; we
15975 may as well commit at this point. */
15979 {
15989 }
15992 /* storage-class-specifier:
15993 auto
15994 register
15995 static
15996 extern
15997 mutable
15999 GNU Extension:
16000 thread */
16003 {
16004 /* Consume the token. */
16007 /* Complain about `auto' as a storage specifier, if
16008 we're complaining about C++0x compatibility. */
16012 "%<auto%> changes meaning in C++11; "
16015 /* Set the storage class anyway. */
16017 token);
16018 }
16019 else
16020 /* C++0x auto type-specifier. */
16028 /* Consume the token. */
16031 token);
16034 /* Consume the token. */
16040 /* We did not yet find a decl-specifier yet. */
16043 }
16055 {
16061 "%qD only valid in lambda with %<-std=c++23%> or "
16063 }
16068 /* Constructors are a special case. The `S' in `S()' is not a
16069 decl-specifier; it is the beginning of the declarator. */
16070 constructor_p
16071 = (!found_decl_spec
16072 && constructor_possible_p
16073 && (cp_parser_constructor_declarator_p
16075 ds_friend))));
16077 /* If we don't have a DECL_SPEC yet, then we must be looking at
16078 a type-specifier. */
16080 {
16083 tree type_spec;
16088 type_spec
16090 decl_specs,
16096 /* If this type-specifier referenced a user-defined type
16097 (a typedef, class-name, etc.), then we can't allow any
16098 more such type-specifiers henceforth.
16100 [dcl.spec]
16102 The longest sequence of decl-specifiers that could
16103 possibly be a type name is taken as the
16104 decl-specifier-seq of a declaration. The sequence shall
16105 be self-consistent as described below.
16107 [dcl.type]
16109 As a general rule, at most one type-specifier is allowed
16110 in the complete decl-specifier-seq of a declaration. The
16111 only exceptions are the following:
16113 -- const or volatile can be combined with any other
16114 type-specifier.
16116 -- signed or unsigned can be combined with char, long,
16117 short, or int.
16119 -- ..
16121 Example:
16123 typedef char* Pc;
16124 void g (const int Pc);
16126 Here, Pc is *not* part of the decl-specifier seq; it's
16127 the declarator. Therefore, once we see a type-specifier
16128 (other than a cv-qualifier), we forbid any additional
16129 user-defined types. We *do* still allow things like `int
16130 int' to be considered a decl-specifier-seq, and issue the
16131 error message later. */
16134 /* A constructor declarator cannot follow a type-specifier. */
16136 {
16144 }
16145 }
16147 /* If we still do not have a DECL_SPEC, then there are no more
16148 decl-specifiers. */
16153 {
16157 "standard attributes must precede the decl-specifiers to "
16158 "apply to the declaration, or follow them to apply to "
16160 }
16163 /* After we see one decl-specifier, further decl-specifiers are
16164 always optional. */
16166 }
16168 /* Don't allow a friend specifier with a class definition. */
16173 }
16175 /* Parse an (optional) storage-class-specifier.
16177 storage-class-specifier:
16178 auto
16179 register
16180 static
16181 extern
16182 mutable
16184 GNU Extension:
16186 storage-class-specifier:
16187 thread
16189 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
16191 static tree
16193 {
16195 {
16199 /* Fall through for C++98. */
16207 /* Consume the token. */
16212 }
16213 }
16215 /* Parse an (optional) function-specifier.
16217 function-specifier:
16218 inline
16219 virtual
16220 explicit
16222 C++20 Extension:
16223 explicit(constant-expression)
16225 Returns an IDENTIFIER_NODE corresponding to the keyword used.
16226 Updates DECL_SPECS, if it is non-NULL. */
16228 static tree
16231 {
16234 {
16240 /* 14.5.2.3 [temp.mem]
16242 A member function template shall not be virtual. */
16246 else
16251 {
16253 /* If we see '(', it's C++20 explicit(bool). */
16254 tree expr;
16256 {
16257 matching_parens parens;
16260 /* New types are not allowed in an explicit-specifier. */
16263 parser->type_definition_forbidden_message
16268 "%<explicit(bool)%> only available with %<-std=c++20%> "
16271 /* Parse the constant-expression. */
16274 /* Restore the saved message. */
16277 }
16278 else
16279 /* The explicit-specifier explicit without a constant-expression is
16280 equivalent to the explicit-specifier explicit(true). */
16283 /* [dcl.fct.spec]
16284 "the constant-expression, if supplied, shall be a contextually
16285 converted constant expression of type bool." */
16287 /* We could evaluate it -- mark the decl as appropriate. */
16293 /* The expression was value-dependent. Remember it so that we can
16294 substitute it later. */
16297 }
16301 }
16303 /* Consume the token. */
16305 }
16307 /* Parse a linkage-specification.
16309 linkage-specification:
16310 extern string-literal { declaration-seq [opt] }
16311 extern string-literal declaration */
16313 static void
16315 {
16316 /* Look for the `extern' keyword. */
16317 cp_token *extern_token
16320 /* Look for the string-literal. */
16325 /* Transform the literal into an identifier. If the literal is a
16326 wide-character string, or contains embedded NULs, then we can't
16327 handle it as the user wants. */
16331 {
16333 /* Assume C++ linkage. */
16335 }
16336 else
16339 /* We're now using the new linkage. */
16344 /* Preserve the location of the innermost linkage specification,
16345 tracking the locations of nested specifications via a local. */
16346 location_t saved_location
16348 /* Construct a location ranging from the start of the "extern" to
16349 the end of the string-literal, with the caret at the start, e.g.:
16350 extern "C" {
16351 ^~~~~~~~~~
16352 */
16353 parser->innermost_linkage_specification_location
16358 /* If the next token is a `{', then we're using the first
16359 production. */
16361 {
16365 /* Consume the `{' token. */
16366 matching_braces braces;
16368 /* Parse the declarations. */
16370 /* Look for the closing `}'. */
16372 }
16373 /* Otherwise, there's just one declaration. */
16374 else
16375 {
16378 saved_in_unbraced_linkage_specification_p
16382 parser->in_unbraced_linkage_specification_p
16384 }
16386 /* We're done with the linkage-specification. */
16390 /* Restore location of parent linkage specification, if any. */
16392 }
16394 /* Parse a static_assert-declaration.
16396 static_assert-declaration:
16397 static_assert ( constant-expression , string-literal ) ;
16398 static_assert ( constant-expression ) ; (C++17)
16400 If MEMBER_P, this static_assert is a class member. */
16402 static void
16404 {
16405 cp_expr condition;
16406 location_t token_loc;
16407 tree message;
16410 /* Peek at the `static_assert' token so we can keep track of exactly
16411 where the static assertion started. */
16414 /* Look for the `static_assert' keyword. */
16416 RT_STATIC_ASSERT))
16419 /* We know we are in a static assertion; commit to any tentative
16420 parse. */
16424 /* Parse the `(' starting the static assertion condition. */
16425 matching_parens parens;
16428 /* Parse the constant-expression. Allow a non-constant expression
16429 here in order to give better diagnostics in finish_static_assert. */
16430 condition =
16436 {
16439 "%<static_assert%> without a message "
16441 /* Eat the ')' */
16446 }
16447 else
16448 {
16449 /* Parse the separating `,'. */
16452 /* Parse the string-literal message. */
16456 /* A `)' completes the static assertion. */
16462 }
16464 /* A semicolon terminates the declaration. */
16467 /* Get the location for the static assertion. Use that of the
16468 condition if available, otherwise, use that of the "static_assert"
16469 token. */
16474 /* Complete the static assertion, which may mean either processing
16475 the static assert now or saving it for template instantiation. */
16478 }
16480 /* Parse the expression in decltype ( expression ). */
16482 static tree
16485 {
16487 tree expr;
16489 /* First, try parsing an id-expression. */
16500 {
16503 cp_id_kind idk;
16507 /* Lookup the name we got back from the id-expression. */
16512 /* A template without args is not a complete id-expression. */
16521 {
16522 /* Complete lookup of the id-expression. */
16523 expr = (finish_id_expression
16536 /* We found an id-expression, but it was something that we
16537 should not have found. This is an error, not something
16538 we can recover from, so note that we found an
16539 id-expression and we'll recover as gracefully as
16540 possible. */
16542 }
16547 /* We have an id-expression. */
16549 }
16552 {
16553 /* Abort the id-expression parse. */
16556 /* Parsing tentatively, again. */
16559 /* Parse a class member access. */
16567 /* We have an id-expression. */
16569 }
16572 /* We have parsed the complete id-expression or member access. */
16574 else
16575 {
16576 /* Abort our attempt to parse an id-expression or member access
16577 expression. */
16580 /* Parse a full expression. */
16583 }
16586 }
16588 /* Parse a `decltype' type. Returns the type.
16590 decltype-specifier:
16591 decltype ( expression )
16592 C++14:
16593 decltype ( auto ) */
16595 static tree
16597 {
16602 {
16603 /* Already parsed. */
16606 }
16608 /* Look for the `decltype' token. */
16612 /* Parse the opening `('. */
16613 matching_parens parens;
16617 /* Since we're going to preserve any side-effects from this parse, set up a
16618 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16619 in the expression. */
16622 /* If in_declarator_p, a reparse as an expression might succeed (60361).
16623 Otherwise, commit now for better diagnostics. */
16634 {
16635 /* decltype (auto) */
16638 {
16640 "%<decltype(auto)%> type specifier only available with "
16643 }
16644 }
16645 else
16646 {
16647 /* decltype (expression) */
16649 /* Types cannot be defined in a `decltype' expression. Save away the
16650 old message and set the new one. */
16652 parser->type_definition_forbidden_message
16655 /* The restrictions on constant-expressions do not apply inside
16656 decltype expressions. */
16657 bool saved_integral_constant_expression_p
16659 bool saved_non_integral_constant_expression_p
16663 /* Within a parenthesized expression, a `>' token is always
16664 the greater-than operator. */
16665 bool saved_greater_than_is_operator_p
16669 /* Don't synthesize an implicit template type parameter here. This
16670 could happen with C++23 code like
16672 void f(decltype(new auto{0}));
16674 where we want to deduce the auto right away so that the parameter
16675 is of type 'int *'. */
16679 /* Do not actually evaluate the expression. */
16682 /* Do not warn about problems with the expression. */
16688 /* Go back to evaluating expressions. */
16692 /* The `>' token might be the end of a template-id or
16693 template-parameter-list now. */
16694 parser->greater_than_is_operator_p
16697 /* Restore the old message and the integral constant expression
16698 flags. */
16700 parser->integral_constant_expression_p
16702 parser->non_integral_constant_expression_p
16704 }
16706 /* Parse to the closing `)'. */
16708 {
16712 }
16714 /* If we got a parse error while tentative, bail out now. */
16716 {
16719 }
16722 /* Build auto. */
16724 else
16726 tf_warning_or_error);
16728 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
16729 it again. */
16746 }
16748 /* Special member functions [gram.special] */
16750 /* Parse a conversion-function-id.
16752 conversion-function-id:
16753 operator conversion-type-id
16755 Returns an IDENTIFIER_NODE representing the operator. */
16757 static tree
16759 {
16760 tree type;
16761 tree saved_scope;
16762 tree saved_qualifying_scope;
16763 tree saved_object_scope;
16766 /* Look for the `operator' token. */
16769 /* When we parse the conversion-type-id, the current scope will be
16770 reset. However, we need that information in able to look up the
16771 conversion function later, so we save it here. */
16775 /* We must enter the scope of the class so that the names of
16776 entities declared within the class are available in the
16777 conversion-type-id. For example, consider:
16779 struct S {
16780 typedef int I;
16781 operator I();
16782 };
16784 S::operator I() { ... }
16786 In order to see that `I' is a type-name in the definition, we
16787 must be in the scope of `S'. */
16790 /* Parse the conversion-type-id. */
16792 /* Leave the scope of the class, if any. */
16795 /* Restore the saved scope. */
16799 /* If the TYPE is invalid, indicate failure. */
16803 }
16805 /* Parse a conversion-type-id:
16807 conversion-type-id:
16808 type-specifier-seq conversion-declarator [opt]
16810 Returns the TYPE specified. */
16812 static tree
16814 {
16815 tree attributes;
16816 cp_decl_specifier_seq type_specifiers;
16818 tree type_specified;
16821 /* Parse the attributes. */
16825 parser->type_definition_forbidden_message
16828 /* Parse the type-specifiers. DR 2413 clarifies that `typename' is
16829 optional in conversion-type-id. */
16837 /* If that didn't work, stop. */
16840 /* Parse the conversion-declarator. */
16848 /* Don't give this error when parsing tentatively. This happens to
16849 work because we always parse this definitively once. */
16852 {
16854 {
16857 }
16861 }
16864 }
16866 /* Parse an (optional) conversion-declarator.
16868 conversion-declarator:
16869 ptr-operator conversion-declarator [opt]
16871 */
16875 {
16878 cp_cv_quals cv_quals;
16880 /* We don't know if there's a ptr-operator next, or not. */
16882 /* Try the ptr-operator. */
16885 /* If it worked, look for more conversion-declarators. */
16887 {
16890 /* Parse another optional declarator. */
16893 declarator = cp_parser_make_indirect_declarator
16897 }
16900 }
16902 /* Parse an (optional) ctor-initializer.
16904 ctor-initializer:
16905 : mem-initializer-list */
16907 static void
16909 {
16910 /* If the next token is not a `:', then there is no
16911 ctor-initializer. */
16913 {
16914 /* Do default initialization of any bases and members. */
16918 }
16920 /* Consume the `:' token. */
16922 /* And the mem-initializer-list. */
16924 }
16926 /* Parse a mem-initializer-list.
16928 mem-initializer-list:
16929 mem-initializer ... [opt]
16930 mem-initializer ... [opt] , mem-initializer-list */
16932 static void
16934 {
16939 /* Let the semantic analysis code know that we are starting the
16940 mem-initializer-list. */
16945 /* Loop through the list. */
16947 {
16948 tree mem_initializer;
16951 /* Parse the mem-initializer. */
16953 /* If the next token is a `...', we're expanding member initializers. */
16959 {
16960 /* Consume the `...'. */
16964 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
16965 can be expanded but members cannot. */
16968 {
16973 }
16975 /* Construct the pack expansion type. */
16978 }
16981 {
16985 }
16986 /* Look for a target constructor. */
16990 {
16993 {
16997 }
16999 }
17000 /* Add it to the list, unless it was erroneous. */
17002 {
17005 }
17006 /* If the next token is not a `,', we're done. */
17009 /* Consume the `,' token. */
17011 }
17013 /* Perform semantic analysis. */
17016 }
17018 /* Parse a mem-initializer.
17020 mem-initializer:
17021 mem-initializer-id ( expression-list [opt] )
17022 mem-initializer-id braced-init-list
17024 GNU extension:
17026 mem-initializer:
17027 ( expression-list [opt] )
17029 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
17030 class) or FIELD_DECL (for a non-static data member) to initialize;
17031 the TREE_VALUE is the expression-list. An empty initialization
17032 list is represented by void_list_node. */
17034 static tree
17036 {
17037 tree mem_initializer_id;
17038 tree expression_list;
17039 tree member;
17042 /* Find out what is being initialized. */
17044 {
17048 }
17049 else
17050 {
17054 }
17060 {
17067 }
17068 else
17069 {
17081 }
17094 /* We can't attach the source location of this initializer directly to
17095 the list node, so we instead attach it to a dummy EMPTY_CLASS_EXPR
17096 within the TREE_TYPE of the list node. */
17097 location_t loc
17104 }
17106 /* Parse a mem-initializer-id.
17108 mem-initializer-id:
17109 :: [opt] nested-name-specifier [opt] class-name
17110 decltype-specifier (C++11)
17111 identifier
17113 Returns a TYPE indicating the class to be initialized for the first
17114 production (and the second in C++11). Returns an IDENTIFIER_NODE
17115 indicating the data member to be initialized for the last production. */
17117 static tree
17119 {
17123 tree id;
17127 /* `typename' is not allowed in this context ([temp.res]). */
17129 {
17131 "keyword %<typename%> not allowed in this context (a qualified "
17134 }
17135 /* Look for the optional `::' operator. */
17136 global_scope_p
17140 /* Look for the optional nested-name-specifier. The simplest way to
17141 implement:
17143 [temp.res]
17145 The keyword `typename' is not permitted in a base-specifier or
17146 mem-initializer; in these contexts a qualified name that
17147 depends on a template-parameter is implicitly assumed to be a
17148 type name.
17150 is to assume that we have seen the `typename' keyword at this
17151 point. */
17152 nested_name_specifier_p
17161 /* If there is a `::' operator or a nested-name-specifier, then we
17162 are definitely looking for a class-name. */
17167 typename_type,
17171 /* Otherwise, we could also be looking for an ordinary identifier. */
17174 /* Try a decltype-specifier. */
17176 else
17177 /* Otherwise, try a class-name. */
17181 none_type,
17185 /* If we found one, we're done. */
17188 /* Otherwise, look for an ordinary identifier. */
17190 }
17192 /* Overloading [gram.over] */
17194 /* Parse an operator-function-id.
17196 operator-function-id:
17197 operator operator
17199 Returns an IDENTIFIER_NODE for the operator which is a
17200 human-readable spelling of the identifier, e.g., `operator +'. */
17202 static cp_expr
17204 {
17206 /* Look for the `operator' keyword. */
17209 /* And then the name of the operator itself. */
17211 }
17213 /* Return an identifier node for a user-defined literal operator.
17214 The suffix identifier is chained to the operator name identifier. */
17216 tree
17218 {
17219 tree identifier;
17227 }
17229 /* Parse an operator.
17231 operator:
17232 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
17233 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
17234 || ++ -- , ->* -> () []
17236 GNU Extensions:
17238 operator:
17239 <? >? <?= >?=
17241 Returns an IDENTIFIER_NODE for the operator which is a
17242 human-readable spelling of the identifier, e.g., `operator +'. */
17244 static cp_expr
17246 {
17251 /* Peek at the next token. */
17256 /* Figure out which operator we have. */
17261 {
17263 {
17264 /* The keyword should be either `new', `delete' or `co_await'. */
17271 else
17274 /* Consume the `new', `delete' or co_await token. */
17277 /* Peek at the next token. */
17279 /* If it's a `[' token then this is the array variant of the
17280 operator. */
17283 {
17284 /* Consume the `[' token. */
17286 /* Look for the `]' token. */
17291 }
17294 }
17457 /* Consume the `?'. */
17459 /* Look for the matching `:'. */
17465 {
17466 /* Consume the `('. */
17467 matching_parens parens;
17469 /* Look for the matching `)'. */
17476 }
17479 /* Consume the `['. */
17481 /* Look for the matching `]'. */
17492 /* FALLTHRU */
17501 {
17502 tree string_tree;
17508 /* Consume the string. */
17514 {
17518 }
17519 else
17520 {
17522 /* Look for the suffix identifier. */
17525 {
17528 }
17530 {
17534 }
17535 else
17536 {
17539 }
17540 }
17545 {
17548 }
17551 {
17554 }
17556 {
17559 }
17560 /* Generate a location of the form:
17561 "" _suffix_identifier
17562 ^~~~~~~~~~~~~~~~~~~~~
17563 with caret == start at the start token, finish at the end of the
17564 suffix identifier. */
17565 location_t combined_loc
17568 }
17571 /* Anything else is an error. */
17573 }
17575 /* If we have selected an identifier, we need to consume the
17576 operator token. */
17578 {
17582 }
17583 /* Otherwise, no valid operator name was present. */
17584 else
17585 {
17588 }
17592 }
17594 /* Parse a template-declaration.
17596 template-declaration:
17597 export [opt] template < template-parameter-list > declaration
17599 If MEMBER_P is TRUE, this template-declaration occurs within a
17600 class-specifier.
17602 The grammar rule given by the standard isn't correct. What
17603 is really meant is:
17605 template-declaration:
17606 export [opt] template-parameter-list-seq
17607 decl-specifier-seq [opt] init-declarator [opt] ;
17608 export [opt] template-parameter-list-seq
17609 function-definition
17611 template-parameter-list-seq:
17612 template-parameter-list-seq [opt]
17613 template < template-parameter-list >
17615 Concept Extensions:
17617 template-parameter-list-seq:
17618 template < template-parameter-list > requires-clause [opt]
17620 requires-clause:
17621 requires logical-or-expression */
17623 static void
17625 {
17626 /* Check for `export'. */
17628 {
17629 /* Consume the `export' token. */
17631 /* Warn that this use of export is deprecated. */
17636 else
17638 }
17641 }
17643 /* Parse a template-parameter-list.
17645 template-parameter-list:
17646 template-parameter
17647 template-parameter-list , template-parameter
17649 Returns a TREE_LIST. Each node represents a template parameter.
17650 The nodes are connected via their TREE_CHAINs. */
17652 static tree
17654 {
17657 /* Don't create wrapper nodes within a template-parameter-list,
17658 since we don't want to have different types based on the
17659 spelling location of constants and decls within them. */
17660 auto_suppress_location_wrappers sentinel;
17664 /* The loop below parses the template parms. We first need to know
17665 the total number of template parms to be able to compute proper
17666 canonical types of each dependent type. So after the loop, when
17667 we know the total number of template parms,
17668 end_template_parm_list computes the proper canonical types and
17669 fixes up the dependent types accordingly. */
17671 {
17672 tree parameter;
17675 location_t parm_loc;
17677 /* Parse the template-parameter. */
17682 /* Add it to the list. */
17685 parm_loc,
17686 parameter,
17687 is_non_type,
17688 is_parameter_pack);
17689 else
17690 {
17693 }
17695 /* If the next token is not a `,', we're done. */
17698 /* Otherwise, consume the `,' token. */
17700 }
17703 }
17705 /* Parse a introduction-list.
17707 introduction-list:
17708 introduced-parameter
17709 introduction-list , introduced-parameter
17711 introduced-parameter:
17712 ...[opt] identifier
17714 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
17715 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
17716 WILDCARD_DECL will also have DECL_NAME set and token location in
17717 DECL_SOURCE_LOCATION. */
17719 static tree
17721 {
17725 {
17734 /* Build placeholder. */
17742 /* If the next token is not a `,', we're done. */
17745 /* Otherwise, consume the `,' token. */
17747 }
17749 /* Convert the vec into a TREE_VEC. */
17752 tree parm;
17758 }
17760 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
17761 is an abstract declarator. */
17765 {
17770 }
17772 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
17773 is an abstract declarator. */
17777 {
17781 else
17783 }
17785 /* Returns true if TYPE would declare a constrained constrained-parameter. */
17789 {
17794 }
17796 /* Returns true if PARM declares a constrained-parameter. */
17800 {
17802 }
17804 /* Check that the type parameter is only a declarator-id, and that its
17805 type is not cv-qualified. */
17807 bool
17810 {
17815 {
17818 }
17820 /* Don't allow cv-qualified type parameters. */
17823 {
17826 }
17829 }
17831 /* Finish parsing/processing a template type parameter and checking
17832 various restrictions. */
17836 tree id,
17838 {
17841 else
17843 }
17845 static tree
17847 {
17848 /* FIXME: This should probably be copied, and we may need to adjust
17849 the template parameter depths. */
17859 }
17861 /* Finish parsing/processing a template template parameter by borrowing
17862 the template parameter list from the prototype parameter. */
17864 static tree
17866 tree proto,
17867 tree id,
17869 {
17873 }
17875 /* Create a new non-type template parameter from the given PARM
17876 declarator. */
17878 static tree
17881 {
17887 }
17889 /* Build a constrained template parameter based on the PARMDECL
17890 declarator. The type of PARMDECL is the constrained type, which
17891 refers to the prototype template parameter that ultimately
17892 specifies the type of the declared parameter. */
17894 static tree
17898 {
17904 /* Build the parameter. Return an error if the declarator was invalid. */
17905 tree parm;
17910 parmdecl);
17911 else
17916 /* Finish the parameter decl and create a node attaching the
17917 default argument and constraint. */
17922 }
17924 /* Returns true if the parsed type actually represents the declaration
17925 of a type template-parameter. */
17927 static bool
17929 {
17932 }
17934 /* Returns true if the parsed type actually represents the declaration of
17935 a template template-parameter. */
17937 static bool
17939 {
17942 }
17944 /* Parse a default argument for a type template-parameter.
17945 Note that diagnostics are handled in cp_parser_template_parameter. */
17947 static tree
17949 {
17952 /* Consume the `=' token. */
17957 /* Tell cp_parser_lambda_expression this is a default argument. */
17961 /* Parse the default-argument. */
17964 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
17965 NULL);
17969 {
17973 }
17976 }
17978 /* Parse a default argument for a template template-parameter. */
17980 static tree
17982 {
17987 /* Consume the `='. */
17989 /* Parse the id-expression. */
17991 /* save token before parsing the id-expression, for error
17992 reporting */
17994 tree default_argument
18002 /* If the id-expression was a template-id that refers to
18003 a template-class, we already have the declaration here,
18004 so no further lookup is needed. */
18005 ;
18006 else
18007 /* Look up the name. */
18008 default_argument
18010 none_type,
18016 /* See if the default argument is valid. */
18020 }
18022 /* Parse a template-parameter.
18024 template-parameter:
18025 type-parameter
18026 parameter-declaration
18028 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
18029 the parameter. The TREE_PURPOSE is the default value, if any.
18030 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
18031 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
18032 set to true iff this parameter is a parameter pack. */
18034 static tree
18037 {
18040 tree parm;
18042 /* Assume it is a type parameter or a template parameter. */
18044 /* Assume it not a parameter pack. */
18046 /* Peek at the next token. */
18048 /* If it is `template', we have a type-parameter. */
18051 /* If it is `class' or `typename' we do not know yet whether it is a
18052 type parameter or a non-type parameter. Consider:
18054 template <typename T, typename T::X X> ...
18056 or:
18058 template <class C, class D*> ...
18060 Here, the first parameter is a type parameter, and the second is
18061 a non-type parameter. We can tell by looking at the token after
18062 the identifier -- if it is a `,', `=', or `>' then we have a type
18063 parameter. */
18065 {
18066 /* Peek at the token after `class' or `typename'. */
18068 /* If it's an ellipsis, we have a template type parameter
18069 pack. */
18072 /* If it's an identifier, skip it. */
18075 /* Now, see if the token looks like the end of a template
18076 parameter. */
18081 }
18083 /* Otherwise, it is a non-type parameter or a constrained parameter.
18085 [temp.param]
18087 When parsing a default template-argument for a non-type
18088 template-parameter, the first non-nested `>' is taken as the end
18089 of the template parameter-list rather than a greater-than
18090 operator. */
18091 parameter_declarator
18093 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18100 /* If the parameter declaration is marked as a parameter pack, set
18101 *IS_PARAMETER_PACK to notify the caller. */
18106 {
18107 /* Can happen in some cases of erroneous input (c++/34892). */
18109 /* Consume the `...' for better error recovery. */
18111 }
18113 /* The parameter may have been constrained type parameter. */
18116 parameter_declarator,
18117 is_non_type);
18119 // Now we're sure that the parameter is a non-type parameter.
18130 }
18132 /* Parse a type-parameter.
18134 type-parameter:
18135 class identifier [opt]
18136 class identifier [opt] = type-id
18137 typename identifier [opt]
18138 typename identifier [opt] = type-id
18139 template < template-parameter-list > class identifier [opt]
18140 template < template-parameter-list > class identifier [opt]
18141 = id-expression
18143 GNU Extension (variadic templates):
18145 type-parameter:
18146 class ... identifier [opt]
18147 typename ... identifier [opt]
18149 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
18150 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
18151 the declaration of the parameter.
18153 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
18155 static tree
18157 {
18159 tree parameter;
18161 /* Look for a keyword to tell us what kind of parameter this is. */
18167 {
18170 {
18171 tree identifier;
18172 tree default_argument;
18174 /* If the next token is an ellipsis, we have a template
18175 argument pack. */
18177 {
18178 /* Consume the `...' token. */
18183 }
18185 /* If the next token is an identifier, then it names the
18186 parameter. */
18189 else
18192 /* Create the parameter. */
18195 /* If the next token is an `=', we have a default argument. */
18197 {
18198 default_argument
18201 /* Template parameter packs cannot have default
18202 arguments. */
18204 {
18207 "template parameter pack %qD cannot have a "
18209 else
18211 "template parameter packs cannot have "
18214 }
18217 }
18218 else
18221 /* Create the combined representation of the parameter and the
18222 default argument. */
18224 }
18228 {
18229 tree identifier;
18230 tree default_argument;
18232 /* Look for the `<'. */
18234 /* Parse the template-parameter-list. */
18236 /* Look for the `>'. */
18239 /* If template requirements are present, parse them. */
18241 {
18246 }
18248 /* Look for the `class' or 'typename' keywords. */
18250 /* If the next token is an ellipsis, we have a template
18251 argument pack. */
18253 {
18254 /* Consume the `...' token. */
18259 }
18260 /* If the next token is an `=', then there is a
18261 default-argument. If the next token is a `>', we are at
18262 the end of the parameter-list. If the next token is a `,',
18263 then we are at the end of this parameter. */
18267 {
18269 /* Treat invalid names as if the parameter were nameless. */
18272 }
18273 else
18276 /* Create the template parameter. */
18278 identifier);
18280 /* If the next token is an `=', then there is a
18281 default-argument. */
18283 {
18284 default_argument
18287 /* Template parameter packs cannot have default
18288 arguments. */
18290 {
18293 "template parameter pack %qD cannot "
18295 identifier);
18296 else
18300 }
18301 }
18302 else
18305 /* Create the combined representation of the parameter and the
18306 default argument. */
18308 }
18314 }
18317 }
18319 /* Parse a template-id.
18321 template-id:
18322 template-name < template-argument-list [opt] >
18324 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
18325 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
18326 returned. Otherwise, if the template-name names a function, or set
18327 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
18328 names a class, returns a TYPE_DECL for the specialization.
18330 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
18331 uninstantiated templates. */
18333 static tree
18339 {
18340 tree templ;
18341 tree arguments;
18342 tree template_id;
18347 /* If the next token corresponds to a template-id, there is no need
18348 to reparse it. */
18352 {
18355 }
18357 /* Avoid performing name lookup if there is no possibility of
18358 finding a template-id. */
18361 && !cp_parser_nth_token_starts_template_argument_list_p
18363 {
18366 }
18368 /* Remember where the template-id starts. */
18374 /* Parse the template-name. */
18377 check_dependency_p,
18378 is_declaration,
18379 tag_type,
18382 /* Push any access checks inside the firewall we're about to create. */
18388 /* Since we're going to preserve any side-effects from this parse, set up a
18389 firewall to protect our callers from cp_parser_commit_to_tentative_parse
18390 in the template arguments. */
18394 /* If we find the sequence `[:' after a template-name, it's probably
18395 a digraph-typo for `< ::'. Substitute the tokens and check if we can
18396 parse correctly the argument list. */
18403 {
18405 /* Change `:' into `::'. */
18407 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
18408 CPP_LESS. */
18411 /* Parse the arguments. */
18414 {
18415 /* If we couldn't parse an argument list, then we revert our changes
18416 and return simply an error. Maybe this is not a template-id
18417 after all. */
18422 }
18423 /* Otherwise, emit an error about the invalid digraph, but continue
18424 parsing because we got our argument list. */
18427 {
18430 "%<<:%> is an alternate spelling for %<[%>."
18433 {
18435 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
18438 }
18439 }
18440 }
18441 else
18442 {
18443 /* Look for the `<' that starts the template-argument-list. */
18445 {
18448 }
18449 /* Parse the arguments. */
18454 && !template_keyword_p
18457 {
18458 /* This didn't go well. */
18460 {
18461 /* C++20 says that "function-name < a;" is now ill-formed. */
18463 {
18466 "operand of %<<%> is ill-formed in C++20; wrap the "
18468 }
18469 else
18470 /* We expect "f<targs>" to be followed by "(args)". */
18474 /* Purge all subsequent tokens. */
18476 }
18477 else
18481 }
18482 }
18484 /* Set the location to be of the form:
18485 template-name < template-argument-list [opt] >
18486 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
18487 with caret == start at the start of the template-name,
18488 ranging until the closing '>'. */
18489 location_t combined_loc
18492 /* Check for concepts autos where they don't belong. We could
18493 identify types in some cases of identifier TEMPL, looking ahead
18494 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
18495 types. We reject them in functions, but if what we have is an
18496 identifier, even with none_type we can't conclude it's NOT a
18497 type, we have to wait for template substitution. */
18500 /* Build a representation of the specialization. */
18503 TEMPLATE_ID_EXPR,
18507 {
18508 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
18509 template (rather than some instantiation thereof) only if
18510 is not nested within some other construct. For example, in
18511 "template <typename T> void f(T) { A<T>::", A<T> is just an
18512 instantiation of A. */
18513 bool entering_scope
18516 template_id
18518 }
18520 {
18521 /* The caller will decide whether this is a concept check or type
18522 constraint. */
18525 }
18527 {
18531 }
18534 {
18535 /* Some type template in dependent scope. */
18538 TEMPLATE_ID_EXPR,
18541 }
18542 else
18543 {
18544 /* If it's not a class-template or a template-template, it should be
18545 a function-template. */
18551 }
18553 /* If parsing tentatively, replace the sequence of tokens that makes
18554 up the template-id with a CPP_TEMPLATE_ID token. That way,
18555 should we re-parse the token stream, we will not have to repeat
18556 the effort required to do the parse, nor will we issue duplicate
18557 error messages about problems during instantiation of the
18558 template. */
18560 /* Don't do this if we had a parse error in a declarator; re-parsing
18561 might succeed if a name changes meaning (60361). */
18565 {
18566 /* Reset the contents of the START_OF_ID token. */
18570 /* Retrieve any deferred checks. Do not pop this access checks yet
18571 so the memory will not be reclaimed during token replacing below. */
18578 /* Purge all subsequent tokens. */
18581 /* ??? Can we actually assume that, if template_id ==
18582 error_mark_node, we will have issued a diagnostic to the
18583 user, as opposed to simply marking the tentative parse as
18584 failed? */
18587 }
18591 }
18593 /* Like cp_parser_template_id, called in non-type context. */
18595 static tree
18600 {
18605 /* We didn't check the arguments in cp_parser_template_id; do that now. */
18608 }
18610 /* Parse a template-name.
18612 template-name:
18613 identifier
18615 The standard should actually say:
18617 template-name:
18618 identifier
18619 operator-function-id
18621 A defect report has been filed about this issue.
18623 A conversion-function-id cannot be a template name because they cannot
18624 be part of a template-id. In fact, looking at this code:
18626 a.operator K<int>()
18628 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
18629 It is impossible to call a templated conversion-function-id with an
18630 explicit argument list, since the only allowed template parameter is
18631 the type to which it is converting.
18633 If TEMPLATE_KEYWORD_P is true, then we have just seen the
18634 `template' keyword, in a construction like:
18636 T::template f<3>()
18638 In that case `f' is taken to be a template-name, even though there
18639 is no way of knowing for sure.
18641 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
18642 name refers to a set of overloaded functions, at least one of which
18643 is a template, or an IDENTIFIER_NODE with the name of the template,
18644 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
18645 names are looked up inside uninstantiated templates. */
18647 static tree
18654 {
18655 tree identifier;
18656 tree decl;
18659 /* If the next token is `operator', then we have either an
18660 operator-function-id or a conversion-function-id. */
18662 {
18663 /* We don't know whether we're looking at an
18664 operator-function-id or a conversion-function-id. */
18666 /* Try an operator-function-id. */
18668 /* If that didn't work, try a conversion-function-id. */
18670 {
18673 }
18674 }
18675 /* Look for the identifier. */
18676 else
18679 /* If we didn't find an identifier, we don't have a template-id. */
18683 /* If the name immediately followed the `template' keyword, then it
18684 is a template-name. However, if the next token is not `<', then
18685 we do not treat it as a template-name, since it is not being used
18686 as part of a template-id. This enables us to handle constructs
18687 like:
18689 template <typename T> struct S { S(); };
18690 template <typename T> S<T>::S();
18692 correctly. We would treat `S' as a template -- if it were `S<T>'
18693 -- but we do not if there is no `<'. */
18697 {
18698 /* In a declaration, in a dependent context, we pretend that the
18699 "template" keyword was present in order to improve error
18700 recovery. For example, given:
18702 template <typename T> void f(T::X<int>);
18704 we want to treat "X<int>" as a template-id. */
18706 && !template_keyword_p
18708 && check_dependency_p
18710 /* Do not do this for dtors (or ctors), since they never
18711 need the template keyword before their name. */
18713 {
18716 /* Explain what went wrong. */
18718 identifier);
18721 /* If parsing tentatively, find the location of the "<" token. */
18724 /* Parse the template arguments so that we can issue error
18725 messages about them. */
18728 /* Skip tokens until we find a good place from which to
18729 continue parsing. */
18734 /* If parsing tentatively, permanently remove the
18735 template argument list. That will prevent duplicate
18736 error messages from being issued about the missing
18737 "template" keyword. */
18744 }
18746 /* If the "template" keyword is present, then there is generally
18747 no point in doing name-lookup, so we just return IDENTIFIER.
18748 But, if the qualifying scope is non-dependent then we can
18749 (and must) do name-lookup normally. */
18751 {
18757 {
18758 /* We're optimizing away the call to cp_parser_lookup_name, but
18759 we still need to do this. */
18763 }
18764 }
18765 }
18767 /* cp_parser_lookup_name clears OBJECT_TYPE. */
18771 /* Look up the name. */
18773 tag_type,
18776 check_dependency_p,
18782 /* 13.3 [temp.names] A < is interpreted as the delimiter of a
18783 template-argument-list if it follows a name that is not a
18784 conversion-function-id and
18785 - that follows the keyword template or a ~ after a nested-name-specifier or
18786 in a class member access expression, or
18787 - for which name lookup finds the injected-class-name of a class template
18788 or finds any declaration of a template, or
18789 - that is an unqualified name for which name lookup either finds one or
18790 more functions or finds nothing, or
18791 - that is a terminal name in a using-declarator (9.9), in a declarator-id
18792 (9.3.4), or in a type-only context other than a nested-name-specifier
18793 (13.8). */
18795 /* Handle injected-class-name. */
18798 /* If DECL is a template, then the name was a template-name. */
18800 {
18803 {
18805 tree attr;
18808 else
18811 {
18814 }
18817 {
18820 }
18821 }
18822 }
18823 else
18824 {
18825 /* Look through an overload set for any templates. */
18833 /* "an unqualified name for which name lookup either finds one or more
18834 functions or finds nothing". */
18837 && !scope
18840 {
18841 /* The "more functions" case. Just use the OVERLOAD as normally.
18842 We don't use is_overloaded_fn here to avoid considering
18843 BASELINKs. */
18845 /* Name lookup found one function. */
18847 /* Name lookup found nothing. */
18850 }
18852 /* "that follows the keyword template"..."in a type-only context" */
18860 {
18861 /* The name does not name a template. */
18864 }
18867 /* cp_parser_template_id can only handle some TYPE_DECLs. */
18870 /* Repeat the lookup at instantiation time. */
18872 }
18875 }
18877 /* Parse a template-argument-list.
18879 template-argument-list:
18880 template-argument ... [opt]
18881 template-argument-list , template-argument ... [opt]
18883 Returns a TREE_VEC containing the arguments. */
18885 static tree
18887 {
18892 /* Don't create location wrapper nodes within a template-argument-list. */
18893 auto_suppress_location_wrappers sentinel;
18897 /* Even if the template-id appears in an integral
18898 constant-expression, the contents of the argument list do
18899 not. */
18905 /* Parse the arguments. */
18907 do
18908 {
18910 /* Consume the comma. */
18913 /* Parse the template-argument. */
18916 /* If the next token is an ellipsis, we're expanding a template
18917 argument pack. */
18919 {
18921 {
18925 }
18926 /* Consume the `...' token. */
18929 /* Make the argument into a TYPE_PACK_EXPANSION or
18930 EXPR_PACK_EXPANSION. */
18932 }
18935 }
18950 }
18952 /* Parse a template-argument.
18954 template-argument:
18955 assignment-expression
18956 type-id
18957 id-expression
18959 The representation is that of an assignment-expression, type-id, or
18960 id-expression -- except that the qualified id-expression is
18961 evaluated, so that the value returned is either a DECL or an
18962 OVERLOAD.
18964 Although the standard says "assignment-expression", it forbids
18965 throw-expressions or assignments in the template argument.
18966 Therefore, we use "conditional-expression" instead. */
18968 static tree
18970 {
18971 tree argument;
18977 cp_id_kind idk;
18979 /* There's really no way to know what we're looking at, so we just
18980 try each alternative in order.
18982 [temp.arg]
18984 In a template-argument, an ambiguity between a type-id and an
18985 expression is resolved to a type-id, regardless of the form of
18986 the corresponding template-parameter.
18988 Therefore, we try a type-id first. */
18991 /* If there was no error parsing the type-id but the next token is a
18992 '>>', our behavior depends on which dialect of C++ we're
18993 parsing. In C++98, we probably found a typo for '> >'. But there
18994 are type-id which are also valid expressions. For instance:
18996 struct X { int operator >> (int); };
18997 template <int V> struct Foo {};
18998 Foo<X () >> 5> r;
19000 Here 'X()' is a valid type-id of a function type, but the user just
19001 wanted to write the expression "X() >> 5". Thus, we remember that we
19002 found a valid type-id, but we still try to parse the argument as an
19003 expression to see what happens.
19005 In C++0x, the '>>' will be considered two separate '>'
19006 tokens. */
19010 /* Similarly for >= which
19011 cp_parser_next_token_ends_template_argument_p treats for
19012 diagnostics purposes as mistyped > =, but can be valid
19013 after a type-id. */
19015 {
19018 }
19019 else
19020 {
19021 /* If the next token isn't a `,' or a `>', then this argument wasn't
19022 really finished. This means that the argument is not a valid
19023 type-id. */
19026 /* If that worked, we're done. */
19029 }
19030 /* We're still not sure what the argument will be. */
19032 /* Try a template. */
19040 /* If the next token isn't a `,' or a `>', then this argument wasn't
19041 really finished. */
19045 {
19046 /* Figure out what is being referred to. If the id-expression
19047 was for a class template specialization, then we will have a
19048 TYPE_DECL at this point. There is no need to do name lookup
19049 at this point in that case. */
19052 none_type,
19061 }
19063 {
19069 }
19070 /* It must be a non-type argument. In C++17 any constant-expression is
19071 allowed. */
19075 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
19077 -- an integral constant-expression of integral or enumeration
19078 type; or
19080 -- the name of a non-type template-parameter; or
19082 -- the name of an object or function with external linkage...
19084 -- the address of an object or function with external linkage...
19086 -- a pointer to member... */
19087 /* Look for a non-type template parameter. */
19089 {
19101 }
19103 /* If the next token is "&", the argument must be the address of an
19104 object or function with external linkage. */
19107 {
19110 }
19111 /* See if we might have an id-expression. */
19118 {
19121 address_p,
19128 else
19129 {
19130 tree probe;
19133 {
19134 /* Strip the dereference temporarily. */
19137 }
19139 /* If we're in a template, we represent a qualified-id referring
19140 to a static data member as a SCOPE_REF even if the scope isn't
19141 dependent so that we can check access control later. */
19146 {
19147 /* A variable without external linkage might still be a
19148 valid constant-expression, so no error is issued here
19149 if the external-linkage check fails. */
19152 }
19154 /* All overloaded functions are allowed; if the external
19155 linkage test does not pass, an error will be issued
19156 later. */
19157 ;
19161 /* A pointer-to-member. */
19162 ;
19164 ;
19165 else
19169 {
19173 else
19176 }
19177 }
19178 }
19179 /* If the argument started with "&", there are no other valid
19180 alternatives at this point. */
19182 {
19185 }
19187 general_expr:
19188 /* If the argument wasn't successfully parsed as a type-id followed
19189 by '>>', the argument can only be a constant expression now.
19190 Otherwise, we try parsing the constant-expression tentatively,
19191 because the argument could really be a type-id. */
19197 else
19198 {
19199 /* In C++20, we can encounter a braced-init-list. */
19202 {
19205 }
19207 /* With C++17 generalized non-type template arguments we need to handle
19208 lvalue constant expressions, too. */
19211 }
19219 /* We did our best to parse the argument as a non type-id, but that
19220 was the only alternative that matched (albeit with a '>' after
19221 it). We can assume it's just a typo from the user, and a
19222 diagnostic will then be issued. */
19224 }
19226 /* Parse an explicit-instantiation.
19228 explicit-instantiation:
19229 template declaration
19231 Although the standard says `declaration', what it really means is:
19233 explicit-instantiation:
19234 template decl-specifier-seq [opt] declarator [opt] ;
19236 Things like `template int S<int>::i = 5, int S<double>::j;' are not
19237 supposed to be allowed. A defect report has been filed about this
19238 issue.
19240 GNU Extension:
19242 explicit-instantiation:
19243 storage-class-specifier template
19244 decl-specifier-seq [opt] declarator [opt] ;
19245 function-specifier template
19246 decl-specifier-seq [opt] declarator [opt] ; */
19248 static void
19250 {
19252 cp_decl_specifier_seq decl_specifiers;
19257 /* Look for an (optional) storage-class-specifier or
19258 function-specifier. */
19260 {
19261 extension_specifier
19264 extension_specifier
19267 }
19269 /* Look for the `template' keyword. */
19271 /* Let the front end know that we are processing an explicit
19272 instantiation. */
19274 /* [temp.explicit] says that we are supposed to ignore access
19275 control while processing explicit instantiation directives. */
19277 /* Parse a decl-specifier-seq. */
19279 CP_PARSER_FLAGS_OPTIONAL,
19283 cp_omp_declare_simd_data odsd;
19289 /* If there was exactly one decl-specifier, and it declared a class,
19290 and there's no declarator, then we have an explicit type
19291 instantiation. */
19293 {
19296 /* Turn access control back on for names used during
19297 template instantiation. */
19302 }
19303 else
19304 {
19306 tree decl;
19308 /* Parse the declarator. */
19309 declarator
19311 CP_PARSER_FLAGS_NONE,
19322 {
19325 "explicit instantiation shall not use"
19329 "explicit instantiation shall not use"
19333 "explicit instantiation shall not use"
19338 /* Turn access control back on for names used during
19339 template instantiation. */
19341 /* Do the explicit instantiation. */
19343 }
19344 else
19345 {
19347 /* Skip the body of the explicit instantiation. */
19349 }
19350 }
19351 /* We're done with the instantiation. */
19357 }
19359 /* Parse an explicit-specialization.
19361 explicit-specialization:
19362 template < > declaration
19364 Although the standard says `declaration', what it really means is:
19366 explicit-specialization:
19367 template <> decl-specifier [opt] init-declarator [opt] ;
19368 template <> function-definition
19369 template <> explicit-specialization
19370 template <> template-declaration */
19372 static void
19374 {
19377 /* Look for the `template' keyword. */
19379 /* Look for the `<'. */
19381 /* Look for the `>'. */
19383 /* We have processed another parameter list. */
19386 /* [temp]
19388 A template ... explicit specialization ... shall not have C
19389 linkage. */
19392 {
19396 /* Give it C++ linkage to avoid confusing other parts of the
19397 front end. */
19399 }
19401 /* Let the front end know that we are beginning a specialization. */
19403 {
19404 /* If the next keyword is `template', we need to figure out
19405 whether or not we're looking a template-declaration. */
19407 {
19412 else
19414 }
19415 else
19416 /* Parse the dependent declaration. */
19422 }
19424 /* We're done with the specialization. */
19427 /* For the erroneous case of a template with C linkage, we pushed an
19428 implicit C++ linkage scope; exit that scope now. */
19432 /* We're done with this parameter list. */
19434 }
19436 /* Preserve the attributes across a garbage collect (by making it a GC
19437 root), which can occur when parsing a member function. */
19441 /* Parse a type-specifier.
19443 type-specifier:
19444 simple-type-specifier
19445 class-specifier
19446 enum-specifier
19447 elaborated-type-specifier
19448 cv-qualifier
19450 GNU Extension:
19452 type-specifier:
19453 __complex__
19455 Returns a representation of the type-specifier. For a
19456 class-specifier, enum-specifier, or elaborated-type-specifier, a
19457 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
19459 The parser flags FLAGS is used to control type-specifier parsing.
19461 If IS_DECLARATION is TRUE, then this type-specifier is appearing
19462 in a decl-specifier-seq.
19464 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
19465 class-specifier, enum-specifier, or elaborated-type-specifier, then
19466 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
19467 if a type is declared; 2 if it is defined. Otherwise, it is set to
19468 zero.
19470 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
19471 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
19472 is set to FALSE. */
19474 static tree
19476 cp_parser_flags flags,
19481 {
19487 /* Assume this type-specifier does not declare a new type. */
19490 /* And that it does not specify a cv-qualifier. */
19493 /* Peek at the next token. */
19496 /* If we're looking at a keyword, we can use that to guide the
19497 production we choose. */
19500 {
19505 /* Look for the enum-specifier. */
19507 /* If that worked, we're done. */
19509 {
19514 type_spec,
19515 token,
19518 }
19519 else
19522 /* Any of these indicate either a class-specifier, or an
19523 elaborated-type-specifier. */
19530 /* Parse tentatively so that we can back up if we don't find a
19531 class-specifier. */
19535 /* Look for the class-specifier. */
19540 /* If that worked, we're done. */
19542 {
19547 type_spec,
19548 token,
19551 }
19553 /* Fall through. */
19554 elaborated_type_specifier:
19555 /* We're declaring (not defining) a class or enum. */
19559 /* Fall through. */
19561 /* Look for an elaborated-type-specifier. */
19562 type_spec
19563 = (cp_parser_elaborated_type_specifier
19566 is_declaration));
19569 type_spec,
19570 token,
19593 /* The `__complex__' keyword is a GNU extension. */
19599 }
19601 /* Handle simple keywords. */
19603 {
19605 {
19608 }
19610 }
19612 /* If we do not already have a type-specifier, assume we are looking
19613 at a simple-type-specifier. */
19615 decl_specs,
19616 flags);
19618 /* If we didn't find a type-specifier, and a type-specifier was not
19619 optional in this context, issue an error message. */
19621 {
19624 }
19627 }
19629 /* Parse a simple-type-specifier.
19631 simple-type-specifier:
19632 :: [opt] nested-name-specifier [opt] type-name
19633 :: [opt] nested-name-specifier template template-id
19634 char
19635 wchar_t
19636 bool
19637 short
19638 int
19639 long
19640 signed
19641 unsigned
19642 float
19643 double
19644 void
19646 C++11 Extension:
19648 simple-type-specifier:
19649 auto
19650 decltype ( expression )
19651 char16_t
19652 char32_t
19653 __underlying_type ( type-id )
19655 C++17 extension:
19657 nested-name-specifier(opt) template-name
19659 GNU Extension:
19661 simple-type-specifier:
19662 __int128
19663 __typeof__ unary-expression
19664 __typeof__ ( type-id )
19665 __typeof__ ( type-id ) { initializer-list , [opt] }
19667 Concepts Extension:
19669 simple-type-specifier:
19670 constrained-type-specifier
19672 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
19673 appropriately updated. */
19675 static tree
19678 cp_parser_flags flags)
19679 {
19684 /* Peek at the next token. */
19687 /* If we're looking at a keyword, things are easy. */
19689 {
19727 {
19730 /* Check if the alternate "__intN__" form has been used instead of
19731 "__intN". */
19735 }
19757 CASE_RID_FLOATN_NX:
19772 {
19773 /* The 'auto' might be the placeholder return type for a function decl
19774 with trailing return type. */
19783 {
19785 {
19792 }
19795 {
19798 }
19801 }
19805 {
19808 }
19811 {
19814 }
19815 else
19819 {
19822 "use of %<auto%> in lambda parameter declaration "
19823 "only available with "
19825 }
19828 "use of %<auto%> in parameter declaration "
19829 "only available with "
19833 "use of %<auto%> in parameter declaration "
19835 }
19836 else
19841 /* Since DR 743, decltype can either be a simple-type-specifier by
19842 itself or begin a nested-name-specifier. Parsing it will replace
19843 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
19844 handling below decide what to do. */
19850 /* Consume the `typeof' token. */
19852 /* Parse the operand to `typeof'. */
19854 /* If it is not already a TYPE, take its type. */
19860 token,
19865 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
19866 case RID_##CODE:
19868 #undef DEFTRAIT_TYPE
19872 token,
19879 }
19881 /* If token is an already-parsed decltype not followed by ::,
19882 it's a simple-type-specifier. */
19885 {
19888 {
19890 token,
19892 /* Remember that we are handling a decltype in order to
19893 implement the resolution of DR 1510 when the argument
19894 isn't instantiation dependent. */
19896 }
19899 }
19901 /* If the type-specifier was for a built-in type, we're done. */
19903 {
19904 /* Record the type. */
19911 type,
19912 token,
19917 /* Consume the token. */
19923 /* There is no valid C++ program where a non-template type is
19924 followed by a "<". That usually indicates that the user thought
19925 that the type was a template. */
19930 }
19932 /* The type-specifier must be a user-defined type. */
19934 {
19940 /* Don't gobble tokens or issue error messages if this is an
19941 optional type-specifier. */
19945 /* Remember current tentative parsing state -- if we know we need
19946 a type, we can give better diagnostics here. */
19951 /* Look for the optional `::' operator. */
19952 global_p
19956 /* Look for the nested-name specifier. */
19957 qualified_p
19964 /* If we have seen a nested-name-specifier, and the next token
19965 is `template', then we are using the template-id production. */
19968 {
19969 /* Look for the template-id. */
19973 none_type,
19975 /* If the template-id did not name a type, we are out of
19976 luck. */
19978 {
19979 /* ...unless we pretend we have seen 'typename'. */
19983 else
19984 {
19987 }
19988 }
19989 }
19990 /* DR 1812: A < following a qualified-id in a typename-specifier
19991 could safely be assumed to begin a template argument list, so
19992 the template keyword should be optional. */
19994 && qualified_p
19995 && typename_p
19997 {
20003 none_type,
20005 /* This is handled below, so back off. */
20016 }
20018 /* Otherwise, look for a type-name. */
20020 {
20028 }
20031 {
20032 /* Try for a type-constraint with template arguments. We check
20033 decl_specs here to avoid trying this for a functional cast. */
20040 none_type,
20043 {
20048 /* Perhaps it's a concept-check expression. */
20050 }
20051 else
20056 }
20059 {
20060 /* Try class template argument deduction or type-constraint without
20061 template arguments. */
20065 {
20066 location_t loc
20069 none_type,
20081 else
20082 {
20087 }
20088 }
20089 else
20091 }
20093 /* If it didn't work out, we don't have a TYPE. */
20098 /* Keep track of all name-lookups performed in class scopes. */
20100 && !global_p
20101 && !qualified_p
20108 token,
20110 }
20112 /* If we didn't get a type-name, issue an error message. */
20114 {
20117 }
20120 {
20121 /* See if TYPE is an Objective-C type, and if so, parse and
20122 accept any protocol references following it. Do this before
20123 the cp_parser_check_for_invalid_template_id() call, because
20124 Objective-C types can be followed by '<...>' which would
20125 enclose protocol names rather than template arguments, and so
20126 everything is fine. */
20129 {
20133 /* Clobber the "unqualified" type previously entered into
20134 DECL_SPECS with the new, improved protocol-qualified version. */
20139 }
20141 /* There is no valid C++ program where a non-template type is
20142 followed by a "<". That usually indicates that the user
20143 thought that the type was a template. */
20145 none_type,
20147 }
20150 }
20152 /* Parse the remainder of a placholder-type-specifier.
20154 placeholder-type-specifier:
20155 type-constraint_opt auto
20156 type-constraint_opt decltype(auto)
20158 The raw form of the constraint is parsed in cp_parser_simple_type_specifier
20159 and passed as TMPL. This function converts TMPL to an actual type-constraint,
20160 parses the placeholder type, and performs some contextual syntactic analysis.
20162 LOC provides the location of the template name.
20164 TENTATIVE is true if the type-specifier parsing is tentative; in that case,
20165 don't give an error if TMPL isn't a valid type-constraint, as the template-id
20166 might actually be a concept-check,
20168 Note that the Concepts TS allows the auto or decltype(auto) to be
20169 omitted in a constrained-type-specifier. */
20171 static tree
20174 {
20180 /* Get the arguments as written for subsequent analysis. */
20183 {
20186 }
20187 else
20188 /* A concept-name with no arguments can't be an expression. */
20193 /* Get the concept and prototype parameter for the constraint. */
20200 /* As per the standard, require auto or decltype(auto), except in some
20201 cases (template parameter lists, -fconcepts-ts enabled). */
20204 {
20208 {
20210 matching_parens parens;
20214 }
20215 }
20217 /* A type constraint constrains a contextually determined type or type
20218 parameter pack. However, the Concepts TS does allow concepts
20219 to introduce non-type and template template parameters. */
20221 {
20224 {
20226 {
20229 }
20231 }
20232 }
20234 /* In a template parameter list, a type-parameter can be introduced
20235 by type-constraints alone. */
20237 {
20238 /* In a default argument we may not be creating new parameters. */
20240 {
20241 /* If this assert turns out to be false, do error() instead. */
20244 }
20246 }
20248 /* Diagnose issues placeholder issues. */
20252 {
20254 /* Perhaps it's a concept-check expression (c++/91073). */
20261 /* Fall through. This is an error of omission. */
20262 }
20264 {
20265 /* A trailing return type only allows type-constraints. */
20268 }
20270 /* In a parameter-declaration-clause, a placeholder-type-specifier
20271 results in an invented template parameter. */
20273 {
20275 {
20281 }
20284 }
20286 /* Determine if the type should be deduced using template argument
20287 deduction or decltype deduction. Note that the latter is always
20288 used for type-constraints in trailing return types. */
20293 /* Otherwise, this is the type of a variable or return type. */
20296 else
20298 }
20300 /* Parse a type-name.
20302 type-name:
20303 class-name
20304 enum-name
20305 typedef-name
20306 simple-template-id [in c++0x]
20308 enum-name:
20309 identifier
20311 typedef-name:
20312 identifier
20314 Concepts:
20316 type-name:
20317 concept-name
20318 partial-concept-id
20320 concept-name:
20321 identifier
20323 Returns a TYPE_DECL for the type. */
20325 static tree
20327 {
20328 tree type_decl;
20330 /* We can't know yet whether it is a class-name or not. */
20332 /* Try a class-name. */
20334 typename_keyword_p,
20336 none_type,
20340 /* If it's not a class-name, keep looking. */
20342 {
20344 /* It must be a typedef-name or an enum-name. */
20348 /* It is either a simple-template-id representing an
20349 instantiation of an alias template... */
20353 none_type,
20355 /* Note that this must be an instantiation of an alias template
20356 because [temp.names]/6 says:
20358 A template-id that names an alias template specialization
20359 is a type-name.
20361 Whereas [temp.names]/7 says:
20363 A simple-template-id that names a class template
20364 specialization is a class-name.
20366 With concepts, this could also be a partial-concept-id that
20367 declares a non-type template parameter. */
20372 else
20376 /* ... Or a typedef-name or an enum-name. */
20378 }
20381 }
20383 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
20384 or a concept-name.
20386 enum-name:
20387 identifier
20389 typedef-name:
20390 identifier
20392 concept-name:
20393 identifier
20395 Returns a TYPE_DECL for the type. */
20397 static tree
20399 {
20400 tree type_decl;
20401 tree identifier;
20408 /* Look up the type-name. */
20415 {
20416 /* See if this is an Objective-C type. */
20421 }
20423 /* Issue an error if we did not find a type-name. */
20425 /* In Objective-C, we have the complication that class names are
20426 normally type names and start declarations (eg, the
20427 "NSObject" in "NSObject *object;"), but can be used in an
20428 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
20429 is an expression. So, a classname followed by a dot is not a
20430 valid type-name. */
20433 {
20438 }
20439 /* Remember that the name was used in the definition of the
20440 current class so that we can check later to see if the
20441 meaning would have been different after the class was
20442 entirely defined. */
20448 }
20450 /* Parse an elaborated-type-specifier. Note that the grammar given
20451 here incorporates the resolution to DR68.
20453 elaborated-type-specifier:
20454 class-key :: [opt] nested-name-specifier [opt] identifier
20455 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
20456 enum-key :: [opt] nested-name-specifier [opt] identifier
20457 typename :: [opt] nested-name-specifier identifier
20458 typename :: [opt] nested-name-specifier template [opt]
20459 template-id
20461 GNU extension:
20463 elaborated-type-specifier:
20464 class-key attributes :: [opt] nested-name-specifier [opt] identifier
20465 class-key attributes :: [opt] nested-name-specifier [opt]
20466 template [opt] template-id
20467 enum attributes :: [opt] nested-name-specifier [opt] identifier
20469 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
20470 declared `friend'. If IS_DECLARATION is TRUE, then this
20471 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
20472 something is being declared.
20474 Returns the TYPE specified. */
20476 static tree
20480 {
20482 tree identifier;
20485 tree globalscope;
20488 /* For class and enum types the location of the class-key or enum-key. */
20490 /* For a scoped enum, the 'class' or 'struct' keyword id. */
20493 /* See if we're looking at the `enum' keyword. */
20495 {
20496 /* Consume the `enum' token. */
20498 /* Remember that it's an enumeration type. */
20500 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
20501 enums) is used here. */
20505 {
20513 /* Consume the `struct' or `class' and parse it anyway. */
20515 /* Create a combined location for the whole scoped-enum-key. */
20517 }
20518 else
20521 /* Parse the attributes. */
20523 }
20524 /* Or, it might be `typename'. */
20526 RID_TYPENAME))
20527 {
20528 /* Consume the `typename' token. */
20530 /* Remember that it's a `typename' type. */
20532 }
20533 /* Otherwise it must be a class-key. */
20534 else
20535 {
20540 /* Parse the attributes. */
20542 }
20544 /* Look for the `::' operator. */
20547 /* Look for the nested-name-specifier. */
20548 tree nested_name_specifier;
20550 {
20551 nested_name_specifier
20556 is_declaration);
20559 }
20560 else
20561 /* Even though `typename' is not present, the proposed resolution
20562 to Core Issue 180 says that in `class A<T>::B', `B' should be
20563 considered a type-name, even if `A<T>' is dependent. */
20564 nested_name_specifier
20569 is_declaration);
20570 /* For everything but enumeration types, consider a template-id.
20571 For an enumeration type, consider only a plain identifier. */
20573 {
20575 tree decl;
20577 /* Allow the `template' keyword. */
20579 /* If we didn't see `template', we don't know if there's a
20580 template-id or not. */
20583 /* The `template' keyword must follow a nested-name-specifier. */
20585 {
20589 }
20591 /* Parse the template-id. */
20595 tag_type,
20596 is_declaration);
20597 /* If we didn't find a template-id, look for an ordinary
20598 identifier. */
20600 ;
20601 /* We can get here when cp_parser_template_id, called by
20602 cp_parser_class_name with tag_type == none_type, succeeds
20603 and caches a BASELINK. Then, when called again here,
20604 instead of failing and returning an error_mark_node
20605 returns it (see template/typename17.C in C++11).
20606 ??? Could we diagnose this earlier? */
20608 {
20611 }
20612 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
20613 in effect, then we must assume that, upon instantiation, the
20614 template will correspond to a class. */
20618 typename_type,
20620 /* If the `typename' keyword is in effect and DECL is not a type
20621 decl, then type is non existent. */
20623 ;
20625 {
20629 /* If the next token is a semicolon, this must be a specialization,
20630 instantiation, or friend declaration. Check the scope while we
20631 still know whether or not we had a nested-name-specifier. */
20636 }
20639 }
20642 {
20647 {
20650 }
20652 /* For a `typename', we needn't call xref_tag. */
20658 /* Template parameter lists apply only if we are not within a
20659 function parameter list. */
20660 bool template_parm_lists_apply
20669 /* Look up a qualified name in the usual way. */
20671 {
20672 tree decl;
20673 tree ambiguous_decls;
20676 tag_type,
20683 /* If the lookup was ambiguous, an error will already have been
20684 issued. */
20688 /* If we are parsing friend declaration, DECL may be a
20689 TEMPLATE_DECL tree node here. However, we need to check
20690 whether this TEMPLATE_DECL results in valid code. Consider
20691 the following example:
20693 namespace N {
20694 template <class T> class C {};
20695 }
20696 class X {
20697 template <class T> friend class N::C; // #1, valid code
20698 };
20699 template <class T> class Y {
20700 friend class N::C; // #2, invalid code
20701 };
20703 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
20704 name lookup of `N::C'. We see that friend declaration must
20705 be template for the code to be valid. Note that
20706 processing_template_decl does not work here since it is
20707 always 1 for the above two cases. */
20709 decl = (cp_parser_maybe_treat_template_as_class
20714 {
20716 identifier,
20719 }
20722 {
20726 allow_template);
20730 }
20732 /* Forward declarations of nested types, such as
20734 class C1::C2;
20735 class C1::C2::C3;
20737 are invalid unless all components preceding the final '::'
20738 are complete. If all enclosing types are complete, these
20739 declarations become merely pointless.
20741 Invalid forward declarations of nested types are errors
20742 caught elsewhere in parsing. Those that are pointless arrive
20743 here. */
20751 }
20752 else
20753 {
20754 /* An elaborated-type-specifier sometimes introduces a new type and
20755 sometimes names an existing type. Normally, the rule is that it
20756 introduces a new type only if there is not an existing type of
20757 the same name already in scope. For example, given:
20759 struct S {};
20760 void f() { struct S s; }
20762 the `struct S' in the body of `f' is the same `struct S' as in
20763 the global scope; the existing definition is used. However, if
20764 there were no global declaration, this would introduce a new
20765 local class named `S'.
20767 An exception to this rule applies to the following code:
20769 namespace N { struct S; }
20771 Here, the elaborated-type-specifier names a new type
20772 unconditionally; even if there is already an `S' in the
20773 containing scope this declaration names a new type.
20774 This exception only applies if the elaborated-type-specifier
20775 forms the complete declaration:
20777 [class.name]
20779 A declaration consisting solely of `class-key identifier ;' is
20780 either a redeclaration of the name in the current scope or a
20781 forward declaration of the identifier as a class name. It
20782 introduces the name into the current scope.
20784 We are in this situation precisely when the next token is a `;'.
20786 An exception to the exception is that a `friend' declaration does
20787 *not* name a new type; i.e., given:
20789 struct S { friend struct T; };
20791 `T' is not a new type in the scope of `S'.
20793 Also, `new struct S' or `sizeof (struct S)' never results in the
20794 definition of a new type; a new type can only be declared in a
20795 declaration context. */
20797 TAG_how how;
20800 /* Friends have special name lookup rules. */
20804 CPP_SEMICOLON))
20805 /* This is a `class-key identifier ;' */
20807 else
20811 (template_parm_lists_apply
20814 /* An unqualified name was used to reference this type, so
20815 there were no qualifying templates. */
20825 }
20826 }
20831 /* Allow attributes on forward declarations of classes. */
20833 {
20844 {
20848 }
20851 else
20853 "attributes ignored on elaborated-type-specifier that is "
20855 }
20859 else
20860 {
20861 /* Diagnose class/struct/union mismatches. IS_DECLARATION is false
20862 for alias definition. */
20866 decl_class);
20868 /* Indicate whether this class was declared as a `class' or as a
20869 `struct'. */
20872 }
20874 /* A "<" cannot follow an elaborated type specifier. If that
20875 happens, the user was probably trying to form a template-id. */
20880 }
20882 /* Parse an enum-specifier.
20884 enum-specifier:
20885 enum-head { enumerator-list [opt] }
20886 enum-head { enumerator-list , } [C++0x]
20888 enum-head:
20889 enum-key identifier [opt] enum-base [opt]
20890 enum-key nested-name-specifier identifier enum-base [opt]
20892 enum-key:
20893 enum
20894 enum class [C++0x]
20895 enum struct [C++0x]
20897 enum-base: [C++0x]
20898 : type-specifier-seq
20900 opaque-enum-specifier:
20901 enum-key identifier enum-base [opt] ;
20903 GNU Extensions:
20904 enum-key attributes[opt] identifier [opt] enum-base [opt]
20905 { enumerator-list [opt] }attributes[opt]
20906 enum-key attributes[opt] identifier [opt] enum-base [opt]
20907 { enumerator-list, }attributes[opt] [C++0x]
20909 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
20910 if the token stream isn't an enum-specifier after all. */
20912 static tree
20914 {
20915 tree identifier;
20917 tree prev_scope;
20919 tree attributes;
20930 /* Parse tentatively so that we can back up if we don't find a
20931 enum-specifier. */
20934 /* Caller guarantees that the current token is 'enum', an identifier
20935 possibly follows, and the token after that is an opening brace.
20936 If we don't have an identifier, fabricate an anonymous name for
20937 the enumeration being defined. */
20940 /* Parse the "class" or "struct", which indicates a scoped
20941 enumeration type in C++0x. */
20944 {
20948 /* Consume the `struct' or `class' token. */
20952 }
20956 /* Clear the qualification. */
20961 /* Figure out in what scope the declaration is being placed. */
20967 nested_name_specifier
20975 {
20976 tree name;
20980 enum_type,
20985 input_location);
20987 {
20990 {
20991 /* Are template enums allowed in ISO? */
20995 /* ignore a typename reference, for it will be solved by name
20996 in start_enum. */
20998 }
20999 }
21002 else
21003 {
21008 }
21009 }
21010 else
21011 {
21014 else
21015 {
21021 }
21022 }
21025 /* Check for the `:' that denotes a specified underlying type in C++0x.
21026 Note that a ':' could also indicate a bitfield width, however. */
21028 {
21029 cp_decl_specifier_seq type_specifiers;
21031 /* Consume the `:'. */
21034 auto tdf
21038 /* Parse the type-specifier-seq. */
21044 /* At this point this is surely not elaborated type specifier. */
21053 /* If that didn't work, stop. */
21055 {
21061 }
21062 }
21064 /* Look for the `{' but don't consume it yet. */
21066 {
21068 {
21074 }
21075 /* An opaque-enum-specifier must have a ';' here. */
21078 {
21084 }
21085 }
21091 {
21093 {
21097 }
21100 }
21102 /* Issue an error message if type-definitions are forbidden here. */
21105 else
21106 /* Create the new type. We do this before consuming the opening
21107 brace so the enum will be recorded as being on the line of its
21108 tag (or the 'enum' keyword, if there is no tag). */
21112 /* If the next token is not '{' it is an opaque-enum-specifier or an
21113 elaborated-type-specifier. */
21115 {
21120 {
21121 /* The following catches invalid code such as:
21122 enum class S<int>::E { A, B, C }; */
21130 {
21134 nested_name_specifier);
21136 }
21139 {
21141 "%qT for enum declaration does not name a class "
21144 }
21145 /* If that scope does not contain the scope in which the
21146 class was originally declared, the program is invalid. */
21148 nested_name_specifier))
21149 {
21152 "declaration of %qD in namespace %qD which does not "
21155 else
21157 "declaration of %qD in %qD which does not "
21161 }
21162 /* If that scope is the scope where the declaration is being placed
21163 the program is invalid. */
21167 {
21171 }
21172 }
21177 /* Consume the opening brace. */
21178 matching_braces braces;
21185 {
21189 }
21190 else
21191 {
21197 }
21201 /* If the next token is not '}', then there are some enumerators. */
21203 {
21205 /* Don't warn for enum {} a; here. */
21209 }
21210 else
21211 {
21212 /* We've seen a '{' so we know we're in an enum-specifier.
21213 Commit to any tentative parse to get syntax errors. */
21216 }
21218 /* Consume the final '}'. */
21223 }
21224 else
21225 {
21226 /* If a ';' follows, then it is an opaque-enum-specifier
21227 and additional restrictions apply. */
21229 {
21236 }
21237 }
21239 /* Look for trailing attributes to apply to this enumeration, and
21240 apply them if appropriate. */
21242 {
21245 trailing_attr,
21247 }
21249 /* Finish up the enumeration. */
21251 {
21256 }
21259 {
21261 {
21264 }
21267 }
21269 }
21271 /* Parse an enumerator-list. The enumerators all have the indicated
21272 TYPE.
21274 enumerator-list:
21275 enumerator-definition
21276 enumerator-list , enumerator-definition */
21278 static void
21280 {
21282 {
21283 /* Parse an enumerator-definition. */
21286 /* If the next token is not a ',', we've reached the end of
21287 the list. */
21290 /* Otherwise, consume the `,' and keep going. */
21292 /* If the next token is a `}', there is a trailing comma. */
21294 {
21299 }
21300 }
21301 }
21303 /* Parse an enumerator-definition. The enumerator has the indicated
21304 TYPE.
21306 enumerator-definition:
21307 enumerator
21308 enumerator = constant-expression
21310 enumerator:
21311 identifier
21313 GNU Extensions:
21315 enumerator-definition:
21316 enumerator attributes [opt]
21317 enumerator attributes [opt] = constant-expression */
21319 static void
21321 {
21322 tree identifier;
21323 tree value;
21324 location_t loc;
21326 /* Save the input location because we are interested in the location
21327 of the identifier and not the location of the explicit value. */
21330 /* Look for the identifier. */
21335 /* Parse any specified attributes. */
21338 /* If the next token is an '=', then there is an explicit value. */
21340 {
21341 /* Consume the `=' token. */
21343 /* Parse the value. */
21345 }
21346 else
21349 /* If we are processing a template, make sure the initializer of the
21350 enumerator doesn't contain any bare template parameter pack. */
21352 {
21353 /* In a lambda it should work, but doesn't currently. */
21355 {
21358 }
21359 }
21363 /* Create the enumerator. */
21365 }
21367 /* Parse a namespace-name.
21369 namespace-name:
21370 original-namespace-name
21371 namespace-alias
21373 Returns the NAMESPACE_DECL for the namespace. */
21375 static tree
21377 {
21378 tree identifier;
21379 tree namespace_decl;
21383 /* Get the name of the namespace. */
21388 /* Look up the identifier in the currently active scope. Look only
21389 for namespaces, due to:
21391 [basic.lookup.udir]
21393 When looking up a namespace-name in a using-directive or alias
21394 definition, only namespace names are considered.
21396 And:
21398 [basic.lookup.qual]
21400 During the lookup of a name preceding the :: scope resolution
21401 operator, object, function, and enumerator names are ignored.
21403 (Note that cp_parser_qualifying_entity only calls this
21404 function if the token after the name is the scope resolution
21405 operator.) */
21407 none_type,
21413 /* If it's not a namespace, issue an error. */
21416 {
21418 {
21419 auto_diagnostic_group d;
21420 name_hint hint;
21424 identifier,
21427 {
21433 }
21434 else
21436 identifier);
21437 }
21438 else
21441 }
21444 }
21446 /* Parse a namespace-definition.
21448 namespace-definition:
21449 named-namespace-definition
21450 unnamed-namespace-definition
21452 named-namespace-definition:
21453 original-namespace-definition
21454 extension-namespace-definition
21456 original-namespace-definition:
21457 namespace identifier { namespace-body }
21459 extension-namespace-definition:
21460 namespace original-namespace-name { namespace-body }
21462 unnamed-namespace-definition:
21463 namespace { namespace-body } */
21465 static void
21467 {
21468 tree identifier;
21478 {
21481 }
21483 /* Look for the `namespace' keyword. */
21484 cp_token* token
21487 /* Parse any specified attributes before the identifier. */
21491 {
21495 RID_INLINE);
21497 {
21501 "definitions only available with %<-std=c++20%> or "
21504 }
21507 {
21512 "standard attributes on namespaces must precede "
21515 /* Parse any attributes specified after the identifier. */
21517 }
21520 {
21521 /* Don't forget that the innermost namespace might have been
21522 marked as inline. Use |= because we cannot overwrite
21523 IS_INLINE in case the outermost namespace is inline, but
21524 there are no nested inlines. */
21527 }
21531 "nested namespace definitions only available with "
21534 /* Nested namespace names can create new namespaces (unlike
21535 other qualified-ids). */
21540 else
21543 }
21555 /* Start the namespace. */
21562 /* Look for the `{' to validate starting the namespace. */
21563 matching_braces braces;
21565 {
21566 /* Parse the body of the namespace. */
21569 /* Look for the final `}'. */
21571 }
21576 /* Pop the nested namespace definitions. */
21579 }
21581 /* Parse a namespace-body.
21583 namespace-body:
21584 declaration-seq [opt] */
21586 static void
21588 {
21590 }
21592 /* Parse a namespace-alias-definition.
21594 namespace-alias-definition:
21595 namespace identifier = qualified-namespace-specifier ; */
21597 static void
21599 {
21600 tree identifier;
21601 tree namespace_specifier;
21605 /* Look for the `namespace' keyword. */
21607 /* Look for the identifier. */
21611 /* Look for the `=' token. */
21614 {
21616 /* Skip the definition. */
21621 }
21623 /* Look for the qualified-namespace-specifier. */
21624 namespace_specifier
21627 /* Look for the `;' token. */
21630 /* Register the alias in the symbol table. */
21632 }
21634 /* Parse a qualified-namespace-specifier.
21636 qualified-namespace-specifier:
21637 :: [opt] nested-name-specifier [opt] namespace-name
21639 Returns a NAMESPACE_DECL corresponding to the specified
21640 namespace. */
21642 static tree
21644 {
21645 /* Look for the optional `::'. */
21649 /* Look for the optional nested-name-specifier. */
21657 }
21659 /* Subroutine of cp_parser_using_declaration. */
21661 static tree
21663 {
21666 {
21667 /* Create the USING_DECL. */
21676 /* Add it to the list of members in this class. */
21678 }
21679 else
21682 }
21684 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
21685 access declaration.
21687 using-declaration:
21688 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
21689 using :: unqualified-id ;
21691 access-declaration:
21692 qualified-id ;
21694 */
21696 static bool
21699 {
21703 tree identifier;
21704 tree qscope;
21709 {
21712 }
21713 else
21714 {
21715 /* Look for the `using' keyword. */
21718 again:
21719 /* Peek at the next token. */
21721 /* See if it's `typename'. */
21723 {
21724 /* Remember that we've seen it. */
21726 /* Consume the `typename' token. */
21728 }
21729 }
21731 /* Look for the optional global scope qualification. */
21732 global_scope_p
21737 /* If we saw `typename', or didn't see `::', then there must be a
21738 nested-name-specifier present. */
21740 {
21746 {
21749 }
21750 }
21751 /* Otherwise, we could be in either of the two productions. In that
21752 case, treat the nested-name-specifier as optional. */
21753 else
21767 /* If the qualifying scope of an access-declaration isn't a class
21768 or enumeration type then it can't be valid. */
21772 /* Something has already gone wrong; there's no need to parse
21773 further. Since an error has occurred, the return value of
21774 cp_parser_parse_definitely will be false, as required. */
21778 /* Parse the unqualified-id. */
21786 {
21791 }
21793 {
21797 "pack expansion in using-declaration only available "
21800 /* A parameter pack can appear in the qualifying scope, and/or in the
21801 terminal name (if naming a conversion function). Logically they're
21802 part of a single pack expansion of the overall USING_DECL, but we
21803 express them as separate pack expansions within the USING_DECL since
21804 we can't create a pack expansion over a USING_DECL. */
21807 {
21810 }
21814 {
21818 }
21820 {
21821 /* Issue an error in terms using a SCOPE_REF that includes both
21822 components. */
21823 tree name
21828 }
21829 }
21831 /* The function we call to handle a using-declaration is different
21832 depending on what scope we are in. */
21834 ;
21837 /* [namespace.udecl]
21839 A using declaration shall not name a template-id. */
21842 else
21843 {
21847 {
21850 }
21851 }
21855 {
21859 "comma-separated list in using-declaration only available "
21862 }
21864 /* Look for the final `;'. */
21869 "access declarations are deprecated "
21870 "in favour of using-declarations; "
21874 }
21876 /* C++20 using enum declaration.
21878 using-enum-declaration :
21879 using elaborated-enum-specifier ; */
21881 static void
21883 {
21886 /* Using cp_parser_elaborated_type_specifier rejects typedef-names, which
21887 breaks one of the motivating examples in using-enum-5.C.
21888 cp_parser_simple_type_specifier seems to be closer to what we actually
21889 want, though that hasn't been properly specified yet. */
21891 /* Consume 'enum'. */
21897 tree type = (cp_parser_simple_type_specifier
21904 {
21907 }
21911 /* The elaborated-enum-specifier shall not name a dependent type and the type
21912 shall have a reachable enum-specifier. */
21926 {
21928 auto_diagnostic_group g;
21932 ;
21935 else
21937 }
21939 /* A using-enum-declaration introduces the enumerator names of the named
21940 enumeration as if by a using-declaration for each enumerator. */
21944 }
21946 /* Parse an alias-declaration.
21948 alias-declaration:
21949 using identifier attribute-specifier-seq [opt] = type-id */
21951 static tree
21953 {
21957 cp_decl_specifier_seq decl_specs;
21961 /* Look for the `using' keyword. */
21962 cp_token *using_token
21984 /* Now we are going to parse the type-id of the declaration. */
21986 /*
21987 [dcl.type]/3 says:
21989 "A type-specifier-seq shall not define a class or enumeration
21990 unless it appears in the type-id of an alias-declaration (7.1.3) that
21991 is not the declaration of a template-declaration."
21993 In other words, if we currently are in an alias template, the
21994 type-id should not define a type.
21996 So let's set parser->type_definition_forbidden_message in that
21997 case; cp_parser_check_type_definition (called by
21998 cp_parser_class_specifier) will then emit an error if a type is
21999 defined in the type-id. */
22001 {
22005 }
22010 /* Restore the error message if need be. */
22016 {
22019 }
22021 /* A typedef-name can also be introduced by an alias-declaration. The
22022 identifier following the using keyword becomes a typedef-name. It has
22023 the same semantics as if it were introduced by the typedef
22024 specifier. In particular, it does not define a new type and it shall
22025 not appear in the type-id. */
22030 {
22033 ds_attribute,
22034 attrs_token);
22035 }
22037 ds_typedef,
22038 using_token);
22040 ds_alias,
22041 using_token);
22048 id_location,
22058 else
22069 /* If decl is a template, return its TEMPLATE_DECL so that it gets
22070 added into the symbol table; otherwise, return the TYPE_DECL. */
22074 {
22078 }
22081 }
22083 /* Parse a using-directive.
22085 using-directive:
22086 attribute-specifier-seq [opt] using namespace :: [opt]
22087 nested-name-specifier [opt] namespace-name ; */
22089 static void
22091 {
22092 tree namespace_decl;
22095 {
22096 /* Error during attribute parsing that resulted in skipping
22097 to next semicolon. */
22100 }
22102 /* Look for the `using' keyword. */
22104 /* And the `namespace' keyword. */
22106 /* Look for the optional `::' operator. */
22108 /* And the optional nested-name-specifier. */
22114 /* Get the namespace being used. */
22117 /* And any specified GNU attributes. */
22121 /* Update the symbol table. */
22124 /* Look for the final `;'. */
22126 }
22128 /* Parse an asm-definition.
22130 asm-qualifier:
22131 volatile
22132 inline
22133 goto
22135 asm-qualifier-list:
22136 asm-qualifier
22137 asm-qualifier-list asm-qualifier
22139 asm-definition:
22140 asm ( string-literal ) ;
22142 GNU Extension:
22144 asm-definition:
22145 asm asm-qualifier-list [opt] ( string-literal ) ;
22146 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt] ) ;
22147 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22148 : asm-operand-list [opt] ) ;
22149 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22150 : asm-operand-list [opt]
22151 : asm-clobber-list [opt] ) ;
22152 asm asm-qualifier-list [opt] ( string-literal : : asm-operand-list [opt]
22153 : asm-clobber-list [opt]
22154 : asm-goto-list ) ;
22156 The form with asm-goto-list is valid if and only if the asm-qualifier-list
22157 contains goto, and is the only allowed form in that case. No duplicates are
22158 allowed in an asm-qualifier-list. */
22160 static void
22162 {
22167 tree asm_stmt;
22174 /* Look for the `asm' keyword. */
22177 /* In C++20, unevaluated inline assembly is permitted in constexpr
22178 functions. */
22183 "function only available with %<-std=c++20%> or "
22186 /* Handle the asm-qualifier-list. */
22194 {
22198 {
22201 {
22205 }
22206 else
22207 {
22212 }
22218 {
22222 }
22223 else
22232 {
22236 }
22237 else
22252 }
22254 }
22261 {
22264 }
22266 /* Look for the opening `('. */
22269 /* Look for the string. */
22273 {
22277 }
22279 /* If we're allowing GNU extensions, check for the extended assembly
22280 syntax. Unfortunately, the `:' tokens need not be separated by
22281 a space in C, and so, for compatibility, we tolerate that here
22282 too. Doing that means that we have to treat the `::' operator as
22283 two `:' tokens. */
22288 {
22293 /* The extended syntax was used. */
22296 /* Look for outputs. */
22298 {
22299 /* Consume the `:'. */
22301 /* Parse the output-operands. */
22303 CPP_COLON)
22305 CPP_SCOPE)
22307 CPP_CLOSE_PAREN))
22308 {
22312 }
22313 }
22314 /* If the next token is `::', there are no outputs, and the
22315 next token is the beginning of the inputs. */
22317 /* The inputs are coming next. */
22320 /* Look for inputs. */
22323 {
22324 /* Consume the `:' or `::'. */
22326 /* Parse the output-operands. */
22328 CPP_COLON)
22330 CPP_SCOPE)
22332 CPP_CLOSE_PAREN))
22333 {
22337 }
22338 }
22340 /* The clobbers are coming next. */
22343 /* Look for clobbers. */
22346 {
22348 /* Consume the `:' or `::'. */
22350 /* Parse the clobbers. */
22352 CPP_COLON)
22354 CPP_CLOSE_PAREN))
22356 }
22358 /* The labels are coming next. */
22361 /* Look for labels. */
22364 {
22366 /* Consume the `:' or `::'. */
22368 /* Parse the labels. */
22370 }
22374 }
22378 /* Look for the closing `)'. */
22386 {
22387 /* Create the ASM_EXPR. */
22389 {
22392 /* If the extended syntax was not used, mark the ASM_EXPR. */
22394 {
22400 }
22401 }
22402 else
22404 }
22405 }
22407 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
22408 type that comes from the decl-specifier-seq. */
22410 static tree
22412 {
22415 {
22428 }
22431 }
22433 /* Warn about the most vexing parse syntactic ambiguity, i.e., warn when
22434 a construct looks like a variable definition but is actually a function
22435 declaration. DECL_SPECIFIERS is the decl-specifier-seq and DECLARATOR
22436 is the declarator for this function declaration. */
22438 static void
22441 {
22442 /* Only warn if we are declaring a function at block scope. */
22446 /* And only if there is no storage class specified. */
22458 /* Don't warn when the whole declarator (not just the declarator-id!)
22459 was parenthesized. That is, don't warn for int(n()) but do warn
22460 for int(f)(). */
22464 tree type;
22466 {
22471 /* If the return type is void there is no ambiguity. */
22474 }
22476 /* Code like long f(); will have null ->type. If we have any
22477 type-specifiers, pretend we've seen int. */
22479 else
22482 auto_diagnostic_group d;
22487 /* The T t() case. */
22489 {
22491 "empty parentheses were disambiguated as a function "
22493 {
22494 /* () means value-initialization (C++03 and up); {} (C++11 and up)
22495 means value-initialization or aggregate-initialization, nothing
22496 means default-initialization. We can only suggest removing the
22497 parentheses/adding {} if T has a default constructor. */
22499 {
22505 {
22509 else
22512 }
22513 }
22514 }
22516 }
22518 /* If we had (...) or the parameter-list wasn't parenthesized,
22519 we're done. */
22523 /* The T t(X()) case. */
22525 {
22527 "parentheses were disambiguated as a function "
22529 {
22531 /* {}-initialization means that we can use an initializer-list
22532 constructor if no default constructor is available, so don't
22533 suggest using {} for classes that have an initializer_list
22534 constructor. */
22536 {
22541 }
22542 else
22543 {
22547 }
22548 }
22549 }
22550 /* The T t(X(), X()) case. */
22552 "parentheses were disambiguated as a function "
22554 {
22557 {
22562 }
22563 }
22564 }
22566 /* If DECLARATOR with DECL_SPECS is a function declarator that has
22567 the form of a deduction guide, tag it as such. CTOR_DTOR_OR_CONV_P
22568 has the same meaning as in cp_parser_declarator. */
22570 static void
22575 {
22581 {
22589 {
22593 }
22594 }
22595 }
22597 /* Declarators [gram.dcl.decl] */
22599 /* Parse an init-declarator.
22601 init-declarator:
22602 declarator initializer [opt]
22604 GNU Extension:
22606 init-declarator:
22607 declarator asm-specification [opt] attributes [opt] initializer [opt]
22609 function-definition:
22610 decl-specifier-seq [opt] declarator ctor-initializer [opt]
22611 function-body
22612 decl-specifier-seq [opt] declarator function-try-block
22614 GNU Extension:
22616 function-definition:
22617 __extension__ function-definition
22619 TM Extension:
22621 function-definition:
22622 decl-specifier-seq [opt] declarator function-transaction-block
22624 The parser flags FLAGS is used to control type-specifier parsing.
22626 The DECL_SPECIFIERS apply to this declarator. Returns a
22627 representation of the entity declared. If MEMBER_P is TRUE, then
22628 this declarator appears in a class scope. The new DECL created by
22629 this declarator is returned.
22631 The CHECKS are access checks that should be performed once we know
22632 what entity is being declared (and, therefore, what classes have
22633 befriended it).
22635 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
22636 for a function-definition here as well. If the declarator is a
22637 declarator for a function-definition, *FUNCTION_DEFINITION_P will
22638 be TRUE upon return. By that point, the function-definition will
22639 have been completely parsed.
22641 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
22642 is FALSE.
22644 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
22645 parsed declaration if it is an uninitialized single declarator not followed
22646 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
22647 if present, will not be consumed. If returned, this declarator will be
22648 created with SD_INITIALIZED but will not call cp_finish_decl.
22650 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
22651 and there is an initializer, the pointed location_t is set to the
22652 location of the '=' or `(', or '{' in C++11 token introducing the
22653 initializer. */
22655 static tree
22657 cp_parser_flags flags,
22667 {
22671 tree prefix_attributes;
22673 tree asm_specification;
22674 tree initializer;
22676 tree scope;
22678 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
22679 initialized with "= ..", CPP_OPEN_PAREN if initialized with
22680 "(...)". */
22695 /* Assume that this is not the declarator for a function
22696 definition. */
22700 /* Default arguments are only permitted for function parameters. */
22704 /* Defer access checks while parsing the declarator; we cannot know
22705 what names are accessible until we know what is being
22706 declared. */
22711 /* Parse the declarator. */
22712 declarator
22717 /* Gather up the deferred checks. */
22722 /* If the DECLARATOR was erroneous, there's no need to go
22723 further. */
22727 /* Check that the number of template-parameter-lists is OK. */
22737 /* Figure out what scope the entity declared by the DECLARATOR is
22738 located in. `grokdeclarator' sometimes changes the scope, so
22739 we compute it now. */
22742 /* Perform any lookups in the declared type which were thought to be
22743 dependent, but are not in the scope of the declarator. */
22744 decl_specifiers->type
22747 /* If we're allowing GNU extensions, look for an
22748 asm-specification. */
22750 {
22751 /* Look for an asm-specification. */
22754 }
22755 else
22758 /* Gather the attributes that were provided with the
22759 decl-specifiers. */
22762 /* Look for attributes. */
22766 /* Peek at the next token. */
22772 {
22773 /* Handle C++17 deduction guides. Note that class-scope
22774 non-template deduction guides are instead handled in
22775 cp_parser_member_declaration. */
22777 decl_specifiers,
22778 declarator,
22784 /* Check to see if the token indicates the start of a
22785 function-definition. */
22787 {
22789 {
22790 /* If a function-definition should not appear here, issue an
22791 error message. */
22795 }
22797 location_t func_brace_location
22800 /* Neither attributes nor an asm-specification are allowed
22801 on a function-definition. */
22804 "an %<asm%> specification is not allowed "
22808 "attributes are not allowed "
22810 /* This is a function-definition. */
22813 /* Parse the function definition. */
22816 decl_specifiers,
22817 declarator,
22818 prefix_attributes);
22819 else
22820 decl =
22821 (cp_parser_function_definition_from_specifiers_and_declarator
22825 {
22826 /* This is where the prologue starts... */
22829 }
22832 }
22833 }
22835 {
22836 /* A non-template declaration involving a function parameter list
22837 containing an implicit template parameter will be made into a
22838 template. If the resulting declaration is not going to be an
22839 actual function then finish the template scope here to prevent it.
22840 An error message will be issued once we have a decl to talk about.
22842 FIXME probably we should do type deduction rather than create an
22843 implicit template, but the standard currently doesn't allow it. */
22846 }
22848 /* [dcl.dcl]
22850 Only in function declarations for constructors, destructors, type
22851 conversions, and deduction guides can the decl-specifier-seq be omitted.
22853 We explicitly postpone this check past the point where we handle
22854 function-definitions because we tolerate function-definitions
22855 that are missing their return types in some modes. */
22857 {
22861 }
22863 /* An `=' or an '{' in C++11, indicate an initializer. An '(' may indicate
22864 an initializer as well. */
22868 {
22869 /* Don't get fooled into thinking that F(i)(1)(2) is an initializer.
22870 It isn't; it's an expression. (Here '(i)' would have already been
22871 parsed as a declarator.) */
22874 {
22881 /* If this is an initializer, only a ',' or ';' can follow: either
22882 we have another init-declarator, or we're at the end of an
22883 init-declarator-list which can only be followed by a ';'. */
22888 /* Not an init-declarator. */
22890 }
22902 {
22908 }
22909 }
22910 else
22911 {
22912 /* If the init-declarator isn't initialized and isn't followed by a
22913 `,' or `;', it's not a valid init-declarator. */
22916 {
22919 else
22920 {
22924 }
22925 }
22928 }
22930 /* Because start_decl has side-effects, we should only call it if we
22931 know we're going ahead. By this point, we know that we cannot
22932 possibly be looking at any other construct. */
22935 /* Enter the newly declared entry in the symbol table. If we're
22936 processing a declaration in a class-specifier, we wait until
22937 after processing the initializer. */
22939 {
22947 /* Adjust location of decl if declarator->id_loc is more appropriate:
22948 set, and decl wasn't merged with another decl, in which case its
22949 location would be different from input_location, and more accurate. */
22954 }
22956 /* Enter the SCOPE. That way unqualified names appearing in the
22957 initializer will be looked up in SCOPE. */
22960 /* Perform deferred access control checks, now that we know in which
22961 SCOPE the declared entity resides. */
22963 {
22966 /* If the entity being declared is a function, pretend that we
22967 are in its scope. If it is a `friend', it may have access to
22968 things that would not otherwise be accessible. */
22970 {
22973 }
22975 /* Perform access checks for template parameters. */
22978 /* Perform the access control checks for the declarator and the
22979 decl-specifiers. */
22982 /* Restore the saved value. */
22985 }
22987 /* Parse the initializer. */
22992 {
22994 {
22997 else
22998 {
22999 /* If the declaration was erroneous, we don't really
23000 know what the user intended, so just silently
23001 consume the initializer. */
23008 }
23009 }
23010 else
23011 {
23012 /* We want to record the extra mangling scope for in-class
23013 initializers of class members and initializers of static
23014 data member templates and namespace-scope initializers.
23015 The former involves deferring parsing of the initializer
23016 until end of class as with default arguments. So right
23017 here we only handle the latter two. */
23021 && !member_p
23034 }
23035 }
23037 /* The old parser allows attributes to appear after a parenthesized
23038 initializer. Mark Mitchell proposed removing this functionality
23039 on the GCC mailing lists on 2002-08-13. This parser accepts the
23040 attributes -- but ignores them. Made a permerror in GCC 8. */
23046 {
23049 {
23053 }
23054 }
23056 /* And now complain about a non-function implicit template. */
23061 /* For an in-class declaration, use `grokfield' to create the
23062 declaration. */
23064 {
23066 {
23069 }
23078 }
23080 /* Finish processing the declaration. But, skip member
23081 declarations. */
23083 {
23086 asm_specification,
23087 /* If the initializer is in parentheses, then this is
23088 a direct-initialization, which means that an
23089 `explicit' constructor is OK. Otherwise, an
23090 `explicit' constructor cannot be used. */
23093 }
23096 /* Core issue #226 (C++0x only): A default template-argument
23097 shall not be specified in a friend class template
23098 declaration. */
23107 {
23110 else
23112 }
23119 }
23121 /* Parse a declarator.
23123 declarator:
23124 direct-declarator
23125 ptr-operator declarator
23127 abstract-declarator:
23128 ptr-operator abstract-declarator [opt]
23129 direct-abstract-declarator
23131 GNU Extensions:
23133 declarator:
23134 attributes [opt] direct-declarator
23135 attributes [opt] ptr-operator declarator
23137 abstract-declarator:
23138 attributes [opt] ptr-operator abstract-declarator [opt]
23139 attributes [opt] direct-abstract-declarator
23141 The parser flags FLAGS is used to control type-specifier parsing.
23143 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
23144 detect constructors, destructors, deduction guides, or conversion operators.
23145 It is set to -1 if the declarator is a name, and +1 if it is a
23146 function. Otherwise it is set to zero. Usually you just want to
23147 test for >0, but internally the negative value is used.
23149 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
23150 a decl-specifier-seq unless it declares a constructor, destructor,
23151 or conversion. It might seem that we could check this condition in
23152 semantic analysis, rather than parsing, but that makes it difficult
23153 to handle something like `f()'. We want to notice that there are
23154 no decl-specifiers, and therefore realize that this is an
23155 expression, not a declaration.)
23157 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
23158 the declarator is a direct-declarator of the form "(...)".
23160 MEMBER_P is true iff this declarator is a member-declarator.
23162 FRIEND_P is true iff this declarator is a friend.
23164 STATIC_P is true iff the keyword static was seen. */
23168 cp_parser_declarator_kind dcl_kind,
23169 cp_parser_flags flags,
23173 {
23176 cp_cv_quals cv_quals;
23177 tree class_type;
23180 /* Assume this is not a constructor, destructor, or type-conversion
23181 operator. */
23188 /* Check for the ptr-operator production. */
23190 /* Parse the ptr-operator. */
23196 /* If that worked, then we have a ptr-operator. */
23198 {
23199 /* If a ptr-operator was found, then this declarator was not
23200 parenthesized. */
23203 /* The dependent declarator is optional if we are parsing an
23204 abstract-declarator. */
23208 /* Parse the dependent declarator. */
23214 /* If we are parsing an abstract-declarator, we must handle the
23215 case where the dependent declarator is absent. */
23220 declarator = cp_parser_make_indirect_declarator
23222 }
23223 /* Everything else is a direct-declarator. */
23224 else
23225 {
23228 CPP_OPEN_PAREN);
23232 }
23237 }
23239 /* Parse a direct-declarator or direct-abstract-declarator.
23241 direct-declarator:
23242 declarator-id
23243 direct-declarator ( parameter-declaration-clause )
23244 cv-qualifier-seq [opt]
23245 ref-qualifier [opt]
23246 exception-specification [opt]
23247 direct-declarator [ constant-expression [opt] ]
23248 ( declarator )
23250 direct-abstract-declarator:
23251 direct-abstract-declarator [opt]
23252 ( parameter-declaration-clause )
23253 cv-qualifier-seq [opt]
23254 ref-qualifier [opt]
23255 exception-specification [opt]
23256 direct-abstract-declarator [opt] [ constant-expression [opt] ]
23257 ( abstract-declarator )
23259 Returns a representation of the declarator. DCL_KIND is
23260 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
23261 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
23262 we are parsing a direct-declarator. It is
23263 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
23264 of ambiguity we prefer an abstract declarator, as per
23265 [dcl.ambig.res].
23266 The parser flags FLAGS is used to control type-specifier parsing.
23267 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
23268 as for cp_parser_declarator. */
23272 cp_parser_declarator_kind dcl_kind,
23273 cp_parser_flags flags,
23276 {
23287 {
23288 /* Peek at the next token. */
23291 {
23292 /* This is either a parameter-declaration-clause, or a
23293 parenthesized declarator. When we know we are parsing a
23294 named declarator, it must be a parenthesized declarator
23295 if FIRST is true. For instance, `(int)' is a
23296 parameter-declaration-clause, with an omitted
23297 direct-abstract-declarator. But `((*))', is a
23298 parenthesized abstract declarator. Finally, when T is a
23299 template parameter `(T)' is a
23300 parameter-declaration-clause, and not a parenthesized
23301 named declarator.
23303 We first try and parse a parameter-declaration-clause,
23304 and then try a nested declarator (if FIRST is true).
23306 It is not an error for it not to be a
23307 parameter-declaration-clause, even when FIRST is
23308 false. Consider,
23310 int i (int);
23311 int i (3);
23313 The first is the declaration of a function while the
23314 second is the definition of a variable, including its
23315 initializer.
23317 Having seen only the parenthesis, we cannot know which of
23318 these two alternatives should be selected. Even more
23319 complex are examples like:
23321 int i (int (a));
23322 int i (int (3));
23324 The former is a function-declaration; the latter is a
23325 variable initialization.
23327 Thus again, we try a parameter-declaration-clause, and if
23328 that fails, we back out and return. */
23331 {
23332 tree params;
23337 /* In a member-declarator, the only valid interpretation
23338 of a parenthesis is the start of a
23339 parameter-declaration-clause. (It is invalid to
23340 initialize a static data member with a parenthesized
23341 initializer; only the "=" form of initialization is
23342 permitted.) */
23346 /* Consume the `('. */
23348 matching_parens parens;
23351 {
23352 /* If this is going to be an abstract declarator, we're
23353 in a declarator and we can't have default args. */
23356 }
23360 /* Parse the parameter-declaration-clause. */
23361 params
23363 const location_t parens_end
23366 /* Consume the `)'. */
23369 /* If all went well, parse the cv-qualifier-seq,
23370 ref-qualifier and the exception-specification. */
23372 {
23373 cp_cv_quals cv_quals;
23374 cp_virt_specifiers virt_specifiers;
23375 cp_ref_qualifier ref_qual;
23376 tree exception_specification;
23377 tree late_return;
23378 tree attrs;
23381 unsigned char local_variables_forbidden_p
23383 /* 'this' is not allowed in static member functions. */
23393 /* Parse the cv-qualifier-seq. */
23395 /* Parse the ref-qualifier. */
23397 /* Parse the tx-qualifier. */
23403 /* DR 1207: 'this' is in scope after the cv-quals. */
23406 /* If it turned out that this is e.g. a pointer to a
23407 function, we don't want to delay noexcept parsing. */
23411 /* Parse the exception-specification. */
23412 exception_specification
23414 flags);
23418 cp_omp_declare_simd_data odsd;
23420 && declarator
23423 {
23427 }
23429 /* In here, we handle cases where attribute is used after
23430 the function declaration. For example:
23431 void func (int x) __attribute__((vector(..))); */
23434 late_return
23436 requires_clause);
23440 /* Parse the virt-specifier-seq. */
23444 parens_start,
23445 parens_end);
23446 /* Create the function-declarator. */
23448 params,
23449 cv_quals,
23450 virt_specifiers,
23451 ref_qual,
23452 tx_qual,
23453 exception_specification,
23454 late_return,
23455 requires_clause,
23456 attrs,
23457 parens_loc);
23459 /* Any subsequent parameter lists are to do with
23460 return type, so are not those of the declared
23461 function. */
23467 /* Restore the state of local_variables_forbidden_p. */
23468 parser->local_variables_forbidden_p
23470 }
23472 /* Remove the function parms from scope. */
23476 /* Repeat the main loop. */
23478 }
23480 /* If this is the first, we can try a parenthesized
23481 declarator. */
23483 {
23490 /* Consume the `('. */
23491 matching_parens parens;
23493 /* Parse the nested declarator. */
23496 declarator
23498 ctor_dtor_or_conv_p,
23504 /* Expect a `)'. */
23512 }
23513 /* Otherwise, we must be done. */
23514 else
23516 }
23520 {
23521 /* Parse an array-declarator. */
23531 /* Consume the `['. */
23533 /* Peek at the next token. */
23535 /* If the next token is `]', then there is no
23536 constant-expression. */
23538 {
23540 bounds
23552 {
23553 /* Normally, the array bound must be an integral constant
23554 expression. However, as an extension, we allow VLAs
23555 in function scopes as long as they aren't part of a
23556 parameter declaration. */
23560 }
23563 {
23564 /* Remember this wasn't a constant-expression. */
23567 }
23568 }
23569 else
23571 /* Look for the closing `]'. */
23573 {
23576 }
23581 }
23583 {
23584 {
23585 tree qualifying_scope;
23586 tree unqualified_name;
23587 tree attrs;
23588 special_function_kind sfk;
23593 /* Parse a declarator-id */
23596 {
23599 /* If we see an ellipsis, we should be looking at a
23600 parameter pack. */
23602 {
23603 /* Consume the `...' */
23607 }
23608 }
23611 unqualified_name
23615 {
23619 {
23620 /* Check whether an error occurred. */
23623 /* We already consumed the ellipsis to mark a
23624 parameter pack, but we have no way to report it,
23625 so abort the tentative parse. We will be exiting
23626 immediately anyway. */
23628 }
23629 else
23635 && (qualifying_scope
23637 {
23640 }
23641 }
23646 {
23651 }
23657 {
23658 /* In the declaration of a member of a template class
23659 outside of the class itself, the SCOPE will sometimes
23660 be a TYPENAME_TYPE. For example, given:
23662 template <typename T>
23663 int S<T>::R::i = 3;
23665 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
23666 this context, we must resolve S<T>::R to an ordinary
23667 type, rather than a typename type.
23669 The reason we normally avoid resolving TYPENAME_TYPEs
23670 is that a specialization of `S' might render
23671 `S<T>::R' not a type. However, if `S' is
23672 specialized, then this `i' will not be used, so there
23673 is no harm in resolving the types here. */
23674 tree type;
23676 /* Resolve the TYPENAME_TYPE. */
23679 /* If that failed, the declarator is invalid. */
23681 {
23684 "cannot define member of dependent typedef "
23686 else
23691 }
23693 }
23698 {
23699 tree class_type;
23704 else
23708 {
23712 {
23713 /* We do not attempt to print the declarator
23714 here because we do not have enough
23715 information about its original syntactic
23716 form. */
23720 }
23723 {
23727 "use %<%T::%D%> instead of %<%T::%D%> to "
23729 class_type,
23734 }
23736 }
23739 {
23746 for an unnamed type, even if the type
23747 got a name for linkage purposes. */
23749 /* Handle correctly (c++/19200):
23751 struct S {
23752 struct T{};
23753 friend void S(T);
23754 };
23756 and also:
23758 namespace N {
23759 void S();
23760 }
23762 struct S {
23763 friend void N::S();
23764 }; */
23767 class_type))
23776 }
23777 }
23779 unqualified_name,
23787 /* We're looking for this case in [temp.res]:
23788 A qualified-id is assumed to name a type if [...]
23789 - it is a decl-specifier of the decl-specifier-seq of a
23790 parameter-declaration in a declarator of a function or
23791 function template declaration, ... */
23797 {
23798 /* ...whose declarator-id is qualified. If it isn't, never
23799 assume the parameters to refer to types. */
23802 else
23803 {
23804 /* Now we have something like
23805 template <typename T> int C::x(S::p);
23806 which can be a function template declaration or a
23807 variable template definition. If name lookup for
23808 the declarator-id C::x finds one or more function
23809 templates, assume S::p to name a type. Otherwise,
23810 don't. */
23811 tree decl
23813 none_type,
23821 /* Allow
23822 template<typename T>
23823 A<T>::A(T::type) { } */
23826 qualifying_scope)))
23828 }
23829 }
23830 }
23832 handle_declarator:;
23835 {
23836 /* Any names that appear after the declarator-id for a
23837 member are looked up in the containing scope. */
23839 {
23840 /* But declarations with qualified-ids can't appear in a
23841 function. */
23845 }
23847 }
23851 /* Default args are only allowed on function
23852 declarations. */
23854 else
23858 }
23859 /* We're done. */
23860 else
23862 }
23864 /* For an abstract declarator, we might wind up with nothing at this
23865 point. That's an error; the declarator is not optional. */
23869 {
23870 /* Record overly parenthesized declarator so we can give a
23871 diagnostic about confusing decl/expr disambiguation. */
23873 {
23874 /* If the open and close parens are on different lines, this
23875 is probably a formatting thing, so ignore. */
23880 }
23885 }
23887 /* If we entered a scope, we must exit it now. */
23895 }
23897 /* Parse a ptr-operator.
23899 ptr-operator:
23900 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
23901 * cv-qualifier-seq [opt]
23902 &
23903 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
23904 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
23906 GNU Extension:
23908 ptr-operator:
23909 & cv-qualifier-seq [opt]
23911 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
23912 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
23913 an rvalue reference. In the case of a pointer-to-member, *TYPE is
23914 filled in with the TYPE containing the member. *CV_QUALS is
23915 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
23916 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
23917 Note that the tree codes returned by this function have nothing
23918 to do with the types of trees that will be eventually be created
23919 to represent the pointer or reference type being parsed. They are
23920 just constants with suggestive names. */
23921 static enum tree_code
23926 {
23931 /* Assume that it's not a pointer-to-member. */
23933 /* And that there are no cv-qualifiers. */
23936 /* Peek at the next token. */
23939 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
23949 {
23950 /* Consume the `*', `&' or `&&'. */
23953 /* A `*' can be followed by a cv-qualifier-seq, and so can a
23954 `&', if we are allowing GNU extensions. (The only qualifier
23955 that can legally appear after `&' is `restrict', but that is
23956 enforced during semantic analysis. */
23964 }
23965 else
23966 {
23967 /* Try the pointer-to-member case. */
23969 /* Look for the optional `::' operator. */
23972 /* Look for the nested-name specifier. */
23979 /* If we found it, and the next token is a `*', then we are
23980 indeed looking at a pointer-to-member operator. */
23983 {
23984 /* Indicate that the `*' operator was used. */
23992 else
23993 {
23994 /* The type of which the member is a member is given by the
23995 current SCOPE. */
23997 /* The next name will not be qualified. */
24001 /* Look for optional c++11 attributes. */
24005 /* Look for the optional cv-qualifier-seq. */
24007 }
24008 }
24009 /* If that didn't work we don't have a ptr-operator. */
24012 }
24015 }
24017 /* Parse an (optional) cv-qualifier-seq.
24019 cv-qualifier-seq:
24020 cv-qualifier cv-qualifier-seq [opt]
24022 cv-qualifier:
24023 const
24024 volatile
24026 GNU Extension:
24028 cv-qualifier:
24029 __restrict__
24031 Returns a bitmask representing the cv-qualifiers. */
24033 static cp_cv_quals
24035 {
24039 {
24041 cp_cv_quals cv_qualifier;
24043 /* Peek at the next token. */
24045 /* See if it's a cv-qualifier. */
24047 {
24063 }
24069 {
24074 }
24075 else
24076 {
24079 }
24080 }
24083 }
24085 /* Parse an (optional) ref-qualifier
24087 ref-qualifier:
24088 &
24089 &&
24091 Returns cp_ref_qualifier representing ref-qualifier. */
24093 static cp_ref_qualifier
24095 {
24098 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
24103 {
24108 {
24120 }
24125 {
24128 }
24129 else
24130 {
24133 }
24134 }
24137 }
24139 /* Parse an optional tx-qualifier.
24141 tx-qualifier:
24142 transaction_safe
24143 transaction_safe_dynamic */
24145 static tree
24147 {
24150 {
24155 {
24159 {
24162 {
24165 }
24166 else
24168 }
24169 }
24170 }
24172 }
24174 /* Parse an (optional) virt-specifier-seq.
24176 virt-specifier-seq:
24177 virt-specifier virt-specifier-seq [opt]
24179 virt-specifier:
24180 override
24181 final
24183 Returns a bitmask representing the virt-specifiers. */
24185 static cp_virt_specifiers
24187 {
24191 {
24193 cp_virt_specifiers virt_specifier;
24195 /* Peek at the next token. */
24197 /* See if it's a virt-specifier-qualifier. */
24201 {
24204 }
24206 {
24209 }
24211 {
24213 }
24214 else
24218 {
24223 }
24224 else
24225 {
24228 }
24229 }
24231 }
24233 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
24234 is in scope even though it isn't real. */
24236 void
24238 {
24239 tree this_parm;
24242 {
24243 /* We don't clear this between NSDMIs. Is it already what we want? */
24250 }
24253 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
24255 current_class_ref
24258 }
24260 /* Return true iff our current scope is a non-static data member
24261 initializer. */
24263 bool
24265 {
24266 /* We recognize NSDMI context by the context-less 'this' pointer set up
24267 by the function above. */
24273 }
24275 /* True if we're parsing a function declarator. */
24277 bool
24279 {
24280 /* this_entity is NULL for a function parameter scope while parsing the
24281 declarator; it is set when parsing the body of the function. */
24284 }
24286 /* Parse a late-specified return type, if any. This is not a separate
24287 non-terminal, but part of a function declarator, which looks like
24289 -> trailing-type-specifier-seq abstract-declarator(opt)
24291 Returns the type indicated by the type-id.
24293 In addition to this, parse any queued up #pragma omp declare simd
24294 clauses, and #pragma acc routine clauses.
24296 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
24297 function. */
24299 static tree
24302 {
24306 && declarator
24310 && declarator
24313 /* Peek at the next token. */
24315 /* A late-specified return type is indicated by an initial '->'. */
24324 {
24325 /* Consume the ->. */
24329 }
24331 /* Function declarations may be followed by a trailing
24332 requires-clause. */
24336 declarator->attributes
24340 declarator->attributes
24345 }
24347 /* Parse a declarator-id.
24349 declarator-id:
24350 id-expression
24351 :: [opt] nested-name-specifier [opt] type-name
24353 In the `id-expression' case, the value returned is as for
24354 cp_parser_id_expression if the id-expression was an unqualified-id.
24355 If the id-expression was a qualified-id, then a SCOPE_REF is
24356 returned. The first operand is the scope (either a NAMESPACE_DECL
24357 or TREE_TYPE), but the second is still just a representation of an
24358 unqualified-id. */
24360 static tree
24362 {
24363 tree id;
24364 /* The expression must be an id-expression. Assume that qualified
24365 names are the names of types so that:
24367 template <class T>
24368 int S<T>::R::i = 3;
24370 will work; we must treat `S<T>::R' as the name of a type.
24371 Similarly, assume that qualified names are templates, where
24372 required, so that:
24374 template <class T>
24375 int S<T>::R<T>::i = 3;
24377 will work, too. */
24383 optional_p);
24387 }
24389 /* Parse a type-id.
24391 type-id:
24392 type-specifier-seq abstract-declarator [opt]
24394 The parser flags FLAGS is used to control type-specifier parsing.
24396 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
24398 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24399 i.e. we've just seen "->".
24401 Returns the TYPE specified. */
24403 static tree
24407 {
24408 cp_decl_specifier_seq type_specifier_seq;
24411 /* Parse the type-specifier-seq. */
24414 is_trailing_return,
24422 /* A bare template name as a template argument is a template template
24423 argument, not a placeholder, so fail parsing it as a type argument. */
24424 {
24428 }
24432 /* There might or might not be an abstract declarator. */
24434 /* Look for the declarator. */
24435 abstract_declarator
24442 /* Check to see if there really was a declarator. */
24447 /* The concepts TS allows 'auto' as a type-id. */
24450 /* DR 625 prohibits use of auto as a template-argument. We allow 'auto'
24451 outside the template-argument-list context here only for the sake of
24452 diagnostic: grokdeclarator then can emit a better error message for
24453 e.g. using T = auto. */
24459 && !auto_typeid_ok
24460 /* None of the valid uses of 'auto' in C++14 involve the type-id
24461 nonterminal, but it is valid in a trailing-return-type. */
24464 {
24465 /* A type-id with type 'auto' is only ok if the abstract declarator
24466 is a function declarator with a late-specified return type.
24468 A type-id with 'auto' is also valid in a trailing-return-type
24469 in a compound-requirement. */
24476 else
24477 {
24479 {
24482 {
24483 auto_diagnostic_group g;
24487 tmpl);
24489 tmpl);
24490 }
24493 auto_node);
24494 else
24496 }
24498 }
24499 }
24502 is_template_arg);
24503 }
24505 /* Wrapper for cp_parser_type_id_1. */
24507 static tree
24510 {
24512 }
24514 /* Wrapper for cp_parser_type_id_1. */
24516 static tree
24518 {
24519 tree r;
24521 parser->type_definition_forbidden_message
24526 {
24529 }
24531 }
24533 /* Wrapper for cp_parser_type_id_1. */
24535 static tree
24537 {
24540 }
24542 /* Parse a type-specifier-seq.
24544 type-specifier-seq:
24545 type-specifier type-specifier-seq [opt]
24547 GNU extension:
24549 type-specifier-seq:
24550 attributes type-specifier-seq [opt]
24552 The parser flags FLAGS is used to control type-specifier parsing.
24554 If IS_DECLARATION is true, we are at the start of a "condition" or
24555 exception-declaration, so we might be followed by a declarator-id.
24557 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24558 i.e. we've just seen "->".
24560 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
24562 static void
24564 cp_parser_flags flags,
24568 {
24572 /* Clear the TYPE_SPECIFIER_SEQ. */
24576 /* In the context of a trailing return type, enum E { } is an
24577 elaborated-type-specifier followed by a function-body, not an
24578 enum-specifier. */
24582 /* Parse the type-specifiers and attributes. */
24584 {
24585 tree type_specifier;
24588 /* Check for attributes first. */
24590 {
24591 /* GNU attributes at the end of a declaration apply to the
24592 declaration as a whole, not to the trailing return type. So look
24593 ahead to see if these attributes are at the end. */
24596 {
24602 }
24603 type_specifier_seq->attributes
24607 }
24609 /* record the token of the beginning of the type specifier seq,
24610 for error reporting purposes*/
24614 /* Look for the type-specifier. */
24616 flags,
24617 type_specifier_seq,
24619 NULL,
24622 {
24623 /* If the first type-specifier could not be found, this is not a
24624 type-specifier-seq at all. */
24626 {
24627 /* Set in_declarator_p to avoid skipping to the semicolon. */
24639 }
24640 /* If subsequent type-specifiers could not be found, the
24641 type-specifier-seq is complete. */
24643 }
24646 /* The standard says that a condition can be:
24648 type-specifier-seq declarator = assignment-expression
24650 However, given:
24652 struct S {};
24653 if (int S = ...)
24655 we should treat the "S" as a declarator, not as a
24656 type-specifier. The standard doesn't say that explicitly for
24657 type-specifier-seq, but it does say that for
24658 decl-specifier-seq in an ordinary declaration. Perhaps it
24659 would be clearer just to allow a decl-specifier-seq here, and
24660 then add a semantic restriction that if any decl-specifiers
24661 that are not type-specifiers appear, the program is invalid. */
24664 }
24665 }
24667 /* Return whether the function currently being declared has an associated
24668 template parameter list. */
24670 static bool
24672 {
24685 }
24687 /* Parse a parameter-declaration-clause.
24689 parameter-declaration-clause:
24690 parameter-declaration-list [opt] ... [opt]
24691 parameter-declaration-list , ...
24693 The parser flags FLAGS is used to control type-specifier parsing.
24695 Returns a representation for the parameter declarations. A return
24696 value of NULL indicates a parameter-declaration-clause consisting
24697 only of an ellipsis. */
24699 static tree
24701 cp_parser_flags flags)
24702 {
24703 tree parameters;
24711 && !processing_template_parmlist
24712 && !processing_explicit_instantiation
24713 /* default_arg_ok_p tracks whether this is a parameter-clause for an
24714 actual function or a random abstract declarator. */
24720 /* Peek at the next token. */
24722 /* Check for trivial parameter-declaration-clauses. */
24724 {
24725 /* Consume the `...' token. */
24728 }
24730 /* There are no parameters. */
24732 /* Check for `(void)', too, which is a special case. */
24736 {
24737 /* Consume the `void' token. */
24739 /* There are no parameters. */
24741 }
24743 /* A vector of parameters that haven't been pushed yet. */
24746 /* Parse the parameter-declaration-list. */
24749 /* If a parse error occurred while parsing the
24750 parameter-declaration-list, then the entire
24751 parameter-declaration-clause is erroneous. */
24755 /* Peek at the next token. */
24757 /* If it's a `,', the clause should terminate with an ellipsis. */
24759 {
24760 /* Consume the `,'. */
24762 /* Expect an ellipsis. */
24763 ellipsis_p
24765 }
24766 /* It might also be `...' if the optional trailing `,' was
24767 omitted. */
24769 {
24770 /* Consume the `...' token. */
24772 /* And remember that we saw it. */
24774 }
24775 else
24778 /* A valid parameter-declaration-clause can only be followed by a ')'.
24779 So it's time to push all the parameters we have seen now that we
24780 know we have a valid declaration. Note that here we may not have
24781 committed yet, nor should we. Pushing here will detect the error
24782 of redefining a parameter. */
24787 /* Finish the parameter list. */
24792 }
24794 /* Parse a parameter-declaration-list.
24796 parameter-declaration-list:
24797 parameter-declaration
24798 parameter-declaration-list , parameter-declaration
24800 The parser flags FLAGS is used to control type-specifier parsing.
24801 PENDING_DECLS is a vector of parameters that haven't been pushed yet.
24803 Returns a representation of the parameter-declaration-list, as for
24804 cp_parser_parameter_declaration_clause. However, the
24805 `void_list_node' is never appended to the list. */
24807 static tree
24809 cp_parser_flags flags,
24811 {
24817 /* The special considerations that apply to a function within an
24818 unbraced linkage specifications do not apply to the parameters
24819 to the function. */
24820 saved_in_unbraced_linkage_specification_p
24824 /* Look for more parameters. */
24826 {
24831 /* Parse the parameter. */
24832 parameter
24837 /* We don't know yet if the enclosing context is unavailable or deprecated,
24838 so wait and deal with it in grokparms if appropriate. */
24842 {
24845 PARM,
24850 }
24854 /* If a parse error occurred parsing the parameter declaration,
24855 then the entire parameter-declaration-list is erroneous. */
24857 {
24860 }
24867 {
24868 /* We cannot always pushdecl while parsing tentatively because
24869 it may have side effects and we can't be sure yet if we're
24870 parsing a declaration, e.g.:
24872 S foo(int(x), int(x), int{x});
24874 where it's not clear if we're dealing with a constructor call
24875 or a function declaration until we've seen the last argument
24876 which breaks it up.
24877 It's safe to pushdecl so long as it doesn't result in a clash
24878 with an already-pushed parameter. But we don't delay pushing
24879 different parameters to handle
24881 S foo(int(i), decltype(i) j = 42);
24883 which is valid. */
24886 /* See if PARAMETERS already contains a parameter with the same
24887 DECL_NAME as DECL. */
24893 }())
24895 else
24897 }
24900 {
24904 }
24906 /* Add the new parameter to the list. */
24910 /* If the parameters were parenthesized, it's the case of
24911 T foo(X(x)) which looks like a variable definition but
24912 is a function declaration. */
24916 /* Peek at the next token. */
24919 /* These are for Objective-C++ */
24922 /* The parameter-declaration-list is complete. */
24925 {
24928 /* Peek at the next token. */
24930 /* If it's an ellipsis, then the list is complete. */
24933 /* Otherwise, there must be more parameters. Consume the
24934 `,'. */
24936 /* When parsing something like:
24938 int i(float f, double d)
24940 we can tell after seeing the declaration for "f" that we
24941 are not looking at an initialization of a variable "i",
24942 but rather at the declaration of a function "i".
24944 Due to the fact that the parsing of template arguments
24945 (as specified to a template-id) requires backtracking we
24946 cannot use this technique when inside a template argument
24947 list. */
24951 /* However, a parameter-declaration of the form
24952 "float(f)" (which is a valid declaration of a
24953 parameter "f") can also be interpreted as an
24954 expression (the conversion of "f" to "float"). */
24957 }
24958 else
24959 {
24967 }
24968 }
24970 parser->in_unbraced_linkage_specification_p
24973 /* Reset implicit_template_scope if we are about to leave the function
24974 parameter list that introduced it. Note that for out-of-line member
24975 definitions, there will be one or more class scopes before we get to
24976 the template parameter scope. */
24980 {
24984 {
24987 }
24988 }
24991 }
24993 /* Parse a parameter declaration.
24995 parameter-declaration:
24996 decl-specifier-seq ... [opt] declarator
24997 decl-specifier-seq declarator = assignment-expression
24998 decl-specifier-seq ... [opt] abstract-declarator [opt]
24999 decl-specifier-seq abstract-declarator [opt] = assignment-expression
25001 The parser flags FLAGS is used to control type-specifier parsing.
25003 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
25004 declares a template parameter. (In that case, a non-nested `>'
25005 token encountered during the parsing of the assignment-expression
25006 is not interpreted as a greater-than operator.)
25008 Returns a representation of the parameter, or NULL if an error
25009 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
25010 true iff the declarator is of the form "(p)". */
25014 cp_parser_flags flags,
25017 {
25019 cp_decl_specifier_seq decl_specifiers;
25021 tree default_argument;
25026 /* In a template parameter, `>' is not an operator.
25028 [temp.param]
25030 When parsing a default template-argument for a non-type
25031 template-parameter, the first non-nested `>' is taken as the end
25032 of the template parameter-list rather than a greater-than
25033 operator. */
25035 /* Type definitions may not appear in parameter types. */
25037 parser->type_definition_forbidden_message
25044 /* Parse the declaration-specifiers. */
25047 flags,
25051 /* [dcl.spec.auto.general]: "A placeholder-type-specifier of the form
25052 type-constraint opt auto can be used as a decl-specifier of the
25053 decl-specifier-seq of a parameter-declaration of a function declaration
25054 or lambda-expression..." but we must not synthesize an implicit template
25055 type parameter in its declarator. That is, in "void f(auto[auto{10}]);"
25056 we want to synthesize only the first auto. */
25060 /* Complain about missing 'typename' or other invalid type names. */
25065 /* If an error occurred, there's no reason to attempt to parse the
25066 rest of the declaration. */
25068 {
25071 }
25073 /* Peek at the next token. */
25076 /* If the next token is a `)', `,', `=', `>', or `...', then there
25077 is no declarator. However, when variadic templates are enabled,
25078 there may be a declarator following `...'. */
25083 {
25087 }
25088 /* Otherwise, there should be a declarator. */
25089 else
25090 {
25094 /* After seeing a decl-specifier-seq, if the next token is not a
25095 "(" or "{", there is no possibility that the code is a valid
25096 expression. Therefore, if parsing tentatively, we commit at
25097 this point. */
25099 /* In an expression context, having seen:
25101 (int((char ...
25103 we cannot be sure whether we are looking at a
25104 function-type (taking a "char" as a parameter) or a cast
25105 of some object of type "char" to "int". */
25109 {
25111 {
25114 /* This is a CTAD expression, not a parameter declaration. */
25116 }
25117 else
25119 }
25120 /* Parse the declarator. */
25123 CP_PARSER_DECLARATOR_EITHER,
25124 CP_PARSER_FLAGS_NONE,
25126 parenthesized_p,
25131 /* After the declarator, allow more attributes. */
25132 decl_specifiers.attributes
25136 /* If the declarator is a template parameter pack, remember that and
25137 clear the flag in the declarator itself so we don't get errors
25138 from grokdeclarator. */
25140 {
25143 }
25144 }
25146 /* If the next token is an ellipsis, and we have not seen a declarator
25147 name, and if either the type of the declarator contains parameter
25148 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
25149 for, eg, abbreviated integral type names), then we actually have a
25150 parameter pack expansion expression. Otherwise, leave the ellipsis
25151 for a C-style variadic function. */
25154 /* If a function parameter pack was specified and an implicit template
25155 parameter was introduced during cp_parser_parameter_declaration,
25156 change any implicit parameters introduced into packs. */
25161 {
25169 }
25172 {
25183 {
25184 /* Consume the `...'. */
25188 /* Build a pack expansion type */
25193 else
25195 }
25196 }
25198 /* The restriction on defining new types applies only to the type
25199 of the parameter, not to the default argument. */
25202 /* If the next token is `=', then process a default argument. */
25204 {
25209 /* If we are defining a class, then the tokens that make up the
25210 default argument must be saved and processed later. */
25216 /* A constrained-type-specifier may declare a type
25217 template-parameter. */
25219 default_argument
25222 /* A constrained-type-specifier may declare a
25223 template-template-parameter. */
25225 default_argument
25228 /* Outside of a class definition, we can just parse the
25229 assignment-expression. */
25230 else
25231 default_argument
25235 {
25237 "default arguments are only "
25239 }
25241 || template_parameter_pack_p
25244 {
25245 /* Find the name of the parameter pack. */
25252 template_parm_p
25258 else
25260 template_parm_p
25267 }
25268 }
25269 else
25275 /* Generate a location for the parameter, ranging from the start of the
25276 initial token to the end of the final token (using input_location for
25277 the latter, set up by cp_lexer_set_source_position_from_token when
25278 consuming tokens).
25280 If we have a identifier, then use it for the caret location, e.g.
25282 extern int callee (int one, int (*two)(int, int), float three);
25283 ~~~~~~^~~~~~~~~~~~~~
25285 otherwise, reuse the start location for the caret location e.g.:
25287 extern int callee (int one, int (*)(int, int), float three);
25288 ^~~~~~~~~~~~~~~~~
25290 */
25296 input_location);
25299 declarator,
25300 default_argument,
25301 param_loc,
25302 template_parameter_pack_p);
25303 }
25305 /* Parse a default argument and return it.
25307 TEMPLATE_PARM_P is true if this is a default argument for a
25308 non-type template parameter. */
25309 static tree
25311 {
25317 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
25318 set correctly. */
25325 /* Local variable names (and the `this' keyword) may not
25326 appear in a default argument. */
25329 /* Parse the assignment-expression. */
25334 /* The "this" pointer is not valid in a default argument. */
25336 {
25341 }
25342 default_argument
25344 /* Restore the "this" pointer. */
25346 {
25349 }
25358 }
25360 /* Parse a function-body.
25362 function-body:
25363 compound_statement */
25365 static void
25367 {
25371 }
25373 /* Parse a ctor-initializer-opt followed by a function-body. Return
25374 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
25375 is true we are parsing a function-try-block. */
25377 static void
25380 {
25382 const bool check_body_p
25390 {
25393 "function-try-block body of %<constexpr%> constructor only "
25395 else
25397 "function-try-block body of %<constexpr%> function only "
25399 }
25401 /* Begin the function body. */
25403 /* Parse the optional ctor-initializer. */
25406 /* If we're parsing a constexpr constructor definition, we need
25407 to check that the constructor body is indeed empty. However,
25408 before we get to cp_parser_function_body lot of junk has been
25409 generated, so we can't just check that we have an empty block.
25410 Rather we take a snapshot of the outermost block, and check whether
25411 cp_parser_function_body changed its state. */
25413 {
25417 }
25418 /* Parse the function-body. */
25422 /* Finish the function body. */
25424 }
25426 /* Parse an initializer.
25428 initializer:
25429 = initializer-clause
25430 ( expression-list )
25432 Returns an expression representing the initializer. If no
25433 initializer is present, NULL_TREE is returned.
25435 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
25436 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
25437 set to TRUE if there is no initializer present. If there is an
25438 initializer, and it is not a constant-expression, *NON_CONSTANT_P
25439 is set to true; otherwise it is set to false. */
25441 static tree
25444 {
25446 tree init;
25448 /* Peek at the next token. */
25451 /* Let our caller know whether or not this initializer was
25452 parenthesized. */
25454 /* Assume that the initializer is constant. */
25458 {
25459 /* Consume the `='. */
25461 /* Parse the initializer-clause. */
25463 }
25465 {
25470 non_constant_p);
25475 }
25477 {
25482 }
25483 else
25484 {
25485 /* Anything else is an error. */
25488 }
25494 }
25496 /* Parse an initializer-clause.
25498 initializer-clause:
25499 assignment-expression
25500 braced-init-list
25502 Returns an expression representing the initializer.
25504 If the `assignment-expression' production is used the value
25505 returned is simply a representation for the expression.
25507 Otherwise, calls cp_parser_braced_list. */
25509 static cp_expr
25511 {
25512 cp_expr initializer;
25514 /* Assume the expression is constant. */
25517 /* If it is not a `{', then we are looking at an
25518 assignment-expression. */
25520 {
25521 initializer
25524 non_constant_p);
25525 }
25526 else
25530 }
25532 /* Parse a brace-enclosed initializer list.
25534 braced-init-list:
25535 { initializer-list , [opt] }
25536 { designated-initializer-list , [opt] }
25537 { }
25539 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
25540 the elements of the initializer-list (or NULL, if the last
25541 production is used). The TREE_TYPE for the CONSTRUCTOR will be
25542 NULL_TREE. There is no way to detect whether or not the optional
25543 trailing `,' was provided. NON_CONSTANT_P is as for
25544 cp_parser_initializer. */
25546 static cp_expr
25548 {
25549 tree initializer;
25552 /* Consume the `{' token. */
25553 matching_braces braces;
25555 /* Create a CONSTRUCTOR to represent the braced-initializer. */
25557 /* If it's not a `}', then there is a non-trivial initializer. */
25559 {
25561 /* Parse the initializer list. */
25565 /* A trailing `,' token is allowed. */
25568 }
25569 else
25571 /* Now, there should be a trailing `}'. */
25578 /* Build a location of the form:
25579 { ... }
25580 ^~~~~~~
25581 with caret==start at the open brace, finish at the close brace. */
25585 }
25587 /* Consume tokens up to, but not including, the next non-nested closing `]'.
25588 Returns true iff we found a closing `]'. */
25590 static bool
25592 {
25596 {
25600 {
25604 /* FALLTHRU */
25607 /* If we've run out of tokens, then there is no closing `]'. */
25621 }
25623 /* Consume the current token, skipping it. */
25625 }
25626 }
25628 /* Consume tokens up to, and including, the next non-nested closing `]'.
25629 Returns true iff we found a closing `]'. */
25631 static bool
25633 {
25638 }
25640 /* Return true if we are looking at an array-designator, false otherwise. */
25642 static bool
25644 {
25645 /* Consume the `['. */
25650 /* Skip tokens until the next token is a closing square bracket.
25651 If we find the closing `]', and the next token is a `=', then
25652 we are looking at an array designator. */
25653 bool array_designator_p
25657 /* Roll back the tokens we skipped. */
25661 }
25663 /* Parse an initializer-list.
25665 initializer-list:
25666 initializer-clause ... [opt]
25667 initializer-list , initializer-clause ... [opt]
25669 C++20 Extension:
25671 designated-initializer-list:
25672 designated-initializer-clause
25673 designated-initializer-list , designated-initializer-clause
25675 designated-initializer-clause:
25676 designator brace-or-equal-initializer
25678 designator:
25679 . identifier
25681 GNU Extension:
25683 initializer-list:
25684 designation initializer-clause ...[opt]
25685 initializer-list , designation initializer-clause ...[opt]
25687 designation:
25688 . identifier =
25689 identifier :
25690 [ constant-expression ] =
25692 Returns a vec of constructor_elt. The VALUE of each elt is an expression
25693 for the initializer. If the INDEX of the elt is non-NULL, it is the
25694 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
25695 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
25696 are any designators. */
25701 {
25706 /* Assume all of the expressions are constant. */
25712 /* Parse the rest of the list. */
25714 {
25716 tree designator;
25717 tree initializer;
25721 /* Handle the C++20 syntax, '. id ='. */
25729 {
25732 "C++ designated initializers only available with "
25734 /* Consume the `.'. */
25736 /* Consume the identifier. */
25739 /* Consume the `='. */
25741 }
25742 /* Also, if the next token is an identifier and the following one is a
25743 colon, we are looking at the GNU designated-initializer
25744 syntax. */
25749 {
25750 /* Warn the user that they are using an extension. */
25753 /* Consume the identifier. */
25755 /* Consume the `:'. */
25757 }
25758 /* Also handle C99 array designators, '[ const ] ='. */
25762 {
25763 /* In C++11, [ could start a lambda-introducer. */
25769 {
25772 }
25773 else
25774 {
25779 }
25784 && (!require_potential_rvalue_constant_expression
25788 /* Warn the user that they are using an extension. */
25791 }
25792 else
25796 {
25799 }
25803 {
25807 }
25811 /* Parse the initializer. */
25814 /* If any clause is non-constant, so is the entire initializer. */
25818 /* If we have an ellipsis, this is an initializer pack
25819 expansion. */
25821 {
25824 /* Consume the `...'. */
25831 /* Turn the initializer into an initializer expansion. */
25833 }
25835 /* Add it to the vector. */
25838 /* If the next token is not a comma, we have reached the end of
25839 the list. */
25843 /* Peek at the next token. */
25845 /* If the next token is a `}', then we're still done. An
25846 initializer-clause can have a trailing `,' after the
25847 initializer-list and before the closing `}'. */
25851 /* Suppress location wrappers in a long initializer to save memory
25852 (14179). The cutoff is chosen arbitrarily. */
25856 /* Look one level down because it's easy. Looking deeper would require
25857 passing down a nelts pointer, and I don't think multi-level massive
25858 initializers are common enough to justify this. */
25864 /* Consume the `,' token. */
25866 }
25868 /* The same identifier shall not appear in multiple designators
25869 of a designated-initializer-list. */
25871 {
25876 {
25878 {
25880 "%<.%s%> designator used multiple times in "
25884 }
25885 else
25887 }
25891 }
25897 }
25899 /* Classes [gram.class] */
25901 /* Parse a class-name.
25903 class-name:
25904 identifier
25905 template-id
25907 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
25908 to indicate that names looked up in dependent types should be
25909 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
25910 keyword has been used to indicate that the name that appears next
25911 is a template. TAG_TYPE indicates the explicit tag given before
25912 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
25913 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
25914 is the class being defined in a class-head. If ENUM_OK is TRUE,
25915 enum-names are also accepted.
25917 Returns the TYPE_DECL representing the class. */
25919 static tree
25928 {
25929 tree decl;
25932 /* All class-names start with an identifier. */
25935 {
25938 }
25940 /* PARSER->SCOPE can be cleared when parsing the template-arguments
25941 to a template-id, so we save it here. Consider object scope too,
25942 so that make_typename_type below can use it (cp_parser_template_name
25943 considers object scope also). This may happen with code like
25945 p->template A<T>::a()
25947 where we first want to look up A<T>::a in the class of the object
25948 expression, as per [basic.lookup.classref]. */
25950 /* This only checks parser->scope to avoid duplicate errors; if
25951 ->object_type is erroneous, go on to give a parse error. */
25955 /* Any name names a type if we're following the `typename' keyword
25956 in a qualified name where the enclosing scope is type-dependent. */
25961 /* Handle the common case (an identifier, but not a template-id)
25962 efficiently. */
25965 {
25969 /* Look for the identifier. */
25973 /* If the next token isn't an identifier, we are certainly not
25974 looking at a class-name. */
25977 /* If we know this is a type-name, there's no need to look it
25978 up. */
25981 else
25982 {
25983 tree ambiguous_decls;
25984 /* If we already know that this lookup is ambiguous, then
25985 we've already issued an error message; there's no reason
25986 to check again. */
25988 {
25991 }
25992 /* If the next token is a `::', then the name must be a type
25993 name.
25995 [basic.lookup.qual]
25997 During the lookup for a name preceding the :: scope
25998 resolution operator, object, function, and enumerator
25999 names are ignored. */
26002 /* Look up the name. */
26004 tag_type,
26007 check_dependency_p,
26011 {
26015 }
26016 }
26017 }
26018 else
26019 {
26020 /* Try a template-id. */
26022 check_dependency_p,
26023 tag_type,
26024 is_declaration);
26027 }
26031 /* If this is a typename, create a TYPENAME_TYPE. */
26033 {
26038 }
26042 /* Check to see that it is really the name of a class. */
26046 /* Situations like this:
26048 template <typename T> struct A {
26049 typename T::template X<int>::I i;
26050 };
26052 are problematic. Is `T::template X<int>' a class-name? The
26053 standard does not seem to be definitive, but there is no other
26054 valid interpretation of the following `::'. Therefore, those
26055 names are considered class-names. */
26056 {
26060 }
26065 /* In Objective-C 2.0, a classname followed by '.' starts a
26066 dot-syntax expression, and it's not a type-name. */
26078 }
26080 /* Make sure that any member-function parameters are in scope.
26081 For instance, a function's noexcept-specifier can use the function's
26082 parameters:
26084 struct S {
26085 void fn (int p) noexcept(noexcept(p));
26086 };
26088 so we need to make sure name lookup can find them. This is used
26089 when we delay parsing of the noexcept-specifier. */
26091 static void
26093 {
26100 {
26104 }
26105 }
26107 /* Undo the effects of inject_parm_decls. */
26109 static void
26111 {
26114 }
26116 /* Parse a class-specifier.
26118 class-specifier:
26119 class-head { member-specification [opt] }
26121 Returns the TREE_TYPE representing the class. */
26123 tree
26125 {
26128 tree type;
26142 /* Parse the class-head. */
26145 /* If the class-head was a semantic disaster, skip the entire body
26146 of the class. */
26148 {
26152 }
26154 /* Look for the `{'. */
26155 matching_braces braces;
26157 {
26160 }
26165 /* Issue an error message if type-definitions are forbidden here. */
26167 /* Remember that we are defining one more class. */
26169 /* Inside the class, surrounding template-parameter-lists do not
26170 apply. */
26171 saved_num_template_parameter_lists
26174 /* We are not in a function body. */
26177 /* Or in a loop. */
26180 /* Or in a switch. */
26183 /* We are not immediately inside an extern "lang" block. */
26184 saved_in_unbraced_linkage_specification_p
26187 /* 'this' from an enclosing non-static member function is unavailable. */
26193 /* Start the class. */
26195 {
26197 /* SCOPE must be a scope nested inside current scope. */
26201 else
26203 }
26207 /* If the type is erroneous, skip the entire body of the class. */
26209 else
26210 /* Parse the member-specification. */
26213 /* Look for the trailing `}'. */
26215 /* Look for trailing attributes to apply to this class. */
26223 /* We've finished a type definition. Check for the common syntax
26224 error of forgetting a semicolon after the definition. We need to
26225 be careful, as we can't just check for not-a-semicolon and be done
26226 with it; the user might have typed:
26228 class X { } c = ...;
26229 class X { } *p = ...;
26231 and so forth. Instead, enumerate all the possible tokens that
26232 might follow this production; if we don't see one of them, then
26233 complain and silently insert the semicolon. */
26234 {
26239 /* Don't try to parse c++11 attributes here. As per the
26240 grammar, that should be a task for
26241 cp_parser_decl_specifier_seq. */
26245 {
26257 /* While it's legal for type qualifiers and storage class
26258 specifiers to follow type definitions in the grammar, only
26259 compiler testsuites contain code like that. Assume that if
26260 we see such code, then what we're really seeing is a case
26261 like:
26263 class X { }
26264 const <type> var = ...;
26266 or
26268 class Y { }
26269 static <type> func (...) ...
26271 i.e. the qualifier or specifier applies to the next
26272 declaration. To do so, however, we need to look ahead one
26273 more token to see if *that* token is a type specifier.
26275 This code could be improved to handle:
26277 class Z { }
26278 static const <type> var = ...; */
26281 {
26284 /* Handling user-defined types here would be nice, but very
26285 tricky. */
26286 want_semicolon
26289 }
26293 }
26295 /* If we don't have a type, then something is very wrong and we
26296 shouldn't try to do anything clever. Likewise for not seeing the
26297 closing brace. */
26299 {
26300 /* Locate the closing brace. */
26301 cp_token_position prev
26306 /* We want to suggest insertion of a ';' immediately *after* the
26307 closing brace, so, if we can, offset the location by 1 column. */
26314 /* If we successfully offset the location, suggest the fix-it. */
26327 else
26330 /* Unget one token and smash it to look as though we encountered
26331 a semicolon in the input stream. */
26336 }
26337 }
26339 /* If this class is not itself within the scope of another class,
26340 then we need to parse the bodies of all of the queued function
26341 definitions. Note that the queued functions defined in a class
26342 are not always processed immediately following the
26343 class-specifier for that class. Consider:
26345 struct A {
26346 struct B { void f() { sizeof (A); } };
26347 };
26349 If `f' were processed before the processing of `A' were
26350 completed, there would be no way to compute the size of `A'.
26351 Note that the nesting we are interested in here is lexical --
26352 not the semantic nesting given by TYPE_CONTEXT. In particular,
26353 for:
26355 struct A { struct B; };
26356 struct A::B { void f() { } };
26358 there is no need to delay the parsing of `A::B::f'. */
26360 {
26361 tree decl;
26368 {
26369 /* Skip default arguments, NSDMIs, etc, in order to improve
26370 error recovery (c++/71169, c++/71832). */
26374 }
26376 /* In a first pass, parse default arguments to the functions.
26377 Then, in a second pass, parse the bodies of the functions.
26378 This two-phased approach handles cases like:
26380 struct S {
26381 void f() { g(); }
26382 void g(int i = 3);
26383 };
26385 */
26387 {
26389 /* If there are default arguments that have not yet been processed,
26390 take care of them now. */
26392 {
26397 }
26398 /* Make sure that any template parameters are in scope. */
26400 /* Parse the default argument expressions. */
26402 /* Remove any template parameters from the symbol table. */
26404 }
26407 /* If there are noexcept-specifiers that have not yet been processed,
26408 take care of them now. Do this before processing NSDMIs as they
26409 may depend on noexcept-specifiers already having been processed. */
26411 {
26414 {
26419 }
26424 /* Make sure that any template parameters are in scope. */
26427 /* Make sure that any member-function parameters are in scope.
26428 This function doesn't expect ccp to be set. */
26432 /* 'this' is not allowed in static member functions. */
26433 unsigned char local_variables_forbidden_p
26438 /* Now we can parse the noexcept-specifier. */
26444 /* Update the fn's type directly -- it might have escaped
26445 beyond this decl :( */
26447 /* Update any instantiations we've already created. We must
26448 keep the new noexcept-specifier wrapped in a DEFERRED_NOEXCEPT
26449 so that maybe_instantiate_noexcept can tsubst the NOEXCEPT_EXPR
26450 in the pattern. */
26455 /* Restore the state of local_variables_forbidden_p. */
26458 /* The finish_struct call above performed various override checking,
26459 but it skipped unparsed noexcept-specifier operands. Now that we
26460 have resolved them, check again. */
26463 /* Remove any member-function parameters from the symbol table. */
26466 /* Remove any template parameters from the symbol table. */
26468 }
26471 /* Now parse any NSDMIs. */
26473 {
26476 {
26481 }
26484 }
26487 /* Now contract attributes. */
26489 {
26492 {
26497 }
26501 /* Make sure that any template parameters are in scope. */
26504 /* Make sure that any member-function parameters are in scope.
26505 This function doesn't expect ccp to be set. */
26509 /* 'this' is not allowed in static member functions. */
26510 unsigned char local_variables_forbidden_p
26515 /* Now we can parse contract conditions. */
26517 {
26520 }
26522 /* Restore the state of local_variables_forbidden_p. */
26525 /* Remove any member-function parameters from the symbol table. */
26528 /* Remove any template parameters from the symbol table. */
26531 /* Perform any deferred contract matching. */
26533 }
26541 /* Now parse the body of the functions. */
26543 {
26544 /* OpenMP UDRs need to be parsed before all other functions. */
26551 }
26552 else
26556 }
26558 /* Put back any saved access checks. */
26561 /* Restore saved state. */
26565 parser->num_template_parameter_lists
26567 parser->in_unbraced_linkage_specification_p
26573 }
26575 /* Parse a class-head.
26577 class-head:
26578 class-key identifier [opt] base-clause [opt]
26579 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
26580 class-key nested-name-specifier [opt] template-id
26581 base-clause [opt]
26583 class-virt-specifier:
26584 final
26586 GNU Extensions:
26587 class-key attributes identifier [opt] base-clause [opt]
26588 class-key attributes nested-name-specifier identifier base-clause [opt]
26589 class-key attributes nested-name-specifier [opt] template-id
26590 base-clause [opt]
26592 Upon return BASES is initialized to the list of base classes (or
26593 NULL, if there are none) in the same form returned by
26594 cp_parser_base_clause.
26596 Returns the TYPE of the indicated class. Sets
26597 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
26598 involving a nested-name-specifier was used, and FALSE otherwise.
26600 Returns error_mark_node if this is not a class-head.
26602 Returns NULL_TREE if the class-head is syntactically valid, but
26603 semantically invalid in a way that means we should skip the entire
26604 body of the class. */
26606 static tree
26609 {
26610 tree nested_name_specifier;
26614 tree attributes;
26615 tree bases;
26625 /* Assume no nested-name-specifier will be present. */
26627 /* Assume no template parameter lists will be used in defining the
26628 type. */
26632 /* Look for the class-key. */
26639 /* Parse the attributes. */
26644 /* If the next token is `::', that is invalid -- but sometimes
26645 people do try to write:
26647 struct ::S {};
26649 Handle this gracefully by accepting the extra qualifier, and then
26650 issuing an error about it later if this really is a
26651 class-head. If it turns out just to be an elaborated type
26652 specifier, remain silent. */
26656 /* It is OK to define an inaccessible class; for example:
26658 class A { class B; };
26659 class A::B {};
26661 So we want to ignore access when parsing the class name.
26662 However, we might be tentatively parsing what is really an
26663 elaborated-type-specifier naming a template-id, e.g.
26665 struct C<&D::m> c;
26667 In this case the tentative parse as a class-head will fail, but not
26668 before cp_parser_template_id splices in a CPP_TEMPLATE_ID token.
26669 Since dk_no_check is sticky, we must instead use dk_deferred so that
26670 any such CPP_TEMPLATE_ID token created during this tentative parse
26671 will correctly capture the access checks imposed by the template-id . */
26674 /* Determine the name of the class. Begin by looking for an
26675 optional nested-name-specifier. */
26677 nested_name_specifier
26683 /* If there was a nested-name-specifier, then there *must* be an
26684 identifier. */
26689 {
26691 /* Although the grammar says `identifier', it really means
26692 `class-name' or `template-name'. You are only allowed to
26693 define a class that has already been declared with this
26694 syntax.
26696 The proposed resolution for Core Issue 180 says that wherever
26697 you see `class T::X' you should treat `X' as a type-name.
26699 We do not know if we will see a class-name, or a
26700 template-name. We look for a class-name first, in case the
26701 class-name is a template-id; if we looked for the
26702 template-name first we would stop after the template-name. */
26709 class_type,
26713 /* If that didn't work, ignore the nested-name-specifier. */
26715 {
26721 }
26722 /* If we could not find a corresponding TYPE, treat this
26723 declaration like an unqualified declaration. */
26726 /* Otherwise, count the number of templates used in TYPE and its
26727 containing scopes. */
26728 else
26730 }
26731 /* Otherwise, the identifier is optional. */
26732 else
26733 {
26734 /* We don't know whether what comes next is a template-id,
26735 an identifier, or nothing at all. */
26737 /* Check for a template-id. */
26742 class_key,
26744 /* If that didn't work, it could still be an identifier. */
26746 {
26748 {
26751 }
26752 else
26754 }
26755 else
26756 {
26759 }
26760 }
26765 {
26767 class_key,
26769 }
26772 /* If it's not a `:' or a `{' then we can't really be looking at a
26773 class-head, since a class-head only appears as part of a
26774 class-specifier. We have to detect this situation before calling
26775 xref_tag, since that has irreversible side-effects. */
26777 {
26781 }
26783 /* At this point, we're going ahead with the class-specifier, even
26784 if some other problem occurs. */
26787 {
26792 }
26793 /* Issue the error about the overly-qualified name now. */
26795 {
26800 }
26802 {
26807 }
26809 {
26810 tree scope;
26813 /* [temp.names]: in a qualified-id formed by a class-head-name, the
26814 keyword template shall not appear at the top level. */
26818 /* Reject typedef-names in class heads. */
26820 {
26823 type);
26826 }
26828 /* Figure out in what scope the declaration is being placed. */
26830 /* If that scope does not contain the scope in which the
26831 class was originally declared, the program is invalid. */
26833 {
26836 "declaration of %qD in namespace %qD which does not "
26839 else
26845 }
26846 /* [dcl.meaning]
26848 A declarator-id shall not be qualified except for the
26849 definition of a ... nested class outside of its class
26850 ... [or] the definition or explicit instantiation of a
26851 class member of a namespace outside of its namespace. */
26855 }
26856 /* An explicit-specialization must be preceded by "template <>". If
26857 it is not, try to recover gracefully. */
26860 && !processing_template_parmlist
26862 {
26863 /* Build a location of this form:
26864 struct typename <ARGS>
26865 ^~~~~~~~~~~~~~~~~~~~~~
26866 with caret==start at the start token, and
26867 finishing at the end of the type. */
26868 location_t reported_loc
26870 class_head_start_location,
26876 "an explicit specialization must be preceded by"
26879 /* Take the same action that would have been taken by
26880 cp_parser_explicit_specialization. */
26883 }
26884 /* There must be no "return" statements between this point and the
26885 end of this function; set "type "to the correct return value and
26886 use "goto done;" to return. */
26887 /* Make sure that the right number of template parameters were
26888 present. */
26890 template_id_p,
26893 {
26894 /* If something went wrong, there is no point in even trying to
26895 process the class-definition. */
26898 }
26900 /* Look up the type. */
26902 {
26906 {
26910 }
26911 else
26912 {
26916 /* Check the scope while we still know whether or not we had a
26917 nested-name-specifier. */
26920 }
26923 }
26925 {
26928 /* Given:
26930 template <typename T> struct S { struct T };
26931 template <typename T> struct S<T>::T { };
26933 we will get a TYPENAME_TYPE when processing the definition of
26934 `S::T'. We need to resolve it to the actual type before we
26935 try to define it. */
26937 {
26940 {
26943 }
26944 }
26948 {
26951 }
26953 /* Enter the scope indicated by the nested-name-specifier. */
26955 /* Get the canonical version of this type. */
26957 /* Call push_template_decl if it seems like we should be defining a
26958 template either from the template headers or the type we're
26959 defining, so that we diagnose both extra and missing headers. */
26963 {
26966 {
26969 }
26970 }
26974 }
26976 {
26977 /* If the class was unnamed, create a dummy name. */
26985 }
26987 /* Diagnose class/struct/union mismatches. */
26991 /* Indicate whether this class was declared as a `class' or as a
26992 `struct'. */
26996 /* If this type was already complete, and we see another definition,
26997 that's an error. Likewise if the type is already being defined:
26998 this can happen, eg, when it's defined from within an expression
26999 (c++/84605). */
27002 {
27004 type);
27006 type);
27009 }
27014 {
27017 {
27018 /* In a lambda this should work, but doesn't currently. */
27021 }
27023 /* Apply attributes now, before any use of the class as a template
27024 argument in its base list. */
27027 }
27029 /* Associate constraints with the type. */
27033 /* We will have entered the scope containing the class; the names of
27034 base classes should be looked up in that context. For example:
27036 struct A { struct B {}; struct C; };
27037 struct A::C : B {};
27039 is valid. */
27041 /* Get the list of base-classes, if there is one. Defer access checking
27042 until the entire list has been seen, as per [class.access.general]. */
27045 {
27051 }
27052 else
27055 /* If we're really defining a class, process the base classes.
27056 If they're invalid, fail. */
27060 /* Now that all bases have been seen and attached to the class, check
27061 accessibility of the types named in the base-clause. This must be
27062 done relative to the class scope, so that we accept e.g.
27064 struct A { protected: struct B {}; };
27065 struct C : A::B, A {}; // OK: A::B is accessible via base A
27067 as per [class.access.general]. */
27074 done:
27075 /* Leave the scope given by the nested-name-specifier. We will
27076 enter the class scope itself while processing the members. */
27081 {
27084 }
27090 out:
27093 }
27095 /* Parse a class-key.
27097 class-key:
27098 class
27099 struct
27100 union
27102 Returns the kind of class-key specified, or none_type to indicate
27103 error. */
27105 static enum tag_types
27107 {
27111 /* Look for the class-key. */
27116 /* Check to see if the TOKEN is a class-key. */
27121 }
27123 /* Parse a type-parameter-key.
27125 type-parameter-key:
27126 class
27127 typename
27128 */
27130 static void
27132 {
27133 /* Look for the type-parameter-key. */
27137 {
27141 /* typename is not allowed in a template template parameter
27142 by the standard until C++17. */
27144 "ISO C++ forbids typename key in template template parameter;"
27146 }
27147 else
27151 }
27153 /* Parse an (optional) member-specification.
27155 member-specification:
27156 member-declaration member-specification [opt]
27157 access-specifier : member-specification [opt] */
27159 static void
27161 {
27163 {
27167 /* Peek at the next token. */
27169 /* If it's a `}', or EOF then we've seen all the members. */
27175 /* See if this token is a keyword. */
27178 {
27182 /* Consume the access-specifier. */
27184 /* Remember which access-specifier is active. */
27186 /* Look for the `:'. */
27191 /* Accept #pragmas at class scope. */
27193 {
27196 }
27198 /* Otherwise, the next construction must be a
27199 member-declaration. */
27201 }
27202 }
27203 }
27205 /* Parse a member-declaration.
27207 member-declaration:
27208 decl-specifier-seq [opt] member-declarator-list [opt] ;
27209 function-definition ; [opt]
27210 :: [opt] nested-name-specifier template [opt] unqualified-id ;
27211 using-declaration
27212 template-declaration
27213 alias-declaration
27215 member-declarator-list:
27216 member-declarator
27217 member-declarator-list , member-declarator
27219 member-declarator:
27220 declarator pure-specifier [opt]
27221 declarator constant-initializer [opt]
27222 identifier [opt] : constant-expression
27224 GNU Extensions:
27226 member-declaration:
27227 __extension__ member-declaration
27229 member-declarator:
27230 declarator attributes [opt] pure-specifier [opt]
27231 declarator attributes [opt] constant-initializer [opt]
27232 identifier [opt] attributes [opt] : constant-expression
27234 C++0x Extensions:
27236 member-declaration:
27237 static_assert-declaration */
27239 static void
27241 {
27242 cp_decl_specifier_seq decl_specifiers;
27243 tree prefix_attributes;
27244 tree decl;
27253 /* Check for the `__extension__' keyword. */
27255 {
27256 /* Recurse. */
27258 /* Restore the old value of the PEDANTIC flag. */
27262 }
27264 /* Check for a template-declaration. */
27266 {
27267 /* An explicit specialization here is an error condition, and we
27268 expect the specialization handler to detect and report this. */
27272 else
27276 }
27277 /* Check for a template introduction. */
27281 /* Check for a using-declaration. */
27283 {
27285 /* Parse the using-declaration. */
27289 else
27290 {
27291 tree decl;
27295 /* Note that if we actually see the '=' token after the
27296 identifier, cp_parser_alias_declaration commits the
27297 tentative parse. In that case, we really expect an
27298 alias-declaration. Otherwise, we expect a using
27299 declaration. */
27300 alias_decl_expected =
27306 else
27309 }
27311 }
27313 /* Check for @defs. */
27315 {
27320 {
27325 }
27327 }
27329 /* If the next token is `static_assert' we have a static assertion. */
27331 {
27334 }
27338 cp_omp_declare_simd_data odsd;
27342 /* Parse the decl-specifier-seq. */
27345 (CP_PARSER_FLAGS_OPTIONAL
27355 /* Check for an invalid type-name. */
27359 /* If there is no declarator, then the decl-specifier-seq should
27360 specify a type. */
27362 {
27363 /* If there was no decl-specifier-seq, and the next token is a
27364 `;', then we have something like:
27366 struct S { ; };
27368 [class.mem]
27370 Each member-declaration shall declare at least one member
27371 name of the class. */
27373 {
27376 {
27380 }
27381 }
27382 else
27383 {
27384 /* See if this declaration is a friend. */
27386 /* If there were decl-specifiers, check to see if there was
27387 a class-declaration. */
27390 /* Nested classes have already been added to the class, but
27391 a `friend' needs to be explicitly registered. */
27393 {
27394 /* If the `friend' keyword was present, the friend must
27395 be introduced with a class-key. */
27398 "in C++03 a class-key must be used "
27400 /* In this case:
27402 template <typename T> struct A {
27403 friend struct A<T>::B;
27404 };
27406 A<T>::B will be represented by a TYPENAME_TYPE, and
27407 therefore not recognized by check_tag_decl. */
27409 {
27413 }
27414 /* Warn if an attribute cannot appear here, as per
27415 [dcl.attr.grammar]/5. But not when declares_class_or_enum:
27416 we ignore attributes in elaborated-type-specifiers. */
27419 {
27424 "that appertains to a friend declaration that "
27426 }
27429 "friend declaration does not name a class or "
27431 else
27434 }
27435 /* If there is no TYPE, an error message will already have
27436 been issued. */
27438 ;
27439 /* An anonymous aggregate has to be handled specially; such
27440 a declaration really declares a data member (with a
27441 particular type), as opposed to a nested class. */
27443 {
27444 /* C++11 9.5/6. */
27447 "a storage class on an anonymous aggregate "
27450 /* Remove constructors and such from TYPE, now that we
27451 know it is an anonymous aggregate. */
27453 /* And make the corresponding data member. */
27456 /* Add it to the class. */
27458 }
27459 else
27460 cp_parser_check_access_in_redeclaration
27463 }
27464 }
27465 else
27466 {
27469 /* Clear attributes from the decl_specifiers but keep them
27470 around as prefix attributes that apply them to the entity
27471 being declared. */
27479 /* See if these declarations will be friends. */
27482 /* Keep going until we hit the `;' at the end of the
27483 declaration. */
27485 {
27487 tree first_attribute;
27488 tree initializer;
27491 /* Peek at the next token. */
27494 /* The following code wants to know early if it is a bit-field
27495 or some other declaration. Attributes can appear before
27496 the `:' token. Skip over them without consuming any tokens
27497 to peek if they are followed by `:'. */
27502 {
27503 size_t n
27506 }
27508 /* Check for a bitfield declaration. */
27514 {
27515 tree identifier;
27516 tree width;
27518 location_t id_location
27523 else
27526 /* Look for attributes that apply to the bitfield. */
27529 /* Consume the `:' token. */
27532 /* Get the width of the bitfield. */
27536 /* In C++20 and as extension for C++11 and above we allow
27537 default member initializers for bit-fields. */
27542 CPP_OPEN_BRACE)))
27543 {
27544 location_t loc
27549 "default member initializers for bit-fields "
27550 "only available with %<-std=c++20%> or "
27555 {
27559 }
27560 }
27561 else
27562 {
27563 /* Look for attributes that apply to the bitfield after
27564 the `:' token and width. This is where GCC used to
27565 parse attributes in the past, pedwarn if there is
27566 a std attribute. */
27569 "ISO C++ allows bit-field attributes only "
27573 }
27577 /* Remember which attributes are prefix attributes and
27578 which are not. */
27580 /* Combine the attributes. */
27583 /* Create the bitfield declaration. */
27586 identifier,
27587 sfk_none,
27588 id_location)
27592 attributes);
27593 }
27594 else
27595 {
27597 tree asm_specification;
27601 /* We can't delay parsing for friends,
27602 alias-declarations, and typedefs, even though the
27603 standard seems to require it. */
27608 /* Parse the declarator. */
27609 declarator
27611 flags,
27617 /* If something went wrong parsing the declarator, make sure
27618 that we at least consume some tokens. */
27620 {
27621 /* Skip to the end of the statement. */
27623 /* If the next token is not a semicolon, that is
27624 probably because we just skipped over the body of
27625 a function. So, we consume a semicolon if
27626 present, but do not issue an error message if it
27627 is not present. */
27629 CPP_SEMICOLON))
27632 }
27634 /* Handle class-scope non-template C++17 deduction guides. */
27637 declarator,
27641 cp_parser_check_for_definition_in_return_type
27645 /* Look for an asm-specification. */
27647 /* Look for attributes that apply to the declaration. */
27649 /* Remember which attributes are prefix attributes and
27650 which are not. */
27652 /* Combine the attributes. */
27655 /* If it's an `=', then we have a constant-initializer or a
27656 pure-specifier. It is not correct to parse the
27657 initializer before registering the member declaration
27658 since the member declaration should be in scope while
27659 its initializer is processed. However, the rest of the
27660 front end does not yet provide an interface that allows
27661 us to handle this correctly. */
27663 {
27664 /* In [class.mem]:
27666 A pure-specifier shall be used only in the declaration of
27667 a virtual function.
27669 A member-declarator can contain a constant-initializer
27670 only if it declares a static member of integral or
27671 enumeration type.
27673 Therefore, if the DECLARATOR is for a function, we look
27674 for a pure-specifier; otherwise, we look for a
27675 constant-initializer. When we call `grokfield', it will
27676 perform more stringent semantics checks. */
27689 {
27691 /* Don't require a constant rvalue in C++11, since we
27692 might want a reference constant. We'll enforce
27693 constancy later. */
27695 /* Parse the initializer. */
27698 }
27699 else
27700 /* Parse the initializer. */
27702 }
27705 {
27707 declarator->init_loc
27711 else
27713 }
27714 /* Detect invalid bit-field cases such as
27716 int *p : 4;
27717 int &&r : 3;
27719 and similar. */
27721 /* If there were no type specifiers, it was a
27722 constructor. */
27724 {
27725 /* This is called for a decent diagnostic only. */
27734 /* Avoid "extra ;" pedwarns. */
27736 CPP_SEMICOLON))
27739 }
27740 /* Otherwise, there is no initializer. */
27741 else
27744 /* See if we are probably looking at a function
27745 definition. We are certainly not looking at a
27746 member-declarator. Calling `grokfield' has
27747 side-effects, so we must not do it unless we are sure
27748 that we are looking at a member-declarator. */
27751 {
27752 /* The grammar does not allow a pure-specifier to be
27753 used when a member function is defined. (It is
27754 possible that this fact is an oversight in the
27755 standard, since a pure function may be defined
27756 outside of the class-specifier. */
27762 declarator,
27763 attributes);
27767 /* If the member was not a friend, declare it here. */
27770 /* Peek at the next token. */
27772 /* If the next token is a semicolon, consume it. */
27774 {
27775 location_t semicolon_loc
27780 "extra %<;%> after in-class "
27782 }
27784 }
27785 else
27789 /* Create the declaration. */
27795 {
27798 else
27800 }
27801 }
27806 /* Reset PREFIX_ATTRIBUTES. */
27808 {
27813 }
27815 /* If there is any qualification still in effect, clear it
27816 now; we will be starting fresh with the next declarator. */
27820 /* If it's a `,', then there are more declarators. */
27822 {
27825 {
27831 }
27832 }
27833 /* If the next token isn't a `;', then we have a parse error. */
27835 CPP_SEMICOLON))
27836 {
27837 /* The next token might be a ways away from where the
27838 actual semicolon is missing. Find the previous token
27839 and use that for our error position. */
27846 /* Assume that the user meant to provide a semicolon. If
27847 we were to cp_parser_skip_to_end_of_statement, we might
27848 skip to a semicolon inside a member function definition
27849 and issue nonsensical error messages. */
27851 }
27854 {
27855 /* Add DECL to the list of members. */
27857 /* Explicitly include, eg, NSDMIs, for better error
27858 recovery (c++/58650). */
27866 /* Add DECL to the queue of NSDMI to be parsed later. */
27868 }
27872 }
27873 }
27876 out:
27879 }
27881 /* Parse a pure-specifier.
27883 pure-specifier:
27884 = 0
27886 Returns INTEGER_ZERO_NODE if a pure specifier is found.
27887 Otherwise, ERROR_MARK_NODE is returned. */
27889 static tree
27891 {
27894 /* Look for the `=' token. */
27897 /* Look for the `0' token. */
27906 /* Accept = default or = delete in c++0x mode. */
27909 {
27912 }
27914 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
27916 {
27921 }
27923 {
27926 }
27929 }
27931 /* Parse a constant-initializer.
27933 constant-initializer:
27934 = constant-expression
27936 Returns a representation of the constant-expression. */
27938 static tree
27940 {
27941 /* Look for the `=' token. */
27945 /* It is invalid to write:
27947 struct S { static const int i = { 7 }; };
27949 */
27951 {
27954 /* Consume the opening brace. */
27955 matching_braces braces;
27957 /* Skip the initializer. */
27959 /* Look for the trailing `}'. */
27963 }
27966 }
27968 /* Derived classes [gram.class.derived] */
27970 /* Parse a base-clause.
27972 base-clause:
27973 : base-specifier-list
27975 base-specifier-list:
27976 base-specifier ... [opt]
27977 base-specifier-list , base-specifier ... [opt]
27979 Returns a TREE_LIST representing the base-classes, in the order in
27980 which they were declared. The representation of each node is as
27981 described by cp_parser_base_specifier.
27983 In the case that no bases are specified, this function will return
27984 NULL_TREE, not ERROR_MARK_NODE. */
27986 static tree
27988 {
27991 /* Look for the `:' that begins the list. */
27994 /* Scan the base-specifier-list. */
27996 {
27998 tree base;
28001 /* Look for the base-specifier. */
28003 /* Look for the (optional) ellipsis. */
28005 {
28006 /* Consume the `...'. */
28010 }
28012 /* Add BASE to the front of the list. */
28014 {
28016 /* Make this a pack expansion type. */
28020 {
28023 }
28024 }
28025 /* Peek at the next token. */
28027 /* If it's not a comma, then the list is complete. */
28030 /* Consume the `,'. */
28032 }
28034 /* PARSER->SCOPE may still be non-NULL at this point, if the last
28035 base class had a qualified name. However, the next name that
28036 appears is certainly not qualified. */
28042 }
28044 /* Parse a base-specifier.
28046 base-specifier:
28047 :: [opt] nested-name-specifier [opt] class-name
28048 virtual access-specifier [opt] :: [opt] nested-name-specifier
28049 [opt] class-name
28050 access-specifier virtual [opt] :: [opt] nested-name-specifier
28051 [opt] class-name
28053 Returns a TREE_LIST. The TREE_PURPOSE will be one of
28054 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
28055 indicate the specifiers provided. The TREE_VALUE will be a TYPE
28056 (or the ERROR_MARK_NODE) indicating the type that was specified. */
28058 static tree
28060 {
28068 tree type;
28070 /* Process the optional `virtual' and `access-specifier'. */
28072 {
28073 /* Peek at the next token. */
28075 /* Process `virtual'. */
28077 {
28079 /* If `virtual' appears more than once, issue an error. */
28081 {
28085 }
28089 /* Consume the `virtual' token. */
28097 /* If more than one access specifier appears, issue an
28098 error. */
28101 {
28105 }
28109 /* Consume the access-specifier. */
28117 }
28118 }
28119 /* It is not uncommon to see programs mechanically, erroneously, use
28120 the 'typename' keyword to denote (dependent) qualified types
28121 as base classes. */
28123 {
28128 else
28130 "keyword %<typename%> not allowed in this context "
28133 }
28135 /* Look for the optional `::' operator. */
28137 /* Look for the nested-name-specifier. The simplest way to
28138 implement:
28140 [temp.res]
28142 The keyword `typename' is not permitted in a base-specifier or
28143 mem-initializer; in these contexts a qualified name that
28144 depends on a template-parameter is implicitly assumed to be a
28145 type name.
28147 is to pretend that we have seen the `typename' keyword at this
28148 point. */
28154 /* If the base class is given by a qualified name, assume that names
28155 we see are type names or templates, as appropriate. */
28161 /* DR 950 allows decltype as a base-specifier. */
28163 else
28164 {
28165 /* Otherwise, look for the class-name. */
28167 class_scope_p,
28168 template_p,
28169 typename_type,
28174 }
28180 }
28182 /* Exception handling [gram.exception] */
28184 /* Save the tokens that make up the noexcept-specifier for a member-function.
28185 Returns a DEFERRED_PARSE. */
28187 static tree
28189 {
28191 /* We want everything up to, including, the final ')'. */
28195 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
28196 to carry the information we will need. */
28198 /* Save away the noexcept-specifier; we will process it when the
28199 class is complete. */
28204 }
28206 /* Used for late processing of noexcept-specifiers of member-functions.
28207 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
28208 we saved for later; parse it now. DECL is the declaration of the
28209 member function. */
28211 static tree
28213 {
28214 /* Make sure we've gotten something that hasn't been parsed yet. */
28219 /* Push the saved tokens for the noexcept-specifier onto the parser's
28220 lexer stack. */
28224 /* Parse the cached noexcept-specifier. */
28225 tree parsed_arg
28227 CP_PARSER_FLAGS_NONE,
28232 /* Revert to the main lexer. */
28235 /* Restore the queue. */
28238 /* And we're done. */
28240 }
28242 /* Perform late checking of overriding function with respect to their
28243 noexcept-specifiers. TYPE is the class and FNDECL is the function
28244 that potentially overrides some virtual function with the same
28245 signature. */
28247 static void
28249 {
28251 tree base_binfo;
28257 {
28266 }
28267 }
28269 /* Parse an (optional) noexcept-specification.
28271 noexcept-specification:
28272 noexcept ( constant-expression ) [opt]
28274 If no noexcept-specification is present, returns NULL_TREE.
28275 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
28276 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
28277 there are no parentheses. CONSUMED_EXPR will be set accordingly.
28278 Otherwise, returns a noexcept specification unless RETURN_COND is true,
28279 in which case a boolean condition is returned instead. The parser flags
28280 FLAGS is used to control parsing. QUALS are qualifiers indicating whether
28281 the (member) function is `const'. */
28283 static tree
28285 cp_parser_flags flags,
28289 {
28293 /* Peek at the next token. */
28296 /* Is it a noexcept-specification? */
28298 {
28299 tree expr;
28301 /* [class.mem]/6 says that a noexcept-specifer (within the
28302 member-specification of the class) is a complete-class context of
28303 a class. So, if the noexcept-specifier has the optional expression,
28304 just save the tokens, and reparse this after we're done with the
28305 class. */
28309 /* No need to delay parsing for a number literal or true/false. */
28321 {
28322 matching_parens parens;
28326 {
28327 /* Types may not be defined in an exception-specification. */
28329 parser->type_definition_forbidden_message
28333 expr
28339 {
28342 }
28344 /* Restore the saved message. */
28346 }
28347 else
28348 {
28351 }
28354 }
28355 else
28356 {
28360 }
28362 /* We cannot build a noexcept-spec right away because this will check
28363 that expr is a constexpr. */
28366 else
28368 }
28369 else
28371 }
28373 /* Parse an (optional) exception-specification.
28375 exception-specification:
28376 throw ( type-id-list [opt] )
28378 Returns a TREE_LIST representing the exception-specification. The
28379 TREE_VALUE of each node is a type. The parser flags FLAGS is used to
28380 control parsing. QUALS are qualifiers indicating whether the (member)
28381 function is `const'. */
28383 static tree
28385 cp_parser_flags flags)
28386 {
28388 tree type_id_list;
28391 /* Peek at the next token. */
28394 /* Is it a noexcept-specification? */
28395 type_id_list
28403 /* If it's not `throw', then there's no exception-specification. */
28409 /* Consume the `throw'. */
28412 /* Look for the `('. */
28413 matching_parens parens;
28416 /* Peek at the next token. */
28418 /* If it's not a `)', then there is a type-id-list. */
28420 {
28421 /* Types may not be defined in an exception-specification. */
28423 parser->type_definition_forbidden_message
28425 /* Parse the type-id-list. */
28427 /* Restore the saved message. */
28431 {
28435 }
28438 "dynamic exception specifications are deprecated in "
28440 }
28441 /* In C++17, throw() is equivalent to noexcept (true). throw()
28442 is deprecated in C++11 and above as well, but is still widely used,
28443 so don't warn about it yet. */
28446 else
28449 /* Look for the `)'. */
28453 }
28455 /* Parse an (optional) type-id-list.
28457 type-id-list:
28458 type-id ... [opt]
28459 type-id-list , type-id ... [opt]
28461 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
28462 in the order that the types were presented. */
28464 static tree
28466 {
28470 {
28472 tree type;
28476 /* Get the next type-id. */
28478 /* Check for invalid 'auto'. */
28480 {
28484 }
28485 /* Parse the optional ellipsis. */
28487 {
28488 /* Consume the `...'. */
28491 /* Turn the type into a pack expansion expression. */
28493 }
28494 /* Add it to the list. */
28496 /* Peek at the next token. */
28498 /* If it is not a `,', we are done. */
28501 /* Consume the `,'. */
28503 }
28506 }
28508 /* Parse a try-block.
28510 try-block:
28511 try compound-statement handler-seq */
28513 static tree
28515 {
28516 tree try_block;
28523 "%<try%> in %<constexpr%> function only "
28533 }
28535 /* Parse a function-try-block.
28537 function-try-block:
28538 try ctor-initializer [opt] function-body handler-seq */
28540 static void
28542 {
28543 tree compound_stmt;
28544 tree try_block;
28546 /* Look for the `try' keyword. */
28549 /* Let the rest of the front end know where we are. */
28551 /* Parse the function-body. */
28552 cp_parser_ctor_initializer_opt_and_function_body
28554 /* We're done with the `try' part. */
28556 /* Parse the handlers. */
28558 /* We're done with the handlers. */
28560 }
28562 /* Parse a handler-seq.
28564 handler-seq:
28565 handler handler-seq [opt] */
28567 static void
28569 {
28571 {
28574 /* Parse the handler. */
28576 /* Peek at the next token. */
28578 /* If it's not `catch' then there are no more handlers. */
28581 }
28582 }
28584 /* Parse a handler.
28586 handler:
28587 catch ( exception-declaration ) compound-statement */
28589 static void
28591 {
28592 tree handler;
28593 tree declaration;
28597 matching_parens parens;
28604 }
28606 /* Parse an exception-declaration.
28608 exception-declaration:
28609 type-specifier-seq declarator
28610 type-specifier-seq abstract-declarator
28611 type-specifier-seq
28612 ...
28614 Returns a VAR_DECL for the declaration, or NULL_TREE if the
28615 ellipsis variant is used. */
28617 static tree
28619 {
28620 cp_decl_specifier_seq type_specifiers;
28624 /* If it's an ellipsis, it's easy to handle. */
28626 {
28627 /* Consume the `...' token. */
28630 }
28632 /* Types may not be defined in exception-declarations. */
28634 parser->type_definition_forbidden_message
28637 /* Parse the type-specifier-seq. */
28642 /* If it's a `)', then there is no declarator. */
28645 else
28647 CP_PARSER_FLAGS_NONE,
28654 /* Restore the saved message. */
28661 }
28663 /* Parse a throw-expression.
28665 throw-expression:
28666 throw assignment-expression [opt]
28668 Returns a THROW_EXPR representing the throw-expression. */
28670 static tree
28672 {
28673 tree expression;
28679 /* Figure out whether or not there is an assignment-expression
28680 following the "throw" keyword. */
28688 else
28691 /* Construct a location e.g.:
28692 throw x
28693 ^~~~~~~
28694 with caret == start at the start of the "throw" token, and
28695 the end at the end of the final token we consumed. */
28701 }
28703 /* Parse a yield-expression.
28705 yield-expression:
28706 co_yield assignment-expression
28707 co_yield braced-init-list
28709 Returns a CO_YIELD_EXPR representing the yield-expression. */
28711 static tree
28713 {
28714 tree expr;
28722 {
28725 /* ??? : probably a moot point? */
28728 }
28729 else
28736 }
28738 /* GNU Extensions */
28740 /* Parse an (optional) asm-specification.
28742 asm-specification:
28743 asm ( string-literal )
28745 If the asm-specification is present, returns a STRING_CST
28746 corresponding to the string-literal. Otherwise, returns
28747 NULL_TREE. */
28749 static tree
28751 {
28752 /* Peek at the next token. */
28754 /* If the next token isn't the `asm' keyword, then there's no
28755 asm-specification. */
28759 /* Consume the `asm' token. */
28761 /* Look for the `('. */
28762 matching_parens parens;
28765 /* Look for the string-literal. */
28770 /* Look for the `)'. */
28774 }
28776 /* Parse an asm-operand-list.
28778 asm-operand-list:
28779 asm-operand
28780 asm-operand-list , asm-operand
28782 asm-operand:
28783 string-literal ( expression )
28784 [ string-literal ] string-literal ( expression )
28786 Returns a TREE_LIST representing the operands. The TREE_VALUE of
28787 each node is the expression. The TREE_PURPOSE is itself a
28788 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
28789 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
28790 is a STRING_CST for the string literal before the parenthesis. Returns
28791 ERROR_MARK_NODE if any of the operands are invalid. */
28793 static tree
28795 {
28800 {
28801 tree name;
28804 {
28805 /* Consume the `[' token. */
28807 /* Read the operand name. */
28812 /* Look for the closing `]'. */
28814 }
28815 else
28817 /* Look for the string-literal. */
28822 /* Look for the `('. */
28823 matching_parens parens;
28825 /* Parse the expression. */
28827 /* Look for the `)'. */
28835 /* Add this operand to the list. */
28837 expression,
28838 asm_operands);
28839 /* If the next token is not a `,', there are no more
28840 operands. */
28843 /* Consume the `,'. */
28845 }
28848 }
28850 /* Parse an asm-clobber-list.
28852 asm-clobber-list:
28853 string-literal
28854 asm-clobber-list , string-literal
28856 Returns a TREE_LIST, indicating the clobbers in the order that they
28857 appeared. The TREE_VALUE of each node is a STRING_CST. */
28859 static tree
28861 {
28865 {
28866 /* Look for the string literal. */
28870 /* Add it to the list. */
28872 /* If the next token is not a `,', then the list is
28873 complete. */
28876 /* Consume the `,' token. */
28878 }
28881 }
28883 /* Parse an asm-label-list.
28885 asm-label-list:
28886 identifier
28887 asm-label-list , identifier
28889 Returns a TREE_LIST, indicating the labels in the order that they
28890 appeared. The TREE_VALUE of each node is a label. */
28892 static tree
28894 {
28898 {
28901 /* Look for the identifier. */
28904 {
28907 {
28913 }
28914 }
28915 /* If the next token is not a `,', then the list is
28916 complete. */
28919 /* Consume the `,' token. */
28921 }
28924 }
28926 /* Return TRUE iff the next tokens in the stream are possibly the
28927 beginning of a GNU extension attribute. */
28929 static bool
28931 {
28933 }
28935 /* Return TRUE iff the next tokens in the stream are possibly the
28936 beginning of a standard C++-11 attribute specifier. */
28938 static bool
28940 {
28942 }
28944 /* Return TRUE iff the next Nth tokens in the stream are possibly the
28945 beginning of a standard C++-11 attribute specifier. */
28947 static bool
28949 {
28957 }
28959 /* Return TRUE iff the next Nth tokens in the stream are possibly the
28960 beginning of a GNU extension attribute. */
28962 static bool
28964 {
28968 }
28970 /* Return true iff the next tokens can be the beginning of either a
28971 GNU attribute list, or a standard C++11 attribute sequence. */
28973 static bool
28975 {
28978 }
28980 /* Return true iff the next Nth tokens can be the beginning of either
28981 a GNU attribute list, or a standard C++11 attribute sequence. */
28983 static bool
28985 {
28988 }
28990 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
28991 of GNU attributes, or return NULL. */
28993 static tree
28995 {
28998 {
29003 else
29005 }
29007 }
29009 /* Parse an (optional) series of attributes.
29011 attributes:
29012 attributes attribute
29014 attribute:
29015 __attribute__ (( attribute-list [opt] ))
29017 The return value is as for cp_parser_gnu_attribute_list. */
29019 static tree
29021 {
29028 {
29030 tree attribute_list;
29033 /* Peek at the next token. */
29035 /* If it's not `__attribute__', then we're done. */
29039 /* Consume the `__attribute__' keyword. */
29041 /* Look for the two `(' tokens. */
29042 matching_parens outer_parens;
29045 matching_parens inner_parens;
29049 /* Peek at the next token. */
29052 /* Parse the attribute-list. */
29054 else
29055 /* If the next token is a `)', then there is no attribute
29056 list. */
29059 /* Look for the two `)' tokens. */
29067 /* Add these new attributes to the list. */
29069 }
29072 }
29074 /* Parse a GNU attribute-list.
29076 attribute-list:
29077 attribute
29078 attribute-list , attribute
29080 attribute:
29081 identifier
29082 identifier ( identifier )
29083 identifier ( identifier , expression-list )
29084 identifier ( expression-list )
29086 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
29087 to an attribute. The TREE_PURPOSE of each node is the identifier
29088 indicating which attribute is in use. The TREE_VALUE represents
29089 the arguments, if any. */
29091 static tree
29093 {
29097 /* Don't create wrapper nodes within attributes: the
29098 handlers don't know how to handle them. */
29099 auto_suppress_location_wrappers sentinel;
29103 {
29105 tree identifier;
29106 tree attribute;
29108 /* Look for the identifier. We also allow keywords here; for
29109 example `__attribute__ ((const))' is legal. */
29113 {
29116 /* Consume the token, but save it since we need it for the
29117 SIMD enabled function parsing. */
29120 /* Save away the identifier that indicates which attribute
29121 this is. */
29123 /* For keywords, use the canonical spelling, not the
29124 parsed identifier. */
29131 /* Peek at the next token. */
29133 /* If it's an `(', then parse the attribute arguments. */
29135 {
29141 vec = cp_parser_parenthesized_expression_list
29147 else
29148 {
29151 }
29152 /* Save the arguments away. */
29154 }
29157 {
29158 /* Add this attribute to the list. */
29161 }
29164 }
29165 /* Unless EXACTLY_ONE is set look for more attributes.
29166 If the next token isn't a `,', we're done. */
29170 /* Consume the comma and keep going. */
29172 }
29175 /* We built up the list in reverse order. */
29177 }
29179 /* Parse arguments of omp::directive attribute.
29181 ( directive-name ,[opt] clause-list[opt] )
29183 For directive just remember the first/last tokens for subsequent
29184 parsing. */
29186 static void
29188 {
29191 {
29197 }
29200 {
29206 }
29215 }
29217 /* Parse arguments of omp::sequence attribute.
29219 ( omp::[opt] directive-attr [ , omp::[opt] directive-attr ]... ) */
29221 static void
29223 {
29224 matching_parens parens;
29226 do
29227 {
29232 {
29236 }
29241 else
29246 {
29255 }
29259 UNKNOWN_LOCATION);
29262 else
29267 }
29272 }
29274 /* Parse a standard C++11 attribute.
29276 The returned representation is a TREE_LIST which TREE_PURPOSE is
29277 the scoped name of the attribute, and the TREE_VALUE is its
29278 arguments list.
29280 Note that the scoped name of the attribute is itself a TREE_LIST
29281 which TREE_PURPOSE is the namespace of the attribute, and
29282 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
29283 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
29284 and which TREE_PURPOSE is directly the attribute name.
29286 Clients of the attribute code should use get_attribute_namespace
29287 and get_attribute_name to get the actual namespace and name of
29288 attributes, regardless of their being GNU or C++11 attributes.
29290 attribute:
29291 attribute-token attribute-argument-clause [opt]
29293 attribute-token:
29294 identifier
29295 attribute-scoped-token
29297 attribute-scoped-token:
29298 attribute-namespace :: identifier
29300 attribute-namespace:
29301 identifier
29303 attribute-argument-clause:
29304 ( balanced-token-seq )
29306 balanced-token-seq:
29307 balanced-token [opt]
29308 balanced-token-seq balanced-token
29310 balanced-token:
29311 ( balanced-token-seq )
29312 [ balanced-token-seq ]
29313 { balanced-token-seq }. */
29315 static tree
29317 {
29324 /* First, parse name of the attribute, a.k.a attribute-token. */
29341 {
29342 /* We are seeing a scoped attribute token. */
29357 else
29358 {
29362 }
29368 NULL_TREE);
29370 }
29372 {
29376 NULL_TREE);
29377 }
29378 else
29379 {
29382 NULL_TREE);
29384 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
29385 but no longer: we have to be able to tell [[noreturn]] and
29386 __attribute__((noreturn)) apart. */
29387 /* C++14 deprecated attribute is equivalent to GNU's. */
29390 /* C++17 fallthrough attribute is equivalent to GNU's. */
29393 /* C++23 assume attribute is equivalent to GNU's. */
29396 /* Transactional Memory TS optimize_for_synchronized attribute is
29397 equivalent to GNU transaction_callable. */
29401 /* Transactional Memory attributes are GNU attributes. */
29404 }
29406 /* Now parse the optional argument clause of the attribute. */
29409 {
29414 {
29416 attr_id);
29418 }
29420 }
29422 {
29426 /* Maybe we don't expect to see any arguments for this attribute. */
29430 {
29432 attr_id);
29438 }
29442 /* The assume attribute needs special handling of the argument. */
29446 /* A GNU attribute that takes an identifier in parameter. */
29449 /* If this is a fake attribute created to handle -Wno-attributes,
29450 we must skip parsing the arguments. */
29452 {
29454 {
29456 {
29459 }
29461 {
29467 }
29468 }
29470 /* For unknown attributes, just skip balanced tokens instead of
29471 trying to parse the arguments. */
29475 }
29477 vec = cp_parser_parenthesized_expression_list
29483 else
29484 {
29486 /* e.g. [[attr()]]. */
29489 attr_id);
29492 }
29496 else
29498 }
29501 }
29503 /* Warn if the attribute ATTRIBUTE appears more than once in the
29504 attribute-list ATTRIBUTES. This used to be enforced for certain
29505 attributes, but the restriction was removed in P2156.
29506 LOC is the location of ATTRIBUTE. Returns true if ATTRIBUTE was not
29507 found in ATTRIBUTES. */
29509 static bool
29511 {
29520 {
29525 }
29527 }
29529 /* Parse a list of standard C++-11 attributes.
29531 attribute-list:
29532 attribute [opt]
29533 attribute-list , attribute[opt]
29534 attribute ...
29535 attribute-list , attribute ...
29536 */
29538 static tree
29540 {
29545 {
29551 {
29553 {
29556 }
29557 }
29560 {
29565 else
29566 {
29571 }
29573 }
29577 }
29580 }
29582 /* Optionally parse a C++20 contract role. A NULL return means that no
29583 contract role was specified.
29585 contract-role:
29586 % default
29587 % identifier
29589 If the identifier does not name a known contract role, it will
29590 be assumed to be default. Returns the identifier for the role
29591 token. */
29593 static tree
29595 {
29605 else
29606 {
29609 }
29612 /* FIXME: Warn about invalid/unknown roles? */
29614 }
29616 /* Parse an optional contract mode.
29618 contract-mode:
29619 contract-semantic
29620 [contract-level] [contract-role]
29622 contract-semantic:
29623 check_never_continue
29624 check_maybe_continue
29625 check_always_continue
29627 contract-level:
29628 default
29629 audit
29630 axiom
29632 contract-role:
29633 default
29634 identifier
29636 This grammar is taken from P1332R0. During parsing, this sets options
29637 on the MODE object to determine the configuration of the contract.
29639 Returns a tree containing the identifiers used in the configuration.
29640 This is either an IDENTIFIER with the literal semantic or a TREE_LIST
29641 whose TREE_VALUE is the contract-level and whose TREE_PURPOSE is the
29642 contract-role, if any. NULL_TREE is returned if no information is
29643 given (i.e., all defaults selected). */
29645 static tree
29648 {
29649 /* The mode is empty; the level and role are default. */
29653 /* There is only a role; the level is default. */
29655 {
29658 }
29660 /* Otherwise, match semantic or level. */
29664 tree config_id;
29666 {
29669 /* Either a named level, a concrete semantic, or an identifier
29670 for a postcondition. */
29675 /* The identifier is the return value for a postcondition. */
29679 }
29681 {
29684 }
29685 else
29686 {
29687 /* We got some other token other than a ':'. */
29690 }
29692 /* Consume the literal semantic or level token. */
29696 {
29698 "expected contract level: "
29701 }
29703 /* We matched an explicit semantic. */
29705 {
29707 {
29711 }
29713 }
29715 /* We matched a level, there may be a role; otherwise this is default. */
29717 {
29720 }
29723 }
29725 static tree
29727 {
29731 }
29733 static bool
29735 {
29737 }
29739 /* Parse a standard C++20 contract attribute specifier.
29741 contract-attribute-specifier:
29742 [ [ assert contract-level [opt] : conditional-expression ] ]
29743 [ [ pre contract-level [opt] : conditional-expression ] ]
29744 [ [ post contract-level [opt] identifier [opt] : conditional-expression ] ]
29746 For free functions, we cannot determine the type of the postcondition
29747 identifier because the we haven't called grokdeclarator yet. In those
29748 cases we parse the postcondition as if the identifier was declared as
29749 'auto <identifier>'. We then instantiate the postcondition once the
29750 return type is known.
29752 For member functions, contracts are in the complete-class context, so the
29753 parse is deferred. We also have the return type avaialable (unless it's
29754 deduced), so we don't need to parse the postcondition in terms of a
29755 placeholder. */
29757 static tree
29759 {
29767 /* Parse the optional mode. */
29770 /* Check for postcondition identifiers. */
29771 cp_expr identifier;
29779 /* Defer the parsing of pre/post contracts inside class definitions. */
29780 tree contract;
29782 current_class_type &&
29784 {
29785 /* Skip until we reach an unenclose ']'. If we ran into an unnested ']'
29786 that doesn't close the attribute, return an error and let the attribute
29787 handling code emit an error for missing ']]'. */
29791 CPP_CLOSE_SQUARE,
29798 /* Build a deferred-parse node. */
29803 /* And its corresponding contract. */
29805 }
29806 else
29807 {
29808 /* Enable location wrappers when parsing contracts. */
29811 /* Build a fake variable for the result identifier. */
29814 {
29818 }
29820 /* Parse the condition, ensuring that parameters or the return variable
29821 aren't flagged for use outside the body of a function. */
29826 /* Try to recover from errors by scanning up to the end of the
29827 attribute. Sometimes we get partially parsed expressions, so
29828 we need to search the condition for errors. */
29832 /* Build the contract. */
29835 /* Leave our temporary scope for the postcondition result. */
29837 {
29840 }
29841 }
29844 {
29847 }
29850 }
29852 /* Parse a contract condition for a deferred contract. */
29855 tree fn,
29856 tree attribute)
29857 {
29860 /* Make sure we've gotten something that hasn't been parsed yet or that
29861 we're not parsing an invalid contract. */
29870 /* Build a fake variable for the result identifier. */
29873 {
29874 /* TODO: Can we guarantee that the identifier has a location? */
29878 {
29881 }
29886 }
29888 /* 'this' is not allowed in preconditions of constructors or in postconditions
29889 of destructors. Note that the previous value of this variable is
29890 established by the calling function, so we need to save it here. */
29895 {
29898 }
29902 /* Push the saved tokens onto the parser's lexer stack. */
29906 /* Parse the condition, ensuring that parameters or the return variable
29907 aren't flagged for use outside the body of a function. */
29912 /* Revert to the main lexer. */
29915 /* Restore the queue. */
29921 /* Commit to changes. */
29924 /* Leave our temporary scope for the postcondition result. */
29926 {
29929 }
29930 }
29932 /* Parse a standard C++-11 attribute specifier.
29934 attribute-specifier:
29935 [ [ attribute-using-prefix [opt] attribute-list ] ]
29936 contract-attribute-specifier
29937 alignment-specifier
29939 attribute-using-prefix:
29940 using attribute-namespace :
29942 alignment-specifier:
29943 alignas ( type-id ... [opt] )
29944 alignas ( alignment-expression ... [opt] ).
29946 Extensions for contracts:
29948 contract-attribute-specifier:
29949 [ [ assert : contract-mode [opt] : conditional-expression ] ]
29950 [ [ pre : contract-mode [opt] : conditional-expression ] ]
29951 [ [ post : contract-mode [opt] identifier [opt] :
29952 conditional-expression ] ] */
29954 static tree
29956 {
29962 {
29971 {
29974 }
29976 /* Handle contract-attribute-specs specially. */
29978 {
29983 }
29986 {
29997 {
30000 "attribute using prefix only available "
30006 }
30007 else
30009 }
30013 finish_attrs:
30017 else
30018 /* Warn about parsing c++11 attribute in non-c++11 mode, only
30019 when we are sure that we have actually parsed them. */
30021 }
30022 else
30023 {
30024 tree alignas_expr;
30026 /* Look for an alignment-specifier. */
30037 matching_parens parens;
30045 {
30052 }
30057 /* Handle alignas (pack...). */
30059 {
30062 }
30064 /* Something went wrong, so don't build the attribute. */
30068 /* Missing ')' means the code cannot possibly be valid; go ahead
30069 and commit to make sure we issue a hard error. */
30077 /* Build the C++-11 representation of an 'aligned'
30078 attribute. */
30079 attributes
30082 }
30085 }
30087 /* Parse a standard C++-11 attribute-specifier-seq.
30089 attribute-specifier-seq:
30090 attribute-specifier-seq [opt] attribute-specifier */
30092 static tree
30094 {
30098 /* Don't create wrapper nodes within attributes: the
30099 handlers don't know how to handle them. */
30100 auto_suppress_location_wrappers sentinel;
30103 {
30112 else
30115 }
30118 }
30120 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
30121 return index of the first token after balanced-token, or N on failure. */
30123 static size_t
30125 {
30128 do
30130 {
30134 /* FALLTHRU */
30136 /* Ran out of tokens. */
30158 }
30161 }
30163 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
30164 return index of the first token after the GNU attribute tokens, or N on
30165 failure. */
30167 static size_t
30169 {
30171 {
30183 }
30185 }
30187 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
30188 next token), return index of the first token after the standard C++11
30189 attribute tokens, or N on failure. */
30191 static size_t
30193 {
30195 {
30198 {
30205 }
30208 {
30213 }
30214 else
30216 }
30218 }
30220 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
30221 as the next token), return index of the first token after the attribute
30222 tokens, or N on failure. */
30224 static size_t
30226 {
30230 }
30232 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
30233 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
30234 current value of the PEDANTIC flag, regardless of whether or not
30235 the `__extension__' keyword is present. The caller is responsible
30236 for restoring the value of the PEDANTIC flag. */
30238 static bool
30240 {
30241 /* Save the old value of the PEDANTIC flag. */
30245 {
30246 /* Consume the `__extension__' token. */
30248 /* We're not being pedantic while the `__extension__' keyword is
30249 in effect. */
30253 }
30256 }
30258 /* Parse a label declaration.
30260 label-declaration:
30261 __label__ label-declarator-seq ;
30263 label-declarator-seq:
30264 identifier , label-declarator-seq
30265 identifier */
30267 static void
30269 {
30270 /* Look for the `__label__' keyword. */
30274 {
30275 tree identifier;
30277 /* Look for an identifier. */
30279 /* If we failed, stop. */
30282 /* Declare it as a label. */
30284 /* If the next token is a `;', stop. */
30287 /* Look for the `,' separating the label declarations. */
30289 }
30291 /* Look for the final `;'. */
30293 }
30295 // -------------------------------------------------------------------------- //
30296 // Concept definitions
30298 static tree
30300 {
30301 /* A concept definition is an unevaluated context. */
30302 cp_unevaluated u;
30309 {
30313 }
30318 {
30322 }
30324 processing_constraint_expression_sentinel parsing_constraint;
30329 /* Consume the trailing ';'. Diagnose the problem if it isn't there,
30330 but continue as if it were. */
30334 }
30336 // -------------------------------------------------------------------------- //
30337 // Requires Clause
30339 /* Diagnose an expression that should appear in ()'s within a requires-clause
30340 and suggest where to place those parentheses. */
30342 static void
30344 {
30346 }
30348 static void
30350 {
30355 }
30357 /* Characterizes the likely kind of expression intended by a mis-written
30358 primary constraint. */
30359 enum primary_constraint_error
30360 {
30361 pce_ok,
30362 pce_maybe_operator,
30363 pce_maybe_postfix
30364 };
30366 /* Returns true if the token(s) following a primary-expression in a
30367 constraint-logical-* expression would require parentheses. */
30369 static primary_constraint_error
30371 {
30374 {
30379 {
30380 /* An equal sign may be part of the definition of a function,
30381 and not an assignment operator, when parsing the expression
30382 for a trailing requires-clause. For example:
30384 template<typename T>
30385 struct S {
30386 S() requires C<T> = default;
30387 };
30389 Don't try to reparse this a binary operator. */
30395 }
30397 /* Arithmetic operators. */
30403 /* Bitwise operators. */
30409 /* Relational operators. */
30417 /* Pointer-to-member. */
30420 /* Assignment operators. */
30431 /* Conditional operator */
30433 /* Unenclosed binary or conditional operator. */
30437 {
30438 /* A primary constraint that precedes the parameter-list of a
30439 lambda expression is followed by an open paren.
30441 []<typename T> requires C (T a, T b) { ... }
30443 Don't try to re-parse this as a postfix expression. */
30448 }
30450 {
30451 /* A primary-constraint-expression followed by a '[[' is not a
30452 postfix expression. */
30457 }
30461 /* Unenclosed postfix operator. */
30465 /* A primary constraint that precedes the lambda-declarator of a
30466 lambda expression is followed by trailing return type.
30468 []<typename T> requires C -> void {}
30470 Don't try to re-parse this as a postfix expression in
30471 C++23 and later. In C++20 ( needs to come in between but we
30472 allow it to be omitted with pedwarn. */
30475 /* Unenclosed postfix operator. */
30477 }
30478 }
30480 /* Returns true if the next token begins a unary expression, preceded by
30481 an operator or keyword. */
30483 static bool
30485 {
30488 {
30499 {
30501 {
30517 }
30518 }
30522 }
30525 }
30527 /* Parse a primary expression within a constraint. */
30529 static cp_expr
30531 {
30532 /* If this looks like a unary expression, parse it as such, but diagnose
30533 it as ill-formed; it requires parens. */
30535 {
30539 }
30542 cp_id_kind idk;
30553 {
30554 /* The primary-expression could be part of an unenclosed non-logical
30555 compound expression. */
30557 }
30559 {
30562 }
30564 /* Retry the parse at a lower precedence. If that succeeds, diagnose the
30565 error, but return the expression as if it were valid. */
30570 else
30573 {
30576 }
30578 /* Otherwise, something has gone very wrong, and we can't generate a more
30579 meaningful diagnostic or recover. */
30582 }
30584 /* Parse a constraint-logical-and-expression.
30586 constraint-logical-and-expression:
30587 primary-expression
30588 constraint-logical-and-expression '&&' primary-expression */
30590 static cp_expr
30592 {
30595 {
30599 }
30601 }
30603 /* Parse a constraint-logical-or-expression.
30605 constraint-logical-or-expression:
30606 constraint-logical-and-expression
30607 constraint-logical-or-expression '||' constraint-logical-and-expression */
30609 static cp_expr
30611 {
30614 {
30618 }
30620 }
30622 /* Parse the expression after a requires-clause. This has a different grammar
30623 than that in the concepts TS. */
30625 static tree
30627 {
30628 processing_constraint_expression_sentinel parsing_constraint;
30635 }
30637 /* Parse a expression after a requires clause.
30639 constraint-expression:
30640 logical-or-expression
30642 The required logical-or-expression must be a constant expression. Note
30643 that we don't check that the expression is constepxr here. We defer until
30644 we analyze constraints and then, we only check atomic constraints. */
30646 static tree
30648 {
30649 processing_constraint_expression_sentinel parsing_constraint;
30658 }
30660 /* Optionally parse a requires clause:
30662 requires-clause:
30663 `requires` constraint-logical-or-expression.
30664 [ConceptsTS]
30665 `requires constraint-expression.
30667 LAMBDA_P is true when the requires-clause is parsed before the
30668 parameter-list of a lambda-declarator. */
30670 static tree
30672 {
30673 /* A requires clause is an unevaluated context. */
30674 cp_unevaluated u;
30678 {
30681 {
30683 "%<requires%> only available with "
30685 /* Parse and discard the requires-clause. */
30688 }
30690 }
30694 {
30695 /* An opening brace following the start of a requires-clause is
30696 ill-formed; the user likely forgot the second `requires' that
30697 would start a requires-expression. */
30702 /* Don't consume the `requires', so that it's reused as the start of a
30703 requires-expression. */
30704 }
30705 else
30710 else
30712 }
30714 /*---------------------------------------------------------------------------
30715 Requires expressions
30716 ---------------------------------------------------------------------------*/
30718 /* Parse a requires expression
30720 requirement-expression:
30721 'requires' requirement-parameter-list [opt] requirement-body */
30723 static tree
30725 {
30729 /* Avoid committing to outer tentative parse. */
30732 /* This is definitely a requires-expression. */
30736 {
30737 /* Local parameters are delared as variables within the scope
30738 of the expression. They are not visible past the end of
30739 the expression. Expressions within the requires-expression
30740 are unevaluated. */
30741 struct scope_sentinel
30742 {
30744 {
30748 }
30751 {
30754 }
30757 /* Parse the optional parameter list. */
30759 {
30763 }
30764 else
30767 /* Parse the requirement body. */
30773 }
30775 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
30776 the parm chain. */
30781 {
30782 /* Perform semantic processing now to diagnose any invalid types and
30783 expressions. */
30788 }
30790 }
30792 /* Parse a parameterized requirement.
30794 requirement-parameter-list:
30795 '(' parameter-declaration-clause ')' */
30797 static tree
30799 {
30800 matching_parens parens;
30804 tree parms = (cp_parser_parameter_declaration_clause
30810 /* Modify the declared parameters by removing their context
30811 so they don't refer to the enclosing scope and explicitly
30812 indicating that they are constraint variables. */
30814 {
30819 {
30822 }
30823 }
30826 }
30828 /* Parse the body of a requirement.
30830 requirement-body:
30831 '{' requirement-list '}' */
30832 static tree
30834 {
30835 matching_braces braces;
30845 }
30847 /* Parse a sequence of requirements.
30849 requirement-seq:
30850 requirement
30851 requirement-seq requirement */
30853 static tree
30855 {
30857 do
30858 {
30862 }
30866 /* If there are no valid requirements, this is not a valid expression. */
30870 /* Reverse the order of requirements so they are analyzed in order. */
30872 }
30874 /* Parse a syntactic requirement or type requirement.
30876 requirement:
30877 simple-requirement
30878 compound-requirement
30879 type-requirement
30880 nested-requirement */
30882 static tree
30884 {
30888 {
30889 /* It's probably a type-requirement. */
30894 /* No, maybe it's something like typename T::type(); */
30899 /* Non-tentative for the error. */
30901 }
30904 else
30906 }
30908 /* Parse a simple requirement.
30910 simple-requirement:
30911 expression ';' */
30913 static tree
30915 {
30926 /* Sometimes we don't get locations, so use the cached token location
30927 as a reasonable approximation. */
30932 {
30935 {
30938 }
30940 {
30944 "if a concept-id is a valid expression; add "
30946 }
30948 }
30951 }
30953 /* Parse a type requirement
30955 type-requirement
30956 nested-name-specifier [opt] required-type-name ';'
30958 required-type-name:
30959 type-name
30960 'template' [opt] simple-template-id */
30962 static tree
30964 {
30968 // Save the scope before parsing name specifiers.
30979 tree type;
30981 {
30990 }
30991 else
31011 }
31013 /* Parse a compound requirement
31015 compound-requirement:
31016 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
31018 static tree
31020 {
31021 /* Parse an expression enclosed in '{ }'s. */
31022 matching_braces braces;
31033 {
31037 }
31039 /* If the expression was invalid, skip the remainder of the requirement. */
31041 {
31045 }
31047 /* Parse the optional noexcept. */
31050 {
31053 }
31055 /* Parse the optional trailing return type. */
31058 {
31064 /* C++20 allows either a type-id or a type-constraint. Parsing
31065 a type-id will subsume the parsing for a type-constraint but
31066 allow for more syntactic forms (e.g., const C<T>*). */
31075 /* Check that we haven't written something like 'const C<T>*'. */
31077 {
31079 {
31084 }
31085 }
31087 /* P1452R2 removed the trailing-return-type option. */
31090 }
31102 }
31104 /* Parse a nested requirement. This is the same as a requires clause.
31106 nested-requirement:
31107 requires-clause */
31109 static tree
31111 {
31123 }
31125 /* Support Functions */
31127 /* Return the appropriate prefer_type argument for lookup_name based on
31128 tag_type. */
31132 {
31134 {
31138 }
31139 }
31141 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
31142 NAME should have one of the representations used for an
31143 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
31144 is returned. If PARSER->SCOPE is a dependent type, then a
31145 SCOPE_REF is returned.
31147 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
31148 returned; the name was already resolved when the TEMPLATE_ID_EXPR
31149 was formed. Abstractly, such entities should not be passed to this
31150 function, because they do not need to be looked up, but it is
31151 simpler to check for this special case here, rather than at the
31152 call-sites.
31154 In cases not explicitly covered above, this function returns a
31155 DECL, OVERLOAD, or baselink representing the result of the lookup.
31156 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
31157 is returned.
31159 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
31160 (e.g., "struct") that was used. In that case bindings that do not
31161 refer to types are ignored.
31163 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
31164 ignored.
31166 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
31167 are ignored.
31169 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
31170 types.
31172 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
31173 TREE_LIST of candidates if name-lookup results in an ambiguity, and
31174 NULL_TREE otherwise. */
31176 static cp_expr
31183 location_t name_location)
31184 {
31185 tree decl;
31188 /* Assume that the lookup will be unambiguous. */
31192 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
31193 no longer valid. Note that if we are parsing tentatively, and
31194 the parse fails, OBJECT_TYPE will be automatically restored. */
31200 /* A template-id has already been resolved; there is no lookup to
31201 do. */
31205 {
31209 }
31211 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
31212 it should already have been checked to make sure that the name
31213 used matches the type being destroyed. */
31215 {
31216 tree type;
31218 /* Figure out to which type this destructor applies. */
31223 else
31225 /* If that's not a class type, there is no destructor. */
31229 /* In a non-static member function, check implicit this->. */
31232 tf_warning_or_error);
31241 }
31243 /* By this point, the NAME should be an ordinary identifier. If
31244 the id-expression was a qualified name, the qualifying scope is
31245 stored in PARSER->SCOPE at this point. */
31248 /* Perform the lookup. */
31250 {
31256 /* If the SCOPE is dependent, the lookup must be deferred until
31257 the template is instantiated -- unless we are explicitly
31258 looking up names in uninstantiated templates. Even then, we
31259 cannot look up the name if the scope is not a class type; it
31260 might, for example, be a template type parameter. */
31265 /* Defer lookup. */
31267 else
31268 {
31271 /* If PARSER->SCOPE is a dependent type, then it must be a
31272 class type, and we must not be checking dependencies;
31273 otherwise, we would have processed this lookup above. So
31274 that PARSER->SCOPE is not considered a dependent base by
31275 lookup_member, we must enter the scope here. */
31279 /* If the PARSER->SCOPE is a template specialization, it
31280 may be instantiated during name lookup. In that case,
31281 errors may be issued. Even if we rollback the current
31282 tentative parse, those errors are valid. */
31287 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
31288 lookup result and the nested-name-specifier nominates a class C:
31289 * if the name specified after the nested-name-specifier, when
31290 looked up in C, is the injected-class-name of C (Clause 9), or
31291 * if the name specified after the nested-name-specifier is the
31292 same as the identifier or the simple-template-id's template-
31293 name in the last component of the nested-name-specifier,
31294 the name is instead considered to name the constructor of
31295 class C. [ Note: for example, the constructor is not an
31296 acceptable lookup result in an elaborated-type-specifier so
31297 the constructor would not be used in place of the
31298 injected-class-name. --end note ] Such a constructor name
31299 shall be used only in the declarator-id of a declaration that
31300 names a constructor or in a using-declaration. */
31310 }
31312 /* If the scope is a dependent type and either we deferred lookup or
31313 we did lookup but didn't find the name, rememeber the name. */
31316 {
31318 {
31319 tree type;
31321 /* The resolution to Core Issue 180 says that `struct
31322 A::B' should be considered a type-name, even if `A'
31323 is dependent. */
31328 }
31332 CPP_CLOSE_PAREN)))
31336 else
31339 is_template);
31340 }
31343 }
31345 {
31348 /* Look up the name in the scope of the OBJECT_TYPE, unless the
31349 OBJECT_TYPE is not a class. */
31351 /* If the OBJECT_TYPE is a template specialization, it may
31352 be instantiated during name lookup. In that case, errors
31353 may be issued. Even if we rollback the current tentative
31354 parse, those errors are valid. */
31356 name,
31359 tf_warning_or_error);
31360 else
31364 /* Look it up in the enclosing context. DR 141: When looking for a
31365 template-name after -> or ., only consider class templates. */
31367 /* DR 141: When looking in the
31368 current enclosing context for a
31369 template-name after -> or ., only
31370 consider class templates. */
31374 /* If we did unqualified lookup of a dependent member-qualified name and
31375 found something, do we want to use it? P1787 clarified that we need
31376 to look in the object scope first even if it's dependent, but for now
31377 let's still use it in some cases.
31378 FIXME remember unqualified lookup result to use if member lookup fails
31379 at instantiation time. */
31381 {
31383 /* Only use the unqualified class template lookup if we're actually
31384 looking at a template arg list. */
31387 }
31389 /* If we know we're looking for a type (e.g. A in p->A::x),
31390 mock up a typename. */
31393 {
31395 typename_type);
31397 }
31401 }
31402 else
31403 {
31408 }
31410 /* If the lookup failed, let our caller know. */
31414 /* If we have resolved the name of a member declaration, check to
31415 see if the declaration is accessible. When the name resolves to
31416 set of overloaded functions, accessibility is checked when
31417 overload resolution is done. If we have a TREE_LIST, then the lookup
31418 is either ambiguous or it found multiple injected-class-names, the
31419 accessibility of which is trivially satisfied.
31421 During an explicit instantiation, access is not checked at all,
31422 as per [temp.explicit]. */
31425 tf_warning_or_error);
31427 /* Pull out the template from an injected-class-name (or multiple). */
31431 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
31433 {
31436 /* The error message we have to print is too complicated for
31437 cp_parser_error, so we incorporate its actions directly. */
31439 {
31441 name);
31443 }
31445 }
31456 }
31458 /* Like cp_parser_lookup_name, but for use in the typical case where
31459 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
31460 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
31462 static tree
31464 {
31466 none_type,
31471 location);
31472 }
31474 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
31475 the current context, return the TYPE_DECL. If TAG_NAME_P is
31476 true, the DECL indicates the class being defined in a class-head,
31477 or declared in an elaborated-type-specifier.
31479 Otherwise, return DECL. */
31481 static tree
31483 {
31484 /* If the TEMPLATE_DECL is being declared as part of a class-head,
31485 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
31487 struct A {
31488 template <typename T> struct B;
31489 };
31491 template <typename T> struct A::B {};
31493 Similarly, in an elaborated-type-specifier:
31495 namespace N { struct X{}; }
31497 struct A {
31498 template <typename T> friend struct N::X;
31499 };
31501 However, if the DECL refers to a class type, and we are in
31502 the scope of the class, then the name lookup automatically
31503 finds the TYPE_DECL created by build_self_reference rather
31504 than a TEMPLATE_DECL. For example, in:
31506 template <class T> struct S {
31507 S s;
31508 };
31510 there is no need to handle such case. */
31516 }
31518 /* If too many, or too few, template-parameter lists apply to the
31519 declarator, issue an error message. Returns TRUE if all went well,
31520 and FALSE otherwise. */
31522 static bool
31525 location_t declarator_location)
31526 {
31528 {
31530 {
31539 {
31540 /* If the DECLARATOR has the form `X<y>' then it uses one
31541 additional level of template parameters. */
31544 }
31546 return cp_parser_check_template_parameters
31548 declarator);
31549 }
31565 }
31567 }
31569 /* NUM_TEMPLATES were used in the current declaration. If that is
31570 invalid, return FALSE and issue an error messages. Otherwise,
31571 return TRUE. If DECLARATOR is non-NULL, then we are checking a
31572 declarator and we can print more accurate diagnostics. */
31574 static bool
31578 location_t location,
31580 {
31581 /* If there are the same number of template classes and parameter
31582 lists, that's OK. */
31585 /* If there are more, but only one more, and the name ends in an identifier,
31586 then we are declaring a primary template. That's OK too. */
31594 /* If there are more template classes than parameter lists, we have
31595 something like:
31597 template <class T> void S<T>::R<T>::f (); */
31599 {
31609 else
31612 }
31613 /* Otherwise, there are too many template parameter lists. We have
31614 something like:
31616 template <class T> template <class U> void S::f(); */
31619 }
31621 /* Parse an optional `::' token indicating that the following name is
31622 from the global namespace. If so, PARSER->SCOPE is set to the
31623 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
31624 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
31625 Returns the new value of PARSER->SCOPE, if the `::' token is
31626 present, and NULL_TREE otherwise. */
31628 static tree
31630 {
31633 /* Peek at the next token. */
31635 /* If we're looking at a `::' token then we're starting from the
31636 global namespace, not our current location. */
31638 {
31639 /* Consume the `::' token. */
31641 /* Set the SCOPE so that we know where to start the lookup. */
31647 }
31649 {
31653 }
31656 }
31658 /* Returns TRUE if the upcoming token sequence is the start of a
31659 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
31660 declarator is preceded by the `friend' specifier. The parser flags FLAGS
31661 is used to control type-specifier parsing. */
31663 static bool
31666 {
31669 tree nested_name_specifier;
31672 /* The common case is that this is not a constructor declarator, so
31673 try to avoid doing lots of work if at all possible. It's not
31674 valid declare a constructor at function scope. */
31677 /* And only certain tokens can begin a constructor declarator. */
31682 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
31683 declarator-id of a constructor or destructor. */
31687 /* Parse tentatively; we are going to roll back all of the tokens
31688 consumed here. */
31690 /* Assume that we are looking at a constructor declarator. */
31693 /* Look for the optional `::' operator. */
31696 /* Look for the nested-name-specifier. */
31697 nested_name_specifier
31704 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
31707 {
31712 }
31718 /* Outside of a class-specifier, there must be a
31719 nested-name-specifier. Except in C++17 mode, where we
31720 might be declaring a guiding declaration. */
31727 /* If we have a class scope, this is easy; DR 147 says that S::S always
31728 names the constructor, and no other qualified name could. */
31731 {
31741 }
31742 /* If we still think that this might be a constructor-declarator,
31743 look for a class-name. */
31745 {
31746 /* If we have:
31748 template <typename T> struct S {
31749 S();
31750 };
31752 we must recognize that the nested `S' names a class. */
31756 tree type_decl;
31760 none_type,
31767 {
31773 none_type,
31778 else
31780 }
31782 /* If there was no class-name, then this is not a constructor.
31783 Otherwise, if we are in a class-specifier and we aren't
31784 handling a friend declaration, check that its type matches
31785 current_class_type (c++/38313). Note: error_mark_node
31786 is left alone for error recovery purposes. */
31788 && (outside_class_specifier_p
31794 /* If we're still considering a constructor, we have to see a `(',
31795 to begin the parameter-declaration-clause, followed by either a
31796 `)', an `...', or a decl-specifier. We need to check for a
31797 type-specifier to avoid being fooled into thinking that:
31799 S (f) (int);
31801 is a constructor. (It is actually a function named `f' that
31802 takes one parameter (of type `int') and returns a value of type
31803 `S'. */
31811 /* A parameter declaration begins with a decl-specifier,
31812 which is either the "attribute" keyword, a storage class
31813 specifier, or (usually) a type-specifier. */
31815 /* GNU attributes can actually appear both at the start of
31816 a parameter and parenthesized declarator.
31817 S (__attribute__((unused)) int);
31818 is a constructor, but
31819 S (__attribute__((unused)) foo) (int);
31820 is a function declaration. [[attribute]] can appear in the
31821 first form too, but not in the second form. */
31823 {
31824 tree type;
31830 {
31834 }
31836 /* Names appearing in the type-specifier should be looked up
31837 in the scope of the class. */
31841 {
31844 {
31848 {
31851 }
31852 }
31854 }
31856 /* Inside the constructor parameter list, surrounding
31857 template-parameter-lists do not apply. */
31858 saved_num_template_parameter_lists
31862 /* Look for the type-specifier. It's not optional, but its typename
31863 might be. Unless this is a friend declaration; we don't want to
31864 treat
31866 friend S (T::fn)(int);
31868 as a constructor, but with P0634, we might assume a type when
31869 looking for the type-specifier. It is actually a function named
31870 `T::fn' that takes one parameter (of type `int') and returns a
31871 value of type `S'. Constructors can be friends, but they must
31872 use a qualified name.
31874 Parse with an empty set of declaration specifiers since we're
31875 trying to match a decl-specifier-seq of the first parameter.
31876 This must be non-null so that cp_parser_simple_type_specifier
31877 will recognize a constrained placeholder type such as:
31878 'C<int> auto' where C is a type concept. */
31879 cp_decl_specifier_seq ctor_specs;
31889 parser->num_template_parameter_lists
31892 /* Leave the scope of the class. */
31897 }
31898 }
31900 /* We did not really want to consume any tokens. */
31904 }
31906 /* Parse the definition of the function given by the DECL_SPECIFIERS,
31907 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
31908 they must be performed once we are in the scope of the function.
31910 Returns the function defined. */
31912 static tree
31913 cp_parser_function_definition_from_specifiers_and_declarator
31916 tree attributes,
31918 {
31919 tree fn;
31922 /* Begin the function-definition. */
31925 /* The things we're about to see are not directly qualified by any
31926 template headers we've seen thus far. */
31929 /* If there were names looked up in the decl-specifier-seq that we
31930 did not check, check them now. We must wait until we are in the
31931 scope of the function to perform the checks, since the function
31932 might be a friend. */
31936 {
31941 }
31944 {
31945 /* Skip the entire function. */
31948 }
31950 {
31951 /* Seen already, skip it. An error message has already been output. */
31955 /* If this is a function from a class, pop the nested class. */
31958 }
31959 else
31960 {
31965 }
31968 }
31970 /* Parse the part of a function-definition that follows the
31971 declarator. INLINE_P is TRUE iff this function is an inline
31972 function defined within a class-specifier.
31974 Returns the function defined. */
31976 static tree
31979 {
31980 tree fn;
31985 bool fully_implicit_function_template_p
31988 tree implicit_template_parms
31991 cp_binding_level* implicit_template_scope
31997 /* If the next token is `return', then the code may be trying to
31998 make use of the "named return value" extension that G++ used to
31999 support. */
32002 {
32003 /* Consume the `return' keyword. */
32005 /* Look for the identifier that indicates what value is to be
32006 returned. */
32008 /* Issue an error message. */
32011 /* Skip tokens until we reach the start of the function body. */
32013 {
32020 }
32021 }
32022 /* The `extern' in `extern "C" void f () { ... }' does not apply to
32023 anything declared inside `f'. */
32024 saved_in_unbraced_linkage_specification_p
32027 /* Inside the function, surrounding template-parameter-lists do not
32028 apply. */
32029 saved_num_template_parameter_lists
32033 /* If the next token is `try', `__transaction_atomic', or
32034 `__transaction_relaxed`, then we are looking at either function-try-block
32035 or function-transaction-block. Note that all of these include the
32036 function-body. */
32040 RID_TRANSACTION_RELAXED))
32044 else
32045 cp_parser_ctor_initializer_opt_and_function_body
32048 /* Finish the function. */
32052 && !inline_p
32058 /* Generate code for it, if necessary. */
32061 /* Restore the saved values. */
32062 parser->in_unbraced_linkage_specification_p
32064 parser->num_template_parameter_lists
32068 parser->fully_implicit_function_template_p
32070 parser->implicit_template_parms
32072 parser->implicit_template_scope
32079 }
32081 /* Parse a template-declaration body (following argument list). */
32083 static void
32085 tree parameter_list,
32087 {
32091 /* We just processed one more parameter list. */
32094 /* Get the deferred access checks from the parameter list. These
32095 will be checked once we know what is being declared, as for a
32096 member template the checks must be performed in the scope of the
32097 class containing the member. */
32100 /* Tentatively parse for a new template parameter list, which can either be
32101 the template keyword or a template introduction. */
32110 /* -fconcept-ts 'concept bool' syntax is handled below, in
32111 cp_parser_single_declaration. */
32113 else
32114 {
32117 checks,
32118 member_p,
32122 /* If this is a member template declaration, let the front
32123 end know. */
32125 {
32130 }
32135 }
32136 /* We are done with the current parameter list. */
32141 /* Finish up. */
32144 /* Check the template arguments for a literal operator template. */
32148 {
32152 else
32153 {
32156 {
32163 /* OK, C++20 string literal operator template. We don't need
32164 to warn in lower dialects here because we will have already
32169 }
32171 {
32180 else
32181 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
32183 "ISO C++ did not adopt string literal operator templa"
32185 }
32186 else
32188 }
32190 {
32193 "template %qD has invalid parameter list; expected "
32194 "non-type template parameter pack %<<char...>%> or "
32196 decl);
32197 else
32199 "template %qD has invalid parameter list; expected "
32201 decl);
32202 }
32203 }
32205 /* Register member declarations. */
32208 /* If DECL is a function template, we must return to parse it later.
32209 (Even though there is no definition, there might be default
32210 arguments that need handling.) */
32214 }
32216 /* Parse a template introduction header for a template-declaration. Returns
32217 false if tentative parse fails. */
32219 static bool
32221 {
32231 /* In classes don't parse valid unnamed bitfields as invalid
32232 template introductions. */
32236 /* Look for the optional `::' operator. */
32239 /* Look for the nested-name-specifier. */
32249 /* Look up the concept for which we will be matching
32250 template parameters. */
32262 /* Look for opening brace for introduction. */
32263 matching_braces braces;
32272 /* Build vector of placeholder parameters and grab
32273 matching identifiers. */
32276 /* Look for closing brace for introduction. */
32280 /* The introduction-list shall not be empty. */
32283 {
32284 /* In cp_parser_introduction_list we have already issued an error. */
32286 }
32289 {
32293 }
32295 /* Build and associate the constraint. */
32300 introduction_list,
32301 introduction_loc);
32303 {
32310 member_p);
32312 }
32318 }
32320 /* Parse a normal template-declaration following the template keyword. */
32322 static void
32324 {
32325 tree parameter_list;
32329 /* Look for the `<' token. */
32333 {
32334 /* 14.5.2.2 [temp.mem]
32336 A local class shall not have member templates. */
32341 }
32342 /* [temp]
32344 A template ... shall not have C linkage. */
32346 {
32349 /* Give it C++ linkage to avoid confusing other parts of the
32350 front end. */
32353 }
32354 else
32357 /* We cannot perform access checks on the template parameter
32358 declarations until we know what is being declared, just as we
32359 cannot check the decl-specifier list. */
32362 /* If the next token is `>', then we have an invalid
32363 specialization. Rather than complain about an invalid template
32364 parameter, issue an error message here. */
32366 {
32370 }
32371 else
32372 {
32373 /* Parse the template parameters. */
32375 }
32377 /* Look for the `>'. */
32380 /* Manage template requirements */
32382 {
32387 }
32390 member_p);
32392 /* For the erroneous case of a template with C linkage, we pushed an
32393 implicit C++ linkage scope; exit that scope now. */
32396 }
32398 /* Parse a template-declaration, assuming that the `export' (and
32399 `extern') keywords, if present, has already been scanned. MEMBER_P
32400 is as for cp_parser_template_declaration. */
32402 static bool
32404 {
32406 {
32410 }
32415 }
32417 /* Perform the deferred access checks from a template-parameter-list.
32418 CHECKS is a TREE_LIST of access checks, as returned by
32419 get_deferred_access_checks. */
32421 static void
32422 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
32423 {
32427 }
32429 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
32430 `function-definition' sequence that follows a template header.
32431 If MEMBER_P is true, this declaration appears in a class scope.
32433 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
32434 *FRIEND_P is set to TRUE iff the declaration is a friend. */
32436 static tree
32442 {
32445 cp_decl_specifier_seq decl_specifiers;
32449 /* This function is only used when processing a template
32450 declaration. */
32454 /* Defer access checks until we know what is being declared. */
32457 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
32458 alternative. */
32461 (CP_PARSER_FLAGS_OPTIONAL
32466 cp_omp_declare_simd_data odsd;
32475 /* There are no template typedefs. */
32477 {
32481 }
32483 /* Gather up the access checks that occurred the
32484 decl-specifier-seq. */
32487 /* Check for the declaration of a template class. */
32489 {
32492 {
32495 /* In this case:
32497 struct C {
32498 friend template <typename T> struct A<T>::B;
32499 };
32501 A<T>::B will be represented by a TYPENAME_TYPE, and
32502 therefore not recognized by shadow_tag. */
32504 && !decl
32511 else
32514 /* If this is a declaration, but not a definition, associate
32515 any constraints with the type declaration. Constraints
32516 are associated with definitions in cp_parser_class_specifier. */
32520 /* Perform access checks for template parameters. */
32523 /* Give a helpful diagnostic for
32524 template <class T> struct A { } a;
32525 if we aren't already recovering from an error. */
32528 {
32530 "a class template declaration must not declare "
32534 }
32535 }
32536 }
32538 /* Complain about missing 'typename' or other invalid type names. */
32541 {
32542 /* cp_parser_parse_and_diagnose_invalid_type_name calls
32543 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
32544 the rest of this declaration. */
32547 }
32549 /* If it's not a template class, try for a template function. If
32550 the next token is a `;', then this declaration does not declare
32551 anything. But, if there were errors in the decl-specifiers, then
32552 the error might well have come from an attempted class-specifier.
32553 In that case, there's no need to warn about a missing declarator. */
32557 {
32559 /* We don't delay parsing for friends, though CWG 2510 may change
32560 that. */
32564 flags,
32566 checks,
32568 member_p,
32569 declares_class_or_enum,
32573 /* 7.1.1-1 [dcl.stc]
32575 A storage-class-specifier shall not be specified in an explicit
32576 specialization... */
32578 && explicit_specialization_p
32580 {
32584 }
32588 }
32590 /* Look for a trailing `;' after the declaration. */
32596 out:
32599 /* Clear any current qualification; whatever comes next is the start
32600 of something new. */
32608 }
32610 /* Parse a cast-expression that is not the operand of a unary "&". */
32612 static cp_expr
32614 {
32617 }
32619 /* Parse a functional cast to TYPE. Returns an expression
32620 representing the cast. */
32622 static cp_expr
32624 {
32626 tree expression_list;
32627 cp_expr cast;
32636 {
32646 /* Create a location of the form:
32647 type_name{i, f}
32648 ^~~~~~~~~~~~~~~
32649 with caret == start at the start of the type name,
32650 finishing at the closing brace. */
32655 }
32664 else
32665 {
32668 }
32670 /* Create a location of the form:
32671 float(i)
32672 ^~~~~~~~
32673 with caret == start at the start of the type name,
32674 finishing at the closing paren. */
32678 tf_warning_or_error);
32680 /* [expr.const]/1: In an integral constant expression "only type
32681 conversions to integral or enumeration type can be used". */
32687 NIC_CONSTRUCTOR))
32691 }
32693 /* Save the tokens that make up the body of a member function defined
32694 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
32695 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
32696 specifiers applied to the declaration. Returns the FUNCTION_DECL
32697 for the member function. */
32699 static tree
32703 tree attributes)
32704 {
32707 tree fn;
32710 /* Create the FUNCTION_DECL. */
32714 /* If something went badly wrong, bail out now. */
32716 {
32717 /* If there's a function-body, skip it. */
32722 }
32724 /* Remember it, if there are default args to post process. */
32727 /* Save away the tokens that make up the body of the
32728 function. */
32734 RID_TRANSACTION_ATOMIC))
32735 {
32737 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
32744 {
32750 }
32751 else
32754 {
32758 }
32759 }
32761 /* Handle function try blocks. */
32763 {
32766 }
32767 /* We can have braced-init-list mem-initializers before the fn body. */
32769 {
32772 {
32773 /* cache_group will stop after an un-nested { } pair, too. */
32777 /* variadic mem-inits have ... after the ')'. */
32780 }
32781 }
32783 /* Handle function try blocks. */
32789 /* Save away the inline definition; we will process it when the
32790 class is complete. */
32794 /* We need to know that this was defined in the class, so that
32795 friend templates are handled correctly. */
32798 /* Add FN to the queue of functions to be parsed later. */
32802 }
32804 /* Save the tokens that make up the in-class initializer for a non-static
32805 data member. Returns a DEFERRED_PARSE. */
32807 static tree
32809 {
32811 }
32813 /* Parse a template-argument-list, as well as the trailing ">" (but
32814 not the opening "<"). See cp_parser_template_argument_list for the
32815 return value. */
32817 static tree
32819 {
32820 tree arguments;
32821 tree saved_scope;
32822 tree saved_qualifying_scope;
32823 tree saved_object_scope;
32826 /* [temp.names]
32828 When parsing a template-id, the first non-nested `>' is taken as
32829 the end of the template-argument-list rather than a greater-than
32830 operator. */
32831 saved_greater_than_is_operator_p
32834 /* Parsing the argument list may modify SCOPE, so we save it
32835 here. */
32839 /* We need to evaluate the template arguments, even though this
32840 template-id may be nested within a "sizeof". */
32841 cp_evaluated ev;
32842 /* Parse the template-argument-list itself. */
32847 {
32850 }
32851 else
32853 /* Look for the `>' that ends the template-argument-list. If we find
32854 a '>>' instead, it's probably just a typo. */
32856 {
32858 {
32859 /* In C++0x, a `>>' in a template argument list or cast
32860 expression is considered to be two separate `>'
32861 tokens. So, change the current token to a `>', but don't
32862 consume it: it will be consumed later when the outer
32863 template argument list (or cast expression) is parsed.
32864 Note that this replacement of `>' for `>>' is necessary
32865 even if we are parsing tentatively: in the tentative
32866 case, after calling
32867 cp_parser_enclosed_template_argument_list we will always
32868 throw away all of the template arguments and the first
32869 closing `>', either because the template argument list
32870 was erroneous or because we are replacing those tokens
32871 with a CPP_TEMPLATE_ID token. The second `>' (which will
32872 not have been thrown away) is needed either to close an
32873 outer template argument list or to complete a new-style
32874 cast. */
32877 }
32879 {
32880 /* If we're in a nested template argument list, the '>>' has
32881 to be a typo for '> >'. We emit the error message, but we
32882 continue parsing and we push a '>' as next token, so that
32883 the argument list will be parsed correctly. Note that the
32884 global source location is still on the token before the
32885 '>>', so we need to say explicitly where we want it. */
32893 }
32894 else
32895 {
32896 /* If this is not a nested template argument list, the '>>'
32897 is a typo for '>'. Emit an error message and continue.
32898 Same deal about the token location, but here we can get it
32899 right by consuming the '>>' before issuing the diagnostic. */
32902 "spurious %<>>%>, use %<>%> to terminate "
32904 }
32905 }
32906 /* Similarly for >>= and >=. */
32909 {
32915 {
32918 }
32920 {
32923 else
32926 }
32927 else
32928 {
32931 }
32937 }
32938 else
32940 /* The `>' token might be a greater-than operator again now. */
32941 parser->greater_than_is_operator_p
32943 /* Restore the SAVED_SCOPE. */
32949 }
32951 /* MEMBER_FUNCTION is a member function, or a friend. If default
32952 arguments, or the body of the function have not yet been parsed,
32953 parse them now. */
32955 static void
32957 {
32960 /* If this member is a template, get the underlying
32961 FUNCTION_DECL. */
32965 /* There should not be any class definitions in progress at this
32966 point; the bodies of members are only parsed outside of all class
32967 definitions. */
32969 /* While we're parsing the member functions we might encounter more
32970 classes. We want to handle them right away, but we don't want
32971 them getting mixed up with functions that are currently in the
32972 queue. */
32975 /* Make sure that any template parameters are in scope. */
32978 /* If the body of the function has not yet been parsed, parse it
32979 now. Except if the tokens have been purged (PR c++/39751). */
32982 {
32983 tree function_scope;
32986 /* The function is no longer pending; we are processing it. */
32991 /* If this is a local class, enter the scope of the containing
32992 function. */
32997 /* Push the body of the function onto the lexer stack. */
33000 /* Let the front end know that we going to be defining this
33001 function. */
33005 /* #pragma omp declare reduction needs special parsing. */
33007 {
33012 }
33013 else
33014 /* Now, parse the body of the function. */
33018 /* Leave the scope of the containing function. */
33022 }
33024 /* Remove any template parameters from the symbol table. */
33027 /* Restore the queue. */
33029 }
33031 /* If DECL contains any default args, remember it on the unparsed
33032 functions queue. */
33034 static void
33036 {
33037 tree probe;
33040 probe;
33043 {
33047 }
33049 /* Remember if there is a noexcept-specifier to post process. */
33054 /* Contracts are deferred. */
33057 {
33060 }
33061 }
33063 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
33064 which is either a FIELD_DECL or PARM_DECL. Parse it and return
33065 the result. For a PARM_DECL, PARMTYPE is the corresponding type
33066 from the parameter-type-list. */
33068 static tree
33071 {
33073 tree parsed_arg;
33079 /* Push the saved tokens for the default argument onto the parser's
33080 lexer stack. */
33086 /* Parse the default argument. */
33097 {
33098 /* In a non-template class, check conversions now. In a template,
33099 we'll wait and instantiate these as needed. */
33102 tf_warning_or_error);
33105 else
33107 }
33109 /* If the token stream has not been completely used up, then
33110 there was extra junk after the end of the default
33111 argument. */
33113 {
33116 else
33118 }
33120 /* Revert to the main lexer. */
33124 }
33126 /* FIELD is a non-static data member with an initializer which we saved for
33127 later; parse it now. */
33129 static void
33131 {
33132 tree def;
33139 NULL_TREE);
33145 }
33147 /* FN is a FUNCTION_DECL which may contains a parameter with an
33148 unparsed DEFERRED_PARSE. Parse the default args now. This function
33149 assumes that the current scope is the scope in which the default
33150 argument should be processed. */
33152 static void
33154 {
33157 /* While we're parsing the default args, we might (due to the
33158 statement expression extension) encounter more classes. We want
33159 to handle them right away, but we don't want them getting mixed
33160 up with default args that are currently in the queue. */
33163 /* Local variable names (and the `this' keyword) may not appear
33164 in a default argument. */
33172 /* Gather the PARM_DECLs into a vec so we can keep track of them when
33173 pushdecl clears DECL_CHAIN. */
33174 releasing_vec parms;
33184 {
33186 tree parsed_arg;
33195 /* This can happen for a friend declaration for a function
33196 already declared with default arguments. */
33199 parsed_arg
33201 default_arg,
33205 /* Update any instantiations we've already created. */
33208 }
33212 /* Restore DECL_CHAINs after clobbering by pushdecl. */
33215 {
33218 }
33222 /* Make sure no default arg is missing. */
33225 /* Restore the state of local_variables_forbidden_p. */
33228 /* Restore the queue. */
33230 }
33232 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
33234 sizeof ... ( identifier )
33236 where the 'sizeof' token has already been consumed. */
33238 static tree
33240 {
33241 /* Consume the `...'. */
33245 matching_parens parens;
33249 else
33257 /* The name is not qualified. */
33277 }
33279 /* Parse the operand of `sizeof' (or a similar operator). Returns
33280 either a TYPE or an expression, depending on the form of the
33281 input. The KEYWORD indicates which kind of expression we have
33282 encountered. */
33284 static tree
33286 {
33293 /* If it's a `...', then we are computing the length of a parameter
33294 pack. */
33299 /* Types cannot be defined in a `sizeof' expression. Save away the
33300 old message. */
33303 parser->type_definition_forbidden_message
33305 parser->type_definition_forbidden_message_arg
33308 /* The restrictions on constant-expressions do not apply inside
33309 sizeof expressions. */
33310 saved_integral_constant_expression_p
33312 saved_non_integral_constant_expression_p
33319 /* Do not actually evaluate the expression. */
33322 /* If it's a `(', then we might be looking at the type-id
33323 construction. */
33325 {
33330 /* We can't be sure yet whether we're looking at a type-id or an
33331 expression. */
33334 matching_parens parens;
33337 /* Note: as a GNU Extension, compound literals are considered
33338 postfix-expressions as they are in C99, so they are valid
33339 arguments to sizeof. See comment in cp_parser_cast_expression
33340 for details. */
33343 else
33344 {
33347 /* Look for the type-id. */
33349 /* Look for the closing `)'. */
33352 }
33354 /* If all went well, then we're done. */
33357 else
33358 {
33359 /* Commit to the tentative_firewall so we get syntax errors. */
33363 }
33364 }
33365 else
33368 /* Go back to evaluating expressions. */
33372 /* And restore the old one. */
33375 parser->integral_constant_expression_p
33377 parser->non_integral_constant_expression_p
33381 }
33383 /* If the current declaration has no declarator, return true. */
33385 static bool
33387 {
33388 /* If the next token is a `;' or a `,' then there is no
33389 declarator. */
33392 }
33394 /* Update the DECL_SPECS to reflect the storage class indicated by
33395 KEYWORD. */
33397 static void
33402 {
33403 cp_storage_class storage_class;
33406 {
33424 }
33427 {
33431 }
33433 {
33440 else
33447 }
33452 {
33455 }
33460 /* A storage class specifier cannot be applied alongside a typedef
33461 specifier. If there is a typedef specifier present then set
33462 conflicting_specifiers_p which will trigger an error later
33463 on in grokdeclarator. */
33466 {
33473 }
33474 }
33476 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
33477 is true, the type is a class or enum definition. */
33479 static void
33481 tree type_spec,
33484 {
33487 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
33488 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
33489 this is what happened. In system headers, we ignore these
33490 declarations so that G++ can work with system headers that are not
33491 C++-safe. */
33493 && !type_definition_p
33506 {
33509 ds_redefined_builtin_type_spec,
33510 token);
33512 {
33516 }
33517 }
33520 else
33521 {
33526 }
33527 }
33529 /* True iff TOKEN is the GNU keyword __thread. */
33531 static bool
33533 {
33536 }
33538 /* Set the location for a declarator specifier and check if it is
33539 duplicated.
33541 DECL_SPECS is the sequence of declarator specifiers onto which to
33542 set the location.
33544 DS is the single declarator specifier to set which location is to
33545 be set onto the existing sequence of declarators.
33547 LOCATION is the location for the declarator specifier to
33548 consider. */
33550 static void
33553 {
33562 {
33566 }
33567 else
33568 {
33570 {
33574 else
33575 {
33578 OPT_Wlong_long,
33580 }
33581 }
33583 {
33587 {
33591 }
33592 else
33593 {
33596 }
33597 }
33598 else
33599 {
33617 "consteval"
33618 };
33622 }
33623 }
33624 }
33626 /* Return true iff the declarator specifier DS is present in the
33627 sequence of declarator specifiers DECL_SPECS. */
33629 bool
33631 cp_decl_spec ds)
33632 {
33639 }
33641 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
33642 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
33644 static bool
33646 {
33648 }
33650 /* Issue an error message indicating that TOKEN_DESC was expected.
33651 If KEYWORD is true, it indicated this function is called by
33652 cp_parser_require_keword and the required token can only be
33653 a indicated keyword.
33655 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33656 within any error as the location of an "opening" token matching
33657 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33658 RT_CLOSE_PAREN). */
33660 static void
33662 required_token token_desc,
33664 location_t matching_location)
33665 {
33671 {
33746 }
33749 {
33751 {
33829 }
33830 }
33834 }
33837 /* If the next token is of the indicated TYPE, consume it. Otherwise,
33838 issue an error message indicating that TOKEN_DESC was expected.
33840 Returns the token consumed, if the token had the appropriate type.
33841 Otherwise, returns NULL.
33843 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33844 within any error as the location of an "opening" token matching
33845 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33846 RT_CLOSE_PAREN). */
33851 required_token token_desc,
33852 location_t matching_location)
33853 {
33856 else
33857 {
33858 /* Output the MESSAGE -- unless we're parsing tentatively. */
33861 matching_location);
33863 }
33864 }
33866 /* Skip an entire parameter list from start to finish. The next token must
33867 be the initial "<" of the parameter list. Returns true on success and
33868 false otherwise. */
33870 static bool
33872 {
33873 /* Consume the "<" because cp_parser_skip_to_end_of_template_parameter_list
33874 requires it. */
33877 }
33879 /* Ensure we are at the end of a template parameter list. If we are, return.
33880 If we are not, something has gone wrong, in which case issue an error and
33881 skip to end of the parameter list. */
33883 static void
33885 {
33886 /* Are we ready, yet? If not, issue error message. */
33891 }
33893 /* You should only call this function from inside a template parameter list
33894 (i.e. the current token should at least be the initial "<" of the
33895 parameter list). If you are skipping the entire list, it may be better to
33896 use cp_parser_skip_entire_template_parameter_list.
33898 Tokens are skipped until the final ">" is found, or if we see
33899 '{', '}', ';', or if we find an unbalanced ')' or ']'.
33901 Returns true if we successfully reached the end, and false if
33902 something unexpected happened (e.g. end of file). */
33904 static bool
33906 {
33907 /* Current level of '< ... >'. */
33909 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
33912 /* Skip tokens until the desired token is found. */
33914 {
33915 /* Peek at the next token. */
33917 {
33925 /* C++0x views the `>>' operator as two `>' tokens, but
33926 C++98 does not. */
33929 {
33930 /* We've hit a `>>' where the first `>' closes the
33931 template argument list, and the second `>' is
33932 spurious. Just consume the `>>' and stop; we've
33933 already produced at least one error. */
33936 }
33937 /* Fall through for C++0x, so we handle the second `>' in
33938 the `>>'. */
33943 {
33944 /* We've reached the token we want, consume it and stop. */
33947 }
33966 /* The '>' was probably forgotten, don't look further. */
33971 }
33973 /* Consume this token. */
33975 }
33976 }
33978 /* If the next token is the indicated keyword, consume it. Otherwise,
33979 issue an error message indicating that TOKEN_DESC was expected.
33981 Returns the token consumed, if the token had the appropriate type.
33982 Otherwise, returns NULL. */
33987 required_token token_desc)
33988 {
33992 {
33994 UNKNOWN_LOCATION);
33996 }
33999 }
34001 /* Returns TRUE iff TOKEN is a token that can begin the body of a
34002 function-definition. */
34004 static bool
34006 {
34009 /* A ctor-initializer begins with a `:'. */
34011 /* A function-try-block begins with `try'. */
34013 /* A function-transaction-block begins with `__transaction_atomic'
34014 or `__transaction_relaxed'. */
34017 /* The named return value extension begins with `return'. */
34019 }
34021 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
34022 definition. */
34024 static bool
34026 {
34033 }
34035 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
34036 C++0x) ending a template-argument. */
34038 static bool
34040 {
34048 /* For better diagnostics, treat >>= like that too, that
34049 shouldn't appear non-nested in template arguments. */
34051 }
34053 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
34054 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
34056 static bool
34059 {
34065 /* Check for the sequence `<::' in the original code. It would be lexed as
34066 `[:', where `[' is a digraph, and there is no whitespace before
34067 `:'. */
34069 {
34074 }
34076 }
34078 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
34079 or none_type otherwise. */
34081 static enum tag_types
34083 {
34085 {
34095 }
34096 }
34098 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
34099 or none_type otherwise or if the token is null. */
34101 static enum tag_types
34103 {
34108 {
34116 }
34117 }
34119 /* Diagnose redundant enum-keys. */
34121 static void
34124 {
34130 /* Look up the NAME to see if it unambiguously refers to the TYPE. */
34135 /* The enum-key is redundant for uses of the TYPE that are not
34136 declarations and for which name lookup returns just the type
34137 itself. */
34145 {
34146 /* Avoid issuing the diagnostic for apparently redundant (unscoped)
34147 enum tag in shared C/C++ code in files (such as headers) included
34148 in the main source file. */
34151 LRK_MACRO_DEFINITION_LOCATION,
34155 }
34163 }
34165 /* Describes the set of declarations of a struct, class, or class template
34166 or its specializations. Used for -Wmismatched-tags. */
34168 class class_decl_loc_t
34169 {
34174 {
34176 }
34178 /* Constructs an object for a single declaration of a class with
34179 CLASS_KEY at the current location in the current function (or
34180 at another scope). KEY_REDUNDANT is true if the class-key may
34181 be omitted in the current context without an ambiguity with
34182 another symbol with the same name.
34183 DEF_P is true for a class declaration that is a definition.
34184 CURLOC is the associated location. */
34188 {
34191 key_redundant);
34193 }
34195 /* Copy, assign, and destroy the object. Necessary because LOCVEC
34196 isn't safely copyable and assignable and doesn't release storage
34197 on its own. */
34201 { }
34204 {
34212 }
34215 {
34217 }
34219 /* Issues -Wmismatched-tags for a single class. */
34222 /* Issues -Wmismatched-tags for all classes. */
34225 /* Adds TYPE_DECL to the collection of class decls and diagnoses
34226 redundant tags (if -Wredundant-tags is enabled). */
34229 /* Either adds this decl to the collection of class decls
34230 or diagnoses it, whichever is appropriate. */
34236 {
34238 }
34241 {
34243 }
34246 {
34248 }
34251 {
34253 }
34255 /* True if a definition for the class has been seen. */
34257 {
34259 }
34261 /* The location of a single mention of a class type with the given
34262 class-key. */
34263 struct class_key_loc_t
34264 {
34267 { }
34269 /* The function the type is mentioned in. */
34270 tree func;
34271 /* The exact location. */
34272 location_t loc;
34273 /* The class-key used in the mention of the type. */
34274 tag_types class_key;
34275 /* True when the class-key could be omitted at this location
34276 without an ambiguity with another symbol of the same name. */
34278 };
34279 /* Avoid using auto_vec here since it's not safe to copy due to pr90904. */
34281 /* LOCVEC index of the definition or UINT_MAX if none exists. */
34283 /* The class-key the class was last declared with or none_type when
34284 it has been declared with a mismatched key. */
34285 tag_types def_class_key;
34287 /* A mapping between a TYPE_DECL for a class and the class_decl_loc_t
34288 description above. */
34291 };
34295 /* Issue an error message if the CLASS_KEY does not match the TYPE.
34296 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34297 is set for a declaration of class TYPE and clear for a reference to
34298 it that is not a declaration of it. */
34300 static void
34304 {
34310 {
34314 type))
34318 }
34323 /* Only consider the true class-keys below and ignore typename_type,
34324 etc. that are not C++ class-keys. */
34331 }
34333 /* Returns the template or specialization of one to which the RECORD_TYPE
34334 TYPE corresponds. */
34336 static tree
34338 {
34341 /* Determine the template or its partial specialization to which TYPE
34342 corresponds. */
34351 }
34354 /* Adds the class TYPE to the collection of class decls and diagnoses
34355 redundant tags (if -Wredundant-tags is enabled).
34356 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34357 is set for a (likely, based on syntactic context) declaration of class
34358 TYPE and clear for a reference to it that is not a declaration of it. */
34360 void
34363 {
34366 /* Look up the NAME to see if it unambiguously refers to the TYPE
34367 and set KEY_REDUNDANT if so. */
34372 /* The class-key is redundant for uses of the CLASS_TYPE that are
34373 neither definitions of it nor declarations, and for which name
34374 lookup returns just the type itself. */
34385 {
34386 /* Avoid issuing the diagnostic for apparently redundant struct
34387 and union class-keys in shared C/C++ code in files (such as
34388 headers) included in the main source file. */
34391 LRK_MACRO_DEFINITION_LOCATION,
34395 }
34397 /* Set if a declaration of TYPE has previously been seen or if it must
34398 exist in a precompiled header. */
34402 {
34405 {
34406 /* TYPE_DECL is the first declaration or definition of the type
34407 (outside precompiled headers -- see below). Just create
34408 a new entry for it and return unless it's a declaration
34409 involving a template that may need to be diagnosed by
34410 -Wredundant-tags. */
34414 }
34415 else
34416 {
34417 /* TYPE was previously defined in some unknown precompiled header.
34418 Simply add a record of its definition at an unknown location and
34419 proceed below to add a reference to it at the current location.
34420 (Declarations in precompiled headers that are not definitions
34421 are ignored.) */
34422 tag_types def_key
34427 }
34428 }
34430 /* A prior declaration of TYPE_DECL has been seen. */
34433 {
34440 type);
34441 }
34444 /* Do nothing if this is the first declaration of the type. */
34448 /* Do nothing if the class-key in this declaration matches
34449 the definition. */
34453 def_p);
34454 }
34456 /* Either adds this DECL corresponding to the TYPE_DECL to the collection
34457 of class decls or diagnoses it, whichever is appropriate. */
34459 void
34461 tag_types class_key,
34464 {
34465 /* Reset the CLASS_KEY associated with this type on mismatch.
34466 This is an optimization that lets the diagnostic code skip
34467 over classes that use the same class-key in all declarations. */
34471 /* Set IDXDEF to the index of the vector corresponding to
34472 the definition. */
34476 /* Append a record of this declaration to the vector. */
34478 redundant);
34484 /* As a space optimization diagnose declarations of a class
34485 whose definition has been seen and purge the LOCVEC of
34486 all entries except the definition. */
34489 {
34495 }
34496 else
34497 /* Pop the entry pushed above for this declaration. */
34499 }
34501 /* Issues -Wmismatched-tags for a single class. */
34503 void
34505 {
34509 /* Number of uses of the class. */
34512 /* The class (or template) declaration guiding the decisions about
34513 the diagnostic. For ordinary classes it's the same as THIS. For
34514 uses of instantiations of templates other than their declarations
34515 it points to the record for the declaration of the corresponding
34516 primary template or partial specialization. */
34521 {
34522 /* For implicit instantiations of a primary template look up
34523 the primary or partial specialization and use it as
34524 the expected class-key rather than using the class-key of
34525 the first reference to the instantiation. The primary must
34526 be (and inevitably is) at index zero. */
34529 /* It's possible that we didn't find SPEC. Consider:
34531 template<typename T> struct A {
34532 template<typename U> struct W { };
34533 };
34534 struct A<int>::W<int> w; // #1
34536 where while parsing A and #1 we've stashed
34537 A<T>
34538 A<T>::W<U>
34539 A<int>::W<int>
34540 into CLASS2LOC. If TYPE is A<int>::W<int>, specialization_of
34541 will yield A<int>::W<U> which may be in CLASS2LOC if we had
34542 an A<int> class specialization, but otherwise won't be in it.
34543 So try to look up A<T>::W<U>. */
34545 {
34548 }
34549 /* Now we really should have found something. */
34551 }
34552 /* Skip declarations that consistently use the same class-key. */
34556 /* Set if a definition for the class has been seen. */
34559 /* The index of the declaration whose class-key this declaration
34560 is expected to match. It's either the class-key of the class
34561 definition if one exists or the first declaration otherwise. */
34564 /* The class-key the class is expected to be declared with: it's
34565 either the key used in its definition or the first declaration
34566 if no definition has been provided.
34567 For implicit instantiations of a primary template it's
34568 the class-key used to declare the primary with. The primary
34569 must be at index zero. */
34573 /* Advance IDX to the first declaration that either is not
34574 a definition or that doesn't match the first declaration
34575 if no definition is provided. */
34580 /* Save the current function before changing it below. */
34582 /* Set the function declaration to print in diagnostic context. */
34590 auto_diagnostic_group d;
34591 /* Issue a warning for the first mismatched declaration.
34592 Avoid using "%#qT" since the class-key for the same type will
34593 be the same regardless of which one was used in the declaraion. */
34597 {
34598 /* Suggest how to avoid the warning for each instance since
34599 the guidance may be different depending on context. */
34601 (key_redundant_p
34604 xpectkstr);
34606 /* Also point to the first declaration or definition that guided
34607 the decision to issue the warning above. */
34609 (def_p
34613 }
34615 /* Issue warnings for the remaining inconsistent declarations. */
34617 {
34619 /* Skip over the declarations that match either the definition
34620 if one was provided or the first declaration. */
34626 /* Set the function declaration to print in diagnostic context. */
34631 /* Suggest how to avoid the warning for each instance since
34632 the guidance may be different depending on context. */
34634 (key_redundant_p
34637 xpectkstr);
34638 }
34640 /* Restore the current function in case it was replaced above. */
34642 }
34644 /* Issues -Wmismatched-tags for all classes. Called at the end
34645 of processing a translation unit, after declarations of all class
34646 types and their uses have been recorded. */
34648 void
34650 {
34651 /* CLASS2LOC should be empty if both -Wmismatched-tags and
34652 -Wredundant-tags are disabled. */
34654 || warn_redundant_tags
34657 /* Save the current function before changing on return. It should
34658 be null at this point. */
34662 {
34663 /* Iterate over the collected class/struct/template declarations. */
34666 {
34670 }
34671 }
34674 }
34676 /* Issue an error message if DECL is redeclared with different
34677 access than its original declaration [class.access.spec/3].
34678 This applies to nested classes, nested class templates and
34679 enumerations [class.mem/1]. */
34681 static void
34683 {
34694 }
34696 /* Look for the `template' keyword, as a syntactic disambiguator.
34697 Return TRUE iff it is present, in which case it will be
34698 consumed. */
34700 static bool
34702 {
34704 {
34705 /* In C++98 the `template' keyword can only be used within templates;
34706 outside templates the parser can always figure out what is a
34707 template and what is not. In C++11, per the resolution of DR 468,
34708 `template' is allowed in cases where it is not strictly necessary. */
34711 {
34714 "in C++98 %<template%> (as a disambiguator) is only "
34716 /* If this part of the token stream is rescanned, the same
34717 error message would be generated. So, we purge the token
34718 from the stream. */
34721 }
34722 else
34723 {
34724 /* Consume the `template' keyword. */
34727 }
34728 }
34730 }
34732 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
34733 set PARSER->SCOPE, and perform other related actions. */
34735 static void
34737 {
34740 /* Get the stored value. */
34742 /* Set the scope from the stored value. */
34747 }
34749 /* Consume tokens up through a non-nested END token. Returns TRUE if we
34750 encounter the end of a block before what we were looking for. */
34752 static bool
34756 {
34758 {
34761 /* Abort a parenthesized expression if we encounter a semicolon. */
34765 /* If we've reached the end of the file, stop. */
34771 /* We've hit the end of an enclosing block, so there's been some
34772 kind of syntax error. */
34775 /* Consume the token. */
34777 /* See if it starts a new group. */
34779 {
34781 /* In theory this should probably check end == '}', but
34782 cp_parser_save_member_function_body needs it to exit
34783 after either '}' or ')' when called with ')'. */
34786 }
34788 {
34792 }
34797 }
34798 }
34800 /* Like above, for caching a default argument or NSDMI. Both of these are
34801 terminated by a non-nested comma, but it can be unclear whether or not a
34802 comma is nested in a template argument list unless we do more parsing.
34803 In order to handle this ambiguity, when we encounter a ',' after a '<'
34804 we try to parse what follows as a parameter-declaration-list (in the
34805 case of a default argument) or a member-declarator (in the case of an
34806 NSDMI). If that succeeds, then we stop caching. */
34808 static tree
34810 {
34815 tree default_argument;
34817 /* Add tokens until we have processed the entire default
34818 argument. We add the range [first_token, token). */
34821 {
34822 /* For list-initialization, this is straightforward. */
34825 }
34827 {
34830 /* Peek at the next token. */
34832 /* What we do depends on what token we have. */
34834 {
34835 /* In valid code, a default argument must be
34836 immediately followed by a `,' `)', or `...'. */
34839 {
34840 /* If we've seen a '<', we might be in a
34841 template-argument-list. Until Core issue 325 is
34842 resolved, we don't know how this situation ought
34843 to be handled, so try to DTRT. We check whether
34844 what comes after the comma is a valid parameter
34845 declaration list. If it is, then the comma ends
34846 the default argument; otherwise the default
34847 argument continues. */
34851 /* Set ITALP so cp_parser_parameter_declaration_list
34852 doesn't decide to commit to this parse. */
34859 {
34860 /* Parse declarators until we reach a non-comma or
34861 somthing that cannot be an initializer.
34862 Just checking whether we're looking at a single
34863 declarator is insufficient. Consider:
34864 int var = tuple<T,U>::x;
34865 The template parameter 'U' looks exactly like a
34866 declarator. */
34867 do
34868 {
34872 CP_PARSER_FLAGS_NONE,
34881 }
34883 /* If we met an '=' or ';' then the original comma
34884 was the end of the NSDMI. Otherwise assume
34885 we're still in the NSDMI. */
34888 }
34889 else
34890 {
34893 tree t = cp_parser_parameter_declaration_list
34899 }
34906 }
34907 /* FALLTHRU */
34910 /* If we run into a non-nested `;', `}', or `]',
34911 then the code is invalid -- but the default
34912 argument is certainly over. */
34917 /* Handle correctly int n = sizeof ... ( p ); */
34920 /* Update DEPTH, if necessary. */
34935 /* This might be the comparison operator, or it might
34936 start a template argument list. */
34943 /* Fall through for C++0x, which treats the `>>'
34944 operator like two `>' tokens in certain
34945 cases. */
34950 {
34951 /* This might be an operator, or it might close a
34952 template argument list. But if a previous '<'
34953 started a template argument list, this will have
34954 closed it, so we can't be in one anymore. */
34958 }
34961 /* If we run out of tokens, issue an error message. */
34969 /* In these cases, we should look for template-ids.
34970 For example, if the default argument is
34971 `X<int, double>()', we need to do name lookup to
34972 figure out whether or not `X' is a template; if
34973 so, the `,' does not end the default argument.
34975 That is not yet done. */
34980 }
34982 /* If we've reached the end, stop. */
34986 /* Add the token to the token block. */
34988 }
34990 /* Create a DEFERRED_PARSE to represent the unparsed default
34991 argument. */
34998 }
35000 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
35002 location_t
35004 {
35009 }
35011 /* Begin parsing tentatively. We always save tokens while parsing
35012 tentatively so that if the tentative parsing fails we can restore the
35013 tokens. */
35015 static void
35017 {
35018 /* Enter a new parsing context. */
35020 /* Begin saving tokens. */
35022 /* In order to avoid repetitive access control error messages,
35023 access checks are queued up until we are no longer parsing
35024 tentatively. */
35026 }
35028 /* Commit to the currently active tentative parse. */
35030 static void
35032 {
35036 /* Mark all of the levels as committed. */
35039 {
35046 }
35047 }
35049 /* Commit to the topmost currently active tentative parse.
35051 Note that this function shouldn't be called when there are
35052 irreversible side-effects while in a tentative state. For
35053 example, we shouldn't create a permanent entry in the symbol
35054 table, or issue an error message that might not apply if the
35055 tentative parse is aborted. */
35057 static void
35059 {
35064 {
35072 }
35073 }
35075 /* Abort the currently active tentative parse. All consumed tokens
35076 will be rolled back, and no diagnostics will be issued. */
35078 static void
35080 {
35084 /* Now, pretend that we want to see if the construct was
35085 successfully parsed. */
35087 }
35089 /* Stop parsing tentatively. If a parse error has occurred, restore the
35090 token stream. Otherwise, commit to the tokens we have consumed.
35091 Returns true if no error occurred; false otherwise. */
35093 static bool
35095 {
35099 /* Remember whether or not an error occurred, since we are about to
35100 destroy that information. */
35102 /* Remove the topmost context from the stack. */
35105 /* If no parse errors occurred, commit to the tentative parse. */
35107 {
35108 /* Commit to the tokens read tentatively, unless that was
35109 already done. */
35114 }
35115 /* Otherwise, if errors occurred, roll back our state so that things
35116 are just as they were before we began the tentative parse. */
35117 else
35118 {
35121 }
35122 /* Add the context to the front of the free list. */
35127 }
35129 /* Returns true if we are parsing tentatively and are not committed to
35130 this tentative parse. */
35132 static bool
35134 {
35137 }
35139 /* Returns nonzero iff an error has occurred during the most recent
35140 tentative parse. */
35142 static bool
35144 {
35147 }
35149 /* Returns nonzero if GNU extensions are allowed. */
35151 static bool
35153 {
35155 }
35156 \f
35157 /* Objective-C++ Productions */
35160 /* Parse an Objective-C expression, which feeds into a primary-expression
35161 above.
35163 objc-expression:
35164 objc-message-expression
35165 objc-string-literal
35166 objc-encode-expression
35167 objc-protocol-expression
35168 objc-selector-expression
35170 Returns a tree representation of the expression. */
35172 static cp_expr
35174 {
35175 /* Try to figure out what kind of declaration is present. */
35179 {
35189 {
35201 }
35202 /* FALLTHRU */
35208 }
35211 }
35213 /* Parse an Objective-C message expression.
35215 objc-message-expression:
35216 [ objc-message-receiver objc-message-args ]
35218 Returns a representation of an Objective-C message. */
35220 static tree
35222 {
35235 /* Construct a location e.g.
35236 [self func1:5]
35237 ^~~~~~~~~~~~~~
35238 ranging from the '[' to the ']', with the caret at the start. */
35244 }
35246 /* Parse an objc-message-receiver.
35248 objc-message-receiver:
35249 expression
35250 simple-type-specifier
35252 Returns a representation of the type or expression. */
35254 static tree
35256 {
35257 tree rcv;
35259 /* An Objective-C message receiver may be either (1) a type
35260 or (2) an expression. */
35264 /* If that worked out, fine. */
35271 CP_PARSER_FLAGS_NONE);
35278 }
35280 /* Parse the arguments and selectors comprising an Objective-C message.
35282 objc-message-args:
35283 objc-selector
35284 objc-selector-args
35285 objc-selector-args , objc-comma-args
35287 objc-selector-args:
35288 objc-selector [opt] : assignment-expression
35289 objc-selector-args objc-selector [opt] : assignment-expression
35291 objc-comma-args:
35292 assignment-expression
35293 objc-comma-args , assignment-expression
35295 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
35296 selector arguments and TREE_VALUE containing a list of comma
35297 arguments. */
35299 static tree
35301 {
35307 {
35313 /* Detect if we have a unary selector. */
35322 sel_args
35327 }
35329 /* Handle non-selector arguments, if any. */
35331 {
35332 tree arg;
35337 addl_args
35342 }
35345 {
35348 }
35351 }
35353 /* Parse an Objective-C encode expression.
35355 objc-encode-expression:
35356 @encode objc-typename
35358 Returns an encoded representation of the type argument. */
35360 static cp_expr
35362 {
35363 tree type;
35368 matching_parens parens;
35375 {
35379 }
35381 /* This happens if we find @encode(T) (where T is a template
35382 typename or something dependent on a template typename) when
35383 parsing a template. In that case, we can't compile it
35384 immediately, but we rather create an AT_ENCODE_EXPR which will
35385 need to be instantiated when the template is used.
35386 */
35388 {
35392 }
35395 /* Build a location of the form:
35396 @encode(int)
35397 ^~~~~~~~~~~~
35398 with caret==start at the @ token, finishing at the close paren. */
35402 }
35404 /* Parse an Objective-C @defs expression. */
35406 static tree
35408 {
35409 tree name;
35412 matching_parens parens;
35418 }
35420 /* Parse an Objective-C protocol expression.
35422 objc-protocol-expression:
35423 @protocol ( identifier )
35425 Returns a representation of the protocol expression. */
35427 static tree
35429 {
35430 tree proto;
35434 matching_parens parens;
35439 /* Build a location of the form:
35440 @protocol(prot)
35441 ^~~~~~~~~~~~~~~
35442 with caret==start at the @ token, finishing at the close paren. */
35447 }
35449 /* Parse an Objective-C selector expression.
35451 objc-selector-expression:
35452 @selector ( objc-method-signature )
35454 objc-method-signature:
35455 objc-selector
35456 objc-selector-seq
35458 objc-selector-seq:
35459 objc-selector :
35460 objc-selector-seq objc-selector :
35462 Returns a representation of the method selector. */
35464 static tree
35466 {
35473 matching_parens parens;
35479 {
35488 {
35489 /* Detect if we have a unary selector. */
35491 {
35494 }
35495 else
35496 {
35498 }
35499 }
35504 {
35505 sel_seq
35508 sel_seq
35511 }
35512 else
35513 sel_seq
35518 }
35520 finish_selector:
35524 /* Build a location of the form:
35525 @selector(func)
35526 ^~~~~~~~~~~~~~~
35527 with caret==start at the @ token, finishing at the close paren. */
35530 /* TODO: objc_build_selector_expr doesn't always honor the location. */
35533 }
35535 /* Parse a list of identifiers.
35537 objc-identifier-list:
35538 identifier
35539 objc-identifier-list , identifier
35541 Returns a TREE_LIST of identifier nodes. */
35543 static tree
35545 {
35546 tree identifier;
35547 tree list;
35558 {
35565 identifier));
35567 }
35570 }
35572 /* Parse an Objective-C alias declaration.
35574 objc-alias-declaration:
35575 @compatibility_alias identifier identifier ;
35577 This function registers the alias mapping with the Objective-C front end.
35578 It returns nothing. */
35580 static void
35582 {
35590 }
35592 /* Parse an Objective-C class forward-declaration.
35594 objc-class-declaration:
35595 @class objc-identifier-list ;
35597 The function registers the forward declarations with the Objective-C
35598 front end. It returns nothing. */
35600 static void
35602 {
35605 {
35606 tree id;
35616 else
35618 }
35620 }
35622 /* Parse a list of Objective-C protocol references.
35624 objc-protocol-refs-opt:
35625 objc-protocol-refs [opt]
35627 objc-protocol-refs:
35628 < objc-identifier-list >
35630 Returns a TREE_LIST of identifiers, if any. */
35632 static tree
35634 {
35638 {
35642 }
35645 }
35647 /* Parse a Objective-C visibility specification. */
35649 static void
35651 {
35655 {
35670 }
35672 /* Eat '@private'/'@protected'/'@public'. */
35674 }
35676 /* Parse an Objective-C method type. Return 'true' if it is a class
35677 (+) method, and 'false' if it is an instance (-) method. */
35681 {
35684 else
35686 }
35688 /* Parse an Objective-C protocol qualifier. */
35690 static tree
35692 {
35705 {
35710 }
35713 }
35715 /* Parse an Objective-C typename. */
35717 static tree
35719 {
35723 {
35726 matching_parens parens;
35730 /* An ObjC type name may consist of just protocol qualifiers, in which
35731 case the type shall default to 'id'. */
35733 {
35736 /* If the type could not be parsed, an error has already
35737 been produced. For error recovery, behave as if it had
35738 not been specified, which will use the default type
35739 'id'. */
35741 {
35743 /* We need to skip to the closing parenthesis as
35744 cp_parser_type_id() does not seem to do it for
35745 us. */
35750 }
35751 }
35755 }
35758 }
35760 /* Check to see if TYPE refers to an Objective-C selector name. */
35762 static bool
35764 {
35770 }
35772 /* Parse an Objective-C selector. */
35774 static tree
35776 {
35780 {
35783 }
35785 /* C++ operator names are allowed to appear in ObjC selectors. */
35787 {
35800 }
35801 }
35803 /* Parse an Objective-C params list. */
35805 static tree
35807 {
35813 {
35823 /* Detect if we have a unary selector. */
35826 {
35829 }
35833 {
35834 /* Something went quite wrong. There should be a colon
35835 here, but there is not. Stop parsing parameters. */
35837 }
35839 /* New ObjC allows attributes on parameters too. */
35844 params
35847 type_name,
35848 identifier,
35849 parm_attr));
35852 }
35855 {
35858 }
35860 /* We allow tail attributes for the method. */
35862 {
35870 }
35873 {
35876 }
35878 }
35880 /* Parse the non-keyword Objective-C params. */
35882 static tree
35885 {
35891 {
35893 tree parm;
35899 {
35904 }
35906 /* TODO: parse attributes for tail parameters. */
35916 }
35918 /* We allow tail attributes for the method. */
35920 {
35922 {
35927 }
35928 else
35929 /* We have an error, but parse the attributes, so that we can
35930 carry on. */
35936 }
35939 }
35941 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
35943 static void
35945 {
35948 /* If the next token is `extern' and the following token is a string
35949 literal, then we have a linkage specification. */
35951 && cp_parser_is_pure_string_literal
35954 /* Handle #pragma, if any. */
35957 /* Allow stray semicolons. */
35960 /* Mark methods as optional or required, when building protocols. */
35962 {
35965 }
35967 {
35970 }
35973 /* Other stray characters must generate errors. */
35975 {
35979 }
35980 /* Finally, try to parse a block-declaration, or a function-definition. */
35981 else
35983 }
35985 /* Parse a method signature. */
35987 static tree
35989 {
36005 }
36007 static bool
36009 {
36010 tree tattr;
36015 /* If the attributes are followed by a method introducer, this is not allowed.
36016 Dump the attributes and flag the situation. */
36021 /* Otherwise, the attributes introduce some interstitial code, possibly so
36022 rewind to allow that check. */
36025 }
36027 /* Parse an Objective-C method prototype list. */
36029 static void
36031 {
36035 {
36037 {
36042 else
36046 {
36050 }
36053 }
36059 OPT_Wattributes,
36061 else
36062 /* Allow for interspersed non-ObjC++ code. */
36066 }
36070 else
36074 }
36076 /* Parse an Objective-C method definition list. */
36078 static void
36080 {
36082 {
36086 {
36089 }
36091 {
36094 }
36096 {
36100 tree attribute;
36104 else
36105 {
36109 /* For historical reasons, we accept an optional semicolon. */
36115 tree meth
36119 }
36120 }
36121 /* The following case will be removed once @synthesize is
36122 completely implemented. */
36133 else
36134 /* Allow for interspersed non-ObjC++ code. */
36136 }
36139 }
36141 /* Parse Objective-C ivars. */
36143 static void
36145 {
36156 {
36157 cp_decl_specifier_seq declspecs;
36159 tree prefix_attributes;
36167 CP_PARSER_FLAGS_OPTIONAL,
36171 /* auto, register, static, extern, mutable. */
36173 {
36176 }
36178 /* thread_local. */
36180 {
36183 }
36185 /* typedef. */
36187 {
36190 }
36195 /* Keep going until we hit the `;' at the end of the
36196 declaration. */
36198 {
36203 /* Check for a (possibly unnamed) bitfield declaration. */
36211 {
36212 /* Get the name of the bitfield. */
36217 eat_colon:
36219 /* Get the width of the bitfield. */
36220 width
36222 }
36223 else
36224 {
36225 /* Parse the declarator. */
36226 declarator
36228 CP_PARSER_FLAGS_NONE,
36234 }
36236 /* Look for attributes that apply to the ivar. */
36238 /* Remember which attributes are prefix attributes and
36239 which are not. */
36241 /* Combine the attributes. */
36245 /* Create the bitfield declaration. */
36248 else
36253 /* Add the instance variable. */
36257 /* Reset PREFIX_ATTRIBUTES. */
36259 {
36264 }
36269 {
36272 }
36274 }
36278 }
36283 /* Do not consume the RID_AT_END, so it will be read again as terminating
36284 the @interface of @implementation. */
36288 /* For historical reasons, we accept an optional semicolon. */
36291 }
36293 /* Parse an Objective-C protocol declaration. */
36295 static void
36297 {
36303 {
36308 }
36310 /* See if we have a forward declaration or a definition. */
36313 /* Try a forward declaration first. */
36315 {
36317 {
36318 tree id;
36328 else
36330 }
36332 }
36334 /* Ok, we got a full-fledged definition (or at least should). */
36335 else
36336 {
36341 }
36342 }
36344 /* Parse an Objective-C superclass or category. */
36346 static void
36351 {
36357 {
36360 }
36362 {
36363 matching_parens parens;
36366 /* If there is no category name, and this is an @interface, we
36367 have a class extension. */
36369 {
36372 }
36373 else
36377 }
36378 }
36380 /* Parse an Objective-C class interface. */
36382 static void
36384 {
36392 {
36393 /* It's hard to recover because even if valid @interface stuff
36394 is to follow, we can't compile it (or validate it) if we
36395 don't even know which class it refers to. Let's assume this
36396 was a stray '@interface' token in the stream and skip it.
36397 */
36399 }
36404 /* We have either a class or a category on our hands. */
36407 else
36408 {
36410 /* Handle instance variable declarations, if any. */
36413 }
36416 }
36418 /* Parse an Objective-C class implementation. */
36420 static void
36422 {
36429 {
36430 /* It's hard to recover because even if valid @implementation
36431 stuff is to follow, we can't compile it (or validate it) if
36432 we don't even know which class it refers to. Let's assume
36433 this was a stray '@implementation' token in the stream and
36434 skip it.
36435 */
36437 }
36441 /* We have either a class or a category on our hands. */
36444 else
36445 {
36447 /* Handle instance variable declarations, if any. */
36450 }
36453 }
36455 /* Consume the @end token and finish off the implementation. */
36457 static void
36459 {
36462 }
36464 /* Parse an Objective-C declaration. */
36466 static void
36468 {
36469 /* Try to figure out what kind of declaration is present. */
36474 {
36490 }
36493 {
36516 }
36517 }
36519 /* Parse an Objective-C try-catch-finally statement.
36521 objc-try-catch-finally-stmt:
36522 @try compound-statement objc-catch-clause-seq [opt]
36523 objc-finally-clause [opt]
36525 objc-catch-clause-seq:
36526 objc-catch-clause objc-catch-clause-seq [opt]
36528 objc-catch-clause:
36529 @catch ( objc-exception-declaration ) compound-statement
36531 objc-finally-clause:
36532 @finally compound-statement
36534 objc-exception-declaration:
36535 parameter-declaration
36536 '...'
36538 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
36540 Returns NULL_TREE.
36542 PS: This function is identical to c_parser_objc_try_catch_finally_statement
36543 for C. Keep them in sync. */
36545 static tree
36547 {
36548 location_t location;
36549 tree stmt;
36554 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
36555 node, lest it get absorbed into the surrounding block. */
36561 {
36565 matching_parens parens;
36571 {
36572 /* We have "@catch (...)" (where the '...' are literally
36573 what is in the code). Skip the '...'.
36574 parameter_declaration is set to NULL_TREE, and
36575 objc_being_catch_clauses() knows that that means
36576 '...'. */
36579 }
36580 else
36581 {
36582 /* We have "@catch (NSException *exception)" or something
36583 like that. Parse the parameter declaration. */
36588 else
36593 }
36596 else
36597 {
36598 /* If there was no open parenthesis, we are recovering from
36599 an error, and we are trying to figure out what mistake
36600 the user has made. */
36602 /* If there is an immediate closing parenthesis, the user
36603 probably forgot the opening one (ie, they typed "@catch
36604 NSException *e)". Parse the closing parenthesis and keep
36605 going. */
36609 /* If these is no immediate closing parenthesis, the user
36610 probably doesn't know that parenthesis are required at
36611 all (ie, they typed "@catch NSException *e"). So, just
36612 forget about the closing parenthesis and keep going. */
36613 }
36617 }
36619 {
36622 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
36623 node, lest it get absorbed into the surrounding block. */
36627 }
36630 }
36632 /* Parse an Objective-C synchronized statement.
36634 objc-synchronized-stmt:
36635 @synchronized ( expression ) compound-statement
36637 Returns NULL_TREE. */
36639 static tree
36641 {
36642 location_t location;
36649 matching_parens parens;
36654 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
36655 node, lest it get absorbed into the surrounding block. */
36660 }
36662 /* Parse an Objective-C throw statement.
36664 objc-throw-stmt:
36665 @throw assignment-expression [opt] ;
36667 Returns a constructed '@throw' statement. */
36669 static tree
36671 {
36683 }
36685 /* Parse an Objective-C statement. */
36687 static tree
36689 {
36690 /* Try to figure out what kind of declaration is present. */
36694 {
36705 }
36708 }
36710 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
36711 look ahead to see if an objc keyword follows the attributes. This
36712 is to detect the use of prefix attributes on ObjC @interface and
36713 @protocol. */
36715 static bool
36717 {
36722 {
36726 else
36729 }
36732 }
36734 /* This routine is a minimal replacement for
36735 c_parser_struct_declaration () used when parsing the list of
36736 types/names or ObjC++ properties. For example, when parsing the
36737 code
36739 @property (readonly) int a, b, c;
36741 this function is responsible for parsing "int a, int b, int c" and
36742 returning the declarations as CHAIN of DECLs.
36744 TODO: Share this code with cp_parser_objc_class_ivars. It's very
36745 similar parsing. */
36746 static tree
36748 {
36750 cp_decl_specifier_seq declspecs;
36752 tree prefix_attributes;
36755 CP_PARSER_FLAGS_NONE,
36762 /* auto, register, static, extern, mutable. */
36764 {
36767 }
36769 /* thread_local. */
36771 {
36774 }
36776 /* typedef. */
36778 {
36781 }
36786 /* Keep going until we hit the `;' at the end of the declaration. */
36788 {
36793 /* Parse the declarator. */
36795 CP_PARSER_FLAGS_NONE,
36798 /* Look for attributes that apply to the ivar. */
36800 /* Remember which attributes are prefix attributes and
36801 which are not. */
36803 /* Combine the attributes. */
36813 /* Reset PREFIX_ATTRIBUTES. */
36815 {
36820 }
36827 {
36830 }
36831 else
36833 }
36835 }
36837 /* Parse an Objective-C @property declaration. The syntax is:
36839 objc-property-declaration:
36840 '@property' objc-property-attributes[opt] struct-declaration ;
36842 objc-property-attributes:
36843 '(' objc-property-attribute-list ')'
36845 objc-property-attribute-list:
36846 objc-property-attribute
36847 objc-property-attribute-list, objc-property-attribute
36849 objc-property-attribute
36850 'getter' = identifier
36851 'setter' = identifier
36852 'readonly'
36853 'readwrite'
36854 'assign'
36855 'retain'
36856 'copy'
36857 'nonatomic'
36859 For example:
36860 @property NSString *name;
36861 @property (readonly) id object;
36862 @property (retain, nonatomic, getter=getTheName) id name;
36863 @property int a, b, c;
36865 PS: This function is identical to
36866 c_parser_objc_at_property_declaration for C. Keep them in sync. */
36867 static void
36869 {
36870 /* Parse the optional attribute list.
36872 A list of parsed, but not verified, attributes. */
36878 /* Parse the optional attribute list... */
36880 {
36881 /* Eat the '('. */
36882 matching_parens parens;
36887 /* Allow empty @property attribute lists, but with a warning. */
36889 location_t attr_comb;
36891 {
36895 }
36896 else
36898 {
36905 {
36912 }
36923 /* Account for accepting the 'class' keyword in this context. */
36925 else
36929 enum objc_property_attribute_kind prop_kind
36931 property_attribute_info *prop
36935 tree meth_name;
36937 {
36942 attr_name);
36943 else
36951 {
36954 attr_name);
36957 }
36965 {
36968 attr_name);
36971 }
36973 /* Get the end of the method name, and consume the name. */
36976 /* Because method names may contain C++ keywords, we have a
36977 routine to fetch them (this also consumes the token). */
36981 {
36983 {
36985 attr_end);
36989 }
36990 else
36991 {
36995 }
36997 attr_end);
36998 }
36999 else
37001 attr_end);
37003 /* Updated location including all that was successfully
37004 parsed. */
37007 }
37009 /* If we see a comma here, then keep going - even if we already
37010 saw a syntax error. For simple mistakes e.g. (asign, getter=x)
37011 this makes a more useful output and avoid spurious warnings
37012 about missing attributes that are, in fact, specified after the
37013 one with the syntax error. */
37016 else
37018 }
37024 }
37026 /* 'properties' is the list of properties that we read. Usually a
37027 single one, but maybe more (eg, in "@property int a, b, c;" there
37028 are three).
37029 TODO: Update this parsing so that it accepts (erroneous) bitfields so
37030 that we can issue a meaningful and consistent (between C/C++) error
37031 message from objc_add_property_declaration (). */
37038 else
37039 {
37040 /* Comma-separated properties are chained together in reverse order;
37041 add them one by one. */
37045 prop_attr_list);
37046 }
37049 }
37051 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
37053 objc-synthesize-declaration:
37054 @synthesize objc-synthesize-identifier-list ;
37056 objc-synthesize-identifier-list:
37057 objc-synthesize-identifier
37058 objc-synthesize-identifier-list, objc-synthesize-identifier
37060 objc-synthesize-identifier
37061 identifier
37062 identifier = identifier
37064 For example:
37065 @synthesize MyProperty;
37066 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
37068 PS: This function is identical to c_parser_objc_at_synthesize_declaration
37069 for C. Keep them in sync.
37070 */
37071 static void
37073 {
37075 location_t loc;
37080 {
37084 {
37087 }
37089 {
37093 {
37096 }
37097 }
37098 else
37103 else
37105 }
37108 }
37110 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
37112 objc-dynamic-declaration:
37113 @dynamic identifier-list ;
37115 For example:
37116 @dynamic MyProperty;
37117 @dynamic MyProperty, AnotherProperty;
37119 PS: This function is identical to c_parser_objc_at_dynamic_declaration
37120 for C. Keep them in sync.
37121 */
37122 static void
37124 {
37126 location_t loc;
37131 {
37132 tree property;
37135 {
37138 }
37142 else
37144 }
37147 }
37149 \f
37150 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
37152 /* Returns name of the next clause.
37153 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
37154 the token is not consumed. Otherwise appropriate pragma_omp_clause is
37155 returned and the token is consumed. */
37157 static pragma_omp_clause
37159 {
37175 {
37180 {
37399 }
37400 }
37406 }
37408 /* Validate that a clause of the given type does not already exist. */
37410 static void
37413 {
37416 }
37418 /* OpenMP 2.5:
37419 variable-list:
37420 identifier
37421 variable-list , identifier
37423 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
37424 colon). An opening parenthesis will have been consumed by the caller.
37426 If KIND is nonzero, create the appropriate node and install the decl
37427 in OMP_CLAUSE_DECL and add the node to the head of the list.
37429 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
37430 return the list created.
37432 COLON can be NULL if only closing parenthesis should end the list,
37433 or pointer to bool which will receive false if the list is terminated
37434 by closing parenthesis or true if the list is terminated by colon.
37436 The optional ALLOW_DEREF argument is true if list items can use the deref
37437 (->) operator. */
37439 struct omp_dim
37440 {
37442 location_t loc;
37446 };
37448 static tree
37452 {
37458 {
37461 }
37463 {
37471 {
37477 }
37481 {
37482 cp_id_kind idk;
37485 }
37490 CPP_CLOSE_PAREN)))
37491 {
37494 }
37495 else
37496 {
37503 {
37508 }
37512 else
37515 {
37521 }
37522 }
37526 ;
37528 {
37530 {
37532 /* The OpenACC cache directive explicitly only allows "array
37533 elements or subarrays". */
37535 {
37539 }
37540 /* FALLTHROUGH. */
37544 start_component_ref:
37546 || (allow_deref
37548 {
37549 cpp_ttype ttype
37552 location_t loc
37557 decl = (cp_parser_postfix_dot_deref_expression
37560 }
37561 /* FALLTHROUGH. */
37571 {
37579 {
37582 /* Later handling is not prepared to see through these. */
37584 }
37586 parser->colon_corrects_to_scope_p
37589 {
37592 }
37593 else
37594 {
37595 /* Look for `:'. */
37597 {
37602 }
37605 else
37608 CPP_CLOSE_SQUARE))
37609 {
37611 /* Later handling is not prepared to see through these. */
37613 }
37614 }
37615 /* Look for the closing `]'. */
37617 RT_CLOSE_SQUARE))
37618 {
37623 }
37626 }
37631 && !array_section_p
37633 || (allow_deref
37635 CPP_DEREF))))
37636 {
37638 {
37642 }
37644 }
37645 else
37652 }
37655 {
37659 {
37660 depend_lvalue:
37664 }
37665 else
37667 }
37673 }
37674 else
37677 get_comma:
37681 }
37687 {
37691 }
37694 {
37697 /* Try to resync to an unnested comma. Copied from
37698 cp_parser_parenthesized_expression_list. */
37699 skip_comma:
37708 }
37711 }
37713 /* Similarly, but expect leading and trailing parenthesis. This is a very
37714 common case for omp clauses. */
37716 static tree
37719 {
37722 allow_deref);
37724 }
37726 /* OpenACC 2.0:
37727 copy ( variable-list )
37728 copyin ( variable-list )
37729 copyout ( variable-list )
37730 create ( variable-list )
37731 delete ( variable-list )
37732 present ( variable-list )
37734 OpenACC 2.6:
37735 no_create ( variable-list )
37736 attach ( variable-list )
37737 detach ( variable-list ) */
37739 static tree
37741 tree list)
37742 {
37745 {
37787 }
37795 }
37797 /* OpenACC 2.0:
37798 deviceptr ( variable-list ) */
37800 static tree
37802 {
37806 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
37807 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
37808 variable-list must only allow for pointer variables. */
37811 {
37818 }
37821 }
37823 /* OpenACC 2.5:
37824 auto
37825 finalize
37826 independent
37827 nohost
37828 seq */
37830 static tree
37832 tree list)
37833 {
37840 }
37842 /* OpenACC:
37843 num_gangs ( expression )
37844 num_workers ( expression )
37845 vector_length ( expression ) */
37847 static tree
37850 {
37853 matching_parens parens;
37861 {
37866 }
37874 }
37876 /* OpenACC:
37878 gang [( gang-arg-list )]
37879 worker [( [num:] int-expr )]
37880 vector [( [length:] int-expr )]
37882 where gang-arg is one of:
37884 [num:] int-expr
37885 static: size-expr
37887 and size-expr may be:
37889 *
37890 int-expr
37891 */
37893 static tree
37895 omp_clause_code kind,
37897 {
37906 {
37907 matching_parens parens;
37910 do
37911 {
37915 /* Gang static argument. */
37918 {
37926 {
37929 }
37931 /* Check for the '*' argument. */
37935 CPP_CLOSE_PAREN)))
37936 {
37941 {
37944 }
37946 }
37947 }
37948 /* Worker num: argument and vector length: arguments. */
37952 {
37955 }
37957 /* Now collect the actual argument. */
37959 {
37962 }
37974 {
37977 }
37979 }
37984 }
37998 cleanup_error:
38001 }
38003 /* OpenACC 2.0:
38004 tile ( size-expr-list ) */
38006 static tree
38008 {
38012 /* Collapse and tile are mutually exclusive. (The spec doesn't say
38013 so, but the spec authors never considered such a case and have
38014 differing opinions on what it might mean, including 'not
38015 allowed'.) */
38018 clause_loc);
38023 do
38024 {
38031 {
38034 }
38035 else
38039 }
38042 /* Consume the trailing ')'. */
38050 }
38052 /* OpenACC 2.0
38053 Parse wait clause or directive parameters. */
38055 static tree
38057 {
38067 {
38069 {
38072 }
38074 }
38081 {
38085 {
38088 else
38089 {
38096 }
38097 }
38098 }
38101 }
38103 /* OpenACC:
38104 wait [( int-expr-list )] */
38106 static tree
38108 {
38113 else
38114 {
38120 }
38123 }
38125 /* OpenMP 3.0:
38126 collapse ( constant-expression ) */
38128 static tree
38130 {
38132 location_t loc;
38133 HOST_WIDE_INT n;
38136 matching_parens parens;
38154 {
38157 }
38166 }
38168 /* OpenMP 2.5:
38169 default ( none | shared )
38171 OpenMP 5.1:
38172 default ( private | firstprivate )
38174 OpenACC:
38175 default ( none | present ) */
38177 static tree
38180 {
38182 tree c;
38184 matching_parens parens;
38188 {
38191 }
38193 {
38198 {
38225 }
38228 }
38229 else
38230 {
38231 invalid_kind:
38234 else
38237 }
38254 }
38256 /* OpenMP 3.1:
38257 final ( expression ) */
38259 static tree
38261 {
38264 matching_parens parens;
38283 }
38285 /* OpenMP 2.5:
38286 if ( expression )
38288 OpenMP 4.5:
38289 if ( directive-name-modifier : expression )
38291 directive-name-modifier:
38292 parallel | task | taskloop | target data | target | target update
38293 | target enter data | target exit data
38295 OpenMP 5.0:
38296 directive-name-modifier:
38297 ... | simd | cancel */
38299 static tree
38302 {
38306 matching_parens parens;
38311 {
38327 {
38330 {
38343 else
38344 {
38345 location_t loc
38350 }
38353 {
38355 {
38360 }
38362 {
38363 location_t loc
38367 }
38368 }
38369 }
38370 }
38372 {
38374 {
38377 }
38378 else
38379 {
38381 {
38382 location_t loc
38385 }
38387 }
38388 }
38389 }
38401 {
38404 {
38407 {
38419 }
38421 p);
38423 }
38425 {
38428 else
38431 }
38434 {
38438 }
38439 }
38447 }
38449 /* OpenMP 3.1:
38450 mergeable */
38452 static tree
38455 {
38456 tree c;
38459 location);
38464 }
38466 /* OpenMP 2.5:
38467 nowait */
38469 static tree
38472 {
38473 tree c;
38480 }
38482 /* OpenMP 2.5:
38483 num_threads ( expression ) */
38485 static tree
38487 location_t location)
38488 {
38491 matching_parens parens;
38511 }
38513 /* OpenMP 4.5:
38514 num_tasks ( expression )
38516 OpenMP 5.1:
38517 num_tasks ( strict : expression ) */
38519 static tree
38521 location_t location)
38522 {
38525 matching_parens parens;
38532 {
38535 {
38539 }
38540 }
38559 }
38561 /* OpenMP 4.5:
38562 grainsize ( expression )
38564 OpenMP 5.1:
38565 grainsize ( strict : expression ) */
38567 static tree
38569 location_t location)
38570 {
38573 matching_parens parens;
38580 {
38583 {
38587 }
38588 }
38607 }
38609 /* OpenMP 4.5:
38610 priority ( expression ) */
38612 static tree
38614 location_t location)
38615 {
38618 matching_parens parens;
38638 }
38640 /* OpenMP 4.5:
38641 hint ( expression ) */
38643 static tree
38645 {
38648 matching_parens parens;
38655 {
38663 }
38676 }
38678 /* OpenMP 5.1:
38679 filter ( integer-expression ) */
38681 static tree
38683 {
38686 matching_parens parens;
38704 }
38706 /* OpenMP 4.5:
38707 defaultmap ( tofrom : scalar )
38709 OpenMP 5.0:
38710 defaultmap ( implicit-behavior [ : variable-category ] ) */
38712 static tree
38714 location_t location)
38715 {
38719 enum omp_clause_defaultmap_kind category
38722 matching_parens parens;
38729 {
38730 invalid_behavior:
38732 "%<tofrom%>, %<firstprivate%>, %<none%> "
38735 }
38736 else
38737 {
38740 }
38743 {
38747 else
38754 else
38763 else
38770 else
38779 else
38785 }
38789 {
38794 {
38795 invalid_category:
38799 }
38804 {
38808 else
38815 else
38822 else
38828 }
38831 }
38841 {
38848 {
38863 }
38866 p);
38867 else
38871 }
38878 out_err:
38883 }
38885 /* OpenMP 5.0:
38886 order ( concurrent )
38888 OpenMP 5.1:
38889 order ( order-modifier : concurrent )
38891 order-modifier:
38892 reproducible
38893 unconstrained */
38895 static tree
38897 {
38903 matching_parens parens;
38909 {
38916 else
38917 {
38921 }
38924 }
38926 {
38929 }
38930 else
38931 {
38934 }
38936 {
38939 }
38951 out_err:
38956 }
38958 /* OpenMP 5.0:
38959 bind ( teams | parallel | thread ) */
38961 static tree
38963 location_t location)
38964 {
38965 tree c;
38969 matching_parens parens;
38974 {
38975 invalid:
38979 }
38980 else
38981 {
38984 }
38995 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
39001 out_err:
39006 }
39008 /* OpenMP 2.5:
39009 ordered
39011 OpenMP 4.5:
39012 ordered ( constant-expression ) */
39014 static tree
39017 {
39019 HOST_WIDE_INT n;
39025 {
39026 matching_parens parens;
39043 {
39045 "ordered argument needs positive constant integer "
39048 }
39049 }
39055 }
39057 /* OpenMP 2.5:
39058 reduction ( reduction-operator : variable-list )
39060 reduction-operator:
39061 One of: + * - & ^ | && ||
39063 OpenMP 3.1:
39065 reduction-operator:
39066 One of: + * - & ^ | && || min max
39068 OpenMP 4.0:
39070 reduction-operator:
39071 One of: + * - & ^ | && ||
39072 id-expression
39074 OpenMP 5.0:
39075 reduction ( reduction-modifier, reduction-operator : variable-list )
39076 in_reduction ( reduction-operator : variable-list )
39077 task_reduction ( reduction-operator : variable-list ) */
39079 static tree
39082 {
39092 {
39095 {
39098 }
39101 {
39109 {
39112 }
39113 }
39114 }
39117 {
39127 }
39131 else
39132 {
39143 {
39173 }
39174 else
39175 {
39177 resync_fail:
39182 }
39183 }
39189 NULL);
39191 {
39198 }
39201 }
39203 /* OpenMP 2.5:
39204 schedule ( schedule-kind )
39205 schedule ( schedule-kind , expression )
39207 schedule-kind:
39208 static | dynamic | guided | runtime | auto
39210 OpenMP 4.5:
39211 schedule ( schedule-modifier : schedule-kind )
39212 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
39214 schedule-modifier:
39215 simd
39216 monotonic
39217 nonmonotonic */
39219 static tree
39221 {
39225 matching_parens parens;
39233 {
39242 else
39248 {
39251 }
39252 else
39253 {
39256 }
39257 }
39262 {
39267 {
39288 }
39289 }
39294 else
39300 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
39302 {
39306 }
39309 {
39324 else
39329 }
39341 invalid_kind:
39343 resync_fail:
39348 }
39350 /* OpenMP 3.0:
39351 untied */
39353 static tree
39356 {
39357 tree c;
39364 }
39366 /* OpenMP 4.0:
39367 inbranch
39368 notinbranch */
39370 static tree
39373 {
39378 }
39380 /* OpenMP 4.0:
39381 parallel
39382 for
39383 sections
39384 taskgroup */
39386 static tree
39390 {
39394 }
39396 /* OpenMP 4.5:
39397 nogroup */
39399 static tree
39402 {
39407 }
39409 /* OpenMP 4.5:
39410 simd
39411 threads */
39413 static tree
39417 {
39422 }
39424 /* OpenMP 4.0:
39425 num_teams ( expression )
39427 OpenMP 5.1:
39428 num_teams ( expression : expression ) */
39430 static tree
39432 location_t location)
39433 {
39436 matching_parens parens;
39447 {
39451 }
39468 }
39470 /* OpenMP 4.0:
39471 thread_limit ( expression ) */
39473 static tree
39475 location_t location)
39476 {
39479 matching_parens parens;
39499 }
39501 /* OpenMP 4.0:
39502 aligned ( variable-list )
39503 aligned ( variable-list : constant-expression ) */
39505 static tree
39507 {
39511 matching_parens parens;
39519 {
39529 }
39535 }
39537 /* OpenMP 5.0:
39538 allocate ( variable-list )
39539 allocate ( expression : variable-list )
39541 OpenMP 5.1:
39542 allocate ( allocator-modifier : variable-list )
39543 allocate ( allocator-modifier , allocator-modifier : variable-list )
39545 allocator-modifier:
39546 allocator ( expression )
39547 align ( expression ) */
39549 static tree
39551 {
39555 matching_parens parens;
39565 {
39571 matching_parens parens2;
39575 {
39579 }
39580 else
39581 {
39585 }
39589 {
39592 }
39596 }
39597 else
39600 {
39606 }
39609 {
39616 }
39617 else
39618 {
39622 }
39629 {
39632 }
39635 }
39637 /* OpenMP 2.5:
39638 lastprivate ( variable-list )
39640 OpenMP 5.0:
39641 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
39643 static tree
39645 {
39653 {
39658 {
39662 }
39663 }
39672 }
39674 /* OpenMP 4.0:
39675 linear ( variable-list )
39676 linear ( variable-list : expression )
39678 OpenMP 4.5:
39679 linear ( modifier ( variable-list ) )
39680 linear ( modifier ( variable-list ) : expression )
39682 modifier:
39683 val
39684 ref
39685 uval
39687 OpenMP 5.2:
39688 linear ( variable-list : modifiers-list )
39690 modifiers:
39691 val
39692 ref
39693 uval
39694 step ( expression ) */
39696 static tree
39699 {
39705 matching_parens parens;
39710 {
39721 {
39724 }
39725 else
39727 }
39732 else
39733 {
39742 }
39745 {
39749 {
39759 {
39763 }
39767 CPP_CLOSE_PAREN)))
39769 }
39773 {
39775 {
39786 {
39792 }
39794 {
39795 location_t step_loc
39798 matching_parens parens2;
39800 {
39806 CPP_CLOSE_PAREN))
39807 {
39808 cp_token *token
39816 tok_loc);
39818 {
39821 }
39824 }
39830 }
39831 else
39833 }
39834 else
39837 {
39840 }
39842 }
39845 }
39849 {
39860 {
39863 }
39866 }
39877 }
39880 {
39884 }
39887 }
39889 /* OpenMP 4.0:
39890 safelen ( constant-expression ) */
39892 static tree
39894 location_t location)
39895 {
39898 matching_parens parens;
39917 }
39919 /* OpenMP 4.0:
39920 simdlen ( constant-expression ) */
39922 static tree
39924 location_t location)
39925 {
39928 matching_parens parens;
39947 }
39949 /* OpenMP 4.5:
39950 vec:
39951 identifier [+/- integer]
39952 vec , identifier [+/- integer]
39953 */
39955 static tree
39958 {
39962 {
39965 }
39968 {
39974 {
39977 {
39985 }
39986 }
39987 }
39990 {
39997 else
39998 {
39999 t = cp_parser_lookup_name_simple
40004 id_loc);
40005 }
40011 {
40014 }
40018 {
40021 }
40025 {
40028 }
40031 add_to_vector:
40033 {
40037 }
40044 }
40047 {
40054 }
40056 }
40058 /* OpenMP 5.0:
40059 detach ( event-handle ) */
40061 static tree
40063 {
40064 matching_parens parens;
40080 else
40081 {
40084 else
40089 }
40102 }
40104 /* OpenMP 5.0:
40105 iterators ( iterators-definition )
40107 iterators-definition:
40108 iterator-specifier
40109 iterator-specifier , iterators-definition
40111 iterator-specifier:
40112 identifier = range-specification
40113 iterator-type identifier = range-specification
40115 range-specification:
40116 begin : end
40117 begin : end : step */
40119 static tree
40121 {
40125 matching_parens parens;
40129 bool saved_colon_corrects_to_scope_p
40131 bool saved_colon_doesnt_start_class_def_p
40134 do
40135 {
40136 tree iter_type;
40140 else
40141 {
40144 parser->type_definition_forbidden_message
40150 }
40154 {
40157 }
40177 {
40180 }
40195 {
40198 }
40200 }
40204 parser->colon_doesnt_start_class_def_p
40214 }
40216 /* OpenMP 5.0:
40217 affinity ( [aff-modifier :] variable-list )
40218 aff-modifier:
40219 iterator ( iterators-definition ) */
40221 static tree
40223 {
40226 matching_parens parens;
40231 {
40236 CPP_OPEN_PAREN)));
40238 {
40241 }
40243 {
40247 {
40255 }
40256 }
40257 }
40261 {
40264 {
40269 }
40270 }
40272 }
40274 /* OpenMP 4.0:
40275 depend ( depend-kind : variable-list )
40277 depend-kind:
40278 in | out | inout
40280 OpenMP 4.5:
40281 depend ( source )
40283 depend ( sink : vec )
40285 OpenMP 5.0:
40286 depend ( depend-modifier , depend-kind: variable-list )
40288 depend-kind:
40289 in | out | inout | mutexinoutset | depobj
40291 depend-modifier:
40292 iterator ( iterators-definition ) */
40294 static tree
40296 {
40301 matching_parens parens;
40305 do
40306 {
40314 {
40319 }
40336 else
40339 }
40347 {
40352 }
40355 {
40366 }
40372 {
40378 }
40379 else
40380 {
40385 {
40389 else
40391 }
40394 {
40399 }
40400 }
40403 invalid_kind:
40405 resync_fail:
40412 }
40414 /* OpenMP 5.2:
40415 doacross ( source : )
40416 doacross ( source : omp_cur_iteration )
40418 doacross ( sink : vec )
40419 doacross ( sink : omp_cur_iteration - logical_iteration ) */
40421 static tree
40423 {
40424 tree nlist;
40427 matching_parens parens;
40432 {
40433 invalid_kind:
40435 resync_fail:
40440 }
40449 else
40458 {
40460 {
40465 }
40470 }
40471 else
40479 }
40481 /* OpenMP 4.0:
40482 map ( map-kind : variable-list )
40483 map ( variable-list )
40485 map-kind:
40486 alloc | to | from | tofrom
40488 OpenMP 4.5:
40489 map-kind:
40490 alloc | to | from | tofrom | release | delete
40492 map ( always [,] map-kind: variable-list )
40494 OpenMP 5.0:
40495 map ( [map-type-modifier[,] ...] map-kind: variable-list )
40497 map-type-modifier:
40498 always | close */
40500 static tree
40502 {
40513 {
40515 {
40518 }
40521 pos++;
40522 pos++;
40523 }
40528 {
40531 {
40534 }
40538 {
40540 {
40547 }
40549 }
40551 {
40553 {
40560 }
40562 }
40563 else
40564 {
40566 "modifier other than %<always%> or "
40573 }
40576 }
40580 {
40594 else
40595 {
40601 }
40604 }
40607 {
40611 }
40620 }
40622 /* OpenMP 4.0:
40623 device ( expression )
40625 OpenMP 5.0:
40626 device ( [device-modifier :] integer-expression )
40628 device-modifier:
40629 ancestor | device_num */
40631 static tree
40633 location_t location)
40634 {
40638 matching_parens parens;
40644 {
40648 {
40651 /* A requires directive with the reverse_offload clause must be
40652 specified. */
40654 {
40656 "preceded by %<requires%> directive "
40660 }
40661 }
40663 ;
40664 else
40665 {
40669 }
40672 }
40691 }
40693 /* OpenMP 4.0:
40694 dist_schedule ( static )
40695 dist_schedule ( static , expression ) */
40697 static tree
40699 location_t location)
40700 {
40703 matching_parens parens;
40714 {
40725 }
40729 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
40730 "dist_schedule", location); */
40736 invalid_kind:
40738 resync_fail:
40743 }
40745 /* OpenMP 4.0:
40746 proc_bind ( proc-bind-kind )
40748 proc-bind-kind:
40749 primary | master | close | spread
40750 where OpenMP 5.1 added 'primary' and deprecated the alias 'master'. */
40752 static tree
40754 location_t location)
40755 {
40756 tree c;
40763 {
40775 else
40777 }
40778 else
40787 location);
40792 invalid_kind:
40794 resync_fail:
40799 }
40801 /* OpenMP 5.0:
40802 device_type ( host | nohost | any ) */
40804 static tree
40806 location_t location)
40807 {
40808 tree c;
40815 {
40825 else
40827 }
40828 else
40837 location);
40842 invalid_kind:
40844 resync_fail:
40849 }
40851 /* OpenACC:
40852 async [( int-expr )] */
40854 static tree
40856 {
40863 {
40864 matching_parens parens;
40873 }
40883 }
40885 /* Parse all OpenACC clauses. The set clauses allowed by the directive
40886 is a bitmask in MASK. Return the list of clauses found. */
40888 static tree
40892 {
40896 /* Don't create location wrapper nodes within OpenACC clauses. */
40897 auto_suppress_location_wrappers sentinel;
40900 {
40901 location_t here;
40902 pragma_omp_clause c_kind;
40903 omp_clause_code code;
40914 {
40921 clauses);
40974 clauses);
40979 clauses);
40997 clauses);
41002 clauses);
41015 clauses);
41022 clauses);
41028 clauses);
41036 clauses);
41040 clauses
41047 clauses);
41056 clauses);
41062 OMP_CLAUSE_VECTOR,
41069 clauses);
41078 OMP_CLAUSE_WORKER,
41084 }
41089 {
41090 /* Remove the invalid clause(s) from the list to avoid
41091 confusing the rest of the compiler. */
41094 }
41095 }
41097 saw_error:
41104 }
41106 /* Parse all OpenMP clauses. The set clauses allowed by the directive
41107 is a bitmask in MASK. Return the list of clauses found.
41108 FINISH_P set if finish_omp_clauses should be called.
41109 NESTED non-zero if clauses should be terminated by closing paren instead
41110 of end of pragma. If it is 2, additionally commas are required in between
41111 the clauses. */
41113 static tree
41117 {
41122 /* Don't create location wrapper nodes within OpenMP clauses. */
41123 auto_suppress_location_wrappers sentinel;
41126 {
41127 pragma_omp_clause c_kind;
41135 {
41140 "clauses in %<simd%> trait should be separated "
41142 }
41148 {
41165 clauses);
41184 clauses);
41204 clauses);
41209 clauses);
41214 clauses);
41219 clauses);
41228 clauses
41274 clauses);
41278 clauses
41290 clauses);
41294 clauses
41296 OMP_CLAUSE_TASK_REDUCTION,
41312 clauses);
41317 OMP_CLAUSE_NOTINBRANCH,
41326 {
41327 clause_not_first:
41331 }
41360 {
41362 clauses);
41366 }
41367 else
41379 clauses);
41401 {
41406 }
41467 clauses
41473 clauses
41480 clauses);
41486 }
41491 {
41492 /* Remove the invalid clause(s) from the list to avoid
41493 confusing the rest of the compiler. */
41496 }
41497 }
41498 saw_error:
41502 {
41505 else
41507 }
41509 }
41511 /* OpenMP 2.5:
41512 structured-block:
41513 statement
41515 In practice, we're also interested in adding the statement to an
41516 outer node. So it is convenient if we work around the fact that
41517 cp_parser_statement calls add_stmt. */
41519 static unsigned
41521 {
41524 /* Only move the values to IN_OMP_BLOCK if they weren't false.
41525 This preserves the "not within loop or switch" style error messages
41526 for nonsense cases like
41527 void foo() {
41528 #pragma omp single
41529 break;
41530 }
41531 */
41536 }
41538 static void
41540 {
41542 }
41544 static tree
41546 {
41555 }
41557 /* OpenMP 5.x:
41558 # pragma omp allocate (list) clauses
41560 OpenMP 5.0 clause:
41561 allocator (omp_allocator_handle_t expression)
41563 OpenMP 5.1 additional clause:
41564 align (constant-expression)] */
41566 static void
41568 {
41574 do
41575 {
41582 matching_parens parens;
41588 {
41591 }
41596 {
41599 }
41601 {
41604 /* FIXME: Remove when adding check to semantics.cc; cf FIXME below. */
41608 {
41610 "positive constant power of two integer "
41613 }
41615 {
41618 {
41623 {
41625 "positive constant power of two integer "
41628 }
41629 }
41630 }
41631 }
41633 {
41636 }
41637 else
41638 {
41641 }
41648 {
41651 }
41653 /* FIXME: When implementing properly, delete the align/allocate expr error
41654 check above and add one in semantics.cc (to properly handle templates).
41655 Base this on the allocator/align modifiers check for the 'allocate' clause
41656 in semantics.cc's finish_omp_clauses. */
41658 }
41660 /* OpenMP 2.5:
41661 # pragma omp atomic new-line
41662 expression-stmt
41664 expression-stmt:
41665 x binop= expr | x++ | ++x | x-- | --x
41666 binop:
41667 +, *, -, /, &, ^, |, <<, >>
41669 where x is an lvalue expression with scalar type.
41671 OpenMP 3.1:
41672 # pragma omp atomic new-line
41673 update-stmt
41675 # pragma omp atomic read new-line
41676 read-stmt
41678 # pragma omp atomic write new-line
41679 write-stmt
41681 # pragma omp atomic update new-line
41682 update-stmt
41684 # pragma omp atomic capture new-line
41685 capture-stmt
41687 # pragma omp atomic capture new-line
41688 capture-block
41690 read-stmt:
41691 v = x
41692 write-stmt:
41693 x = expr
41694 update-stmt:
41695 expression-stmt | x = x binop expr
41696 capture-stmt:
41697 v = expression-stmt
41698 capture-block:
41699 { v = x; update-stmt; } | { update-stmt; v = x; }
41701 OpenMP 4.0:
41702 update-stmt:
41703 expression-stmt | x = x binop expr | x = expr binop x
41704 capture-stmt:
41705 v = update-stmt
41706 capture-block:
41707 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
41709 OpenMP 5.1:
41710 # pragma omp atomic compare new-line
41711 conditional-update-atomic
41713 # pragma omp atomic compare capture new-line
41714 conditional-update-capture-atomic
41716 conditional-update-atomic:
41717 cond-expr-stmt | cond-update-stmt
41718 cond-expr-stmt:
41719 x = expr ordop x ? expr : x;
41720 x = x ordop expr ? expr : x;
41721 x = x == e ? d : x;
41722 cond-update-stmt:
41723 if (expr ordop x) { x = expr; }
41724 if (x ordop expr) { x = expr; }
41725 if (x == e) { x = d; }
41726 ordop:
41727 <, >
41728 conditional-update-capture-atomic:
41729 v = cond-expr-stmt
41730 { v = x; cond-expr-stmt }
41731 { cond-expr-stmt v = x; }
41732 { v = x; cond-update-stmt }
41733 { cond-update-stmt v = x; }
41734 if (x == e) { x = d; } else { v = x; }
41735 { r = x == e; if (r) { x = d; } }
41736 { r = x == e; if (r) { x = d; } else { v = x; } }
41738 where x, r and v are lvalue expressions with scalar type,
41739 expr, e and d are expressions with scalar type and e might be
41740 the same as v. */
41742 static void
41744 {
41760 {
41766 {
41771 enum omp_memory_order new_memory_order
41787 {
41791 }
41799 {
41800 matching_parens parens;
41807 {
41817 }
41820 {
41824 else
41826 }
41827 else
41837 }
41849 {
41853 }
41854 else
41855 {
41858 "%<capture%>, %<compare%>, %<weak%>, %<fail%>, "
41859 "%<seq_cst%>, %<acq_rel%>, %<release%>, "
41861 }
41863 {
41865 {
41866 /* OpenACC permits 'update capture'. */
41873 else
41875 }
41877 {
41880 else
41882 }
41884 {
41887 else
41889 }
41891 {
41894 else
41896 }
41898 {
41901 else
41903 }
41906 }
41907 }
41909 }
41915 {
41919 else
41921 }
41923 {
41927 }
41929 {
41932 }
41934 {
41937 }
41941 {
41942 omp_requires_mask
41947 {
41957 {
41967 }
41971 }
41972 }
41973 else
41975 {
41978 {
41982 }
41988 {
41992 }
41998 }
42000 memory_order
42005 {
42015 else
42020 {
42021 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
42022 opcode. */
42027 }
42031 {
42034 }
42038 else
42039 {
42047 {
42051 }
42052 }
42055 }
42057 restart:
42059 {
42062 matching_parens parens;
42066 tree cmp_expr;
42069 else
42077 {
42083 }
42085 ;
42087 {
42091 }
42094 {
42096 "expected %<==%>, %<<%> or %<>%> comparison in %<if%> "
42099 }
42110 {
42113 }
42118 else
42131 {
42133 {
42136 }
42138 {
42143 }
42144 else
42146 }
42151 {
42156 }
42157 else
42158 {
42159 bad_if:
42163 }
42166 {
42170 {
42174 }
42202 /* Signal to c_finish_omp_atomic that in
42203 if (x == e) { x = d; } else { v = x; }
42204 case the store to v should be conditional. */
42206 }
42208 {
42211 }
42217 }
42221 {
42228 /* FALLTHROUGH */
42240 /* FALLTHROUGH */
42257 /* Undo effects of boolean_increment for post {in,de}crement. */
42259 /* FALLTHRU */
42263 {
42264 /* Undo effects of boolean_increment. */
42266 {
42267 /* This is pre or post increment. */
42272 && !structured_block
42278 }
42279 }
42280 /* FALLTHRU */
42283 {
42286 }
42288 {
42323 {
42327 }
42332 {
42338 {
42343 }
42345 {
42359 {
42361 {
42366 }
42367 else
42369 }
42374 || !structured_block
42375 || v
42381 {
42383 {
42389 }
42390 }
42398 {
42402 cond_expr:
42404 bool saved_colon_corrects_to_scope_p
42408 parser->colon_corrects_to_scope_p
42413 {
42415 {
42417 {
42421 }
42423 {
42424 opcode
42428 }
42429 }
42430 else
42431 {
42434 {
42435 opcode
42440 }
42441 }
42442 }
42444 "invalid form of "
42447 }
42451 }
42456 {
42463 }
42467 }
42471 {
42474 {
42482 }
42484 {
42489 }
42533 }
42536 {
42538 "invalid form of "
42541 }
42552 {
42554 {
42556 "invalid form of "
42559 }
42561 }
42567 }
42574 }
42575 stmt_done:
42577 {
42590 }
42592 {
42596 }
42597 done:
42599 {
42602 }
42610 invalid_compare:
42612 /* FALLTHRU */
42613 saw_error:
42618 {
42622 {
42626 }
42627 }
42628 }
42631 /* OpenMP 2.5:
42632 # pragma omp barrier new-line */
42634 static void
42636 {
42639 }
42641 /* OpenMP 2.5:
42642 # pragma omp critical [(name)] new-line
42643 structured-block
42645 OpenMP 4.5:
42646 # pragma omp critical [(name) [hint(expression)]] new-line
42647 structured-block */
42649 #define OMP_CRITICAL_CLAUSE_MASK \
42650 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
42652 static tree
42654 {
42658 {
42659 matching_parens parens;
42675 }
42682 }
42684 /* OpenMP 5.0:
42685 # pragma omp depobj ( depobj ) depobj-clause new-line
42687 depobj-clause:
42688 depend (dependence-type : locator)
42689 destroy
42690 update (dependence-type)
42692 dependence-type:
42693 in
42694 out
42695 inout
42696 mutexinout */
42698 static void
42700 {
42702 matching_parens parens;
42704 {
42707 }
42722 {
42728 {
42729 /* Don't create location wrapper nodes within the depend clause. */
42730 auto_suppress_location_wrappers sentinel;
42736 }
42740 {
42741 matching_parens c_parens;
42743 {
42744 location_t c2_loc
42747 {
42762 }
42764 {
42768 }
42774 }
42775 else
42777 }
42778 }
42780 {
42783 }
42787 }
42790 /* OpenMP 2.5:
42791 # pragma omp flush flush-vars[opt] new-line
42793 flush-vars:
42794 ( variable-list )
42796 OpenMP 5.0:
42797 # pragma omp flush memory-order-clause new-line */
42799 static void
42801 {
42807 {
42818 else
42820 "expected %<seq_cst%>, %<acq_rel%>, %<release%> or "
42823 }
42825 {
42828 "%<flush%> list specified together with memory order "
42831 }
42835 }
42837 /* Helper function, to parse omp for increment expression. */
42839 static tree
42841 {
42846 {
42849 }
42852 {
42864 }
42866 /* If decl is an iterator, preserve LHS and RHS of the relational
42867 expr until finish_omp_for. */
42878 }
42880 /* Helper function, to parse omp for increment expression. */
42882 static tree
42884 {
42888 cp_id_kind idk;
42892 {
42901 }
42910 {
42915 }
42922 {
42926 }
42939 do
42940 {
42947 {
42949 {
42952 else
42955 }
42956 else
42961 }
42962 }
42966 {
42972 }
42973 else
42977 }
42979 /* Parse the initialization statement of an OpenMP for loop.
42981 Return true if the resulting construct should have an
42982 OMP_CLAUSE_PRIVATE added to it. */
42984 static tree
42992 {
42998 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
43000 init-expr:
43001 var = lb
43002 integer-type var = lb
43003 random-access-iterator-type var = lb
43004 pointer-type var = lb
43005 */
43006 cp_decl_specifier_seq type_specifiers;
43008 /* First, try to parse as an initialized declaration. See
43009 cp_parser_condition, from whence the bulk of this is copied. */
43017 {
43018 /* If parsing a type specifier seq succeeded, then this
43019 MUST be a initialized declaration. */
43024 CP_PARSER_DECLARATOR_NAMED,
43025 CP_PARSER_FLAGS_NONE,
43037 else
43038 {
43048 {
43050 CPP_OPEN_PAREN))
43053 else
43054 /* Trigger an error. */
43059 }
43063 {
43071 {
43074 auto_node);
43079 }
43082 asm_specification,
43083 LOOKUP_ONLYCONVERTING);
43086 {
43089 }
43090 else
43091 {
43094 {
43096 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
43098 {
43102 {
43106 }
43108 }
43110 {
43115 }
43116 }
43117 }
43119 }
43120 else
43121 {
43122 /* Consume '='. */
43126 non_class:
43129 else
43132 asm_specification,
43133 LOOKUP_ONLYCONVERTING);
43134 }
43138 }
43139 }
43140 else
43141 {
43142 cp_id_kind idk;
43143 /* If parsing a type specifier sequence failed, then
43144 this MUST be a simple expression. */
43150 && decl
43153 {
43164 {
43169 }
43174 }
43176 && decl
43179 {
43180 tree rhs;
43189 tf_warning_or_error));
43192 }
43193 else
43194 {
43199 {
43203 }
43204 }
43205 }
43207 }
43209 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
43211 void
43215 {
43221 {
43225 /* do_auto_deduction doesn't mess with template init-lists. */
43227 {
43232 {
43237 {
43241 }
43242 }
43244 }
43251 }
43256 /* If an error happened previously do nothing or else a lot of
43257 unhelpful errors would be issued. */
43259 else
43260 {
43261 tree range_temp;
43265 /* Can't bind a reference to an array of runtime bound. */
43267 else
43268 {
43274 LOOKUP_ONLYCONVERTING);
43277 }
43280 }
43291 LOOKUP_ONLYCONVERTING);
43293 /* The new for initialization statement. */
43301 else
43302 {
43305 }
43308 LOOKUP_ONLYCONVERTING);
43310 /* The new for condition. */
43313 else
43319 /* The new increment expression. */
43322 else
43325 tf_warning_or_error);
43330 {
43333 }
43338 {
43343 {
43348 }
43349 }
43353 {
43357 {
43361 {
43367 }
43368 }
43369 }
43378 {
43380 {
43381 /* If cp_finish_decomp was called with processing_template_decl
43382 temporarily set to 1, then decomp names will have deduced
43383 name but the DECL_VALUE_EXPR will be dependent. Hide those
43384 from folding of other loop initializers e.g. for warning
43385 purposes until cp_finish_omp_range_for. */
43390 }
43393 }
43395 }
43397 /* Helper for cp_parser_omp_for_loop, finalize part of range for
43398 inside of the collapsed body. */
43400 void
43402 {
43410 {
43414 {
43415 /* Undo temporary clearing of DECL_HAS_VALUE_EXPR_P done
43416 by cp_convert_omp_range_for above. */
43420 {
43424 }
43425 }
43427 }
43429 /* The declaration is initialized with *__begin inside the loop body. */
43434 LOOKUP_ONLYCONVERTING);
43437 }
43439 /* Return true if next tokens contain a standard attribute that contains
43440 omp::directive (DIRECTIVE). */
43442 static bool
43445 {
43453 {
43460 }
43465 location_t last_loc
43474 {
43476 {
43480 cnt++;
43484 {
43488 }
43489 }
43490 }
43492 {
43495 }
43497 {
43499 "%<[[omp::directive(%s)]]%> must be the only specified "
43503 }
43508 }
43510 /* Parse an OpenMP structured block sequence. KIND is the corresponding
43511 separating directive. */
43513 static tree
43516 {
43522 {
43535 kind == PRAGMA_OMP_SCAN
43540 }
43544 }
43547 /* OpenMP 5.0:
43549 scan-loop-body:
43550 { structured-block scan-directive structured-block } */
43552 static void
43554 {
43558 matching_braces braces;
43565 else
43566 {
43570 }
43576 {
43586 {
43593 }
43595 {
43598 }
43599 else
43604 }
43605 else
43611 else
43612 {
43617 }
43619 clauses);
43623 }
43625 /* Parse the restricted form of the for statement allowed by OpenMP. */
43627 static tree
43630 {
43632 tree orig_decl;
43635 location_t loc_first;
43638 releasing_vec for_block;
43647 {
43650 }
43653 {
43656 }
43663 {
43669 }
43683 {
43686 location_t loc;
43689 {
43693 }
43696 /* Don't create location wrapper nodes within an OpenMP "for"
43697 statement. */
43698 auto_suppress_location_wrappers sentinel;
43700 matching_parens parens;
43708 {
43709 /* Save tokens so that we can put them back. */
43712 /* Look for ':' that is not nested in () or {}. */
43713 bool is_range_for
43716 CPP_COLON,
43717 /*consume_paren=*/
43720 /* Roll back the tokens we skipped. */
43724 {
43725 bool saved_colon_corrects_to_scope_p
43728 /* A colon is used in range-based for. */
43731 /* Parse the declaration. */
43733 /*function_definition_allowed_p=*/
43735 parser->colon_corrects_to_scope_p
43747 {
43749 {
43755 }
43756 else
43758 }
43762 "%<ordered%> clause with parameter on "
43766 }
43767 }
43769 add_private_clause
43775 {
43778 {
43784 }
43785 else
43787 }
43795 {
43800 {
43804 }
43807 {
43808 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
43812 {
43815 }
43816 else
43817 {
43820 }
43822 }
43823 else
43824 {
43829 }
43830 }
43833 {
43834 tree c;
43836 {
43845 decl);
43850 decl);
43851 }
43853 {
43858 else
43863 {
43866 /* For linear, signal that we need to fill up
43867 the so far unknown linear step. */
43870 }
43871 }
43872 }
43881 {
43882 /* If decl is an iterator, preserve the operator on decl
43883 until finish_omp_for. */
43885 && ((processing_template_decl
43890 else
43893 }
43895 parse_close_paren:
43906 {
43909 }
43911 {
43915 }
43922 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
43923 in between the collapsed for loops to be still considered perfectly
43924 nested. Hopefully the final version clarifies this.
43925 For now handle (multiple) {'s and empty statements. */
43928 {
43932 {
43934 bracecount++;
43935 }
43939 else
43940 {
43947 }
43948 }
43951 {
43954 }
43955 }
43960 /* Note that we saved the original contents of this flag when we entered
43961 the structured block, and so we don't need to re-save it here. */
43964 /* Note that the grammar doesn't call for a structured block here,
43965 though the loop as a whole is a structured block. */
43967 {
43973 }
43974 else
43978 else
43982 else
43987 else
43992 {
43994 {
43996 nbraces--;
43997 }
44000 else
44001 {
44003 {
44006 }
44011 }
44012 }
44015 {
44019 else
44021 }
44024 }
44026 /* Helper function for OpenMP parsing, split clauses and call
44027 finish_omp_clauses on each of the set of clauses afterwards. */
44029 static void
44032 {
44038 i == C_OMP_CLAUSE_SPLIT_TARGET
44040 }
44042 /* OpenMP 5.0:
44043 #pragma omp loop loop-clause[optseq] new-line
44044 for-loop */
44046 #define OMP_LOOP_CLAUSE_MASK \
44047 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
44052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44054 static tree
44058 {
44069 {
44072 }
44084 }
44086 /* OpenMP 4.0:
44087 #pragma omp simd simd-clause[optseq] new-line
44088 for-loop */
44090 #define OMP_SIMD_CLAUSE_MASK \
44091 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
44092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
44093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
44095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
44101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44103 static tree
44107 {
44118 {
44121 }
44133 }
44135 /* OpenMP 2.5:
44136 #pragma omp for for-clause[optseq] new-line
44137 for-loop
44139 OpenMP 4.0:
44140 #pragma omp for simd for-simd-clause[optseq] new-line
44141 for-loop */
44143 #define OMP_FOR_CLAUSE_MASK \
44144 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
44150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
44151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
44152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44156 static tree
44160 {
44167 /* parallel for{, simd} disallows nowait clause, but for
44168 target {teams distribute ,}parallel for{, simd} it should be accepted. */
44171 /* Composite distribute parallel for{, simd} disallows ordered clause. */
44176 {
44181 {
44205 }
44206 }
44208 {
44211 }
44213 /* Composite distribute parallel for disallows linear clause. */
44220 {
44223 }
44235 }
44240 /* OpenMP 2.5:
44241 # pragma omp master new-line
44242 structured-block */
44244 static tree
44248 {
44256 {
44261 {
44281 }
44282 }
44284 {
44287 }
44290 {
44294 }
44295 else
44300 }
44302 /* OpenMP 5.1:
44303 # pragma omp masked masked-clauses new-line
44304 structured-block */
44306 #define OMP_MASKED_CLAUSE_MASK \
44307 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FILTER)
44309 static tree
44313 {
44322 {
44327 {
44348 }
44349 }
44351 {
44354 }
44359 {
44362 }
44366 clauses);
44367 }
44369 /* OpenMP 2.5:
44370 # pragma omp ordered new-line
44371 structured-block
44373 OpenMP 4.5:
44374 # pragma omp ordered ordered-clauses new-line
44375 structured-block */
44377 #define OMP_ORDERED_CLAUSE_MASK \
44378 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
44379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
44381 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
44382 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DOACROSS))
44385 static bool
44388 {
44396 {
44401 {
44403 {
44406 }
44408 {
44410 "%qs clause may only be used in compound "
44414 }
44415 tree clauses
44417 OMP_ORDERED_DEPEND_CLAUSE_MASK,
44421 }
44422 }
44424 tree clauses
44435 }
44437 /* OpenMP 2.5:
44439 section-scope:
44440 { section-sequence }
44442 section-sequence:
44443 section-directive[opt] structured-block
44444 section-sequence section-directive structured-block */
44446 static tree
44448 {
44453 matching_braces braces;
44460 != PRAGMA_OMP_SECTION
44462 {
44464 PRAGMA_OMP_SECTION);
44467 }
44470 {
44480 {
44484 }
44486 {
44489 }
44492 PRAGMA_OMP_SECTION);
44495 }
44506 }
44508 /* OpenMP 2.5:
44509 # pragma omp sections sections-clause[optseq] newline
44510 sections-scope */
44512 #define OMP_SECTIONS_CLAUSE_MASK \
44513 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44520 static tree
44523 {
44535 {
44538 }
44545 }
44547 /* OpenMP 2.5:
44548 # pragma omp parallel parallel-clause[optseq] new-line
44549 structured-block
44550 # pragma omp parallel for parallel-for-clause[optseq] new-line
44551 structured-block
44552 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
44553 structured-block
44555 OpenMP 4.0:
44556 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
44557 structured-block */
44559 #define OMP_PARALLEL_CLAUSE_MASK \
44560 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
44564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
44565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
44566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
44568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
44571 static tree
44575 {
44582 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
44588 {
44596 if_p);
44600 if_p);
44603 block);
44608 }
44609 /* When combined with distribute, parallel has to be followed by for.
44610 #pragma omp target parallel is allowed though. */
44614 {
44618 }
44620 {
44624 {
44638 block);
44641 /* masked does have just filter clause, but during gimplification
44642 isn't represented by a gimplification omp context, so for
44643 #pragma omp parallel masked don't set OMP_PARALLEL_COMBINED,
44644 so that
44645 #pragma omp parallel masked
44646 #pragma omp taskloop simd lastprivate (x)
44647 isn't confused with
44648 #pragma omp parallel masked taskloop simd lastprivate (x) */
44652 }
44654 {
44668 block);
44671 /* master doesn't have any clauses and during gimplification
44672 isn't represented by a gimplification omp context, so for
44673 #pragma omp parallel master don't set OMP_PARALLEL_COMBINED,
44674 so that
44675 #pragma omp parallel master
44676 #pragma omp taskloop simd lastprivate (x)
44677 isn't confused with
44678 #pragma omp parallel master taskloop simd lastprivate (x) */
44682 }
44684 {
44699 block);
44704 }
44706 {
44709 }
44711 {
44721 block);
44724 }
44725 }
44727 {
44730 }
44735 {
44738 }
44747 }
44749 /* OpenMP 2.5:
44750 # pragma omp single single-clause[optseq] new-line
44751 structured-block */
44753 #define OMP_SINGLE_CLAUSE_MASK \
44754 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
44757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44760 static tree
44762 {
44773 }
44775 /* OpenMP 5.1:
44776 # pragma omp scope scope-clause[optseq] new-line
44777 structured-block */
44779 #define OMP_SCOPE_CLAUSE_MASK \
44780 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44786 static tree
44788 {
44799 }
44801 /* OpenMP 3.0:
44802 # pragma omp task task-clause[optseq] new-line
44803 structured-block */
44805 #define OMP_TASK_CLAUSE_MASK \
44806 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
44808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
44809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
44812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
44813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
44814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
44816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
44818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DETACH) \
44819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_AFFINITY))
44821 static tree
44823 {
44835 }
44837 /* OpenMP 3.0:
44838 # pragma omp taskwait new-line
44840 OpenMP 5.0:
44841 # pragma omp taskwait taskwait-clause[opt] new-line */
44843 #define OMP_TASKWAIT_CLAUSE_MASK \
44844 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44847 static void
44849 {
44850 tree clauses
44855 {
44862 }
44863 else
44865 }
44867 /* OpenMP 3.1:
44868 # pragma omp taskyield new-line */
44870 static void
44872 {
44875 }
44877 /* OpenMP 4.0:
44878 # pragma omp taskgroup new-line
44879 structured-block
44881 OpenMP 5.0:
44882 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
44884 #define OMP_TASKGROUP_CLAUSE_MASK \
44885 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
44888 static tree
44890 {
44891 tree clauses
44896 if_p),
44897 clauses);
44898 }
44901 /* OpenMP 2.5:
44902 # pragma omp threadprivate (variable-list) */
44904 static void
44906 {
44907 tree vars;
44913 }
44915 /* OpenMP 4.0:
44916 # pragma omp cancel cancel-clause[optseq] new-line */
44918 #define OMP_CANCEL_CLAUSE_MASK \
44919 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
44920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
44921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
44922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
44923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
44925 static void
44927 {
44931 }
44933 /* OpenMP 4.0:
44934 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
44936 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
44937 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
44938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
44939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
44940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
44942 static bool
44945 {
44946 tree clauses;
44950 {
44955 {
44958 }
44959 }
44961 {
44965 }
44968 {
44973 else
44977 }
44980 OMP_CANCELLATION_POINT_CLAUSE_MASK,
44982 pragma_tok);
44985 }
44987 /* OpenMP 4.0:
44988 #pragma omp distribute distribute-clause[optseq] new-line
44989 for-loop */
44991 #define OMP_DISTRIBUTE_CLAUSE_MASK \
44992 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
44996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
45000 static tree
45004 {
45013 {
45021 else
45024 {
45030 {
45034 else
45037 }
45043 else
45057 }
45058 }
45060 {
45063 }
45068 {
45071 }
45083 }
45085 /* OpenMP 4.0:
45086 # pragma omp teams teams-clause[optseq] new-line
45087 structured-block */
45089 #define OMP_TEAMS_CLAUSE_MASK \
45090 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
45095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
45096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
45099 static tree
45103 {
45112 {
45116 {
45142 }
45144 {
45170 }
45171 }
45173 {
45176 }
45181 {
45184 }
45194 }
45196 /* OpenMP 4.0:
45197 # pragma omp target data target-data-clause[optseq] new-line
45198 structured-block */
45200 #define OMP_TARGET_DATA_CLAUSE_MASK \
45201 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
45205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
45207 static tree
45209 {
45211 omp_requires_mask
45214 tree clauses
45220 {
45223 {
45241 "%<#pragma omp target data%> with map-type other "
45242 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
45246 }
45251 }
45254 {
45257 "%<#pragma omp target data%> must contain at least "
45258 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
45261 }
45272 }
45274 /* OpenMP 4.5:
45275 # pragma omp target enter data target-enter-data-clause[optseq] new-line
45276 structured-block */
45278 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
45279 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45285 static bool
45288 {
45291 {
45296 {
45299 }
45300 }
45302 {
45306 }
45309 {
45315 }
45318 omp_requires_mask
45321 tree clauses
45327 {
45330 {
45352 "%<#pragma omp target enter data%> with map-type other "
45356 }
45358 }
45361 {
45364 "%<#pragma omp target enter data%> must contain at least "
45367 }
45375 }
45377 /* OpenMP 4.5:
45378 # pragma omp target exit data target-enter-data-clause[optseq] new-line
45379 structured-block */
45381 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
45382 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45388 static bool
45391 {
45394 {
45399 {
45402 }
45403 }
45405 {
45409 }
45412 {
45418 }
45421 omp_requires_mask
45424 tree clauses
45430 {
45433 {
45456 "%<#pragma omp target exit data%> with map-type other "
45457 "than %<from%>, %<tofrom%>, %<release%> or %<delete%> "
45461 }
45463 }
45466 {
45469 "%<#pragma omp target exit data%> must contain at least "
45472 }
45480 }
45482 /* OpenMP 4.0:
45483 # pragma omp target update target-update-clause[optseq] new-line */
45485 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
45486 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
45487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
45488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45493 static bool
45496 {
45498 {
45504 }
45506 tree clauses
45511 {
45513 "%<#pragma omp target update%> must contain at least one "
45516 }
45519 omp_requires_mask
45528 }
45530 /* OpenMP 4.0:
45531 # pragma omp target target-clause[optseq] new-line
45532 structured-block */
45534 #define OMP_TARGET_CLAUSE_MASK \
45535 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
45540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
45543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
45545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
45546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR)\
45547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HAS_DEVICE_ADDR))
45549 static bool
45552 {
45554 omp_requires_mask
45558 {
45570 {
45578 {
45579 tree stmt;
45581 {
45584 OMP_TARGET_CLAUSE_MASK,
45589 OMP_TARGET_CLAUSE_MASK,
45594 OMP_TARGET_CLAUSE_MASK,
45599 }
45601 }
45606 {
45610 if_p);
45615 if_p);
45620 if_p);
45624 }
45630 /* For combined target teams, ensure the num_teams and
45631 thread_limit clause expressions are evaluated on the host,
45632 before entering the target construct. */
45641 {
45644 tf_none);
45651 OMP_CLAUSE_FIRSTPRIVATE);
45656 }
45661 }
45663 {
45666 }
45668 {
45672 }
45674 {
45677 }
45679 {
45682 }
45684 {
45687 }
45688 }
45690 {
45693 }
45700 {
45706 }
45715 }
45717 /* OpenACC 2.0:
45718 # pragma acc cache (variable-list) new-line
45719 */
45721 static tree
45723 {
45724 /* Don't create location wrapper nodes within 'OMP_CLAUSE__CACHE_'
45725 clauses. */
45726 auto_suppress_location_wrappers sentinel;
45742 }
45744 /* OpenACC 2.0:
45745 # pragma acc data oacc-data-clause[optseq] new-line
45746 structured-block */
45748 #define OACC_DATA_CLAUSE_MASK \
45749 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
45755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
45758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
45760 static tree
45762 {
45775 }
45777 /* OpenACC 2.0:
45778 # pragma acc host_data <clauses> new-line
45779 structured-block */
45781 #define OACC_HOST_DATA_CLAUSE_MASK \
45782 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) \
45783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) )
45786 static tree
45788 {
45801 }
45803 /* OpenACC 2.0:
45804 # pragma acc declare oacc-data-clause[optseq] new-line
45805 */
45807 #define OACC_DECLARE_CLAUSE_MASK \
45808 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
45814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
45815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
45817 static tree
45819 {
45829 {
45833 }
45836 {
45840 {
45844 }
45847 {
45859 {
45861 "%qD must be a global variable in "
45863 decl);
45866 }
45871 {
45875 }
45877 {
45879 "invalid use of %<extern%> variable %qD "
45883 }
45885 {
45887 "invalid use of %<global%> variable %qD "
45891 }
45893 }
45896 /* This seems to ignore the existence of cleanup scopes?
45897 What is the meaning for local extern decls? The local
45898 extern is in this scope, but it is referring to a decl that
45899 is namespace scope. */
45902 {
45905 }
45907 {
45909 "%qD must be a variable declared in the same scope as "
45913 }
45918 {
45923 }
45926 {
45927 tree id;
45930 /* We need to mark the aliased decl, as that is the entity
45931 that is being referred to. This won't work for
45932 dependent variables, but it didn't work for them before
45933 DECL_LOCAL_DECL_P was a thing either. But then
45934 dependent local extern variable decls are as rare as
45935 hen's teeth. */
45942 else
45948 {
45951 {
45954 {
45958 }
45959 }
45960 }
45961 }
45962 }
45975 }
45977 /* OpenACC 2.0:
45978 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
45980 or
45982 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
45984 LOC is the location of the #pragma token.
45985 */
45987 #define OACC_ENTER_DATA_CLAUSE_MASK \
45988 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45989 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45990 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45991 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
45995 #define OACC_EXIT_DATA_CLAUSE_MASK \
45996 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
46000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
46001 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
46002 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46004 static tree
46007 {
46016 {
46021 }
46028 else
46033 {
46037 }
46045 }
46047 /* OpenACC 2.0:
46048 # pragma acc loop oacc-loop-clause[optseq] new-line
46049 structured-block */
46051 #define OACC_LOOP_CLAUSE_MASK \
46052 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
46053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
46056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
46057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
46058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
46059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
46060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
46061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
46063 static tree
46066 {
46075 {
46081 }
46090 }
46092 /* OpenACC 2.0:
46093 # pragma acc kernels oacc-kernels-clause[optseq] new-line
46094 structured-block
46096 or
46098 # pragma acc parallel oacc-parallel-clause[optseq] new-line
46099 structured-block
46101 OpenACC 2.6:
46103 # pragma acc serial oacc-serial-clause[optseq] new-line
46104 */
46106 #define OACC_KERNELS_CLAUSE_MASK \
46107 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46108 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46123 #define OACC_PARALLEL_CLAUSE_MASK \
46124 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46143 #define OACC_SERIAL_CLAUSE_MASK \
46144 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46160 static tree
46163 {
46164 omp_clause_mask mask;
46167 {
46185 }
46188 {
46192 {
46195 tree clauses;
46200 }
46201 }
46210 }
46212 /* OpenACC 2.0:
46213 # pragma acc update oacc-update-clause[optseq] new-line
46214 */
46216 #define OACC_UPDATE_CLAUSE_MASK \
46217 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
46219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
46220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
46222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
46224 static tree
46226 {
46233 {
46235 "%<#pragma acc update%> must contain at least one "
46238 }
46246 }
46248 /* OpenACC 2.0:
46249 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
46251 LOC is the location of the #pragma token.
46252 */
46254 #define OACC_WAIT_CLAUSE_MASK \
46255 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
46257 static tree
46259 {
46273 }
46275 /* OpenMP 4.0:
46276 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
46278 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
46279 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
46280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
46281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
46282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
46283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
46284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
46286 static void
46290 {
46292 cp_omp_declare_simd_data data;
46294 {
46302 /* It is safe to take the address of a local variable; it will only be
46303 used while this scope is live. */
46305 }
46307 {
46309 "%<#pragma omp declare %s%> followed by "
46314 }
46316 /* Store away all pragma tokens. */
46325 {
46329 {
46342 }
46347 "%<#pragma omp declare %s%> not immediately followed by "
46352 }
46353 }
46365 /* OpenMP 5.0:
46367 trait-selector:
46368 trait-selector-name[([trait-score:]trait-property[,trait-property[,...]])]
46370 trait-score:
46371 score(score-expression) */
46373 static tree
46375 {
46377 do
46378 {
46379 tree selector;
46383 else
46384 {
46387 }
46398 {
46425 }
46427 {
46429 {
46431 {
46434 }
46435 else
46436 {
46442 }
46443 }
46448 }
46458 {
46460 {
46464 }
46466 matching_parens parens;
46474 {
46481 {
46485 matching_parens parens2;
46493 {
46505 else
46508 }
46509 }
46510 else
46514 }
46517 {
46518 tree t;
46520 do
46521 {
46524 {
46532 "constant integer expression or string "
46534 else
46536 }
46537 else
46542 else
46544 }
46550 {
46554 }
46555 else
46556 {
46559 }
46562 do
46563 {
46567 {
46570 }
46575 else
46576 {
46580 }
46586 else
46588 }
46594 {
46601 else
46603 }
46604 else
46609 {
46611 "selector may not be specified in "
46614 }
46615 properties
46617 OMP_DECLARE_SIMD_CLAUSE_MASK,
46622 }
46628 }
46632 {
46635 }
46641 else
46643 }
46647 }
46649 /* OpenMP 5.0:
46651 trait-set-selector[,trait-set-selector[,...]]
46653 trait-set-selector:
46654 trait-set-selector-name = { trait-selector[, trait-selector[, ...]] }
46656 trait-set-selector-name:
46657 constructor
46658 device
46659 implementation
46660 user */
46662 static tree
46665 {
46667 do
46668 {
46671 setp
46674 {
46693 }
46695 {
46699 }
46707 matching_braces braces;
46711 tree selectors
46714 {
46717 }
46725 else
46727 }
46733 }
46735 /* Assumption clauses:
46736 OpenMP 5.1
46737 absent (directive-name-list)
46738 contains (directive-name-list)
46739 holds (expression)
46740 no_openmp
46741 no_openmp_routines
46742 no_parallelism */
46744 static void
46747 {
46762 {
46775 {
46780 }
46782 {
46787 }
46789 {
46794 }
46796 {
46798 matching_parens parens;
46800 {
46812 }
46813 }
46815 {
46817 matching_parens parens;
46819 {
46820 do
46821 {
46824 location_t dloc
46827 {
46828 tree id;
46833 CPP_KEYWORD))
46834 {
46835 enum rid rid
46839 }
46840 else
46843 }
46846 else
46847 {
46860 else
46861 {
46866 "mentioned in both %<absent%> and "
46874 ? &absent_head
46877 "mentioned multiple times in %qs "
46884 }
46887 }
46890 else
46892 }
46899 }
46900 }
46902 {
46909 }
46910 else
46911 {
46915 }
46916 }
46918 }
46920 /* OpenMP 5.1
46921 # pragma omp assume clauses[optseq] new-line */
46923 static void
46925 {
46928 }
46930 /* OpenMP 5.1
46931 # pragma omp assumes clauses[optseq] new-line */
46933 static bool
46935 {
46938 }
46940 /* Finalize #pragma omp declare variant after a fndecl has been parsed, and put
46941 that into "omp declare variant base" attribute. */
46943 static tree
46945 tree attrs)
46946 {
46947 matching_parens parens;
46949 {
46950 fail:
46953 }
46958 cp_expr varid
46966 tree variant;
46973 else
46974 {
46975 tree ambiguous_decls;
46983 }
46987 {
46989 variant
46997 }
47012 {
47015 }
47027 {
47029 match_loc);
47038 }
47043 }
47046 /* Finalize #pragma omp declare simd clauses after direct declarator has
47047 been parsed, and put that into "omp declare simd" attribute. */
47049 static tree
47051 {
47057 {
47062 }
47067 {
47078 {
47081 pragma_tok);
47089 }
47090 else
47091 {
47093 attrs
47095 }
47097 }
47101 {
47107 {
47109 {
47116 {
47124 else
47127 }
47133 {
47135 "unknown OpenMP directive name in "
47138 }
47142 {
47144 "OpenMP directive other than %<declare simd%> "
47145 "or %<declare variant%> appertains to a "
47148 }
47151 {
47153 "mixing OpenMP directives with attribute and "
47156 }
47161 {
47164 }
47166 cp_token tok = {};
47174 tok = {};
47179 tok = {};
47191 /* Move the current source position to that of the first token
47192 in the new lexer. */
47202 {
47210 pragma_tok);
47214 cl);
47219 }
47220 else
47221 {
47223 attrs
47225 attrs);
47226 }
47229 }
47231 }
47232 else
47234 }
47240 }
47242 /* Helper for cp_parser_omp_declare_target, handle one to or link clause
47243 on #pragma omp declare target. Return false if errors were reported. */
47245 static bool
47247 {
47250 tree id;
47252 {
47255 }
47256 else
47259 {
47262 "%qD specified both in declare target %<link%> and %qs"
47264 else
47266 "%qD specified both in declare target %<link%> and "
47269 }
47271 {
47278 {
47281 {
47285 }
47286 }
47287 }
47291 {
47295 {
47298 }
47299 }
47301 {
47305 {
47308 }
47309 }
47311 }
47313 /* OpenMP 4.0:
47314 # pragma omp declare target new-line
47315 declarations and definitions
47316 # pragma omp end declare target new-line
47318 OpenMP 4.5:
47319 # pragma omp declare target ( extended-list ) new-line
47321 # pragma omp declare target declare-target-clauses[seq] new-line */
47323 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
47324 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
47325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ENTER) \
47326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
47327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE))
47329 static void
47331 {
47338 clauses
47342 {
47344 clauses);
47347 }
47348 else
47349 {
47350 cp_omp_declare_target_attr a
47355 }
47360 {
47373 device_type);
47374 }
47378 }
47380 /* OpenMP 5.1
47381 # pragma omp begin assumes clauses[optseq] new-line
47383 # pragma omp begin declare target clauses[optseq] new-line */
47385 #define OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK \
47386 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE)
47388 static void
47390 {
47394 {
47397 }
47399 {
47403 {
47406 }
47408 {
47410 tree clauses
47412 OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK,
47414 pragma_tok);
47419 cp_omp_declare_target_attr a
47422 }
47423 else
47424 {
47427 }
47428 }
47430 {
47435 }
47436 else
47437 {
47440 }
47441 }
47443 /* OpenMP 4.0:
47444 # pragma omp end declare target new-line
47446 OpenMP 5.1:
47447 # pragma omp end assumes new-line */
47449 static void
47451 {
47455 {
47458 }
47460 {
47464 {
47467 }
47470 else
47471 {
47475 }
47479 "%<#pragma omp end declare target%> without corresponding "
47480 "%<#pragma omp declare target%> or "
47482 else
47483 {
47484 cp_omp_declare_target_attr
47487 {
47490 "%qs in attribute syntax terminated "
47495 else
47497 "%qs in pragma syntax terminated "
47502 }
47503 }
47504 }
47506 {
47513 else
47514 {
47515 cp_omp_begin_assumes_data
47518 {
47521 "%qs in attribute syntax terminated "
47524 else
47526 "%qs in pragma syntax terminated "
47529 }
47530 }
47531 }
47532 else
47533 {
47537 }
47538 }
47540 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
47541 expression and optional initializer clause of
47542 #pragma omp declare reduction. We store the expression(s) as
47543 either 3, 6 or 7 special statements inside of the artificial function's
47544 body. The first two statements are DECL_EXPRs for the artificial
47545 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
47546 expression that uses those variables.
47547 If there was any INITIALIZER clause, this is followed by further statements,
47548 the fourth and fifth statements are DECL_EXPRs for the artificial
47549 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
47550 constructor variant (first token after open paren is not omp_priv),
47551 then the sixth statement is a statement with the function call expression
47552 that uses the OMP_PRIV and optionally OMP_ORIG variable.
47553 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
47554 to initialize the OMP_PRIV artificial variable and there is seventh
47555 statement, a DECL_EXPR of the OMP_PRIV statement again. */
47557 static bool
47559 {
47571 tree combiner;
47592 {
47595 }
47598 {
47600 matching_parens parens;
47606 {
47609 }
47625 {
47629 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
47633 == CPP_CLOSE_PAREN
47636 {
47640 }
47645 }
47646 else
47647 {
47649 /* Don't create location wrapper nodes here. */
47650 auto_suppress_location_wrappers sentinel;
47665 {
47670 }
47672 tree arg;
47685 }
47698 }
47702 UNKNOWN_LOCATION);
47705 }
47707 /* OpenMP 4.0
47708 #pragma omp declare reduction (reduction-id : typename-list : expression) \
47709 initializer-clause[opt] new-line
47711 initializer-clause:
47712 initializer (omp_priv initializer)
47713 initializer (function-name (argument-list)) */
47715 static void
47718 {
47728 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
47735 {
47767 }
47779 /* Types may not be defined in declare reduction type list. */
47782 parser->type_definition_forbidden_message
47788 saved_colon_doesnt_start_class_def_p
47793 {
47797 ;
47815 else
47820 else
47822 }
47824 /* Restore the saved message. */
47827 parser->colon_doesnt_start_class_def_p
47832 {
47833 fail:
47836 }
47842 {
47843 tree fntype
47846 NULL_TREE);
47863 {
47867 }
47873 {
47876 }
47878 {
47880 {
47886 }
47893 }
47894 else
47895 {
47898 /* We should never meet a matched duplicate decl. */
47900 }
47905 else
47908 {
47911 }
47919 else
47920 {
47924 }
47929 {
47937 }
47945 }
47949 done:
47950 /* Free any declarators allocated. */
47952 }
47954 /* OpenMP 4.0
47955 #pragma omp declare simd declare-simd-clauses[optseq] new-line
47956 #pragma omp declare reduction (reduction-id : typename-list : expression) \
47957 initializer-clause[opt] new-line
47958 #pragma omp declare target new-line
47960 OpenMP 5.0
47961 #pragma omp declare variant (identifier) match (context-selector) */
47963 static bool
47966 {
47968 {
47973 {
47978 }
47980 {
47985 }
47988 {
47991 context);
47993 }
47995 {
47998 }
48000 {
48004 }
48005 }
48010 }
48012 /* OpenMP 5.0
48013 #pragma omp requires clauses[optseq] new-line */
48015 static bool
48017 {
48022 {
48028 {
48043 {
48046 matching_parens parens;
48048 {
48050 {
48055 this_req
48058 this_req
48061 this_req
48063 }
48065 {
48067 "expected %<seq_cst%>, %<relaxed%> or "
48070 {
48077 CPP_CLOSE_PAREN))
48080 }
48081 }
48082 else
48089 /*consume_paren=*/
48093 {
48096 }
48097 }
48099 }
48100 else
48101 {
48103 "%<unified_shared_memory%>, "
48104 "%<dynamic_allocators%>, "
48105 "%<reverse_offload%> "
48109 }
48113 {
48115 {
48122 }
48124 {
48128 }
48131 {
48134 this_req
48136 (omp_requires_mask
48138 }
48142 "lexically after first %<atomic%> construct "
48145 omp_requires_mask
48148 }
48149 }
48151 }
48157 }
48160 /* OpenMP 5.1:
48161 #pragma omp nothing new-line */
48163 static void
48165 {
48167 }
48170 /* OpenMP 5.1
48171 #pragma omp error clauses[optseq] new-line */
48173 static bool
48176 {
48184 {
48197 };
48205 {
48208 }
48210 {
48215 }
48219 matching_parens parens;
48221 {
48223 {
48227 else
48229 tf_warning_or_error,
48230 LOOKUP_NORMAL);
48231 }
48232 else
48233 {
48235 {
48243 }
48245 {
48250 {
48257 CPP_CLOSE_PAREN))
48260 }
48261 }
48262 else
48264 }
48270 /*consume_paren=*/
48274 {
48276 {
48279 }
48280 else
48282 }
48284 {
48286 {
48289 }
48290 else
48292 }
48293 }
48294 else
48296 }
48306 {
48308 {
48312 }
48313 tree fndecl
48322 }
48329 {
48333 }
48337 else
48341 }
48343 /* OpenMP 4.5:
48344 #pragma omp taskloop taskloop-clause[optseq] new-line
48345 for-loop
48347 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
48348 for-loop */
48350 #define OMP_TASKLOOP_CLAUSE_MASK \
48351 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
48352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
48353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
48354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
48355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
48356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
48357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
48358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
48359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
48360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
48361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
48362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
48363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
48364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
48365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
48366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
48367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
48369 static tree
48373 {
48380 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
48381 clause. */
48386 {
48391 {
48415 }
48416 }
48418 {
48421 }
48426 {
48429 }
48436 if_p);
48442 }
48445 /* OpenACC 2.0:
48446 # pragma acc routine oacc-routine-clause[optseq] new-line
48447 function-definition
48449 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
48450 */
48452 #define OACC_ROUTINE_CLAUSE_MASK \
48453 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
48454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
48455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
48456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
48457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NOHOST) )
48459 /* Parse the OpenACC routine pragma. This has an optional '( name )'
48460 component, which must resolve to a declared namespace-scope
48461 function. The clauses are either processed directly (for a named
48462 function), or defered until the immediatley following declaration
48463 is parsed. */
48465 static void
48468 {
48470 /* The checking for "another pragma following this one" in the "no optional
48471 '( name )'" case makes sure that we dont re-enter. */
48474 cp_oacc_routine_data data;
48480 /* It is safe to take the address of a local variable; it will only be
48481 used while this scope is live. */
48484 /* Look for optional '( name )'. */
48486 {
48487 matching_parens parens;
48490 /* We parse the name as an id-expression. If it resolves to
48491 anything other than a non-overloaded function at namespace
48492 scope, it's an error. */
48508 {
48512 }
48514 data.clauses
48518 /* The clauses are in reverse order; fix that to make later diagnostic
48519 emission easier. */
48525 {
48530 }
48532 /* Perhaps we should use the same rule as declarations in different
48533 namespaces? */
48535 {
48540 }
48543 {
48547 }
48551 }
48553 {
48554 /* Store away all pragma tokens. */
48562 /* Emit a helpful diagnostic if there's another pragma following this
48563 one. */
48565 {
48568 /* ..., and then just keep going. */
48570 }
48572 /* We only have to consider the pragma_external case here. */
48577 else
48580 }
48581 }
48583 /* Finalize #pragma acc routine clauses after direct declarator has
48584 been parsed. */
48586 static tree
48588 {
48593 {
48595 "%<#pragma acc routine%> not immediately followed by "
48598 }
48614 /* The clauses are in reverse order; fix that to make later diagnostic
48615 emission easier. */
48618 /* Later, cp_finalize_oacc_routine will process the clauses. */
48622 }
48624 /* Apply any saved OpenACC routine clauses to a just-parsed
48625 declaration. */
48627 static void
48629 {
48631 {
48632 /* Keep going if we're in error reporting mode. */
48638 {
48640 {
48642 "%<#pragma acc routine%> not immediately followed by"
48646 }
48650 }
48652 int compatible
48657 {
48660 }
48662 {
48663 }
48664 else
48665 {
48667 {
48676 }
48678 /* Set the routine's level of parallelism. */
48682 /* Add an "omp declare target" attribute. */
48687 }
48688 }
48689 }
48691 /* Main entry point to OpenMP statement pragmas. */
48693 static void
48695 {
48696 tree stmt;
48701 {
48729 if_p);
48749 if_p);
48754 if_p);
48759 if_p);
48764 if_p);
48769 if_p);
48774 if_p);
48786 if_p);
48800 if_p);
48805 if_p);
48812 }
48815 }
48816 \f
48817 /* Transactional Memory parsing routines. */
48819 /* Parse a transaction attribute.
48821 txn-attribute:
48822 attribute
48823 [ [ identifier ] ]
48825 We use this instead of cp_parser_attributes_opt for transactions to avoid
48826 the pedwarn in C++98 mode. */
48828 static tree
48830 {
48845 {
48849 /* For keywords, use the canonical spelling,
48850 not the parsed identifier. */
48854 }
48855 else
48859 error1:
48862 }
48864 /* Parse a __transaction_atomic or __transaction_relaxed statement.
48866 transaction-statement:
48867 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
48868 compound-statement
48869 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
48870 */
48872 static tree
48874 {
48885 else
48886 {
48890 }
48892 /* Parse a noexcept specification. */
48896 {
48897 /* cancel-and-throw is unimplemented. */
48900 }
48901 else
48903 CP_PARSER_FLAGS_NONE,
48908 /* Keep track if we're in the lexical scope of an outer transaction. */
48920 }
48922 /* Parse a __transaction_atomic or __transaction_relaxed expression.
48924 transaction-expression:
48925 __transaction_atomic txn-noexcept-spec[opt] ( expression )
48926 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
48927 */
48929 static tree
48931 {
48944 keyword == RID_TRANSACTION_RELAXED
48958 /* Set this early. This might mean that we allow transaction_cancel in
48959 an expression that we find out later actually has to be a constexpr.
48960 However, we expect that cxx_constant_value will be able to deal with
48961 this; also, if the noexcept has no constexpr, then what we parse next
48962 really is a transaction's body. */
48965 /* Parse a noexcept specification. */
48967 CP_PARSER_FLAGS_NONE,
48974 {
48975 matching_parens parens;
48982 }
48983 else
48984 {
48985 /* The only expression that is available got parsed for the noexcept
48986 already. noexcept is true then. */
48989 }
48998 }
49000 /* Parse a function-transaction-block.
49002 function-transaction-block:
49003 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
49004 function-body
49005 __transaction_atomic txn-attribute[opt] function-try-block
49006 __transaction_relaxed ctor-initializer[opt] function-body
49007 __transaction_relaxed function-try-block
49008 */
49010 static void
49012 {
49027 else
49028 {
49032 }
49040 else
49041 cp_parser_ctor_initializer_opt_and_function_body
49047 }
49049 /* Parse a __transaction_cancel statement.
49051 cancel-statement:
49052 __transaction_cancel txn-attribute[opt] ;
49053 __transaction_cancel txn-attribute[opt] throw-expression ;
49055 ??? Cancel and throw is not yet implemented. */
49057 static tree
49059 {
49065 RT_TRANSACTION_CANCEL);
49072 /* ??? Parse cancel-and-throw here. */
49077 {
49081 }
49083 {
49087 }
49089 {
49092 {
49098 }
49099 }
49101 {
49105 }
49111 }
49112 \f
49114 /* Special handling for the first token or line in the file. The first
49115 thing in the file might be #pragma GCC pch_preprocess, which loads a
49116 PCH file, which is a GC collection point. So we need to handle this
49117 first pragma without benefit of an existing lexer structure.
49119 Always returns one token to the caller in *FIRST_TOKEN. This is
49120 either the true first token of the file, or the first token after
49121 the initial pragma. */
49123 static void
49125 {
49133 {
49137 }
49139 /* Skip to the end of the pragma. */
49141 {
49144 do
49147 }
49149 /* Now actually load the PCH file. */
49153 /* Read one more token to return to our caller. We have to do this
49154 after reading the PCH file in, since its pointers have to be
49155 live. */
49157 }
49159 /* Parse a pragma GCC ivdep. */
49161 static bool
49163 {
49166 }
49168 /* Parse a pragma GCC unroll. */
49170 static unsigned short
49172 {
49182 {
49184 " assignment-expression that evaluates to a non-negative"
49187 }
49188 else
49189 {
49193 }
49196 }
49198 /* Normal parsing of a pragma token. Here we can (and must) use the
49199 regular lexer. */
49201 static bool
49203 {
49206 tree stmt;
49217 {
49225 {
49236 }
49241 {
49252 }
49257 {
49268 }
49273 {
49285 }
49290 {
49302 }
49307 {
49319 }
49338 {
49344 }
49352 {
49358 }
49366 {
49371 }
49377 {
49383 }
49391 {
49397 }
49439 {
49441 "%<#pragma omp requires%> may only be used at file or "
49445 }
49450 {
49452 "%<#pragma omp assumes%> may only be used at file or "
49456 }
49492 "%<#pragma omp scan%> may only be used in "
49498 "%<#pragma omp section%> may only be used in "
49503 {
49505 {
49509 }
49515 {
49519 }
49520 else
49526 {
49529 }
49532 }
49535 {
49537 {
49541 }
49542 const unsigned short unroll
49548 {
49552 }
49553 else
49559 {
49562 }
49565 }
49572 bad_stmt:
49575 }
49579 }
49581 /* The interface the pragma parsers have to the lexer. */
49583 enum cpp_ttype
49585 {
49598 else
49599 {
49603 }
49606 }
49608 \f
49609 /* External interface. */
49611 /* Parse one entire translation unit. */
49613 void
49615 {
49623 /* cp_lexer_new_main is called before doing any GC allocation
49624 because tokenization might load a PCH file. */
49633 }
49635 /* Create an identifier for a generic parameter type (a synthesized
49636 template parameter implied by `auto' or a concept identifier). */
49639 static tree
49641 {
49645 }
49647 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
49648 (creating a new template parameter list if necessary). Returns the newly
49649 created template type parm. */
49651 static tree
49653 {
49654 /* A requires-clause is not a function and cannot have placeholders. */
49656 {
49659 }
49663 /* We are either continuing a function template that already contains implicit
49664 template parameters, creating a new fully-implicit function template, or
49665 extending an existing explicit function template with implicit template
49666 parameters. */
49674 {
49678 }
49679 else
49680 {
49681 /* Roll back to the existing template parameter scope (in the case of
49682 extending an explicit function template) or introduce a new template
49683 parameter scope ahead of the function parameter scope (or class scope
49684 in the case of out-of-line member definitions). The function scope is
49685 added back after template parameter synthesis below. */
49690 {
49693 }
49695 {
49696 /* If not defining a class, then any class scope is a scope level in
49697 an out-of-line member definition. In this case simply wind back
49698 beyond the first such scope to inject the template parameter list.
49699 Otherwise wind back to the class being defined. The latter can
49700 occur in class member friend declarations such as:
49702 class A {
49703 void foo (auto);
49704 };
49705 class B {
49706 friend void A::foo (auto);
49707 };
49709 The template parameter list synthesized for the friend declaration
49710 must be injected in the scope of 'B'. This can also occur in
49711 erroneous cases such as:
49713 struct A {
49714 struct B {
49715 void foo (auto);
49716 };
49717 void B::foo (auto) {}
49718 };
49720 Here the attempted definition of 'B::foo' within 'A' is ill-formed
49721 but, nevertheless, the template parameter list synthesized for the
49722 declarator should be injected into the scope of 'A' as if the
49723 ill-formed template was specified explicitly. */
49726 {
49729 }
49730 }
49736 {
49737 /* Introduce a new template parameter list for implicit template
49738 parameters. */
49742 parser->implicit_template_scope
49749 }
49750 else
49751 {
49752 /* Synthesize implicit template parameters at the end of the explicit
49753 template parameter list. */
49760 parser->implicit_template_parms
49762 }
49763 }
49765 /* Synthesize a new template parameter and track the current template
49766 parameter chain with implicit_template_parms. */
49772 /* Synthesize the type template parameter. */
49780 /* Attach the constraint to the parm before processing. */
49783 tree new_parm
49785 input_location,
49786 node,
49789 // Process_template_parm returns the list of parms, and
49790 // parser->implicit_template_parms holds the final node of the parm
49791 // list. We really want to manipulate the newly appended element.
49798 // Record the last implicit parm node
49801 /* Mark the synthetic declaration "virtual". This is used when
49802 comparing template-heads to determine if whether an abbreviated
49803 function template is equivalent to an explicit template.
49805 Note that DECL_ARTIFICIAL is used elsewhere for template
49806 parameters. */
49812 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
49815 /* If creating a fully implicit function template, start the new implicit
49816 template parameter list with this synthesized type, otherwise grow the
49817 current template parameter list. */
49820 {
49826 }
49827 else
49828 {
49833 }
49835 /* If the new parameter was constrained, we need to add that to the
49836 constraints in the template parameter list. */
49838 {
49842 }
49847 }
49849 /* Finish the declaration of a fully implicit function template. Such a
49850 template has no explicit template parameter list so has not been through the
49851 normal template head and tail processing. synthesize_implicit_template_parm
49852 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
49853 provided if the declaration is a class member such that its template
49854 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
49855 form is returned. Otherwise NULL_TREE is returned. */
49857 static tree
49859 {
49864 {
49868 }
49880 }
49882 /* Like finish_fully_implicit_template, but to be used in error
49883 recovery, rearranging scopes so that we restore the state we had
49884 before synthesize_implicit_template_parm inserted the implement
49885 template parms scope. */
49887 static void
49889 {
49894 {
49903 }
49904 else
49910 }
49912 /* Helper function for diagnostics that have complained about things
49913 being used with 'extern "C"' linkage.
49915 Attempt to issue a note showing where the 'extern "C"' linkage began. */
49917 void
49919 {
49923 }