| blob | 5e2b5cba57e8fac3809abc9d215a2d24371c4cb4 |
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 template argument "
19832 "use of %<auto%> in parameter declaration "
19836 "use of %<auto%> in parameter declaration "
19837 "only available with "
19839 }
19840 else
19845 /* Since DR 743, decltype can either be a simple-type-specifier by
19846 itself or begin a nested-name-specifier. Parsing it will replace
19847 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
19848 handling below decide what to do. */
19854 /* Consume the `typeof' token. */
19856 /* Parse the operand to `typeof'. */
19858 /* If it is not already a TYPE, take its type. */
19864 token,
19869 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
19870 case RID_##CODE:
19872 #undef DEFTRAIT_TYPE
19876 token,
19883 }
19885 /* If token is an already-parsed decltype not followed by ::,
19886 it's a simple-type-specifier. */
19889 {
19892 {
19894 token,
19896 /* Remember that we are handling a decltype in order to
19897 implement the resolution of DR 1510 when the argument
19898 isn't instantiation dependent. */
19900 }
19903 }
19905 /* If the type-specifier was for a built-in type, we're done. */
19907 {
19908 /* Record the type. */
19915 type,
19916 token,
19921 /* Consume the token. */
19927 /* There is no valid C++ program where a non-template type is
19928 followed by a "<". That usually indicates that the user thought
19929 that the type was a template. */
19934 }
19936 /* The type-specifier must be a user-defined type. */
19938 {
19944 /* Don't gobble tokens or issue error messages if this is an
19945 optional type-specifier. */
19949 /* Remember current tentative parsing state -- if we know we need
19950 a type, we can give better diagnostics here. */
19955 /* Look for the optional `::' operator. */
19956 global_p
19960 /* Look for the nested-name specifier. */
19961 qualified_p
19968 /* If we have seen a nested-name-specifier, and the next token
19969 is `template', then we are using the template-id production. */
19972 {
19973 /* Look for the template-id. */
19977 none_type,
19979 /* If the template-id did not name a type, we are out of
19980 luck. */
19982 {
19983 /* ...unless we pretend we have seen 'typename'. */
19987 else
19988 {
19991 }
19992 }
19993 }
19994 /* DR 1812: A < following a qualified-id in a typename-specifier
19995 could safely be assumed to begin a template argument list, so
19996 the template keyword should be optional. */
19998 && qualified_p
19999 && typename_p
20001 {
20007 none_type,
20009 /* This is handled below, so back off. */
20020 }
20022 /* Otherwise, look for a type-name. */
20024 {
20032 }
20035 {
20036 /* Try for a type-constraint with template arguments. We check
20037 decl_specs here to avoid trying this for a functional cast. */
20044 none_type,
20047 {
20052 /* Perhaps it's a concept-check expression. */
20054 }
20055 else
20060 }
20063 {
20064 /* Try class template argument deduction or type-constraint without
20065 template arguments. */
20069 {
20070 location_t loc
20073 none_type,
20085 else
20086 {
20091 }
20092 }
20093 else
20095 }
20097 /* If it didn't work out, we don't have a TYPE. */
20102 /* Keep track of all name-lookups performed in class scopes. */
20104 && !global_p
20105 && !qualified_p
20112 token,
20114 }
20116 /* If we didn't get a type-name, issue an error message. */
20118 {
20121 }
20124 {
20125 /* See if TYPE is an Objective-C type, and if so, parse and
20126 accept any protocol references following it. Do this before
20127 the cp_parser_check_for_invalid_template_id() call, because
20128 Objective-C types can be followed by '<...>' which would
20129 enclose protocol names rather than template arguments, and so
20130 everything is fine. */
20133 {
20137 /* Clobber the "unqualified" type previously entered into
20138 DECL_SPECS with the new, improved protocol-qualified version. */
20143 }
20145 /* There is no valid C++ program where a non-template type is
20146 followed by a "<". That usually indicates that the user
20147 thought that the type was a template. */
20149 none_type,
20151 }
20154 }
20156 /* Parse the remainder of a placholder-type-specifier.
20158 placeholder-type-specifier:
20159 type-constraint_opt auto
20160 type-constraint_opt decltype(auto)
20162 The raw form of the constraint is parsed in cp_parser_simple_type_specifier
20163 and passed as TMPL. This function converts TMPL to an actual type-constraint,
20164 parses the placeholder type, and performs some contextual syntactic analysis.
20166 LOC provides the location of the template name.
20168 TENTATIVE is true if the type-specifier parsing is tentative; in that case,
20169 don't give an error if TMPL isn't a valid type-constraint, as the template-id
20170 might actually be a concept-check,
20172 Note that the Concepts TS allows the auto or decltype(auto) to be
20173 omitted in a constrained-type-specifier. */
20175 static tree
20178 {
20184 /* Get the arguments as written for subsequent analysis. */
20187 {
20190 }
20191 else
20192 /* A concept-name with no arguments can't be an expression. */
20197 /* Get the concept and prototype parameter for the constraint. */
20204 /* As per the standard, require auto or decltype(auto), except in some
20205 cases (template parameter lists, -fconcepts-ts enabled). */
20208 {
20212 {
20214 matching_parens parens;
20218 }
20219 }
20221 /* A type constraint constrains a contextually determined type or type
20222 parameter pack. However, the Concepts TS does allow concepts
20223 to introduce non-type and template template parameters. */
20225 {
20228 {
20230 {
20233 }
20235 }
20236 }
20238 /* In a template parameter list, a type-parameter can be introduced
20239 by type-constraints alone. */
20241 {
20242 /* In a default argument we may not be creating new parameters. */
20244 {
20245 /* If this assert turns out to be false, do error() instead. */
20248 }
20250 }
20252 /* Diagnose issues placeholder issues. */
20256 {
20258 /* Perhaps it's a concept-check expression (c++/91073). */
20265 /* Fall through. This is an error of omission. */
20266 }
20268 {
20269 /* A trailing return type only allows type-constraints. */
20272 }
20274 /* In a parameter-declaration-clause, a placeholder-type-specifier
20275 results in an invented template parameter. */
20277 {
20279 {
20285 }
20288 }
20290 /* Determine if the type should be deduced using template argument
20291 deduction or decltype deduction. Note that the latter is always
20292 used for type-constraints in trailing return types. */
20297 /* Otherwise, this is the type of a variable or return type. */
20300 else
20302 }
20304 /* Parse a type-name.
20306 type-name:
20307 class-name
20308 enum-name
20309 typedef-name
20310 simple-template-id [in c++0x]
20312 enum-name:
20313 identifier
20315 typedef-name:
20316 identifier
20318 Concepts:
20320 type-name:
20321 concept-name
20322 partial-concept-id
20324 concept-name:
20325 identifier
20327 Returns a TYPE_DECL for the type. */
20329 static tree
20331 {
20332 tree type_decl;
20334 /* We can't know yet whether it is a class-name or not. */
20336 /* Try a class-name. */
20338 typename_keyword_p,
20340 none_type,
20344 /* If it's not a class-name, keep looking. */
20346 {
20348 /* It must be a typedef-name or an enum-name. */
20352 /* It is either a simple-template-id representing an
20353 instantiation of an alias template... */
20357 none_type,
20359 /* Note that this must be an instantiation of an alias template
20360 because [temp.names]/6 says:
20362 A template-id that names an alias template specialization
20363 is a type-name.
20365 Whereas [temp.names]/7 says:
20367 A simple-template-id that names a class template
20368 specialization is a class-name.
20370 With concepts, this could also be a partial-concept-id that
20371 declares a non-type template parameter. */
20376 else
20380 /* ... Or a typedef-name or an enum-name. */
20382 }
20385 }
20387 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
20388 or a concept-name.
20390 enum-name:
20391 identifier
20393 typedef-name:
20394 identifier
20396 concept-name:
20397 identifier
20399 Returns a TYPE_DECL for the type. */
20401 static tree
20403 {
20404 tree type_decl;
20405 tree identifier;
20412 /* Look up the type-name. */
20419 {
20420 /* See if this is an Objective-C type. */
20425 }
20427 /* Issue an error if we did not find a type-name. */
20429 /* In Objective-C, we have the complication that class names are
20430 normally type names and start declarations (eg, the
20431 "NSObject" in "NSObject *object;"), but can be used in an
20432 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
20433 is an expression. So, a classname followed by a dot is not a
20434 valid type-name. */
20437 {
20442 }
20443 /* Remember that the name was used in the definition of the
20444 current class so that we can check later to see if the
20445 meaning would have been different after the class was
20446 entirely defined. */
20452 }
20454 /* Parse an elaborated-type-specifier. Note that the grammar given
20455 here incorporates the resolution to DR68.
20457 elaborated-type-specifier:
20458 class-key :: [opt] nested-name-specifier [opt] identifier
20459 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
20460 enum-key :: [opt] nested-name-specifier [opt] identifier
20461 typename :: [opt] nested-name-specifier identifier
20462 typename :: [opt] nested-name-specifier template [opt]
20463 template-id
20465 GNU extension:
20467 elaborated-type-specifier:
20468 class-key attributes :: [opt] nested-name-specifier [opt] identifier
20469 class-key attributes :: [opt] nested-name-specifier [opt]
20470 template [opt] template-id
20471 enum attributes :: [opt] nested-name-specifier [opt] identifier
20473 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
20474 declared `friend'. If IS_DECLARATION is TRUE, then this
20475 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
20476 something is being declared.
20478 Returns the TYPE specified. */
20480 static tree
20484 {
20486 tree identifier;
20489 tree globalscope;
20492 /* For class and enum types the location of the class-key or enum-key. */
20494 /* For a scoped enum, the 'class' or 'struct' keyword id. */
20497 /* See if we're looking at the `enum' keyword. */
20499 {
20500 /* Consume the `enum' token. */
20502 /* Remember that it's an enumeration type. */
20504 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
20505 enums) is used here. */
20509 {
20517 /* Consume the `struct' or `class' and parse it anyway. */
20519 /* Create a combined location for the whole scoped-enum-key. */
20521 }
20522 else
20525 /* Parse the attributes. */
20527 }
20528 /* Or, it might be `typename'. */
20530 RID_TYPENAME))
20531 {
20532 /* Consume the `typename' token. */
20534 /* Remember that it's a `typename' type. */
20536 }
20537 /* Otherwise it must be a class-key. */
20538 else
20539 {
20544 /* Parse the attributes. */
20546 }
20548 /* Look for the `::' operator. */
20551 /* Look for the nested-name-specifier. */
20552 tree nested_name_specifier;
20554 {
20555 nested_name_specifier
20560 is_declaration);
20563 }
20564 else
20565 /* Even though `typename' is not present, the proposed resolution
20566 to Core Issue 180 says that in `class A<T>::B', `B' should be
20567 considered a type-name, even if `A<T>' is dependent. */
20568 nested_name_specifier
20573 is_declaration);
20574 /* For everything but enumeration types, consider a template-id.
20575 For an enumeration type, consider only a plain identifier. */
20577 {
20579 tree decl;
20581 /* Allow the `template' keyword. */
20583 /* If we didn't see `template', we don't know if there's a
20584 template-id or not. */
20587 /* The `template' keyword must follow a nested-name-specifier. */
20589 {
20593 }
20595 /* Parse the template-id. */
20599 tag_type,
20600 is_declaration);
20601 /* If we didn't find a template-id, look for an ordinary
20602 identifier. */
20604 ;
20605 /* We can get here when cp_parser_template_id, called by
20606 cp_parser_class_name with tag_type == none_type, succeeds
20607 and caches a BASELINK. Then, when called again here,
20608 instead of failing and returning an error_mark_node
20609 returns it (see template/typename17.C in C++11).
20610 ??? Could we diagnose this earlier? */
20612 {
20615 }
20616 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
20617 in effect, then we must assume that, upon instantiation, the
20618 template will correspond to a class. */
20622 typename_type,
20624 /* If the `typename' keyword is in effect and DECL is not a type
20625 decl, then type is non existent. */
20627 ;
20629 {
20633 /* If the next token is a semicolon, this must be a specialization,
20634 instantiation, or friend declaration. Check the scope while we
20635 still know whether or not we had a nested-name-specifier. */
20640 }
20643 }
20646 {
20651 {
20654 }
20656 /* For a `typename', we needn't call xref_tag. */
20662 /* Template parameter lists apply only if we are not within a
20663 function parameter list. */
20664 bool template_parm_lists_apply
20673 /* Look up a qualified name in the usual way. */
20675 {
20676 tree decl;
20677 tree ambiguous_decls;
20680 tag_type,
20687 /* If the lookup was ambiguous, an error will already have been
20688 issued. */
20692 /* If we are parsing friend declaration, DECL may be a
20693 TEMPLATE_DECL tree node here. However, we need to check
20694 whether this TEMPLATE_DECL results in valid code. Consider
20695 the following example:
20697 namespace N {
20698 template <class T> class C {};
20699 }
20700 class X {
20701 template <class T> friend class N::C; // #1, valid code
20702 };
20703 template <class T> class Y {
20704 friend class N::C; // #2, invalid code
20705 };
20707 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
20708 name lookup of `N::C'. We see that friend declaration must
20709 be template for the code to be valid. Note that
20710 processing_template_decl does not work here since it is
20711 always 1 for the above two cases. */
20713 decl = (cp_parser_maybe_treat_template_as_class
20718 {
20720 identifier,
20723 }
20726 {
20730 allow_template);
20734 }
20736 /* Forward declarations of nested types, such as
20738 class C1::C2;
20739 class C1::C2::C3;
20741 are invalid unless all components preceding the final '::'
20742 are complete. If all enclosing types are complete, these
20743 declarations become merely pointless.
20745 Invalid forward declarations of nested types are errors
20746 caught elsewhere in parsing. Those that are pointless arrive
20747 here. */
20755 }
20756 else
20757 {
20758 /* An elaborated-type-specifier sometimes introduces a new type and
20759 sometimes names an existing type. Normally, the rule is that it
20760 introduces a new type only if there is not an existing type of
20761 the same name already in scope. For example, given:
20763 struct S {};
20764 void f() { struct S s; }
20766 the `struct S' in the body of `f' is the same `struct S' as in
20767 the global scope; the existing definition is used. However, if
20768 there were no global declaration, this would introduce a new
20769 local class named `S'.
20771 An exception to this rule applies to the following code:
20773 namespace N { struct S; }
20775 Here, the elaborated-type-specifier names a new type
20776 unconditionally; even if there is already an `S' in the
20777 containing scope this declaration names a new type.
20778 This exception only applies if the elaborated-type-specifier
20779 forms the complete declaration:
20781 [class.name]
20783 A declaration consisting solely of `class-key identifier ;' is
20784 either a redeclaration of the name in the current scope or a
20785 forward declaration of the identifier as a class name. It
20786 introduces the name into the current scope.
20788 We are in this situation precisely when the next token is a `;'.
20790 An exception to the exception is that a `friend' declaration does
20791 *not* name a new type; i.e., given:
20793 struct S { friend struct T; };
20795 `T' is not a new type in the scope of `S'.
20797 Also, `new struct S' or `sizeof (struct S)' never results in the
20798 definition of a new type; a new type can only be declared in a
20799 declaration context. */
20801 TAG_how how;
20804 /* Friends have special name lookup rules. */
20808 CPP_SEMICOLON))
20809 /* This is a `class-key identifier ;' */
20811 else
20815 (template_parm_lists_apply
20818 /* An unqualified name was used to reference this type, so
20819 there were no qualifying templates. */
20829 }
20830 }
20835 /* Allow attributes on forward declarations of classes. */
20837 {
20848 {
20852 }
20855 else
20857 "attributes ignored on elaborated-type-specifier that is "
20859 }
20863 else
20864 {
20865 /* Diagnose class/struct/union mismatches. IS_DECLARATION is false
20866 for alias definition. */
20870 decl_class);
20872 /* Indicate whether this class was declared as a `class' or as a
20873 `struct'. */
20876 }
20878 /* A "<" cannot follow an elaborated type specifier. If that
20879 happens, the user was probably trying to form a template-id. */
20884 }
20886 /* Parse an enum-specifier.
20888 enum-specifier:
20889 enum-head { enumerator-list [opt] }
20890 enum-head { enumerator-list , } [C++0x]
20892 enum-head:
20893 enum-key identifier [opt] enum-base [opt]
20894 enum-key nested-name-specifier identifier enum-base [opt]
20896 enum-key:
20897 enum
20898 enum class [C++0x]
20899 enum struct [C++0x]
20901 enum-base: [C++0x]
20902 : type-specifier-seq
20904 opaque-enum-specifier:
20905 enum-key identifier enum-base [opt] ;
20907 GNU Extensions:
20908 enum-key attributes[opt] identifier [opt] enum-base [opt]
20909 { enumerator-list [opt] }attributes[opt]
20910 enum-key attributes[opt] identifier [opt] enum-base [opt]
20911 { enumerator-list, }attributes[opt] [C++0x]
20913 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
20914 if the token stream isn't an enum-specifier after all. */
20916 static tree
20918 {
20919 tree identifier;
20921 tree prev_scope;
20923 tree attributes;
20934 /* Parse tentatively so that we can back up if we don't find a
20935 enum-specifier. */
20938 /* Caller guarantees that the current token is 'enum', an identifier
20939 possibly follows, and the token after that is an opening brace.
20940 If we don't have an identifier, fabricate an anonymous name for
20941 the enumeration being defined. */
20944 /* Parse the "class" or "struct", which indicates a scoped
20945 enumeration type in C++0x. */
20948 {
20952 /* Consume the `struct' or `class' token. */
20956 }
20960 /* Clear the qualification. */
20965 /* Figure out in what scope the declaration is being placed. */
20971 nested_name_specifier
20979 {
20980 tree name;
20984 enum_type,
20989 input_location);
20991 {
20994 {
20995 /* Are template enums allowed in ISO? */
20999 /* ignore a typename reference, for it will be solved by name
21000 in start_enum. */
21002 }
21003 }
21006 else
21007 {
21012 }
21013 }
21014 else
21015 {
21018 else
21019 {
21025 }
21026 }
21029 /* Check for the `:' that denotes a specified underlying type in C++0x.
21030 Note that a ':' could also indicate a bitfield width, however. */
21033 {
21034 cp_decl_specifier_seq type_specifiers;
21036 /* Consume the `:'. */
21040 auto tdf
21044 /* Parse the type-specifier-seq. */
21050 /* At this point this is surely not elaborated type specifier. */
21059 /* If that didn't work, stop. */
21061 {
21067 }
21068 }
21070 /* Look for the `{' but don't consume it yet. */
21072 {
21074 {
21080 }
21081 /* An opaque-enum-specifier must have a ';' here. */
21084 {
21087 OPT_Welaborated_enum_base,
21088 "declaration of enumeration with "
21089 "fixed underlying type and no enumerator list is "
21091 else
21093 }
21094 }
21100 {
21102 {
21106 }
21109 }
21111 /* Issue an error message if type-definitions are forbidden here. */
21114 else
21115 /* Create the new type. We do this before consuming the opening
21116 brace so the enum will be recorded as being on the line of its
21117 tag (or the 'enum' keyword, if there is no tag). */
21121 /* If the next token is not '{' it is an opaque-enum-specifier or an
21122 elaborated-type-specifier. */
21124 {
21129 {
21130 /* The following catches invalid code such as:
21131 enum class S<int>::E { A, B, C }; */
21139 {
21143 nested_name_specifier);
21145 }
21148 {
21150 "%qT for enum declaration does not name a class "
21153 }
21154 /* If that scope does not contain the scope in which the
21155 class was originally declared, the program is invalid. */
21157 nested_name_specifier))
21158 {
21161 "declaration of %qD in namespace %qD which does not "
21164 else
21166 "declaration of %qD in %qD which does not "
21170 }
21171 /* If that scope is the scope where the declaration is being placed
21172 the program is invalid. */
21176 {
21180 }
21181 }
21186 /* Consume the opening brace. */
21187 matching_braces braces;
21194 {
21198 }
21199 else
21200 {
21206 }
21210 /* If the next token is not '}', then there are some enumerators. */
21212 {
21214 /* Don't warn for enum {} a; here. */
21218 }
21219 else
21220 {
21221 /* We've seen a '{' so we know we're in an enum-specifier.
21222 Commit to any tentative parse to get syntax errors. */
21225 }
21227 /* Consume the final '}'. */
21232 }
21233 else
21234 {
21235 /* If a ';' follows, then it is an opaque-enum-specifier
21236 and additional restrictions apply. */
21238 {
21245 }
21246 }
21248 /* Look for trailing attributes to apply to this enumeration, and
21249 apply them if appropriate. */
21251 {
21254 trailing_attr,
21256 }
21258 /* Finish up the enumeration. */
21260 {
21265 }
21268 {
21270 {
21273 }
21276 }
21278 }
21280 /* Parse an enumerator-list. The enumerators all have the indicated
21281 TYPE.
21283 enumerator-list:
21284 enumerator-definition
21285 enumerator-list , enumerator-definition */
21287 static void
21289 {
21291 {
21292 /* Parse an enumerator-definition. */
21295 /* If the next token is not a ',', we've reached the end of
21296 the list. */
21299 /* Otherwise, consume the `,' and keep going. */
21301 /* If the next token is a `}', there is a trailing comma. */
21303 {
21308 }
21309 }
21310 }
21312 /* Parse an enumerator-definition. The enumerator has the indicated
21313 TYPE.
21315 enumerator-definition:
21316 enumerator
21317 enumerator = constant-expression
21319 enumerator:
21320 identifier
21322 GNU Extensions:
21324 enumerator-definition:
21325 enumerator attributes [opt]
21326 enumerator attributes [opt] = constant-expression */
21328 static void
21330 {
21331 tree identifier;
21332 tree value;
21333 location_t loc;
21335 /* Save the input location because we are interested in the location
21336 of the identifier and not the location of the explicit value. */
21339 /* Look for the identifier. */
21344 /* Parse any specified attributes. */
21347 /* If the next token is an '=', then there is an explicit value. */
21349 {
21350 /* Consume the `=' token. */
21352 /* Parse the value. */
21354 }
21355 else
21358 /* If we are processing a template, make sure the initializer of the
21359 enumerator doesn't contain any bare template parameter pack. */
21361 {
21362 /* In a lambda it should work, but doesn't currently. */
21364 {
21367 }
21368 }
21372 /* Create the enumerator. */
21374 }
21376 /* Parse a namespace-name.
21378 namespace-name:
21379 original-namespace-name
21380 namespace-alias
21382 Returns the NAMESPACE_DECL for the namespace. */
21384 static tree
21386 {
21387 tree identifier;
21388 tree namespace_decl;
21392 /* Get the name of the namespace. */
21397 /* Look up the identifier in the currently active scope. Look only
21398 for namespaces, due to:
21400 [basic.lookup.udir]
21402 When looking up a namespace-name in a using-directive or alias
21403 definition, only namespace names are considered.
21405 And:
21407 [basic.lookup.qual]
21409 During the lookup of a name preceding the :: scope resolution
21410 operator, object, function, and enumerator names are ignored.
21412 (Note that cp_parser_qualifying_entity only calls this
21413 function if the token after the name is the scope resolution
21414 operator.) */
21416 none_type,
21422 /* If it's not a namespace, issue an error. */
21425 {
21427 {
21428 auto_diagnostic_group d;
21429 name_hint hint;
21433 identifier,
21436 {
21442 }
21443 else
21445 identifier);
21446 }
21447 else
21450 }
21453 }
21455 /* Parse a namespace-definition.
21457 namespace-definition:
21458 named-namespace-definition
21459 unnamed-namespace-definition
21461 named-namespace-definition:
21462 original-namespace-definition
21463 extension-namespace-definition
21465 original-namespace-definition:
21466 namespace identifier { namespace-body }
21468 extension-namespace-definition:
21469 namespace original-namespace-name { namespace-body }
21471 unnamed-namespace-definition:
21472 namespace { namespace-body } */
21474 static void
21476 {
21477 tree identifier;
21487 {
21490 }
21492 /* Look for the `namespace' keyword. */
21493 cp_token* token
21496 /* Parse any specified attributes before the identifier. */
21500 {
21504 RID_INLINE);
21506 {
21510 "definitions only available with %<-std=c++20%> or "
21513 }
21516 {
21521 "standard attributes on namespaces must precede "
21524 /* Parse any attributes specified after the identifier. */
21526 }
21529 {
21530 /* Don't forget that the innermost namespace might have been
21531 marked as inline. Use |= because we cannot overwrite
21532 IS_INLINE in case the outermost namespace is inline, but
21533 there are no nested inlines. */
21536 }
21540 "nested namespace definitions only available with "
21543 /* Nested namespace names can create new namespaces (unlike
21544 other qualified-ids). */
21549 else
21552 }
21564 /* Start the namespace. */
21571 /* Look for the `{' to validate starting the namespace. */
21572 matching_braces braces;
21574 {
21575 /* Parse the body of the namespace. */
21578 /* Look for the final `}'. */
21580 }
21585 /* Pop the nested namespace definitions. */
21588 }
21590 /* Parse a namespace-body.
21592 namespace-body:
21593 declaration-seq [opt] */
21595 static void
21597 {
21599 }
21601 /* Parse a namespace-alias-definition.
21603 namespace-alias-definition:
21604 namespace identifier = qualified-namespace-specifier ; */
21606 static void
21608 {
21609 tree identifier;
21610 tree namespace_specifier;
21614 /* Look for the `namespace' keyword. */
21616 /* Look for the identifier. */
21620 /* Look for the `=' token. */
21623 {
21625 /* Skip the definition. */
21630 }
21632 /* Look for the qualified-namespace-specifier. */
21633 namespace_specifier
21636 /* Look for the `;' token. */
21639 /* Register the alias in the symbol table. */
21641 }
21643 /* Parse a qualified-namespace-specifier.
21645 qualified-namespace-specifier:
21646 :: [opt] nested-name-specifier [opt] namespace-name
21648 Returns a NAMESPACE_DECL corresponding to the specified
21649 namespace. */
21651 static tree
21653 {
21654 /* Look for the optional `::'. */
21658 /* Look for the optional nested-name-specifier. */
21666 }
21668 /* Subroutine of cp_parser_using_declaration. */
21670 static tree
21672 {
21675 {
21676 /* Create the USING_DECL. */
21685 /* Add it to the list of members in this class. */
21687 }
21688 else
21691 }
21693 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
21694 access declaration.
21696 using-declaration:
21697 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
21698 using :: unqualified-id ;
21700 access-declaration:
21701 qualified-id ;
21703 */
21705 static bool
21708 {
21712 tree identifier;
21713 tree qscope;
21718 {
21721 }
21722 else
21723 {
21724 /* Look for the `using' keyword. */
21727 again:
21728 /* Peek at the next token. */
21730 /* See if it's `typename'. */
21732 {
21733 /* Remember that we've seen it. */
21735 /* Consume the `typename' token. */
21737 }
21738 }
21740 /* Look for the optional global scope qualification. */
21741 global_scope_p
21746 /* If we saw `typename', or didn't see `::', then there must be a
21747 nested-name-specifier present. */
21749 {
21755 {
21758 }
21759 }
21760 /* Otherwise, we could be in either of the two productions. In that
21761 case, treat the nested-name-specifier as optional. */
21762 else
21776 /* If the qualifying scope of an access-declaration isn't a class
21777 or enumeration type then it can't be valid. */
21781 /* Something has already gone wrong; there's no need to parse
21782 further. Since an error has occurred, the return value of
21783 cp_parser_parse_definitely will be false, as required. */
21787 /* Parse the unqualified-id. */
21795 {
21800 }
21802 {
21806 "pack expansion in using-declaration only available "
21809 /* A parameter pack can appear in the qualifying scope, and/or in the
21810 terminal name (if naming a conversion function). Logically they're
21811 part of a single pack expansion of the overall USING_DECL, but we
21812 express them as separate pack expansions within the USING_DECL since
21813 we can't create a pack expansion over a USING_DECL. */
21816 {
21819 }
21823 {
21827 }
21829 {
21830 /* Issue an error in terms using a SCOPE_REF that includes both
21831 components. */
21832 tree name
21837 }
21838 }
21840 /* The function we call to handle a using-declaration is different
21841 depending on what scope we are in. */
21843 ;
21846 /* [namespace.udecl]
21848 A using declaration shall not name a template-id. */
21851 else
21852 {
21856 {
21859 }
21860 }
21864 {
21868 "comma-separated list in using-declaration only available "
21871 }
21873 /* Look for the final `;'. */
21878 "access declarations are deprecated "
21879 "in favour of using-declarations; "
21883 }
21885 /* C++20 using enum declaration.
21887 using-enum-declaration :
21888 using elaborated-enum-specifier ; */
21890 static void
21892 {
21895 /* Using cp_parser_elaborated_type_specifier rejects typedef-names, which
21896 breaks one of the motivating examples in using-enum-5.C.
21897 cp_parser_simple_type_specifier seems to be closer to what we actually
21898 want, though that hasn't been properly specified yet. */
21900 /* Consume 'enum'. */
21906 tree type = (cp_parser_simple_type_specifier
21913 {
21916 }
21920 /* The elaborated-enum-specifier shall not name a dependent type and the type
21921 shall have a reachable enum-specifier. */
21935 {
21937 auto_diagnostic_group g;
21941 ;
21944 else
21946 }
21948 /* A using-enum-declaration introduces the enumerator names of the named
21949 enumeration as if by a using-declaration for each enumerator. */
21953 }
21955 /* Parse an alias-declaration.
21957 alias-declaration:
21958 using identifier attribute-specifier-seq [opt] = type-id */
21960 static tree
21962 {
21966 cp_decl_specifier_seq decl_specs;
21970 /* Look for the `using' keyword. */
21971 cp_token *using_token
21993 /* Now we are going to parse the type-id of the declaration. */
21995 /*
21996 [dcl.type]/3 says:
21998 "A type-specifier-seq shall not define a class or enumeration
21999 unless it appears in the type-id of an alias-declaration (7.1.3) that
22000 is not the declaration of a template-declaration."
22002 In other words, if we currently are in an alias template, the
22003 type-id should not define a type.
22005 So let's set parser->type_definition_forbidden_message in that
22006 case; cp_parser_check_type_definition (called by
22007 cp_parser_class_specifier) will then emit an error if a type is
22008 defined in the type-id. */
22010 {
22014 }
22019 /* Restore the error message if need be. */
22025 {
22028 }
22030 /* A typedef-name can also be introduced by an alias-declaration. The
22031 identifier following the using keyword becomes a typedef-name. It has
22032 the same semantics as if it were introduced by the typedef
22033 specifier. In particular, it does not define a new type and it shall
22034 not appear in the type-id. */
22039 {
22042 ds_attribute,
22043 attrs_token);
22044 }
22046 ds_typedef,
22047 using_token);
22049 ds_alias,
22050 using_token);
22057 id_location,
22067 else
22078 /* If decl is a template, return its TEMPLATE_DECL so that it gets
22079 added into the symbol table; otherwise, return the TYPE_DECL. */
22083 {
22087 }
22090 }
22092 /* Parse a using-directive.
22094 using-directive:
22095 attribute-specifier-seq [opt] using namespace :: [opt]
22096 nested-name-specifier [opt] namespace-name ; */
22098 static void
22100 {
22101 tree namespace_decl;
22104 {
22105 /* Error during attribute parsing that resulted in skipping
22106 to next semicolon. */
22109 }
22111 /* Look for the `using' keyword. */
22113 /* And the `namespace' keyword. */
22115 /* Look for the optional `::' operator. */
22117 /* And the optional nested-name-specifier. */
22123 /* Get the namespace being used. */
22126 /* And any specified GNU attributes. */
22130 /* Update the symbol table. */
22133 /* Look for the final `;'. */
22135 }
22137 /* Parse an asm-definition.
22139 asm-qualifier:
22140 volatile
22141 inline
22142 goto
22144 asm-qualifier-list:
22145 asm-qualifier
22146 asm-qualifier-list asm-qualifier
22148 asm-definition:
22149 asm ( string-literal ) ;
22151 GNU Extension:
22153 asm-definition:
22154 asm asm-qualifier-list [opt] ( string-literal ) ;
22155 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt] ) ;
22156 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22157 : asm-operand-list [opt] ) ;
22158 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22159 : asm-operand-list [opt]
22160 : asm-clobber-list [opt] ) ;
22161 asm asm-qualifier-list [opt] ( string-literal : : asm-operand-list [opt]
22162 : asm-clobber-list [opt]
22163 : asm-goto-list ) ;
22165 The form with asm-goto-list is valid if and only if the asm-qualifier-list
22166 contains goto, and is the only allowed form in that case. No duplicates are
22167 allowed in an asm-qualifier-list. */
22169 static void
22171 {
22176 tree asm_stmt;
22183 /* Look for the `asm' keyword. */
22186 /* In C++20, unevaluated inline assembly is permitted in constexpr
22187 functions. */
22192 "function only available with %<-std=c++20%> or "
22195 /* Handle the asm-qualifier-list. */
22203 {
22207 {
22210 {
22214 }
22215 else
22216 {
22221 }
22227 {
22231 }
22232 else
22241 {
22245 }
22246 else
22261 }
22263 }
22270 {
22273 }
22275 /* Look for the opening `('. */
22278 /* Look for the string. */
22282 {
22286 }
22288 /* If we're allowing GNU extensions, check for the extended assembly
22289 syntax. Unfortunately, the `:' tokens need not be separated by
22290 a space in C, and so, for compatibility, we tolerate that here
22291 too. Doing that means that we have to treat the `::' operator as
22292 two `:' tokens. */
22297 {
22302 /* The extended syntax was used. */
22305 /* Look for outputs. */
22307 {
22308 /* Consume the `:'. */
22310 /* Parse the output-operands. */
22312 CPP_COLON)
22314 CPP_SCOPE)
22316 CPP_CLOSE_PAREN))
22317 {
22321 }
22322 }
22323 /* If the next token is `::', there are no outputs, and the
22324 next token is the beginning of the inputs. */
22326 /* The inputs are coming next. */
22329 /* Look for inputs. */
22332 {
22333 /* Consume the `:' or `::'. */
22335 /* Parse the output-operands. */
22337 CPP_COLON)
22339 CPP_SCOPE)
22341 CPP_CLOSE_PAREN))
22342 {
22346 }
22347 }
22349 /* The clobbers are coming next. */
22352 /* Look for clobbers. */
22355 {
22357 /* Consume the `:' or `::'. */
22359 /* Parse the clobbers. */
22361 CPP_COLON)
22363 CPP_CLOSE_PAREN))
22365 }
22367 /* The labels are coming next. */
22370 /* Look for labels. */
22373 {
22375 /* Consume the `:' or `::'. */
22377 /* Parse the labels. */
22379 }
22383 }
22387 /* Look for the closing `)'. */
22395 {
22396 /* Create the ASM_EXPR. */
22398 {
22401 /* If the extended syntax was not used, mark the ASM_EXPR. */
22403 {
22409 }
22410 }
22411 else
22413 }
22414 }
22416 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
22417 type that comes from the decl-specifier-seq. */
22419 static tree
22421 {
22424 {
22437 }
22440 }
22442 /* Warn about the most vexing parse syntactic ambiguity, i.e., warn when
22443 a construct looks like a variable definition but is actually a function
22444 declaration. DECL_SPECIFIERS is the decl-specifier-seq and DECLARATOR
22445 is the declarator for this function declaration. */
22447 static void
22450 {
22451 /* Only warn if we are declaring a function at block scope. */
22455 /* And only if there is no storage class specified. */
22467 /* Don't warn when the whole declarator (not just the declarator-id!)
22468 was parenthesized. That is, don't warn for int(n()) but do warn
22469 for int(f)(). */
22473 tree type;
22475 {
22480 /* If the return type is void there is no ambiguity. */
22483 }
22485 /* Code like long f(); will have null ->type. If we have any
22486 type-specifiers, pretend we've seen int. */
22488 else
22491 auto_diagnostic_group d;
22496 /* The T t() case. */
22498 {
22500 "empty parentheses were disambiguated as a function "
22502 {
22503 /* () means value-initialization (C++03 and up); {} (C++11 and up)
22504 means value-initialization or aggregate-initialization, nothing
22505 means default-initialization. We can only suggest removing the
22506 parentheses/adding {} if T has a default constructor. */
22508 {
22514 {
22518 else
22521 }
22522 }
22523 }
22525 }
22527 /* If we had (...) or the parameter-list wasn't parenthesized,
22528 we're done. */
22532 /* The T t(X()) case. */
22534 {
22536 "parentheses were disambiguated as a function "
22538 {
22540 /* {}-initialization means that we can use an initializer-list
22541 constructor if no default constructor is available, so don't
22542 suggest using {} for classes that have an initializer_list
22543 constructor. */
22545 {
22550 }
22551 else
22552 {
22556 }
22557 }
22558 }
22559 /* The T t(X(), X()) case. */
22561 "parentheses were disambiguated as a function "
22563 {
22566 {
22571 }
22572 }
22573 }
22575 /* If DECLARATOR with DECL_SPECS is a function declarator that has
22576 the form of a deduction guide, tag it as such. CTOR_DTOR_OR_CONV_P
22577 has the same meaning as in cp_parser_declarator. */
22579 static void
22584 {
22590 {
22598 {
22602 }
22603 }
22604 }
22606 /* Declarators [gram.dcl.decl] */
22608 /* Parse an init-declarator.
22610 init-declarator:
22611 declarator initializer [opt]
22613 GNU Extension:
22615 init-declarator:
22616 declarator asm-specification [opt] attributes [opt] initializer [opt]
22618 function-definition:
22619 decl-specifier-seq [opt] declarator ctor-initializer [opt]
22620 function-body
22621 decl-specifier-seq [opt] declarator function-try-block
22623 GNU Extension:
22625 function-definition:
22626 __extension__ function-definition
22628 TM Extension:
22630 function-definition:
22631 decl-specifier-seq [opt] declarator function-transaction-block
22633 The parser flags FLAGS is used to control type-specifier parsing.
22635 The DECL_SPECIFIERS apply to this declarator. Returns a
22636 representation of the entity declared. If MEMBER_P is TRUE, then
22637 this declarator appears in a class scope. The new DECL created by
22638 this declarator is returned.
22640 The CHECKS are access checks that should be performed once we know
22641 what entity is being declared (and, therefore, what classes have
22642 befriended it).
22644 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
22645 for a function-definition here as well. If the declarator is a
22646 declarator for a function-definition, *FUNCTION_DEFINITION_P will
22647 be TRUE upon return. By that point, the function-definition will
22648 have been completely parsed.
22650 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
22651 is FALSE.
22653 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
22654 parsed declaration if it is an uninitialized single declarator not followed
22655 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
22656 if present, will not be consumed. If returned, this declarator will be
22657 created with SD_INITIALIZED but will not call cp_finish_decl.
22659 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
22660 and there is an initializer, the pointed location_t is set to the
22661 location of the '=' or `(', or '{' in C++11 token introducing the
22662 initializer. */
22664 static tree
22666 cp_parser_flags flags,
22676 {
22680 tree prefix_attributes;
22682 tree asm_specification;
22683 tree initializer;
22685 tree scope;
22687 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
22688 initialized with "= ..", CPP_OPEN_PAREN if initialized with
22689 "(...)". */
22704 /* Assume that this is not the declarator for a function
22705 definition. */
22709 /* Default arguments are only permitted for function parameters. */
22713 /* Defer access checks while parsing the declarator; we cannot know
22714 what names are accessible until we know what is being
22715 declared. */
22720 /* Parse the declarator. */
22721 declarator
22726 /* Gather up the deferred checks. */
22731 /* If the DECLARATOR was erroneous, there's no need to go
22732 further. */
22736 /* Check that the number of template-parameter-lists is OK. */
22746 /* Figure out what scope the entity declared by the DECLARATOR is
22747 located in. `grokdeclarator' sometimes changes the scope, so
22748 we compute it now. */
22751 /* Perform any lookups in the declared type which were thought to be
22752 dependent, but are not in the scope of the declarator. */
22753 decl_specifiers->type
22756 /* If we're allowing GNU extensions, look for an
22757 asm-specification. */
22759 {
22760 /* Look for an asm-specification. */
22763 }
22764 else
22767 /* Gather the attributes that were provided with the
22768 decl-specifiers. */
22771 /* Look for attributes. */
22775 /* Peek at the next token. */
22781 {
22782 /* Handle C++17 deduction guides. Note that class-scope
22783 non-template deduction guides are instead handled in
22784 cp_parser_member_declaration. */
22786 decl_specifiers,
22787 declarator,
22793 /* Check to see if the token indicates the start of a
22794 function-definition. */
22796 {
22798 {
22799 /* If a function-definition should not appear here, issue an
22800 error message. */
22804 }
22806 location_t func_brace_location
22809 /* Neither attributes nor an asm-specification are allowed
22810 on a function-definition. */
22813 "an %<asm%> specification is not allowed "
22817 "attributes are not allowed "
22819 /* This is a function-definition. */
22822 /* Parse the function definition. */
22825 decl_specifiers,
22826 declarator,
22827 prefix_attributes);
22828 else
22829 decl =
22830 (cp_parser_function_definition_from_specifiers_and_declarator
22834 {
22835 /* This is where the prologue starts... */
22838 }
22841 }
22842 }
22844 {
22845 /* A non-template declaration involving a function parameter list
22846 containing an implicit template parameter will be made into a
22847 template. If the resulting declaration is not going to be an
22848 actual function then finish the template scope here to prevent it.
22849 An error message will be issued once we have a decl to talk about.
22851 FIXME probably we should do type deduction rather than create an
22852 implicit template, but the standard currently doesn't allow it. */
22855 }
22857 /* [dcl.dcl]
22859 Only in function declarations for constructors, destructors, type
22860 conversions, and deduction guides can the decl-specifier-seq be omitted.
22862 We explicitly postpone this check past the point where we handle
22863 function-definitions because we tolerate function-definitions
22864 that are missing their return types in some modes. */
22866 {
22870 }
22872 /* An `=' or an '{' in C++11, indicate an initializer. An '(' may indicate
22873 an initializer as well. */
22877 {
22878 /* Don't get fooled into thinking that F(i)(1)(2) is an initializer.
22879 It isn't; it's an expression. (Here '(i)' would have already been
22880 parsed as a declarator.) */
22883 {
22890 /* If this is an initializer, only a ',' or ';' can follow: either
22891 we have another init-declarator, or we're at the end of an
22892 init-declarator-list which can only be followed by a ';'. */
22897 /* Not an init-declarator. */
22899 }
22911 {
22917 }
22918 }
22919 else
22920 {
22921 /* If the init-declarator isn't initialized and isn't followed by a
22922 `,' or `;', it's not a valid init-declarator. */
22925 {
22928 else
22929 {
22933 }
22934 }
22937 }
22939 /* Because start_decl has side-effects, we should only call it if we
22940 know we're going ahead. By this point, we know that we cannot
22941 possibly be looking at any other construct. */
22944 /* Enter the newly declared entry in the symbol table. If we're
22945 processing a declaration in a class-specifier, we wait until
22946 after processing the initializer. */
22948 {
22956 /* Adjust location of decl if declarator->id_loc is more appropriate:
22957 set, and decl wasn't merged with another decl, in which case its
22958 location would be different from input_location, and more accurate. */
22963 }
22965 /* Enter the SCOPE. That way unqualified names appearing in the
22966 initializer will be looked up in SCOPE. */
22969 /* Perform deferred access control checks, now that we know in which
22970 SCOPE the declared entity resides. */
22972 {
22975 /* If the entity being declared is a function, pretend that we
22976 are in its scope. If it is a `friend', it may have access to
22977 things that would not otherwise be accessible. */
22979 {
22982 }
22984 /* Perform access checks for template parameters. */
22987 /* Perform the access control checks for the declarator and the
22988 decl-specifiers. */
22991 /* Restore the saved value. */
22994 }
22996 /* Parse the initializer. */
23001 {
23003 {
23006 else
23007 {
23008 /* If the declaration was erroneous, we don't really
23009 know what the user intended, so just silently
23010 consume the initializer. */
23017 }
23018 }
23019 else
23020 {
23021 /* We want to record the extra mangling scope for in-class
23022 initializers of class members and initializers of static
23023 data member templates and namespace-scope initializers.
23024 The former involves deferring parsing of the initializer
23025 until end of class as with default arguments. So right
23026 here we only handle the latter two. */
23030 && !member_p
23043 }
23044 }
23046 /* The old parser allows attributes to appear after a parenthesized
23047 initializer. Mark Mitchell proposed removing this functionality
23048 on the GCC mailing lists on 2002-08-13. This parser accepts the
23049 attributes -- but ignores them. Made a permerror in GCC 8. */
23055 {
23058 {
23062 }
23063 }
23065 /* And now complain about a non-function implicit template. */
23070 /* For an in-class declaration, use `grokfield' to create the
23071 declaration. */
23073 {
23075 {
23078 }
23087 }
23089 /* Finish processing the declaration. But, skip member
23090 declarations. */
23092 {
23095 asm_specification,
23096 /* If the initializer is in parentheses, then this is
23097 a direct-initialization, which means that an
23098 `explicit' constructor is OK. Otherwise, an
23099 `explicit' constructor cannot be used. */
23102 }
23105 /* Core issue #226 (C++0x only): A default template-argument
23106 shall not be specified in a friend class template
23107 declaration. */
23116 {
23119 else
23121 }
23128 }
23130 /* Parse a declarator.
23132 declarator:
23133 direct-declarator
23134 ptr-operator declarator
23136 abstract-declarator:
23137 ptr-operator abstract-declarator [opt]
23138 direct-abstract-declarator
23140 GNU Extensions:
23142 declarator:
23143 attributes [opt] direct-declarator
23144 attributes [opt] ptr-operator declarator
23146 abstract-declarator:
23147 attributes [opt] ptr-operator abstract-declarator [opt]
23148 attributes [opt] direct-abstract-declarator
23150 The parser flags FLAGS is used to control type-specifier parsing.
23152 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
23153 detect constructors, destructors, deduction guides, or conversion operators.
23154 It is set to -1 if the declarator is a name, and +1 if it is a
23155 function. Otherwise it is set to zero. Usually you just want to
23156 test for >0, but internally the negative value is used.
23158 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
23159 a decl-specifier-seq unless it declares a constructor, destructor,
23160 or conversion. It might seem that we could check this condition in
23161 semantic analysis, rather than parsing, but that makes it difficult
23162 to handle something like `f()'. We want to notice that there are
23163 no decl-specifiers, and therefore realize that this is an
23164 expression, not a declaration.)
23166 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
23167 the declarator is a direct-declarator of the form "(...)".
23169 MEMBER_P is true iff this declarator is a member-declarator.
23171 FRIEND_P is true iff this declarator is a friend.
23173 STATIC_P is true iff the keyword static was seen. */
23177 cp_parser_declarator_kind dcl_kind,
23178 cp_parser_flags flags,
23182 {
23185 cp_cv_quals cv_quals;
23186 tree class_type;
23189 /* Assume this is not a constructor, destructor, or type-conversion
23190 operator. */
23197 /* Check for the ptr-operator production. */
23199 /* Parse the ptr-operator. */
23205 /* If that worked, then we have a ptr-operator. */
23207 {
23208 /* If a ptr-operator was found, then this declarator was not
23209 parenthesized. */
23212 /* The dependent declarator is optional if we are parsing an
23213 abstract-declarator. */
23217 /* Parse the dependent declarator. */
23223 /* If we are parsing an abstract-declarator, we must handle the
23224 case where the dependent declarator is absent. */
23229 declarator = cp_parser_make_indirect_declarator
23231 }
23232 /* Everything else is a direct-declarator. */
23233 else
23234 {
23237 CPP_OPEN_PAREN);
23241 }
23246 }
23248 /* Parse a direct-declarator or direct-abstract-declarator.
23250 direct-declarator:
23251 declarator-id
23252 direct-declarator ( parameter-declaration-clause )
23253 cv-qualifier-seq [opt]
23254 ref-qualifier [opt]
23255 exception-specification [opt]
23256 direct-declarator [ constant-expression [opt] ]
23257 ( declarator )
23259 direct-abstract-declarator:
23260 direct-abstract-declarator [opt]
23261 ( parameter-declaration-clause )
23262 cv-qualifier-seq [opt]
23263 ref-qualifier [opt]
23264 exception-specification [opt]
23265 direct-abstract-declarator [opt] [ constant-expression [opt] ]
23266 ( abstract-declarator )
23268 Returns a representation of the declarator. DCL_KIND is
23269 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
23270 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
23271 we are parsing a direct-declarator. It is
23272 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
23273 of ambiguity we prefer an abstract declarator, as per
23274 [dcl.ambig.res].
23275 The parser flags FLAGS is used to control type-specifier parsing.
23276 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
23277 as for cp_parser_declarator. */
23281 cp_parser_declarator_kind dcl_kind,
23282 cp_parser_flags flags,
23285 {
23296 {
23297 /* Peek at the next token. */
23300 {
23301 /* This is either a parameter-declaration-clause, or a
23302 parenthesized declarator. When we know we are parsing a
23303 named declarator, it must be a parenthesized declarator
23304 if FIRST is true. For instance, `(int)' is a
23305 parameter-declaration-clause, with an omitted
23306 direct-abstract-declarator. But `((*))', is a
23307 parenthesized abstract declarator. Finally, when T is a
23308 template parameter `(T)' is a
23309 parameter-declaration-clause, and not a parenthesized
23310 named declarator.
23312 We first try and parse a parameter-declaration-clause,
23313 and then try a nested declarator (if FIRST is true).
23315 It is not an error for it not to be a
23316 parameter-declaration-clause, even when FIRST is
23317 false. Consider,
23319 int i (int);
23320 int i (3);
23322 The first is the declaration of a function while the
23323 second is the definition of a variable, including its
23324 initializer.
23326 Having seen only the parenthesis, we cannot know which of
23327 these two alternatives should be selected. Even more
23328 complex are examples like:
23330 int i (int (a));
23331 int i (int (3));
23333 The former is a function-declaration; the latter is a
23334 variable initialization.
23336 Thus again, we try a parameter-declaration-clause, and if
23337 that fails, we back out and return. */
23340 {
23341 tree params;
23346 /* In a member-declarator, the only valid interpretation
23347 of a parenthesis is the start of a
23348 parameter-declaration-clause. (It is invalid to
23349 initialize a static data member with a parenthesized
23350 initializer; only the "=" form of initialization is
23351 permitted.) */
23355 /* Consume the `('. */
23357 matching_parens parens;
23360 {
23361 /* If this is going to be an abstract declarator, we're
23362 in a declarator and we can't have default args. */
23365 }
23369 /* Parse the parameter-declaration-clause. */
23370 params
23372 const location_t parens_end
23375 /* Consume the `)'. */
23378 /* If all went well, parse the cv-qualifier-seq,
23379 ref-qualifier and the exception-specification. */
23381 {
23382 cp_cv_quals cv_quals;
23383 cp_virt_specifiers virt_specifiers;
23384 cp_ref_qualifier ref_qual;
23385 tree exception_specification;
23386 tree late_return;
23387 tree attrs;
23390 unsigned char local_variables_forbidden_p
23392 /* 'this' is not allowed in static member functions. */
23402 /* Parse the cv-qualifier-seq. */
23404 /* Parse the ref-qualifier. */
23406 /* Parse the tx-qualifier. */
23412 /* DR 1207: 'this' is in scope after the cv-quals. */
23415 /* If it turned out that this is e.g. a pointer to a
23416 function, we don't want to delay noexcept parsing. */
23420 /* Parse the exception-specification. */
23421 exception_specification
23423 flags);
23427 cp_omp_declare_simd_data odsd;
23429 && declarator
23432 {
23436 }
23438 /* In here, we handle cases where attribute is used after
23439 the function declaration. For example:
23440 void func (int x) __attribute__((vector(..))); */
23443 late_return
23445 requires_clause);
23449 /* Parse the virt-specifier-seq. */
23453 parens_start,
23454 parens_end);
23455 /* Create the function-declarator. */
23457 params,
23458 cv_quals,
23459 virt_specifiers,
23460 ref_qual,
23461 tx_qual,
23462 exception_specification,
23463 late_return,
23464 requires_clause,
23465 attrs,
23466 parens_loc);
23468 /* Any subsequent parameter lists are to do with
23469 return type, so are not those of the declared
23470 function. */
23476 /* Restore the state of local_variables_forbidden_p. */
23477 parser->local_variables_forbidden_p
23479 }
23481 /* Remove the function parms from scope. */
23485 /* Repeat the main loop. */
23487 }
23489 /* If this is the first, we can try a parenthesized
23490 declarator. */
23492 {
23499 /* Consume the `('. */
23500 matching_parens parens;
23502 /* Parse the nested declarator. */
23505 declarator
23507 ctor_dtor_or_conv_p,
23513 /* Expect a `)'. */
23521 }
23522 /* Otherwise, we must be done. */
23523 else
23525 }
23529 {
23530 /* Parse an array-declarator. */
23540 /* Consume the `['. */
23542 /* Peek at the next token. */
23544 /* If the next token is `]', then there is no
23545 constant-expression. */
23547 {
23549 bounds
23561 {
23562 /* Normally, the array bound must be an integral constant
23563 expression. However, as an extension, we allow VLAs
23564 in function scopes as long as they aren't part of a
23565 parameter declaration. */
23569 }
23572 {
23573 /* Remember this wasn't a constant-expression. */
23576 }
23577 }
23578 else
23580 /* Look for the closing `]'. */
23582 {
23585 }
23590 }
23592 {
23593 {
23594 tree qualifying_scope;
23595 tree unqualified_name;
23596 tree attrs;
23597 special_function_kind sfk;
23602 /* Parse a declarator-id */
23605 {
23608 /* If we see an ellipsis, we should be looking at a
23609 parameter pack. */
23611 {
23612 /* Consume the `...' */
23616 }
23617 }
23620 unqualified_name
23624 {
23628 {
23629 /* Check whether an error occurred. */
23632 /* We already consumed the ellipsis to mark a
23633 parameter pack, but we have no way to report it,
23634 so abort the tentative parse. We will be exiting
23635 immediately anyway. */
23637 }
23638 else
23644 && (qualifying_scope
23646 {
23649 }
23650 }
23655 {
23660 }
23666 {
23667 /* In the declaration of a member of a template class
23668 outside of the class itself, the SCOPE will sometimes
23669 be a TYPENAME_TYPE. For example, given:
23671 template <typename T>
23672 int S<T>::R::i = 3;
23674 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
23675 this context, we must resolve S<T>::R to an ordinary
23676 type, rather than a typename type.
23678 The reason we normally avoid resolving TYPENAME_TYPEs
23679 is that a specialization of `S' might render
23680 `S<T>::R' not a type. However, if `S' is
23681 specialized, then this `i' will not be used, so there
23682 is no harm in resolving the types here. */
23683 tree type;
23685 /* Resolve the TYPENAME_TYPE. */
23688 /* If that failed, the declarator is invalid. */
23690 {
23693 "cannot define member of dependent typedef "
23695 else
23700 }
23702 }
23707 {
23708 tree class_type;
23713 else
23717 {
23721 {
23722 /* We do not attempt to print the declarator
23723 here because we do not have enough
23724 information about its original syntactic
23725 form. */
23729 }
23732 {
23736 "use %<%T::%D%> instead of %<%T::%D%> to "
23738 class_type,
23743 }
23745 }
23748 {
23755 for an unnamed type, even if the type
23756 got a name for linkage purposes. */
23758 /* Handle correctly (c++/19200):
23760 struct S {
23761 struct T{};
23762 friend void S(T);
23763 };
23765 and also:
23767 namespace N {
23768 void S();
23769 }
23771 struct S {
23772 friend void N::S();
23773 }; */
23776 class_type))
23785 }
23786 }
23788 unqualified_name,
23796 /* We're looking for this case in [temp.res]:
23797 A qualified-id is assumed to name a type if [...]
23798 - it is a decl-specifier of the decl-specifier-seq of a
23799 parameter-declaration in a declarator of a function or
23800 function template declaration, ... */
23806 {
23807 /* ...whose declarator-id is qualified. If it isn't, never
23808 assume the parameters to refer to types. */
23811 else
23812 {
23813 /* Now we have something like
23814 template <typename T> int C::x(S::p);
23815 which can be a function template declaration or a
23816 variable template definition. If name lookup for
23817 the declarator-id C::x finds one or more function
23818 templates, assume S::p to name a type. Otherwise,
23819 don't. */
23820 tree decl
23822 none_type,
23830 /* Allow
23831 template<typename T>
23832 A<T>::A(T::type) { } */
23835 qualifying_scope)))
23837 }
23838 }
23839 }
23841 handle_declarator:;
23844 {
23845 /* Any names that appear after the declarator-id for a
23846 member are looked up in the containing scope. */
23848 {
23849 /* But declarations with qualified-ids can't appear in a
23850 function. */
23854 }
23856 }
23860 /* Default args are only allowed on function
23861 declarations. */
23863 else
23867 }
23868 /* We're done. */
23869 else
23871 }
23873 /* For an abstract declarator, we might wind up with nothing at this
23874 point. That's an error; the declarator is not optional. */
23878 {
23879 /* Record overly parenthesized declarator so we can give a
23880 diagnostic about confusing decl/expr disambiguation. */
23882 {
23883 /* If the open and close parens are on different lines, this
23884 is probably a formatting thing, so ignore. */
23889 }
23894 }
23896 /* If we entered a scope, we must exit it now. */
23904 }
23906 /* Parse a ptr-operator.
23908 ptr-operator:
23909 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
23910 * cv-qualifier-seq [opt]
23911 &
23912 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
23913 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
23915 GNU Extension:
23917 ptr-operator:
23918 & cv-qualifier-seq [opt]
23920 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
23921 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
23922 an rvalue reference. In the case of a pointer-to-member, *TYPE is
23923 filled in with the TYPE containing the member. *CV_QUALS is
23924 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
23925 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
23926 Note that the tree codes returned by this function have nothing
23927 to do with the types of trees that will be eventually be created
23928 to represent the pointer or reference type being parsed. They are
23929 just constants with suggestive names. */
23930 static enum tree_code
23935 {
23940 /* Assume that it's not a pointer-to-member. */
23942 /* And that there are no cv-qualifiers. */
23945 /* Peek at the next token. */
23948 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
23958 {
23959 /* Consume the `*', `&' or `&&'. */
23962 /* A `*' can be followed by a cv-qualifier-seq, and so can a
23963 `&', if we are allowing GNU extensions. (The only qualifier
23964 that can legally appear after `&' is `restrict', but that is
23965 enforced during semantic analysis. */
23973 }
23974 else
23975 {
23976 /* Try the pointer-to-member case. */
23978 /* Look for the optional `::' operator. */
23981 /* Look for the nested-name specifier. */
23988 /* If we found it, and the next token is a `*', then we are
23989 indeed looking at a pointer-to-member operator. */
23992 {
23993 /* Indicate that the `*' operator was used. */
24001 else
24002 {
24003 /* The type of which the member is a member is given by the
24004 current SCOPE. */
24006 /* The next name will not be qualified. */
24010 /* Look for optional c++11 attributes. */
24014 /* Look for the optional cv-qualifier-seq. */
24016 }
24017 }
24018 /* If that didn't work we don't have a ptr-operator. */
24021 }
24024 }
24026 /* Parse an (optional) cv-qualifier-seq.
24028 cv-qualifier-seq:
24029 cv-qualifier cv-qualifier-seq [opt]
24031 cv-qualifier:
24032 const
24033 volatile
24035 GNU Extension:
24037 cv-qualifier:
24038 __restrict__
24040 Returns a bitmask representing the cv-qualifiers. */
24042 static cp_cv_quals
24044 {
24048 {
24050 cp_cv_quals cv_qualifier;
24052 /* Peek at the next token. */
24054 /* See if it's a cv-qualifier. */
24056 {
24072 }
24078 {
24083 }
24084 else
24085 {
24088 }
24089 }
24092 }
24094 /* Parse an (optional) ref-qualifier
24096 ref-qualifier:
24097 &
24098 &&
24100 Returns cp_ref_qualifier representing ref-qualifier. */
24102 static cp_ref_qualifier
24104 {
24107 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
24112 {
24117 {
24129 }
24134 {
24137 }
24138 else
24139 {
24142 }
24143 }
24146 }
24148 /* Parse an optional tx-qualifier.
24150 tx-qualifier:
24151 transaction_safe
24152 transaction_safe_dynamic */
24154 static tree
24156 {
24159 {
24164 {
24168 {
24171 {
24174 }
24175 else
24177 }
24178 }
24179 }
24181 }
24183 /* Parse an (optional) virt-specifier-seq.
24185 virt-specifier-seq:
24186 virt-specifier virt-specifier-seq [opt]
24188 virt-specifier:
24189 override
24190 final
24192 Returns a bitmask representing the virt-specifiers. */
24194 static cp_virt_specifiers
24196 {
24200 {
24202 cp_virt_specifiers virt_specifier;
24204 /* Peek at the next token. */
24206 /* See if it's a virt-specifier-qualifier. */
24210 {
24213 }
24215 {
24218 }
24220 {
24222 }
24223 else
24227 {
24232 }
24233 else
24234 {
24237 }
24238 }
24240 }
24242 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
24243 is in scope even though it isn't real. */
24245 void
24247 {
24248 tree this_parm;
24251 {
24252 /* We don't clear this between NSDMIs. Is it already what we want? */
24259 }
24262 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
24264 current_class_ref
24267 }
24269 /* Return true iff our current scope is a non-static data member
24270 initializer. */
24272 bool
24274 {
24275 /* We recognize NSDMI context by the context-less 'this' pointer set up
24276 by the function above. */
24282 }
24284 /* True if we're parsing a function declarator. */
24286 bool
24288 {
24289 /* this_entity is NULL for a function parameter scope while parsing the
24290 declarator; it is set when parsing the body of the function. */
24293 }
24295 /* Parse a late-specified return type, if any. This is not a separate
24296 non-terminal, but part of a function declarator, which looks like
24298 -> trailing-type-specifier-seq abstract-declarator(opt)
24300 Returns the type indicated by the type-id.
24302 In addition to this, parse any queued up #pragma omp declare simd
24303 clauses, and #pragma acc routine clauses.
24305 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
24306 function. */
24308 static tree
24311 {
24315 && declarator
24319 && declarator
24322 /* Peek at the next token. */
24324 /* A late-specified return type is indicated by an initial '->'. */
24333 {
24334 /* Consume the ->. */
24338 }
24340 /* Function declarations may be followed by a trailing
24341 requires-clause. */
24345 declarator->attributes
24349 declarator->attributes
24354 }
24356 /* Parse a declarator-id.
24358 declarator-id:
24359 id-expression
24360 :: [opt] nested-name-specifier [opt] type-name
24362 In the `id-expression' case, the value returned is as for
24363 cp_parser_id_expression if the id-expression was an unqualified-id.
24364 If the id-expression was a qualified-id, then a SCOPE_REF is
24365 returned. The first operand is the scope (either a NAMESPACE_DECL
24366 or TREE_TYPE), but the second is still just a representation of an
24367 unqualified-id. */
24369 static tree
24371 {
24372 tree id;
24373 /* The expression must be an id-expression. Assume that qualified
24374 names are the names of types so that:
24376 template <class T>
24377 int S<T>::R::i = 3;
24379 will work; we must treat `S<T>::R' as the name of a type.
24380 Similarly, assume that qualified names are templates, where
24381 required, so that:
24383 template <class T>
24384 int S<T>::R<T>::i = 3;
24386 will work, too. */
24392 optional_p);
24396 }
24398 /* Parse a type-id.
24400 type-id:
24401 type-specifier-seq abstract-declarator [opt]
24403 The parser flags FLAGS is used to control type-specifier parsing.
24405 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
24407 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24408 i.e. we've just seen "->".
24410 Returns the TYPE specified. */
24412 static tree
24416 {
24417 cp_decl_specifier_seq type_specifier_seq;
24420 /* Parse the type-specifier-seq. */
24423 is_trailing_return,
24431 /* A bare template name as a template argument is a template template
24432 argument, not a placeholder, so fail parsing it as a type argument. */
24433 {
24437 }
24441 /* There might or might not be an abstract declarator. */
24443 /* Look for the declarator. */
24444 abstract_declarator
24451 /* Check to see if there really was a declarator. */
24456 /* The concepts TS allows 'auto' as a type-id. */
24459 /* DR 625 prohibits use of auto as a template-argument. We allow 'auto'
24460 outside the template-argument-list context here only for the sake of
24461 diagnostic: grokdeclarator then can emit a better error message for
24462 e.g. using T = auto. */
24468 && !auto_typeid_ok
24469 /* None of the valid uses of 'auto' in C++14 involve the type-id
24470 nonterminal, but it is valid in a trailing-return-type. */
24473 {
24474 /* A type-id with type 'auto' is only ok if the abstract declarator
24475 is a function declarator with a late-specified return type.
24477 A type-id with 'auto' is also valid in a trailing-return-type
24478 in a compound-requirement. */
24485 else
24486 {
24488 {
24491 {
24492 auto_diagnostic_group g;
24496 tmpl);
24498 tmpl);
24499 }
24502 auto_node);
24503 else
24505 }
24507 }
24508 }
24511 is_template_arg);
24512 }
24514 /* Wrapper for cp_parser_type_id_1. */
24516 static tree
24519 {
24521 }
24523 /* Wrapper for cp_parser_type_id_1. */
24525 static tree
24527 {
24528 tree r;
24530 parser->type_definition_forbidden_message
24535 }
24537 /* Wrapper for cp_parser_type_id_1. */
24539 static tree
24541 {
24544 }
24546 /* Parse a type-specifier-seq.
24548 type-specifier-seq:
24549 type-specifier type-specifier-seq [opt]
24551 GNU extension:
24553 type-specifier-seq:
24554 attributes type-specifier-seq [opt]
24556 The parser flags FLAGS is used to control type-specifier parsing.
24558 If IS_DECLARATION is true, we are at the start of a "condition" or
24559 exception-declaration, so we might be followed by a declarator-id.
24561 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24562 i.e. we've just seen "->".
24564 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
24566 static void
24568 cp_parser_flags flags,
24572 {
24576 /* Clear the TYPE_SPECIFIER_SEQ. */
24580 /* In the context of a trailing return type, enum E { } is an
24581 elaborated-type-specifier followed by a function-body, not an
24582 enum-specifier. */
24586 /* Parse the type-specifiers and attributes. */
24588 {
24589 tree type_specifier;
24592 /* Check for attributes first. */
24594 {
24595 /* GNU attributes at the end of a declaration apply to the
24596 declaration as a whole, not to the trailing return type. So look
24597 ahead to see if these attributes are at the end. */
24600 {
24606 }
24607 type_specifier_seq->attributes
24611 }
24613 /* record the token of the beginning of the type specifier seq,
24614 for error reporting purposes*/
24618 /* Look for the type-specifier. */
24620 flags,
24621 type_specifier_seq,
24623 NULL,
24626 {
24627 /* If the first type-specifier could not be found, this is not a
24628 type-specifier-seq at all. */
24630 {
24631 /* Set in_declarator_p to avoid skipping to the semicolon. */
24643 }
24644 /* If subsequent type-specifiers could not be found, the
24645 type-specifier-seq is complete. */
24647 }
24650 /* The standard says that a condition can be:
24652 type-specifier-seq declarator = assignment-expression
24654 However, given:
24656 struct S {};
24657 if (int S = ...)
24659 we should treat the "S" as a declarator, not as a
24660 type-specifier. The standard doesn't say that explicitly for
24661 type-specifier-seq, but it does say that for
24662 decl-specifier-seq in an ordinary declaration. Perhaps it
24663 would be clearer just to allow a decl-specifier-seq here, and
24664 then add a semantic restriction that if any decl-specifiers
24665 that are not type-specifiers appear, the program is invalid. */
24668 }
24669 }
24671 /* Return whether the function currently being declared has an associated
24672 template parameter list. */
24674 static bool
24676 {
24689 }
24691 /* Parse a parameter-declaration-clause.
24693 parameter-declaration-clause:
24694 parameter-declaration-list [opt] ... [opt]
24695 parameter-declaration-list , ...
24697 The parser flags FLAGS is used to control type-specifier parsing.
24699 Returns a representation for the parameter declarations. A return
24700 value of NULL indicates a parameter-declaration-clause consisting
24701 only of an ellipsis. */
24703 static tree
24705 cp_parser_flags flags)
24706 {
24707 tree parameters;
24715 && !processing_template_parmlist
24716 && !processing_explicit_instantiation
24717 /* default_arg_ok_p tracks whether this is a parameter-clause for an
24718 actual function or a random abstract declarator. */
24724 /* Peek at the next token. */
24726 /* Check for trivial parameter-declaration-clauses. */
24728 {
24729 /* Consume the `...' token. */
24732 }
24734 /* There are no parameters. */
24736 /* Check for `(void)', too, which is a special case. */
24740 {
24741 /* Consume the `void' token. */
24743 /* There are no parameters. */
24745 }
24747 /* A vector of parameters that haven't been pushed yet. */
24750 /* Parse the parameter-declaration-list. */
24753 /* If a parse error occurred while parsing the
24754 parameter-declaration-list, then the entire
24755 parameter-declaration-clause is erroneous. */
24759 /* Peek at the next token. */
24761 /* If it's a `,', the clause should terminate with an ellipsis. */
24763 {
24764 /* Consume the `,'. */
24766 /* Expect an ellipsis. */
24767 ellipsis_p
24769 }
24770 /* It might also be `...' if the optional trailing `,' was
24771 omitted. */
24773 {
24774 /* Consume the `...' token. */
24776 /* And remember that we saw it. */
24778 }
24779 else
24782 /* A valid parameter-declaration-clause can only be followed by a ')'.
24783 So it's time to push all the parameters we have seen now that we
24784 know we have a valid declaration. Note that here we may not have
24785 committed yet, nor should we. Pushing here will detect the error
24786 of redefining a parameter. */
24791 /* Finish the parameter list. */
24796 }
24798 /* Parse a parameter-declaration-list.
24800 parameter-declaration-list:
24801 parameter-declaration
24802 parameter-declaration-list , parameter-declaration
24804 The parser flags FLAGS is used to control type-specifier parsing.
24805 PENDING_DECLS is a vector of parameters that haven't been pushed yet.
24807 Returns a representation of the parameter-declaration-list, as for
24808 cp_parser_parameter_declaration_clause. However, the
24809 `void_list_node' is never appended to the list. */
24811 static tree
24813 cp_parser_flags flags,
24815 {
24821 /* The special considerations that apply to a function within an
24822 unbraced linkage specifications do not apply to the parameters
24823 to the function. */
24824 saved_in_unbraced_linkage_specification_p
24828 /* Look for more parameters. */
24830 {
24835 /* Parse the parameter. */
24836 parameter
24841 /* We don't know yet if the enclosing context is unavailable or deprecated,
24842 so wait and deal with it in grokparms if appropriate. */
24846 {
24849 PARM,
24854 }
24858 /* If a parse error occurred parsing the parameter declaration,
24859 then the entire parameter-declaration-list is erroneous. */
24861 {
24864 }
24871 {
24872 /* We cannot always pushdecl while parsing tentatively because
24873 it may have side effects and we can't be sure yet if we're
24874 parsing a declaration, e.g.:
24876 S foo(int(x), int(x), int{x});
24878 where it's not clear if we're dealing with a constructor call
24879 or a function declaration until we've seen the last argument
24880 which breaks it up.
24881 It's safe to pushdecl so long as it doesn't result in a clash
24882 with an already-pushed parameter. But we don't delay pushing
24883 different parameters to handle
24885 S foo(int(i), decltype(i) j = 42);
24887 which is valid. */
24890 /* See if PARAMETERS already contains a parameter with the same
24891 DECL_NAME as DECL. */
24897 }())
24899 else
24901 }
24904 {
24908 }
24910 /* Add the new parameter to the list. */
24914 /* If the parameters were parenthesized, it's the case of
24915 T foo(X(x)) which looks like a variable definition but
24916 is a function declaration. */
24920 /* Peek at the next token. */
24923 /* These are for Objective-C++ */
24926 /* The parameter-declaration-list is complete. */
24929 {
24932 /* Peek at the next token. */
24934 /* If it's an ellipsis, then the list is complete. */
24937 /* Otherwise, there must be more parameters. Consume the
24938 `,'. */
24940 /* When parsing something like:
24942 int i(float f, double d)
24944 we can tell after seeing the declaration for "f" that we
24945 are not looking at an initialization of a variable "i",
24946 but rather at the declaration of a function "i".
24948 Due to the fact that the parsing of template arguments
24949 (as specified to a template-id) requires backtracking we
24950 cannot use this technique when inside a template argument
24951 list. */
24955 /* However, a parameter-declaration of the form
24956 "float(f)" (which is a valid declaration of a
24957 parameter "f") can also be interpreted as an
24958 expression (the conversion of "f" to "float"). */
24961 }
24962 else
24963 {
24971 }
24972 }
24974 parser->in_unbraced_linkage_specification_p
24977 /* Reset implicit_template_scope if we are about to leave the function
24978 parameter list that introduced it. Note that for out-of-line member
24979 definitions, there will be one or more class scopes before we get to
24980 the template parameter scope. */
24984 {
24988 {
24991 }
24992 }
24995 }
24997 /* Parse a parameter declaration.
24999 parameter-declaration:
25000 decl-specifier-seq ... [opt] declarator
25001 decl-specifier-seq declarator = assignment-expression
25002 decl-specifier-seq ... [opt] abstract-declarator [opt]
25003 decl-specifier-seq abstract-declarator [opt] = assignment-expression
25005 The parser flags FLAGS is used to control type-specifier parsing.
25007 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
25008 declares a template parameter. (In that case, a non-nested `>'
25009 token encountered during the parsing of the assignment-expression
25010 is not interpreted as a greater-than operator.)
25012 Returns a representation of the parameter, or NULL if an error
25013 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
25014 true iff the declarator is of the form "(p)". */
25018 cp_parser_flags flags,
25021 {
25023 cp_decl_specifier_seq decl_specifiers;
25025 tree default_argument;
25030 /* In a template parameter, `>' is not an operator.
25032 [temp.param]
25034 When parsing a default template-argument for a non-type
25035 template-parameter, the first non-nested `>' is taken as the end
25036 of the template parameter-list rather than a greater-than
25037 operator. */
25039 /* Type definitions may not appear in parameter types. */
25041 parser->type_definition_forbidden_message
25048 /* Parse the declaration-specifiers. */
25051 flags,
25055 /* [dcl.spec.auto.general]: "A placeholder-type-specifier of the form
25056 type-constraint opt auto can be used as a decl-specifier of the
25057 decl-specifier-seq of a parameter-declaration of a function declaration
25058 or lambda-expression..." but we must not synthesize an implicit template
25059 type parameter in its declarator. That is, in "void f(auto[auto{10}]);"
25060 we want to synthesize only the first auto. */
25064 /* Complain about missing 'typename' or other invalid type names. */
25069 /* If an error occurred, there's no reason to attempt to parse the
25070 rest of the declaration. */
25072 {
25075 }
25077 /* Peek at the next token. */
25080 /* If the next token is a `)', `,', `=', `>', or `...', then there
25081 is no declarator. However, when variadic templates are enabled,
25082 there may be a declarator following `...'. */
25087 {
25091 }
25092 /* Otherwise, there should be a declarator. */
25093 else
25094 {
25098 /* After seeing a decl-specifier-seq, if the next token is not a
25099 "(" or "{", there is no possibility that the code is a valid
25100 expression. Therefore, if parsing tentatively, we commit at
25101 this point. */
25103 /* In an expression context, having seen:
25105 (int((char ...
25107 we cannot be sure whether we are looking at a
25108 function-type (taking a "char" as a parameter) or a cast
25109 of some object of type "char" to "int". */
25113 {
25115 {
25118 /* This is a CTAD expression, not a parameter declaration. */
25120 }
25121 else
25123 }
25124 /* Parse the declarator. */
25127 CP_PARSER_DECLARATOR_EITHER,
25128 CP_PARSER_FLAGS_NONE,
25130 parenthesized_p,
25135 /* After the declarator, allow more attributes. */
25136 decl_specifiers.attributes
25140 /* If the declarator is a template parameter pack, remember that and
25141 clear the flag in the declarator itself so we don't get errors
25142 from grokdeclarator. */
25144 {
25147 }
25148 }
25150 /* If the next token is an ellipsis, and we have not seen a declarator
25151 name, and if either the type of the declarator contains parameter
25152 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
25153 for, eg, abbreviated integral type names), then we actually have a
25154 parameter pack expansion expression. Otherwise, leave the ellipsis
25155 for a C-style variadic function. */
25158 /* If a function parameter pack was specified and an implicit template
25159 parameter was introduced during cp_parser_parameter_declaration,
25160 change any implicit parameters introduced into packs. */
25165 {
25173 }
25176 {
25187 {
25188 /* Consume the `...'. */
25192 /* Build a pack expansion type */
25197 else
25199 }
25200 }
25202 /* The restriction on defining new types applies only to the type
25203 of the parameter, not to the default argument. */
25206 /* If the next token is `=', then process a default argument. */
25208 {
25213 /* If we are defining a class, then the tokens that make up the
25214 default argument must be saved and processed later. */
25220 /* A constrained-type-specifier may declare a type
25221 template-parameter. */
25223 default_argument
25226 /* A constrained-type-specifier may declare a
25227 template-template-parameter. */
25229 default_argument
25232 /* Outside of a class definition, we can just parse the
25233 assignment-expression. */
25234 else
25235 default_argument
25239 {
25241 "default arguments are only "
25243 }
25245 || template_parameter_pack_p
25248 {
25249 /* Find the name of the parameter pack. */
25256 template_parm_p
25262 else
25264 template_parm_p
25271 }
25272 }
25273 else
25279 /* Generate a location for the parameter, ranging from the start of the
25280 initial token to the end of the final token (using input_location for
25281 the latter, set up by cp_lexer_set_source_position_from_token when
25282 consuming tokens).
25284 If we have a identifier, then use it for the caret location, e.g.
25286 extern int callee (int one, int (*two)(int, int), float three);
25287 ~~~~~~^~~~~~~~~~~~~~
25289 otherwise, reuse the start location for the caret location e.g.:
25291 extern int callee (int one, int (*)(int, int), float three);
25292 ^~~~~~~~~~~~~~~~~
25294 */
25300 input_location);
25303 declarator,
25304 default_argument,
25305 param_loc,
25306 template_parameter_pack_p);
25307 }
25309 /* Parse a default argument and return it.
25311 TEMPLATE_PARM_P is true if this is a default argument for a
25312 non-type template parameter. */
25313 static tree
25315 {
25321 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
25322 set correctly. */
25329 /* Local variable names (and the `this' keyword) may not
25330 appear in a default argument. */
25333 /* Parse the assignment-expression. */
25338 /* The "this" pointer is not valid in a default argument. */
25340 {
25345 }
25346 default_argument
25348 /* Restore the "this" pointer. */
25350 {
25353 }
25362 }
25364 /* Parse a function-body.
25366 function-body:
25367 compound_statement */
25369 static void
25371 {
25375 }
25377 /* Parse a ctor-initializer-opt followed by a function-body. Return
25378 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
25379 is true we are parsing a function-try-block. */
25381 static void
25384 {
25386 const bool check_body_p
25394 {
25397 "function-try-block body of %<constexpr%> constructor only "
25399 else
25401 "function-try-block body of %<constexpr%> function only "
25403 }
25405 /* Begin the function body. */
25407 /* Parse the optional ctor-initializer. */
25410 /* If we're parsing a constexpr constructor definition, we need
25411 to check that the constructor body is indeed empty. However,
25412 before we get to cp_parser_function_body lot of junk has been
25413 generated, so we can't just check that we have an empty block.
25414 Rather we take a snapshot of the outermost block, and check whether
25415 cp_parser_function_body changed its state. */
25417 {
25421 }
25422 /* Parse the function-body. */
25426 /* Finish the function body. */
25428 }
25430 /* Parse an initializer.
25432 initializer:
25433 = initializer-clause
25434 ( expression-list )
25436 Returns an expression representing the initializer. If no
25437 initializer is present, NULL_TREE is returned.
25439 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
25440 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
25441 set to TRUE if there is no initializer present. If there is an
25442 initializer, and it is not a constant-expression, *NON_CONSTANT_P
25443 is set to true; otherwise it is set to false. */
25445 static tree
25448 {
25450 tree init;
25452 /* Peek at the next token. */
25455 /* Let our caller know whether or not this initializer was
25456 parenthesized. */
25458 /* Assume that the initializer is constant. */
25462 {
25463 /* Consume the `='. */
25465 /* Parse the initializer-clause. */
25467 }
25469 {
25474 non_constant_p);
25479 }
25481 {
25486 }
25487 else
25488 {
25489 /* Anything else is an error. */
25492 }
25498 }
25500 /* Parse an initializer-clause.
25502 initializer-clause:
25503 assignment-expression
25504 braced-init-list
25506 Returns an expression representing the initializer.
25508 If the `assignment-expression' production is used the value
25509 returned is simply a representation for the expression.
25511 Otherwise, calls cp_parser_braced_list. */
25513 static cp_expr
25515 {
25516 cp_expr initializer;
25518 /* Assume the expression is constant. */
25521 /* If it is not a `{', then we are looking at an
25522 assignment-expression. */
25524 {
25525 initializer
25528 non_constant_p);
25529 }
25530 else
25534 }
25536 /* Parse a brace-enclosed initializer list.
25538 braced-init-list:
25539 { initializer-list , [opt] }
25540 { designated-initializer-list , [opt] }
25541 { }
25543 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
25544 the elements of the initializer-list (or NULL, if the last
25545 production is used). The TREE_TYPE for the CONSTRUCTOR will be
25546 NULL_TREE. There is no way to detect whether or not the optional
25547 trailing `,' was provided. NON_CONSTANT_P is as for
25548 cp_parser_initializer. */
25550 static cp_expr
25552 {
25553 tree initializer;
25556 /* Consume the `{' token. */
25557 matching_braces braces;
25559 /* Create a CONSTRUCTOR to represent the braced-initializer. */
25561 /* If it's not a `}', then there is a non-trivial initializer. */
25563 {
25565 /* Parse the initializer list. */
25569 /* A trailing `,' token is allowed. */
25572 }
25573 else
25575 /* Now, there should be a trailing `}'. */
25582 /* Build a location of the form:
25583 { ... }
25584 ^~~~~~~
25585 with caret==start at the open brace, finish at the close brace. */
25589 }
25591 /* Consume tokens up to, but not including, the next non-nested closing `]'.
25592 Returns true iff we found a closing `]'. */
25594 static bool
25596 {
25600 {
25604 {
25608 /* FALLTHRU */
25611 /* If we've run out of tokens, then there is no closing `]'. */
25625 }
25627 /* Consume the current token, skipping it. */
25629 }
25630 }
25632 /* Consume tokens up to, and including, the next non-nested closing `]'.
25633 Returns true iff we found a closing `]'. */
25635 static bool
25637 {
25642 }
25644 /* Return true if we are looking at an array-designator, false otherwise. */
25646 static bool
25648 {
25649 /* Consume the `['. */
25654 /* Skip tokens until the next token is a closing square bracket.
25655 If we find the closing `]', and the next token is a `=', then
25656 we are looking at an array designator. */
25657 bool array_designator_p
25661 /* Roll back the tokens we skipped. */
25665 }
25667 /* Parse an initializer-list.
25669 initializer-list:
25670 initializer-clause ... [opt]
25671 initializer-list , initializer-clause ... [opt]
25673 C++20 Extension:
25675 designated-initializer-list:
25676 designated-initializer-clause
25677 designated-initializer-list , designated-initializer-clause
25679 designated-initializer-clause:
25680 designator brace-or-equal-initializer
25682 designator:
25683 . identifier
25685 GNU Extension:
25687 initializer-list:
25688 designation initializer-clause ...[opt]
25689 initializer-list , designation initializer-clause ...[opt]
25691 designation:
25692 . identifier =
25693 identifier :
25694 [ constant-expression ] =
25696 Returns a vec of constructor_elt. The VALUE of each elt is an expression
25697 for the initializer. If the INDEX of the elt is non-NULL, it is the
25698 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
25699 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
25700 are any designators. */
25705 {
25710 /* Assume all of the expressions are constant. */
25716 /* Parse the rest of the list. */
25718 {
25720 tree designator;
25721 tree initializer;
25725 /* Handle the C++20 syntax, '. id ='. */
25733 {
25736 "C++ designated initializers only available with "
25738 /* Consume the `.'. */
25740 /* Consume the identifier. */
25743 /* Consume the `='. */
25745 }
25746 /* Also, if the next token is an identifier and the following one is a
25747 colon, we are looking at the GNU designated-initializer
25748 syntax. */
25753 {
25754 /* Warn the user that they are using an extension. */
25757 /* Consume the identifier. */
25759 /* Consume the `:'. */
25761 }
25762 /* Also handle C99 array designators, '[ const ] ='. */
25766 {
25767 /* In C++11, [ could start a lambda-introducer. */
25773 {
25776 }
25777 else
25778 {
25783 }
25788 && (!require_potential_rvalue_constant_expression
25792 /* Warn the user that they are using an extension. */
25795 }
25796 else
25800 {
25803 }
25807 {
25811 }
25815 /* Parse the initializer. */
25818 /* If any clause is non-constant, so is the entire initializer. */
25822 /* If we have an ellipsis, this is an initializer pack
25823 expansion. */
25825 {
25828 /* Consume the `...'. */
25835 /* Turn the initializer into an initializer expansion. */
25837 }
25839 /* Add it to the vector. */
25842 /* If the next token is not a comma, we have reached the end of
25843 the list. */
25847 /* Peek at the next token. */
25849 /* If the next token is a `}', then we're still done. An
25850 initializer-clause can have a trailing `,' after the
25851 initializer-list and before the closing `}'. */
25855 /* Suppress location wrappers in a long initializer to save memory
25856 (14179). The cutoff is chosen arbitrarily. */
25860 /* Look one level down because it's easy. Looking deeper would require
25861 passing down a nelts pointer, and I don't think multi-level massive
25862 initializers are common enough to justify this. */
25868 /* Consume the `,' token. */
25870 }
25872 /* The same identifier shall not appear in multiple designators
25873 of a designated-initializer-list. */
25875 {
25880 {
25882 {
25884 "%<.%s%> designator used multiple times in "
25888 }
25889 else
25891 }
25895 }
25901 }
25903 /* Classes [gram.class] */
25905 /* Parse a class-name.
25907 class-name:
25908 identifier
25909 template-id
25911 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
25912 to indicate that names looked up in dependent types should be
25913 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
25914 keyword has been used to indicate that the name that appears next
25915 is a template. TAG_TYPE indicates the explicit tag given before
25916 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
25917 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
25918 is the class being defined in a class-head. If ENUM_OK is TRUE,
25919 enum-names are also accepted.
25921 Returns the TYPE_DECL representing the class. */
25923 static tree
25932 {
25933 tree decl;
25936 /* All class-names start with an identifier. */
25939 {
25942 }
25944 /* PARSER->SCOPE can be cleared when parsing the template-arguments
25945 to a template-id, so we save it here. Consider object scope too,
25946 so that make_typename_type below can use it (cp_parser_template_name
25947 considers object scope also). This may happen with code like
25949 p->template A<T>::a()
25951 where we first want to look up A<T>::a in the class of the object
25952 expression, as per [basic.lookup.classref]. */
25954 /* This only checks parser->scope to avoid duplicate errors; if
25955 ->object_type is erroneous, go on to give a parse error. */
25959 /* Any name names a type if we're following the `typename' keyword
25960 in a qualified name where the enclosing scope is type-dependent. */
25965 /* Handle the common case (an identifier, but not a template-id)
25966 efficiently. */
25969 {
25973 /* Look for the identifier. */
25977 /* If the next token isn't an identifier, we are certainly not
25978 looking at a class-name. */
25981 /* If we know this is a type-name, there's no need to look it
25982 up. */
25985 else
25986 {
25987 tree ambiguous_decls;
25988 /* If we already know that this lookup is ambiguous, then
25989 we've already issued an error message; there's no reason
25990 to check again. */
25992 {
25995 }
25996 /* If the next token is a `::', then the name must be a type
25997 name.
25999 [basic.lookup.qual]
26001 During the lookup for a name preceding the :: scope
26002 resolution operator, object, function, and enumerator
26003 names are ignored. */
26006 /* Look up the name. */
26008 tag_type,
26011 check_dependency_p,
26015 {
26019 }
26020 }
26021 }
26022 else
26023 {
26024 /* Try a template-id. */
26026 check_dependency_p,
26027 tag_type,
26028 is_declaration);
26031 }
26035 /* If this is a typename, create a TYPENAME_TYPE. */
26037 {
26042 }
26046 /* Check to see that it is really the name of a class. */
26050 /* Situations like this:
26052 template <typename T> struct A {
26053 typename T::template X<int>::I i;
26054 };
26056 are problematic. Is `T::template X<int>' a class-name? The
26057 standard does not seem to be definitive, but there is no other
26058 valid interpretation of the following `::'. Therefore, those
26059 names are considered class-names. */
26060 {
26064 }
26069 /* In Objective-C 2.0, a classname followed by '.' starts a
26070 dot-syntax expression, and it's not a type-name. */
26082 }
26084 /* Make sure that any member-function parameters are in scope.
26085 For instance, a function's noexcept-specifier can use the function's
26086 parameters:
26088 struct S {
26089 void fn (int p) noexcept(noexcept(p));
26090 };
26092 so we need to make sure name lookup can find them. This is used
26093 when we delay parsing of the noexcept-specifier. */
26095 static void
26097 {
26104 {
26108 }
26109 }
26111 /* Undo the effects of inject_parm_decls. */
26113 static void
26115 {
26118 }
26120 /* Parse a class-specifier.
26122 class-specifier:
26123 class-head { member-specification [opt] }
26125 Returns the TREE_TYPE representing the class. */
26127 tree
26129 {
26132 tree type;
26146 /* Parse the class-head. */
26149 /* If the class-head was a semantic disaster, skip the entire body
26150 of the class. */
26152 {
26156 }
26158 /* Look for the `{'. */
26159 matching_braces braces;
26161 {
26164 }
26169 /* Issue an error message if type-definitions are forbidden here. */
26171 /* Remember that we are defining one more class. */
26173 /* Inside the class, surrounding template-parameter-lists do not
26174 apply. */
26175 saved_num_template_parameter_lists
26178 /* We are not in a function body. */
26181 /* Or in a loop. */
26184 /* Or in a switch. */
26187 /* We are not immediately inside an extern "lang" block. */
26188 saved_in_unbraced_linkage_specification_p
26191 /* 'this' from an enclosing non-static member function is unavailable. */
26197 /* Start the class. */
26199 {
26201 /* SCOPE must be a scope nested inside current scope. */
26205 else
26207 }
26211 /* If the type is erroneous, skip the entire body of the class. */
26213 else
26214 /* Parse the member-specification. */
26217 /* Look for the trailing `}'. */
26219 /* Look for trailing attributes to apply to this class. */
26227 /* We've finished a type definition. Check for the common syntax
26228 error of forgetting a semicolon after the definition. We need to
26229 be careful, as we can't just check for not-a-semicolon and be done
26230 with it; the user might have typed:
26232 class X { } c = ...;
26233 class X { } *p = ...;
26235 and so forth. Instead, enumerate all the possible tokens that
26236 might follow this production; if we don't see one of them, then
26237 complain and silently insert the semicolon. */
26238 {
26243 /* Don't try to parse c++11 attributes here. As per the
26244 grammar, that should be a task for
26245 cp_parser_decl_specifier_seq. */
26249 {
26261 /* While it's legal for type qualifiers and storage class
26262 specifiers to follow type definitions in the grammar, only
26263 compiler testsuites contain code like that. Assume that if
26264 we see such code, then what we're really seeing is a case
26265 like:
26267 class X { }
26268 const <type> var = ...;
26270 or
26272 class Y { }
26273 static <type> func (...) ...
26275 i.e. the qualifier or specifier applies to the next
26276 declaration. To do so, however, we need to look ahead one
26277 more token to see if *that* token is a type specifier.
26279 This code could be improved to handle:
26281 class Z { }
26282 static const <type> var = ...; */
26285 {
26288 /* Handling user-defined types here would be nice, but very
26289 tricky. */
26290 want_semicolon
26293 }
26297 }
26299 /* If we don't have a type, then something is very wrong and we
26300 shouldn't try to do anything clever. Likewise for not seeing the
26301 closing brace. */
26303 {
26304 /* Locate the closing brace. */
26305 cp_token_position prev
26310 /* We want to suggest insertion of a ';' immediately *after* the
26311 closing brace, so, if we can, offset the location by 1 column. */
26318 /* If we successfully offset the location, suggest the fix-it. */
26331 else
26334 /* Unget one token and smash it to look as though we encountered
26335 a semicolon in the input stream. */
26340 }
26341 }
26343 /* If this class is not itself within the scope of another class,
26344 then we need to parse the bodies of all of the queued function
26345 definitions. Note that the queued functions defined in a class
26346 are not always processed immediately following the
26347 class-specifier for that class. Consider:
26349 struct A {
26350 struct B { void f() { sizeof (A); } };
26351 };
26353 If `f' were processed before the processing of `A' were
26354 completed, there would be no way to compute the size of `A'.
26355 Note that the nesting we are interested in here is lexical --
26356 not the semantic nesting given by TYPE_CONTEXT. In particular,
26357 for:
26359 struct A { struct B; };
26360 struct A::B { void f() { } };
26362 there is no need to delay the parsing of `A::B::f'. */
26364 {
26365 tree decl;
26372 {
26373 /* Skip default arguments, NSDMIs, etc, in order to improve
26374 error recovery (c++/71169, c++/71832). */
26378 }
26380 /* In a first pass, parse default arguments to the functions.
26381 Then, in a second pass, parse the bodies of the functions.
26382 This two-phased approach handles cases like:
26384 struct S {
26385 void f() { g(); }
26386 void g(int i = 3);
26387 };
26389 */
26391 {
26393 /* If there are default arguments that have not yet been processed,
26394 take care of them now. */
26396 {
26401 }
26402 /* Make sure that any template parameters are in scope. */
26404 /* Parse the default argument expressions. */
26406 /* Remove any template parameters from the symbol table. */
26408 }
26411 /* If there are noexcept-specifiers that have not yet been processed,
26412 take care of them now. Do this before processing NSDMIs as they
26413 may depend on noexcept-specifiers already having been processed. */
26415 {
26418 {
26423 }
26428 /* Make sure that any template parameters are in scope. */
26431 /* Make sure that any member-function parameters are in scope.
26432 This function doesn't expect ccp to be set. */
26436 /* 'this' is not allowed in static member functions. */
26437 unsigned char local_variables_forbidden_p
26442 /* Now we can parse the noexcept-specifier. */
26448 /* Update the fn's type directly -- it might have escaped
26449 beyond this decl :( */
26451 /* Update any instantiations we've already created. We must
26452 keep the new noexcept-specifier wrapped in a DEFERRED_NOEXCEPT
26453 so that maybe_instantiate_noexcept can tsubst the NOEXCEPT_EXPR
26454 in the pattern. */
26459 /* Restore the state of local_variables_forbidden_p. */
26462 /* The finish_struct call above performed various override checking,
26463 but it skipped unparsed noexcept-specifier operands. Now that we
26464 have resolved them, check again. */
26467 /* Remove any member-function parameters from the symbol table. */
26470 /* Remove any template parameters from the symbol table. */
26472 }
26475 /* Now parse any NSDMIs. */
26477 {
26480 {
26485 }
26488 }
26491 /* Now contract attributes. */
26493 {
26496 {
26501 }
26505 /* Make sure that any template parameters are in scope. */
26508 /* Make sure that any member-function parameters are in scope.
26509 This function doesn't expect ccp to be set. */
26513 /* 'this' is not allowed in static member functions. */
26514 unsigned char local_variables_forbidden_p
26519 /* Now we can parse contract conditions. */
26521 {
26524 }
26526 /* Restore the state of local_variables_forbidden_p. */
26529 /* Remove any member-function parameters from the symbol table. */
26532 /* Remove any template parameters from the symbol table. */
26535 /* Perform any deferred contract matching. */
26537 }
26545 /* Now parse the body of the functions. */
26547 {
26548 /* OpenMP UDRs need to be parsed before all other functions. */
26555 }
26556 else
26560 }
26562 /* Put back any saved access checks. */
26565 /* Restore saved state. */
26569 parser->num_template_parameter_lists
26571 parser->in_unbraced_linkage_specification_p
26577 }
26579 /* Parse a class-head.
26581 class-head:
26582 class-key identifier [opt] base-clause [opt]
26583 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
26584 class-key nested-name-specifier [opt] template-id
26585 base-clause [opt]
26587 class-virt-specifier:
26588 final
26590 GNU Extensions:
26591 class-key attributes identifier [opt] base-clause [opt]
26592 class-key attributes nested-name-specifier identifier base-clause [opt]
26593 class-key attributes nested-name-specifier [opt] template-id
26594 base-clause [opt]
26596 Upon return BASES is initialized to the list of base classes (or
26597 NULL, if there are none) in the same form returned by
26598 cp_parser_base_clause.
26600 Returns the TYPE of the indicated class. Sets
26601 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
26602 involving a nested-name-specifier was used, and FALSE otherwise.
26604 Returns error_mark_node if this is not a class-head.
26606 Returns NULL_TREE if the class-head is syntactically valid, but
26607 semantically invalid in a way that means we should skip the entire
26608 body of the class. */
26610 static tree
26613 {
26614 tree nested_name_specifier;
26618 tree attributes;
26619 tree bases;
26629 /* Assume no nested-name-specifier will be present. */
26631 /* Assume no template parameter lists will be used in defining the
26632 type. */
26636 /* Look for the class-key. */
26643 /* Parse the attributes. */
26648 /* If the next token is `::', that is invalid -- but sometimes
26649 people do try to write:
26651 struct ::S {};
26653 Handle this gracefully by accepting the extra qualifier, and then
26654 issuing an error about it later if this really is a
26655 class-head. If it turns out just to be an elaborated type
26656 specifier, remain silent. */
26660 /* It is OK to define an inaccessible class; for example:
26662 class A { class B; };
26663 class A::B {};
26665 So we want to ignore access when parsing the class name.
26666 However, we might be tentatively parsing what is really an
26667 elaborated-type-specifier naming a template-id, e.g.
26669 struct C<&D::m> c;
26671 In this case the tentative parse as a class-head will fail, but not
26672 before cp_parser_template_id splices in a CPP_TEMPLATE_ID token.
26673 Since dk_no_check is sticky, we must instead use dk_deferred so that
26674 any such CPP_TEMPLATE_ID token created during this tentative parse
26675 will correctly capture the access checks imposed by the template-id . */
26678 /* Determine the name of the class. Begin by looking for an
26679 optional nested-name-specifier. */
26681 nested_name_specifier
26687 /* If there was a nested-name-specifier, then there *must* be an
26688 identifier. */
26693 {
26695 /* Although the grammar says `identifier', it really means
26696 `class-name' or `template-name'. You are only allowed to
26697 define a class that has already been declared with this
26698 syntax.
26700 The proposed resolution for Core Issue 180 says that wherever
26701 you see `class T::X' you should treat `X' as a type-name.
26703 We do not know if we will see a class-name, or a
26704 template-name. We look for a class-name first, in case the
26705 class-name is a template-id; if we looked for the
26706 template-name first we would stop after the template-name. */
26713 class_type,
26717 /* If that didn't work, ignore the nested-name-specifier. */
26719 {
26725 }
26726 /* If we could not find a corresponding TYPE, treat this
26727 declaration like an unqualified declaration. */
26730 /* Otherwise, count the number of templates used in TYPE and its
26731 containing scopes. */
26732 else
26734 }
26735 /* Otherwise, the identifier is optional. */
26736 else
26737 {
26738 /* We don't know whether what comes next is a template-id,
26739 an identifier, or nothing at all. */
26741 /* Check for a template-id. */
26746 class_key,
26748 /* If that didn't work, it could still be an identifier. */
26750 {
26752 {
26755 }
26756 else
26758 }
26759 else
26760 {
26763 }
26764 }
26769 {
26771 class_key,
26773 }
26776 /* If it's not a `:' or a `{' then we can't really be looking at a
26777 class-head, since a class-head only appears as part of a
26778 class-specifier. We have to detect this situation before calling
26779 xref_tag, since that has irreversible side-effects. */
26781 {
26785 }
26787 /* At this point, we're going ahead with the class-specifier, even
26788 if some other problem occurs. */
26791 {
26796 }
26797 /* Issue the error about the overly-qualified name now. */
26799 {
26804 }
26806 {
26811 }
26813 {
26814 tree scope;
26817 /* [temp.names]: in a qualified-id formed by a class-head-name, the
26818 keyword template shall not appear at the top level. */
26822 /* Reject typedef-names in class heads. */
26824 {
26827 type);
26830 }
26832 /* Figure out in what scope the declaration is being placed. */
26834 /* If that scope does not contain the scope in which the
26835 class was originally declared, the program is invalid. */
26837 {
26840 "declaration of %qD in namespace %qD which does not "
26843 else
26849 }
26850 /* [dcl.meaning]
26852 A declarator-id shall not be qualified except for the
26853 definition of a ... nested class outside of its class
26854 ... [or] the definition or explicit instantiation of a
26855 class member of a namespace outside of its namespace. */
26859 }
26860 /* An explicit-specialization must be preceded by "template <>". If
26861 it is not, try to recover gracefully. */
26864 && !processing_template_parmlist
26866 {
26867 /* Build a location of this form:
26868 struct typename <ARGS>
26869 ^~~~~~~~~~~~~~~~~~~~~~
26870 with caret==start at the start token, and
26871 finishing at the end of the type. */
26872 location_t reported_loc
26874 class_head_start_location,
26880 "an explicit specialization must be preceded by"
26883 /* Take the same action that would have been taken by
26884 cp_parser_explicit_specialization. */
26887 }
26888 /* There must be no "return" statements between this point and the
26889 end of this function; set "type "to the correct return value and
26890 use "goto done;" to return. */
26891 /* Make sure that the right number of template parameters were
26892 present. */
26894 template_id_p,
26897 {
26898 /* If something went wrong, there is no point in even trying to
26899 process the class-definition. */
26902 }
26904 /* Look up the type. */
26906 {
26910 {
26914 }
26915 else
26916 {
26920 /* Check the scope while we still know whether or not we had a
26921 nested-name-specifier. */
26924 }
26927 }
26929 {
26932 /* Given:
26934 template <typename T> struct S { struct T };
26935 template <typename T> struct S<T>::T { };
26937 we will get a TYPENAME_TYPE when processing the definition of
26938 `S::T'. We need to resolve it to the actual type before we
26939 try to define it. */
26941 {
26944 {
26947 }
26948 }
26952 {
26955 }
26957 /* Enter the scope indicated by the nested-name-specifier. */
26959 /* Get the canonical version of this type. */
26961 /* Call push_template_decl if it seems like we should be defining a
26962 template either from the template headers or the type we're
26963 defining, so that we diagnose both extra and missing headers. */
26967 {
26970 {
26973 }
26974 }
26978 }
26980 {
26981 /* If the class was unnamed, create a dummy name. */
26989 }
26991 /* Diagnose class/struct/union mismatches. */
26995 /* Indicate whether this class was declared as a `class' or as a
26996 `struct'. */
27000 /* If this type was already complete, and we see another definition,
27001 that's an error. Likewise if the type is already being defined:
27002 this can happen, eg, when it's defined from within an expression
27003 (c++/84605). */
27006 {
27008 type);
27010 type);
27013 }
27018 {
27021 {
27022 /* In a lambda this should work, but doesn't currently. */
27025 }
27027 /* Apply attributes now, before any use of the class as a template
27028 argument in its base list. */
27031 }
27033 /* Associate constraints with the type. */
27037 /* We will have entered the scope containing the class; the names of
27038 base classes should be looked up in that context. For example:
27040 struct A { struct B {}; struct C; };
27041 struct A::C : B {};
27043 is valid. */
27045 /* Get the list of base-classes, if there is one. Defer access checking
27046 until the entire list has been seen, as per [class.access.general]. */
27049 {
27055 }
27056 else
27059 /* If we're really defining a class, process the base classes.
27060 If they're invalid, fail. */
27064 /* Now that all bases have been seen and attached to the class, check
27065 accessibility of the types named in the base-clause. This must be
27066 done relative to the class scope, so that we accept e.g.
27068 struct A { protected: struct B {}; };
27069 struct C : A::B, A {}; // OK: A::B is accessible via base A
27071 as per [class.access.general]. */
27078 done:
27079 /* Leave the scope given by the nested-name-specifier. We will
27080 enter the class scope itself while processing the members. */
27085 {
27088 }
27094 out:
27097 }
27099 /* Parse a class-key.
27101 class-key:
27102 class
27103 struct
27104 union
27106 Returns the kind of class-key specified, or none_type to indicate
27107 error. */
27109 static enum tag_types
27111 {
27115 /* Look for the class-key. */
27120 /* Check to see if the TOKEN is a class-key. */
27125 }
27127 /* Parse a type-parameter-key.
27129 type-parameter-key:
27130 class
27131 typename
27132 */
27134 static void
27136 {
27137 /* Look for the type-parameter-key. */
27141 {
27145 /* typename is not allowed in a template template parameter
27146 by the standard until C++17. */
27148 "ISO C++ forbids typename key in template template parameter;"
27150 }
27151 else
27155 }
27157 /* Parse an (optional) member-specification.
27159 member-specification:
27160 member-declaration member-specification [opt]
27161 access-specifier : member-specification [opt] */
27163 static void
27165 {
27167 {
27171 /* Peek at the next token. */
27173 /* If it's a `}', or EOF then we've seen all the members. */
27179 /* See if this token is a keyword. */
27182 {
27186 /* Consume the access-specifier. */
27188 /* Remember which access-specifier is active. */
27190 /* Look for the `:'. */
27195 /* Accept #pragmas at class scope. */
27197 {
27200 }
27202 /* Otherwise, the next construction must be a
27203 member-declaration. */
27205 }
27206 }
27207 }
27209 /* Parse a member-declaration.
27211 member-declaration:
27212 decl-specifier-seq [opt] member-declarator-list [opt] ;
27213 function-definition ; [opt]
27214 :: [opt] nested-name-specifier template [opt] unqualified-id ;
27215 using-declaration
27216 template-declaration
27217 alias-declaration
27219 member-declarator-list:
27220 member-declarator
27221 member-declarator-list , member-declarator
27223 member-declarator:
27224 declarator pure-specifier [opt]
27225 declarator constant-initializer [opt]
27226 identifier [opt] : constant-expression
27228 GNU Extensions:
27230 member-declaration:
27231 __extension__ member-declaration
27233 member-declarator:
27234 declarator attributes [opt] pure-specifier [opt]
27235 declarator attributes [opt] constant-initializer [opt]
27236 identifier [opt] attributes [opt] : constant-expression
27238 C++0x Extensions:
27240 member-declaration:
27241 static_assert-declaration */
27243 static void
27245 {
27246 cp_decl_specifier_seq decl_specifiers;
27247 tree prefix_attributes;
27248 tree decl;
27257 /* Check for the `__extension__' keyword. */
27259 {
27260 /* Recurse. */
27262 /* Restore the old value of the PEDANTIC flag. */
27266 }
27268 /* Check for a template-declaration. */
27270 {
27271 /* An explicit specialization here is an error condition, and we
27272 expect the specialization handler to detect and report this. */
27276 else
27280 }
27281 /* Check for a template introduction. */
27285 /* Check for a using-declaration. */
27287 {
27289 /* Parse the using-declaration. */
27293 else
27294 {
27295 tree decl;
27299 /* Note that if we actually see the '=' token after the
27300 identifier, cp_parser_alias_declaration commits the
27301 tentative parse. In that case, we really expect an
27302 alias-declaration. Otherwise, we expect a using
27303 declaration. */
27304 alias_decl_expected =
27310 else
27313 }
27315 }
27317 /* Check for @defs. */
27319 {
27324 {
27329 }
27331 }
27333 /* If the next token is `static_assert' we have a static assertion. */
27335 {
27338 }
27342 cp_omp_declare_simd_data odsd;
27346 /* Parse the decl-specifier-seq. */
27349 (CP_PARSER_FLAGS_OPTIONAL
27359 /* Check for an invalid type-name. */
27363 /* If there is no declarator, then the decl-specifier-seq should
27364 specify a type. */
27366 {
27367 /* If there was no decl-specifier-seq, and the next token is a
27368 `;', then we have something like:
27370 struct S { ; };
27372 [class.mem]
27374 Each member-declaration shall declare at least one member
27375 name of the class. */
27377 {
27380 {
27384 }
27385 }
27386 else
27387 {
27388 /* See if this declaration is a friend. */
27390 /* If there were decl-specifiers, check to see if there was
27391 a class-declaration. */
27394 /* Nested classes have already been added to the class, but
27395 a `friend' needs to be explicitly registered. */
27397 {
27398 /* If the `friend' keyword was present, the friend must
27399 be introduced with a class-key. */
27402 "in C++03 a class-key must be used "
27404 /* In this case:
27406 template <typename T> struct A {
27407 friend struct A<T>::B;
27408 };
27410 A<T>::B will be represented by a TYPENAME_TYPE, and
27411 therefore not recognized by check_tag_decl. */
27413 {
27417 }
27418 /* Warn if an attribute cannot appear here, as per
27419 [dcl.attr.grammar]/5. But not when declares_class_or_enum:
27420 we ignore attributes in elaborated-type-specifiers. */
27423 {
27428 "that appertains to a friend declaration that "
27430 }
27433 "friend declaration does not name a class or "
27435 else
27438 }
27439 /* If there is no TYPE, an error message will already have
27440 been issued. */
27442 ;
27443 /* An anonymous aggregate has to be handled specially; such
27444 a declaration really declares a data member (with a
27445 particular type), as opposed to a nested class. */
27447 {
27448 /* C++11 9.5/6. */
27451 "a storage class on an anonymous aggregate "
27454 /* Remove constructors and such from TYPE, now that we
27455 know it is an anonymous aggregate. */
27457 /* And make the corresponding data member. */
27460 /* Add it to the class. */
27462 }
27463 else
27464 cp_parser_check_access_in_redeclaration
27467 }
27468 }
27469 else
27470 {
27473 /* Clear attributes from the decl_specifiers but keep them
27474 around as prefix attributes that apply them to the entity
27475 being declared. */
27483 /* See if these declarations will be friends. */
27486 /* Keep going until we hit the `;' at the end of the
27487 declaration. */
27489 {
27491 tree first_attribute;
27492 tree initializer;
27495 /* Peek at the next token. */
27498 /* The following code wants to know early if it is a bit-field
27499 or some other declaration. Attributes can appear before
27500 the `:' token. Skip over them without consuming any tokens
27501 to peek if they are followed by `:'. */
27506 {
27507 size_t n
27510 }
27512 /* Check for a bitfield declaration. */
27518 {
27519 tree identifier;
27520 tree width;
27522 location_t id_location
27527 else
27530 /* Look for attributes that apply to the bitfield. */
27533 /* Consume the `:' token. */
27536 /* Get the width of the bitfield. */
27540 /* In C++20 and as extension for C++11 and above we allow
27541 default member initializers for bit-fields. */
27546 CPP_OPEN_BRACE)))
27547 {
27548 location_t loc
27553 "default member initializers for bit-fields "
27554 "only available with %<-std=c++20%> or "
27559 {
27563 }
27564 }
27565 else
27566 {
27567 /* Look for attributes that apply to the bitfield after
27568 the `:' token and width. This is where GCC used to
27569 parse attributes in the past, pedwarn if there is
27570 a std attribute. */
27573 "ISO C++ allows bit-field attributes only "
27577 }
27581 /* Remember which attributes are prefix attributes and
27582 which are not. */
27584 /* Combine the attributes. */
27587 /* Create the bitfield declaration. */
27590 identifier,
27591 sfk_none,
27592 id_location)
27596 attributes);
27597 }
27598 else
27599 {
27601 tree asm_specification;
27605 /* We can't delay parsing for friends,
27606 alias-declarations, and typedefs, even though the
27607 standard seems to require it. */
27612 /* Parse the declarator. */
27613 declarator
27615 flags,
27621 /* If something went wrong parsing the declarator, make sure
27622 that we at least consume some tokens. */
27624 {
27625 /* Skip to the end of the statement. */
27627 /* If the next token is not a semicolon, that is
27628 probably because we just skipped over the body of
27629 a function. So, we consume a semicolon if
27630 present, but do not issue an error message if it
27631 is not present. */
27633 CPP_SEMICOLON))
27636 }
27638 /* Handle class-scope non-template C++17 deduction guides. */
27641 declarator,
27645 cp_parser_check_for_definition_in_return_type
27649 /* Look for an asm-specification. */
27651 /* Look for attributes that apply to the declaration. */
27653 /* Remember which attributes are prefix attributes and
27654 which are not. */
27656 /* Combine the attributes. */
27659 /* If it's an `=', then we have a constant-initializer or a
27660 pure-specifier. It is not correct to parse the
27661 initializer before registering the member declaration
27662 since the member declaration should be in scope while
27663 its initializer is processed. However, the rest of the
27664 front end does not yet provide an interface that allows
27665 us to handle this correctly. */
27667 {
27668 /* In [class.mem]:
27670 A pure-specifier shall be used only in the declaration of
27671 a virtual function.
27673 A member-declarator can contain a constant-initializer
27674 only if it declares a static member of integral or
27675 enumeration type.
27677 Therefore, if the DECLARATOR is for a function, we look
27678 for a pure-specifier; otherwise, we look for a
27679 constant-initializer. When we call `grokfield', it will
27680 perform more stringent semantics checks. */
27693 {
27695 /* Don't require a constant rvalue in C++11, since we
27696 might want a reference constant. We'll enforce
27697 constancy later. */
27699 /* Parse the initializer. */
27702 }
27703 else
27704 /* Parse the initializer. */
27706 }
27709 {
27711 declarator->init_loc
27715 else
27717 }
27718 /* Detect invalid bit-field cases such as
27720 int *p : 4;
27721 int &&r : 3;
27723 and similar. */
27725 /* If there were no type specifiers, it was a
27726 constructor. */
27728 {
27729 /* This is called for a decent diagnostic only. */
27738 /* Avoid "extra ;" pedwarns. */
27740 CPP_SEMICOLON))
27743 }
27744 /* Otherwise, there is no initializer. */
27745 else
27748 /* See if we are probably looking at a function
27749 definition. We are certainly not looking at a
27750 member-declarator. Calling `grokfield' has
27751 side-effects, so we must not do it unless we are sure
27752 that we are looking at a member-declarator. */
27755 {
27756 /* The grammar does not allow a pure-specifier to be
27757 used when a member function is defined. (It is
27758 possible that this fact is an oversight in the
27759 standard, since a pure function may be defined
27760 outside of the class-specifier. */
27766 declarator,
27767 attributes);
27771 /* If the member was not a friend, declare it here. */
27774 /* Peek at the next token. */
27776 /* If the next token is a semicolon, consume it. */
27778 {
27779 location_t semicolon_loc
27784 "extra %<;%> after in-class "
27786 }
27788 }
27789 else
27793 /* Create the declaration. */
27799 {
27802 else
27804 }
27805 }
27810 /* Reset PREFIX_ATTRIBUTES. */
27812 {
27817 }
27819 /* If there is any qualification still in effect, clear it
27820 now; we will be starting fresh with the next declarator. */
27824 /* If it's a `,', then there are more declarators. */
27826 {
27829 {
27835 }
27836 }
27837 /* If the next token isn't a `;', then we have a parse error. */
27839 CPP_SEMICOLON))
27840 {
27841 /* The next token might be a ways away from where the
27842 actual semicolon is missing. Find the previous token
27843 and use that for our error position. */
27850 /* Assume that the user meant to provide a semicolon. If
27851 we were to cp_parser_skip_to_end_of_statement, we might
27852 skip to a semicolon inside a member function definition
27853 and issue nonsensical error messages. */
27855 }
27858 {
27859 /* Add DECL to the list of members. */
27861 /* Explicitly include, eg, NSDMIs, for better error
27862 recovery (c++/58650). */
27870 /* Add DECL to the queue of NSDMI to be parsed later. */
27872 }
27876 }
27877 }
27880 out:
27883 }
27885 /* Parse a pure-specifier.
27887 pure-specifier:
27888 = 0
27890 Returns INTEGER_ZERO_NODE if a pure specifier is found.
27891 Otherwise, ERROR_MARK_NODE is returned. */
27893 static tree
27895 {
27898 /* Look for the `=' token. */
27901 /* Look for the `0' token. */
27910 /* Accept = default or = delete in c++0x mode. */
27913 {
27916 }
27918 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
27920 {
27925 }
27927 {
27930 }
27933 }
27935 /* Parse a constant-initializer.
27937 constant-initializer:
27938 = constant-expression
27940 Returns a representation of the constant-expression. */
27942 static tree
27944 {
27945 /* Look for the `=' token. */
27949 /* It is invalid to write:
27951 struct S { static const int i = { 7 }; };
27953 */
27955 {
27958 /* Consume the opening brace. */
27959 matching_braces braces;
27961 /* Skip the initializer. */
27963 /* Look for the trailing `}'. */
27967 }
27970 }
27972 /* Derived classes [gram.class.derived] */
27974 /* Parse a base-clause.
27976 base-clause:
27977 : base-specifier-list
27979 base-specifier-list:
27980 base-specifier ... [opt]
27981 base-specifier-list , base-specifier ... [opt]
27983 Returns a TREE_LIST representing the base-classes, in the order in
27984 which they were declared. The representation of each node is as
27985 described by cp_parser_base_specifier.
27987 In the case that no bases are specified, this function will return
27988 NULL_TREE, not ERROR_MARK_NODE. */
27990 static tree
27992 {
27995 /* Look for the `:' that begins the list. */
27998 /* Scan the base-specifier-list. */
28000 {
28002 tree base;
28005 /* Look for the base-specifier. */
28007 /* Look for the (optional) ellipsis. */
28009 {
28010 /* Consume the `...'. */
28014 }
28016 /* Add BASE to the front of the list. */
28018 {
28020 /* Make this a pack expansion type. */
28024 {
28027 }
28028 }
28029 /* Peek at the next token. */
28031 /* If it's not a comma, then the list is complete. */
28034 /* Consume the `,'. */
28036 }
28038 /* PARSER->SCOPE may still be non-NULL at this point, if the last
28039 base class had a qualified name. However, the next name that
28040 appears is certainly not qualified. */
28046 }
28048 /* Parse a base-specifier.
28050 base-specifier:
28051 :: [opt] nested-name-specifier [opt] class-name
28052 virtual access-specifier [opt] :: [opt] nested-name-specifier
28053 [opt] class-name
28054 access-specifier virtual [opt] :: [opt] nested-name-specifier
28055 [opt] class-name
28057 Returns a TREE_LIST. The TREE_PURPOSE will be one of
28058 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
28059 indicate the specifiers provided. The TREE_VALUE will be a TYPE
28060 (or the ERROR_MARK_NODE) indicating the type that was specified. */
28062 static tree
28064 {
28072 tree type;
28074 /* Process the optional `virtual' and `access-specifier'. */
28076 {
28077 /* Peek at the next token. */
28079 /* Process `virtual'. */
28081 {
28083 /* If `virtual' appears more than once, issue an error. */
28085 {
28089 }
28093 /* Consume the `virtual' token. */
28101 /* If more than one access specifier appears, issue an
28102 error. */
28105 {
28109 }
28113 /* Consume the access-specifier. */
28121 }
28122 }
28123 /* It is not uncommon to see programs mechanically, erroneously, use
28124 the 'typename' keyword to denote (dependent) qualified types
28125 as base classes. */
28127 {
28132 else
28134 "keyword %<typename%> not allowed in this context "
28137 }
28139 /* Look for the optional `::' operator. */
28141 /* Look for the nested-name-specifier. The simplest way to
28142 implement:
28144 [temp.res]
28146 The keyword `typename' is not permitted in a base-specifier or
28147 mem-initializer; in these contexts a qualified name that
28148 depends on a template-parameter is implicitly assumed to be a
28149 type name.
28151 is to pretend that we have seen the `typename' keyword at this
28152 point. */
28158 /* If the base class is given by a qualified name, assume that names
28159 we see are type names or templates, as appropriate. */
28165 /* DR 950 allows decltype as a base-specifier. */
28167 else
28168 {
28169 /* Otherwise, look for the class-name. */
28171 class_scope_p,
28172 template_p,
28173 typename_type,
28178 }
28184 }
28186 /* Exception handling [gram.exception] */
28188 /* Save the tokens that make up the noexcept-specifier for a member-function.
28189 Returns a DEFERRED_PARSE. */
28191 static tree
28193 {
28195 /* We want everything up to, including, the final ')'. */
28199 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
28200 to carry the information we will need. */
28202 /* Save away the noexcept-specifier; we will process it when the
28203 class is complete. */
28208 }
28210 /* Used for late processing of noexcept-specifiers of member-functions.
28211 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
28212 we saved for later; parse it now. DECL is the declaration of the
28213 member function. */
28215 static tree
28217 {
28218 /* Make sure we've gotten something that hasn't been parsed yet. */
28223 /* Push the saved tokens for the noexcept-specifier onto the parser's
28224 lexer stack. */
28228 /* Parse the cached noexcept-specifier. */
28229 tree parsed_arg
28231 CP_PARSER_FLAGS_NONE,
28236 /* Revert to the main lexer. */
28239 /* Restore the queue. */
28242 /* And we're done. */
28244 }
28246 /* Perform late checking of overriding function with respect to their
28247 noexcept-specifiers. FNDECL is the member function that potentially
28248 overrides some virtual function with the same signature. */
28250 static void
28252 {
28254 tree base_binfo;
28260 {
28269 }
28270 }
28272 /* Parse an (optional) noexcept-specification.
28274 noexcept-specification:
28275 noexcept ( constant-expression ) [opt]
28277 If no noexcept-specification is present, returns NULL_TREE.
28278 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
28279 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
28280 there are no parentheses. CONSUMED_EXPR will be set accordingly.
28281 Otherwise, returns a noexcept specification unless RETURN_COND is true,
28282 in which case a boolean condition is returned instead. The parser flags
28283 FLAGS is used to control parsing. QUALS are qualifiers indicating whether
28284 the (member) function is `const'. */
28286 static tree
28288 cp_parser_flags flags,
28292 {
28296 /* Peek at the next token. */
28299 /* Is it a noexcept-specification? */
28301 {
28302 tree expr;
28304 /* [class.mem]/6 says that a noexcept-specifer (within the
28305 member-specification of the class) is a complete-class context of
28306 a class. So, if the noexcept-specifier has the optional expression,
28307 just save the tokens, and reparse this after we're done with the
28308 class. */
28312 /* No need to delay parsing for a number literal or true/false. */
28324 {
28325 matching_parens parens;
28329 {
28330 /* Types may not be defined in an exception-specification. */
28332 parser->type_definition_forbidden_message
28336 expr
28342 {
28345 }
28347 /* Restore the saved message. */
28349 }
28350 else
28351 {
28354 }
28357 }
28358 else
28359 {
28363 }
28365 /* We cannot build a noexcept-spec right away because this will check
28366 that expr is a constexpr. */
28369 else
28371 }
28372 else
28374 }
28376 /* Parse an (optional) exception-specification.
28378 exception-specification:
28379 throw ( type-id-list [opt] )
28381 Returns a TREE_LIST representing the exception-specification. The
28382 TREE_VALUE of each node is a type. The parser flags FLAGS is used to
28383 control parsing. QUALS are qualifiers indicating whether the (member)
28384 function is `const'. */
28386 static tree
28388 cp_parser_flags flags)
28389 {
28391 tree type_id_list;
28394 /* Peek at the next token. */
28397 /* Is it a noexcept-specification? */
28398 type_id_list
28406 /* If it's not `throw', then there's no exception-specification. */
28412 /* Consume the `throw'. */
28415 /* Look for the `('. */
28416 matching_parens parens;
28419 /* Peek at the next token. */
28421 /* If it's not a `)', then there is a type-id-list. */
28423 {
28424 /* Types may not be defined in an exception-specification. */
28426 parser->type_definition_forbidden_message
28428 /* Parse the type-id-list. */
28430 /* Restore the saved message. */
28434 {
28438 }
28441 "dynamic exception specifications are deprecated in "
28443 }
28444 /* In C++17, throw() is equivalent to noexcept (true). throw()
28445 is deprecated in C++11 and above as well, but is still widely used,
28446 so don't warn about it yet. */
28449 else
28452 /* Look for the `)'. */
28456 }
28458 /* Parse an (optional) type-id-list.
28460 type-id-list:
28461 type-id ... [opt]
28462 type-id-list , type-id ... [opt]
28464 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
28465 in the order that the types were presented. */
28467 static tree
28469 {
28473 {
28475 tree type;
28479 /* Get the next type-id. */
28481 /* Check for invalid 'auto'. */
28483 {
28487 }
28488 /* Parse the optional ellipsis. */
28490 {
28491 /* Consume the `...'. */
28494 /* Turn the type into a pack expansion expression. */
28496 }
28497 /* Add it to the list. */
28499 /* Peek at the next token. */
28501 /* If it is not a `,', we are done. */
28504 /* Consume the `,'. */
28506 }
28509 }
28511 /* Parse a try-block.
28513 try-block:
28514 try compound-statement handler-seq */
28516 static tree
28518 {
28519 tree try_block;
28526 "%<try%> in %<constexpr%> function only "
28536 }
28538 /* Parse a function-try-block.
28540 function-try-block:
28541 try ctor-initializer [opt] function-body handler-seq */
28543 static void
28545 {
28546 tree compound_stmt;
28547 tree try_block;
28549 /* Look for the `try' keyword. */
28552 /* Let the rest of the front end know where we are. */
28554 /* Parse the function-body. */
28555 cp_parser_ctor_initializer_opt_and_function_body
28557 /* We're done with the `try' part. */
28559 /* Parse the handlers. */
28561 /* We're done with the handlers. */
28563 }
28565 /* Parse a handler-seq.
28567 handler-seq:
28568 handler handler-seq [opt] */
28570 static void
28572 {
28574 {
28577 /* Parse the handler. */
28579 /* Peek at the next token. */
28581 /* If it's not `catch' then there are no more handlers. */
28584 }
28585 }
28587 /* Parse a handler.
28589 handler:
28590 catch ( exception-declaration ) compound-statement */
28592 static void
28594 {
28595 tree handler;
28596 tree declaration;
28600 matching_parens parens;
28607 }
28609 /* Parse an exception-declaration.
28611 exception-declaration:
28612 type-specifier-seq declarator
28613 type-specifier-seq abstract-declarator
28614 type-specifier-seq
28615 ...
28617 Returns a VAR_DECL for the declaration, or NULL_TREE if the
28618 ellipsis variant is used. */
28620 static tree
28622 {
28623 cp_decl_specifier_seq type_specifiers;
28627 /* If it's an ellipsis, it's easy to handle. */
28629 {
28630 /* Consume the `...' token. */
28633 }
28635 /* Types may not be defined in exception-declarations. */
28637 parser->type_definition_forbidden_message
28640 /* Parse the type-specifier-seq. */
28645 /* If it's a `)', then there is no declarator. */
28648 else
28650 CP_PARSER_FLAGS_NONE,
28657 /* Restore the saved message. */
28664 }
28666 /* Parse a throw-expression.
28668 throw-expression:
28669 throw assignment-expression [opt]
28671 Returns a THROW_EXPR representing the throw-expression. */
28673 static tree
28675 {
28676 tree expression;
28682 /* Figure out whether or not there is an assignment-expression
28683 following the "throw" keyword. */
28691 else
28694 /* Construct a location e.g.:
28695 throw x
28696 ^~~~~~~
28697 with caret == start at the start of the "throw" token, and
28698 the end at the end of the final token we consumed. */
28704 }
28706 /* Parse a yield-expression.
28708 yield-expression:
28709 co_yield assignment-expression
28710 co_yield braced-init-list
28712 Returns a CO_YIELD_EXPR representing the yield-expression. */
28714 static tree
28716 {
28717 tree expr;
28725 {
28728 /* ??? : probably a moot point? */
28731 }
28732 else
28739 }
28741 /* GNU Extensions */
28743 /* Parse an (optional) asm-specification.
28745 asm-specification:
28746 asm ( string-literal )
28748 If the asm-specification is present, returns a STRING_CST
28749 corresponding to the string-literal. Otherwise, returns
28750 NULL_TREE. */
28752 static tree
28754 {
28755 /* Peek at the next token. */
28757 /* If the next token isn't the `asm' keyword, then there's no
28758 asm-specification. */
28762 /* Consume the `asm' token. */
28764 /* Look for the `('. */
28765 matching_parens parens;
28768 /* Look for the string-literal. */
28773 /* Look for the `)'. */
28777 }
28779 /* Parse an asm-operand-list.
28781 asm-operand-list:
28782 asm-operand
28783 asm-operand-list , asm-operand
28785 asm-operand:
28786 string-literal ( expression )
28787 [ string-literal ] string-literal ( expression )
28789 Returns a TREE_LIST representing the operands. The TREE_VALUE of
28790 each node is the expression. The TREE_PURPOSE is itself a
28791 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
28792 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
28793 is a STRING_CST for the string literal before the parenthesis. Returns
28794 ERROR_MARK_NODE if any of the operands are invalid. */
28796 static tree
28798 {
28803 {
28804 tree name;
28807 {
28808 /* Consume the `[' token. */
28810 /* Read the operand name. */
28815 /* Look for the closing `]'. */
28817 }
28818 else
28820 /* Look for the string-literal. */
28825 /* Look for the `('. */
28826 matching_parens parens;
28828 /* Parse the expression. */
28830 /* Look for the `)'. */
28838 /* Add this operand to the list. */
28840 expression,
28841 asm_operands);
28842 /* If the next token is not a `,', there are no more
28843 operands. */
28846 /* Consume the `,'. */
28848 }
28851 }
28853 /* Parse an asm-clobber-list.
28855 asm-clobber-list:
28856 string-literal
28857 asm-clobber-list , string-literal
28859 Returns a TREE_LIST, indicating the clobbers in the order that they
28860 appeared. The TREE_VALUE of each node is a STRING_CST. */
28862 static tree
28864 {
28868 {
28869 /* Look for the string literal. */
28873 /* Add it to the list. */
28875 /* If the next token is not a `,', then the list is
28876 complete. */
28879 /* Consume the `,' token. */
28881 }
28884 }
28886 /* Parse an asm-label-list.
28888 asm-label-list:
28889 identifier
28890 asm-label-list , identifier
28892 Returns a TREE_LIST, indicating the labels in the order that they
28893 appeared. The TREE_VALUE of each node is a label. */
28895 static tree
28897 {
28901 {
28904 /* Look for the identifier. */
28907 {
28910 {
28916 }
28917 }
28918 /* If the next token is not a `,', then the list is
28919 complete. */
28922 /* Consume the `,' token. */
28924 }
28927 }
28929 /* Return TRUE iff the next tokens in the stream are possibly the
28930 beginning of a GNU extension attribute. */
28932 static bool
28934 {
28936 }
28938 /* Return TRUE iff the next tokens in the stream are possibly the
28939 beginning of a standard C++-11 attribute specifier. */
28941 static bool
28943 {
28945 }
28947 /* Return TRUE iff the next Nth tokens in the stream are possibly the
28948 beginning of a standard C++-11 attribute specifier. */
28950 static bool
28952 {
28960 }
28962 /* Return TRUE iff the next Nth tokens in the stream are possibly the
28963 beginning of a GNU extension attribute. */
28965 static bool
28967 {
28971 }
28973 /* Return true iff the next tokens can be the beginning of either a
28974 GNU attribute list, or a standard C++11 attribute sequence. */
28976 static bool
28978 {
28981 }
28983 /* Return true iff the next Nth tokens can be the beginning of either
28984 a GNU attribute list, or a standard C++11 attribute sequence. */
28986 static bool
28988 {
28991 }
28993 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
28994 of GNU attributes, or return NULL. */
28996 static tree
28998 {
29001 {
29006 else
29008 }
29010 }
29012 /* Parse an (optional) series of attributes.
29014 attributes:
29015 attributes attribute
29017 attribute:
29018 __attribute__ (( attribute-list [opt] ))
29020 The return value is as for cp_parser_gnu_attribute_list. */
29022 static tree
29024 {
29031 {
29033 tree attribute_list;
29036 /* Peek at the next token. */
29038 /* If it's not `__attribute__', then we're done. */
29042 /* Consume the `__attribute__' keyword. */
29044 /* Look for the two `(' tokens. */
29045 matching_parens outer_parens;
29048 matching_parens inner_parens;
29052 /* Peek at the next token. */
29055 /* Parse the attribute-list. */
29057 else
29058 /* If the next token is a `)', then there is no attribute
29059 list. */
29062 /* Look for the two `)' tokens. */
29070 /* Add these new attributes to the list. */
29072 }
29075 }
29077 /* Parse a GNU attribute-list.
29079 attribute-list:
29080 attribute
29081 attribute-list , attribute
29083 attribute:
29084 identifier
29085 identifier ( identifier )
29086 identifier ( identifier , expression-list )
29087 identifier ( expression-list )
29089 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
29090 to an attribute. The TREE_PURPOSE of each node is the identifier
29091 indicating which attribute is in use. The TREE_VALUE represents
29092 the arguments, if any. */
29094 static tree
29096 {
29100 /* Don't create wrapper nodes within attributes: the
29101 handlers don't know how to handle them. */
29102 auto_suppress_location_wrappers sentinel;
29106 {
29108 tree identifier;
29109 tree attribute;
29111 /* Look for the identifier. We also allow keywords here; for
29112 example `__attribute__ ((const))' is legal. */
29116 {
29119 /* Consume the token, but save it since we need it for the
29120 SIMD enabled function parsing. */
29123 /* Save away the identifier that indicates which attribute
29124 this is. */
29126 /* For keywords, use the canonical spelling, not the
29127 parsed identifier. */
29134 /* Peek at the next token. */
29136 /* If it's an `(', then parse the attribute arguments. */
29138 {
29144 vec = cp_parser_parenthesized_expression_list
29150 else
29151 {
29154 }
29155 /* Save the arguments away. */
29157 }
29160 {
29161 /* Add this attribute to the list. */
29164 }
29167 }
29168 /* Unless EXACTLY_ONE is set look for more attributes.
29169 If the next token isn't a `,', we're done. */
29173 /* Consume the comma and keep going. */
29175 }
29178 /* We built up the list in reverse order. */
29180 }
29182 /* Parse arguments of omp::directive attribute.
29184 ( directive-name ,[opt] clause-list[opt] )
29186 For directive just remember the first/last tokens for subsequent
29187 parsing. */
29189 static void
29191 {
29194 {
29200 }
29203 {
29209 }
29218 }
29220 /* Parse arguments of omp::sequence attribute.
29222 ( omp::[opt] directive-attr [ , omp::[opt] directive-attr ]... ) */
29224 static void
29226 {
29227 matching_parens parens;
29229 do
29230 {
29235 {
29239 }
29244 else
29249 {
29258 }
29262 UNKNOWN_LOCATION);
29265 else
29270 }
29275 }
29277 /* Parse a standard C++11 attribute.
29279 The returned representation is a TREE_LIST which TREE_PURPOSE is
29280 the scoped name of the attribute, and the TREE_VALUE is its
29281 arguments list.
29283 Note that the scoped name of the attribute is itself a TREE_LIST
29284 which TREE_PURPOSE is the namespace of the attribute, and
29285 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
29286 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
29287 and which TREE_PURPOSE is directly the attribute name.
29289 Clients of the attribute code should use get_attribute_namespace
29290 and get_attribute_name to get the actual namespace and name of
29291 attributes, regardless of their being GNU or C++11 attributes.
29293 attribute:
29294 attribute-token attribute-argument-clause [opt]
29296 attribute-token:
29297 identifier
29298 attribute-scoped-token
29300 attribute-scoped-token:
29301 attribute-namespace :: identifier
29303 attribute-namespace:
29304 identifier
29306 attribute-argument-clause:
29307 ( balanced-token-seq )
29309 balanced-token-seq:
29310 balanced-token [opt]
29311 balanced-token-seq balanced-token
29313 balanced-token:
29314 ( balanced-token-seq )
29315 [ balanced-token-seq ]
29316 { balanced-token-seq }. */
29318 static tree
29320 {
29327 /* First, parse name of the attribute, a.k.a attribute-token. */
29344 {
29345 /* We are seeing a scoped attribute token. */
29360 else
29361 {
29365 }
29371 NULL_TREE);
29373 }
29375 {
29379 NULL_TREE);
29380 }
29381 else
29382 {
29385 NULL_TREE);
29387 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
29388 but no longer: we have to be able to tell [[noreturn]] and
29389 __attribute__((noreturn)) apart. */
29390 /* C++14 deprecated attribute is equivalent to GNU's. */
29393 /* C++17 fallthrough attribute is equivalent to GNU's. */
29396 /* C++23 assume attribute is equivalent to GNU's. */
29399 /* Transactional Memory TS optimize_for_synchronized attribute is
29400 equivalent to GNU transaction_callable. */
29404 /* Transactional Memory attributes are GNU attributes. */
29407 }
29409 /* Now parse the optional argument clause of the attribute. */
29412 {
29417 {
29419 attr_id);
29421 }
29423 }
29425 {
29429 /* Maybe we don't expect to see any arguments for this attribute. */
29433 {
29435 attr_id);
29441 }
29445 /* The assume attribute needs special handling of the argument. */
29449 /* A GNU attribute that takes an identifier in parameter. */
29452 /* If this is a fake attribute created to handle -Wno-attributes,
29453 we must skip parsing the arguments. */
29455 {
29457 {
29459 {
29462 }
29464 {
29470 }
29471 }
29473 /* For unknown attributes, just skip balanced tokens instead of
29474 trying to parse the arguments. Set TREE_VALUE (attribute) to
29475 error_mark_node to distinguish skipped arguments from attributes
29476 with no arguments. */
29481 }
29483 vec = cp_parser_parenthesized_expression_list
29489 else
29490 {
29492 /* e.g. [[attr()]]. */
29495 attr_id);
29498 }
29502 else
29504 }
29507 }
29509 /* Warn if the attribute ATTRIBUTE appears more than once in the
29510 attribute-list ATTRIBUTES. This used to be enforced for certain
29511 attributes, but the restriction was removed in P2156.
29512 LOC is the location of ATTRIBUTE. Returns true if ATTRIBUTE was not
29513 found in ATTRIBUTES. */
29515 static bool
29517 {
29526 {
29531 }
29533 }
29535 /* Parse a list of standard C++-11 attributes.
29537 attribute-list:
29538 attribute [opt]
29539 attribute-list , attribute[opt]
29540 attribute ...
29541 attribute-list , attribute ...
29542 */
29544 static tree
29546 {
29551 {
29557 {
29559 {
29562 }
29563 }
29566 {
29572 {
29576 }
29578 {
29583 }
29585 }
29589 }
29592 }
29594 /* Optionally parse a C++20 contract role. A NULL return means that no
29595 contract role was specified.
29597 contract-role:
29598 % default
29599 % identifier
29601 If the identifier does not name a known contract role, it will
29602 be assumed to be default. Returns the identifier for the role
29603 token. */
29605 static tree
29607 {
29617 else
29618 {
29621 }
29624 /* FIXME: Warn about invalid/unknown roles? */
29626 }
29628 /* Parse an optional contract mode.
29630 contract-mode:
29631 contract-semantic
29632 [contract-level] [contract-role]
29634 contract-semantic:
29635 check_never_continue
29636 check_maybe_continue
29637 check_always_continue
29639 contract-level:
29640 default
29641 audit
29642 axiom
29644 contract-role:
29645 default
29646 identifier
29648 This grammar is taken from P1332R0. During parsing, this sets options
29649 on the MODE object to determine the configuration of the contract.
29651 Returns a tree containing the identifiers used in the configuration.
29652 This is either an IDENTIFIER with the literal semantic or a TREE_LIST
29653 whose TREE_VALUE is the contract-level and whose TREE_PURPOSE is the
29654 contract-role, if any. NULL_TREE is returned if no information is
29655 given (i.e., all defaults selected). */
29657 static tree
29660 {
29661 /* The mode is empty; the level and role are default. */
29665 /* There is only a role; the level is default. */
29667 {
29670 }
29672 /* Otherwise, match semantic or level. */
29676 tree config_id;
29678 {
29681 /* Either a named level, a concrete semantic, or an identifier
29682 for a postcondition. */
29687 /* The identifier is the return value for a postcondition. */
29691 }
29693 {
29696 }
29697 else
29698 {
29699 /* We got some other token other than a ':'. */
29702 }
29704 /* Consume the literal semantic or level token. */
29708 {
29710 "expected contract level: "
29713 }
29715 /* We matched an explicit semantic. */
29717 {
29719 {
29723 }
29725 }
29727 /* We matched a level, there may be a role; otherwise this is default. */
29729 {
29732 }
29735 }
29737 static tree
29739 {
29743 }
29745 static bool
29747 {
29749 }
29751 /* Parse a standard C++20 contract attribute specifier.
29753 contract-attribute-specifier:
29754 [ [ assert contract-level [opt] : conditional-expression ] ]
29755 [ [ pre contract-level [opt] : conditional-expression ] ]
29756 [ [ post contract-level [opt] identifier [opt] : conditional-expression ] ]
29758 For free functions, we cannot determine the type of the postcondition
29759 identifier because the we haven't called grokdeclarator yet. In those
29760 cases we parse the postcondition as if the identifier was declared as
29761 'auto <identifier>'. We then instantiate the postcondition once the
29762 return type is known.
29764 For member functions, contracts are in the complete-class context, so the
29765 parse is deferred. We also have the return type avaialable (unless it's
29766 deduced), so we don't need to parse the postcondition in terms of a
29767 placeholder. */
29769 static tree
29771 {
29779 /* Parse the optional mode. */
29782 /* Check for postcondition identifiers. */
29783 cp_expr identifier;
29791 /* Defer the parsing of pre/post contracts inside class definitions. */
29792 tree contract;
29794 current_class_type &&
29796 {
29797 /* Skip until we reach an unenclose ']'. If we ran into an unnested ']'
29798 that doesn't close the attribute, return an error and let the attribute
29799 handling code emit an error for missing ']]'. */
29803 CPP_CLOSE_SQUARE,
29810 /* Build a deferred-parse node. */
29815 /* And its corresponding contract. */
29817 }
29818 else
29819 {
29820 /* Enable location wrappers when parsing contracts. */
29823 /* Build a fake variable for the result identifier. */
29826 {
29830 }
29832 /* Parse the condition, ensuring that parameters or the return variable
29833 aren't flagged for use outside the body of a function. */
29838 /* Try to recover from errors by scanning up to the end of the
29839 attribute. Sometimes we get partially parsed expressions, so
29840 we need to search the condition for errors. */
29844 /* Build the contract. */
29847 /* Leave our temporary scope for the postcondition result. */
29849 {
29852 }
29853 }
29856 {
29859 }
29862 }
29864 /* Parse a contract condition for a deferred contract. */
29867 tree fn,
29868 tree attribute)
29869 {
29872 /* Make sure we've gotten something that hasn't been parsed yet or that
29873 we're not parsing an invalid contract. */
29882 /* Build a fake variable for the result identifier. */
29885 {
29886 /* TODO: Can we guarantee that the identifier has a location? */
29890 {
29893 }
29898 }
29900 /* 'this' is not allowed in preconditions of constructors or in postconditions
29901 of destructors. Note that the previous value of this variable is
29902 established by the calling function, so we need to save it here. */
29907 {
29910 }
29914 /* Push the saved tokens onto the parser's lexer stack. */
29918 /* Parse the condition, ensuring that parameters or the return variable
29919 aren't flagged for use outside the body of a function. */
29924 /* Revert to the main lexer. */
29927 /* Restore the queue. */
29933 /* Commit to changes. */
29936 /* Leave our temporary scope for the postcondition result. */
29938 {
29941 }
29942 }
29944 /* Parse a standard C++-11 attribute specifier.
29946 attribute-specifier:
29947 [ [ attribute-using-prefix [opt] attribute-list ] ]
29948 contract-attribute-specifier
29949 alignment-specifier
29951 attribute-using-prefix:
29952 using attribute-namespace :
29954 alignment-specifier:
29955 alignas ( type-id ... [opt] )
29956 alignas ( alignment-expression ... [opt] ).
29958 Extensions for contracts:
29960 contract-attribute-specifier:
29961 [ [ assert : contract-mode [opt] : conditional-expression ] ]
29962 [ [ pre : contract-mode [opt] : conditional-expression ] ]
29963 [ [ post : contract-mode [opt] identifier [opt] :
29964 conditional-expression ] ] */
29966 static tree
29968 {
29974 {
29983 {
29986 }
29988 /* Handle contract-attribute-specs specially. */
29990 {
29995 }
29998 {
30009 {
30012 "attribute using prefix only available "
30018 }
30019 else
30021 }
30025 finish_attrs:
30029 else
30030 /* Warn about parsing c++11 attribute in non-c++11 mode, only
30031 when we are sure that we have actually parsed them. */
30033 }
30034 else
30035 {
30036 tree alignas_expr;
30038 /* Look for an alignment-specifier. */
30049 matching_parens parens;
30057 {
30064 }
30069 /* Handle alignas (pack...). */
30071 {
30074 }
30076 /* Something went wrong, so don't build the attribute. */
30080 /* Missing ')' means the code cannot possibly be valid; go ahead
30081 and commit to make sure we issue a hard error. */
30089 /* Build the C++-11 representation of an 'aligned'
30090 attribute. */
30091 attributes
30094 }
30097 }
30099 /* Parse a standard C++-11 attribute-specifier-seq.
30101 attribute-specifier-seq:
30102 attribute-specifier-seq [opt] attribute-specifier */
30104 static tree
30106 {
30110 /* Don't create wrapper nodes within attributes: the
30111 handlers don't know how to handle them. */
30112 auto_suppress_location_wrappers sentinel;
30115 {
30124 else
30127 }
30130 }
30132 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
30133 return index of the first token after balanced-token, or N on failure. */
30135 static size_t
30137 {
30140 do
30142 {
30146 /* FALLTHRU */
30148 /* Ran out of tokens. */
30170 }
30173 }
30175 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
30176 return index of the first token after the GNU attribute tokens, or N on
30177 failure. */
30179 static size_t
30181 {
30183 {
30195 }
30197 }
30199 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
30200 next token), return index of the first token after the standard C++11
30201 attribute tokens, or N on failure. */
30203 static size_t
30205 {
30207 {
30210 {
30217 }
30220 {
30225 }
30226 else
30228 }
30230 }
30232 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
30233 as the next token), return index of the first token after the attribute
30234 tokens, or N on failure. */
30236 static size_t
30238 {
30242 }
30244 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
30245 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
30246 current value of the PEDANTIC flag, regardless of whether or not
30247 the `__extension__' keyword is present. The caller is responsible
30248 for restoring the value of the PEDANTIC flag. */
30250 static bool
30252 {
30253 /* Save the old value of the PEDANTIC flag. */
30257 {
30258 /* Consume the `__extension__' token. */
30260 /* We're not being pedantic while the `__extension__' keyword is
30261 in effect. */
30265 }
30268 }
30270 /* Parse a label declaration.
30272 label-declaration:
30273 __label__ label-declarator-seq ;
30275 label-declarator-seq:
30276 identifier , label-declarator-seq
30277 identifier */
30279 static void
30281 {
30282 /* Look for the `__label__' keyword. */
30286 {
30287 tree identifier;
30289 /* Look for an identifier. */
30291 /* If we failed, stop. */
30294 /* Declare it as a label. */
30296 /* If the next token is a `;', stop. */
30299 /* Look for the `,' separating the label declarations. */
30301 }
30303 /* Look for the final `;'. */
30305 }
30307 // -------------------------------------------------------------------------- //
30308 // Concept definitions
30310 static tree
30312 {
30313 /* A concept definition is an unevaluated context. */
30314 cp_unevaluated u;
30321 {
30325 }
30330 {
30334 }
30336 processing_constraint_expression_sentinel parsing_constraint;
30341 /* Consume the trailing ';'. Diagnose the problem if it isn't there,
30342 but continue as if it were. */
30346 }
30348 // -------------------------------------------------------------------------- //
30349 // Requires Clause
30351 /* Diagnose an expression that should appear in ()'s within a requires-clause
30352 and suggest where to place those parentheses. */
30354 static void
30356 {
30358 }
30360 static void
30362 {
30367 }
30369 /* Characterizes the likely kind of expression intended by a mis-written
30370 primary constraint. */
30371 enum primary_constraint_error
30372 {
30373 pce_ok,
30374 pce_maybe_operator,
30375 pce_maybe_postfix
30376 };
30378 /* Returns true if the token(s) following a primary-expression in a
30379 constraint-logical-* expression would require parentheses. */
30381 static primary_constraint_error
30383 {
30386 {
30391 {
30392 /* An equal sign may be part of the definition of a function,
30393 and not an assignment operator, when parsing the expression
30394 for a trailing requires-clause. For example:
30396 template<typename T>
30397 struct S {
30398 S() requires C<T> = default;
30399 };
30401 Don't try to reparse this a binary operator. */
30407 }
30409 /* Arithmetic operators. */
30415 /* Bitwise operators. */
30421 /* Relational operators. */
30429 /* Pointer-to-member. */
30432 /* Assignment operators. */
30443 /* Conditional operator */
30445 /* Unenclosed binary or conditional operator. */
30449 {
30450 /* A primary constraint that precedes the parameter-list of a
30451 lambda expression is followed by an open paren.
30453 []<typename T> requires C (T a, T b) { ... }
30455 Don't try to re-parse this as a postfix expression. */
30460 }
30462 {
30463 /* A primary-constraint-expression followed by a '[[' is not a
30464 postfix expression. */
30469 }
30473 /* Unenclosed postfix operator. */
30477 /* A primary constraint that precedes the lambda-declarator of a
30478 lambda expression is followed by trailing return type.
30480 []<typename T> requires C -> void {}
30482 Don't try to re-parse this as a postfix expression in
30483 C++23 and later. In C++20 ( needs to come in between but we
30484 allow it to be omitted with pedwarn. */
30487 /* Unenclosed postfix operator. */
30489 }
30490 }
30492 /* Returns true if the next token begins a unary expression, preceded by
30493 an operator or keyword. */
30495 static bool
30497 {
30500 {
30511 {
30513 {
30529 }
30530 }
30534 }
30537 }
30539 /* Parse a primary expression within a constraint. */
30541 static cp_expr
30543 {
30544 /* If this looks like a unary expression, parse it as such, but diagnose
30545 it as ill-formed; it requires parens. */
30547 {
30551 }
30554 cp_id_kind idk;
30565 {
30566 /* The primary-expression could be part of an unenclosed non-logical
30567 compound expression. */
30569 }
30571 {
30574 }
30576 /* Retry the parse at a lower precedence. If that succeeds, diagnose the
30577 error, but return the expression as if it were valid. */
30582 else
30585 {
30588 }
30590 /* Otherwise, something has gone very wrong, and we can't generate a more
30591 meaningful diagnostic or recover. */
30594 }
30596 /* Parse a constraint-logical-and-expression.
30598 constraint-logical-and-expression:
30599 primary-expression
30600 constraint-logical-and-expression '&&' primary-expression */
30602 static cp_expr
30604 {
30607 {
30611 }
30613 }
30615 /* Parse a constraint-logical-or-expression.
30617 constraint-logical-or-expression:
30618 constraint-logical-and-expression
30619 constraint-logical-or-expression '||' constraint-logical-and-expression */
30621 static cp_expr
30623 {
30626 {
30630 }
30632 }
30634 /* Parse the expression after a requires-clause. This has a different grammar
30635 than that in the concepts TS. */
30637 static tree
30639 {
30640 processing_constraint_expression_sentinel parsing_constraint;
30647 }
30649 /* Parse a expression after a requires clause.
30651 constraint-expression:
30652 logical-or-expression
30654 The required logical-or-expression must be a constant expression. Note
30655 that we don't check that the expression is constepxr here. We defer until
30656 we analyze constraints and then, we only check atomic constraints. */
30658 static tree
30660 {
30661 processing_constraint_expression_sentinel parsing_constraint;
30670 }
30672 /* Optionally parse a requires clause:
30674 requires-clause:
30675 `requires` constraint-logical-or-expression.
30676 [ConceptsTS]
30677 `requires constraint-expression.
30679 LAMBDA_P is true when the requires-clause is parsed before the
30680 parameter-list of a lambda-declarator. */
30682 static tree
30684 {
30685 /* A requires clause is an unevaluated context. */
30686 cp_unevaluated u;
30690 {
30693 {
30695 "%<requires%> only available with "
30697 /* Parse and discard the requires-clause. */
30700 }
30702 }
30706 {
30707 /* An opening brace following the start of a requires-clause is
30708 ill-formed; the user likely forgot the second `requires' that
30709 would start a requires-expression. */
30714 /* Don't consume the `requires', so that it's reused as the start of a
30715 requires-expression. */
30716 }
30717 else
30722 else
30724 }
30726 /*---------------------------------------------------------------------------
30727 Requires expressions
30728 ---------------------------------------------------------------------------*/
30730 /* Parse a requires expression
30732 requirement-expression:
30733 'requires' requirement-parameter-list [opt] requirement-body */
30735 static tree
30737 {
30741 /* Avoid committing to outer tentative parse. */
30744 /* This is definitely a requires-expression. */
30748 {
30749 /* Local parameters are delared as variables within the scope
30750 of the expression. They are not visible past the end of
30751 the expression. Expressions within the requires-expression
30752 are unevaluated. */
30753 struct scope_sentinel
30754 {
30756 {
30760 }
30763 {
30766 }
30769 /* Parse the optional parameter list. */
30771 {
30775 }
30776 else
30779 /* Parse the requirement body. */
30785 }
30787 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
30788 the parm chain. */
30793 {
30794 /* Perform semantic processing now to diagnose any invalid types and
30795 expressions. */
30800 }
30802 }
30804 /* Parse a parameterized requirement.
30806 requirement-parameter-list:
30807 '(' parameter-declaration-clause ')' */
30809 static tree
30811 {
30812 matching_parens parens;
30816 tree parms = (cp_parser_parameter_declaration_clause
30822 /* Modify the declared parameters by removing their context
30823 so they don't refer to the enclosing scope and explicitly
30824 indicating that they are constraint variables. */
30826 {
30831 {
30834 }
30835 }
30838 }
30840 /* Parse the body of a requirement.
30842 requirement-body:
30843 '{' requirement-list '}' */
30844 static tree
30846 {
30847 matching_braces braces;
30857 }
30859 /* Parse a sequence of requirements.
30861 requirement-seq:
30862 requirement
30863 requirement-seq requirement */
30865 static tree
30867 {
30869 do
30870 {
30874 }
30878 /* If there are no valid requirements, this is not a valid expression. */
30882 /* Reverse the order of requirements so they are analyzed in order. */
30884 }
30886 /* Parse a syntactic requirement or type requirement.
30888 requirement:
30889 simple-requirement
30890 compound-requirement
30891 type-requirement
30892 nested-requirement */
30894 static tree
30896 {
30900 {
30901 /* It's probably a type-requirement. */
30906 /* No, maybe it's something like typename T::type(); */
30911 /* Non-tentative for the error. */
30913 }
30916 else
30918 }
30920 /* Parse a simple requirement.
30922 simple-requirement:
30923 expression ';' */
30925 static tree
30927 {
30938 /* Sometimes we don't get locations, so use the cached token location
30939 as a reasonable approximation. */
30944 {
30947 {
30950 }
30952 {
30956 "if a concept-id is a valid expression; add "
30958 }
30960 }
30963 }
30965 /* Parse a type requirement
30967 type-requirement
30968 nested-name-specifier [opt] required-type-name ';'
30970 required-type-name:
30971 type-name
30972 'template' [opt] simple-template-id */
30974 static tree
30976 {
30980 // Save the scope before parsing name specifiers.
30991 tree type;
30993 {
31002 }
31003 else
31023 }
31025 /* Parse a compound requirement
31027 compound-requirement:
31028 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
31030 static tree
31032 {
31033 /* Parse an expression enclosed in '{ }'s. */
31034 matching_braces braces;
31045 {
31049 }
31051 /* If the expression was invalid, skip the remainder of the requirement. */
31053 {
31057 }
31059 /* Parse the optional noexcept. */
31062 {
31065 }
31067 /* Parse the optional trailing return type. */
31070 {
31076 /* C++20 allows either a type-id or a type-constraint. Parsing
31077 a type-id will subsume the parsing for a type-constraint but
31078 allow for more syntactic forms (e.g., const C<T>*). */
31087 /* Check that we haven't written something like 'const C<T>*'. */
31089 {
31091 {
31096 }
31097 }
31099 /* P1452R2 removed the trailing-return-type option. */
31102 }
31114 }
31116 /* Parse a nested requirement. This is the same as a requires clause.
31118 nested-requirement:
31119 requires-clause */
31121 static tree
31123 {
31135 }
31137 /* Support Functions */
31139 /* Return the appropriate prefer_type argument for lookup_name based on
31140 tag_type. */
31144 {
31146 {
31150 }
31151 }
31153 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
31154 NAME should have one of the representations used for an
31155 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
31156 is returned. If PARSER->SCOPE is a dependent type, then a
31157 SCOPE_REF is returned.
31159 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
31160 returned; the name was already resolved when the TEMPLATE_ID_EXPR
31161 was formed. Abstractly, such entities should not be passed to this
31162 function, because they do not need to be looked up, but it is
31163 simpler to check for this special case here, rather than at the
31164 call-sites.
31166 In cases not explicitly covered above, this function returns a
31167 DECL, OVERLOAD, or baselink representing the result of the lookup.
31168 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
31169 is returned.
31171 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
31172 (e.g., "struct") that was used. In that case bindings that do not
31173 refer to types are ignored.
31175 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
31176 ignored.
31178 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
31179 are ignored.
31181 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
31182 types.
31184 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
31185 TREE_LIST of candidates if name-lookup results in an ambiguity, and
31186 NULL_TREE otherwise. */
31188 static cp_expr
31195 location_t name_location)
31196 {
31197 tree decl;
31200 /* Assume that the lookup will be unambiguous. */
31204 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
31205 no longer valid. Note that if we are parsing tentatively, and
31206 the parse fails, OBJECT_TYPE will be automatically restored. */
31212 /* A template-id has already been resolved; there is no lookup to
31213 do. */
31217 {
31221 }
31223 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
31224 it should already have been checked to make sure that the name
31225 used matches the type being destroyed. */
31227 {
31228 tree type;
31230 /* Figure out to which type this destructor applies. */
31235 else
31237 /* If that's not a class type, there is no destructor. */
31241 /* In a non-static member function, check implicit this->. */
31244 tf_warning_or_error);
31253 }
31255 /* By this point, the NAME should be an ordinary identifier. If
31256 the id-expression was a qualified name, the qualifying scope is
31257 stored in PARSER->SCOPE at this point. */
31260 /* Perform the lookup. */
31262 {
31268 /* If the SCOPE is dependent, the lookup must be deferred until
31269 the template is instantiated -- unless we are explicitly
31270 looking up names in uninstantiated templates. Even then, we
31271 cannot look up the name if the scope is not a class type; it
31272 might, for example, be a template type parameter. */
31277 /* Defer lookup. */
31279 else
31280 {
31283 /* If PARSER->SCOPE is a dependent type, then it must be a
31284 class type, and we must not be checking dependencies;
31285 otherwise, we would have processed this lookup above. So
31286 that PARSER->SCOPE is not considered a dependent base by
31287 lookup_member, we must enter the scope here. */
31291 /* If the PARSER->SCOPE is a template specialization, it
31292 may be instantiated during name lookup. In that case,
31293 errors may be issued. Even if we rollback the current
31294 tentative parse, those errors are valid. */
31299 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
31300 lookup result and the nested-name-specifier nominates a class C:
31301 * if the name specified after the nested-name-specifier, when
31302 looked up in C, is the injected-class-name of C (Clause 9), or
31303 * if the name specified after the nested-name-specifier is the
31304 same as the identifier or the simple-template-id's template-
31305 name in the last component of the nested-name-specifier,
31306 the name is instead considered to name the constructor of
31307 class C. [ Note: for example, the constructor is not an
31308 acceptable lookup result in an elaborated-type-specifier so
31309 the constructor would not be used in place of the
31310 injected-class-name. --end note ] Such a constructor name
31311 shall be used only in the declarator-id of a declaration that
31312 names a constructor or in a using-declaration. */
31322 }
31324 /* If the scope is a dependent type and either we deferred lookup or
31325 we did lookup but didn't find the name, rememeber the name. */
31328 {
31330 {
31331 tree type;
31333 /* The resolution to Core Issue 180 says that `struct
31334 A::B' should be considered a type-name, even if `A'
31335 is dependent. */
31340 }
31344 CPP_CLOSE_PAREN)))
31348 else
31351 is_template);
31352 }
31355 }
31357 {
31360 /* Look up the name in the scope of the OBJECT_TYPE, unless the
31361 OBJECT_TYPE is not a class. */
31363 /* If the OBJECT_TYPE is a template specialization, it may
31364 be instantiated during name lookup. In that case, errors
31365 may be issued. Even if we rollback the current tentative
31366 parse, those errors are valid. */
31368 name,
31371 tf_warning_or_error);
31372 else
31376 /* Look it up in the enclosing context. DR 141: When looking for a
31377 template-name after -> or ., only consider class templates. */
31379 /* DR 141: When looking in the
31380 current enclosing context for a
31381 template-name after -> or ., only
31382 consider class templates. */
31386 /* If we did unqualified lookup of a dependent member-qualified name and
31387 found something, do we want to use it? P1787 clarified that we need
31388 to look in the object scope first even if it's dependent, but for now
31389 let's still use it in some cases.
31390 FIXME remember unqualified lookup result to use if member lookup fails
31391 at instantiation time. */
31393 {
31395 /* Only use the unqualified class template lookup if we're actually
31396 looking at a template arg list. */
31399 }
31401 /* If we know we're looking for a type (e.g. A in p->A::x),
31402 mock up a typename. */
31405 {
31407 typename_type);
31409 }
31413 }
31414 else
31415 {
31420 }
31422 /* If the lookup failed, let our caller know. */
31426 /* If we have resolved the name of a member declaration, check to
31427 see if the declaration is accessible. When the name resolves to
31428 set of overloaded functions, accessibility is checked when
31429 overload resolution is done. If we have a TREE_LIST, then the lookup
31430 is either ambiguous or it found multiple injected-class-names, the
31431 accessibility of which is trivially satisfied.
31433 During an explicit instantiation, access is not checked at all,
31434 as per [temp.explicit]. */
31437 tf_warning_or_error);
31439 /* Pull out the template from an injected-class-name (or multiple). */
31443 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
31445 {
31448 /* The error message we have to print is too complicated for
31449 cp_parser_error, so we incorporate its actions directly. */
31451 {
31453 name);
31455 }
31457 }
31468 }
31470 /* Like cp_parser_lookup_name, but for use in the typical case where
31471 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
31472 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
31474 static tree
31476 {
31478 none_type,
31483 location);
31484 }
31486 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
31487 the current context, return the TYPE_DECL. If TAG_NAME_P is
31488 true, the DECL indicates the class being defined in a class-head,
31489 or declared in an elaborated-type-specifier.
31491 Otherwise, return DECL. */
31493 static tree
31495 {
31496 /* If the TEMPLATE_DECL is being declared as part of a class-head,
31497 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
31499 struct A {
31500 template <typename T> struct B;
31501 };
31503 template <typename T> struct A::B {};
31505 Similarly, in an elaborated-type-specifier:
31507 namespace N { struct X{}; }
31509 struct A {
31510 template <typename T> friend struct N::X;
31511 };
31513 However, if the DECL refers to a class type, and we are in
31514 the scope of the class, then the name lookup automatically
31515 finds the TYPE_DECL created by build_self_reference rather
31516 than a TEMPLATE_DECL. For example, in:
31518 template <class T> struct S {
31519 S s;
31520 };
31522 there is no need to handle such case. */
31528 }
31530 /* If too many, or too few, template-parameter lists apply to the
31531 declarator, issue an error message. Returns TRUE if all went well,
31532 and FALSE otherwise. */
31534 static bool
31537 location_t declarator_location)
31538 {
31540 {
31542 {
31551 {
31552 /* If the DECLARATOR has the form `X<y>' then it uses one
31553 additional level of template parameters. */
31556 }
31558 return cp_parser_check_template_parameters
31560 declarator);
31561 }
31577 }
31579 }
31581 /* NUM_TEMPLATES were used in the current declaration. If that is
31582 invalid, return FALSE and issue an error messages. Otherwise,
31583 return TRUE. If DECLARATOR is non-NULL, then we are checking a
31584 declarator and we can print more accurate diagnostics. */
31586 static bool
31590 location_t location,
31592 {
31593 /* If there are the same number of template classes and parameter
31594 lists, that's OK. */
31597 /* If there are more, but only one more, and the name ends in an identifier,
31598 then we are declaring a primary template. That's OK too. */
31606 /* If there are more template classes than parameter lists, we have
31607 something like:
31609 template <class T> void S<T>::R<T>::f (); */
31611 {
31621 else
31624 }
31625 /* Otherwise, there are too many template parameter lists. We have
31626 something like:
31628 template <class T> template <class U> void S::f(); */
31631 }
31633 /* Parse an optional `::' token indicating that the following name is
31634 from the global namespace. If so, PARSER->SCOPE is set to the
31635 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
31636 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
31637 Returns the new value of PARSER->SCOPE, if the `::' token is
31638 present, and NULL_TREE otherwise. */
31640 static tree
31642 {
31645 /* Peek at the next token. */
31647 /* If we're looking at a `::' token then we're starting from the
31648 global namespace, not our current location. */
31650 {
31651 /* Consume the `::' token. */
31653 /* Set the SCOPE so that we know where to start the lookup. */
31659 }
31661 {
31665 }
31668 }
31670 /* Returns TRUE if the upcoming token sequence is the start of a
31671 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
31672 declarator is preceded by the `friend' specifier. The parser flags FLAGS
31673 is used to control type-specifier parsing. */
31675 static bool
31678 {
31681 tree nested_name_specifier;
31684 /* The common case is that this is not a constructor declarator, so
31685 try to avoid doing lots of work if at all possible. It's not
31686 valid declare a constructor at function scope. */
31689 /* And only certain tokens can begin a constructor declarator. */
31694 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
31695 declarator-id of a constructor or destructor. */
31699 /* Parse tentatively; we are going to roll back all of the tokens
31700 consumed here. */
31702 /* Assume that we are looking at a constructor declarator. */
31705 /* Look for the optional `::' operator. */
31708 /* Look for the nested-name-specifier. */
31709 nested_name_specifier
31716 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
31719 {
31724 }
31730 /* Outside of a class-specifier, there must be a
31731 nested-name-specifier. Except in C++17 mode, where we
31732 might be declaring a guiding declaration. */
31739 /* If we have a class scope, this is easy; DR 147 says that S::S always
31740 names the constructor, and no other qualified name could. */
31743 {
31753 }
31754 /* If we still think that this might be a constructor-declarator,
31755 look for a class-name. */
31757 {
31758 /* If we have:
31760 template <typename T> struct S {
31761 S();
31762 };
31764 we must recognize that the nested `S' names a class. */
31768 tree type_decl;
31772 none_type,
31779 {
31785 none_type,
31790 else
31792 }
31794 /* If there was no class-name, then this is not a constructor.
31795 Otherwise, if we are in a class-specifier and we aren't
31796 handling a friend declaration, check that its type matches
31797 current_class_type (c++/38313). Note: error_mark_node
31798 is left alone for error recovery purposes. */
31800 && (outside_class_specifier_p
31806 /* If we're still considering a constructor, we have to see a `(',
31807 to begin the parameter-declaration-clause, followed by either a
31808 `)', an `...', or a decl-specifier. We need to check for a
31809 type-specifier to avoid being fooled into thinking that:
31811 S (f) (int);
31813 is a constructor. (It is actually a function named `f' that
31814 takes one parameter (of type `int') and returns a value of type
31815 `S'. */
31823 /* A parameter declaration begins with a decl-specifier,
31824 which is either the "attribute" keyword, a storage class
31825 specifier, or (usually) a type-specifier. */
31827 /* GNU attributes can actually appear both at the start of
31828 a parameter and parenthesized declarator.
31829 S (__attribute__((unused)) int);
31830 is a constructor, but
31831 S (__attribute__((unused)) foo) (int);
31832 is a function declaration. [[attribute]] can appear in the
31833 first form too, but not in the second form. */
31835 {
31836 tree type;
31842 {
31846 }
31848 /* Names appearing in the type-specifier should be looked up
31849 in the scope of the class. */
31853 {
31856 {
31860 {
31863 }
31864 }
31866 }
31868 /* Inside the constructor parameter list, surrounding
31869 template-parameter-lists do not apply. */
31870 saved_num_template_parameter_lists
31874 /* Look for the type-specifier. It's not optional, but its typename
31875 might be. Unless this is a friend declaration; we don't want to
31876 treat
31878 friend S (T::fn)(int);
31880 as a constructor, but with P0634, we might assume a type when
31881 looking for the type-specifier. It is actually a function named
31882 `T::fn' that takes one parameter (of type `int') and returns a
31883 value of type `S'. Constructors can be friends, but they must
31884 use a qualified name.
31886 Parse with an empty set of declaration specifiers since we're
31887 trying to match a decl-specifier-seq of the first parameter.
31888 This must be non-null so that cp_parser_simple_type_specifier
31889 will recognize a constrained placeholder type such as:
31890 'C<int> auto' where C is a type concept. */
31891 cp_decl_specifier_seq ctor_specs;
31901 parser->num_template_parameter_lists
31904 /* Leave the scope of the class. */
31909 }
31910 }
31912 /* We did not really want to consume any tokens. */
31916 }
31918 /* Parse the definition of the function given by the DECL_SPECIFIERS,
31919 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
31920 they must be performed once we are in the scope of the function.
31922 Returns the function defined. */
31924 static tree
31925 cp_parser_function_definition_from_specifiers_and_declarator
31928 tree attributes,
31930 {
31931 tree fn;
31934 /* Begin the function-definition. */
31937 /* The things we're about to see are not directly qualified by any
31938 template headers we've seen thus far. */
31941 /* If there were names looked up in the decl-specifier-seq that we
31942 did not check, check them now. We must wait until we are in the
31943 scope of the function to perform the checks, since the function
31944 might be a friend. */
31948 {
31953 }
31956 {
31957 /* Skip the entire function. */
31960 }
31962 {
31963 /* Seen already, skip it. An error message has already been output. */
31967 /* If this is a function from a class, pop the nested class. */
31970 }
31971 else
31972 {
31977 }
31980 }
31982 /* Parse the part of a function-definition that follows the
31983 declarator. INLINE_P is TRUE iff this function is an inline
31984 function defined within a class-specifier.
31986 Returns the function defined. */
31988 static tree
31991 {
31992 tree fn;
31997 bool fully_implicit_function_template_p
32000 tree implicit_template_parms
32003 cp_binding_level* implicit_template_scope
32009 /* If the next token is `return', then the code may be trying to
32010 make use of the "named return value" extension that G++ used to
32011 support. */
32014 {
32015 /* Consume the `return' keyword. */
32017 /* Look for the identifier that indicates what value is to be
32018 returned. */
32020 /* Issue an error message. */
32023 /* Skip tokens until we reach the start of the function body. */
32025 {
32032 }
32033 }
32034 /* The `extern' in `extern "C" void f () { ... }' does not apply to
32035 anything declared inside `f'. */
32036 saved_in_unbraced_linkage_specification_p
32039 /* Inside the function, surrounding template-parameter-lists do not
32040 apply. */
32041 saved_num_template_parameter_lists
32045 /* If the next token is `try', `__transaction_atomic', or
32046 `__transaction_relaxed`, then we are looking at either function-try-block
32047 or function-transaction-block. Note that all of these include the
32048 function-body. */
32052 RID_TRANSACTION_RELAXED))
32056 else
32057 cp_parser_ctor_initializer_opt_and_function_body
32060 /* Finish the function. */
32064 && !inline_p
32070 /* Generate code for it, if necessary. */
32073 /* Restore the saved values. */
32074 parser->in_unbraced_linkage_specification_p
32076 parser->num_template_parameter_lists
32080 parser->fully_implicit_function_template_p
32082 parser->implicit_template_parms
32084 parser->implicit_template_scope
32091 }
32093 /* Parse a template-declaration body (following argument list). */
32095 static void
32097 tree parameter_list,
32099 {
32103 /* We just processed one more parameter list. */
32106 /* Get the deferred access checks from the parameter list. These
32107 will be checked once we know what is being declared, as for a
32108 member template the checks must be performed in the scope of the
32109 class containing the member. */
32112 /* Tentatively parse for a new template parameter list, which can either be
32113 the template keyword or a template introduction. */
32122 /* -fconcept-ts 'concept bool' syntax is handled below, in
32123 cp_parser_single_declaration. */
32125 else
32126 {
32129 checks,
32130 member_p,
32134 /* If this is a member template declaration, let the front
32135 end know. */
32137 {
32142 }
32147 }
32148 /* We are done with the current parameter list. */
32153 /* Finish up. */
32156 /* Check the template arguments for a literal operator template. */
32160 {
32164 else
32165 {
32168 {
32175 /* OK, C++20 string literal operator template. We don't need
32176 to warn in lower dialects here because we will have already
32181 }
32183 {
32192 else
32193 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
32195 "ISO C++ did not adopt string literal operator templa"
32197 }
32198 else
32200 }
32202 {
32205 "template %qD has invalid parameter list; expected "
32206 "non-type template parameter pack %<<char...>%> or "
32208 decl);
32209 else
32211 "template %qD has invalid parameter list; expected "
32213 decl);
32214 }
32215 }
32217 /* Register member declarations. */
32220 /* If DECL is a function template, we must return to parse it later.
32221 (Even though there is no definition, there might be default
32222 arguments that need handling.) */
32226 }
32228 /* Parse a template introduction header for a template-declaration. Returns
32229 false if tentative parse fails. */
32231 static bool
32233 {
32243 /* In classes don't parse valid unnamed bitfields as invalid
32244 template introductions. */
32248 /* Look for the optional `::' operator. */
32251 /* Look for the nested-name-specifier. */
32261 /* Look up the concept for which we will be matching
32262 template parameters. */
32274 /* Look for opening brace for introduction. */
32275 matching_braces braces;
32284 /* Build vector of placeholder parameters and grab
32285 matching identifiers. */
32288 /* Look for closing brace for introduction. */
32292 /* The introduction-list shall not be empty. */
32295 {
32296 /* In cp_parser_introduction_list we have already issued an error. */
32298 }
32301 {
32305 }
32307 /* Build and associate the constraint. */
32312 introduction_list,
32313 introduction_loc);
32315 {
32322 member_p);
32324 }
32330 }
32332 /* Parse a normal template-declaration following the template keyword. */
32334 static void
32336 {
32337 tree parameter_list;
32341 /* Look for the `<' token. */
32345 {
32346 /* 14.5.2.2 [temp.mem]
32348 A local class shall not have member templates. */
32353 }
32354 /* [temp]
32356 A template ... shall not have C linkage. */
32358 {
32361 /* Give it C++ linkage to avoid confusing other parts of the
32362 front end. */
32365 }
32366 else
32369 /* We cannot perform access checks on the template parameter
32370 declarations until we know what is being declared, just as we
32371 cannot check the decl-specifier list. */
32374 /* If the next token is `>', then we have an invalid
32375 specialization. Rather than complain about an invalid template
32376 parameter, issue an error message here. */
32378 {
32382 }
32383 else
32384 {
32385 /* Parse the template parameters. */
32387 }
32389 /* Look for the `>'. */
32392 /* Manage template requirements */
32394 {
32399 }
32402 member_p);
32404 /* For the erroneous case of a template with C linkage, we pushed an
32405 implicit C++ linkage scope; exit that scope now. */
32408 }
32410 /* Parse a template-declaration, assuming that the `export' (and
32411 `extern') keywords, if present, has already been scanned. MEMBER_P
32412 is as for cp_parser_template_declaration. */
32414 static bool
32416 {
32418 {
32422 }
32427 }
32429 /* Perform the deferred access checks from a template-parameter-list.
32430 CHECKS is a TREE_LIST of access checks, as returned by
32431 get_deferred_access_checks. */
32433 static void
32434 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
32435 {
32439 }
32441 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
32442 `function-definition' sequence that follows a template header.
32443 If MEMBER_P is true, this declaration appears in a class scope.
32445 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
32446 *FRIEND_P is set to TRUE iff the declaration is a friend. */
32448 static tree
32454 {
32457 cp_decl_specifier_seq decl_specifiers;
32461 /* This function is only used when processing a template
32462 declaration. */
32466 /* Defer access checks until we know what is being declared. */
32469 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
32470 alternative. */
32473 (CP_PARSER_FLAGS_OPTIONAL
32478 cp_omp_declare_simd_data odsd;
32487 /* There are no template typedefs. */
32489 {
32493 }
32495 /* Gather up the access checks that occurred the
32496 decl-specifier-seq. */
32499 /* Check for the declaration of a template class. */
32501 {
32504 {
32507 /* In this case:
32509 struct C {
32510 friend template <typename T> struct A<T>::B;
32511 };
32513 A<T>::B will be represented by a TYPENAME_TYPE, and
32514 therefore not recognized by shadow_tag. */
32516 && !decl
32523 else
32526 /* If this is a declaration, but not a definition, associate
32527 any constraints with the type declaration. Constraints
32528 are associated with definitions in cp_parser_class_specifier. */
32532 /* Perform access checks for template parameters. */
32535 /* Give a helpful diagnostic for
32536 template <class T> struct A { } a;
32537 if we aren't already recovering from an error. */
32540 {
32542 "a class template declaration must not declare "
32546 }
32547 }
32548 }
32550 /* Complain about missing 'typename' or other invalid type names. */
32553 {
32554 /* cp_parser_parse_and_diagnose_invalid_type_name calls
32555 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
32556 the rest of this declaration. */
32559 }
32561 /* If it's not a template class, try for a template function. If
32562 the next token is a `;', then this declaration does not declare
32563 anything. But, if there were errors in the decl-specifiers, then
32564 the error might well have come from an attempted class-specifier.
32565 In that case, there's no need to warn about a missing declarator. */
32569 {
32571 /* We don't delay parsing for friends, though CWG 2510 may change
32572 that. */
32576 flags,
32578 checks,
32580 member_p,
32581 declares_class_or_enum,
32585 /* 7.1.1-1 [dcl.stc]
32587 A storage-class-specifier shall not be specified in an explicit
32588 specialization... */
32590 && explicit_specialization_p
32592 {
32596 }
32600 }
32602 /* Look for a trailing `;' after the declaration. */
32608 out:
32611 /* Clear any current qualification; whatever comes next is the start
32612 of something new. */
32620 }
32622 /* Parse a cast-expression that is not the operand of a unary "&". */
32624 static cp_expr
32626 {
32629 }
32631 /* Parse a functional cast to TYPE. Returns an expression
32632 representing the cast. */
32634 static cp_expr
32636 {
32638 tree expression_list;
32639 cp_expr cast;
32648 {
32658 /* Create a location of the form:
32659 type_name{i, f}
32660 ^~~~~~~~~~~~~~~
32661 with caret == start at the start of the type name,
32662 finishing at the closing brace. */
32667 }
32676 else
32677 {
32680 }
32682 /* Create a location of the form:
32683 float(i)
32684 ^~~~~~~~
32685 with caret == start at the start of the type name,
32686 finishing at the closing paren. */
32690 tf_warning_or_error);
32692 /* [expr.const]/1: In an integral constant expression "only type
32693 conversions to integral or enumeration type can be used". */
32699 NIC_CONSTRUCTOR))
32703 }
32705 /* Save the tokens that make up the body of a member function defined
32706 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
32707 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
32708 specifiers applied to the declaration. Returns the FUNCTION_DECL
32709 for the member function. */
32711 static tree
32715 tree attributes)
32716 {
32719 tree fn;
32722 /* Create the FUNCTION_DECL. */
32726 /* If something went badly wrong, bail out now. */
32728 {
32729 /* If there's a function-body, skip it. */
32734 }
32736 /* Remember it, if there are default args to post process. */
32739 /* Save away the tokens that make up the body of the
32740 function. */
32746 RID_TRANSACTION_ATOMIC))
32747 {
32749 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
32756 {
32762 }
32763 else
32766 {
32770 }
32771 }
32773 /* Handle function try blocks. */
32775 {
32778 }
32779 /* We can have braced-init-list mem-initializers before the fn body. */
32781 {
32784 {
32785 /* cache_group will stop after an un-nested { } pair, too. */
32789 /* variadic mem-inits have ... after the ')'. */
32792 }
32793 }
32795 /* Handle function try blocks. */
32801 /* Save away the inline definition; we will process it when the
32802 class is complete. */
32806 /* We need to know that this was defined in the class, so that
32807 friend templates are handled correctly. */
32810 /* Add FN to the queue of functions to be parsed later. */
32814 }
32816 /* Save the tokens that make up the in-class initializer for a non-static
32817 data member. Returns a DEFERRED_PARSE. */
32819 static tree
32821 {
32823 }
32825 /* Parse a template-argument-list, as well as the trailing ">" (but
32826 not the opening "<"). See cp_parser_template_argument_list for the
32827 return value. */
32829 static tree
32831 {
32832 tree arguments;
32833 tree saved_scope;
32834 tree saved_qualifying_scope;
32835 tree saved_object_scope;
32838 /* [temp.names]
32840 When parsing a template-id, the first non-nested `>' is taken as
32841 the end of the template-argument-list rather than a greater-than
32842 operator. */
32843 saved_greater_than_is_operator_p
32846 /* Parsing the argument list may modify SCOPE, so we save it
32847 here. */
32851 /* We need to evaluate the template arguments, even though this
32852 template-id may be nested within a "sizeof". */
32853 cp_evaluated ev;
32854 /* Parse the template-argument-list itself. */
32859 {
32862 }
32863 else
32865 /* Look for the `>' that ends the template-argument-list. If we find
32866 a '>>' instead, it's probably just a typo. */
32868 {
32870 {
32871 /* In C++0x, a `>>' in a template argument list or cast
32872 expression is considered to be two separate `>'
32873 tokens. So, change the current token to a `>', but don't
32874 consume it: it will be consumed later when the outer
32875 template argument list (or cast expression) is parsed.
32876 Note that this replacement of `>' for `>>' is necessary
32877 even if we are parsing tentatively: in the tentative
32878 case, after calling
32879 cp_parser_enclosed_template_argument_list we will always
32880 throw away all of the template arguments and the first
32881 closing `>', either because the template argument list
32882 was erroneous or because we are replacing those tokens
32883 with a CPP_TEMPLATE_ID token. The second `>' (which will
32884 not have been thrown away) is needed either to close an
32885 outer template argument list or to complete a new-style
32886 cast. */
32889 }
32891 {
32892 /* If we're in a nested template argument list, the '>>' has
32893 to be a typo for '> >'. We emit the error message, but we
32894 continue parsing and we push a '>' as next token, so that
32895 the argument list will be parsed correctly. Note that the
32896 global source location is still on the token before the
32897 '>>', so we need to say explicitly where we want it. */
32905 }
32906 else
32907 {
32908 /* If this is not a nested template argument list, the '>>'
32909 is a typo for '>'. Emit an error message and continue.
32910 Same deal about the token location, but here we can get it
32911 right by consuming the '>>' before issuing the diagnostic. */
32914 "spurious %<>>%>, use %<>%> to terminate "
32916 }
32917 }
32918 /* Similarly for >>= and >=. */
32921 {
32927 {
32930 }
32932 {
32935 else
32938 }
32939 else
32940 {
32943 }
32949 }
32950 else
32952 /* The `>' token might be a greater-than operator again now. */
32953 parser->greater_than_is_operator_p
32955 /* Restore the SAVED_SCOPE. */
32961 }
32963 /* MEMBER_FUNCTION is a member function, or a friend. If default
32964 arguments, or the body of the function have not yet been parsed,
32965 parse them now. */
32967 static void
32969 {
32972 /* If this member is a template, get the underlying
32973 FUNCTION_DECL. */
32977 /* There should not be any class definitions in progress at this
32978 point; the bodies of members are only parsed outside of all class
32979 definitions. */
32981 /* While we're parsing the member functions we might encounter more
32982 classes. We want to handle them right away, but we don't want
32983 them getting mixed up with functions that are currently in the
32984 queue. */
32987 /* Make sure that any template parameters are in scope. */
32990 /* If the body of the function has not yet been parsed, parse it
32991 now. Except if the tokens have been purged (PR c++/39751). */
32994 {
32995 tree function_scope;
32998 /* The function is no longer pending; we are processing it. */
33003 /* If this is a local class, enter the scope of the containing
33004 function. */
33009 /* Push the body of the function onto the lexer stack. */
33012 /* Let the front end know that we going to be defining this
33013 function. */
33017 /* #pragma omp declare reduction needs special parsing. */
33019 {
33024 }
33025 else
33026 /* Now, parse the body of the function. */
33030 /* Leave the scope of the containing function. */
33034 }
33036 /* Remove any template parameters from the symbol table. */
33039 /* Restore the queue. */
33041 }
33043 /* If DECL contains any default args, remember it on the unparsed
33044 functions queue. */
33046 static void
33048 {
33049 tree probe;
33052 probe;
33055 {
33059 }
33061 /* Remember if there is a noexcept-specifier to post process. */
33066 /* Contracts are deferred. */
33069 {
33072 }
33073 }
33075 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
33076 which is either a FIELD_DECL or PARM_DECL. Parse it and return
33077 the result. For a PARM_DECL, PARMTYPE is the corresponding type
33078 from the parameter-type-list. */
33080 static tree
33083 {
33085 tree parsed_arg;
33091 /* Push the saved tokens for the default argument onto the parser's
33092 lexer stack. */
33098 /* Parse the default argument. */
33109 {
33110 /* In a non-template class, check conversions now. In a template,
33111 we'll wait and instantiate these as needed. */
33114 tf_warning_or_error);
33117 else
33119 }
33121 /* If the token stream has not been completely used up, then
33122 there was extra junk after the end of the default
33123 argument. */
33125 {
33128 else
33130 }
33132 /* Revert to the main lexer. */
33136 }
33138 /* FIELD is a non-static data member with an initializer which we saved for
33139 later; parse it now. */
33141 static void
33143 {
33144 tree def;
33151 NULL_TREE);
33157 }
33159 /* FN is a FUNCTION_DECL which may contains a parameter with an
33160 unparsed DEFERRED_PARSE. Parse the default args now. This function
33161 assumes that the current scope is the scope in which the default
33162 argument should be processed. */
33164 static void
33166 {
33169 /* While we're parsing the default args, we might (due to the
33170 statement expression extension) encounter more classes. We want
33171 to handle them right away, but we don't want them getting mixed
33172 up with default args that are currently in the queue. */
33175 /* Local variable names (and the `this' keyword) may not appear
33176 in a default argument. */
33184 /* Gather the PARM_DECLs into a vec so we can keep track of them when
33185 pushdecl clears DECL_CHAIN. */
33186 releasing_vec parms;
33196 {
33198 tree parsed_arg;
33207 /* This can happen for a friend declaration for a function
33208 already declared with default arguments. */
33211 parsed_arg
33213 default_arg,
33217 /* Update any instantiations we've already created. */
33220 }
33224 /* Restore DECL_CHAINs after clobbering by pushdecl. */
33227 {
33230 }
33234 /* Make sure no default arg is missing. */
33237 /* Restore the state of local_variables_forbidden_p. */
33240 /* Restore the queue. */
33242 }
33244 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
33246 sizeof ... ( identifier )
33248 where the 'sizeof' token has already been consumed. */
33250 static tree
33252 {
33253 /* Consume the `...'. */
33257 matching_parens parens;
33261 else
33269 /* The name is not qualified. */
33289 }
33291 /* Parse the operand of `sizeof' (or a similar operator). Returns
33292 either a TYPE or an expression, depending on the form of the
33293 input. The KEYWORD indicates which kind of expression we have
33294 encountered. */
33296 static tree
33298 {
33305 /* If it's a `...', then we are computing the length of a parameter
33306 pack. */
33311 /* Types cannot be defined in a `sizeof' expression. Save away the
33312 old message. */
33315 parser->type_definition_forbidden_message
33317 parser->type_definition_forbidden_message_arg
33320 /* The restrictions on constant-expressions do not apply inside
33321 sizeof expressions. */
33322 saved_integral_constant_expression_p
33324 saved_non_integral_constant_expression_p
33331 /* Do not actually evaluate the expression. */
33334 /* If it's a `(', then we might be looking at the type-id
33335 construction. */
33337 {
33342 /* We can't be sure yet whether we're looking at a type-id or an
33343 expression. */
33346 matching_parens parens;
33349 /* Note: as a GNU Extension, compound literals are considered
33350 postfix-expressions as they are in C99, so they are valid
33351 arguments to sizeof. See comment in cp_parser_cast_expression
33352 for details. */
33355 else
33356 {
33359 /* Look for the type-id. */
33361 /* Look for the closing `)'. */
33364 }
33366 /* If all went well, then we're done. */
33369 else
33370 {
33371 /* Commit to the tentative_firewall so we get syntax errors. */
33375 }
33376 }
33377 else
33380 /* Go back to evaluating expressions. */
33384 /* And restore the old one. */
33387 parser->integral_constant_expression_p
33389 parser->non_integral_constant_expression_p
33393 }
33395 /* If the current declaration has no declarator, return true. */
33397 static bool
33399 {
33400 /* If the next token is a `;' or a `,' then there is no
33401 declarator. */
33404 }
33406 /* Update the DECL_SPECS to reflect the storage class indicated by
33407 KEYWORD. */
33409 static void
33414 {
33415 cp_storage_class storage_class;
33418 {
33436 }
33439 {
33443 }
33445 {
33452 else
33459 }
33464 {
33467 }
33472 /* A storage class specifier cannot be applied alongside a typedef
33473 specifier. If there is a typedef specifier present then set
33474 conflicting_specifiers_p which will trigger an error later
33475 on in grokdeclarator. */
33478 {
33485 }
33486 }
33488 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
33489 is true, the type is a class or enum definition. */
33491 static void
33493 tree type_spec,
33496 {
33499 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
33500 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
33501 this is what happened. In system headers, we ignore these
33502 declarations so that G++ can work with system headers that are not
33503 C++-safe. */
33505 && !type_definition_p
33518 {
33521 ds_redefined_builtin_type_spec,
33522 token);
33524 {
33528 }
33529 }
33532 else
33533 {
33538 }
33539 }
33541 /* True iff TOKEN is the GNU keyword __thread. */
33543 static bool
33545 {
33548 }
33550 /* Set the location for a declarator specifier and check if it is
33551 duplicated.
33553 DECL_SPECS is the sequence of declarator specifiers onto which to
33554 set the location.
33556 DS is the single declarator specifier to set which location is to
33557 be set onto the existing sequence of declarators.
33559 LOCATION is the location for the declarator specifier to
33560 consider. */
33562 static void
33565 {
33574 {
33578 }
33579 else
33580 {
33582 {
33586 else
33587 {
33590 OPT_Wlong_long,
33592 }
33593 }
33595 {
33599 {
33603 }
33604 else
33605 {
33608 }
33609 }
33610 else
33611 {
33629 "consteval"
33630 };
33634 }
33635 }
33636 }
33638 /* Return true iff the declarator specifier DS is present in the
33639 sequence of declarator specifiers DECL_SPECS. */
33641 bool
33643 cp_decl_spec ds)
33644 {
33651 }
33653 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
33654 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
33656 static bool
33658 {
33660 }
33662 /* Issue an error message indicating that TOKEN_DESC was expected.
33663 If KEYWORD is true, it indicated this function is called by
33664 cp_parser_require_keword and the required token can only be
33665 a indicated keyword.
33667 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33668 within any error as the location of an "opening" token matching
33669 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33670 RT_CLOSE_PAREN). */
33672 static void
33674 required_token token_desc,
33676 location_t matching_location)
33677 {
33683 {
33758 }
33761 {
33763 {
33841 }
33842 }
33846 }
33849 /* If the next token is of the indicated TYPE, consume it. Otherwise,
33850 issue an error message indicating that TOKEN_DESC was expected.
33852 Returns the token consumed, if the token had the appropriate type.
33853 Otherwise, returns NULL.
33855 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33856 within any error as the location of an "opening" token matching
33857 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33858 RT_CLOSE_PAREN). */
33863 required_token token_desc,
33864 location_t matching_location)
33865 {
33868 else
33869 {
33870 /* Output the MESSAGE -- unless we're parsing tentatively. */
33873 matching_location);
33875 }
33876 }
33878 /* Skip an entire parameter list from start to finish. The next token must
33879 be the initial "<" of the parameter list. Returns true on success and
33880 false otherwise. */
33882 static bool
33884 {
33885 /* Consume the "<" because cp_parser_skip_to_end_of_template_parameter_list
33886 requires it. */
33889 }
33891 /* Ensure we are at the end of a template parameter list. If we are, return.
33892 If we are not, something has gone wrong, in which case issue an error and
33893 skip to end of the parameter list. */
33895 static void
33897 {
33898 /* Are we ready, yet? If not, issue error message. */
33903 }
33905 /* You should only call this function from inside a template parameter list
33906 (i.e. the current token should at least be the initial "<" of the
33907 parameter list). If you are skipping the entire list, it may be better to
33908 use cp_parser_skip_entire_template_parameter_list.
33910 Tokens are skipped until the final ">" is found, or if we see
33911 '{', '}', ';', or if we find an unbalanced ')' or ']'.
33913 Returns true if we successfully reached the end, and false if
33914 something unexpected happened (e.g. end of file). */
33916 static bool
33918 {
33919 /* Current level of '< ... >'. */
33921 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
33924 /* Skip tokens until the desired token is found. */
33926 {
33927 /* Peek at the next token. */
33929 {
33937 /* C++0x views the `>>' operator as two `>' tokens, but
33938 C++98 does not. */
33941 {
33942 /* We've hit a `>>' where the first `>' closes the
33943 template argument list, and the second `>' is
33944 spurious. Just consume the `>>' and stop; we've
33945 already produced at least one error. */
33948 }
33949 /* Fall through for C++0x, so we handle the second `>' in
33950 the `>>'. */
33955 {
33956 /* We've reached the token we want, consume it and stop. */
33959 }
33978 /* The '>' was probably forgotten, don't look further. */
33983 }
33985 /* Consume this token. */
33987 }
33988 }
33990 /* If the next token is the indicated keyword, consume it. Otherwise,
33991 issue an error message indicating that TOKEN_DESC was expected.
33993 Returns the token consumed, if the token had the appropriate type.
33994 Otherwise, returns NULL. */
33999 required_token token_desc)
34000 {
34004 {
34006 UNKNOWN_LOCATION);
34008 }
34011 }
34013 /* Returns TRUE iff TOKEN is a token that can begin the body of a
34014 function-definition. */
34016 static bool
34018 {
34021 /* A ctor-initializer begins with a `:'. */
34023 /* A function-try-block begins with `try'. */
34025 /* A function-transaction-block begins with `__transaction_atomic'
34026 or `__transaction_relaxed'. */
34029 /* The named return value extension begins with `return'. */
34031 }
34033 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
34034 definition. */
34036 static bool
34038 {
34045 }
34047 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
34048 C++0x) ending a template-argument. */
34050 static bool
34052 {
34060 /* For better diagnostics, treat >>= like that too, that
34061 shouldn't appear non-nested in template arguments. */
34063 }
34065 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
34066 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
34068 static bool
34071 {
34077 /* Check for the sequence `<::' in the original code. It would be lexed as
34078 `[:', where `[' is a digraph, and there is no whitespace before
34079 `:'. */
34081 {
34086 }
34088 }
34090 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
34091 or none_type otherwise. */
34093 static enum tag_types
34095 {
34097 {
34107 }
34108 }
34110 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
34111 or none_type otherwise or if the token is null. */
34113 static enum tag_types
34115 {
34120 {
34128 }
34129 }
34131 /* Diagnose redundant enum-keys. */
34133 static void
34136 {
34142 /* Look up the NAME to see if it unambiguously refers to the TYPE. */
34147 /* The enum-key is redundant for uses of the TYPE that are not
34148 declarations and for which name lookup returns just the type
34149 itself. */
34157 {
34158 /* Avoid issuing the diagnostic for apparently redundant (unscoped)
34159 enum tag in shared C/C++ code in files (such as headers) included
34160 in the main source file. */
34163 LRK_MACRO_DEFINITION_LOCATION,
34167 }
34175 }
34177 /* Describes the set of declarations of a struct, class, or class template
34178 or its specializations. Used for -Wmismatched-tags. */
34180 class class_decl_loc_t
34181 {
34186 {
34188 }
34190 /* Constructs an object for a single declaration of a class with
34191 CLASS_KEY at the current location in the current function (or
34192 at another scope). KEY_REDUNDANT is true if the class-key may
34193 be omitted in the current context without an ambiguity with
34194 another symbol with the same name.
34195 DEF_P is true for a class declaration that is a definition.
34196 CURLOC is the associated location. */
34200 {
34203 key_redundant);
34205 }
34207 /* Copy, assign, and destroy the object. Necessary because LOCVEC
34208 isn't safely copyable and assignable and doesn't release storage
34209 on its own. */
34213 { }
34216 {
34224 }
34227 {
34229 }
34231 /* Issues -Wmismatched-tags for a single class. */
34234 /* Issues -Wmismatched-tags for all classes. */
34237 /* Adds TYPE_DECL to the collection of class decls and diagnoses
34238 redundant tags (if -Wredundant-tags is enabled). */
34241 /* Either adds this decl to the collection of class decls
34242 or diagnoses it, whichever is appropriate. */
34248 {
34250 }
34253 {
34255 }
34258 {
34260 }
34263 {
34265 }
34267 /* True if a definition for the class has been seen. */
34269 {
34271 }
34273 /* The location of a single mention of a class type with the given
34274 class-key. */
34275 struct class_key_loc_t
34276 {
34279 { }
34281 /* The function the type is mentioned in. */
34282 tree func;
34283 /* The exact location. */
34284 location_t loc;
34285 /* The class-key used in the mention of the type. */
34286 tag_types class_key;
34287 /* True when the class-key could be omitted at this location
34288 without an ambiguity with another symbol of the same name. */
34290 };
34291 /* Avoid using auto_vec here since it's not safe to copy due to pr90904. */
34293 /* LOCVEC index of the definition or UINT_MAX if none exists. */
34295 /* The class-key the class was last declared with or none_type when
34296 it has been declared with a mismatched key. */
34297 tag_types def_class_key;
34299 /* A mapping between a TYPE_DECL for a class and the class_decl_loc_t
34300 description above. */
34303 };
34307 /* Issue an error message if the CLASS_KEY does not match the TYPE.
34308 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34309 is set for a declaration of class TYPE and clear for a reference to
34310 it that is not a declaration of it. */
34312 static void
34316 {
34322 {
34326 type))
34330 }
34335 /* Only consider the true class-keys below and ignore typename_type,
34336 etc. that are not C++ class-keys. */
34343 }
34345 /* Returns the template or specialization of one to which the RECORD_TYPE
34346 TYPE corresponds. */
34348 static tree
34350 {
34353 /* Determine the template or its partial specialization to which TYPE
34354 corresponds. */
34363 }
34366 /* Adds the class TYPE to the collection of class decls and diagnoses
34367 redundant tags (if -Wredundant-tags is enabled).
34368 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34369 is set for a (likely, based on syntactic context) declaration of class
34370 TYPE and clear for a reference to it that is not a declaration of it. */
34372 void
34375 {
34378 /* Look up the NAME to see if it unambiguously refers to the TYPE
34379 and set KEY_REDUNDANT if so. */
34384 /* The class-key is redundant for uses of the CLASS_TYPE that are
34385 neither definitions of it nor declarations, and for which name
34386 lookup returns just the type itself. */
34397 {
34398 /* Avoid issuing the diagnostic for apparently redundant struct
34399 and union class-keys in shared C/C++ code in files (such as
34400 headers) included in the main source file. */
34403 LRK_MACRO_DEFINITION_LOCATION,
34407 }
34409 /* Set if a declaration of TYPE has previously been seen or if it must
34410 exist in a precompiled header. */
34414 {
34417 {
34418 /* TYPE_DECL is the first declaration or definition of the type
34419 (outside precompiled headers -- see below). Just create
34420 a new entry for it and return unless it's a declaration
34421 involving a template that may need to be diagnosed by
34422 -Wredundant-tags. */
34426 }
34427 else
34428 {
34429 /* TYPE was previously defined in some unknown precompiled header.
34430 Simply add a record of its definition at an unknown location and
34431 proceed below to add a reference to it at the current location.
34432 (Declarations in precompiled headers that are not definitions
34433 are ignored.) */
34434 tag_types def_key
34439 }
34440 }
34442 /* A prior declaration of TYPE_DECL has been seen. */
34445 {
34452 type);
34453 }
34456 /* Do nothing if this is the first declaration of the type. */
34460 /* Do nothing if the class-key in this declaration matches
34461 the definition. */
34465 def_p);
34466 }
34468 /* Either adds this DECL corresponding to the TYPE_DECL to the collection
34469 of class decls or diagnoses it, whichever is appropriate. */
34471 void
34473 tag_types class_key,
34476 {
34477 /* Reset the CLASS_KEY associated with this type on mismatch.
34478 This is an optimization that lets the diagnostic code skip
34479 over classes that use the same class-key in all declarations. */
34483 /* Set IDXDEF to the index of the vector corresponding to
34484 the definition. */
34488 /* Append a record of this declaration to the vector. */
34490 redundant);
34496 /* As a space optimization diagnose declarations of a class
34497 whose definition has been seen and purge the LOCVEC of
34498 all entries except the definition. */
34501 {
34507 }
34508 else
34509 /* Pop the entry pushed above for this declaration. */
34511 }
34513 /* Issues -Wmismatched-tags for a single class. */
34515 void
34517 {
34521 /* Number of uses of the class. */
34524 /* The class (or template) declaration guiding the decisions about
34525 the diagnostic. For ordinary classes it's the same as THIS. For
34526 uses of instantiations of templates other than their declarations
34527 it points to the record for the declaration of the corresponding
34528 primary template or partial specialization. */
34533 {
34534 /* For implicit instantiations of a primary template look up
34535 the primary or partial specialization and use it as
34536 the expected class-key rather than using the class-key of
34537 the first reference to the instantiation. The primary must
34538 be (and inevitably is) at index zero. */
34541 /* It's possible that we didn't find SPEC. Consider:
34543 template<typename T> struct A {
34544 template<typename U> struct W { };
34545 };
34546 struct A<int>::W<int> w; // #1
34548 where while parsing A and #1 we've stashed
34549 A<T>
34550 A<T>::W<U>
34551 A<int>::W<int>
34552 into CLASS2LOC. If TYPE is A<int>::W<int>, specialization_of
34553 will yield A<int>::W<U> which may be in CLASS2LOC if we had
34554 an A<int> class specialization, but otherwise won't be in it.
34555 So try to look up A<T>::W<U>. */
34557 {
34560 }
34561 /* Now we really should have found something. */
34563 }
34564 /* Skip declarations that consistently use the same class-key. */
34568 /* Set if a definition for the class has been seen. */
34571 /* The index of the declaration whose class-key this declaration
34572 is expected to match. It's either the class-key of the class
34573 definition if one exists or the first declaration otherwise. */
34576 /* The class-key the class is expected to be declared with: it's
34577 either the key used in its definition or the first declaration
34578 if no definition has been provided.
34579 For implicit instantiations of a primary template it's
34580 the class-key used to declare the primary with. The primary
34581 must be at index zero. */
34585 /* Advance IDX to the first declaration that either is not
34586 a definition or that doesn't match the first declaration
34587 if no definition is provided. */
34592 /* Save the current function before changing it below. */
34594 /* Set the function declaration to print in diagnostic context. */
34602 auto_diagnostic_group d;
34603 /* Issue a warning for the first mismatched declaration.
34604 Avoid using "%#qT" since the class-key for the same type will
34605 be the same regardless of which one was used in the declaraion. */
34609 {
34610 /* Suggest how to avoid the warning for each instance since
34611 the guidance may be different depending on context. */
34613 (key_redundant_p
34616 xpectkstr);
34618 /* Also point to the first declaration or definition that guided
34619 the decision to issue the warning above. */
34621 (def_p
34625 }
34627 /* Issue warnings for the remaining inconsistent declarations. */
34629 {
34631 /* Skip over the declarations that match either the definition
34632 if one was provided or the first declaration. */
34638 /* Set the function declaration to print in diagnostic context. */
34643 /* Suggest how to avoid the warning for each instance since
34644 the guidance may be different depending on context. */
34646 (key_redundant_p
34649 xpectkstr);
34650 }
34652 /* Restore the current function in case it was replaced above. */
34654 }
34656 /* Issues -Wmismatched-tags for all classes. Called at the end
34657 of processing a translation unit, after declarations of all class
34658 types and their uses have been recorded. */
34660 void
34662 {
34663 /* CLASS2LOC should be empty if both -Wmismatched-tags and
34664 -Wredundant-tags are disabled. */
34666 || warn_redundant_tags
34669 /* Save the current function before changing on return. It should
34670 be null at this point. */
34674 {
34675 /* Iterate over the collected class/struct/template declarations. */
34678 {
34682 }
34683 }
34686 }
34688 /* Issue an error message if DECL is redeclared with different
34689 access than its original declaration [class.access.spec/3].
34690 This applies to nested classes, nested class templates and
34691 enumerations [class.mem/1]. */
34693 static void
34695 {
34706 }
34708 /* Look for the `template' keyword, as a syntactic disambiguator.
34709 Return TRUE iff it is present, in which case it will be
34710 consumed. */
34712 static bool
34714 {
34716 {
34717 /* In C++98 the `template' keyword can only be used within templates;
34718 outside templates the parser can always figure out what is a
34719 template and what is not. In C++11, per the resolution of DR 468,
34720 `template' is allowed in cases where it is not strictly necessary. */
34723 {
34726 "in C++98 %<template%> (as a disambiguator) is only "
34728 /* If this part of the token stream is rescanned, the same
34729 error message would be generated. So, we purge the token
34730 from the stream. */
34733 }
34734 else
34735 {
34736 /* Consume the `template' keyword. */
34739 }
34740 }
34742 }
34744 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
34745 set PARSER->SCOPE, and perform other related actions. */
34747 static void
34749 {
34752 /* Get the stored value. */
34754 /* Set the scope from the stored value. */
34759 }
34761 /* Consume tokens up through a non-nested END token. Returns TRUE if we
34762 encounter the end of a block before what we were looking for. */
34764 static bool
34768 {
34770 {
34773 /* Abort a parenthesized expression if we encounter a semicolon. */
34777 /* If we've reached the end of the file, stop. */
34783 /* We've hit the end of an enclosing block, so there's been some
34784 kind of syntax error. */
34787 /* Consume the token. */
34789 /* See if it starts a new group. */
34791 {
34793 /* In theory this should probably check end == '}', but
34794 cp_parser_save_member_function_body needs it to exit
34795 after either '}' or ')' when called with ')'. */
34798 }
34800 {
34804 }
34809 }
34810 }
34812 /* Like above, for caching a default argument or NSDMI. Both of these are
34813 terminated by a non-nested comma, but it can be unclear whether or not a
34814 comma is nested in a template argument list unless we do more parsing.
34815 In order to handle this ambiguity, when we encounter a ',' after a '<'
34816 we try to parse what follows as a parameter-declaration-list (in the
34817 case of a default argument) or a member-declarator (in the case of an
34818 NSDMI). If that succeeds, then we stop caching. */
34820 static tree
34822 {
34827 tree default_argument;
34829 /* Add tokens until we have processed the entire default
34830 argument. We add the range [first_token, token). */
34833 {
34834 /* For list-initialization, this is straightforward. */
34837 }
34839 {
34842 /* Peek at the next token. */
34844 /* What we do depends on what token we have. */
34846 {
34847 /* In valid code, a default argument must be
34848 immediately followed by a `,' `)', or `...'. */
34851 {
34852 /* If we've seen a '<', we might be in a
34853 template-argument-list. Until Core issue 325 is
34854 resolved, we don't know how this situation ought
34855 to be handled, so try to DTRT. We check whether
34856 what comes after the comma is a valid parameter
34857 declaration list. If it is, then the comma ends
34858 the default argument; otherwise the default
34859 argument continues. */
34863 /* Set ITALP so cp_parser_parameter_declaration_list
34864 doesn't decide to commit to this parse. */
34871 {
34872 /* Parse declarators until we reach a non-comma or
34873 somthing that cannot be an initializer.
34874 Just checking whether we're looking at a single
34875 declarator is insufficient. Consider:
34876 int var = tuple<T,U>::x;
34877 The template parameter 'U' looks exactly like a
34878 declarator. */
34879 do
34880 {
34884 CP_PARSER_FLAGS_NONE,
34893 }
34895 /* If we met an '=' or ';' then the original comma
34896 was the end of the NSDMI. Otherwise assume
34897 we're still in the NSDMI. */
34900 }
34901 else
34902 {
34905 tree t = cp_parser_parameter_declaration_list
34911 }
34918 }
34919 /* FALLTHRU */
34922 /* If we run into a non-nested `;', `}', or `]',
34923 then the code is invalid -- but the default
34924 argument is certainly over. */
34929 /* Handle correctly int n = sizeof ... ( p ); */
34932 /* Update DEPTH, if necessary. */
34947 /* This might be the comparison operator, or it might
34948 start a template argument list. */
34955 /* Fall through for C++0x, which treats the `>>'
34956 operator like two `>' tokens in certain
34957 cases. */
34962 {
34963 /* This might be an operator, or it might close a
34964 template argument list. But if a previous '<'
34965 started a template argument list, this will have
34966 closed it, so we can't be in one anymore. */
34970 }
34973 /* If we run out of tokens, issue an error message. */
34981 /* In these cases, we should look for template-ids.
34982 For example, if the default argument is
34983 `X<int, double>()', we need to do name lookup to
34984 figure out whether or not `X' is a template; if
34985 so, the `,' does not end the default argument.
34987 That is not yet done. */
34992 }
34994 /* If we've reached the end, stop. */
34998 /* Add the token to the token block. */
35000 }
35002 /* Create a DEFERRED_PARSE to represent the unparsed default
35003 argument. */
35010 }
35012 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
35014 location_t
35016 {
35021 }
35023 /* Begin parsing tentatively. We always save tokens while parsing
35024 tentatively so that if the tentative parsing fails we can restore the
35025 tokens. */
35027 static void
35029 {
35030 /* Enter a new parsing context. */
35032 /* Begin saving tokens. */
35034 /* In order to avoid repetitive access control error messages,
35035 access checks are queued up until we are no longer parsing
35036 tentatively. */
35038 }
35040 /* Commit to the currently active tentative parse. */
35042 static void
35044 {
35048 /* Mark all of the levels as committed. */
35051 {
35058 }
35059 }
35061 /* Commit to the topmost currently active tentative parse.
35063 Note that this function shouldn't be called when there are
35064 irreversible side-effects while in a tentative state. For
35065 example, we shouldn't create a permanent entry in the symbol
35066 table, or issue an error message that might not apply if the
35067 tentative parse is aborted. */
35069 static void
35071 {
35076 {
35084 }
35085 }
35087 /* Abort the currently active tentative parse. All consumed tokens
35088 will be rolled back, and no diagnostics will be issued. */
35090 static void
35092 {
35096 /* Now, pretend that we want to see if the construct was
35097 successfully parsed. */
35099 }
35101 /* Stop parsing tentatively. If a parse error has occurred, restore the
35102 token stream. Otherwise, commit to the tokens we have consumed.
35103 Returns true if no error occurred; false otherwise. */
35105 static bool
35107 {
35111 /* Remember whether or not an error occurred, since we are about to
35112 destroy that information. */
35114 /* Remove the topmost context from the stack. */
35117 /* If no parse errors occurred, commit to the tentative parse. */
35119 {
35120 /* Commit to the tokens read tentatively, unless that was
35121 already done. */
35126 }
35127 /* Otherwise, if errors occurred, roll back our state so that things
35128 are just as they were before we began the tentative parse. */
35129 else
35130 {
35133 }
35134 /* Add the context to the front of the free list. */
35139 }
35141 /* Returns true if we are parsing tentatively and are not committed to
35142 this tentative parse. */
35144 static bool
35146 {
35149 }
35151 /* Returns nonzero iff an error has occurred during the most recent
35152 tentative parse. */
35154 static bool
35156 {
35159 }
35161 /* Returns nonzero if GNU extensions are allowed. */
35163 static bool
35165 {
35167 }
35168 \f
35169 /* Objective-C++ Productions */
35172 /* Parse an Objective-C expression, which feeds into a primary-expression
35173 above.
35175 objc-expression:
35176 objc-message-expression
35177 objc-string-literal
35178 objc-encode-expression
35179 objc-protocol-expression
35180 objc-selector-expression
35182 Returns a tree representation of the expression. */
35184 static cp_expr
35186 {
35187 /* Try to figure out what kind of declaration is present. */
35191 {
35201 {
35213 }
35214 /* FALLTHRU */
35220 }
35223 }
35225 /* Parse an Objective-C message expression.
35227 objc-message-expression:
35228 [ objc-message-receiver objc-message-args ]
35230 Returns a representation of an Objective-C message. */
35232 static tree
35234 {
35247 /* Construct a location e.g.
35248 [self func1:5]
35249 ^~~~~~~~~~~~~~
35250 ranging from the '[' to the ']', with the caret at the start. */
35256 }
35258 /* Parse an objc-message-receiver.
35260 objc-message-receiver:
35261 expression
35262 simple-type-specifier
35264 Returns a representation of the type or expression. */
35266 static tree
35268 {
35269 tree rcv;
35271 /* An Objective-C message receiver may be either (1) a type
35272 or (2) an expression. */
35276 /* If that worked out, fine. */
35283 CP_PARSER_FLAGS_NONE);
35290 }
35292 /* Parse the arguments and selectors comprising an Objective-C message.
35294 objc-message-args:
35295 objc-selector
35296 objc-selector-args
35297 objc-selector-args , objc-comma-args
35299 objc-selector-args:
35300 objc-selector [opt] : assignment-expression
35301 objc-selector-args objc-selector [opt] : assignment-expression
35303 objc-comma-args:
35304 assignment-expression
35305 objc-comma-args , assignment-expression
35307 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
35308 selector arguments and TREE_VALUE containing a list of comma
35309 arguments. */
35311 static tree
35313 {
35319 {
35325 /* Detect if we have a unary selector. */
35334 sel_args
35339 }
35341 /* Handle non-selector arguments, if any. */
35343 {
35344 tree arg;
35349 addl_args
35354 }
35357 {
35360 }
35363 }
35365 /* Parse an Objective-C encode expression.
35367 objc-encode-expression:
35368 @encode objc-typename
35370 Returns an encoded representation of the type argument. */
35372 static cp_expr
35374 {
35375 tree type;
35380 matching_parens parens;
35387 {
35391 }
35393 /* This happens if we find @encode(T) (where T is a template
35394 typename or something dependent on a template typename) when
35395 parsing a template. In that case, we can't compile it
35396 immediately, but we rather create an AT_ENCODE_EXPR which will
35397 need to be instantiated when the template is used.
35398 */
35400 {
35404 }
35407 /* Build a location of the form:
35408 @encode(int)
35409 ^~~~~~~~~~~~
35410 with caret==start at the @ token, finishing at the close paren. */
35414 }
35416 /* Parse an Objective-C @defs expression. */
35418 static tree
35420 {
35421 tree name;
35424 matching_parens parens;
35430 }
35432 /* Parse an Objective-C protocol expression.
35434 objc-protocol-expression:
35435 @protocol ( identifier )
35437 Returns a representation of the protocol expression. */
35439 static tree
35441 {
35442 tree proto;
35446 matching_parens parens;
35451 /* Build a location of the form:
35452 @protocol(prot)
35453 ^~~~~~~~~~~~~~~
35454 with caret==start at the @ token, finishing at the close paren. */
35459 }
35461 /* Parse an Objective-C selector expression.
35463 objc-selector-expression:
35464 @selector ( objc-method-signature )
35466 objc-method-signature:
35467 objc-selector
35468 objc-selector-seq
35470 objc-selector-seq:
35471 objc-selector :
35472 objc-selector-seq objc-selector :
35474 Returns a representation of the method selector. */
35476 static tree
35478 {
35485 matching_parens parens;
35491 {
35500 {
35501 /* Detect if we have a unary selector. */
35503 {
35506 }
35507 else
35508 {
35510 }
35511 }
35516 {
35517 sel_seq
35520 sel_seq
35523 }
35524 else
35525 sel_seq
35530 }
35532 finish_selector:
35536 /* Build a location of the form:
35537 @selector(func)
35538 ^~~~~~~~~~~~~~~
35539 with caret==start at the @ token, finishing at the close paren. */
35542 /* TODO: objc_build_selector_expr doesn't always honor the location. */
35545 }
35547 /* Parse a list of identifiers.
35549 objc-identifier-list:
35550 identifier
35551 objc-identifier-list , identifier
35553 Returns a TREE_LIST of identifier nodes. */
35555 static tree
35557 {
35558 tree identifier;
35559 tree list;
35570 {
35577 identifier));
35579 }
35582 }
35584 /* Parse an Objective-C alias declaration.
35586 objc-alias-declaration:
35587 @compatibility_alias identifier identifier ;
35589 This function registers the alias mapping with the Objective-C front end.
35590 It returns nothing. */
35592 static void
35594 {
35602 }
35604 /* Parse an Objective-C class forward-declaration.
35606 objc-class-declaration:
35607 @class objc-identifier-list ;
35609 The function registers the forward declarations with the Objective-C
35610 front end. It returns nothing. */
35612 static void
35614 {
35617 {
35618 tree id;
35628 else
35630 }
35632 }
35634 /* Parse a list of Objective-C protocol references.
35636 objc-protocol-refs-opt:
35637 objc-protocol-refs [opt]
35639 objc-protocol-refs:
35640 < objc-identifier-list >
35642 Returns a TREE_LIST of identifiers, if any. */
35644 static tree
35646 {
35650 {
35654 }
35657 }
35659 /* Parse a Objective-C visibility specification. */
35661 static void
35663 {
35667 {
35682 }
35684 /* Eat '@private'/'@protected'/'@public'. */
35686 }
35688 /* Parse an Objective-C method type. Return 'true' if it is a class
35689 (+) method, and 'false' if it is an instance (-) method. */
35693 {
35696 else
35698 }
35700 /* Parse an Objective-C protocol qualifier. */
35702 static tree
35704 {
35717 {
35722 }
35725 }
35727 /* Parse an Objective-C typename. */
35729 static tree
35731 {
35735 {
35738 matching_parens parens;
35742 /* An ObjC type name may consist of just protocol qualifiers, in which
35743 case the type shall default to 'id'. */
35745 {
35748 /* If the type could not be parsed, an error has already
35749 been produced. For error recovery, behave as if it had
35750 not been specified, which will use the default type
35751 'id'. */
35753 {
35755 /* We need to skip to the closing parenthesis as
35756 cp_parser_type_id() does not seem to do it for
35757 us. */
35762 }
35763 }
35767 }
35770 }
35772 /* Check to see if TYPE refers to an Objective-C selector name. */
35774 static bool
35776 {
35782 }
35784 /* Parse an Objective-C selector. */
35786 static tree
35788 {
35792 {
35795 }
35797 /* C++ operator names are allowed to appear in ObjC selectors. */
35799 {
35812 }
35813 }
35815 /* Parse an Objective-C params list. */
35817 static tree
35819 {
35825 {
35835 /* Detect if we have a unary selector. */
35838 {
35841 }
35845 {
35846 /* Something went quite wrong. There should be a colon
35847 here, but there is not. Stop parsing parameters. */
35849 }
35851 /* New ObjC allows attributes on parameters too. */
35856 params
35859 type_name,
35860 identifier,
35861 parm_attr));
35864 }
35867 {
35870 }
35872 /* We allow tail attributes for the method. */
35874 {
35882 }
35885 {
35888 }
35890 }
35892 /* Parse the non-keyword Objective-C params. */
35894 static tree
35897 {
35903 {
35905 tree parm;
35911 {
35916 }
35918 /* TODO: parse attributes for tail parameters. */
35928 }
35930 /* We allow tail attributes for the method. */
35932 {
35934 {
35939 }
35940 else
35941 /* We have an error, but parse the attributes, so that we can
35942 carry on. */
35948 }
35951 }
35953 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
35955 static void
35957 {
35960 /* If the next token is `extern' and the following token is a string
35961 literal, then we have a linkage specification. */
35963 && cp_parser_is_pure_string_literal
35966 /* Handle #pragma, if any. */
35969 /* Allow stray semicolons. */
35972 /* Mark methods as optional or required, when building protocols. */
35974 {
35977 }
35979 {
35982 }
35985 /* Other stray characters must generate errors. */
35987 {
35991 }
35992 /* Finally, try to parse a block-declaration, or a function-definition. */
35993 else
35995 }
35997 /* Parse a method signature. */
35999 static tree
36001 {
36017 }
36019 static bool
36021 {
36022 tree tattr;
36027 /* If the attributes are followed by a method introducer, this is not allowed.
36028 Dump the attributes and flag the situation. */
36033 /* Otherwise, the attributes introduce some interstitial code, possibly so
36034 rewind to allow that check. */
36037 }
36039 /* Parse an Objective-C method prototype list. */
36041 static void
36043 {
36047 {
36049 {
36054 else
36058 {
36062 }
36065 }
36071 OPT_Wattributes,
36073 else
36074 /* Allow for interspersed non-ObjC++ code. */
36078 }
36082 else
36086 }
36088 /* Parse an Objective-C method definition list. */
36090 static void
36092 {
36094 {
36098 {
36101 }
36103 {
36106 }
36108 {
36112 tree attribute;
36116 else
36117 {
36121 /* For historical reasons, we accept an optional semicolon. */
36127 tree meth
36131 }
36132 }
36133 /* The following case will be removed once @synthesize is
36134 completely implemented. */
36145 else
36146 /* Allow for interspersed non-ObjC++ code. */
36148 }
36151 }
36153 /* Parse Objective-C ivars. */
36155 static void
36157 {
36168 {
36169 cp_decl_specifier_seq declspecs;
36171 tree prefix_attributes;
36179 CP_PARSER_FLAGS_OPTIONAL,
36183 /* auto, register, static, extern, mutable. */
36185 {
36188 }
36190 /* thread_local. */
36192 {
36195 }
36197 /* typedef. */
36199 {
36202 }
36207 /* Keep going until we hit the `;' at the end of the
36208 declaration. */
36210 {
36215 /* Check for a (possibly unnamed) bitfield declaration. */
36223 {
36224 /* Get the name of the bitfield. */
36229 eat_colon:
36231 /* Get the width of the bitfield. */
36232 width
36234 }
36235 else
36236 {
36237 /* Parse the declarator. */
36238 declarator
36240 CP_PARSER_FLAGS_NONE,
36246 }
36248 /* Look for attributes that apply to the ivar. */
36250 /* Remember which attributes are prefix attributes and
36251 which are not. */
36253 /* Combine the attributes. */
36257 /* Create the bitfield declaration. */
36260 else
36265 /* Add the instance variable. */
36269 /* Reset PREFIX_ATTRIBUTES. */
36271 {
36276 }
36281 {
36284 }
36286 }
36290 }
36295 /* Do not consume the RID_AT_END, so it will be read again as terminating
36296 the @interface of @implementation. */
36300 /* For historical reasons, we accept an optional semicolon. */
36303 }
36305 /* Parse an Objective-C protocol declaration. */
36307 static void
36309 {
36315 {
36320 }
36322 /* See if we have a forward declaration or a definition. */
36325 /* Try a forward declaration first. */
36327 {
36329 {
36330 tree id;
36340 else
36342 }
36344 }
36346 /* Ok, we got a full-fledged definition (or at least should). */
36347 else
36348 {
36353 }
36354 }
36356 /* Parse an Objective-C superclass or category. */
36358 static void
36363 {
36369 {
36372 }
36374 {
36375 matching_parens parens;
36378 /* If there is no category name, and this is an @interface, we
36379 have a class extension. */
36381 {
36384 }
36385 else
36389 }
36390 }
36392 /* Parse an Objective-C class interface. */
36394 static void
36396 {
36404 {
36405 /* It's hard to recover because even if valid @interface stuff
36406 is to follow, we can't compile it (or validate it) if we
36407 don't even know which class it refers to. Let's assume this
36408 was a stray '@interface' token in the stream and skip it.
36409 */
36411 }
36416 /* We have either a class or a category on our hands. */
36419 else
36420 {
36422 /* Handle instance variable declarations, if any. */
36425 }
36428 }
36430 /* Parse an Objective-C class implementation. */
36432 static void
36434 {
36441 {
36442 /* It's hard to recover because even if valid @implementation
36443 stuff is to follow, we can't compile it (or validate it) if
36444 we don't even know which class it refers to. Let's assume
36445 this was a stray '@implementation' token in the stream and
36446 skip it.
36447 */
36449 }
36453 /* We have either a class or a category on our hands. */
36456 else
36457 {
36459 /* Handle instance variable declarations, if any. */
36462 }
36465 }
36467 /* Consume the @end token and finish off the implementation. */
36469 static void
36471 {
36474 }
36476 /* Parse an Objective-C declaration. */
36478 static void
36480 {
36481 /* Try to figure out what kind of declaration is present. */
36486 {
36502 }
36505 {
36528 }
36529 }
36531 /* Parse an Objective-C try-catch-finally statement.
36533 objc-try-catch-finally-stmt:
36534 @try compound-statement objc-catch-clause-seq [opt]
36535 objc-finally-clause [opt]
36537 objc-catch-clause-seq:
36538 objc-catch-clause objc-catch-clause-seq [opt]
36540 objc-catch-clause:
36541 @catch ( objc-exception-declaration ) compound-statement
36543 objc-finally-clause:
36544 @finally compound-statement
36546 objc-exception-declaration:
36547 parameter-declaration
36548 '...'
36550 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
36552 Returns NULL_TREE.
36554 PS: This function is identical to c_parser_objc_try_catch_finally_statement
36555 for C. Keep them in sync. */
36557 static tree
36559 {
36560 location_t location;
36561 tree stmt;
36566 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
36567 node, lest it get absorbed into the surrounding block. */
36573 {
36577 matching_parens parens;
36583 {
36584 /* We have "@catch (...)" (where the '...' are literally
36585 what is in the code). Skip the '...'.
36586 parameter_declaration is set to NULL_TREE, and
36587 objc_being_catch_clauses() knows that that means
36588 '...'. */
36591 }
36592 else
36593 {
36594 /* We have "@catch (NSException *exception)" or something
36595 like that. Parse the parameter declaration. */
36600 else
36605 }
36608 else
36609 {
36610 /* If there was no open parenthesis, we are recovering from
36611 an error, and we are trying to figure out what mistake
36612 the user has made. */
36614 /* If there is an immediate closing parenthesis, the user
36615 probably forgot the opening one (ie, they typed "@catch
36616 NSException *e)". Parse the closing parenthesis and keep
36617 going. */
36621 /* If these is no immediate closing parenthesis, the user
36622 probably doesn't know that parenthesis are required at
36623 all (ie, they typed "@catch NSException *e"). So, just
36624 forget about the closing parenthesis and keep going. */
36625 }
36629 }
36631 {
36634 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
36635 node, lest it get absorbed into the surrounding block. */
36639 }
36642 }
36644 /* Parse an Objective-C synchronized statement.
36646 objc-synchronized-stmt:
36647 @synchronized ( expression ) compound-statement
36649 Returns NULL_TREE. */
36651 static tree
36653 {
36654 location_t location;
36661 matching_parens parens;
36666 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
36667 node, lest it get absorbed into the surrounding block. */
36672 }
36674 /* Parse an Objective-C throw statement.
36676 objc-throw-stmt:
36677 @throw assignment-expression [opt] ;
36679 Returns a constructed '@throw' statement. */
36681 static tree
36683 {
36695 }
36697 /* Parse an Objective-C statement. */
36699 static tree
36701 {
36702 /* Try to figure out what kind of declaration is present. */
36706 {
36717 }
36720 }
36722 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
36723 look ahead to see if an objc keyword follows the attributes. This
36724 is to detect the use of prefix attributes on ObjC @interface and
36725 @protocol. */
36727 static bool
36729 {
36734 {
36738 else
36741 }
36744 }
36746 /* This routine is a minimal replacement for
36747 c_parser_struct_declaration () used when parsing the list of
36748 types/names or ObjC++ properties. For example, when parsing the
36749 code
36751 @property (readonly) int a, b, c;
36753 this function is responsible for parsing "int a, int b, int c" and
36754 returning the declarations as CHAIN of DECLs.
36756 TODO: Share this code with cp_parser_objc_class_ivars. It's very
36757 similar parsing. */
36758 static tree
36760 {
36762 cp_decl_specifier_seq declspecs;
36764 tree prefix_attributes;
36767 CP_PARSER_FLAGS_NONE,
36774 /* auto, register, static, extern, mutable. */
36776 {
36779 }
36781 /* thread_local. */
36783 {
36786 }
36788 /* typedef. */
36790 {
36793 }
36798 /* Keep going until we hit the `;' at the end of the declaration. */
36800 {
36805 /* Parse the declarator. */
36807 CP_PARSER_FLAGS_NONE,
36810 /* Look for attributes that apply to the ivar. */
36812 /* Remember which attributes are prefix attributes and
36813 which are not. */
36815 /* Combine the attributes. */
36825 /* Reset PREFIX_ATTRIBUTES. */
36827 {
36832 }
36839 {
36842 }
36843 else
36845 }
36847 }
36849 /* Parse an Objective-C @property declaration. The syntax is:
36851 objc-property-declaration:
36852 '@property' objc-property-attributes[opt] struct-declaration ;
36854 objc-property-attributes:
36855 '(' objc-property-attribute-list ')'
36857 objc-property-attribute-list:
36858 objc-property-attribute
36859 objc-property-attribute-list, objc-property-attribute
36861 objc-property-attribute
36862 'getter' = identifier
36863 'setter' = identifier
36864 'readonly'
36865 'readwrite'
36866 'assign'
36867 'retain'
36868 'copy'
36869 'nonatomic'
36871 For example:
36872 @property NSString *name;
36873 @property (readonly) id object;
36874 @property (retain, nonatomic, getter=getTheName) id name;
36875 @property int a, b, c;
36877 PS: This function is identical to
36878 c_parser_objc_at_property_declaration for C. Keep them in sync. */
36879 static void
36881 {
36882 /* Parse the optional attribute list.
36884 A list of parsed, but not verified, attributes. */
36890 /* Parse the optional attribute list... */
36892 {
36893 /* Eat the '('. */
36894 matching_parens parens;
36899 /* Allow empty @property attribute lists, but with a warning. */
36901 location_t attr_comb;
36903 {
36907 }
36908 else
36910 {
36917 {
36924 }
36935 /* Account for accepting the 'class' keyword in this context. */
36937 else
36941 enum objc_property_attribute_kind prop_kind
36943 property_attribute_info *prop
36947 tree meth_name;
36949 {
36954 attr_name);
36955 else
36963 {
36966 attr_name);
36969 }
36977 {
36980 attr_name);
36983 }
36985 /* Get the end of the method name, and consume the name. */
36988 /* Because method names may contain C++ keywords, we have a
36989 routine to fetch them (this also consumes the token). */
36993 {
36995 {
36997 attr_end);
37001 }
37002 else
37003 {
37007 }
37009 attr_end);
37010 }
37011 else
37013 attr_end);
37015 /* Updated location including all that was successfully
37016 parsed. */
37019 }
37021 /* If we see a comma here, then keep going - even if we already
37022 saw a syntax error. For simple mistakes e.g. (asign, getter=x)
37023 this makes a more useful output and avoid spurious warnings
37024 about missing attributes that are, in fact, specified after the
37025 one with the syntax error. */
37028 else
37030 }
37036 }
37038 /* 'properties' is the list of properties that we read. Usually a
37039 single one, but maybe more (eg, in "@property int a, b, c;" there
37040 are three).
37041 TODO: Update this parsing so that it accepts (erroneous) bitfields so
37042 that we can issue a meaningful and consistent (between C/C++) error
37043 message from objc_add_property_declaration (). */
37050 else
37051 {
37052 /* Comma-separated properties are chained together in reverse order;
37053 add them one by one. */
37057 prop_attr_list);
37058 }
37061 }
37063 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
37065 objc-synthesize-declaration:
37066 @synthesize objc-synthesize-identifier-list ;
37068 objc-synthesize-identifier-list:
37069 objc-synthesize-identifier
37070 objc-synthesize-identifier-list, objc-synthesize-identifier
37072 objc-synthesize-identifier
37073 identifier
37074 identifier = identifier
37076 For example:
37077 @synthesize MyProperty;
37078 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
37080 PS: This function is identical to c_parser_objc_at_synthesize_declaration
37081 for C. Keep them in sync.
37082 */
37083 static void
37085 {
37087 location_t loc;
37092 {
37096 {
37099 }
37101 {
37105 {
37108 }
37109 }
37110 else
37115 else
37117 }
37120 }
37122 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
37124 objc-dynamic-declaration:
37125 @dynamic identifier-list ;
37127 For example:
37128 @dynamic MyProperty;
37129 @dynamic MyProperty, AnotherProperty;
37131 PS: This function is identical to c_parser_objc_at_dynamic_declaration
37132 for C. Keep them in sync.
37133 */
37134 static void
37136 {
37138 location_t loc;
37143 {
37144 tree property;
37147 {
37150 }
37154 else
37156 }
37159 }
37161 \f
37162 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
37164 /* Returns name of the next clause.
37165 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
37166 the token is not consumed. Otherwise appropriate pragma_omp_clause is
37167 returned and the token is consumed. */
37169 static pragma_omp_clause
37171 {
37187 {
37192 {
37411 }
37412 }
37418 }
37420 /* Validate that a clause of the given type does not already exist. */
37422 static void
37425 {
37428 }
37430 /* OpenMP 2.5:
37431 variable-list:
37432 identifier
37433 variable-list , identifier
37435 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
37436 colon). An opening parenthesis will have been consumed by the caller.
37438 If KIND is nonzero, create the appropriate node and install the decl
37439 in OMP_CLAUSE_DECL and add the node to the head of the list.
37441 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
37442 return the list created.
37444 COLON can be NULL if only closing parenthesis should end the list,
37445 or pointer to bool which will receive false if the list is terminated
37446 by closing parenthesis or true if the list is terminated by colon.
37448 The optional ALLOW_DEREF argument is true if list items can use the deref
37449 (->) operator. */
37451 struct omp_dim
37452 {
37454 location_t loc;
37458 };
37460 static tree
37464 {
37470 {
37473 }
37475 {
37483 {
37489 }
37493 {
37494 cp_id_kind idk;
37497 }
37502 CPP_CLOSE_PAREN)))
37503 {
37506 }
37507 else
37508 {
37515 {
37520 }
37524 else
37527 {
37533 }
37534 }
37538 ;
37540 {
37542 {
37544 /* The OpenACC cache directive explicitly only allows "array
37545 elements or subarrays". */
37547 {
37551 }
37552 /* FALLTHROUGH. */
37556 start_component_ref:
37558 || (allow_deref
37560 {
37561 cpp_ttype ttype
37564 location_t loc
37569 decl = (cp_parser_postfix_dot_deref_expression
37572 }
37573 /* FALLTHROUGH. */
37583 {
37591 {
37594 /* Later handling is not prepared to see through these. */
37596 }
37598 parser->colon_corrects_to_scope_p
37601 {
37604 }
37605 else
37606 {
37607 /* Look for `:'. */
37609 {
37614 }
37617 else
37620 CPP_CLOSE_SQUARE))
37621 {
37623 /* Later handling is not prepared to see through these. */
37625 }
37626 }
37627 /* Look for the closing `]'. */
37629 RT_CLOSE_SQUARE))
37630 {
37635 }
37638 }
37643 && !array_section_p
37645 || (allow_deref
37647 CPP_DEREF))))
37648 {
37650 {
37654 }
37656 }
37657 else
37664 }
37667 {
37671 {
37672 depend_lvalue:
37676 }
37677 else
37679 }
37685 }
37686 else
37689 get_comma:
37693 }
37699 {
37703 }
37706 {
37709 /* Try to resync to an unnested comma. Copied from
37710 cp_parser_parenthesized_expression_list. */
37711 skip_comma:
37720 }
37723 }
37725 /* Similarly, but expect leading and trailing parenthesis. This is a very
37726 common case for omp clauses. */
37728 static tree
37731 {
37734 allow_deref);
37736 }
37738 /* OpenACC 2.0:
37739 copy ( variable-list )
37740 copyin ( variable-list )
37741 copyout ( variable-list )
37742 create ( variable-list )
37743 delete ( variable-list )
37744 present ( variable-list )
37746 OpenACC 2.6:
37747 no_create ( variable-list )
37748 attach ( variable-list )
37749 detach ( variable-list ) */
37751 static tree
37753 tree list)
37754 {
37757 {
37799 }
37807 }
37809 /* OpenACC 2.0:
37810 deviceptr ( variable-list ) */
37812 static tree
37814 {
37818 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
37819 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
37820 variable-list must only allow for pointer variables. */
37823 {
37830 }
37833 }
37835 /* OpenACC 2.5:
37836 auto
37837 finalize
37838 independent
37839 nohost
37840 seq */
37842 static tree
37844 tree list)
37845 {
37852 }
37854 /* OpenACC:
37855 num_gangs ( expression )
37856 num_workers ( expression )
37857 vector_length ( expression ) */
37859 static tree
37862 {
37865 matching_parens parens;
37873 {
37878 }
37886 }
37888 /* OpenACC:
37890 gang [( gang-arg-list )]
37891 worker [( [num:] int-expr )]
37892 vector [( [length:] int-expr )]
37894 where gang-arg is one of:
37896 [num:] int-expr
37897 static: size-expr
37899 and size-expr may be:
37901 *
37902 int-expr
37903 */
37905 static tree
37907 omp_clause_code kind,
37909 {
37918 {
37919 matching_parens parens;
37922 do
37923 {
37927 /* Gang static argument. */
37930 {
37938 {
37941 }
37943 /* Check for the '*' argument. */
37947 CPP_CLOSE_PAREN)))
37948 {
37953 {
37956 }
37958 }
37959 }
37960 /* Worker num: argument and vector length: arguments. */
37964 {
37967 }
37969 /* Now collect the actual argument. */
37971 {
37974 }
37986 {
37989 }
37991 }
37996 }
38010 cleanup_error:
38013 }
38015 /* OpenACC 2.0:
38016 tile ( size-expr-list ) */
38018 static tree
38020 {
38024 /* Collapse and tile are mutually exclusive. (The spec doesn't say
38025 so, but the spec authors never considered such a case and have
38026 differing opinions on what it might mean, including 'not
38027 allowed'.) */
38030 clause_loc);
38035 do
38036 {
38043 {
38046 }
38047 else
38051 }
38054 /* Consume the trailing ')'. */
38062 }
38064 /* OpenACC 2.0
38065 Parse wait clause or directive parameters. */
38067 static tree
38069 {
38079 {
38081 {
38084 }
38086 }
38093 {
38097 {
38100 else
38101 {
38108 }
38109 }
38110 }
38113 }
38115 /* OpenACC:
38116 wait [( int-expr-list )] */
38118 static tree
38120 {
38125 else
38126 {
38132 }
38135 }
38137 /* OpenMP 3.0:
38138 collapse ( constant-expression ) */
38140 static tree
38142 {
38144 location_t loc;
38145 HOST_WIDE_INT n;
38148 matching_parens parens;
38166 {
38169 }
38178 }
38180 /* OpenMP 2.5:
38181 default ( none | shared )
38183 OpenMP 5.1:
38184 default ( private | firstprivate )
38186 OpenACC:
38187 default ( none | present ) */
38189 static tree
38192 {
38194 tree c;
38196 matching_parens parens;
38200 {
38203 }
38205 {
38210 {
38237 }
38240 }
38241 else
38242 {
38243 invalid_kind:
38246 else
38249 }
38266 }
38268 /* OpenMP 3.1:
38269 final ( expression ) */
38271 static tree
38273 {
38276 matching_parens parens;
38295 }
38297 /* OpenMP 2.5:
38298 if ( expression )
38300 OpenMP 4.5:
38301 if ( directive-name-modifier : expression )
38303 directive-name-modifier:
38304 parallel | task | taskloop | target data | target | target update
38305 | target enter data | target exit data
38307 OpenMP 5.0:
38308 directive-name-modifier:
38309 ... | simd | cancel */
38311 static tree
38314 {
38318 matching_parens parens;
38323 {
38339 {
38342 {
38355 else
38356 {
38357 location_t loc
38362 }
38365 {
38367 {
38372 }
38374 {
38375 location_t loc
38379 }
38380 }
38381 }
38382 }
38384 {
38386 {
38389 }
38390 else
38391 {
38393 {
38394 location_t loc
38397 }
38399 }
38400 }
38401 }
38413 {
38416 {
38419 {
38431 }
38433 p);
38435 }
38437 {
38440 else
38443 }
38446 {
38450 }
38451 }
38459 }
38461 /* OpenMP 3.1:
38462 mergeable */
38464 static tree
38467 {
38468 tree c;
38471 location);
38476 }
38478 /* OpenMP 2.5:
38479 nowait */
38481 static tree
38484 {
38485 tree c;
38492 }
38494 /* OpenMP 2.5:
38495 num_threads ( expression ) */
38497 static tree
38499 location_t location)
38500 {
38503 matching_parens parens;
38523 }
38525 /* OpenMP 4.5:
38526 num_tasks ( expression )
38528 OpenMP 5.1:
38529 num_tasks ( strict : expression ) */
38531 static tree
38533 location_t location)
38534 {
38537 matching_parens parens;
38544 {
38547 {
38551 }
38552 }
38571 }
38573 /* OpenMP 4.5:
38574 grainsize ( expression )
38576 OpenMP 5.1:
38577 grainsize ( strict : expression ) */
38579 static tree
38581 location_t location)
38582 {
38585 matching_parens parens;
38592 {
38595 {
38599 }
38600 }
38619 }
38621 /* OpenMP 4.5:
38622 priority ( expression ) */
38624 static tree
38626 location_t location)
38627 {
38630 matching_parens parens;
38650 }
38652 /* OpenMP 4.5:
38653 hint ( expression ) */
38655 static tree
38657 {
38660 matching_parens parens;
38667 {
38675 }
38688 }
38690 /* OpenMP 5.1:
38691 filter ( integer-expression ) */
38693 static tree
38695 {
38698 matching_parens parens;
38716 }
38718 /* OpenMP 4.5:
38719 defaultmap ( tofrom : scalar )
38721 OpenMP 5.0:
38722 defaultmap ( implicit-behavior [ : variable-category ] ) */
38724 static tree
38726 location_t location)
38727 {
38731 enum omp_clause_defaultmap_kind category
38734 matching_parens parens;
38741 {
38742 invalid_behavior:
38744 "%<tofrom%>, %<firstprivate%>, %<none%> "
38747 }
38748 else
38749 {
38752 }
38755 {
38759 else
38766 else
38775 else
38782 else
38789 else
38798 else
38804 }
38808 {
38813 {
38814 invalid_category:
38818 }
38823 {
38827 else
38834 else
38841 else
38847 }
38850 }
38860 {
38867 {
38882 }
38885 p);
38886 else
38890 }
38897 out_err:
38902 }
38904 /* OpenMP 5.0:
38905 order ( concurrent )
38907 OpenMP 5.1:
38908 order ( order-modifier : concurrent )
38910 order-modifier:
38911 reproducible
38912 unconstrained */
38914 static tree
38916 {
38922 matching_parens parens;
38928 {
38935 else
38936 {
38940 }
38943 }
38945 {
38948 }
38949 else
38950 {
38953 }
38955 {
38958 }
38970 out_err:
38975 }
38977 /* OpenMP 5.0:
38978 bind ( teams | parallel | thread ) */
38980 static tree
38982 location_t location)
38983 {
38984 tree c;
38988 matching_parens parens;
38993 {
38994 invalid:
38998 }
38999 else
39000 {
39003 }
39014 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
39020 out_err:
39025 }
39027 /* OpenMP 2.5:
39028 ordered
39030 OpenMP 4.5:
39031 ordered ( constant-expression ) */
39033 static tree
39036 {
39038 HOST_WIDE_INT n;
39044 {
39045 matching_parens parens;
39062 {
39064 "ordered argument needs positive constant integer "
39067 }
39068 }
39074 }
39076 /* OpenMP 2.5:
39077 reduction ( reduction-operator : variable-list )
39079 reduction-operator:
39080 One of: + * - & ^ | && ||
39082 OpenMP 3.1:
39084 reduction-operator:
39085 One of: + * - & ^ | && || min max
39087 OpenMP 4.0:
39089 reduction-operator:
39090 One of: + * - & ^ | && ||
39091 id-expression
39093 OpenMP 5.0:
39094 reduction ( reduction-modifier, reduction-operator : variable-list )
39095 in_reduction ( reduction-operator : variable-list )
39096 task_reduction ( reduction-operator : variable-list ) */
39098 static tree
39101 {
39111 {
39114 {
39117 }
39120 {
39128 {
39131 }
39132 }
39133 }
39136 {
39146 }
39150 else
39151 {
39162 {
39192 }
39193 else
39194 {
39196 resync_fail:
39201 }
39202 }
39208 NULL);
39210 {
39217 }
39220 }
39222 /* OpenMP 2.5:
39223 schedule ( schedule-kind )
39224 schedule ( schedule-kind , expression )
39226 schedule-kind:
39227 static | dynamic | guided | runtime | auto
39229 OpenMP 4.5:
39230 schedule ( schedule-modifier : schedule-kind )
39231 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
39233 schedule-modifier:
39234 simd
39235 monotonic
39236 nonmonotonic */
39238 static tree
39240 {
39244 matching_parens parens;
39252 {
39261 else
39267 {
39270 }
39271 else
39272 {
39275 }
39276 }
39281 {
39286 {
39307 }
39308 }
39313 else
39319 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
39321 {
39325 }
39328 {
39343 else
39348 }
39360 invalid_kind:
39362 resync_fail:
39367 }
39369 /* OpenMP 3.0:
39370 untied */
39372 static tree
39375 {
39376 tree c;
39383 }
39385 /* OpenMP 4.0:
39386 inbranch
39387 notinbranch */
39389 static tree
39392 {
39397 }
39399 /* OpenMP 4.0:
39400 parallel
39401 for
39402 sections
39403 taskgroup */
39405 static tree
39409 {
39413 }
39415 /* OpenMP 4.5:
39416 nogroup */
39418 static tree
39421 {
39426 }
39428 /* OpenMP 4.5:
39429 simd
39430 threads */
39432 static tree
39436 {
39441 }
39443 /* OpenMP 4.0:
39444 num_teams ( expression )
39446 OpenMP 5.1:
39447 num_teams ( expression : expression ) */
39449 static tree
39451 location_t location)
39452 {
39455 matching_parens parens;
39466 {
39470 }
39487 }
39489 /* OpenMP 4.0:
39490 thread_limit ( expression ) */
39492 static tree
39494 location_t location)
39495 {
39498 matching_parens parens;
39518 }
39520 /* OpenMP 4.0:
39521 aligned ( variable-list )
39522 aligned ( variable-list : constant-expression ) */
39524 static tree
39526 {
39530 matching_parens parens;
39538 {
39548 }
39554 }
39556 /* OpenMP 5.0:
39557 allocate ( variable-list )
39558 allocate ( expression : variable-list )
39560 OpenMP 5.1:
39561 allocate ( allocator-modifier : variable-list )
39562 allocate ( allocator-modifier , allocator-modifier : variable-list )
39564 allocator-modifier:
39565 allocator ( expression )
39566 align ( expression ) */
39568 static tree
39570 {
39574 matching_parens parens;
39584 {
39590 matching_parens parens2;
39594 {
39598 }
39599 else
39600 {
39604 }
39608 {
39611 }
39615 }
39616 else
39619 {
39625 }
39628 {
39635 }
39636 else
39637 {
39641 }
39648 {
39651 }
39654 }
39656 /* OpenMP 2.5:
39657 lastprivate ( variable-list )
39659 OpenMP 5.0:
39660 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
39662 static tree
39664 {
39672 {
39677 {
39681 }
39682 }
39691 }
39693 /* OpenMP 4.0:
39694 linear ( variable-list )
39695 linear ( variable-list : expression )
39697 OpenMP 4.5:
39698 linear ( modifier ( variable-list ) )
39699 linear ( modifier ( variable-list ) : expression )
39701 modifier:
39702 val
39703 ref
39704 uval
39706 OpenMP 5.2:
39707 linear ( variable-list : modifiers-list )
39709 modifiers:
39710 val
39711 ref
39712 uval
39713 step ( expression ) */
39715 static tree
39718 {
39724 matching_parens parens;
39729 {
39740 {
39743 }
39744 else
39746 }
39751 else
39752 {
39761 }
39764 {
39768 {
39778 {
39782 }
39786 CPP_CLOSE_PAREN)))
39788 }
39792 {
39794 {
39805 {
39811 }
39813 {
39814 location_t step_loc
39817 matching_parens parens2;
39819 {
39825 CPP_CLOSE_PAREN))
39826 {
39827 cp_token *token
39835 tok_loc);
39837 {
39840 }
39843 }
39849 }
39850 else
39852 }
39853 else
39856 {
39859 }
39861 }
39864 }
39868 {
39879 {
39882 }
39885 }
39896 }
39899 {
39903 }
39906 }
39908 /* OpenMP 4.0:
39909 safelen ( constant-expression ) */
39911 static tree
39913 location_t location)
39914 {
39917 matching_parens parens;
39936 }
39938 /* OpenMP 4.0:
39939 simdlen ( constant-expression ) */
39941 static tree
39943 location_t location)
39944 {
39947 matching_parens parens;
39966 }
39968 /* OpenMP 4.5:
39969 vec:
39970 identifier [+/- integer]
39971 vec , identifier [+/- integer]
39972 */
39974 static tree
39977 {
39981 {
39984 }
39987 {
39993 {
39996 {
40004 }
40005 }
40006 }
40009 {
40016 else
40017 {
40018 t = cp_parser_lookup_name_simple
40023 id_loc);
40024 }
40030 {
40033 }
40037 {
40040 }
40044 {
40047 }
40050 add_to_vector:
40052 {
40056 }
40063 }
40066 {
40073 }
40075 }
40077 /* OpenMP 5.0:
40078 detach ( event-handle ) */
40080 static tree
40082 {
40083 matching_parens parens;
40099 else
40100 {
40103 else
40108 }
40121 }
40123 /* OpenMP 5.0:
40124 iterators ( iterators-definition )
40126 iterators-definition:
40127 iterator-specifier
40128 iterator-specifier , iterators-definition
40130 iterator-specifier:
40131 identifier = range-specification
40132 iterator-type identifier = range-specification
40134 range-specification:
40135 begin : end
40136 begin : end : step */
40138 static tree
40140 {
40144 matching_parens parens;
40148 bool saved_colon_corrects_to_scope_p
40150 bool saved_colon_doesnt_start_class_def_p
40153 do
40154 {
40155 tree iter_type;
40159 else
40160 {
40163 parser->type_definition_forbidden_message
40169 }
40173 {
40176 }
40196 {
40199 }
40214 {
40217 }
40219 }
40223 parser->colon_doesnt_start_class_def_p
40233 }
40235 /* OpenMP 5.0:
40236 affinity ( [aff-modifier :] variable-list )
40237 aff-modifier:
40238 iterator ( iterators-definition ) */
40240 static tree
40242 {
40245 matching_parens parens;
40250 {
40255 CPP_OPEN_PAREN)));
40257 {
40260 }
40262 {
40266 {
40274 }
40275 }
40276 }
40280 {
40283 {
40288 }
40289 }
40291 }
40293 /* OpenMP 4.0:
40294 depend ( depend-kind : variable-list )
40296 depend-kind:
40297 in | out | inout
40299 OpenMP 4.5:
40300 depend ( source )
40302 depend ( sink : vec )
40304 OpenMP 5.0:
40305 depend ( depend-modifier , depend-kind: variable-list )
40307 depend-kind:
40308 in | out | inout | mutexinoutset | depobj
40310 depend-modifier:
40311 iterator ( iterators-definition ) */
40313 static tree
40315 {
40320 matching_parens parens;
40324 do
40325 {
40333 {
40338 }
40355 else
40358 }
40366 {
40371 }
40374 {
40385 }
40391 {
40397 }
40398 else
40399 {
40404 {
40408 else
40410 }
40413 {
40418 }
40419 }
40422 invalid_kind:
40424 resync_fail:
40431 }
40433 /* OpenMP 5.2:
40434 doacross ( source : )
40435 doacross ( source : omp_cur_iteration )
40437 doacross ( sink : vec )
40438 doacross ( sink : omp_cur_iteration - logical_iteration ) */
40440 static tree
40442 {
40443 tree nlist;
40446 matching_parens parens;
40451 {
40452 invalid_kind:
40454 resync_fail:
40459 }
40468 else
40477 {
40479 {
40484 }
40489 }
40490 else
40498 }
40500 /* OpenMP 4.0:
40501 from ( variable-list )
40502 to ( variable-list )
40504 OpenMP 5.1:
40505 from ( [present :] variable-list )
40506 to ( [present :] variable-list ) */
40508 static tree
40510 tree list)
40511 {
40521 {
40525 }
40533 }
40535 /* OpenMP 4.0:
40536 map ( map-kind : variable-list )
40537 map ( variable-list )
40539 map-kind:
40540 alloc | to | from | tofrom
40542 OpenMP 4.5:
40543 map-kind:
40544 alloc | to | from | tofrom | release | delete
40546 map ( always [,] map-kind: variable-list )
40548 OpenMP 5.0:
40549 map ( [map-type-modifier[,] ...] map-kind: variable-list )
40551 map-type-modifier:
40552 always | close */
40554 static tree
40556 {
40567 {
40569 {
40572 }
40575 pos++;
40576 pos++;
40577 }
40583 {
40586 {
40589 }
40593 {
40595 {
40602 }
40604 }
40606 {
40608 {
40615 }
40617 }
40619 {
40621 {
40628 }
40630 }
40631 else
40632 {
40640 }
40643 }
40647 {
40671 else
40672 {
40678 }
40681 }
40684 {
40688 }
40697 }
40699 /* OpenMP 4.0:
40700 device ( expression )
40702 OpenMP 5.0:
40703 device ( [device-modifier :] integer-expression )
40705 device-modifier:
40706 ancestor | device_num */
40708 static tree
40710 location_t location)
40711 {
40715 matching_parens parens;
40721 {
40725 {
40728 /* A requires directive with the reverse_offload clause must be
40729 specified. */
40731 {
40733 "preceded by %<requires%> directive "
40737 }
40738 }
40740 ;
40741 else
40742 {
40746 }
40749 }
40768 }
40770 /* OpenMP 4.0:
40771 dist_schedule ( static )
40772 dist_schedule ( static , expression ) */
40774 static tree
40776 location_t location)
40777 {
40780 matching_parens parens;
40791 {
40802 }
40806 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
40807 "dist_schedule", location); */
40813 invalid_kind:
40815 resync_fail:
40820 }
40822 /* OpenMP 4.0:
40823 proc_bind ( proc-bind-kind )
40825 proc-bind-kind:
40826 primary | master | close | spread
40827 where OpenMP 5.1 added 'primary' and deprecated the alias 'master'. */
40829 static tree
40831 location_t location)
40832 {
40833 tree c;
40840 {
40852 else
40854 }
40855 else
40864 location);
40869 invalid_kind:
40871 resync_fail:
40876 }
40878 /* OpenMP 5.0:
40879 device_type ( host | nohost | any ) */
40881 static tree
40883 location_t location)
40884 {
40885 tree c;
40892 {
40902 else
40904 }
40905 else
40914 location);
40919 invalid_kind:
40921 resync_fail:
40926 }
40928 /* OpenACC:
40929 async [( int-expr )] */
40931 static tree
40933 {
40940 {
40941 matching_parens parens;
40950 }
40960 }
40962 /* Parse all OpenACC clauses. The set clauses allowed by the directive
40963 is a bitmask in MASK. Return the list of clauses found. */
40965 static tree
40969 {
40973 /* Don't create location wrapper nodes within OpenACC clauses. */
40974 auto_suppress_location_wrappers sentinel;
40977 {
40978 location_t here;
40979 pragma_omp_clause c_kind;
40980 omp_clause_code code;
40991 {
40998 clauses);
41051 clauses);
41056 clauses);
41074 clauses);
41079 clauses);
41092 clauses);
41099 clauses);
41105 clauses);
41113 clauses);
41117 clauses
41124 clauses);
41133 clauses);
41139 OMP_CLAUSE_VECTOR,
41146 clauses);
41155 OMP_CLAUSE_WORKER,
41161 }
41166 {
41167 /* Remove the invalid clause(s) from the list to avoid
41168 confusing the rest of the compiler. */
41171 }
41172 }
41174 saw_error:
41181 }
41183 /* Parse all OpenMP clauses. The set clauses allowed by the directive
41184 is a bitmask in MASK. Return the list of clauses found.
41185 FINISH_P set if finish_omp_clauses should be called.
41186 NESTED non-zero if clauses should be terminated by closing paren instead
41187 of end of pragma. If it is 2, additionally commas are required in between
41188 the clauses. */
41190 static tree
41194 {
41199 /* Don't create location wrapper nodes within OpenMP clauses. */
41200 auto_suppress_location_wrappers sentinel;
41203 {
41204 pragma_omp_clause c_kind;
41212 {
41217 "clauses in %<simd%> trait should be separated "
41219 }
41225 {
41242 clauses);
41261 clauses);
41281 clauses);
41286 clauses);
41291 clauses);
41296 clauses);
41305 clauses
41351 clauses);
41355 clauses
41367 clauses);
41371 clauses
41373 OMP_CLAUSE_TASK_REDUCTION,
41389 clauses);
41394 OMP_CLAUSE_NOTINBRANCH,
41403 {
41404 clause_not_first:
41408 }
41437 {
41439 clauses);
41443 }
41444 else
41446 clauses);
41451 clauses);
41456 clauses);
41478 {
41483 }
41544 clauses
41550 clauses
41557 clauses);
41563 }
41568 {
41569 /* Remove the invalid clause(s) from the list to avoid
41570 confusing the rest of the compiler. */
41573 }
41574 }
41575 saw_error:
41579 {
41582 else
41584 }
41586 }
41588 /* OpenMP 2.5:
41589 structured-block:
41590 statement
41592 In practice, we're also interested in adding the statement to an
41593 outer node. So it is convenient if we work around the fact that
41594 cp_parser_statement calls add_stmt. */
41596 static unsigned
41598 {
41601 /* Only move the values to IN_OMP_BLOCK if they weren't false.
41602 This preserves the "not within loop or switch" style error messages
41603 for nonsense cases like
41604 void foo() {
41605 #pragma omp single
41606 break;
41607 }
41608 */
41613 }
41615 static void
41617 {
41619 }
41621 static tree
41623 {
41632 }
41634 /* OpenMP 5.x:
41635 # pragma omp allocate (list) clauses
41637 OpenMP 5.0 clause:
41638 allocator (omp_allocator_handle_t expression)
41640 OpenMP 5.1 additional clause:
41641 align (constant-expression)] */
41643 static void
41645 {
41651 do
41652 {
41659 matching_parens parens;
41665 {
41668 }
41673 {
41676 }
41678 {
41681 /* FIXME: Remove when adding check to semantics.cc; cf FIXME below. */
41685 {
41687 "positive constant power of two integer "
41690 }
41692 {
41695 {
41700 {
41702 "positive constant power of two integer "
41705 }
41706 }
41707 }
41708 }
41710 {
41713 }
41714 else
41715 {
41718 }
41725 {
41728 }
41730 /* FIXME: When implementing properly, delete the align/allocate expr error
41731 check above and add one in semantics.cc (to properly handle templates).
41732 Base this on the allocator/align modifiers check for the 'allocate' clause
41733 in semantics.cc's finish_omp_clauses. */
41735 }
41737 /* OpenMP 2.5:
41738 # pragma omp atomic new-line
41739 expression-stmt
41741 expression-stmt:
41742 x binop= expr | x++ | ++x | x-- | --x
41743 binop:
41744 +, *, -, /, &, ^, |, <<, >>
41746 where x is an lvalue expression with scalar type.
41748 OpenMP 3.1:
41749 # pragma omp atomic new-line
41750 update-stmt
41752 # pragma omp atomic read new-line
41753 read-stmt
41755 # pragma omp atomic write new-line
41756 write-stmt
41758 # pragma omp atomic update new-line
41759 update-stmt
41761 # pragma omp atomic capture new-line
41762 capture-stmt
41764 # pragma omp atomic capture new-line
41765 capture-block
41767 read-stmt:
41768 v = x
41769 write-stmt:
41770 x = expr
41771 update-stmt:
41772 expression-stmt | x = x binop expr
41773 capture-stmt:
41774 v = expression-stmt
41775 capture-block:
41776 { v = x; update-stmt; } | { update-stmt; v = x; }
41778 OpenMP 4.0:
41779 update-stmt:
41780 expression-stmt | x = x binop expr | x = expr binop x
41781 capture-stmt:
41782 v = update-stmt
41783 capture-block:
41784 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
41786 OpenMP 5.1:
41787 # pragma omp atomic compare new-line
41788 conditional-update-atomic
41790 # pragma omp atomic compare capture new-line
41791 conditional-update-capture-atomic
41793 conditional-update-atomic:
41794 cond-expr-stmt | cond-update-stmt
41795 cond-expr-stmt:
41796 x = expr ordop x ? expr : x;
41797 x = x ordop expr ? expr : x;
41798 x = x == e ? d : x;
41799 cond-update-stmt:
41800 if (expr ordop x) { x = expr; }
41801 if (x ordop expr) { x = expr; }
41802 if (x == e) { x = d; }
41803 ordop:
41804 <, >
41805 conditional-update-capture-atomic:
41806 v = cond-expr-stmt
41807 { v = x; cond-expr-stmt }
41808 { cond-expr-stmt v = x; }
41809 { v = x; cond-update-stmt }
41810 { cond-update-stmt v = x; }
41811 if (x == e) { x = d; } else { v = x; }
41812 { r = x == e; if (r) { x = d; } }
41813 { r = x == e; if (r) { x = d; } else { v = x; } }
41815 where x, r and v are lvalue expressions with scalar type,
41816 expr, e and d are expressions with scalar type and e might be
41817 the same as v. */
41819 static void
41821 {
41837 {
41843 {
41848 enum omp_memory_order new_memory_order
41864 {
41868 }
41876 {
41877 matching_parens parens;
41884 {
41894 }
41897 {
41901 else
41903 }
41904 else
41914 }
41926 {
41930 }
41931 else
41932 {
41935 "%<capture%>, %<compare%>, %<weak%>, %<fail%>, "
41936 "%<seq_cst%>, %<acq_rel%>, %<release%>, "
41938 }
41940 {
41942 {
41943 /* OpenACC permits 'update capture'. */
41950 else
41952 }
41954 {
41957 else
41959 }
41961 {
41964 else
41966 }
41968 {
41971 else
41973 }
41975 {
41978 else
41980 }
41983 }
41984 }
41986 }
41992 {
41996 else
41998 }
42000 {
42004 }
42006 {
42009 }
42011 {
42014 }
42018 {
42019 omp_requires_mask
42024 {
42034 {
42044 }
42048 }
42049 }
42050 else
42052 {
42055 {
42059 }
42065 {
42069 }
42075 }
42077 memory_order
42082 {
42092 else
42097 {
42098 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
42099 opcode. */
42104 }
42108 {
42111 }
42115 else
42116 {
42124 {
42128 }
42129 }
42132 }
42134 restart:
42136 {
42139 matching_parens parens;
42143 tree cmp_expr;
42146 else
42154 {
42160 }
42162 ;
42164 {
42168 }
42171 {
42173 "expected %<==%>, %<<%> or %<>%> comparison in %<if%> "
42176 }
42187 {
42190 }
42195 else
42208 {
42210 {
42213 }
42215 {
42220 }
42221 else
42223 }
42228 {
42233 }
42234 else
42235 {
42236 bad_if:
42240 }
42243 {
42247 {
42251 }
42279 /* Signal to c_finish_omp_atomic that in
42280 if (x == e) { x = d; } else { v = x; }
42281 case the store to v should be conditional. */
42283 }
42285 {
42288 }
42294 }
42298 {
42305 /* FALLTHROUGH */
42317 /* FALLTHROUGH */
42334 /* Undo effects of boolean_increment for post {in,de}crement. */
42336 /* FALLTHRU */
42340 {
42341 /* Undo effects of boolean_increment. */
42343 {
42344 /* This is pre or post increment. */
42349 && !structured_block
42355 }
42356 }
42357 /* FALLTHRU */
42360 {
42363 }
42365 {
42400 {
42404 }
42409 {
42415 {
42420 }
42422 {
42436 {
42438 {
42443 }
42444 else
42446 }
42451 || !structured_block
42452 || v
42458 {
42460 {
42466 }
42467 }
42475 {
42479 cond_expr:
42481 bool saved_colon_corrects_to_scope_p
42485 parser->colon_corrects_to_scope_p
42490 {
42492 {
42494 {
42498 }
42500 {
42501 opcode
42505 }
42506 }
42507 else
42508 {
42511 {
42512 opcode
42517 }
42518 }
42519 }
42521 "invalid form of "
42524 }
42528 }
42533 {
42540 }
42544 }
42548 {
42551 {
42559 }
42561 {
42566 }
42610 }
42613 {
42615 "invalid form of "
42618 }
42629 {
42631 {
42633 "invalid form of "
42636 }
42638 }
42644 }
42651 }
42652 stmt_done:
42654 {
42667 }
42669 {
42673 }
42674 done:
42676 {
42679 }
42687 invalid_compare:
42689 /* FALLTHRU */
42690 saw_error:
42695 {
42699 {
42703 }
42704 }
42705 }
42708 /* OpenMP 2.5:
42709 # pragma omp barrier new-line */
42711 static void
42713 {
42716 }
42718 /* OpenMP 2.5:
42719 # pragma omp critical [(name)] new-line
42720 structured-block
42722 OpenMP 4.5:
42723 # pragma omp critical [(name) [hint(expression)]] new-line
42724 structured-block */
42726 #define OMP_CRITICAL_CLAUSE_MASK \
42727 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
42729 static tree
42731 {
42735 {
42736 matching_parens parens;
42752 }
42759 }
42761 /* OpenMP 5.0:
42762 # pragma omp depobj ( depobj ) depobj-clause new-line
42764 depobj-clause:
42765 depend (dependence-type : locator)
42766 destroy
42767 update (dependence-type)
42769 dependence-type:
42770 in
42771 out
42772 inout
42773 mutexinout */
42775 static void
42777 {
42779 matching_parens parens;
42781 {
42784 }
42799 {
42805 {
42806 /* Don't create location wrapper nodes within the depend clause. */
42807 auto_suppress_location_wrappers sentinel;
42813 }
42817 {
42818 matching_parens c_parens;
42820 {
42821 location_t c2_loc
42824 {
42839 }
42841 {
42845 }
42851 }
42852 else
42854 }
42855 }
42857 {
42860 }
42864 }
42867 /* OpenMP 2.5:
42868 # pragma omp flush flush-vars[opt] new-line
42870 flush-vars:
42871 ( variable-list )
42873 OpenMP 5.0:
42874 # pragma omp flush memory-order-clause new-line */
42876 static void
42878 {
42884 {
42895 else
42897 "expected %<seq_cst%>, %<acq_rel%>, %<release%> or "
42900 }
42902 {
42905 "%<flush%> list specified together with memory order "
42908 }
42912 }
42914 /* Helper function, to parse omp for increment expression. */
42916 static tree
42918 {
42923 {
42926 }
42929 {
42941 }
42943 /* If decl is an iterator, preserve LHS and RHS of the relational
42944 expr until finish_omp_for. */
42955 }
42957 /* Helper function, to parse omp for increment expression. */
42959 static tree
42961 {
42965 cp_id_kind idk;
42969 {
42978 }
42987 {
42992 }
42999 {
43003 }
43016 do
43017 {
43024 {
43026 {
43029 else
43032 }
43033 else
43038 }
43039 }
43043 {
43049 }
43050 else
43054 }
43056 /* Parse the initialization statement of an OpenMP for loop.
43058 Return true if the resulting construct should have an
43059 OMP_CLAUSE_PRIVATE added to it. */
43061 static tree
43069 {
43075 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
43077 init-expr:
43078 var = lb
43079 integer-type var = lb
43080 random-access-iterator-type var = lb
43081 pointer-type var = lb
43082 */
43083 cp_decl_specifier_seq type_specifiers;
43085 /* First, try to parse as an initialized declaration. See
43086 cp_parser_condition, from whence the bulk of this is copied. */
43094 {
43095 /* If parsing a type specifier seq succeeded, then this
43096 MUST be a initialized declaration. */
43101 CP_PARSER_DECLARATOR_NAMED,
43102 CP_PARSER_FLAGS_NONE,
43114 else
43115 {
43125 {
43127 CPP_OPEN_PAREN))
43130 else
43131 /* Trigger an error. */
43136 }
43140 {
43148 {
43151 auto_node);
43156 }
43159 asm_specification,
43160 LOOKUP_ONLYCONVERTING);
43163 {
43166 }
43167 else
43168 {
43171 {
43173 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
43175 {
43179 {
43183 }
43185 }
43187 {
43192 }
43193 }
43194 }
43196 }
43197 else
43198 {
43199 /* Consume '='. */
43203 non_class:
43206 else
43209 asm_specification,
43210 LOOKUP_ONLYCONVERTING);
43211 }
43215 }
43216 }
43217 else
43218 {
43219 cp_id_kind idk;
43220 /* If parsing a type specifier sequence failed, then
43221 this MUST be a simple expression. */
43227 && decl
43230 {
43241 {
43246 }
43251 }
43253 && decl
43256 {
43257 tree rhs;
43266 tf_warning_or_error));
43269 }
43270 else
43271 {
43276 {
43280 }
43281 }
43282 }
43284 }
43286 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
43288 void
43292 {
43298 {
43302 /* do_auto_deduction doesn't mess with template init-lists. */
43304 {
43309 {
43314 {
43318 }
43319 }
43321 }
43328 }
43333 /* If an error happened previously do nothing or else a lot of
43334 unhelpful errors would be issued. */
43336 else
43337 {
43338 tree range_temp;
43342 /* Can't bind a reference to an array of runtime bound. */
43344 else
43345 {
43351 LOOKUP_ONLYCONVERTING);
43354 }
43357 }
43368 LOOKUP_ONLYCONVERTING);
43370 /* The new for initialization statement. */
43378 else
43379 {
43382 }
43385 LOOKUP_ONLYCONVERTING);
43387 /* The new for condition. */
43390 else
43396 /* The new increment expression. */
43399 else
43402 tf_warning_or_error);
43407 {
43410 }
43415 {
43420 {
43425 }
43426 }
43430 {
43434 {
43438 {
43444 }
43445 }
43446 }
43455 {
43457 {
43458 /* If cp_finish_decomp was called with processing_template_decl
43459 temporarily set to 1, then decomp names will have deduced
43460 name but the DECL_VALUE_EXPR will be dependent. Hide those
43461 from folding of other loop initializers e.g. for warning
43462 purposes until cp_finish_omp_range_for. */
43467 }
43470 }
43472 }
43474 /* Helper for cp_parser_omp_for_loop, finalize part of range for
43475 inside of the collapsed body. */
43477 void
43479 {
43487 {
43491 {
43492 /* Undo temporary clearing of DECL_HAS_VALUE_EXPR_P done
43493 by cp_convert_omp_range_for above. */
43497 {
43501 }
43502 }
43504 }
43506 /* The declaration is initialized with *__begin inside the loop body. */
43511 LOOKUP_ONLYCONVERTING);
43514 }
43516 /* Return true if next tokens contain a standard attribute that contains
43517 omp::directive (DIRECTIVE). */
43519 static bool
43522 {
43530 {
43537 }
43542 location_t last_loc
43551 {
43553 {
43557 cnt++;
43561 {
43565 }
43566 }
43567 }
43569 {
43572 }
43574 {
43576 "%<[[omp::directive(%s)]]%> must be the only specified "
43580 }
43585 }
43587 /* Parse an OpenMP structured block sequence. KIND is the corresponding
43588 separating directive. */
43590 static tree
43593 {
43599 {
43612 kind == PRAGMA_OMP_SCAN
43617 }
43621 }
43624 /* OpenMP 5.0:
43626 scan-loop-body:
43627 { structured-block scan-directive structured-block } */
43629 static void
43631 {
43635 matching_braces braces;
43642 else
43643 {
43647 }
43653 {
43663 {
43670 }
43672 {
43675 }
43676 else
43681 }
43682 else
43688 else
43689 {
43694 }
43696 clauses);
43700 }
43702 /* Parse the restricted form of the for statement allowed by OpenMP. */
43704 static tree
43707 {
43709 tree orig_decl;
43712 location_t loc_first;
43715 releasing_vec for_block;
43724 {
43727 }
43730 {
43733 }
43740 {
43746 }
43760 {
43763 location_t loc;
43766 {
43770 }
43773 /* Don't create location wrapper nodes within an OpenMP "for"
43774 statement. */
43775 auto_suppress_location_wrappers sentinel;
43777 matching_parens parens;
43785 {
43786 /* Save tokens so that we can put them back. */
43789 /* Look for ':' that is not nested in () or {}. */
43790 bool is_range_for
43793 CPP_COLON,
43794 /*consume_paren=*/
43797 /* Roll back the tokens we skipped. */
43801 {
43802 bool saved_colon_corrects_to_scope_p
43805 /* A colon is used in range-based for. */
43808 /* Parse the declaration. */
43810 /*function_definition_allowed_p=*/
43812 parser->colon_corrects_to_scope_p
43824 {
43826 {
43832 }
43833 else
43835 }
43839 "%<ordered%> clause with parameter on "
43843 }
43844 }
43846 add_private_clause
43852 {
43855 {
43861 }
43862 else
43864 }
43872 {
43877 {
43881 }
43884 {
43885 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
43889 {
43892 }
43893 else
43894 {
43897 }
43899 }
43900 else
43901 {
43906 }
43907 }
43910 {
43911 tree c;
43913 {
43922 decl);
43927 decl);
43928 }
43930 {
43935 else
43940 {
43943 /* For linear, signal that we need to fill up
43944 the so far unknown linear step. */
43947 }
43948 }
43949 }
43958 {
43959 /* If decl is an iterator, preserve the operator on decl
43960 until finish_omp_for. */
43962 && ((processing_template_decl
43967 else
43970 }
43972 parse_close_paren:
43983 {
43986 }
43988 {
43992 }
43999 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
44000 in between the collapsed for loops to be still considered perfectly
44001 nested. Hopefully the final version clarifies this.
44002 For now handle (multiple) {'s and empty statements. */
44005 {
44009 {
44011 bracecount++;
44012 }
44016 else
44017 {
44024 }
44025 }
44028 {
44031 }
44032 }
44037 /* Note that we saved the original contents of this flag when we entered
44038 the structured block, and so we don't need to re-save it here. */
44041 /* Note that the grammar doesn't call for a structured block here,
44042 though the loop as a whole is a structured block. */
44044 {
44050 }
44051 else
44055 else
44059 else
44064 else
44069 {
44071 {
44073 nbraces--;
44074 }
44077 else
44078 {
44080 {
44083 }
44088 }
44089 }
44092 {
44096 else
44098 }
44101 }
44103 /* Helper function for OpenMP parsing, split clauses and call
44104 finish_omp_clauses on each of the set of clauses afterwards. */
44106 static void
44109 {
44115 i == C_OMP_CLAUSE_SPLIT_TARGET
44117 }
44119 /* OpenMP 5.0:
44120 #pragma omp loop loop-clause[optseq] new-line
44121 for-loop */
44123 #define OMP_LOOP_CLAUSE_MASK \
44124 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
44129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44131 static tree
44135 {
44146 {
44149 }
44161 }
44163 /* OpenMP 4.0:
44164 #pragma omp simd simd-clause[optseq] new-line
44165 for-loop */
44167 #define OMP_SIMD_CLAUSE_MASK \
44168 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
44169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
44170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
44172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
44178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44180 static tree
44184 {
44195 {
44198 }
44210 }
44212 /* OpenMP 2.5:
44213 #pragma omp for for-clause[optseq] new-line
44214 for-loop
44216 OpenMP 4.0:
44217 #pragma omp for simd for-simd-clause[optseq] new-line
44218 for-loop */
44220 #define OMP_FOR_CLAUSE_MASK \
44221 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
44225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
44227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
44228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
44229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44233 static tree
44237 {
44244 /* parallel for{, simd} disallows nowait clause, but for
44245 target {teams distribute ,}parallel for{, simd} it should be accepted. */
44248 /* Composite distribute parallel for{, simd} disallows ordered clause. */
44253 {
44258 {
44282 }
44283 }
44285 {
44288 }
44290 /* Composite distribute parallel for disallows linear clause. */
44297 {
44300 }
44312 }
44317 /* OpenMP 2.5:
44318 # pragma omp master new-line
44319 structured-block */
44321 static tree
44325 {
44333 {
44338 {
44358 }
44359 }
44361 {
44364 }
44367 {
44371 }
44372 else
44377 }
44379 /* OpenMP 5.1:
44380 # pragma omp masked masked-clauses new-line
44381 structured-block */
44383 #define OMP_MASKED_CLAUSE_MASK \
44384 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FILTER)
44386 static tree
44390 {
44399 {
44404 {
44425 }
44426 }
44428 {
44431 }
44436 {
44439 }
44443 clauses);
44444 }
44446 /* OpenMP 2.5:
44447 # pragma omp ordered new-line
44448 structured-block
44450 OpenMP 4.5:
44451 # pragma omp ordered ordered-clauses new-line
44452 structured-block */
44454 #define OMP_ORDERED_CLAUSE_MASK \
44455 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
44456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
44458 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
44459 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DOACROSS))
44462 static bool
44465 {
44473 {
44478 {
44480 {
44483 }
44485 {
44487 "%qs clause may only be used in compound "
44491 }
44492 tree clauses
44494 OMP_ORDERED_DEPEND_CLAUSE_MASK,
44498 }
44499 }
44501 tree clauses
44512 }
44514 /* OpenMP 2.5:
44516 section-scope:
44517 { section-sequence }
44519 section-sequence:
44520 section-directive[opt] structured-block
44521 section-sequence section-directive structured-block */
44523 static tree
44525 {
44530 matching_braces braces;
44537 != PRAGMA_OMP_SECTION
44539 {
44541 PRAGMA_OMP_SECTION);
44544 }
44547 {
44557 {
44561 }
44563 {
44566 }
44569 PRAGMA_OMP_SECTION);
44572 }
44583 }
44585 /* OpenMP 2.5:
44586 # pragma omp sections sections-clause[optseq] newline
44587 sections-scope */
44589 #define OMP_SECTIONS_CLAUSE_MASK \
44590 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44597 static tree
44600 {
44612 {
44615 }
44622 }
44624 /* OpenMP 2.5:
44625 # pragma omp parallel parallel-clause[optseq] new-line
44626 structured-block
44627 # pragma omp parallel for parallel-for-clause[optseq] new-line
44628 structured-block
44629 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
44630 structured-block
44632 OpenMP 4.0:
44633 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
44634 structured-block */
44636 #define OMP_PARALLEL_CLAUSE_MASK \
44637 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
44641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
44642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
44643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
44645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
44648 static tree
44652 {
44659 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
44665 {
44673 if_p);
44677 if_p);
44680 block);
44685 }
44686 /* When combined with distribute, parallel has to be followed by for.
44687 #pragma omp target parallel is allowed though. */
44691 {
44695 }
44697 {
44701 {
44715 block);
44718 /* masked does have just filter clause, but during gimplification
44719 isn't represented by a gimplification omp context, so for
44720 #pragma omp parallel masked don't set OMP_PARALLEL_COMBINED,
44721 so that
44722 #pragma omp parallel masked
44723 #pragma omp taskloop simd lastprivate (x)
44724 isn't confused with
44725 #pragma omp parallel masked taskloop simd lastprivate (x) */
44729 }
44731 {
44745 block);
44748 /* master doesn't have any clauses and during gimplification
44749 isn't represented by a gimplification omp context, so for
44750 #pragma omp parallel master don't set OMP_PARALLEL_COMBINED,
44751 so that
44752 #pragma omp parallel master
44753 #pragma omp taskloop simd lastprivate (x)
44754 isn't confused with
44755 #pragma omp parallel master taskloop simd lastprivate (x) */
44759 }
44761 {
44776 block);
44781 }
44783 {
44786 }
44788 {
44798 block);
44801 }
44802 }
44804 {
44807 }
44812 {
44815 }
44824 }
44826 /* OpenMP 2.5:
44827 # pragma omp single single-clause[optseq] new-line
44828 structured-block */
44830 #define OMP_SINGLE_CLAUSE_MASK \
44831 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
44834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44837 static tree
44839 {
44850 }
44852 /* OpenMP 5.1:
44853 # pragma omp scope scope-clause[optseq] new-line
44854 structured-block */
44856 #define OMP_SCOPE_CLAUSE_MASK \
44857 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44863 static tree
44865 {
44876 }
44878 /* OpenMP 3.0:
44879 # pragma omp task task-clause[optseq] new-line
44880 structured-block */
44882 #define OMP_TASK_CLAUSE_MASK \
44883 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
44885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
44886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
44889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
44890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
44891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
44893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
44895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DETACH) \
44896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_AFFINITY))
44898 static tree
44900 {
44912 }
44914 /* OpenMP 3.0:
44915 # pragma omp taskwait new-line
44917 OpenMP 5.0:
44918 # pragma omp taskwait taskwait-clause[opt] new-line */
44920 #define OMP_TASKWAIT_CLAUSE_MASK \
44921 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44924 static void
44926 {
44927 tree clauses
44932 {
44939 }
44940 else
44942 }
44944 /* OpenMP 3.1:
44945 # pragma omp taskyield new-line */
44947 static void
44949 {
44952 }
44954 /* OpenMP 4.0:
44955 # pragma omp taskgroup new-line
44956 structured-block
44958 OpenMP 5.0:
44959 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
44961 #define OMP_TASKGROUP_CLAUSE_MASK \
44962 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
44965 static tree
44967 {
44968 tree clauses
44973 if_p),
44974 clauses);
44975 }
44978 /* OpenMP 2.5:
44979 # pragma omp threadprivate (variable-list) */
44981 static void
44983 {
44984 tree vars;
44990 }
44992 /* OpenMP 4.0:
44993 # pragma omp cancel cancel-clause[optseq] new-line */
44995 #define OMP_CANCEL_CLAUSE_MASK \
44996 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
44997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
44998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
44999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
45000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
45002 static void
45004 {
45008 }
45010 /* OpenMP 4.0:
45011 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
45013 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
45014 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
45015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
45016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
45017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
45019 static bool
45022 {
45023 tree clauses;
45027 {
45032 {
45035 }
45036 }
45038 {
45042 }
45045 {
45050 else
45054 }
45057 OMP_CANCELLATION_POINT_CLAUSE_MASK,
45059 pragma_tok);
45062 }
45064 /* OpenMP 4.0:
45065 #pragma omp distribute distribute-clause[optseq] new-line
45066 for-loop */
45068 #define OMP_DISTRIBUTE_CLAUSE_MASK \
45069 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
45072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
45073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
45075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
45077 static tree
45081 {
45090 {
45098 else
45101 {
45107 {
45111 else
45114 }
45120 else
45134 }
45135 }
45137 {
45140 }
45145 {
45148 }
45160 }
45162 /* OpenMP 4.0:
45163 # pragma omp teams teams-clause[optseq] new-line
45164 structured-block */
45166 #define OMP_TEAMS_CLAUSE_MASK \
45167 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
45170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
45171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
45172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
45173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
45176 static tree
45180 {
45189 {
45193 {
45219 }
45221 {
45247 }
45248 }
45250 {
45253 }
45258 {
45261 }
45271 }
45273 /* OpenMP 4.0:
45274 # pragma omp target data target-data-clause[optseq] new-line
45275 structured-block */
45277 #define OMP_TARGET_DATA_CLAUSE_MASK \
45278 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
45282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
45284 static tree
45286 {
45288 omp_requires_mask
45291 tree clauses
45297 {
45300 {
45325 "%<#pragma omp target data%> with map-type other "
45326 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
45330 }
45335 }
45338 {
45341 "%<#pragma omp target data%> must contain at least "
45342 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
45345 }
45356 }
45358 /* OpenMP 4.5:
45359 # pragma omp target enter data target-enter-data-clause[optseq] new-line
45360 structured-block */
45362 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
45363 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45369 static bool
45372 {
45375 {
45380 {
45383 }
45384 }
45386 {
45390 }
45393 {
45399 }
45402 omp_requires_mask
45405 tree clauses
45411 {
45414 {
45447 "%<#pragma omp target enter data%> with map-type other "
45451 }
45453 }
45456 {
45459 "%<#pragma omp target enter data%> must contain at least "
45462 }
45470 }
45472 /* OpenMP 4.5:
45473 # pragma omp target exit data target-enter-data-clause[optseq] new-line
45474 structured-block */
45476 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
45477 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45483 static bool
45486 {
45489 {
45494 {
45497 }
45498 }
45500 {
45504 }
45507 {
45513 }
45516 omp_requires_mask
45519 tree clauses
45525 {
45528 {
45561 "%<#pragma omp target exit data%> with map-type other "
45562 "than %<from%>, %<tofrom%>, %<release%> or %<delete%> "
45566 }
45568 }
45571 {
45574 "%<#pragma omp target exit data%> must contain at least "
45577 }
45585 }
45587 /* OpenMP 4.0:
45588 # pragma omp target update target-update-clause[optseq] new-line */
45590 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
45591 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
45592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
45593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45598 static bool
45601 {
45603 {
45609 }
45611 tree clauses
45616 {
45618 "%<#pragma omp target update%> must contain at least one "
45621 }
45624 omp_requires_mask
45633 }
45635 /* OpenMP 4.0:
45636 # pragma omp target target-clause[optseq] new-line
45637 structured-block */
45639 #define OMP_TARGET_CLAUSE_MASK \
45640 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
45645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
45648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
45650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
45651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR)\
45652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HAS_DEVICE_ADDR))
45654 static bool
45657 {
45659 omp_requires_mask
45663 {
45675 {
45683 {
45684 tree stmt;
45686 {
45689 OMP_TARGET_CLAUSE_MASK,
45694 OMP_TARGET_CLAUSE_MASK,
45699 OMP_TARGET_CLAUSE_MASK,
45704 }
45706 }
45711 {
45715 if_p);
45720 if_p);
45725 if_p);
45729 }
45735 /* For combined target teams, ensure the num_teams and
45736 thread_limit clause expressions are evaluated on the host,
45737 before entering the target construct. */
45746 {
45749 tf_none);
45756 OMP_CLAUSE_FIRSTPRIVATE);
45761 }
45766 }
45768 {
45771 }
45773 {
45777 }
45779 {
45782 }
45784 {
45787 }
45789 {
45792 }
45793 }
45795 {
45798 }
45805 {
45811 }
45820 }
45822 /* OpenACC 2.0:
45823 # pragma acc cache (variable-list) new-line
45824 */
45826 static tree
45828 {
45829 /* Don't create location wrapper nodes within 'OMP_CLAUSE__CACHE_'
45830 clauses. */
45831 auto_suppress_location_wrappers sentinel;
45847 }
45849 /* OpenACC 2.0:
45850 # pragma acc data oacc-data-clause[optseq] new-line
45851 structured-block */
45853 #define OACC_DATA_CLAUSE_MASK \
45854 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
45860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
45863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
45865 static tree
45867 {
45880 }
45882 /* OpenACC 2.0:
45883 # pragma acc host_data <clauses> new-line
45884 structured-block */
45886 #define OACC_HOST_DATA_CLAUSE_MASK \
45887 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) \
45888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) )
45891 static tree
45893 {
45906 }
45908 /* OpenACC 2.0:
45909 # pragma acc declare oacc-data-clause[optseq] new-line
45910 */
45912 #define OACC_DECLARE_CLAUSE_MASK \
45913 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
45919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
45920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
45922 static tree
45924 {
45934 {
45938 }
45941 {
45945 {
45949 }
45952 {
45964 {
45966 "%qD must be a global variable in "
45968 decl);
45971 }
45976 {
45980 }
45982 {
45984 "invalid use of %<extern%> variable %qD "
45988 }
45990 {
45992 "invalid use of %<global%> variable %qD "
45996 }
45998 }
46001 /* This seems to ignore the existence of cleanup scopes?
46002 What is the meaning for local extern decls? The local
46003 extern is in this scope, but it is referring to a decl that
46004 is namespace scope. */
46007 {
46010 }
46012 {
46014 "%qD must be a variable declared in the same scope as "
46018 }
46023 {
46028 }
46031 {
46032 tree id;
46035 /* We need to mark the aliased decl, as that is the entity
46036 that is being referred to. This won't work for
46037 dependent variables, but it didn't work for them before
46038 DECL_LOCAL_DECL_P was a thing either. But then
46039 dependent local extern variable decls are as rare as
46040 hen's teeth. */
46047 else
46053 {
46056 {
46059 {
46063 }
46064 }
46065 }
46066 }
46067 }
46080 }
46082 /* OpenACC 2.0:
46083 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
46085 or
46087 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
46089 LOC is the location of the #pragma token.
46090 */
46092 #define OACC_ENTER_DATA_CLAUSE_MASK \
46093 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46100 #define OACC_EXIT_DATA_CLAUSE_MASK \
46101 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
46105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
46106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
46107 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46109 static tree
46112 {
46121 {
46126 }
46133 else
46138 {
46142 }
46150 }
46152 /* OpenACC 2.0:
46153 # pragma acc loop oacc-loop-clause[optseq] new-line
46154 structured-block */
46156 #define OACC_LOOP_CLAUSE_MASK \
46157 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
46158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
46161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
46162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
46163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
46164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
46165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
46166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
46168 static tree
46171 {
46180 {
46186 }
46195 }
46197 /* OpenACC 2.0:
46198 # pragma acc kernels oacc-kernels-clause[optseq] new-line
46199 structured-block
46201 or
46203 # pragma acc parallel oacc-parallel-clause[optseq] new-line
46204 structured-block
46206 OpenACC 2.6:
46208 # pragma acc serial oacc-serial-clause[optseq] new-line
46209 */
46211 #define OACC_KERNELS_CLAUSE_MASK \
46212 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46228 #define OACC_PARALLEL_CLAUSE_MASK \
46229 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
46241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
46242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
46246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46248 #define OACC_SERIAL_CLAUSE_MASK \
46249 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46250 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
46251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
46252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
46253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
46254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
46255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
46256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
46257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
46259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
46260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
46261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
46262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
46263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
46265 static tree
46268 {
46269 omp_clause_mask mask;
46272 {
46290 }
46293 {
46297 {
46300 tree clauses;
46305 }
46306 }
46315 }
46317 /* OpenACC 2.0:
46318 # pragma acc update oacc-update-clause[optseq] new-line
46319 */
46321 #define OACC_UPDATE_CLAUSE_MASK \
46322 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
46323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
46324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
46325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
46326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
46327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
46329 static tree
46331 {
46338 {
46340 "%<#pragma acc update%> must contain at least one "
46343 }
46351 }
46353 /* OpenACC 2.0:
46354 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
46356 LOC is the location of the #pragma token.
46357 */
46359 #define OACC_WAIT_CLAUSE_MASK \
46360 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
46362 static tree
46364 {
46378 }
46380 /* OpenMP 4.0:
46381 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
46383 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
46384 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
46385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
46386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
46387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
46388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
46389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
46391 static void
46395 {
46397 cp_omp_declare_simd_data data;
46399 {
46407 /* It is safe to take the address of a local variable; it will only be
46408 used while this scope is live. */
46410 }
46412 {
46414 "%<#pragma omp declare %s%> followed by "
46419 }
46421 /* Store away all pragma tokens. */
46430 {
46434 {
46447 }
46452 "%<#pragma omp declare %s%> not immediately followed by "
46457 }
46458 }
46470 /* OpenMP 5.0:
46472 trait-selector:
46473 trait-selector-name[([trait-score:]trait-property[,trait-property[,...]])]
46475 trait-score:
46476 score(score-expression) */
46478 static tree
46480 {
46482 do
46483 {
46484 tree selector;
46488 else
46489 {
46492 }
46503 {
46530 }
46532 {
46534 {
46536 {
46539 }
46540 else
46541 {
46547 }
46548 }
46553 }
46563 {
46565 {
46569 }
46571 matching_parens parens;
46579 {
46586 {
46590 matching_parens parens2;
46598 {
46610 else
46613 }
46614 }
46615 else
46619 }
46622 {
46623 tree t;
46625 do
46626 {
46629 {
46637 "constant integer expression or string "
46639 else
46641 }
46642 else
46647 else
46649 }
46655 {
46659 }
46660 else
46661 {
46664 }
46667 do
46668 {
46672 {
46675 }
46680 else
46681 {
46685 }
46691 else
46693 }
46699 {
46706 else
46708 }
46709 else
46714 {
46716 "selector may not be specified in "
46719 }
46720 properties
46722 OMP_DECLARE_SIMD_CLAUSE_MASK,
46727 }
46733 }
46737 {
46740 }
46746 else
46748 }
46752 }
46754 /* OpenMP 5.0:
46756 trait-set-selector[,trait-set-selector[,...]]
46758 trait-set-selector:
46759 trait-set-selector-name = { trait-selector[, trait-selector[, ...]] }
46761 trait-set-selector-name:
46762 constructor
46763 device
46764 implementation
46765 user */
46767 static tree
46770 {
46772 do
46773 {
46776 setp
46779 {
46798 }
46800 {
46804 }
46812 matching_braces braces;
46816 tree selectors
46819 {
46822 }
46830 else
46832 }
46838 }
46840 /* Assumption clauses:
46841 OpenMP 5.1
46842 absent (directive-name-list)
46843 contains (directive-name-list)
46844 holds (expression)
46845 no_openmp
46846 no_openmp_routines
46847 no_parallelism */
46849 static void
46852 {
46867 {
46880 {
46885 }
46887 {
46892 }
46894 {
46899 }
46901 {
46903 matching_parens parens;
46905 {
46917 }
46918 }
46920 {
46922 matching_parens parens;
46924 {
46925 do
46926 {
46929 location_t dloc
46932 {
46933 tree id;
46938 CPP_KEYWORD))
46939 {
46940 enum rid rid
46944 }
46945 else
46948 }
46951 else
46952 {
46965 else
46966 {
46971 "mentioned in both %<absent%> and "
46979 ? &absent_head
46982 "mentioned multiple times in %qs "
46989 }
46992 }
46995 else
46997 }
47004 }
47005 }
47007 {
47014 }
47015 else
47016 {
47020 }
47021 }
47023 }
47025 /* OpenMP 5.1
47026 # pragma omp assume clauses[optseq] new-line */
47028 static void
47030 {
47033 }
47035 /* OpenMP 5.1
47036 # pragma omp assumes clauses[optseq] new-line */
47038 static bool
47040 {
47043 }
47045 /* Finalize #pragma omp declare variant after a fndecl has been parsed, and put
47046 that into "omp declare variant base" attribute. */
47048 static tree
47050 tree attrs)
47051 {
47052 matching_parens parens;
47054 {
47055 fail:
47058 }
47063 cp_expr varid
47071 tree variant;
47078 else
47079 {
47080 tree ambiguous_decls;
47088 }
47092 {
47094 variant
47102 }
47117 {
47120 }
47132 {
47134 match_loc);
47143 }
47148 }
47151 /* Finalize #pragma omp declare simd clauses after direct declarator has
47152 been parsed, and put that into "omp declare simd" attribute. */
47154 static tree
47156 {
47162 {
47167 }
47172 {
47183 {
47186 pragma_tok);
47194 }
47195 else
47196 {
47198 attrs
47200 }
47202 }
47206 {
47212 {
47214 {
47221 {
47229 else
47232 }
47238 {
47240 "unknown OpenMP directive name in "
47243 }
47247 {
47249 "OpenMP directive other than %<declare simd%> "
47250 "or %<declare variant%> appertains to a "
47253 }
47256 {
47258 "mixing OpenMP directives with attribute and "
47261 }
47266 {
47269 }
47271 cp_token tok = {};
47279 tok = {};
47284 tok = {};
47296 /* Move the current source position to that of the first token
47297 in the new lexer. */
47307 {
47315 pragma_tok);
47319 cl);
47324 }
47325 else
47326 {
47328 attrs
47330 attrs);
47331 }
47334 }
47336 }
47337 else
47339 }
47345 }
47347 /* Helper for cp_parser_omp_declare_target, handle one to or link clause
47348 on #pragma omp declare target. Return false if errors were reported. */
47350 static bool
47352 {
47355 tree id;
47357 {
47360 }
47361 else
47364 {
47367 "%qD specified both in declare target %<link%> and %qs"
47369 else
47371 "%qD specified both in declare target %<link%> and "
47374 }
47376 {
47383 {
47386 {
47390 }
47391 }
47392 }
47396 {
47400 {
47403 }
47404 }
47406 {
47410 {
47413 }
47414 }
47416 }
47418 /* OpenMP 4.0:
47419 # pragma omp declare target new-line
47420 declarations and definitions
47421 # pragma omp end declare target new-line
47423 OpenMP 4.5:
47424 # pragma omp declare target ( extended-list ) new-line
47426 # pragma omp declare target declare-target-clauses[seq] new-line */
47428 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
47429 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
47430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ENTER) \
47431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
47432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE))
47434 static void
47436 {
47443 clauses
47447 {
47449 clauses);
47452 }
47453 else
47454 {
47455 cp_omp_declare_target_attr a
47460 }
47465 {
47478 device_type);
47479 }
47483 }
47485 /* OpenMP 5.1
47486 # pragma omp begin assumes clauses[optseq] new-line
47488 # pragma omp begin declare target clauses[optseq] new-line */
47490 #define OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK \
47491 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE)
47493 static void
47495 {
47499 {
47502 }
47504 {
47508 {
47511 }
47513 {
47515 tree clauses
47517 OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK,
47519 pragma_tok);
47524 cp_omp_declare_target_attr a
47527 }
47528 else
47529 {
47532 }
47533 }
47535 {
47540 }
47541 else
47542 {
47545 }
47546 }
47548 /* OpenMP 4.0:
47549 # pragma omp end declare target new-line
47551 OpenMP 5.1:
47552 # pragma omp end assumes new-line */
47554 static void
47556 {
47560 {
47563 }
47565 {
47569 {
47572 }
47575 else
47576 {
47580 }
47584 "%<#pragma omp end declare target%> without corresponding "
47585 "%<#pragma omp declare target%> or "
47587 else
47588 {
47589 cp_omp_declare_target_attr
47592 {
47595 "%qs in attribute syntax terminated "
47600 else
47602 "%qs in pragma syntax terminated "
47607 }
47608 }
47609 }
47611 {
47618 else
47619 {
47620 cp_omp_begin_assumes_data
47623 {
47626 "%qs in attribute syntax terminated "
47629 else
47631 "%qs in pragma syntax terminated "
47634 }
47635 }
47636 }
47637 else
47638 {
47642 }
47643 }
47645 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
47646 expression and optional initializer clause of
47647 #pragma omp declare reduction. We store the expression(s) as
47648 either 3, 6 or 7 special statements inside of the artificial function's
47649 body. The first two statements are DECL_EXPRs for the artificial
47650 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
47651 expression that uses those variables.
47652 If there was any INITIALIZER clause, this is followed by further statements,
47653 the fourth and fifth statements are DECL_EXPRs for the artificial
47654 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
47655 constructor variant (first token after open paren is not omp_priv),
47656 then the sixth statement is a statement with the function call expression
47657 that uses the OMP_PRIV and optionally OMP_ORIG variable.
47658 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
47659 to initialize the OMP_PRIV artificial variable and there is seventh
47660 statement, a DECL_EXPR of the OMP_PRIV statement again. */
47662 static bool
47664 {
47676 tree combiner;
47697 {
47700 }
47703 {
47705 matching_parens parens;
47711 {
47714 }
47730 {
47734 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
47738 == CPP_CLOSE_PAREN
47741 {
47745 }
47750 }
47751 else
47752 {
47754 /* Don't create location wrapper nodes here. */
47755 auto_suppress_location_wrappers sentinel;
47770 {
47775 }
47777 tree arg;
47790 }
47803 }
47807 UNKNOWN_LOCATION);
47810 }
47812 /* OpenMP 4.0
47813 #pragma omp declare reduction (reduction-id : typename-list : expression) \
47814 initializer-clause[opt] new-line
47816 initializer-clause:
47817 initializer (omp_priv initializer)
47818 initializer (function-name (argument-list)) */
47820 static void
47823 {
47833 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
47840 {
47872 }
47884 /* Types may not be defined in declare reduction type list. */
47887 parser->type_definition_forbidden_message
47893 saved_colon_doesnt_start_class_def_p
47898 {
47902 ;
47920 else
47925 else
47927 }
47929 /* Restore the saved message. */
47932 parser->colon_doesnt_start_class_def_p
47937 {
47938 fail:
47941 }
47947 {
47948 tree fntype
47951 NULL_TREE);
47968 {
47972 }
47978 {
47981 }
47983 {
47985 {
47991 }
47998 }
47999 else
48000 {
48003 /* We should never meet a matched duplicate decl. */
48005 }
48010 else
48013 {
48016 }
48024 else
48025 {
48029 }
48034 {
48042 }
48050 }
48054 done:
48055 /* Free any declarators allocated. */
48057 }
48059 /* OpenMP 4.0
48060 #pragma omp declare simd declare-simd-clauses[optseq] new-line
48061 #pragma omp declare reduction (reduction-id : typename-list : expression) \
48062 initializer-clause[opt] new-line
48063 #pragma omp declare target new-line
48065 OpenMP 5.0
48066 #pragma omp declare variant (identifier) match (context-selector) */
48068 static bool
48071 {
48073 {
48078 {
48083 }
48085 {
48090 }
48093 {
48096 context);
48098 }
48100 {
48103 }
48105 {
48109 }
48110 }
48115 }
48117 /* OpenMP 5.0
48118 #pragma omp requires clauses[optseq] new-line */
48120 static bool
48122 {
48127 {
48133 {
48148 {
48151 matching_parens parens;
48153 {
48155 {
48160 this_req
48163 this_req
48166 this_req
48168 }
48170 {
48172 "expected %<seq_cst%>, %<relaxed%> or "
48175 {
48182 CPP_CLOSE_PAREN))
48185 }
48186 }
48187 else
48194 /*consume_paren=*/
48198 {
48201 }
48202 }
48204 }
48205 else
48206 {
48208 "%<unified_shared_memory%>, "
48209 "%<dynamic_allocators%>, "
48210 "%<reverse_offload%> "
48214 }
48218 {
48220 {
48227 }
48229 {
48233 }
48236 {
48239 this_req
48241 (omp_requires_mask
48243 }
48247 "lexically after first %<atomic%> construct "
48250 omp_requires_mask
48253 }
48254 }
48256 }
48262 }
48265 /* OpenMP 5.1:
48266 #pragma omp nothing new-line */
48268 static void
48270 {
48272 }
48275 /* OpenMP 5.1
48276 #pragma omp error clauses[optseq] new-line */
48278 static bool
48281 {
48289 {
48302 };
48310 {
48313 }
48315 {
48320 }
48324 matching_parens parens;
48326 {
48328 {
48332 else
48334 tf_warning_or_error,
48335 LOOKUP_NORMAL);
48336 }
48337 else
48338 {
48340 {
48348 }
48350 {
48355 {
48362 CPP_CLOSE_PAREN))
48365 }
48366 }
48367 else
48369 }
48375 /*consume_paren=*/
48379 {
48381 {
48384 }
48385 else
48387 }
48389 {
48391 {
48394 }
48395 else
48397 }
48398 }
48399 else
48401 }
48411 {
48413 {
48417 }
48418 tree fndecl
48427 }
48434 {
48438 }
48442 else
48446 }
48448 /* OpenMP 4.5:
48449 #pragma omp taskloop taskloop-clause[optseq] new-line
48450 for-loop
48452 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
48453 for-loop */
48455 #define OMP_TASKLOOP_CLAUSE_MASK \
48456 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
48457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
48458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
48459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
48460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
48461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
48462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
48463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
48464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
48465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
48466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
48467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
48468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
48469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
48470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
48471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
48472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
48474 static tree
48478 {
48485 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
48486 clause. */
48491 {
48496 {
48520 }
48521 }
48523 {
48526 }
48531 {
48534 }
48541 if_p);
48547 }
48550 /* OpenACC 2.0:
48551 # pragma acc routine oacc-routine-clause[optseq] new-line
48552 function-definition
48554 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
48555 */
48557 #define OACC_ROUTINE_CLAUSE_MASK \
48558 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
48559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
48560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
48561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
48562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NOHOST) )
48564 /* Parse the OpenACC routine pragma. This has an optional '( name )'
48565 component, which must resolve to a declared namespace-scope
48566 function. The clauses are either processed directly (for a named
48567 function), or defered until the immediatley following declaration
48568 is parsed. */
48570 static void
48573 {
48575 /* The checking for "another pragma following this one" in the "no optional
48576 '( name )'" case makes sure that we dont re-enter. */
48579 cp_oacc_routine_data data;
48585 /* It is safe to take the address of a local variable; it will only be
48586 used while this scope is live. */
48589 /* Look for optional '( name )'. */
48591 {
48592 matching_parens parens;
48595 /* We parse the name as an id-expression. If it resolves to
48596 anything other than a non-overloaded function at namespace
48597 scope, it's an error. */
48613 {
48617 }
48619 data.clauses
48623 /* The clauses are in reverse order; fix that to make later diagnostic
48624 emission easier. */
48630 {
48635 }
48637 /* Perhaps we should use the same rule as declarations in different
48638 namespaces? */
48640 {
48645 }
48648 {
48652 }
48656 }
48658 {
48659 /* Store away all pragma tokens. */
48667 /* Emit a helpful diagnostic if there's another pragma following this
48668 one. */
48670 {
48673 /* ..., and then just keep going. */
48675 }
48677 /* We only have to consider the pragma_external case here. */
48682 else
48685 }
48686 }
48688 /* Finalize #pragma acc routine clauses after direct declarator has
48689 been parsed. */
48691 static tree
48693 {
48698 {
48700 "%<#pragma acc routine%> not immediately followed by "
48703 }
48719 /* The clauses are in reverse order; fix that to make later diagnostic
48720 emission easier. */
48723 /* Later, cp_finalize_oacc_routine will process the clauses. */
48727 }
48729 /* Apply any saved OpenACC routine clauses to a just-parsed
48730 declaration. */
48732 static void
48734 {
48736 {
48737 /* Keep going if we're in error reporting mode. */
48743 {
48745 {
48747 "%<#pragma acc routine%> not immediately followed by"
48751 }
48755 }
48757 int compatible
48762 {
48765 }
48767 {
48768 }
48769 else
48770 {
48772 {
48781 }
48783 /* Set the routine's level of parallelism. */
48787 /* Add an "omp declare target" attribute. */
48792 }
48793 }
48794 }
48796 /* Main entry point to OpenMP statement pragmas. */
48798 static void
48800 {
48801 tree stmt;
48806 {
48834 if_p);
48854 if_p);
48859 if_p);
48864 if_p);
48869 if_p);
48874 if_p);
48879 if_p);
48891 if_p);
48905 if_p);
48910 if_p);
48917 }
48920 }
48921 \f
48922 /* Transactional Memory parsing routines. */
48924 /* Parse a transaction attribute.
48926 txn-attribute:
48927 attribute
48928 [ [ identifier ] ]
48930 We use this instead of cp_parser_attributes_opt for transactions to avoid
48931 the pedwarn in C++98 mode. */
48933 static tree
48935 {
48950 {
48954 /* For keywords, use the canonical spelling,
48955 not the parsed identifier. */
48959 }
48960 else
48964 error1:
48967 }
48969 /* Parse a __transaction_atomic or __transaction_relaxed statement.
48971 transaction-statement:
48972 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
48973 compound-statement
48974 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
48975 */
48977 static tree
48979 {
48990 else
48991 {
48995 }
48997 /* Parse a noexcept specification. */
49001 {
49002 /* cancel-and-throw is unimplemented. */
49005 }
49006 else
49008 CP_PARSER_FLAGS_NONE,
49013 /* Keep track if we're in the lexical scope of an outer transaction. */
49025 }
49027 /* Parse a __transaction_atomic or __transaction_relaxed expression.
49029 transaction-expression:
49030 __transaction_atomic txn-noexcept-spec[opt] ( expression )
49031 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
49032 */
49034 static tree
49036 {
49049 keyword == RID_TRANSACTION_RELAXED
49063 /* Set this early. This might mean that we allow transaction_cancel in
49064 an expression that we find out later actually has to be a constexpr.
49065 However, we expect that cxx_constant_value will be able to deal with
49066 this; also, if the noexcept has no constexpr, then what we parse next
49067 really is a transaction's body. */
49070 /* Parse a noexcept specification. */
49072 CP_PARSER_FLAGS_NONE,
49079 {
49080 matching_parens parens;
49087 }
49088 else
49089 {
49090 /* The only expression that is available got parsed for the noexcept
49091 already. noexcept is true then. */
49094 }
49103 }
49105 /* Parse a function-transaction-block.
49107 function-transaction-block:
49108 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
49109 function-body
49110 __transaction_atomic txn-attribute[opt] function-try-block
49111 __transaction_relaxed ctor-initializer[opt] function-body
49112 __transaction_relaxed function-try-block
49113 */
49115 static void
49117 {
49132 else
49133 {
49137 }
49145 else
49146 cp_parser_ctor_initializer_opt_and_function_body
49152 }
49154 /* Parse a __transaction_cancel statement.
49156 cancel-statement:
49157 __transaction_cancel txn-attribute[opt] ;
49158 __transaction_cancel txn-attribute[opt] throw-expression ;
49160 ??? Cancel and throw is not yet implemented. */
49162 static tree
49164 {
49170 RT_TRANSACTION_CANCEL);
49177 /* ??? Parse cancel-and-throw here. */
49182 {
49186 }
49188 {
49192 }
49194 {
49197 {
49203 }
49204 }
49206 {
49210 }
49216 }
49217 \f
49219 /* Special handling for the first token or line in the file. The first
49220 thing in the file might be #pragma GCC pch_preprocess, which loads a
49221 PCH file, which is a GC collection point. So we need to handle this
49222 first pragma without benefit of an existing lexer structure.
49224 Always returns one token to the caller in *FIRST_TOKEN. This is
49225 either the true first token of the file, or the first token after
49226 the initial pragma. */
49228 static void
49230 {
49238 {
49242 }
49244 /* Skip to the end of the pragma. */
49246 {
49249 do
49252 }
49254 /* Now actually load the PCH file. */
49258 /* Read one more token to return to our caller. We have to do this
49259 after reading the PCH file in, since its pointers have to be
49260 live. */
49262 }
49264 /* Parse a pragma GCC ivdep. */
49266 static bool
49268 {
49271 }
49273 /* Parse a pragma GCC unroll. */
49275 static unsigned short
49277 {
49287 {
49289 " assignment-expression that evaluates to a non-negative"
49292 }
49293 else
49294 {
49298 }
49301 }
49303 /* Normal parsing of a pragma token. Here we can (and must) use the
49304 regular lexer. */
49306 static bool
49308 {
49311 tree stmt;
49322 {
49330 {
49341 }
49346 {
49357 }
49362 {
49373 }
49378 {
49390 }
49395 {
49407 }
49412 {
49424 }
49443 {
49449 }
49457 {
49463 }
49471 {
49476 }
49482 {
49488 }
49496 {
49502 }
49544 {
49546 "%<#pragma omp requires%> may only be used at file or "
49550 }
49555 {
49557 "%<#pragma omp assumes%> may only be used at file or "
49561 }
49597 "%<#pragma omp scan%> may only be used in "
49603 "%<#pragma omp section%> may only be used in "
49608 {
49610 {
49614 }
49620 {
49624 }
49625 else
49631 {
49634 }
49637 }
49640 {
49642 {
49646 }
49647 const unsigned short unroll
49653 {
49657 }
49658 else
49664 {
49667 }
49670 }
49677 bad_stmt:
49680 }
49684 }
49686 /* The interface the pragma parsers have to the lexer. */
49688 enum cpp_ttype
49690 {
49703 else
49704 {
49708 }
49711 }
49713 \f
49714 /* External interface. */
49716 /* Parse one entire translation unit. */
49718 void
49720 {
49728 /* cp_lexer_new_main is called before doing any GC allocation
49729 because tokenization might load a PCH file. */
49738 }
49740 /* Create an identifier for a generic parameter type (a synthesized
49741 template parameter implied by `auto' or a concept identifier). */
49744 static tree
49746 {
49750 }
49752 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
49753 (creating a new template parameter list if necessary). Returns the newly
49754 created template type parm. */
49756 static tree
49758 {
49759 /* A requires-clause is not a function and cannot have placeholders. */
49761 {
49764 }
49768 /* We are either continuing a function template that already contains implicit
49769 template parameters, creating a new fully-implicit function template, or
49770 extending an existing explicit function template with implicit template
49771 parameters. */
49779 {
49783 }
49784 else
49785 {
49786 /* Roll back to the existing template parameter scope (in the case of
49787 extending an explicit function template) or introduce a new template
49788 parameter scope ahead of the function parameter scope (or class scope
49789 in the case of out-of-line member definitions). The function scope is
49790 added back after template parameter synthesis below. */
49795 {
49798 }
49800 {
49801 /* If not defining a class, then any class scope is a scope level in
49802 an out-of-line member definition. In this case simply wind back
49803 beyond the first such scope to inject the template parameter list.
49804 Otherwise wind back to the class being defined. The latter can
49805 occur in class member friend declarations such as:
49807 class A {
49808 void foo (auto);
49809 };
49810 class B {
49811 friend void A::foo (auto);
49812 };
49814 The template parameter list synthesized for the friend declaration
49815 must be injected in the scope of 'B'. This can also occur in
49816 erroneous cases such as:
49818 struct A {
49819 struct B {
49820 void foo (auto);
49821 };
49822 void B::foo (auto) {}
49823 };
49825 Here the attempted definition of 'B::foo' within 'A' is ill-formed
49826 but, nevertheless, the template parameter list synthesized for the
49827 declarator should be injected into the scope of 'A' as if the
49828 ill-formed template was specified explicitly. */
49831 {
49834 }
49835 }
49841 {
49842 /* Introduce a new template parameter list for implicit template
49843 parameters. */
49847 parser->implicit_template_scope
49854 }
49855 else
49856 {
49857 /* Synthesize implicit template parameters at the end of the explicit
49858 template parameter list. */
49865 parser->implicit_template_parms
49867 }
49868 }
49870 /* Synthesize a new template parameter and track the current template
49871 parameter chain with implicit_template_parms. */
49877 /* Synthesize the type template parameter. */
49885 /* Attach the constraint to the parm before processing. */
49888 tree new_parm
49890 input_location,
49891 node,
49894 // Process_template_parm returns the list of parms, and
49895 // parser->implicit_template_parms holds the final node of the parm
49896 // list. We really want to manipulate the newly appended element.
49903 // Record the last implicit parm node
49906 /* Mark the synthetic declaration "virtual". This is used when
49907 comparing template-heads to determine if whether an abbreviated
49908 function template is equivalent to an explicit template.
49910 Note that DECL_ARTIFICIAL is used elsewhere for template
49911 parameters. */
49917 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
49920 /* If creating a fully implicit function template, start the new implicit
49921 template parameter list with this synthesized type, otherwise grow the
49922 current template parameter list. */
49925 {
49931 }
49932 else
49933 {
49938 }
49940 /* If the new parameter was constrained, we need to add that to the
49941 constraints in the template parameter list. */
49943 {
49947 }
49952 }
49954 /* Finish the declaration of a fully implicit function template. Such a
49955 template has no explicit template parameter list so has not been through the
49956 normal template head and tail processing. synthesize_implicit_template_parm
49957 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
49958 provided if the declaration is a class member such that its template
49959 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
49960 form is returned. Otherwise NULL_TREE is returned. */
49962 static tree
49964 {
49969 {
49973 }
49985 }
49987 /* Like finish_fully_implicit_template, but to be used in error
49988 recovery, rearranging scopes so that we restore the state we had
49989 before synthesize_implicit_template_parm inserted the implement
49990 template parms scope. */
49992 static void
49994 {
49999 {
50008 }
50009 else
50015 }
50017 /* Helper function for diagnostics that have complained about things
50018 being used with 'extern "C"' linkage.
50020 Attempt to issue a note showing where the 'extern "C"' linkage began. */
50022 void
50024 {
50028 }